Hardware-efficient DFT designs with cyclic convolution and subexpression sharing

檔案

日期

2000-09-01

類型

期刊名稱

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-ANALOG AND DIGITAL SIGNAL PROCESSING

卷期與頁次

第 47 卷第 9 期,頁 886–892

ISSN

1057-7130

語言

英文

摘要

This paper presents a hardware efficient design for the discrete Fourier transform (DFT), The proposed design not only applies the constant property, but also exploits the numerical property of the transform coefficients. DFT is first formulated as cyclic convolution form to make each DFT output sample computations have the same computation kernels. Then, by exploring the symmetries of DFT coefficients, the word-level hardware sharing can be applied, in which two times the throughput is obtained. Finally, bit-level common subexpression sharing can be efficiently applied to implement the complex constant multiplications by using only shift operations and additions. Though the three techniques have been proposed separately for transform, this paper integrates the above techniques and obtains additive improvements. The I/O channels in our design are limited to the two extreme ends of the architecture that results in low I/O bandwidth. Compared with the previous memory-based design, the presented approach can save 80% of gate area with two-times faster throughput for length N = 61. The presented approach can also be applied to power-of-two length DFT Similar efficient designs can be obtained for other transforms like DCT by applying the proposed approach.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Chang, T., Guo, J., & Jen, C. (2000). Hardware-efficient DFT designs with cyclic convolution and subexpression sharing. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-ANALOG AND DIGITAL SIGNAL PROCESSING, 47(9), 886–892. https://doi.org/10.1109/82.868456

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/30270