Modulation apparatus using mixed-radix fast fourier transform
AssigneesSamsung Electronics Co., Ltd., Daewoo Educational Foundation
InventorMyung-Hoon Sunwoo
Life of this patent
Estimating the term…
Abstract
An FFT (Fast Fourier Transform) processor is disclosed which is a core block of an OFDM (Orthogonal Frequency Division Multiplexing) or DMT (Discrete Multi-tone) MODEM. The FFT processor simultaneously performs sequential input and output by applying an in-place algorithm for a mixed-radix multi-bank memory, thereby realizing continuous processing with only a 2N-word memory having 4 banks. The FFT processor minimizes its complexity while satisfying a high-speed calculation requirement.
Claims11
A modulation apparatus using a mixed-radix fast Fourier transform (FFT), comprising:
- an input/output interface for selecting a memory for input/output among memories for input/output and FFT calculation, selecting one of four banks of the selected memory, and performing input and output on the selected bank;
- two N-word memories each having four banks used for input/output to the input/output interface and FFT calculation;
- a first data exchange for selecting a memory for FFT calculation among the memories for input/output to the input/output interface and FFT calculation, and connecting banks assigned to each butterfly input/output to 4 inputs of a butterfly calculation circuit for in-place calculation;
- a butterfly for performing a radix-4 butterfly and a radix-2 butterfly provided from the first data exchange with one circuit, and forming a symmetric reverse output;
- a second data exchange for selecting a memory for FFT calculation among the memories for input/output to the input/output interface and FFT calculation, and connecting banks assigned to each butterfly input/output to four outputs of a butterfly calculation circuit for in-place calculation;
- and
- an address generator for generating a bank index and an address for performing in-place calculation in a multi-bank memory structure.
A modulation apparatus using a mixed-radix fast Fourier transform (FFT), comprising:
- two memories each having four banks, for writing input symbols or FFT-calculated symbols;
- a butterfly for performing butterfly calculation in a radix-4 mode or a radix-2 mode according to the number of symbols output from the memories, and outputting the calculated values in a symmetric reverse;
- a first data exchange for reading one symbol from each bank of one of the memories and outputting the read symbol to the butterfly;
- a second data exchange for matching calculated symbols output from the butterfly so that the symbols are written in the same addresses as addresses where the symbols were read from the first data exchange;
- and
- an address generator for controlling an output of the second data exchange so that when a symbol read from the first data exchange is output through the second data exchange after being calculated, a bank and an address where the symbol was read from the first data exchange are identical to an output bank and an output address of the second data exchange.
Dependencies are inferred from the claim text.