Earticle

초록

영어

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 .

목차

Abstract
 1. Introduction
 2. DFT Without Multiplications
 3. Complexity Analysis And Systolic Implementation Of DFT
 4. Computing Correlation By Correlation Theorem And Complexity Analyses
 5. Discussion and conclusion
 Acknowledgments
 References

키워드

저자

• Zhenbing Liu [ Guangxi Key Laboratory of Automatic Detecting Technology and Instruments, Guilin University of Electronic Technology, Guilin, China ]
• Qijia He [ Guangxi Key Laboratory of Automatic Detecting Technology and Instruments, Guilin University of Electronic Technology, Guilin, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Hybrid Information Technology

• 간기

  격월간

• pISSN

  1738-9968

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605