scispace - formally typeset
Search or ask a question
Topic

Prime-factor FFT algorithm

About: Prime-factor FFT algorithm is a research topic. Over the lifetime, 2346 publications have been published within this topic receiving 65147 citations. The topic is also known as: Prime Factor Algorithm.


Papers
More filters
Journal Article
TL;DR: In this paper, a multiple signal classification (MUSIC) algorithm is introduced to harmonic frequency estimation field and the principle of MUSIC algorithm and theoretical analysis of the spectral separate frequency and frequency detection threshold are included.
Abstract: The drawbacks of current harmonic frequency estimation methods are concluded.MUSIC(multiple signal classification)algorithm is introduced to harmonic frequency estimation field.The principle of MUSIC algorithm and theoretical analysis of the spectral separate frequency and frequency detection threshold are included.MUSIC algorithm compared with FFT based algorithm for harmonic frequency estimation using matlab simulation platform.Theoretical analysis and simulation results show that this algorithm is a super-resolution algorithm with small data length,which could be used to detect weak harmonic signals.

1 citations

28 Jan 2015
TL;DR: In this article, a fast acquisition algorithm of GPS L1C signal based on sparse fast Fourier transform (SFFT) has been proposed, and the performance of the proposed algorithm is also analyzed.
Abstract: L1 Civil (L1C) signal is one of the emerging signals designed for GPS. Because of many innovative features, legacy method is not suitable for L1C receiver. In the acquisition module, TMBOC and new PRN code make the search space of the L1C code phase 20 times larger than that of C/A code, which costs much more computations. To speed up the acquisition process, XFAST, Dual-Folding and Sparse Fast Fourier Transform (SFFT) have been put forward. But they can’t be used for L1C directly. Fully considering the characteristics of L1C signal, this paper proposes a fast acquisition algorithm of GPS L1C signal based on SFFT. The performance of the proposed algorithm is also analyzed.

1 citations

Proceedings ArticleDOI
31 Dec 2009
TL;DR: Good-Thomas prime factor algorithm is introduced to realize FFT of 255 point and 15 point, which impoves the decoding speed of RS in frequency domain.
Abstract: RS (255, 223) is used as the outer code of concatenated system in CCSDS standard and its speed affects the speed of the whole system. This paper designs the decoder in frequency domain and introduces Good-Thomas prime factor algorithm to realize FFT of 255 point and 15 point, which impoves the decoding speed. The flow chart based on DSP is also presented.

1 citations

Proceedings ArticleDOI
19 Oct 1993
TL;DR: It is proved that the so-called generalized discrete Fourier transform (GFT) can be computed by DWT, so a unified parallel algorithm for all kinds of GFT is obtained and a "generalized convolution property" is given.
Abstract: Discrete W transform (DWT) proposed by Wang (1985) has been used in digital signal processing and other fields. Its fast algorithm has been studied extensively when the number of points is a power of 2, but we have still known little about its fast algorithm in other cases. In this paper, it is shown that a DWT of length N=N/sub 1/N/sub 2/ (N/sub 1/ is odd) can be turned into N/sub 1/ DWT's of length N/sub 2/ and N/sub 2/ DHT's (discrete Hartley transform) of length N/sub 1/ with some very simple operations. Therefore, a unified parallel algorithm for all kinds of DWT is obtained. The complexity of the algorithm is discussed. Also, we have proved that the so-called generalized discrete Fourier transform (GFT) can be computed by DWT, so a unified parallel algorithm for all kinds of GFT is obtained. Finally, a "generalized convolution property" is given. >

1 citations

Journal ArticleDOI
TL;DR: This paper describes the design of a low-power DCT (Discrete Cosine Transform) architecture using varies techniques and implements the multiplier-less CORDIC algorithm.
Abstract: This paper describes the design of a low-power DCT (Discrete Cosine Transform) architecture using varies techniques. The low-power design is one of the most important challenges to maximize battery life in portable devices and to save the energy during system operation. Discrete Cosine Transform (DCT) is one of the most popular lossy techniques used in image and video compression standards. Several algorithms have been proposed to implement the DCT. So we have to implement the multiplier-less CORDIC algorithm. CORDIC (Coordinate Rotation Digital Computer) algorithm is a class of shiftadd algorithm for rotation vector and plan which is usually used for the calculation of trigonometric functions. The whole design is simulated with Xilinx ISE 14.1 software and results are completely consistent with DCT.

1 citations


Network Information
Related Topics (5)
Wavelet
78K papers, 1.3M citations
81% related
Robustness (computer science)
94.7K papers, 1.6M citations
78% related
Feature extraction
111.8K papers, 2.1M citations
77% related
Support vector machine
73.6K papers, 1.7M citations
76% related
Optimization problem
96.4K papers, 2.1M citations
76% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20235
202224
20211
20188
201757
201692