Modular pipeline fast Fourier transform

dc.contributor.assigneeBoard of Regents, The University of Texas System
dc.creatorAyman M. El-Khashab
dc.creatorEarl E. Swartzlander, Jr.
dc.date.accessioned2019-10-23T19:30:54Z
dc.date.available2019-10-23T19:30:54Z
dc.date.filed2004-11-02
dc.date.issued2009-06-02
dc.description.abstractA modular pipeline algorithm and architecture for computing discrete Fourier transforms is described. For an N point transform, two pipeline √{square root over (N)} point fast Fourier transform (FFT) modules are combined with a center element. The center element contains memories, multipliers and control logic. Compared with standard N point pipeline FFTs, the modular pipeline FFT maintains the bandwidth of existing pipeline FFTs with reduced dynamic power consumption and reduced complexity of the overall hardware pipeline.
dc.description.departmentBoard of Regents, University of Texas System
dc.identifier.applicationnumber10979775
dc.identifier.patentnumber7543010
dc.identifier.urihttps://hdl.handle.net/2152/76999
dc.identifier.urihttp://dx.doi.org/10.26153/tsw/4088
dc.publisherUnited States Patent and Trademark Office
dc.relation.ispartofUniversity of Texas Patents
dc.relation.ispartofUniversity of Texas Patents
dc.rights.restrictionOpen
dc.rights.restrictionOpen
dc.subject.cpcG06F17/142
dc.subject.uspc708/404
dc.subject.uspc708/409
dc.titleModular pipeline fast Fourier transform
dc.typePatent

Access full-text files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
US7543010.pdf
Size:
1.76 MB
Format:
Adobe Portable Document Format