By Topic

Fixed point FFT algorithm realization in OFDM channel estimation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Bin Li ; 54th Res. Inst., CETC, Shijiazhuang, China ; Jinsheng Yang ; Wei Yang ; Xinming Shao

In this paper, four schemes for the fixed point Fast Fourier transform (FFT) algorithm are discussed. Comparisons are made in tradeoff between accuracy and complexity. Several results are obtained through simulation. First, the fixed point schemes given by Welsh and Int-FFT (Integer FFT) scheme by S. Oraintara are compared. Also, the upper bound given by Welsh is tested. Second, based on the comparison, two different methods are chosen for OFDM channel estimation. Our contribution here is that we use two different schemes to perform IFFT and FFT separately. Before being put into implementation, a little change in the fixed-point scheme is made. Last, mean squared errors (MSE) are compared between the float point channel estimation algorithm for OFDM systems and its fixed-point counterpart. The simulation result shows that these two performances are almost the same above 14-bit data quantization. In the paper, accuracy is the main concern and radix-2 is in use.

Published in:

Cross Strait Quad-Regional Radio Science and Wireless Technology Conference (CSQRWC), 2011  (Volume:2 )

Date of Conference:

26-30 July 2011