Index Generation Scheme for Prime Factor Algorithm Based Mixed Radix Discrete Fourier Transform (DFT)
AssigneeSaankhya Labs Pvt. Ltd.
InventorsGururaj Padaki, Saurabh Mishra, Suman Sanisetty
Life of this patent
Estimating the term…
Loading patent…
AssigneeSaankhya Labs Pvt. Ltd.
InventorsGururaj Padaki, Saurabh Mishra, Suman Sanisetty
Estimating the term…
In one embodiment, a processor performs a method of generating pipelined data read indexes and data write indexes for a Prime Factor Algorithm (PFA) Discrete Fourier Transform (DFT) without look-up tables. The processor is adapted to factorize an ‘N’ point PFA DFT into one or more mutually prime factors and zero or more non-prime factors, calculate a 0th column index for an ith row (Xi0), calculate an IndCor when the value of Xi0 equals zero and when a row number (i) does not equal zero, calculate Xij, generate the data read indexes, perform a DFT kernel computation on Lk point for the mutually prime factors and the non-prime factors, and generate the data write indexes for the mutually prime factors and the non-prime factors. Xij represents ith row and jth column of 2D input Buffer and enables a selection of a linear index from the 2D input buffer.
A processor to perform a method of generating a plurality of pipelined data read indexes and a plurality of pipelined data write indexes for Prime Factor Algorithm (PFA) based mixed radix Discrete Fourier Transform (DFT), said processor adapted to:
A hardware accelerator comprising a set of instructions for faster generation of a plurality of pipelined data read indexes and a plurality of pipelined data write indexes for a Prime Factor Algorithm (PFA) based mixed radix Discrete Fourier Transform (DFT), said instructions comprising:
The hardware accelerator of claim 7, wherein said instructions further comprise:
A processor to dynamically configure a plurality of DFT stages in a communication system, said processor comprising:
Dependencies are inferred from the claim text.