Mechanism for calculating one-dimensional fast fourier transform

Details Mechanism for calculating one-dimensional fast fourier transform Mechanism for calculating one-dimensional fast fourier transform

1998-07-27

2000-07-11

Ngo, Chuong Dinh

Electrical computers: arithmetic processing and calculating

Electrical digital calculating computer

Particular function performed

G06F 1500

Patent

active

060887141

ABSTRACT:
The inventive mechanism uses seven steps to perform the mathematic equivalent to performing one large FFT on the input data. The input data array is decomposed into a plurality of squares. In first step, each of the squares has their respective points swapped across their main diagonals. In the second step, small FFTs are calculated for each of the squares. In the third step, the data is transposed in each of the squares as the first step. In fourth step, the data is oriented into a column format, which are multiplied by the twiddle coefficients. In the fifth step 75, small column oriented FFTs are calculated. The results of each of steps 4 and 5 is in a work array which is small enough to remain in cache. In the sixth step, columns data are transposed and stored into a columns of the squares. In the seventh step, the data is transposed in each of the squares as the first and third steps. This mechanism reduces cache misses, and allows for parallel processing.

REFERENCES:
patent: 4821224 (1989-04-01), Liu et al.
patent: 4977533 (1990-12-01), Miyabayashi et al.
patent: 5034910 (1991-07-01), Whelchel et al.
patent: 5233551 (1993-08-01), White
patent: 5751616 (1998-05-01), Hegland et al.
patent: 5968112 (1999-10-01), Kirschenbaum et al.

Affiliated with

Also associated with

Rating

Mechanism for calculating one-dimensional fast fourier transform does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Mechanism for calculating one-dimensional fast fourier transform, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mechanism for calculating one-dimensional fast fourier transform will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-552379