2015
DOI: 10.1109/lsp.2015.2470519
|View full text |Cite
|
Sign up to set email alerts
|

An Optimum Architecture for Continuous-Flow Parallel Bit Reversal

Abstract: With the aim of minimizing memory and latency, this letter presents a novel bit-reversal architecture for continuous-flow parallel pipelined FFT processors. It harnesses the theory that any permutation can be decomposed to a series of elementary bit-exchanges. The main contribution of this letter are twofold.First, it achieves continuous-flow bit reversal in parallel with the minimum memory and minimum latency.Second, the architecture, composed of memory and 2-to-1 multiplexers, are simple and regular for gene… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 12 publications
(15 citation statements)
references
References 14 publications
0
15
0
Order By: Relevance
“…The proposed circuit includes a pp permutation and a sp one. It requires 8 delays, 8 multiplexers and has a latency of 1 clock cycle, which matches equations (9), (10) and (11).…”
Section: Proposed Bit Reversal Circuitsmentioning
confidence: 56%
See 4 more Smart Citations
“…The proposed circuit includes a pp permutation and a sp one. It requires 8 delays, 8 multiplexers and has a latency of 1 clock cycle, which matches equations (9), (10) and (11).…”
Section: Proposed Bit Reversal Circuitsmentioning
confidence: 56%
“…previous approaches based on delays use ss-pp-ss-pp [10] or ss-sp [11]. By contrast, the proposed approach uses memories and ss-pp for N > P 2 , and pp-sp for N ≤ P 2 .…”
Section: Comparisonmentioning
confidence: 97%
See 3 more Smart Citations