Low computation cycle and high speed recursive DFT/IDFT: VLSI algorithm and architecture
Lan-Da Van,Yuan-Chu Yu,Chun-Ming Huang,Chin-Teng Lin +3 more
- pp 579-584
Reads0
Chats0
TLDR
The proposed core-type recursive architecture achieves half computation-cycle reduction as well as less critical period compared with the conventional second-order DFT/IDFT architecture.Abstract:
In this paper, we propose two low-computation cycle and high-speed recursive discrete Fourier transform (DFT)/inverse DFT (IDFT) architectures adopting the hybrid of Chebyshev polynomial and register-splitting scheme. The proposed core-type recursive architecture achieves half computation-cycle reduction as well as less critical period compared with the conventional second-order DFT/IDFT architecture. So as to further reduce the number of computation cycles, based on the new core-type design, we develop the folded-type recursive DFT/IDFT architecture with the same operating frequency. Moreover, from the derivation results, the operation of DFT and IDFT can be performed with the same structure under different configurations.read more
Citations
More filters
Proceedings ArticleDOI
A low-power 64-point FFT/IFFT design for IEEE 802.11a WLAN application
TL;DR: A cost-effective and low-power 64-point fast Fourier transform (FFT)/inverse FFT (IFFT) architecture and chip adopting the retrenched 8-point FFT/IFFT (R8-FFT) unit and an efficient data-swapping method based output buffer unit is proposed.
Journal ArticleDOI
Low Computational Complexity, Low Power, and Low Area Design for the Implementation of Recursive DFT and IDFT Algorithms
TL;DR: The proposed algorithm was found to reduce multiplication computations by 50.5% using the symmetric identity of coefficients and a resource-sharing technique and register-splitting scheme, and decrease read-only memory sizes by 50% compared with conventional algorithms.
Journal ArticleDOI
Low-Computation-Cycle, Power-Efficient, and Reconfigurable Design of Recursive DFT for Portable Digital Radio Mondiale Receiver
TL;DR: Low-cost, fast-computational, power-efficient, and reconfigurable design for recursive discrete Fourier transform (RDFT), the first integration that collated both the prime factor algorithm and the Chinese reminder theorem into a recursive algorithm is proposed.
Journal ArticleDOI
VLSI Architecture for the Low-Computation Cycle and Power-Efficient Recursive DFT/IDFT Design
TL;DR: This novel low-computation cycle and power-efficient recursive discrete Fourier transform/inverse DFT (IDFT) architecture adopting a hybrid of input strength reduction, the Chebyshev polynomial, and register-splitting schemes achieves a reduction in computation-cycle by half.
Journal ArticleDOI
Low-Power and Optimized VLSI Implementation of Compact Recursive Discrete Fourier Transform (RDFT) Processor for the Computations of DFT and Inverse Modified Cosine Transform (IMDCT) in a Digital Radio Mondiale (DRM) and DRM+ Receiver
TL;DR: A compact structure of recursive discrete Fourier transform (RDFT) with prime factor (PF) and common factor (CF) algorithms to calculate variable-length DFT coefficients with low-power optimizations in VLSI implementation is presented.
References
More filters
Book
Discrete-Time Signal Processing
TL;DR: In this paper, the authors provide a thorough treatment of the fundamental theorems and properties of discrete-time linear systems, filtering, sampling, and discrete time Fourier analysis.
Book
OFDM for Wireless Multimedia Communications
Richard van Nee,Ramjee Prasad +1 more
TL;DR: In this paper, the authors present a comprehensive introduction to OFDM for wireless broadband multimedia communications and provide design guidelines to maximize the benefits of this important new technology, including modulation and coding, synchronization, and channel estimation.
Journal ArticleDOI
Applications of distributed arithmetic to digital signal processing: a tutorial review
TL;DR: DA is applied to a biquadratic digital filter, providing an example of vector dot-product and vector-matrix-product mechanization and it is seen that DA is a very efficient means to mechanize computations that are dominated by inner products.
Journal ArticleDOI
Real-valued fast Fourier transform algorithms
TL;DR: A new implementation of the real-valued split-radix FFT is presented, an algorithm that uses fewer operations than any otherreal-valued power-of-2-length FFT.