Fast Algorithms for Computing Composite-Number-Less-Than-20-Point DFT

Hai Jun Li; Wei Han; Hua Shang; Pei Rong Ji

doi:10.4028/www.scientific.net/AMR.631-632.1397

Paper Titles

Adaptive Parameters Selection Method for Time-Frequency Distribution Series Based on Normalized Entropy
p.1373

The Application of Computer Software — 3D Studio Max, Lightscape and V-Ray in the Environmental Artistic Expression
p.1379

A New Approach of Computer Forensics Based on Steganalysis
p.1385

Research about Information Security Risk Assessment of Oil and Gas Production Management System
p.1390

Fast Algorithms for Computing Composite-Number-Less-Than-20-Point DFT
p.1397

A New Method for BCH Codes of Blind Recognition
p.1403

A Secure Strategy for Location-Based Wireless Sensor Networks
p.1409

An Efficient Pre-Processing Algorithm for Removing Uniform Noise Based on Cluster Method
p.1416

Study of the Technology to Design the Role Model Based on the Outline
p.1423

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 631-632Fast Algorithms for Computing...

Fast Algorithms for Computing Composite-Number-Less-Than-20-Point DFT

Abstract:

In this paper, fast algorithms for computing composite-number-less-than-20-point DFT is developed, it is based on the matrix operation, makes as much use of the characteristics of twiddle factor, repeatedly transforms the twiddle factor matrix, finally, the core matrixs for computing N-point DFT is obtained. This paper provides the core matrix, calculation process and the amount of computation of less-than-20-point DFT. The algorithm is easy to be understood and applied.