期刊名称：International Journal of Hybrid Information Technology
印刷版ISSN：1738-9968
出版年度：2015
卷号：8
期号：7
页码：149-160
DOI：10.14257/ijhit.2015.8.7.13
出版社：SERSC
摘要：Correlation is an important and useful operation in the fields of digital signal processing. In this paper, based on the previous work of performing discrete Fourier transform (DFT) via linear sums of discrete moments, we have made development to eliminate multiplications in the DFTs by performing appropriate bit operations and shift operations in binary system, which can be implemented by integer additions of fixed points; then using the Correlation theorem with the DFT, we compute the Correlation with two DFTs, a point-by-point product, and an inverse DFT. Since our algorithm involves fewer multiplications, an efficient and regular systolic array is designed to implement it which is a demonstration of the locality of dataflow in the algorithms. The approach is also applicable to multi-dimensional DFT .
