Share Email Print

Proceedings Paper

An efficient algorithm of 24-point DFT and its applications
Author(s): Haijun Li; Daolin Li; Ran Fei
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 30 October 2009
PDF: 8 pages
Proc. SPIE 7498, MIPPR 2009: Remote Sensing and GIS Data Processing and Other Applications, 74984Q (30 October 2009); doi: 10.1117/12.833042
Show Author Affiliations
Haijun Li, China Three Gorges Univ. (China)
Daolin Li, Three Gorges Vocational College of Electric Power (China)
Ran Fei, Hubei Three Gorges Vocational and Technical College (China)

Published in SPIE Proceedings Vol. 7498:
MIPPR 2009: Remote Sensing and GIS Data Processing and Other Applications
Faxiong Zhang; Faxiong Zhang, Editor(s)

© SPIE. Terms of Use
Back to Top