A low-cost, low-complexity, and memory-free architecture of novel recursive DFT and IDFT algorithms for DTMF application

Shin Chi Lai, Sheau Fang Lei, Wen Ho Juang, Ching Hsing Luo

研究成果: Article同行評審

11 引文 斯高帕斯(Scopus)

摘要

A low-computational complexity and low-cost recursive discrete Fourier transform (RDFT) design using the Chinese remainder theorem is proposed in this brief. The proposed algorithm reduces multiplications by 74% and additions by 73% compared to the latest RDFT algorithms. For computing the 212- and 106-point DFT coefficients, the proposed design can shorten computing cycles by 47% compared with the latest architectures. The hardware resources for the proposed design only require 2 multipliers and 12 adders. The coefficient read-only memory storing the sine and cosine values can be reduced by 100% compared with other recursive algorithms. Therefore, the proposed algorithm is more suitable than other very large scale integration realizations.

原文English
文章編號5571862
頁(從 - 到)711-715
頁數5
期刊IEEE Transactions on Circuits and Systems II: Express Briefs
57
發行號9
DOIs
出版狀態Published - 2010 九月 1

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

指紋 深入研究「A low-cost, low-complexity, and memory-free architecture of novel recursive DFT and IDFT algorithms for DTMF application」主題。共同形成了獨特的指紋。

引用此