VLSI Architecture for the Low-Computation Cycle and Power-Efficient Recursive DFT/IDFT Design

Lan-Da VAN
Chin-Teng LIN
Yuan-Chu YU

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E90-A    No.8    pp.1644-1652
Publication Date: 2007/08/01
Online ISSN: 1745-1337
DOI: 10.1093/ietfec/e90-a.8.1644
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Digital Signal Processing
channel density,  high density voice over packet,  high throughput,  low-computation cycle,  power efficiency,  recursive DFT/IDFT,  

Full Text: PDF(873.1KB)>>
Buy this Article

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@20 MHz in TSMC 0.13 1P8M CMOS process. The proposed VLSI implementation shows the power-efficient advantage by the low-computation cycle architecture.