Share Email Print
cover

Proceedings Paper

Moments based fast fourier transform without multiplications
Author(s): Zhenbing Liu; Guoyou Wang; Jianguo Liu
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Discrete Fourier transform (DFT) is an important tool in digital signal processing. We have proposed an approach to performing DFT via linear sums of discrete moments. In this paper, based on the previous work, we present a new method of performing fast Fourier transform without multiplications by performing appropriate bit operations and shift operations in binary system, which can be implemented by integer additions of fixed points. The systolic implementation is a demonstration of the locality of dataflow in the algorithms and hence it implies an easy and potential hardware/VLSI realization. The approach is also applicable to DFT inverses.

Paper Details

Date Published: 14 November 2007
PDF: 8 pages
Proc. SPIE 6789, MIPPR 2007: Medical Imaging, Parallel Processing of Images, and Optimization Techniques, 67892J (14 November 2007); doi: 10.1117/12.750911
Show Author Affiliations
Zhenbing Liu, Huazhong Univ. of Science and Technology (China)
Guoyou Wang, Huazhong Univ. of Science and Technology (China)
Jianguo Liu, Huazhong Univ. of Science and Technology (China)


Published in SPIE Proceedings Vol. 6789:
MIPPR 2007: Medical Imaging, Parallel Processing of Images, and Optimization Techniques
Jianguo Liu; Kunio Doi; Patrick S. P. Wang; Qiang Li, Editor(s)

© SPIE. Terms of Use
Back to Top