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
Journal Article•
TL;DR: In order to reduce the computational complexity in searching the peak, an improved algorithm of DOA estimation based on FFT algorithm and MUSIC algorithm was proposed.
Abstract: In order to reduce the computational complexity in searching the peak,an improved algorithm of DOA estimation based on FFT algorithm and MUSIC algorithm was proposed.Firstly,it uses FFT algorithm to form multi-beam,and get a rough estimation of DOA.Then it uses MUSIC algorithm to get an accuracy estimation of DOA.With this method,searching of the peak is worked in small angle range,and the computational complexity is reduced.
4 citations
01 Jan 2014
TL;DR: This chapter provides the performance results of the execution of the FFT code as run on AMD and Nvidia GPUs, and includes the host code written in C.
Abstract: The Fast Fourier Transform (FFT) is pre-dominantly used in the signal processing community to perform time-frequency domain transforms. This chapter describes tradeoffs when mapping the FFT to a GPUs. It presents different implementations of the algorithm for computing the FFT. The chapter includes a design strategy for mapping the FFT computation to a GPU. It also provides example code showing how to develop OpenCL code to compute the 1D and 2D FFT, and includes the host code written in C. The chapter provides the performance results of the execution of the FFT code as run on AMD and Nvidia GPUs.
4 citations
Journal Article•
TL;DR: A generalized discrete Fourier transform is used to give a fast algorithm for deternining the linear complexity of a pseudo random sequence with a period n2 v, and a new conclusion on Hasse derivatives of polynoimial is proposed.
Abstract: A generalized discrete Fourier transform is used to give a fast algorithm for deternining the linear complexity of a pseudo random sequence with a period n2 v, and a new conclusion on Hasse derivatives of polynoimial is proposed.
4 citations
11 Nov 1992
TL;DR: Hardware algorithms for one-dimensional fast Fourier transform (FFT) computation on an 8-neighbor processor array are presented and two data mapping methods and algorithms are shown: the algorithm for similarity allocation and the algorithms for superposition allocation.
Abstract: Hardware algorithms for one-dimensional fast Fourier transform (FFT) computation on an 8-neighbor processor array are presented. These algorithms achieve high-speed FFT computation by combining the radix 4 butterfly computation with the communication capabilities of the 8-neighbor processor array. Three algorithms are considered. Two data mapping methods and algorithms are shown: the algorithm for similarity allocation and the algorithm for superposition allocation. The radix 4 and the radix 2 FFT algorithms are compared and evaluated. >
4 citations
TL;DR: In this article, a fast Fourier transform-based algorithm was proposed to calculate the error probabilities associated with a group sequential clinical trial with a simple numerical method such as Simpson's rule and demonstrated that a significant savings in terms of computing time can be achieved using a Fast Fourier Transform (FFT) algorithm compared to a simple quadrature method.
4 citations