Ofdm PDF

OFDM
© Ammar Abu-Hudrouss
Islamic University Gaza
Shannon Capacity
R/N bps QAM x

R bps Modulator
Serial
To cos(2f0t)
Parallel 
Converter
R/N bps QAM x
Modulator
cos(2fNt)
 Breaks data into N sub-streams

 Sub-stream modulated onto separate carriers
Sub-stream bandwidth is B /N for B total bandwidth
B/N < Bc implies flat fading on each subcarrier (no ISI)
Wireless Communications
Slide 2
١
Non-overlapping channel (FDM)
 The available bandwidth is divided into sub-channels each with

bandwidth BN.
 If raised cosine pulse shaping is assumed then
TN  1    / BN
 Where beta is a shaping roll off factor.
Slide 3
Non-overlapping channel (FDM)
 The total bandwidth is B = N BN and the data rate is R = NRN
 but usually guard band is required between different sub-

channels let ε /TN denote the guard bandwidth.
 The total bandwidth is given as
BN
1     
TN
Slide 4
٢
 Example 1: Consider a multicarrier system with a total passband
bandwidth of 1 MHz. Suppose the system operates in a city with
channel delay spread Tm = 20 μs. How many sub-channels are
needed to obtain approximately flat-fading in each sub-channel.
 Solution: The channel coherence bandwidth is Bc = 1/Tm =
1/.00002 = 50 KHz. To insure flat-fading on each sub-channel,
we take BN = B/N = .1 BN << Bc. Thus, N = B/.1Bc = 1000000/5000
= 200 sub-channels are needed to insure flat-fading on each
sub-channel.
 In discrete implementations of multicarrier N must be a power

of two for the DFT and IDFT operations, in which case N = 256
for this set of parameters.
Slide 5
 Example 2: Consider a multicarrier system with TN = .2 ms: TN >>

Tm for Tm the channel delay spread, so each sub-channel
experiences minimal ISI. Assume the system has N = 128 sub-
channels. If raised cosine pulses with β = 1 are used, and the
additional bandwidth due to time limiting required to insure
minimal power outside the signal bandwidth is ε/TN = .1, then
what is the total bandwidth of the system
BN
1       1281  1  0.1  1.344 MHz
TN 0.0002
Slide 6
٣
Non-overlaped demoudlation
Slide 7
Multicarrier overlapped modulation
Orthogonality is an implication of a definite and fixed relationship

between all carriers in the collection.
Subcarriers are spaced by 1/TN
Slide 8
٤
 The guard band and the raised cosine factor are need only in the
first and the last sub-band, the total BW is given by
B
N       1
TN TN
 Example: Compare the required bandwidth of a multicarrier
system with overlapping subchannels versus non-overlapping
subchannels using the same parameters
B
 N       128  1.1  645.5 MHz
TN 0.002
Saving of Bandwidth
Frequency
Frequency
Slide 9
 Multicarrier Receiver for Overlapping Subcarriers.
Slide 10
٥
 In previous figure, if the effect of the channel h(t) and noise
n(t) are neglected then for received signal s(t) given by the
input to each symbol demapper is
Slide 11
Mitigation of Subcarrier Fading
 The advantage of multicarrier modulation is that each

subchannel is relatively narrowband, which mitigates the effect
of delay spread.
 However, each subchannel experiences flat-fading, which can

cause large BERs on some of the subchannels
 Since flat fading can seriously degrade performance in each

subchannel, it is important to compensate for flat fading in the
subchannels.
 There are several techniques for doing this, including:

 Coding with interleaving over time and frequency, frequency
equalization, precoding, and adaptive loading.
Slide 12
٦
Interleaving
b1 b4 b7 b10 Read out

b1 b4 b7 b10 b2 b5 b8 b11 b3 b6 b9 b12
b2 b5 b8 b11
Fill in
b3 b6 b9 b12
 The basic idea in coding with interleaving over time and

frequency is to encode data bits into codewords, interleave the
resulting coded bits over both time and frequency,
 The coded bits transmitted over different subchannels such

that the coded bits within a given codeword all experience
independent fading
Slide 13
Frequency Equalization
 frequency equalization the flat fading αi on the ith subchannel is

basically inverted in the receiver .
 Specifically, the received signal is multiplied by 1/αi, which gives

a resultant signal power = Pi.
 While this removes the impact of flat fading on the signal, it

enhances the noise. Specifically, the incoming noise signal is also
multiplied by 1/αi,
 The resultant SNR on the ith subchannel after frequency

equalization is the same as before equalization.
Slide 14
٧
Precoding
 Precoding uses the same idea as frequency equalization, except
that the fading is inverted at the transmitter instead of the
receiver .
 This technique requires that the transmitter have knowledge of

the subchannel flat fading gains
 Note that the channel inversion takes place at the transmitter

instead of the receiver, so the noise power remains as N0BN.
 There are two main problems with precoding:

 Firstly, the inversion is not power-efficient in fading channels.
 The 2nd is the need for accurate channel estimates at the
transmitter, which are difficult to obtain in a rapidly fading
channel
Slide 15
Adaptive Loading
 let us consider the capacity of the multicarrier system with N

independent subchannels of bandwidth BN and subchannel gain
{αi, i = 0, . . . , N − 1}. Assuming a total power constraint P, this
capacity is given by
  i2 Pi 
C  max  B log 2 1 
 
Pi : Pi  P
i i  N B
0 N 
 The power allocation Pi that maximizes this expression is a

water-filling over frequency given by Equation
Pi 10  1i i  0

P  0 else
Slide 16
٨
 And the capacity becomes
 
C  i:  Blog2 i .
i 0
0 
Slide 17
IFFT
 Transmission of QAM symbols on parallel subcarriers

 Overlapping, yet orthogonal subcarriers
User cos(ct)
symbols
cos(ct+ st)
Parallel-to-
Serial-to-
I-FFT
=
Serial-to-
parallel
Parallel
Serial
cos(ct+ ist)
cos(ct+ (N-1)st)
Slide 18
٩
DFT
 Let x [n] , 0 ≤ n ≤ N -1, denote a discreet time signal. The N-point

DFT of x [n] is given by
N 1
1  j 2  kn / N
X (k ) 
N
 x ( n )e
n 0
k  0,1, 2,....., N  1
 The IDFT is given by

N 1
1
x (n) 
N
 X ( k )e 
k 0
2 kn / N
n  0,1, 2,......., N  1
 Circular convolution in time domain equivalent to multiplication of

DFT in frequency domain
Slide 19
OFDM system
N subchannels N complex samples
quadrature
Bits amplitude add D/A +
S/P modulation N-IFFT cyclic P/S transmit
00110 (QAM) prefix filter
encoder
RECEIVER multipath channel
N subchannels N complex samples

invert
Receive
channel remove
QAM filter
P/S = N-FFT S/P cyclic
decoder frequency +
prefix A/D
domain
equalizer
Wireless April
Wednesday, Communications
٢٠ analysis ,simmulatiom &
Slide 20
14, 2010 implementation of OFDM
١٠
Cyclic prefix, CP
 Place a copy of the L last symbols first

• The linear convolution will be transformed to a cyclic convolution
• Orthogonality is maintained, no ICI
• The CP has to be longer than the channel impulse response
Slide 21
 Consider a channel input sequence x [n] = x [0], . . . , x [N − 1] of

length N
 The discrete-time channel with finite impulse response (FIR) h

[n] = h [0], . . . , h [μ] of length μ + 1 = Tm /Ts, where Tm is the
channel delay spread and Ts the sampling time associated with
the discrete time sequence.
 The cyclic prefix for x [n] ] is defined as {x [N − μ], . . . , x [N −

1]}: it consists of the last μ values of the x [n] sequence. For
each input sequence of length N, these last μ samples are
appended to the beginning of the sequence
Slide 22
١١
 Suppose x˜[n] is input to a discrete-time channel with impulse
response h [n]. The channel output y [n], 0 ≤n ≤ N − 1 is then
 The linear convolution associated with the channel impulse

response y [n] for 0 ≤ n ≤ N − 1 becomes a circular convolution.
 Since μ symbols are added to the input data blocks,

 there is an overhead of μ/N, resulting in a data rate reduction
of N/(μ + N)
Slide 23
 Example: Consider an OFDM system with total passband

bandwidth B = 1 MHz assuming β = = 0.
A single carrier system would have symbol time Ts = 1/B = 1μs. The
channel has a maximum delay spread of Tm = 5 μsec, so with Ts =
1 μsec and Tm = 5 μsec there would clearly be severe ISI.
Assume an OFDM system with MQAM modulation applied to each

sub-channel. To keep the overhead small, the OFDM system uses
N = 128 subcarriers to mitigate ISI. So TN = NTs = 128 μsec.
The length of the cyclic prefix is set to μ = 8 > Tm/Ts to insure
no ISI between OFDM symbols. For these parameters, find the
sub-channel bandwidth, the total transmission time associated
with each OFDM symbol, the overhead of the cyclic prefix, and
the data rate of the system assuming M = 16
Slide 24
١٢
 Solution: The sub-channel bandwidth BN = 1/TN = 7.812 KHz, so
BN << Bc = 1/Tm = 200 KHz, insuring negligible ISI.
 The total transmission time for each OFDM symbol is T = TN +

μTs = 128 + 8 = 136 μs.
 The overhead associated with the cyclic prefix is 8/136 which is

roughly 5.9%.
 The system transmits log2 16 = 4 bits/subcarrier every T

seconds, so the data rate is 128 × 4/136 × 10 − 6 = 3.76 Mbps,
which is slightly less than 4B due to the cyclic prefix overhead
Slide 25
OFDM spectrum
Slide 26
١٣
Matrix Representation of OFDM
 Consider a discrete-time channel

 with FIR h [n], 0 ≤ n ≤ μ, input x˜[n] ,noise ν [n], and output y [n]]
= x˜[n] ∗ h [n] + ν [n].
 The channel output can be written in matrix format
 x N 1 
 y N 1  h0 h1  h 0  0      v N 1 
y   0 h h  h  0   x0  v N  2 
 N 2    0 1 
  
            x1    
     
 yo   0  0 h0  h 1 h      v0 
 
 x  
Slide 27
 The received symbols y−1 . . . y−μ are discarded since they are
affected by ISI in the prior data block, and they are not
needed to recover the input. The last μ symbols of x[n]
correspond to the cyclic prefix: x−1 = xN−1, x−2 = xN−2, . . . x−μ =
xN−μ.
 The matrix representation becomes
 h0 h1  h 0  0
0 h0  h 1 h  0 
 y N 1    x  v 
y            N 1   N 1 
 N 2    0  x v
 0 h0  h 1 h   N  2    N  2 
         
            
 o  h
y
h3  h  2  h0 h1 
  xo   v0 
 2
h h  h 1  0 h0 
 1 2
Slide 28
١٤
 Or
~
y  Hx  v
 By using eigenvalue decomposition
~
H  MM H
 The DFT of X can be written as X = Qx, where
1 1 1  1 
1 W WN2  W N 1 
1  
N N
Q 1 WN2 WN4  W N
2 ( N 1)

N  
1     
1 WNN 1
WN N 1)
2 (
 WN( N 1)( N 1) 
 For W N  e  j 2 / N
Slide 29
 The IDFT can be similarly represented as
x  Q 1 X  Q H X
 It can be shown that the tows of the DFT martix Q are the
eigenvector of H, which implies Q = MH and QH = M.
 The DFT of the output can be expressed as
~
Y  Qy  Q Hx  v  

 Q M M H Q H X  v 
 M H MM H MX  Qv
  X  vQ
Slide 30
١٥
 Since Q is unitary, vQ = Qv has the same noise autocorrelation
matrix as v (so it is still white and Gaussian with the same noise
power)
Slide 31
MIMO-OFDM
 OFDM-MIMO channel with N subchannels, Mt transmit antennas,

Mr receive antennas, and a channel FIR of duration μ can be
represented as
y  Hx  v
 where y is a vector of dimension Mr N × 1 corresponding to N
output time samples at each of the Mr antennas,
 H is a NMr × (N + μ)Mt matrix corresponding to the N flat-

fading sub-channel gains on each transmit-receive antenna pair
 x is a vector of dimension Mt (N +μ )×1 corresponding to N input

time samples with appended cyclic prefix of length μ at each of
the Mt transmit antennas.
Slide 32
١٦
MIMO OFDM
Slide 33
Vector Coding
 In vector coding the original Channel matrix N x (N + ) is

decomposed using a SVD.
 The SVD decomposition does not require the sub-channels to be

orthogonal (it is more efficient than OFDM in term of energy)
 Vector-coding is more complex than OFDM.
 The singular decomposition of H can be written as

 H = U∑VH.
 U is N ×N unitary, and V is (N + ) x (N + ) unitary matrix
 ∑ is an Mr ×Mt diagonal matrix of singular values of H {σi =

sqrt(i)}
Slide 34
١٧
 i s are the eigen values of HHH.
 As H is the a .block-diagonal convolution matrix, rank(H) = N

 In vector coding, the data symbols are grouped into vector of N
symbols X = [X0, X1, X2, ….,XN-1].
 Each symbols xi is multiplied by a vector vi from V =[v0, v1, ..,vN-1]

 The parallel vector are added together.
 At the receiver the received vector Y is multiplied by the

vectors composing UH.
Slide 35
 Singular value decomposition
Slide 36
١٨
 This is very similar to transmit preceding and receiver shaping in
MIMO system (similar result is applied)
Y   X U Hv
 Hence, each element of X is effectively passed through a scalar
channel without ISI
 Additionally, the new noise vector has unchanged noise variance,

since U is unitary. The resulting received vector is thus
YN 1    1 X N 1   v~N 1 
Y   X  ~ v 
 N  2  2 N  2  N  2 
        
     ~ 
 Y0    N X 0   v0 
Slide 37
 The matrix H is achieved by appending  extra symbols to each

block of N data symbols.
 In contrast to OFDM, the extra symbols does not need to be

cyclic prefix.
 Zero symbols can be sent to save power.
Slide 38
١٩
 Practical Problem of SVD
 1) Complexity: the complexity scales quickly with N.

Furthermore, the complexity of complexity of finding the SVD
of N x (N + ) H matrix increase with N.
 2) SVD channel Knowledge CSI information are need at

transmitter. These needs to be updated from time to time.
 OFDM can perform without channel knowledge so it is adopted

modulation for wireless systems.
Slide 39
 Consider a simple two-tap discrete-time channel (i.e. μ = 1)

described as:
H  z   1  0 .9 z  1
 Since μ = Tm /Ts = 1, with N = 8 we insure BN ≈ 1/(NTs) << Bc ≈
1/Tc. Find the system matrix representation and the singular
values of the associated channel matrix H.
 y 7  1 0 .9 0  0  0  x7  n7 
 y  0 1 0 .9 0  0  0  x   n 
 6   6    6
           
     
 y0  0  0 0 0 1 0.9  x1  n0 
Slide 40
٢٠
 The singular values of the matrix H can be found by a standard
computer package (e.g. Matlab) as
 Σ = diag(1.87, 1.78, 1.65, 1.46, 1.22, 0.95, 0.66, 0.34)
 The precoding and shaping matrices U and V are also easily

found. Given U, V, and Σ, this communication is ISI-free, with
the symbols X0, X1, ... , XL−1 being multiplied by the corresponding
singular values
Slide 41
Peak to average Power ratio
 Low PARR allows the amplifier to work on the linear region.
Slide 42
٢١
 High PARR force a back-off of the amplifier and it requires high
resolution A/D converter.
 A PAR of continuous signal is given by

2
max xt 
PAR 

Et xt 
2

 And for the discreet signal, it is given by
2
max x n 
PAR 

Et x n 
2

Slide 43
 A sine wave has PAR = 3 dB as maximum amplitude to the signal

is 1 and the average power is 0.1
 Consider the time domain samples output of the IFFT

N 1
1
x (n) 
N
 X (k )e 
k 0
2 kn / N
n  0,1, 2,......., N  1
 If N is large, we can apply central limit theorem and hence x(n)

is zero-mean complex Gaussian random variables (N > 64)
 Consider N Gaussian iid random variable xn, 0  n  N – 1
 1
E  x0  x1    x N 1 2   1 E x0  x1    x N 1 2  
 N  N
Slide 44
٢٢
 1 2
E x02  E x12    E x N2 1
E  x0  x1    x N 1    1
 N  N
 The maximum value occurs when all the xis add coherently, in
which case
2
 1
max  x0  x1    x N 1 2   N N
 N  N
 The maximum PAR is N for N subcarrier.
 The coherent addition is unlikely to happen but still the PAR

increase linearly with N
Slide 45
 There are different methods to avoid PAR such as

1) Clipping of the OFDM
2) peak cancelation with complementary signal,
3) Allowing for non-linear distortion and correction for it
4) Special coding techniques
Slide 46
٢٣
Frequency and Timing Offset
 For orthogonal sub0channel; the subcarrier separation Δf = 1/TN
 In practice, the frequency separation of the subcarriers is

imperfect: so Δf is not exactly equal to 1/TN.
 For example, if the carrier frequency oscillator is accurate to

0.1 parts per million (ppm), the frequency offset Δf ≈ (f0)(0.1 ×
10−6).
 f0 = 5GHz, the carrier frequency for 802.11a WLANs, then Δf =

500 Hz,
Slide 47
 This usually degrade the orthogonality of the sub-channels,

since now the received samples of the FFT will contain
interference from adjacent sub-channels.
 We’ll now analyze this inter-carrier interference (ICI).
 The signal corresponding to subcarrier i can be simply expressed

for the case of rectangular pulse shapes (suppressing the data
symbol and the carrier frequency) as
xi n   e j 2it / TN
 An interfering subchannel signal can be written as
xi  m n   e j 2 i  m t / TN
Slide 48
٢٤
 If the signal is demoduled with a frequency offset of δ/Tn then
this interference becomes
xi  m n   e j 2 i  m  t / TN
 The ICI between subchannel signals xi and xi+m is simply the

inner product between them
TN
I m   xi  m t xi  m t dt 

TN 1  e  j 2   m  
0
j 2 m   
 It can be seen that in the above expression, δ = 0 ⇒ Im = 0, as
expected. The total ICI power on subcarrier i is then
2 2
ICI i   I m  C0 TN  
mi
Slide 49
Case Study: IEEE 802.11a
 The IEEE 802.11a Wireless LAN standard, which occupies 20

MHz of bandwidth in the 5 GHz unlicensed band, is based on
OFDM.
 In 802.11a, N = 64 subcarriers are generated, although only 48

are actually used for data transmission, with the outer 12
zeroed in order to reduce adjacent channel interference, and 4
used as pilot symbols for channel estimation.
 The cyclic prefix consists of μ = 16 samples, so the total number

of samples associated with each OFDM symbol, including both
data samples and the cyclic prefix, is 80
Slide 50
٢٥
 The error correction code is a convolutional code with one of
three possible coding rates: r = 1٢ ، ٢3, or 34 .
 The modulation types that can be used on the sub-channels are

BPSK, QPSK, 16QAM, or 64QAM
 Since the bandwidth B (and sampling rate 1/Ts) is 20 MHz, and

there are 64 subcarriers evenly spaced over that bandwidth, the
subcarrier bandwidth is:
20 MHz
BN   312 .5 KHz
64
Slide 51
 Since μ = 16 and 1/Ts = 20MHz, the maximum delay spread for

which ISI is removed is
16
Tm  Ts   0.8 s
20 M
 so the symbol time per sub-channel is
80
TN  80Ts   4 s
20  10 6
 The data rate per subchannel is log2 M/TN. Thus, the minimum
data rate for this system, corresponding to BPSK
 (1 bit/symbol), an r = 1 2 code, and taking into account that only
48 subcarriers actually carry usable data, is given by
1 / 2 bit 1 codebit 1subcar. sym.

R N  48 subcarrier   
codebit subcar. sym. 4  10  6 s
Slide 52
٢٦
 R = 6 Mbps
 The maximum data rate that can be transmitted (rate = ¾) and

64 QAM is 54 Mbps
3 / 4 bit 6 codebit 1 subcar. sym.
Rmax  48 subcarrier   
codebit subcar. sym. 4 10 6 s
 Rmax = 54 Mbps
 Example: Find the data rate of an 802.11a system assuming

16QAM modulation and rate 2/3 coding
 With 16QAM modulation each subcarrier transmits log2(16) = 4
2 / 3 bit 4 codebit 1 subcar. sym.
R  48 subcarrier   
codebit subcar. sym. 4  10 6 s
 Rmax = 32 Mbps
Slide 53
٢٧

Ofdm PDF

Hochgeladen von

Dokumentinformationen

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Ofdm PDF

Hochgeladen von

Copyright:

Verfügbare Formate

OFDM

R/N bps QAM x

 Breaks data into N sub-streams

 The available bandwidth is divided into sub-channels each with

 If raised cosine pulse shaping is assumed then

Non-overlapping channel (FDM)

 The total bandwidth is B = N BN and the data rate is R = NRN

 but usually guard band is required between different sub-

 The total bandwidth is given as

 In discrete implementations of multicarrier N must be a power

 Example 2: Consider a multicarrier system with TN = .2 ms: TN >>

Multicarrier overlapped modulation

Orthogonality is an implication of a definite and fixed relationship

 Multicarrier Receiver for Overlapping Subcarriers.

Mitigation of Subcarrier Fading

 The advantage of multicarrier modulation is that each

 However, each subchannel experiences flat-fading, which can

 Since flat fading can seriously degrade performance in each

 There are several techniques for doing this, including:

b1 b4 b7 b10 Read out

 The basic idea in coding with interleaving over time and

 The coded bits transmitted over different subchannels such

 frequency equalization the flat fading αi on the ith subchannel is

 Specifically, the received signal is multiplied by 1/αi, which gives

 While this removes the impact of flat fading on the signal, it

 The resultant SNR on the ith subchannel after frequency

 This technique requires that the transmitter have knowledge of

 Note that the channel inversion takes place at the transmitter

 There are two main problems with precoding:

 let us consider the capacity of the multicarrier system with N

 The power allocation Pi that maximizes this expression is a

 Transmission of QAM symbols on parallel subcarriers

 Let x [n] , 0 ≤ n ≤ N -1, denote a discreet time signal. The N-point

 The IDFT is given by

 Circular convolution in time domain equivalent to multiplication of

RECEIVER multipath channel

N subchannels N complex samples

 Place a copy of the L last symbols first

 Consider a channel input sequence x [n] = x [0], . . . , x [N − 1] of

 The discrete-time channel with finite impulse response (FIR) h

 The cyclic prefix for x [n] ] is defined as {x [N − μ], . . . , x [N −

 The linear convolution associated with the channel impulse

 Since μ symbols are added to the input data blocks,

 Example: Consider an OFDM system with total passband

Assume an OFDM system with MQAM modulation applied to each

 The total transmission time for each OFDM symbol is T = TN +

 The overhead associated with the cyclic prefix is 8/136 which is

 The system transmits log2 16 = 4 bits/subcarrier every T

 Consider a discrete-time channel

 The channel output can be written in matrix format

 The IDFT can be similarly represented as

 The DFT of the output can be expressed as

 OFDM-MIMO channel with N subchannels, Mt transmit antennas,

 H is a NMr × (N + μ)Mt matrix corresponding to the N flat-

 x is a vector of dimension Mt (N +μ )×1 corresponding to N input

 In vector coding the original Channel matrix N x (N + ) is

 The SVD decomposition does not require the sub-channels to be

 Vector-coding is more complex than OFDM.

 The singular decomposition of H can be written as

 ∑ is an Mr ×Mt diagonal matrix of singular values of H {σi =

 As H is the a .block-diagonal convolution matrix, rank(H) = N

 Each symbols xi is multiplied by a vector vi from V =[v0, v1, ..,vN-1]

 At the receiver the received vector Y is multiplied by the