2010
DOI: 10.1109/tcsii.2010.2048373
|View full text |Cite
|
Sign up to set email alerts
|

A 2.4-GS/s FFT Processor for OFDM-Based WPAN Applications

Abstract: This brief presents a fast Fourier transform (FFT) processor that provides high throughput rate (T.R.) by applying the eight-data-path pipelined approach for wireless personal area network applications. The hardware costs, including the power consumption and area, increase due to multiple data paths and increased wordlength along stages. To resolve these issues, a novel simplification method to reduce the hardware cost in multiplication units of the multiple-path FFT approach is proposed. A multidata scaling s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 108 publications
(2 citation statements)
references
References 11 publications
0
2
0
Order By: Relevance
“…An SDF 128-point FFT processor was developed based on the radix-2 4 algorithm [30] and its performance was extended to four streams for evaluation. That which is compared deals with devices based on different technologies; therefore, the area was normalized [Equation (8)] based on the scheme in [27,33]. Although the GI duration is relatively short (e.g., 1/4 symbol duration) in timeliness considerations, the proposed FFT kernel could lend support to a throughput gain of (6/4) for the number of streams, only mainly needing additional memory elements for the two-stream data storage.…”
Section: Comparisonmentioning
confidence: 99%
“…An SDF 128-point FFT processor was developed based on the radix-2 4 algorithm [30] and its performance was extended to four streams for evaluation. That which is compared deals with devices based on different technologies; therefore, the area was normalized [Equation (8)] based on the scheme in [27,33]. Although the GI duration is relatively short (e.g., 1/4 symbol duration) in timeliness considerations, the proposed FFT kernel could lend support to a throughput gain of (6/4) for the number of streams, only mainly needing additional memory elements for the two-stream data storage.…”
Section: Comparisonmentioning
confidence: 99%
“…The memorybased architecture [3][4][5] provides a low-power solution; however, this approach suffers from long latency and may require additional buffer space for system synchronisation. The pipelined architecture including single-path delay feedback (SDF) pipeline FFT architecture [1,6] and multipath delay commutator (MDC) architecture [7][8][9], provides high throughputs, but it requires more hardware resources at the same time.…”
Section: Introductionmentioning
confidence: 99%