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

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)

Abstract

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.

Original languageEnglish
Article number5571862
Pages (from-to)711-715
Number of pages5
JournalIEEE Transactions on Circuits and Systems II: Express Briefs
Volume57
Issue number9
DOIs
Publication statusPublished - 2010 Sep

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A low-cost, low-complexity, and memory-free architecture of novel recursive DFT and IDFT algorithms for DTMF application'. Together they form a unique fingerprint.

Cite this