Paper
14 November 2007 Moments based fast fourier transform without multiplications
Zhenbing Liu, Guoyou Wang, Jianguo Liu
Author Affiliations +
Proceedings Volume 6789, MIPPR 2007: Medical Imaging, Parallel Processing of Images, and Optimization Techniques; 67892J (2007) https://doi.org/10.1117/12.750911
Event: International Symposium on Multispectral Image Processing and Pattern Recognition, 2007, Wuhan, China
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.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Zhenbing Liu, Guoyou Wang, and Jianguo Liu "Moments based fast fourier transform without multiplications", Proc. SPIE 6789, MIPPR 2007: Medical Imaging, Parallel Processing of Images, and Optimization Techniques, 67892J (14 November 2007); https://doi.org/10.1117/12.750911
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Fourier transforms

Binary data

Digital signal processing

Bridges

Evolutionary algorithms

Medical imaging

Real-time computing

RELATED CONTENT


Back to Top