Method for efficiently computing a fast fourier transform

Details Method for efficiently computing a fast fourier transform Method for efficiently computing a fast fourier transform

2006-06-13

2006-06-13

Ingberg, Todd (Department: 2193)

Electrical computers: arithmetic processing and calculating

Electrical digital calculating computer

Particular function performed

C708S403000

Reexamination Certificate

active

07062523

ABSTRACT:
A method for computing an out of place FFT in which each stage of the FFT has an identical signal flow geometry. In each stage of the presently disclosed FFT method the group loop has been eliminated, the twiddle factor data is stored in bit-reversed manner, and the output data values are stored with a unity stride.

REFERENCES:
patent: 4899301 (1990-02-01), Nishitani et al.
patent: 5430888 (1995-07-01), Witek et al.
patent: 5694347 (1997-12-01), Ireland
patent: 5941940 (1999-08-01), Prasad et al.
patent: 5951627 (1999-09-01), Kiamilev et al.
patent: 6098088 (2000-08-01), He et al.
patent: 6115728 (2000-09-01), Nakai et al.
patent: 6182103 (2001-01-01), Zierhofer
patent: 6263356 (2001-07-01), Kozaki et al.
patent: 6356926 (2002-03-01), Andre
patent: 6421696 (2002-07-01), Horton
patent: 6430587 (2002-08-01), Orling
patent: 6609140 (2003-08-01), Greene

Affiliated with

Also associated with

Rating

Method for efficiently computing a 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 Method for efficiently computing a fast fourier transform, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for efficiently computing a fast fourier transform will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3621486