Beruflich Dokumente
Kultur Dokumente
Abstract—In this paper, we make insightful assessment of the unique frequency and combined together using the Inverse
computational performance of orthogonal frequency division Fast Fourier Transform (IFFT) to yield the time domain
multiplexing (OFDM) system in terms of complex calculations
waveform to be transmitted [3]. After IFFT is done, the time
required using different Fourier transform techniques. We
briefly introduce the different transform technique, viz. discrete domain signals are then converted to serial data and cyclic
Fourier transform (DFT) and various types of fast Fourier extension is added to the signal. Then the signal is transmitted
transform (FFT) as 2-radix FFT, 4-radix FFT etc. We have also .At the receiving side we do the reverse process to get original
discussed about a new FFT approach that can be applied in an data from the received one. In case of deep fade several
OFDM system and shown comparison of it with other FFT symbols in single carrier is damaged seriously, but in parallel
techniques. transmission each of N symbol is slightly affected. So though
the channel is frequency selective sub-channel is flat or
Keywords—- Orthogonal frequency division multiplexing
(OFDM); Discrete Fourier transform (DFT); Fast Fourier slightly frequency selective. This is why OFDM provide good
transform (FFT); protection against fading.
B. Radix-2 FFT Algorithm So, the four N/4 points DFT are obtained from the above
For speed demanding applications which requires expression, which are combined in previous expression to
implementation of FFT algorithm, FFT algorithms are evaluate N-point DFT. So this algorithm results in (3N/8)
decimated in terms of time or frequency. If we consider N log2N complex multiplications and (3N/2) log2N complex
points of data where it can be factored as N = rv. In such case, additions. So the number of multiplications is reduced by
DFTs are of r size and the number r is called radix of the FFT 25%, but the number of addition is increased by 50%.
algorithm. So, in radix-2 FFT N= 2V .
If N-point data sequence is decimated by a factor of 2, it is IV. DEVELOPMENT OF A NOVEL FFT
called radix-2 algorithm. Now from expression of N-point
DFT, we can get In an OFDM system we use modulation techniques such as
BPSK, 4-QAM, 16-QAM, 64-QAM etc. For a particular
X (k ) = ∑ x (n)WN + ∑ x (n)WN
kn kn (6)
QAM technique fixed symbols are sent. This paper converses
even odd
( N / 2 ) −1 ( N / 2 ) −1
an FFT algorithm that works faster for different QAM
techniques.
= ∑ x(2m)W
m =0
2 mk
N + ∑ x(2m + 1)W
m=0
( 2 m +1) k
N
(7)
DFT_ xN (1,2) = Wa(1,2)+ Wb(2,2)+ Wb(3,2)+ Wa(4,2); TABLE I. COMPARISON OF DIFFERENT FOURIER TRANSFORM
DFT_ xN (1,3) = Wa(1,3)+ Wb(2,3)+ Wb(3,3)+ Wa(4,3); OFDM Complex Complex Complex Complex Complex
Block, multiplicatio multiplicatio multiplicatio multiplicat multiplicat
n n n ion ion
DFT_ xN (1,4) = Wa(1,4)+ Wb(2,4)+ Wb(3,4)+ Wa(4,4); N In DFT In FFT In novel In novel In novel
algorithm FFT FFT FFT
Now, if xN =[1 1 -1 1] . Then xN(1,1)= 1 ; xN(1,2)= 1 ; N2 algorithm algorithm algorithm
(N/2)log2 N (4QAM) (16QAM) (64QAM)
xN(1,3)= -1 & xN(1,4)= 1;
4 16 4 16 256 4096
then DFT_ xN (1,1) = Wa(1,1)+ Wa(2,1)+ Wb(3,1)+ Wa(4,1) ;
8 64 12 16 256 4096
DFT_ xN (1,2) = Wa(1,2)+ Wa(2,2)+ Wb(3,2)+ Wa(4,2); 16 256 32 16 256 4096
32 1024 80 16 256 4096
DFT_ xN (1,3) = Wa(1,3)+ Wa(2,3)+ Wb(3,3)+ Wa(4,3);
64 4096 192 16 256 4096
DFT_ xN (1,4) = Wa(1,4)+ Wa(2,4)+ Wb(3,4)+ Wa(4,4) ; 128 16384 448 16 256 4096
256 65536 1024 16 256 4096
So, in this way by storing Wa & Wb we can avoid repeated
complex multiplications. All we have to do is to identify what
512 262144 2304 16 256 4096
value of xN is in what position of xN matrix and according to 1024 1048576 5120 16 256 4096
that we have to pull required value from Wa & Wb matrices 2048 4194304 11264 16 256 4096
and do the required additions.
B. 4-QAM
Figure 2 gives the comparison between DFT, Radix-2 FFT and
In 4-QAM modulation technique we are sending
our FFT in terms of complex multiplications done.
four symbols. They are:(1+j), (1-j),(-1+j)&(-1-j) .
VII. CONCLUSIONS
[4] Proakis J.G., Manolakis D.G “Digital Signal Processing :Principles,
Algorithms And Applications” Third edition, chap.-6, Pages 448-475,
The performance of an OFDM system depends on DFT/FFT 2002.
as in an OFDM system DFT/FFT works as an modulator. If
the computational complexity of DFT/FFT decreases, then the [5] Langton C. “Orthogonal frequency divisional multiplex (OFDM)
speed of OFDM system will increase. This novel FFT tutorial” at www.complextoreal.com [Last accessed: July 13, 2006].
algorithm decreases computational complexity by discarding
repeated calculations. As a result it increases the speed as well [6] Wirastuti N., Noras J.M., Jones S.M.R. ”Evaluation of the very fast
as the performance of OFDM system. fourier transform applied to OFDM” , 2nd IEE-EURASIP DSPEnabled
Radio Conference, 19-20Sept, 2005, Southampton, UK
ACKNOWLEDGEMENT
[7] Zalewski M. , Schuupp S.”FFT implementations” RPI, NY
The authors would like to thank Mr. Shahriar Rahman &
Mr. Riaz Raihan Haque for their extended assistance with [8] Goldsmith, A., Wireless Communications, first edition, Cambridge
University Press, 2005.
lecture notes of Professor Sheng Chen during the time of this
work.
[9] Shafik, Rishad A. Technical Report, “Personal Multimedia
Communication- Simulations and Analyses”.
REFERENCES
[10] Prasad H. “Simulation and Software Radio for Mobile Communication”,
[1] Eric Phillip Lawrey B.E. “Adaptive Techniques for Multi-user OFDM”, Chap-4, pp. 165-169.
pp.33-34,2004.
[2] Chen S., Lecture note“ Fast Fourier Transform” in lectures of Radio
Communications Networks and Systems, 2005.