REGISTER now for FREE 
|
FREE patent keyword monitoring and additional FREE benefits. REGISTER now for FREE
|
|
|
Electrical Computers: Arithmetic Processing And Calculating > Electrical Digital Calculating Computer > Particular Function Performed > Transform > Fourier > Fast Fourier Transform (i.e., Fft) Fast Fourier Transform (i.e., Fft)Fast Fourier Transform (i.e., Fft) patent applications listed are from June 2005 to current and include Date, Patent Application Number, Patent Title, Patent Abstract summary and are linked to the corresponding patent application page.10/05/06 - 20060224652 - Instruction set processor enhancement for computing a fast fourier transform This invention describes a method of computing a fast Fourier transform (FFT) using enhanced processor computational capabilities for more efficient and flexible implementation of an electronic device (e.g., a linear equalizer) based on that FFT computing. A simple non-parallel instruction set processor (or just a non-parallel processor) containing complex multiplication ... 10/05/06 - 20060224651 - Combined ifft and fft system A system (12) for determining discrete transforms as between time and frequency domains. The system comprises a grid (60) comprising adders and multipliers. The grid is operable to perform in parallel an integer number P operations of a first transform function selected from one of either an IFFT or an ... 08/31/06 - 20060195502 - Group delay compensation using ifft filters A method, computer program, and apparatus for compensating for group delay. The method comprises the steps of generating a raw step response of a system, differentiating the raw step response to generate an impulse response of the system, windowing the impulse response and taking a Fast Fourier Transform (FFT) of ... 07/27/06 - 20060167964 - Methods and systems for a multi-channel fast fourier transform (fft) In at least some embodiments, a method is provided. The method includes receiving samples from a first input channel and a second input channel. The method further includes controlling commutators to selectively switch samples between the first and second input channels for input to a radix-2 butterfly. The method further ... 07/13/06 - 20060155795 - Method and apparatus for hardware implementation of high performance fast fourier transform architecture An high performance Fast Fourier Transform implementation in hardware is achieved through placement of a number of Butterfly/Dragonfly or “FLY” cells that run concurrently during a transformation process. The bank of FLY cells interacts according to FFT/IFFT algorithms through use of a resource-sharing fabric. The resource-sharing fabric allows the bank ... 06/29/06 - 20060143258 - Fast fourier transform processor A Fast Fourier Transform (FFT) processor is provided. It comprises a multiplexer, a first angle rotator, a second angle rotation and multiplexing unit, an adder, a twiddle factor storage, a multiplier, and a data storage. The FFT processor analyzes the input/output order of the Fast Fourier Transformation, separates the portions ... 06/15/06 - 20060129621 - Apparatus of selectively performing fast hadamard transform and fast fourier transform, and cck modulation and demodulation apparatus using the same A Fast Fourier Transform (FFT) apparatus for selectively performing Fast Hadamard transform (FHT), and a complementary code keying (CCK) modulation/demodulation apparatus using the same are disclosed. In the present invention, OFDM module and CCK module are integrated as one module having lower complexity compared to conventional scheme by embodying the ... 06/15/06 - 20060129620 - Fft apparatus for high data rate and method thereof An FFT apparatus for quickly processing input signals and method thereof is disclosed. In performing the FFT for processing N input signals, four N/4-point FFT units implemented by radix-2 single-path delay feedback (R2SDF) units performs the FFT with respect to the input signals, and a radix-4 computation unit performs a ... 05/04/06 - 20060095492 - System and method for a fast fourier transform architecture in a multicarrier transceiver A Fourier transform architecture and system for FFT and IFFT processing within multicarrier transceiver is disclosed that includes a programmable butterfly component, a memory and a programmable address generation unit. The architecture includes a butterfly component configured to perform a plurality of radix butterfly calculations, and a four bank memory ... 04/06/06 - 20060075010 - Fast fourier transform method and apparatus A method and apparatus, especially suited for computers that can execute fused multiply-add instructions, for performing a fast Fourier transform (FFT) are disclosed. Divisions by zero that create a risk of error in other methods are avoided. In a first example embodiment, a zero divisor is detected and the division ... 02/09/06 - 20060031277 - Fft and fht engine A transformation engine includes an address generator; a butterfly unit coupled to the address generator; a twiddle LUT coupled to the address generator; and a multiplier having a first input coupled to the butterfly unit and a second input coupled to the twiddle LUT. ... 01/12/06 - 20060010189 - Method of calculating fft The method makes input data of length L correspond to a sequence of data having length M, calculates an exponent N such that a radix to the power of the exponent N is equal to the length M, bit-reverses the indexes of the sequence of data to derive a sequence ... 01/05/06 - 20060004900 - Methods for addressing input data values of a fast fourier transform (fft) calculation A method for the generation of addresses of successive pairs of input data values of stages of a Fast Fourier Transform calculation stored contiguously in a memory includes initializing at most once per stage a first base address pointer to an address of a first input data value of an ... 12/29/05 - 20050289207 - Fast fourier transform processor, dynamic scaling method and fast fourier transform with radix-8 algorithm The present invention provides a fast Fourier transform processor, dynamic scaling method and fast Fourier transform with radix-8 algorithm. It reduces quantization errors generated from the operation by using a matrix prefetch buffer-based fast Fourier transform processor. Operation sizes of the matrix prefetch buffer as block sizes the invention adjust ... 12/15/05 - 20050278405 - Fourier transform processor The present invention is two-iteration Fourier transform processor for performing Fourier transform of N data inputs into N data outputs. The processor comprises a plurality of two-iteration radix-r modules and a combination phase element. Each radix-r module comprises r radix-r butterflies, a feedback network and a plurality of switches. Each ... 12/15/05 - 20050278404 - Method and apparatus for single iteration fast fourier transform The present invention is single-iteration Fourier transform processor. A Fourier transform processor performs Fourier transform of N input data into N output data with a radix-r butterfly. The Fourier transform processor includes N/r radix-r modules. Each radix-r module includes a plurality of radix-r engines, and each radix-r engine includes a ... 11/17/05 - 20050256917 - Address generators integrated with parallel fft for mapping arrays in bit reversed order Reducing the amount of required memory and instruction cycles when implementing Fast Fourier Transforms (FFTs) on a computer system is described. The invention optimizes FFT software using in-place bit reversal (IPBR) implemented on a processor capable of bit reversed incrementation. Enables the design of address generators that combine IPBR and ... 11/10/05 - 20050251545 - Learning heavy fourier coefficients A method includes searching in the ZN domain, for N greater than 2, for heavy Fourier coefficients of a function. The method may be implemented for any type of signal compression, such as image, video or audio compression. It may also be used to decode corrupted codewords. ... 09/08/05 - 20050198092 - Fast fourier transform circuit having partitioned memory for minimal latency during in-place computation An FFT circuit is implemented using a radix-4 butterfly element and a partitioned memory for storage of a prescribed number of data values. The radix-4 butterfly element is configured for performing an FFT operation in a prescribed number of stages, each stage including a prescribed number of in-place computation operations ... 08/18/05 - 20050182806 - Fft architecture and method A Fast Fourier Transform (FFT) hardware implementation and method provides efficient FFT processing while minimizing the die area needed in an Integrated Circuit (IC). The FFT hardware can implement an N point FFT, where N=rn is a function of a radix (r). The hardware implementation includes a sample memory having ... 08/11/05 - 20050177608 - Fast fourier transform processor and method using half-sized memory In a fast Fourier transform processor and a fast Fourier transform method using half-sized memories, a butterfly computational element is utilized and one write operation and one read operation are performed during one clock cycle, assuming a virtual memory space at each of two memory units can accommodate N/2 points ... 07/21/05 - 20050160127 - 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 N point {square root}{square root over (N)} point fast Fourier transform modules are combined with a center element. The center element contains memories, multipliers and control logic. Compared with standard ... 06/30/05 - 20050144209 - Apparatus and method for selectively performing fast hadamard transform or fast fourier transform Disclosed is an apparatus for performing both FHT (Fast Hadamard Transform) and FFT (Fast Fourier Transform). This apparatus determines the phase coefficients as constantly “1” when performing the FHT, and changes the input order of input data to a reverse order of bits when performing the FFT. In addition, the ... 06/23/05 - 20050138098 - Fft/ifft processor An FFT/IFFT processor having computation logic capable of processing butterfly operations, and storage for storing the operands of butterfly operations, including a mechanism for storing the operands of multiple consecutive butterfly operations in contiguous storage locations and wherein the computation logic is capable of simultaneously accessing and processing said multiple ... 06/23/05 - 20050138097 - One-dimensional fourier transform program, method and apparatus A one-dimensional Fourier transform program for quickly performing a one-dimensional Fourier transform intended for a scalar computer comprises a step of resolving a data length N of one-dimensional data into the product of factors N1×N2× . . . ×Nm, a step of setting the data length N as P×Q, calculating ... 06/16/05 - 20050131976 - Fft operating apparatus of programmable processors and operation method thereof A fast Fourier transform (FFT) operating apparatus and a method thereof operate the FFT corresponding to a kernel function unit of DMT (Discrete Multitone) and OFDM (Orthogonal Frequency Division Multiplexing) modems to transmit a data with high speed in a programmable processor capable of processing a high speed telecommunication algorithm ... ### FreshPatents.com Support |