Professional Documents
Culture Documents
Spring'09
Frequency Non-Selective Channel Frequency-Flat channel Channel impulse response is a simple impulse function. Detecting symbols at the MF output is optimum in the ML sense No need for an equalizer/MLSD. Generally low data rate.
Spring'09
Frequency Selective Channel Channel impulse response has a certain width in time, max. Detecting symbols at the MF output is NOT optimum in the ML sense An equalizer/MLSD required. Generally high data rate.
SC vs. MC
If we use a single carrier modulation scheme,
For relatively low bit rate there is no problem
Channel is flat, No equalizer is required.
What if we have many independent low bit rate (system BW) transmissions in parallel? Single Carrier Multi-Channel (Carrier) no.chnl=1, Rk=R, Rk=R no.chnl=N, Rk=R/N, Rk=R W R >> Bc Wk R/N << Bc
Spring'09 ELE 739 - OFDM 3
FDMA
One way of generating independent multi-channel systems is to divide the frequency range into smaller parts subcarriers (freq. bins) How can we seperate subchannels in freq. so that they do not interfere
FDMA: Subcarriers must be separated at least by the BW of the xmission Waste of precious spectrum.
Spring'09
OFDM
Instead place the subcarriers at frequencies
Obviously, Pulse shape is rectangular spectrum is the sinc function. Spectra of the above pulses overlap but the sub-carrier frequencies are placed at the spectral nulls of all other pulses.
Spring'09
OFDM
How can we generate these pulses,
Analog way, have N oscillators at frequencies Many practical problems
(i+1)T
ci,0 ci,1
~ ci,0 ~ ci,1
ci,N-1
~ ci,N-1
Spring'09
OFDM
Alternative (digital) way, use the IFFT/FFT pair
Much easier to implement on a digital platform Overcomes the problems of the analog implementation
(i+1)T
ci,0 ci,1
~ ci,0 ~ ci,1
ci,N-1
~ ci,N-1
Spring'09
OFDM
Consider the transmitted signal
i: OFDM Symbol index n: Subcarrier index
This is the IDFT of the transmit symbols {c0,n} If N is a power of 2, can be realized by IFFT.
N (n) freq.
IFFT
N (k) time
8
Spring'09
OFDM
{sk} are time samples transmitted sequentially in time P/S At the receiver, the procedure is reversed
Collect N samples in time S/P FFT ~ Obtain the estimates cn regarding the transmitted cn.
freq.
Guard Interval
N data symbols
freq.
Single Freq.
OFDM
Spring'09
OFDM Symbol (frame)
Delay dispersion
Data Packet
Delay dispersion
time 9
Cyclic Prefix
Delay dispersion may destroy the orthogonality of the subcarriers.
Causes Inter-Carrier Interference (ICI).
If Ncp L-1 (delay dispersion of the channel (no. samples)) ICI is prevented.
Spring'09
10
CP
Define a new basis function
where W/N is the carrier spacing and Ts=N/W. OFDM symbol duration is Ts=Ts+Tcp.
-Tcp < t < 0 ^ 0 < t < Ts : cyclic prefix part. : data part.
Normally, the signal arriving from a delay-dispersive channel is the linear convolution of the transmitted signal and the channel IR. CP converts this linear convolution to cyclical convolution.
If max Tcp.
ELE 739 - OFDM 11
Spring'09
Linear ISI CP
Cyclical ISI
CP
data
OFDM symbol i
At the receiver, to eliminate Linear ISI from the previous OFDM symbol (i-1), simply discard the CP part of the signal received corresponding to OFDM symbol i. We end up with cyclical ISI, totally contained in the i-th symbol. Assume that Tcp = max, also let i=0. In the receiver, there is bank of filters matched to the basis functions without the CP:
Spring'09
OFDM
The signal at the output of the MF is the convolution of the
Transmit signal (transmit data + IFFT), The channel impulse response, and The receive filter:
Spring'09
13
OFDM
Moreover, since the basis functions are orthogonal during 0 < t < Ts
The OFDM system is respresented by a number of parallel and orthogonal (non-interfering) non-dispersive (flat) fading channels, each with its own complex attenuation H(nW/N). Equalization is very simple:
Divide signal from each subchannel by the transfer function at that freq.
Spring'09
14
OFDM
A simple structure which employs FFT/IFFT Very simple equalization (1-tap) if subcarriers are orthogonal ICI occurs when subcarriers are not orthogonal,
Happens when max Tcp
Spring'09
15
Another Perspective
Assume that a data block composed of N symbols. Consider two consequent data blocks.
Another Perspective
FFT matrix
Spring'09
Another Perspective
If we transmit both sequentially
c0,i-1 c1,i-1
(i-1)th OFDM symbol.
cN-1,i-1 c0,i
c1,i
ith OFDM symbol.
cN-1,i
L-1
Spring'09 ELE 739 - OFDM 18
Guard Period
In order to prevent ISI, place a guard period of at least L-1 samples between adjacent OFDM symbols. Place all-zeros in the guard period.
ISI ISI
GP
L-1 No ISI
No ISI between OFDM symbols ISI only within an OFDM symbol controllable Received signal is the convolution of the transmit signal and the channel.
ELE 739 - OFDM 19
Spring'09
discard discard
Spring'09
Received Signal
GP
GP
20
Received Signal
This is equivalent to
GP
Spring'09
HGP
H
ELE 739 - OFDM 21
FFT/IFFT
Now consider the system after removing CP
^ For a one-to-one relation between cn,i and cn,i, i.e. without ICI must be a diagonal matrix.
Q must diagonalize H.
Spring'09
22
Diagonalization
Let us consider the Eigendecomposition of the matrix H
where E is a unitary matrix containing the eigenvectors of H, and is a diagonal matrix with the eigenvalues of H on the main diagonal. For an arbitrary H matrix E will also be arbitrary. To diagonalize the channel, we should use this matrix (EH more precisely) at the transmitter and at the receiver. Channel estimation is performed at the receiver, transmitter does not know the channel, hence E.
We need a feedback channel to move the E matrix to the transmitter, Not practical in many cases.
Spring'09 ELE 739 - OFDM 23
Diagonalization
As a special case, when the H is a circulant matrix, E becomes the FFT matrix. For our previous example with N=8, L=3,
Spring'09
24
Cyclic Prefix
Instead of a Guard Period L-1 samples, repeat the last L-1 samples of si as the Cyclic Prefix at the beginning of and OFDM symbol.
same
Spring'09
25
Diagonalization
The eigenvectors of Hcirc form the FFT matrix, hence the eigenvalues correspond to the samples of the transfer function of the channel
Spring'09
26
Cyclic Prefix
FFT and IFFT (DFT/IDFT) are the pairs for
Circular convolution in the time domain, and Product of the transfer functions in the frequency domain.
For regular packet structure, ie. with the zero guard period, we have the linear convolution of the transmit signal and channel at the channel output.
Product of the transfer functions will not give what we want.
Spring'09
27
Channel Estimation
We have seen the estimation of the Channel Impulse Response for single-carrier modulation. In OFDM, we have a number of narrowband (freq. flat) subcarriers
Each subcarrier channel can be represented by a single complex coefficient, Hn,i In total these coef.s give the Transfer Function of the channel.
We wish to obtain the estimates of the N samples of the Transfer Function. There are three approaches:
Pilot OFDM symbols, Scattered pilot symbols, Eigenvalue-decomposition based methods.
Spring'09
28
Appropriate for initial acquisition of the channel at the beginning of a transmission burst. If the known data on subcarrier n for OFDM symbol index i is cn,i, then
Spring'09
29
where is the covariance matrix bw. channel gains and the LS estimates of channel gains, and is the autocovariance matrix of the LS estimates. If the channel noise is AWGN
where
Spring'09 ELE 739 - OFDM 30
Sampling Theory:
Spring'09
33
, approximately Ncp+1 eigenvalues of will have significant values, rest can be ignored.
Spring'09
34
Channel Shortening
Assume that the length of the communication channel is L taps, Then a CP of length at least L-1 is required in an OFDM symbol to eliminate ISI/ICI, Spectral Efficiency of OFDM with N subcarriers is
If L is fixed, N determines the efficiency, N (gets closer to 1) We cannot arbitrarily increase N due to the time-selectivity of the channel. Then we may decrease L ? Equalization effectively decreases L to 1. If the system allows taps for CP, we can have an equalized channel of length +1 taps more degrees of freedom.
ELE 739 - OFDM 35
Spring'09
Channel Shortening
[n]
x[n] Effective Channel, f + t[n] Filter, w z[n] ^ z[n] + [n]
Delay,
TIR, b
Complete Equalization
Forced to be these values.
36
whose output is
Toeplitz Matrix
Cost Function
Now, the MMSE cost function is
Spring'09
38
Cost Function
Expanding the cost function
Using the property that data and noise are uncorrelated E{x*}=0
Spring'09
Optimum Equalizer
Optimum equalizer coefficients are:
which is minimized by
OOPS!!!
It says: Do not transmit anything!
Spring'09
40
Optimum TIR
To avoid the trivial solution, impose a constraint on the filters:
Unit norm constraint on w, wTw=1 Unit tap constraint on TIR, bk=1, bk: variable Unit norm constraint on TIR, bTb=1
Hermitian symmetric
Spring'09
41
Optimum TIR
defines a square windows in T
T=
Lagrangian becomes is the minimum eigenvalue of T and b is the corresponding eigenvector. Obviously, this still a function of delay . Above problem has to be solved for every possible .
ELE 739 - OFDM 42
Spring'09
Spring'09
43
Spring'09
time
IFFT
freq.
44
Spring'09
45
Spring'09
46
We can think of an OFDM symbol as a possible combination of N, M-ary symbols (MN symbols)
Among these combinations, choose appropriate codewords so that PAPR is guaranteed to be below a certain level. Completely eliminates PAPR problem, Significant loss of throughput due to redundancy, Have some coding gain (but less than a dedicated ECC code).
Spring'09 ELE 739 - OFDM 47
Phase Adjustments
Define an ensemble of phase adjustment vectors I={n}l, l = 1,...,L, n = 1,...,N
Known both at the transmitter and receiver. Transmitter multiplies the OFDM symbol to be transmitted Ci by each of these phase vectors to get and then selects: to get the lowest PAPR possible. ^ ^ Instead of the sequence {cn}, {cn}l^is transmitted together with the index l. ^ Receiver undos phase adjustment by using the index l. Less overhead, Cannot guarantee a certain level of PAPR.
Spring'09 ELE 739 - OFDM 48
Another example, multiply the signal by a Gaussian function centered at times when the level exceeds the threshold (penalized by the Gauss func.)
Multiplying by a Gaussian in time is equivalent to convolving with a Gaussian in frequency spectral regrowth controlled by t2 Causes significant ICI increased BER.
Spring'09
49
Spring'09
50
Inter-Carrier Interference
Cyclic prefix completely eliminates Inter-Carrier Interference and InterSymbol Interference caused by the quasi-static frequency selective channel
If the channel delay spread is less than the cyclic prefix
Spring'09
51
ICI
Impact of time-selectivity is mostly determined by
Product of maximum Doppler frequency and duration of the OFDM symbol.
Tradeoff: Large excess delay requires long CP reduced spectral efficiency. Shorter CP ICI. CP does not have to be chosen to cope with the worst case channel if the loss due to ICI is amenable, to increase spectral efficiency.
Spring'09
52
ICI
Received signal in case of ICI occuring as a result of Doppler shift or insufficient CP.
h[n, l] : sampled version of the time-variant channel IR h(t, ) L : maximum excess delay in units of samples L = maxN/Ts. u[n] : unit step function.
For a time-invariant channel (h[q, l]=h[ l ][q-l]) and sufficiently long CP, above expression reduces to
Spring'09
53
ICI
Optimum choice of carrier spacing and OFDM symbol length:
Tradeoff between ICI and spectral efficiency (N/(N+Ncp))
Short symbol duration (Ts) (large subcarrier spacing) is good for reducing Doppler-caused ICI, Long symbol duration (narrow spacing) is good for satisfactory spectral efficiency
TCP is limited by the maximum excess delay, CP should be around 10% of the OFDM symbol for high efficiency
Spring'09
54
Adaptive Modulation
Transfer function of a frequency selective channel has peaks and valleys.
Subchannels at peaks are good (narrowband) channels Almost no information can be transmitter through valleys
Energy over subcarriers are the same for this example.
For satisfying a target BER e.g. 10-2, too much energy would be required at these subcarriers. Power is limited!.
Spring'09 ELE 739 - OFDM 55
Adaptive Modulation
We see that fixed power allocation loads bad channels with low SNR (high BER and low capacity) waste of energy. Problem:
We want to maximize the capacity of the system by wisely distributing the energy over subchannels Under the constraint of limited power
Adaptive Modulation
waterlevel,
Total power
Power allocated to subcarrier - 1 No power is allocated to this subcarrier
Spring'09
57
Adaptive Modulation
We have found the power allocation for each subcarrier which maximizes the capacity. What modulation should we use in the subcarriers to get as close as possible to the assigned capacity?
This means, the transmitter has to adapt the data rate according to the SNR available for a subcarrier. A constellation with Na points has a capacity of log2(Na) bits/channel use A higher order modulation (64-128-QAM) can be used for a subcarrier with high SNR, For low SNR, modulation order has to be decreased.
Spring'09
58