Realization method for fast computation of discrete Fourier transform with non-second power points

A technology of discrete Fourier transform and Fourier transform, which is applied in the field of rapid calculation of discrete Fourier transform, and can solve the problems of multi-system resources, sorting and subscript mapping process complexity and consumption, etc.

Inactive Publication Date: 2013-04-03
GUILIN KSW COMM TECH
View PDF0 Cites 10 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the sorting and subscript mapping process in the algorithm operation is very complicated and consumes a lot of system resources

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Realization method for fast computation of discrete Fourier transform with non-second power points
  • Realization method for fast computation of discrete Fourier transform with non-second power points
  • Realization method for fast computation of discrete Fourier transform with non-second power points

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0088] In the Homeplug AV protocol, when one OFDM symbol is modulated, it is an IDFT transformation with 3072 points. The solution given in this embodiment is to use the comprehensive utilization of mixed base + prime factor + WFTA algorithm.

[0089] The first step is to decompose the 3072-point sequence into 3072=3×1024 according to the prime factorization method.

[0090] The second step is to continue to decompose the 1024 point sequence into 1024=4×256 according to the prime factorization algorithm, and then further decompose the 256 point sequence according to the prime factorization method, and finally decompose to get 1024=4×4×4×4×4 .

[0091] The fourth step is to use WFTA to realize the 4 and 3 point FFT.

[0092] The flow chart of the program is as follows figure 2 shown. Although twiddle factors of 1024 points, 256 points, 64 points and 16 points are added to the algorithm, the algorithm of 4-point WFTA is very simple, and only needs 5 times of real number mult...

Embodiment 2

[0094] This embodiment is based on digital multimedia broadcasting-terrestrial national digital television broadcasting standard (Digital Television Terrestrial Multimedia Broadcasting, DTMB) using IDFT to transform the 3780-point constellation diagram into a discrete sampling value frame body with a length of 3780 points. In the existing literature, the implementation of 3780-point FFT is based on WFTA decomposition, and its decomposition scheme is based on 63×60 decomposition. Although this decomposition scheme can reduce the calculation amount of 3780-point FFT, there are still large calculations. quantity. Therefore, the solution given in this embodiment is to improve the decomposition method of the mixed base+prime factor+WFTA algorithm.

[0095] The first step is to decompose 3780 points into 140×27 by using prime factorization method. Since the prime factor algorithm is used for decomposition, there is only prime factor address mapping between the 140-point FFT and the...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a realization method for fast computation of discrete Fourier transform with non-second power points. The realization method is an improvement obtained by comprehensively using a prime factor decomposition algorithm, a mixed-radix FFT (fast Fourier transform) algorithm and a WFTA (Winograd Fourier transform algorithm) decomposition method, and the sequence of non-second power points is decomposed layer by layer through common factor decomposition and prime factor decomposition. The realization method for fast computation of discrete Fourier transform with non-second power points has the characteristics of less computation, high computation efficiency and small overhead for realization.

Description

technical field [0001] The invention belongs to the technical field of communication signal processing, and relates to a fast algorithm of discrete Fourier transform (DFT), in particular to a method for realizing fast calculation of discrete Fourier transform whose number of points is not a power of two. Background technique [0002] For the fast calculation method of DFT, the most effective algorithm is based on the Cooley-Tukey algorithm, which requires the number of points to be a power of 2. When the number of points is not a power of 2, it is necessary to interpolate zero points to satisfy the number of points to a power of 2. . Zero-padding interpolation will introduce sequence spectrum errors and increase the computational load of Fourier transform, reducing operational efficiency. The modulation implementation of the Orthogonal Frequency Division Multiplexing (OFDM) system is the Inverse Discrete Fourier Transform (IDFT). The OFDM system has sensitive carrier interf...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/14
Inventor 祝常健沈良恒姚晓强
Owner GUILIN KSW COMM TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap