摘要
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