Unit 4
Unit 4
Unit 4
Equalization, Diversity
And
Speech coding
1 Introduction
Equalization
Compensates for inter-symbol interference (ISI) created by
multipath within time depressive channels.
* Linear equalization, nonlinear equalization
Channel coding
Channel
coding
Modulation
Carrier
2.Fundamentals of equalization
since the mobile fading channel is random and time varying,
equalizers must take the time varying characteristics of the
mobile channel, and thus are called adaptive equalizers.
General operating modes of an adaptive equalizer:
* Training
* Tracking
d t y t heq t
x t f t heq t mb t heq t
t
F f H eq f 1
E[| ek | ]
Square error
Expected MSE
where
ek
1k
2
2 k
.... Nk
Ex R 2p
E ek
2
k
yk2
y y
*
R E yk yk E k 1 k
....
yk N yk
yk yk 1
yk yk 2
yk21
....
yk N yk 1
yk 1 yk 2
....
yk N yk 2
p E xk y k E xk yk
xk yk 1 xk yk 2 .... xk yk N
.... yk yk N
.... yk 1 yk N
.... ....
2
.... yk N
T
E p
min
13
Classification of equalizers
14
Equalizer Techniques
F Tapped delay line filter with both feedforward and feedback taps
d k
N2
n N1
*
n
T
2
E e(n)
y k n
No
2
F (e jT ) No
Minimum
mean squared
error
6.Nonlinear Equalization
Used in applications where the channel distortion is too severe
Three effective methods
Decision Feedback Equalization (DFE)
Maximum Likelihood Symbol Detection
Maximum Likelihood Sequence Estimator (MLSE)
dk
E e(n)
n N1
min
y k n Fi d k i
3
T
exp{
2
i 1
No
ln[
F (e
jT
) No
] d}
Nonlinear Equalizer-DFE
Nonlinear Equalization--MLSE
MLSE tests all possible data sequences (rather than decoding
each received symbol by itself ), and chooses the data sequence
with the maximum probability as the output
Usually has a large computational requirement
First proposed by Forney using a basic MLSE estimator structure
and implementing it with the Viterbi algorithm
Nonlinear Equalizer-MLSE
f 1/(2T )
28
Diversity Techniques
* Requires no training overhead
* Can provides significant link improvement with little added cost
* Diversity decisions are made by the Rx, and are unknown to the Tx
Diversity concept
If one radio path undergoes a deep fade, another independent path
may have a strong signal. (Diversity exploits the random nature of
radio propagation by finding independent (or at least highly
uncorrelated) signal paths for communication.)
By having more than one path to select from, both the
instantaneous and average SNRs at the receiver may be improved,
often by as much as 20 dB to 30 dB
Diversity Techniques
Microscopic diversity and Macroscopic diversity
The former is used for small-scale fading(deep fading) while the
latter for large-scale fading(selecting different base stations)
Antenna diversity (or space diversity)
Space diversity
*
*
*
*
Selection diversity
Feedback diversity
Maximal ration combining
Equal gain diversity
Selection diversity
Pr SNR 1 Pr 1 , .... , M 1 (1 e r/ )M
d
PM ( )
Pr SNR
(1 e / ) M 1e /
d
k 1
1
k
Diversity techniques
34
NT N | Gi |2
rM G r
i 1
*
i i
i 1
rM2
(SNR) M
2 NT
Pr{ M } p( M )d M 1 e
0
MM 1e /
P( M ) M
( M 1)!
M
ri Gi xi ni
( / )k 1
k 1 (k 1)!
M
Diversity Techniques
The control algorithms for setting the gains and phases for maximal
ratio combining are similar to those required in equalizer and
RAKE receiver
MRC
Diversity Techniques-review
Maximal ratio combining
The signals from all of the M branches are weighted according to their
signal voltage to noise power ratios and then summed
Time diversity
Time diversity repeatedly transmits information at time spacing that exceed
the coherence time of the channel
Selection diversity
Feedback diversity (or scanning diversity)
Maximal Ratio Combining
Equal Gain Diversity
39
Polarization Diversity
40
Frequency Diversity
* Signal xmitted on more than one fc >= coherence bandwidth
(wont experience the same fade)
Time Diversity
* Xmit signal repeatedly >= coherence time
* RAKE Receiver for CDMA (multipath channel)
41
RAKE Receiver
RAKE Receiver
M
Z m Z m
m 1
Z m2
M
Z m2
m 1
An M-branch (M-finger) RAKE receiver implementation. Each correlator detects a time shifted
version of the original CDMA transmission, and each finger of the RAKE correlates to a portion
of the signal which is delayed by at least one chip in time from the other finger.
Speech Coding
Time Domain:
PCM, ADPCM
Frequency Domain:
e.g. Sub-band coder,
Adaptive transform
coder
Source Coders
Linear
Predictive
Coder
Vocoder
Downsampling
Excitation with a pitch / noise model
48
LPC encoding
The classic source-filter model
Compression gains:
* filter parameters are ~slowly changing
* excitation can be represented many ways
49
Transfer function
S ( z)
H ( z)
E( z)
s ( n ) a ( k ) s ( n k ) e( n )
k 1
periodic
pulse
train
generator
G
v/u
voiced
u[n]
1 a(k ) z k
k 1
unvoiced
random
sequence
generator
H(z) = 1
P
1 akz-k
k=1
50
Buffer
Voice/
Un-voice
Pitch
Analysis
Encoder
Channel
Decoder
Synthesizer
LPC
filter
Excitation
52
Excitation
54
CELP
Code excited linear predictive (CELP) speech coding.
White noise input does not give satisfactory results:
* the residue sequence still contains important information for
speech synthesis
* it is necessary to send the residue to receiving end too.
CELP
57