TWO-DIMENSIONAL FFT COMPUTATION

Number of patents in Portfolio can not be more than 2000

United States of America

APP PUB NO 20250020771A1
SERIAL NO

18904286

Stats

ATTORNEY / AGENT: (SPONSORED)

Importance

Loading Importance Indicators... loading....

Abstract

See full text

Devices, e.g., hardware accelerators, and systems are operable to perform a two-dimensional (2D) fast Fourier transform (FFT) on an M×N element array. The hardware accelerator has log2 M×N pipeline stages including an initial group of log2 M stages and a final group of log2 N stages. Each stage includes a butterfly unit, a FIFO buffer coupled to the butterfly unit, and a multiplier coupled to the butterfly unit and to an associated twiddle factor table. The hardware accelerator also includes butterfly control logic to provide elements of the M×N element array to the initial group of stages in an N direction of the array, and twiddle factor addressing logic to, for the twiddle factor tables of the initial group of stages, apply an indexed entry of the twiddle factor table to the associated multiplier. The indexed entry begins as a first entry and advances by N entries after every N cycles.

Loading the Abstract Image... loading....

First Claim

See full text

Family

Loading Family data... loading....

Patent Owner(s)

Patent OwnerAddress
TEXAS INSTRUMENTS INCTEXAS USA TEXAS

International Classification(s)

Inventor(s)

Inventor Name Address # of filed Patents Total Citations
Gupta, Pankaj Rajasthan, IN 182 2373
Ramasubramanian, Karthik Bangalore, IN 87 1466

Cited Art Landscape

Load Citation

Patent Citation Ranking

Forward Cite Landscape

Load Citation