OFDM dan MIMO

Yuris Mulya Saputra

V3TE3122 / Komunikasi Modern
Departemen TEDI Sekolah Vokasi
Universitas Gadjah Mada

Semester Gasal 2017 / 2018

 Subject Contents
OFDM
MIMO

Yuris Mulya Saputra / V3TE3122 / 2017

Konsep Dasar

Yuris Mulya Saputra / V3TE3122 / 2017

 OFDM Material
• Multicarrier communications
• Synchronization
• Issues
– Synchronization
– Sidelobes
• OFDMA

Yuris Mulya Saputra / V3TE3122 / 2017

 Intersymbol Interference
BER Floor for various modulations
• Occurs when symbol period (Ts) is 10-1
less than channel delay spread,  Coherent Detection
+ BPSK
• ISI introduces an error floor to BER QPSK
OQPSK Modulation
x MSK
– Limits maximum throughput
• Solutions: x

Irreducible BER
10-2
x
– Equalization (high complexity)
x
– Longer symbol periods (generally +

means lower data rate) x

+

+
10-3
QPSK limit +
x

10-4
10-2 10-1 100
delay spread 
=
symbol period T
Yuris Mulya Saputra / J.V3TE3122 / 2017
C.-I. Chuang, "The Effects of Time Delay Spread on Portable Radio
Communications Channels with Digital Modulation," IEEE JSAC, June 1987
 Multicarrier communications: Longer
period, same data rate
•Concept:
–Divide original data stream at rate R
into L lower rate (R/L) streams on
different carriers to increase symbol
time

J. Andrews, A. Ghosh, R. Muhamed, Fundamentals

of WiMAX, Prentice Hall, 2007

Yuris Mulya Saputra / V3TE3122 / 2017

 OFDM
• Much simpler to create multicarrier transmission using iFFT
– Information carried in magnitude and phase of each bin
– Then can be recovered by using FFT at receiver

• Inverse Fourier transform would

be an infinite duration sine wave Magnitude

T0
– Cut at Symbol duration Ts
– Rectangular windowing causes sinc
spectrum in frequency domain with
zeros at 1/Ts
– Orthogonal subcarriers
Frequency

Yuris Mulya Saputra / V3TE3122 / 2017

 What is OFDM ??
Orthogonality in frequency domain…

• Each carrier is modulated using BPSK / QPSK / M-ary QAM

• Frequency response for each carrier is a Sinc(X)
• Overlap of frequency response is possible as against FDM where inter-carrier
spacing is a must
• Frequency responses of the carriers overlap at zero crossings avoiding Inter
Carrier Interference
Yuris Mulya Saputra / V3TE3122 / 2017
What is OFDM ??
Orthogonality in frequency domain…

Yuris Mulya Saputra / V3TE3122 / 2017

 Advantages of OFDM
• Allows carriers to overlap (no guard band), resulting in lesser
wasted bandwidth without any Inter Carrier Interference (ICI)
• High data rate distributed over multiple carriers resulting in
lower symbol rate (more immune to ISI)
• Permits higher data rate as compared to FDM
• Increased security and bandwidth efficiency possible using
CDMA – OFDM (MC-CDMA)
• Simple guard intervals make the system more robust to
multipath effects.

Yuris Mulya Saputra / V3TE3122 / 2017

 Guard intervals and intersymbol
interference
Guard interval Guard interval

OFDM Symbol OFDM Symbol OFDM Symbol

Delay Spread Delay Spread

• If we space OFDM symbols by gaps at least as

long as the delay spread, then there will be no
intersymbol interference
• However, there will still be interference within
the symbol
Yuris Mulya Saputra / V3TE3122 / 2017
 Equalization and the DFT
• While using longer symbol timing means OFDM can avoid
irreducible errors, still have interfering energy in band from
multipath
– Received signal is the (linear) convolution of channel impulse response
with transmitted signal
y  h* x
• DFT Circular Convolution Theorem
– Circular convolution of two discrete vectors in time domain
y  xh
– Is multiplication in the frequency domain
Yk  X k H k
• Implication: If we can make the system behave like a circular
convolution, equalization is trivial
– complex multiplication per FFT bin at the receiver
Yuris Mulya Saputra / V3TE3122 / 2017
OFDM Tx and Rx

Yuris Mulya Saputra / V3TE3122 / 2017

 IFFT Transform
• Frequency domain (digital) to time domain
(analog)

Yuris Mulya Saputra / V3TE3122 / 2017

 FFT Transform
• Time domain to frequency domain

Yuris Mulya Saputra / V3TE3122 / 2017

 Cyclic Prefix
• Adding a cyclic prefix
at transmitter leads
to circular
convolution
• Note that misaligned
timing still results in
a circular
convolution, just
time shifted

Yuris Mulya Saputra / V3TE3122 / 2017

J. Andrews, A. Ghosh, R. Muhamed, Fundamentals
of WiMAX, Prentice Hall, 2007
Cyclic Prefix

Yuris Mulya Saputra / V3TE3122 / 2017

Cyclic Prefix

Yuris Mulya Saputra / V3TE3122 / 2017

Cyclic Prefix

Yuris Mulya Saputra / V3TE3122 / 2017

Cyclic Prefix

Yuris Mulya Saputra / V3TE3122 / 2017

Cyclic Prefix

Yuris Mulya Saputra / V3TE3122 / 2017

 Time Domain Frequency Synchronization

• Complex baseband model of passband signal

• ftx is transmitter carrier frequency, Ts is symbol

period, sn is transmitted signal
• Received

Yuris Mulya Saputra / V3TE3122 / 2017

 Time Domain Frequency Synchronization
• Evaluate sum of products of time-delayed and
conjugated repeated symbols

Yuris Mulya Saputra / V3TE3122 / 2017

Real OFDM Parameters

Yuris Mulya Saputra / V3TE3122 / 2017

Antenna Array Algorithms and
MIMO
 Antenna Array Principles
•The use of multiple antennas provide two forms of
diversity:
–Diversity gain
•Exploit multiple independent channels created by
multipath diversity
•Works with uncorrelated antennas
–Array gain
•Coherently combine energy from antennas
•Works even with perfectly correlated antennas as
received SNR increases linearly with the number of
receive antennas

Yuris Mulya Saputra / V3TE3122 / 2017

 Multiple Antenna Systems (MIMO)

 
TX   RX

NT NR
Transmit Receive Antennas
Antennas
NT  N R
Different paths
Two cases:
1. Array Gain: if all paths are strongly correlated to which other the SNR can be increased
by array processing;
2. Diversity Gain: if all paths are uncorrelated, the effect of channel fading can be
attenuated by diversity combining
Yuris Mulya Saputra / V3TE3122 / 2017
Receive Diversity:

h1
 y1

hN R  RX
TX
s
yNR

NT  1 NR NR
Transmit Different paths Receive Antennas
Antennas

 y1   h1   w1 
     
   
   S E s  N 0  
 y N  hN   wN 
 R  R  R
Energy per Noise PSD
symbol
Yuris Mulya Saputra / V3TE3122 / 2017
Assume we know the channels at the receiver. Then we can decode the signal as

NR NR NR
y   hi* yi  ES  | hi |2 s  N 0  hi* wi
i 1 i 1 i 1

signal noise

and the Signal to Nose Ratio

 NR 2  ES
SNR    | hi | 
 i 1  N0

Yuris Mulya Saputra / V3TE3122 / 2017

 NR
In the Wireless case the channels are random, therefore | h |
i 1
i
2
is a random variable

Now there are two possibilities:

1. Channels strongly correlated. Assume they are all the same for simplicity

h1  h2  ...  hN R  h
Then
NR
1 2

i 1
| hi |  N R | h |  N R  2
2 2

2
assuming  
E | h |2  1

and


SNR  N R | h |
ES 

1 2  ES
  NR 2 
N0 
2

2  N0

Yuris Mulya Saputra / V3TE3122 / 2017

From the properties of the Chi-Square distribution:

mSNR  ESNR  N R
ES
better on average …
N0

 SNR  varSNR 
N R ES
… but with deep fades!
2 N0

Define the coefficient of variation  SNR 1

 var  
mSNR 2

In this case we say that there is no diversity.

Yuris Mulya Saputra / V3TE3122 / 2017

2. Channels Completely Uncorrelated.

 NR 2  ES
SNR    | hi | 
 i 1  N0
NR
1 2
Since: i 1
| hi |   2 N R
2

 1 2  ES
SNR    2 N R 
2  N0 Diversity of order NR

with
ESNR  N R
ES
N0
 SNR 1
varSNR 
N R ES  var  
2 N0 mSNR 2 NR
Yuris Mulya Saputra / V3TE3122 / 2017
Example: overall receiver gain with receiver diversity.

15

10 N R  10
5
NR  2
0

-5

NR  1
-10

-15

-20

-25
0 20 40 60 80 100 120 140 160 180 200

Yuris Mulya Saputra / V3TE3122 / 2017

Transmitter Diversity
h1
 y

s TX  RX
hN R

NR  1
NT NT
Transmit
Receive Antennas
Antennas Different paths

 ES NT

y    hi  s  N 0 w Equivalent to one channel,
with no benefit.
 NT i 1 
Total energy equally distributed on
transmitYuris
antennas
Mulya Saputra / V3TE3122 / 2017
However there is a gain if we use Space Time Coding (2x1 Alamouti)
Take the case of Transmitter diversity with two antennas

h1
x1[n]
y[n]
TX h2 RX

x2 [n]
Given two sequences s1[n], s2 [n]
code them within the two antennas as follows
antennas

x1 s1 s * y[2n] 
ES
h1s1  h2 s2   N 0 w1
2
2
x2 s2 s1*

2n 2n  1 time
y[2n  1] 
ES
2
 
 h1s2*  h2 s1*  N 0 w2
Yuris Mulya Saputra / V3TE3122 / 2017
This can be written as:

 y[2n]  ES  h1 h2   s1   w1 
 y *[2n  1]   h* *  
 h1   s2 
 N0  * 
  2  2  w2 

To decode, notice that

 z1   h1* h2   y[2n]   ES  s
2  1  w1 
z    *
 2   h2
 *   
h1   y [2n  1]  2
|| h ||      
N 0 || h ||  
  s2   w2 

Yuris Mulya Saputra / V3TE3122 / 2017

It is like having two independent channels

ES N0 || h || w1
|| h ||2
2 z1
s1

s2 z2
ES
|| h ||2
2
N0 || h || w2

|| h ||2 ES 1 2
SNR  || h || | h1 |  | h2 |   4
2 2 2

2 N0 2

Apart from the factor ½ , it has the same SNR as the receive diversity of order 2.

Yuris Mulya Saputra / V3TE3122 / 2017

2x2 MIMO with Space Time Coding (2x2 Alamouti)

x1[n]
h11 y1[n]
h21
h12
TX RX

x2 [n] h22 y2 [n]

 y1[n]  h11 h12   x1[n]  w1[n]

 y [n]  h     
 2   21 22   2   2 
h x [n ] w [n ]

Yuris Mulya Saputra / V3TE3122 / 2017

Same transmitting sequence as in the 2x1 case:

antennas x1 s1  s2*
x2 s2 s1*

2n 2n  1 time

Received sequences:

y1[2n] 
ES
h11s1  h12s2   N 0 w1[2n]
2

y1[2n  1] 
ES
2
 
 h11s2*  h12s1*  N 0 w1[2n  1]

y2 [2n] 
ES
h21s1  h22s2   N 0 w2 [2n]
2

y2 [2n  1] 
ES
2
 
 h21s2*  h22s1*  N 0 w2 [2n  1]
Yuris Mulya Saputra / V3TE3122 / 2017
Write it in matrix form:

 y1[2n]   h11 h12 

 y *[2n  1]  h*  h*  s
 1  ES  12 11   1 
   N 0 w[n]
 y2 [2n]  2  h21 h22   s2 
 *   * * 
 y2 [2n  1] h22  h21 

Yuris Mulya Saputra / V3TE3122 / 2017

Combined as

 y1[2n] 
 * 
 z1   h11
*
h12 h21*
h22   y1 [2n  1]
z    * 
 2   12
h  h h *
 h21  y2 [2n] 
 * 
11 22

 2
y [2 n  1]
to obtain

  h11 h12  
  * 

 z1   h11 h22  ES  h12  h11   s1  
* * *
h12 h21
z    *     N 0 w[n]
 2   12
h  h h *
 h21  2  h21 h22   s2  
 
11 22
 *
 * 
  h22 h21  

Yuris Mulya Saputra / V3TE3122 / 2017

After simple algebra:

 z1  ES  s1 
z  || h ||2
 s   || h || N 0 w[n]
 2 2  2

with
2
1 2
|| h ||   | hij |   8
2 2

i , j 1 2
diversity 4

This yields an SNR

|| h ||2 ES
SNR 
2 N0
Yuris Mulya Saputra / V3TE3122 / 2017
 Spatial Multiplexing
• In rich scattering environments, independent data signals transmitted
from different antennas can be uniquely decoded to yield an increase in
channel capacity

h11
x1 y1
.. hN1
..
Source
Modulation &
Coding . h1M
. Demodulation
& Decoding
Sink

hNM
xM xN

Channel

Yuris Mulya Saputra / V3TE3122 / 2017

THANK YOU

Yuris Mulya Saputra / V3TE3122 / 2017