Fast fourier transform (FFT) architecture in a multi-mode...

Details Fast fourier transform (FFT) architecture in a multi-mode... Fast fourier transform (FFT) architecture in a multi-mode...

2005-08-08

2010-06-08

Ngo, Chuong D (Department: 2193)

Electrical computers: arithmetic processing and calculating

Electrical digital calculating computer

Particular function performed

Reexamination Certificate

active

07734674

ABSTRACT:
A system and method Fast Fourier Transform (FFT) method in a multi-mode wireless processing system. The method can include loading an input vector into an input buffer, initializing a second counter and a variable N, where N=log2(input vector size), and s is the value of the second counter, performing an FFT stage, and comparing s to N and performing additional FFT stages until s=N. Performing the FFT stage can include performing vector operations on data in the input buffer and sending results to an output buffer, the data in the input buffer comprising a plurality of segments, advancing the value of the second counter; and switching roles of the input and output buffers. The vector operations can include performing Radix-4 FFT vector operations on the four input data at a time and multiplying the resulting output vectors with a Twiddle factor.

REFERENCES:
patent: 4096567 (1978-06-01), Millard et al.
patent: 4500954 (1985-02-01), Duke et al.
patent: 4541048 (1985-09-01), Propster et al.
patent: 4602350 (1986-07-01), Gray
patent: 5059892 (1991-10-01), Stoft
patent: 5200925 (1993-04-01), Morooka
patent: 5220668 (1993-06-01), Bullis
patent: 5293623 (1994-03-01), Froniewski et al.
patent: 5329678 (1994-07-01), Bagnasco
patent: 5483640 (1996-01-01), Isfeld et al.
patent: 5884055 (1999-03-01), Tung et al.
patent: 5986715 (1999-11-01), Ikeyama et al.
patent: 5991265 (1999-11-01), Lincoln
patent: 6188723 (2001-02-01), Lee et al.
patent: 6192408 (2001-02-01), Vahalia et al.
patent: 6260150 (2001-07-01), Diepstraten et al.
patent: 6397273 (2002-05-01), Chilton
patent: 6438667 (2002-08-01), Shinozaki
patent: 6442580 (2002-08-01), Machida
patent: 6467053 (2002-10-01), Connolly et al.
patent: 6473839 (2002-10-01), Kremser et al.
patent: 6785892 (2004-08-01), Miller et al.
patent: 6810308 (2004-10-01), Shajii et al.
patent: 6880070 (2005-04-01), Gentieu et al.
patent: 7233968 (2007-06-01), Kang
patent: 7319702 (2008-01-01), Moll et al.
patent: 7395293 (2008-07-01), Szedo et al.
patent: 7457726 (2008-11-01), Nguyen et al.
patent: 7519793 (2009-04-01), Abdelillah et al.
patent: 2001/0004209 (2001-06-01), Williams
patent: 2002/0023115 (2002-02-01), Kanasugi et al.
patent: 2002/0116595 (2002-08-01), Morton
patent: 2004/0071104 (2004-04-01), Boesel et al.
patent: 2004/0172631 (2004-09-01), Howard
patent: 2004/0210797 (2004-10-01), Kimelman et al.
patent: 2005/0044457 (2005-02-01), Jeddeloh
patent: 2005/0060705 (2005-03-01), Katti et al.
patent: 2005/0119025 (2005-06-01), Mohindra et al.
patent: 2006/0010263 (2006-01-01), Kim
patent: 2006/0063520 (2006-03-01), Fratti et al.
patent: 2006/0206898 (2006-09-01), Miner et al.
patent: 2007/0008984 (2007-01-01), Philips et al.
patent: 2007/0030801 (2007-02-01), Werner et al.
patent: 2007/0033244 (2007-02-01), Cohen et al.
patent: 2007/0033245 (2007-02-01), Myers et al.
patent: 2007/0033349 (2007-02-01), Myers et al.
patent: 2007/0033593 (2007-02-01), Myers et al.
Stokes, “Understanding bandwidth and latency.” Nov. 2002, ARS Technica, p. 1-5.
International Search Report from PCT Application PCT/US2005/032177.
Office Action in corresponding Chinese Application 20058005131.6, issued Jun. 5, 2009.
U.S. Appl. No. 11/199,560 Final Office Action mailed Jun. 1, 2009.
U.S. Appl. No. 11/199,372 Non-Final Office Action mailed Jun. 10, 2009.
U.S. Appl. No. 11/199,576 Non-Final Office Action mailed Mar. 23, 2009.
U.S. Appl. No. 11/199,564, Office Action mailed Oct. 26, 2009.

Affiliated with

Also associated with

Rating

Fast fourier transform (FFT) architecture in a multi-mode... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Fast fourier transform (FFT) architecture in a multi-mode..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast fourier transform (FFT) architecture in a multi-mode... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4236332