Fast fourier transform apparatus and method

US6434583B1 · kind B1 · utility

Assignee

• ADC Telecommunications, Inc. · US

Inventors

• Mark J. Dapper · Cincinnati, US
• Michael J. Geile · Loveland, US
• Terrance J. Hill · Sharonville, US
• Harold A. Roberts · Eden Prairie, US
• Brian D. Anderson · Plymouth, US
• Jeffrey Brede · Eden Prairie, US
• Mark S. Wadman · Plymouth, US
• Robert J. Kirscht · Savage, US
• James J. Herrmann · Eagan, US
• Michael J. Fort · Eagan, US
• Steven P. Buska · Minnetonka, US
• Jeff Solum · Bloomington, US
• Debra Lea Enfield · Chaska, US
• Darrell Berg · Bloomington, US
• Thomas Smigelski · Lake Zurich, US
• Thomas C. Tucker · Chapel Hill, US
• Joe Hall · Winfield, US
• John M. Logajan · Arden Hills, US
• Somvay Boualouang · Bloomington, US
• Heng Lou · Bloomington, US
• Mark Elpers · Elk River, US
• Matt Downs · Bloomington, US
• Tammy Ferris · Bloomington, US
• Adam Opoczynski · Plano, US
• David S. Russell · Minneapolis, US
• Calvin G. Nelson · Shorewood, US
• Niranjan R. Samant · Lansdale, US
• Joseph F. Chiappetta · Trumbull, US
• Scott Sarnikowski · Plymouth, US

Key dates

• Filing date: Sep 15, 1999
• Grant date: Aug 13, 2002
• Expiry date: Sep 15, 2019

Classification

• Technology area (CPC Y): Emerging Cross-Sectional Technologies
• CPC primary: Y02D30/50
• WIPO field: Audio-visual technology
• WIPO sector: Electrical engineering

Abstract

A apparatus for providing a Fast Fourier Transform (FFT) and an inverse FFT is provided. The apparatus comprises a radix-N core. The radix-N core includes at least N multipliers. The radix-N core also includes a twiddle-factor lookup table that stores complex twiddle-factors. The twiddle-factor lookup table is coupled to one input of each of the multipliers. The radix-N core also includes a conversion random access memory (RAM) that stores transform points. The conversion RAM is coupled to another input of each of the multipliers. The radix-N core also includes an array of at least N-times-N adder-subtracter-accumulators.