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 published on a yearly basis
Papers
More filters
TL;DR: In this paper, a quasi-synchronous discrete fourier transform (DFT) algorithm was introduced and the simulation on the algorithm was carried out and the algorithm can be improved by scores of times than that of DFT algorithm.
Abstract: The principle of quasi-synchronous discrete fourier transform (DFT) algorithm was introduced and the simulation on the algorithm was carried out. The quasi-synchronous DFT algorithm is independent of the first sample point and it is able to start sampling at any moment. The maximum relative amplitude error and phase error of the algorithm are 0.05 % and 5.4° when the frequency of the signal is between 49.5 Hz and 50.5 Hz. The accuracy of quasi-synchronous DFT algorithm can be improved by scores of times than that of DFT algorithm.
TL;DR: This paper proposes an algorithm which matches the feature of DSP, where the pro cessing is fast when the multiply-accumulate operations are continued in execution, and was verified by an actual run of the program on DSP that the execution time is reduced.
Abstract: In the traditional fast-Fourier trans form (FFT) algorithm, the design for high- speed operation is made based on the number of operations, especially the number of multiplications, which is time-consuming in the general-purpose processor. This is not necessarily reasonable in the digital signal processor (DSP), where the multiplication can be performed in the time equal to that of other operations. From such a viewpoint, this paper proposes an algorithm which matches the feature of DSP, where the pro cessing is fast when the multiply-accumulate operations are continued in execution. the algorithm is applicable when the number of data IV can be factorized into mutually prime factors. DFT for smaller number (factor) of data is modified into the cyclic convolution, and is executed at a high speed (small- N algorithm). the proposed algorithm is composed of the small-N algorithms and DFT for a large number of data (multidimensional algorithm), which combines small-N algorithms into a multidimensional DFT. the number of operations is not necessarily reduced in the proposed algorithm, compared with the traditional FFT, but it was verified by an actual run of the program on DSP that the execution time is reduced.
TL;DR: The structure and theory of the proposed linear modulated Fourier algorithm is described and application to the digital impedance relay showed that the proposed algorithm is suitable for relaying applications.
Abstract: The Fourier algorithm, due to its good frequency response characteristics, is frequently used in calculating the peak value of a distorted wave for real time measuring applications. A new method, using the linear modulation method, is proposed to implement the algorithm. It improves the defect of a large number of arithmatic operations during implementation of the algorithm. This paper describes the structure and theory of the proposed linear modulated Fourier algorithm. Test results, including the required arithmatic operations and the numerical accuracy, are reported. Moreover, application to the digital impedance relay was simulated, and the simulation results show that the proposed algorithm is suitable for relaying applications.
28 Jun 2000
TL;DR: The simulation result shows that the proposed filter algorithm of Bayesian state estimation using fast Fourier transforms is a very robust nonlinear filter algorithm.
Abstract: In the paper, a filter algorithm of Bayesian state estimation using fast Fourier transforms (FFTs)is proposed. The computation is reduced by using FFTs. The simulation result shows that the algorithm is a very robust nonlinear filter algorithm.
TL;DR: Orthogonal FrequencyDivisionMultiplexing (OFDM) isamulti-carriermodulationtechniquewhich dividest the available spectrum in available spectrumintomany carriers by spacing the channels much closer together and making all carriers orthogonal to one another to prevent interference
Abstract: Orthogonal FrequencyDivisionMultiplexing(OFDM)isamulti-carriermodulationtechniquewhich dividestheavailable spectrumintomanycarriers.OFDMusesthespectrumefficiently comparedtoFDMAby spacing the channels much closer together and making all carriers orthogonal to one another to prevent interferencebetweenthecloselyspacedcarriers.ThemainadvantageofOFDMistheirrobustnesstochannel fadinginwirelessenvironment. TheobjectiveofthisworkistodesignandimplementanOFDMtransmitter and receiverusingMATLAB.Theworkconcentrates ondevelopingFastFourierTransform(FFT)andInverseFast FourierTransform(IFFT).The workalsoincludesindesigninga mappingmodule,serialtoparallelandparallelto serialconvertermodule.Thedesignuses16-pointsFFTandIFFTfortheprocessingmodulewhichindicatesthat theprocessingblockcontain16inputsdata.AllmodulesareimplementingusingMATLAB.