2006 IEEE Workshop on Signal Processing Systems Design and Implementation 2006
DOI: 10.1109/sips.2006.352556
|View full text |Cite
|
Sign up to set email alerts
|

Rapid IP Design of Variable-length Cached-FFT Processor for OFDM-based Communication Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2010
2010
2018
2018

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(2 citation statements)
references
References 8 publications
0
2
0
Order By: Relevance
“…Here we prove our discussion in Section 3, the pipeline architecture have a higher throughput but loss on power efficiency. The authors of [5,18,19] proposed memory based Application-Specific Integrated Circuit (ASIC) for scalable DFT engine. The proposed engine in [5] enables runtime configuration of the DFT length, where the supported lengths vary only from 16-points to 4096. while the proposed engine in [18] enables reconfigurable FFT Processor, the FFT lengths vary only from 128-points to 8192. and [19] can perform 64 2048-point FFT.…”
Section: Discussionmentioning
confidence: 99%
“…Here we prove our discussion in Section 3, the pipeline architecture have a higher throughput but loss on power efficiency. The authors of [5,18,19] proposed memory based Application-Specific Integrated Circuit (ASIC) for scalable DFT engine. The proposed engine in [5] enables runtime configuration of the DFT length, where the supported lengths vary only from 16-points to 4096. while the proposed engine in [18] enables reconfigurable FFT Processor, the FFT lengths vary only from 128-points to 8192. and [19] can perform 64 2048-point FFT.…”
Section: Discussionmentioning
confidence: 99%
“…According to IEEE 802.11n and 802.16e, 64-point up to 2048-point FFTs are used for different data rates. Previously, various FFT architectures and algorithms have been developed, such as a radix-2 bit-reversed algorithm with a memory-based structure [12], radix-n algorithms with a pipeline structure [13], a cached-FFT architecture [14], etc.…”
Section: Fft Optimizationmentioning
confidence: 99%