FAST FOURIER TRANSFORM APPARATUS FOR OUTPUTTING DATA IN REPOSITIONED ORDER

PURPOSE: An FFT(Fast Fourier Transform) apparatus is provided to output repositioned orders as data by converting an address for the output data or by adding a multiplexer. CONSTITUTION: A memory bank(310) stores input and output data for a butterfly computation. A twiddle factor storing module(320)...

Full description

Saved in:
Bibliographic Details
Main Author KOO, BON YOUNG
Format Patent
LanguageEnglish
Korean
Published 12.09.2012
Subjects
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online AccessGet full text

Cover

More Information
Summary:PURPOSE: An FFT(Fast Fourier Transform) apparatus is provided to output repositioned orders as data by converting an address for the output data or by adding a multiplexer. CONSTITUTION: A memory bank(310) stores input and output data for a butterfly computation. A twiddle factor storing module(320) stores twiddle factor for the butterfly computation. A butterfly computation module(330) includes a radix-2 butterfly computation(331). The radix-2 butterfly computation module executes the butterfly computation by receiving the twiddle factor read from the twiddle factor storage module, second input data read from the second address of the memory bank, and first input data read from the first address of the memory bank. [Reference numerals] (311) First memory bank; (312) Second memory bank; (320) Twiddle factor storage module; (331) Radix-2 butterfly calculator; (332) Multiplexer unit; (340) Control module; (AA) Input
Bibliography:Application Number: KR20110018929