VLSI Architecture for the Low-Computation Cycle and Power-Efficient Recursive DFT/IDFT Design
Lists
Only you see this
Abstract
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 [email protected] in TSMC 0.13 1P8M CMOS process. The proposed VLSI implementation shows the power-efficient advantage by the low-computation cycle architecture.
BibTeX
@inproceedings{van2007vlsi,
author = {Lan-Da Van and Chin‐Teng Lin and Yong-Gyu Yu},
title = {{VLSI Architecture for the Low-Computation Cycle and Power-Efficient Recursive DFT/IDFT Design}},
booktitle = {IEICE},
year = {2007},
doi = {10.1093/ietfec/e90-a.8.1644},
}Loading related content...