Design of OFDM Transmitter and

Receiver for Error Free Communication

Difference between fdm and

ofdm

Advantage of ofdm

Importance of being
orthogonal

The main concept of ofdm is subcarriers. since all carriers are sine wave
and cosine wave we know that area under one period is sine wave or a
cosine wave is zero.

Key to understand ofdm

Lets take sine wave of frequency m
and multiply with sinusoid of
frequency n
F(t)=sin (mwt)*sin (nwt)

TYPICAL OFDM STRUCTURE

REFERENCE:
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 45,
NO. 12.
AUTHOR:
Timothy M. Schmidl and Donald C. Cox, Fellow, IEEE

ANOTHER REFRENCE

REFERENCE :
IEEE TRANSCATIONS ON CONSUMER ELECTRONICS VOLUME:44 NO:01
AUTHOR:HSIEH AND WEI NATIONAL CHIAO TUNG UNIVERSITY

OFDM STRUCTURE

SCRAMBLER
Data bits are given to the transmitter
as inputs. These bits pass through a
scrambler that randomizes the bit
sequence.
This is done in order to make the
input sequence more disperse so
that the dependence of input signals
power spectrum on the actual
transmitted data can be eliminated

INPUT OUTPUT DIAGRAM

TYPICAL SCRAMBLER
STRUCTURE

CIRCUIT DIAGRAM

SCRAMBLER RESULTS

REED-SOLOMON ENCODER
Reed Solomon coding is an errorcorrection coding technique. Input
data is over-sampled and parity
symbols are calculated which are
then appended with original data
The primitive polynomial used in the
proposed design for GF (2^4) is,
P(X) =1 + X + X^4

RS (n, k) code

POLYNOMAIL EQUATION
G(X) = (X +)( X + 2)( X + 3 )( X +
4)( X + 5)
G( X ) = 6 + 9 X + 6 X 2 + 4 X
3
+ 14 X 4 + 10 X 5 + X 6

Top-level structure of the Reed

Solomon Encoder

Detailed architecture of Reed

Solomon Encoder

Result

CONVOLUTIONAL ENCODER
This coder adds redundant bits as well.
In this type of coding technique each m
bit symbol is transformed into an n bit
symbol; m/n is known as the code rate.
This transformation of m bit symbol
into n bit symbol depends upon the last
k data symbols, therefore k is known as
the
constraint
length
of
the
Convolutional code

Input output diagram

Circuit diagram

Result

INTERLEAVER
Interleaving is mainly used in digital
data transmission technology, to
protect the transmission against
burst errors
These errors overwrite a lot of bits in
a row, but seldom occur. The device
that performs interleaving is known
as Interleaver

THE CONCEPT OF
INTERLEAVING

TOP LEVEL ARCHITECTURE

CIRCUIT DIAGRAM

Result
The waveform for the interleaver goes
upto 128 clock cycles. Therefore, it is not
shown here. For an input block of data
containing alternate 1s and 0s the output
was
out:
000000001111111100000000111111110
0000000.so on This clearly shows
how bit positions have been changed.

CONSTELLATION MAPPER
Constellation Mapper maps the incoming
bits onto separate sub-carriers.
In the proposed design there are 64 subcarriers and each of them is modulated
using QPSK,therefore the function of
Constellation Mapper would be to map
every two bits on a single carrier,
because in QPSK two bits make up one
symbol.

CONTELLATION DIAGRAM

INPUT OUTPUT DIAGRAM

CONSTELLATION MAPPER
RESULTS

INVERSE FAST FOURIER TRANSFORM

This is the most important block in
the OFDM communication system.
It is IFFT that basically gives OFDM
its orthogonality
It converts a number of complex data
points into the same number of
points in time domain
The equation for DFT is:

IFFT DESIGN
Basically there are two ways to
implement FFT in hardware, one is
using pipelined architecture and the
other
is
using
memory-based
architecture
proposed
design
pipelined
architecture has been chosen in
order to make the FFT design area
efficient

IFFT I/O diagram

Butterfly diagram of 64-point-2^2

IFFT Results

CYCLIC PREFIX ADDER

Cyclic prefix is basically a replica of a
fractional portion of the end of an
OFDM symbol that is placed at the
beginning
of
the
symbol.
It
completely removes inter-symbol
interference that can occur due to
Multipath. Cyclic prefix is effective
only if its duration is greater than the
delay spread

Top-level architecture of the cyclic

prefix adder

CYCLIC PREFIX ADDER

RESULTS

RECEIVER
The OFDM receiving unit receives its
input directly from the transmitter
whenever its output is available. The
receiver follows an exact reverse
procedure of which was followed in
the transmitter. It receives the
complex (modulated) output points
and performs demodulation and
recovers the original bits sent to the
transmitter.

I/O DIAGRAM OF THE

RECEIVER

CYCLIC PREFIX REMOVER

The cyclic prefix was added at the
transmitting end in order to avoid intersymbol
interference,
therefore
during
reception it must be eliminated for any further
processing of the received signal. This is done
by simply skipping the first eight sub-carriers
in the received OFDM symbol. In hardware this
is implemented in the control unit. The control
unit only enables the next block (FFT) when
the first eight bits of the received OFDM
symbols have been skipped.

FAST FOURIER TRANSFORM

Details on FFT/IFFT algorithm and hardware
implementation were given in the previous slide.
The only difference being that if it was given for
IFFT (although FFT was mentioned at some
places). In order to implement FFT in hardware
the algorithm is same, only the difference is that
the divider is removed and the real and
imaginary parts at the input are swapped i.e. real
becomes imaginary and imaginary becomes real.
Same goes for the output i.e. real and imaginary
parts at the output are swapped as well.

FFT Block diagram

CONSTELLATION DEMAPPER
The function of the constellation
demapper is to map the QPSK
symbols (complex numbers) coming
from the output of FFT to the data
points shown in the constellation
diagram. Basically it is the inverse
procedure of what was done in the
constellation
mapper
at
the
transmitter.

QPSK constellation diagram

I/O DIAGRAM OF CONSTELLATION DEMAPPER

CONSTELLATION DE-MAPPER
RESULTS

DE-INTERLEAVER
In the previous chapter interleaving
was defined as a process in which
bits, within a block of 128 bits, are
re-arranged in order to avoid burst
errors. De-interleaving performs the
inverse task. It re-arranges the
interleaved bits into their original
order.

VITERBI DECODER
The
Viterbi
Decoder
decodes
Convolutional codes. We have used
the Alteras Viterbi Decoder IP core in
our design. Alteras Viterbi IP core is
a parameterized IP core that is
synthesizable and allows for parallel
as well as hybrid implementation of
the Viterbi decoder.

REED SOLOMON DECODER

The Reed Solomon decoder decodes
the codes generated by the Reed
Solomon
Encoder.
For
the
implementation of the Reed Solomon
Decoder we have again used Alteras
Reed Solomon Decoder IP.

DESCRAMBLER
This block simply descrambles the
scrambled data.

De-scrambler logic diagram

DE-SCRAMBLER RESULTS

Utilization of FPGA

CONCLUSSION
As mentioned in the objectives, Orthogonal Frequency Division Multiplexing (OFDM)
system for error free transmission was successfully developed using Verilog HDL. The
output from each module was tested using appropriate software to ensure the correctness
of the output result. On the transmitter part there are eight blocks which consists of
Scrambler, Read Solemn Encoder, Convolution encoder, Interleaver, Constellation mapper,
IFFT, Addition of cyclic prefix. During the implementation stage, the operation for IFFT was
tested using Matlab software. Since IFFT is based on mathematical operation, Matlab is the
best platform to compare the computation result. The comparison result shows that IFFT
module is working correctly as the Matlab computation. Some computation gives slightly
different from Matlab especially in imaginary value and this problem has been discussed in
the analysis and discussion chapter. Thus, base on the test result, it was concluded that
IFFT module was viably used in transmitter part as processing module.

 The same process was done at the receiver part whereby each of the
modules was tested during design process. On the implementation
stage, FFT operation was tested using Matlab software. From the result
shown in the results chapter, FFT module was correctly operated as
Matlab computation. The different was only that the result of the FFT
computation was in decimal while Matlab provide in floating point value.
Other modules such as Scrambler, Read Solemn Encoder, Convolution
encoder, Interleaver, Constellation mapper and Addition of cyclic prefix
module was correctly worked. Thus, this module can be used as part of
the OFDM system. The waveform result for these modules was given in
the results.

REFERENCES
[1] Ahmed R. S. Bahai and Burton R. Saltzberg, Multi Carrier Digital Communications.
Kluwer Academic Publishers, 2002.
[2] Encoding-Decoding Reed Solomon codes, Adina Matache Department of Electrical
Engineering University of Washington
http://www.ee.ucla.edu/~matache/rsc/node3.html#SECTION000210000000000
[3] A Tutorial on Convolutional Coding with Viterbi Decoding, Spectrum Applications
http://home.netcom.com/~chip.f/viterbi/tutorial.html.
[4] Jeffrey G. Andrews, Rias Muhammad, Fundamentals of WIMAX. Prentice Hall
Communications Engineering, 2006.
[5] Aseem Pandey, Shyam Ratan Agrawalla & Shrikant Manivannan, VLSI
Implementation of OFDM, Wipro Technologies, September 2002.
[6] Dusan Matiae, OFDM as a possible modulation technique for multimedia applications
in the range of mm waves, TUD-TVS, 1998.

[7] Doelz, M.L., Heald E.T. and Martin D.L. "Binary Data Transmission Techniques for
Linear Systems." Proc. I.R.E., 45: 656-661, May 1957.
[8] S. B. Weinstein and P. M. Ebert, Data transmission by frequency-division multiplexing
using the discrete Fourier transform, IEEE Trans. Communications, COM-19(5): 628634, Oct. 1971.
[9] Orthogonal Frequency Division Multiplexing Tutorial, Intuitive guide to Principles of
Communications http://www.complextoreal.com
[10] Magis Networks White paper, Orthogonal Frequency Division Multiplexing(OFDM)
Explained, Inc. 2001
[11] Orthogonal Frequency-Division Multiplexing (OFDM), the International Unionof
Radio Science (URSI), Lulea University of Technology, 2002
[12] Michael D. Ciletti, Advanced Digital Design with the Verilog HD Xilinx Design
Series.Prentice Hall, 2002.
[13] Bernard Sklar. Digital Communications- Fundamentals and
Applications.Communication Engineering Services, Tarzana, California, 2003
[14] Fast Fourier Transform, Molfram
MathWorldmathworld.wolfram.com/FastFourierTransform.html

THANK YOU