Discrete-time signal processing
Discrete-time signal processing
Recursive discrete Fourier transform with unified IIR filter structures
Signal Processing
A VLSI Array Processing Oriented Fast Fourier Transform Algorithm and Hardware Implementation
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
IEEE Transactions on Signal Processing - Part I
Efficient recursive structures for forward and inverse discrete cosine transform
IEEE Transactions on Signal Processing
IEEE Transactions on Circuits and Systems II: Express Briefs
IEEE Transactions on Circuits and Systems II: Express Briefs
Hi-index | 0.00 |
In this paper, we propose one low-computation cycle and power-efficient recursive discrete Fourier transform (DFT)/inverse DFT (IDFT) architecture adopting a hybrid of input strength reduction, the Chebyshev polynomial, and register-splitting schemes. Comparing with the existing recursive DFT/IDFT architectures, the proposed recursive architecture achieves a reduction in computation-cycle by half. Appling this novel low-computation cycle architecture, we could double the throughput rate and the channel density without increasing the operating frequency for the dual tone multi-frequency (DTMF) detector in the high channel density voice over packet (VoP) application. From the chip implementation results, the proposed architecture is capable of processing over 128 channels and each channel consumes 9.77 μW under 1.2 V@20MHz in TSMC 0.13 1P8M CMOS process. The proposed VLSI implementation shows the power-efficient advantage by the low-computation cycle architecture.