Broadband Wireless Communication Multicore FFT Mapping And VLSI Implementation

The development of broadband wireless communication standards meeting the increasing requirements of customers, require a higher and better OFDM system. With the further development of the baseband processor, standards now are more and more compatible, and Fast Fourier Transform (FFT) and its inverse transform (IFFT) as one of the key modules in OFDM system, which should be able to work in faster system, also need lower power consumption and a high degree of configurability. As the main direction of research, this paper studied the FFT processor in OFDM systems, a number of key technologies and related applications, the main research work in the following areas:1. Analyze and compare the current classic algorithm:Cooley-Turkey algorithm, prime factor algorithm (PFA), butterfly, and Winograd FFT algorithm. We compare the similarities and differences, advantages and disadvantages of the algorithm. We study the application of3780-point FFT which is adopt in the china standard digital terrestrial Multimedia Broadcasting (DTMB) using PFA algorithm, Cooley-Turkey algorithm, Winograd FFT algorithm.2. We design and map the implementation of the3780-point FFT mapping in multi-core platform, we study the differences between mapping in multi-core platform and ASIC design. And we manage to mapping a3780-point FFT in multi-core platform with sample rate of32.64M Sample/s.3. We compare the performance between the mapping and ASCI design according the result of mapping3780-point in multi-core platform.4. We design a FFT processor that can meet the requirement of LTE/LTE-Advanced, WiMAX, WLAN. The FFT processor can deal with the64/128/256/512/1024/1536/2048-point FFT. And the implementation in SMIC0.13um is shown.