30 October 2009 An efficient algorithm of 24-point DFT and its applications
Author Affiliations +
Proceedings Volume 7498, MIPPR 2009: Remote Sensing and GIS Data Processing and Other Applications; 74984Q (2009) https://doi.org/10.1117/12.833042
Event: Sixth International Symposium on Multispectral Image Processing and Pattern Recognition, 2009, Yichang, China
Abstract
An efficient algorithm for computing 24-point DFT, which can contribute fast algorithms to more N-point DFTs, is developed. The computation of one 24-point DFT requires only 24 real multiplications and 252 real additions. According to the principles of decimation-in-time (DIT) or decimation-in-frequency (DIF) algorithm and the efficient algorithm of 24-point DFT, 2M×24, 4M×24, 576=24×24 and 24×M-point DFT have their own efficient algorithms, respectively. The computational requirements of computing N=2M×24-point and N=4M×24-point DFT in their own efficient algorithms based on 24-point DFT block are (2M+1/6)N+20 real multiplications and (3M+31/3)N+4 real additions, (3M+1/3)N+16 real multiplications and (10.5-1/6+5.5M)N+4 real additions, respectively, while the computational requirements of 576=24×24-point DFT is 3184 real multiplications and 13140 real additions. In this paper, all of algorithms based 24- point DFT block are derived and analysed, but their practical applications need to be further explored.
© (2009) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Haijun Li, Daolin Li, Ran Fei, "An efficient algorithm of 24-point DFT and its applications", Proc. SPIE 7498, MIPPR 2009: Remote Sensing and GIS Data Processing and Other Applications, 74984Q (30 October 2009); doi: 10.1117/12.833042; https://doi.org/10.1117/12.833042
PROCEEDINGS
8 PAGES


SHARE
Back to Top