A method for gpdsp-oriented one-dimensional FFT vectorized calculation of large points
A technology of large points and vectors, applied in the field of general-purpose computing digital signal processors, can solve problems such as slow memory access and incomplete storage of original sequence data, and achieve the effects of convenient operation, reduced data transmission overhead, and improved computing performance
Active Publication Date: 2018-02-02
NAT UNIV OF DEFENSE TECH
View PDF12 Cites 0 Cited by
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
[0005] For the large-point FFT calculation oriented to GPDSP, because the capacity of the on-chip vector array memory of the DSP core is not large enough, the original sequence data that needs to be processed by FFT cannot be completely stored on the on-chip vector array memory of the DSP core, usually stored in the capacity Larger, but slower access to off-chip DDR memory
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 moreImage
Smart Image Click on the blue labels to locate them in the text.
Smart ImageViewing Examples
Examples
Experimental program
Comparison scheme
Effect test
Embodiment Construction
[0038] The present invention will be further described in detail below in conjunction with the accompanying drawings and specific embodiments.
[0039] The Matrix Fourier Algorithm (MFA) converts the one-dimensional FFT calculation of large points into the FFT calculation of multiple small points. The basic principles are as follows:
[0040] The discrete Fourier transform X(k)(k=0,...,N-1) of a sequence x(n)(n=0,...,N-1) is defined as:
[0041]
[0042] in is the rotation factor.
[0043] Let N=N 1 xN 2 , grouping the sequence x(n) into N 1 N 2 The subsequence of , that is, convert the one-dimensional sequence x(n) into a two-dimensional array sequence of the following form:
[0044]
[0045] Let the serial number mapping of n and k be as follows:
[0046]
[0047] Then X(k) can be transformed as follows:
[0048]
[0049] It can be seen from the above formula that the calculation of N-point one-dimensional DFT can be transformed into a calculation simila...
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
Login to View More Abstract
The invention discloses a large-point one-dimensional FFT vectorization calculational method for a GPDSP. When one-dimensional FFT with points of D=2<d> is calculated, calculation of d levels of FFT butterfly units is completed in two stages, wherein in the stage I, each level of FFT butterfly unit calculated through the first (d-m) levels of FFT butterfly units is completed through all vector processing array calculation units of DSP cores in a one-dimensional FFT butterfly unit calculation mode according to vectorization calculation till 2<m>-point sequence data can be completely stored in an in-chip sharing storage array of the GPDSP; in the stage II, all the vector processing array calculation units of the DSP cores carry out 2<d-m>-time 2<m>-point FFT calculation in sequence, a calculation method for transforming one dimension to two dimensions is adopted in vector processing arrays of the DSP cores, calculation is divided into FFT calculation with smaller points, and calculation is completed through the vector processing arrays of the DSP cores through a parallelization and vectorization calculation method. FFT calculation efficiency can be obviously improved, and data transmitting time cost can be lowered.
Description
technical field [0001] The present invention mainly relates to a general-purpose digital signal processor (General-Purpose Digital Signal Processor, referred to as GPDSP), in particular to a large-point one-dimensional FFT vectorization calculation method suitable for GPDSP. Background technique [0002] Discrete Fourier Transform (DFT) is widely used in the field of modern signal processing systems, such as radar signal processing, SAR image processing, sonar computing, video image algorithms, spectrum analysis, speech recognition, etc. Fourier transform calculation is a typical calculation-intensive and memory-intensive application. For example, the computational complexity of N-point DFT transform is o(N 2 ). In 1965, Cooley and Turkey proposed a fast Fourier transform (FFT) calculation method, which can significantly reduce the amount of calculation, and the calculation complexity is changed from the original o(N 2 ) down to o(Nlog 2 N). Signal processing application...
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
Login to View More Patent Type & Authority Patents(China)
IPC IPC(8): G06F17/14
Inventor 刘仲陈书明窦强龚国辉万江华陈海燕刘胜陈胜刚王耀华雷元武吴家铸黄琳琳向宏卫
Owner NAT UNIV OF DEFENSE TECH