Fast computation of general fourier transforms on graphics processing units
AssigneeMicrosoft Technology Licensing, LLC
InventorsDavid Brandon Lloyd, Charles Neil Boyd, Naga K. Govindaraju
Life of this patent
Estimating the term…
Loading patent…
AssigneeMicrosoft Technology Licensing, LLC
InventorsDavid Brandon Lloyd, Charles Neil Boyd, Naga K. Govindaraju
Estimating the term…
Described is a technology for use with general discrete Fourier transforms (DFTs) performed on a graphics processing unit (GPU). The technology is implemented in a general library accessed through GPU-independent APIs. The library handles complex and real data of any size, including for non-power-of-two data sizes. In one implementation, the radix-2 Stockham formulation of the fast Fourier transform (FFT) is used to avoid computationally expensive bit reversals. For non-power of two data sizes, a Bluestein z-chirp algorithm may be used.
An apparatus, comprising:
In a computing environment that includes a programmable graphics processing unit, a method comprising:
One or more computer-readable storage media having computer-executable instructions, which when executed perform steps, comprising:
Dependencies are inferred from the claim text.