Modular pipeline fast Fourier transform

A 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.Board of Regents, University of Texas Syste

Modular pipeline fast Fourier transform

A 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.Board of Regents, University of Texas Syste

Method, apparatus and system for maintaining connections between computers using connection-oriented protocols

The present invention provides a system, method and apparatus for maintaining a connection between a server and a client by receiving a message, determining whether to store one or more elements of the message, storing the one or more elements of the message when the one or more elements of the message are to be stored, transmitting the message, and determining whether the server has failed and when the server has failed, restoring the server to a pre-failure connection state using the one or more stored message elements.Board of Regents, University of Texas Syste