EC 2301 Digital communication

Unit I and II Question bank

UNIT I Digital communication system
2 marks
1.Draw block diagram of digital communication system.


a
d







2.Define Formatter
* In Digital communication system, the input signal should be in digital form so
that digital signal processing techniques can be employed on the signals.
* The block which converts the electrical signals at the output of the transducer
into a sequence of digital signals is known as Formatter.
3. What is the need for Base Band Processor?
*In low-speed transmission, the channel encoded signal is generally not modulated.
The transmission takes place in baseband.
*However, for proper detection of the signal and to combat noise and interference
line coding , pulse shaping and special filters are employed in the receiver.
*All these are collectively called as baseband processor. This is the case in fixed
telephony and data storage systems.
4.Define spectral efficiency and BER.
Spectral Efficiency:
The number of bits transmitted per second for every hertz of bandwidth is called
spectral efficiency.
Information source and
input transducer
formatter Source
encoder
Channel
encoder
Baseband processor
or bandpass
modulator
channel
Baseband decoder
and bandpass
demodulator
Channel
decoder
Source
decoder
deformatter Output signal and output
transducer
BER(Bit Error Rate):
The ratio of the error bits to the transmitted bits is called as Bit Error Rate.

BER = Error Bits
Transmitted Bits
5. State Dimensionality theorem.
The theorem states that, A real waveform can be completely specified by N
independent pieces of information.
where
N is given by
N =2BT
0

N is the dimension of the waveform in signal space.
B is the bandwidth of the signal.
T
0
is the time over which signal waveform is being described.
6.Define PSD and symbol rate
PSD:
*The Power Spectral Density (PSD) refers to the amount of power per unit of
frequency as function of frequency. It describes how the power of signal or time series
is distributed with frequency. By knowing PSD, the system bandwidth and frequency can
be calculated.
*The PSD power spectrum of the stationary process is given by,
S
x
(f)= R
x
() exp(-j2f) d
Symbol Rate:
*Symbol rate or the Baud rate is defined as the number of symbols transmitted
per second.
*The symbol rate of a digital signal represented by N points which are
transmitted over an interval of T
0
second is given by,
R
s
= N
T
0

B = R
s


2
*Half of the symbol rate is bandwidth.

8.What is GSOP?
*GSOP is Gram Schmidt Orthogonalisation Procedure.
*The procedure for obtaining the basis set from the original set is called GSOP.
*It is used to construct a set of orthogonal basis function.

k
(t) =
k
(t)
E
k
Where
k
(t) is the k basis function
E
k
is the normalized energy of the signal s
k
(t)

9.Define signal space and basis function.
Signal space:
The complete set of all signals is called signal space.
Basis function:
*Collection of minimum number of functions necessary to represent a given signal
is called Basis function.
*Basis functions are independent.
*Basis functions are always orthogonal to each other.
10.Define dimension of signal space and basis set
dimension of signal space:
The minimum number of basis function is called dimension of signal space.
basis set:
Collection of the basis function is called Basis set.
11.Define signaling set
In digital communication system only a few logical levels of input signal are
supported. A particular signal waveform is transmitted for each of these levels. The set of
all the signals is called signaling set.


12.Define Kroneckar delta function
Basis function,

i
(t)
k
(t) dt = k
j

jk
; 0tT , j, k = 1,..N
Where
k is a non-zero constant

jk
is the Kronecker delta function

jk
= 1 for j=k
0 otherwise
13.List the mathematical models of communication channel
There are three mathematical models of communication channel.
Additive Noise channel
Linear filter channel
Linear time variant filter channel
14.Explain in brief about channel classification
Channels can be classified into
Wired channels
Eg: copper cable
Optical fiber (few Gbps)
co-axial cable(few 100 Mbps)
Ethernet cable
Wireless channels
Eg: underwater ocean channel carrying acoustic wave
Free space carrying electromagnetic wave
Infrared wave(few THz)
15.How to improve the performance measure of digital communication system?
The performance measure of digital communication system can be improved by the
following ways:
Improving modulation and demodulation techniques.
Improving coding and decoding techniques.
Improving pulse shaping and filtering techniques.
Spectral efficiency and BER.
Improving the transmitted power.


16 marks
1.Explain the functional description of digital communication system in
detail.
ELEMENTS OF DIGITAL COMMUNICATION SYSTEMS: The figure 1.2 shows
the functional elements of a digital communication system.
Source of Information:
1. Analog Information Sources.
2. Digital Information Sources. Analog Information Sources Microphone actuated by a
speech, TV Camera scanning a scene, continuous amplitude signals. Digital Information
Sources These are teletype or the numerical output of computer which consists of a
sequence of discrete symbols or letters. An Analog information is transformed into a
discrete information through the process of sampling and quantizing.

Digital Communication System





Fig 1.2: Block Diagram of a Digital Communication System SOURCE ENCODER /
DECODER: The Source encoder ( or Source coder) converts the input i.e. symbol
sequence into a binary sequence of 0 s and 1 s by assigning code words to the symbols
in the input sequence.
For eg. :-If a source set is having hundred symbols, then the number of bits used to
represent each symbol will be 7 because 27=128 unique combinations are available. The
important parameters of a source encoder are block size, code word lengths, average
data rate and the efficiency of the coder (i.e. actual output data rate compared to the
minimum achievable rate) At the receiver, the source decoder converts the binary output
of the channel decoder into a symbol sequence. The decoder for a system using fixed
length code words is quite simple, but the decoder for a system using variable length
code words will be very complex. Aim of the source coding is to remove the redundancy
in the transmitting information, so that bandwidth required for transmission is minimized.
Based on the probability of the symbol code word is assigned. Higher the probability,
shorter is the codeword. Ex: Huffman coding.

CHANNEL ENCODER / DECODER: Error control is accomplished by the channel
coding operation that consists of systematically adding extra bits to the output of the
source coder. These extra bits do not convey any information but helps the receiver to
detect and / or correct some of the errors in the information bearing bits. There are two
methods of channel coding:
1. Block Coding: The encoder takes a block of k information bits from the source
encoder and adds r error control bits, where r is dependent on k and error control
capabilities desired.
2. Convolution Coding: The information bearing message stream is encoded in a
continuous fashion by continuously interleaving information bits and error control bits.

The Channel decoder recovers the information bearing bits from the coded binary stream.
Error detection and possible correction is also performed by the channel decoder. The
important parameters of coder / decoder are: Method of coding, efficiency, error control
capabilities and complexity of the circuit.
MODULATOR: The Modulator converts the input bit stream into an electrical waveform
suitable for transmission over the communication channel. Modulator can be effectively
used to minimize the effects of channel noise, to match the frequency spectrum of
transmitted signal with channel characteristics, to provide the capability to multiplex
many signals.
DEMODULATOR: The extraction of the message from the information bearing
waveform produced by the modulation is accomplished by the demodulator. The output
of the demodulator is bit stream. The important parameter is the method of demodulation.

CHANNEL: The Channel provides the electrical connection between the source and
destination. The different channels are: Pair of wires, Coaxial cable, Optical fibre, Radio
channel, Satellite channel or combination of any of these. The communication channels
have only finite Bandwidth, non-ideal frequency response, the signal often suffers
amplitude and phase distortion as it travels over the channel. Also, the signal power
decreases due to the attenuation of the channel. The signal is corrupted by unwanted,
unpredictable electrical signals referred to as noise. The important parameters of the
channel are Signal to Noise power Ratio (SNR), usable bandwidth, amplitude and phase
response and the statistical properties of noise.

Advantages of Digital Communication
1. The effect of distortion, noise and interference is less in a digital communication
system. This is because the disturbance must be large enough to change the pulse
from one state to the other.

2. Regenerative repeaters can be used at fixed distance along the link, to identify and
regenerate a pulse before it is degraded to an ambiguous state.

3. Digital circuits are more reliable and cheaper compared to analog circuits.

4. The Hardware implementation is more flexible than analog hardware because of the
use of microprocessors, VLSI chips etc.

5. Signal processing functions like encryption, compression can be employed to maintain
the secrecy of the information.

6. Error detecting and Error correcting codes improve the system performance by
reducing the probability of error.

7. Combining digital signals using TDM is simpler than combining analog signals using
FDM. The different types of signals such as data, telephone, TV can be treated as
identical signals in transmission and switching in a digital communication system.

8. We can avoid signal jamming using spread spectrum technique.

Disadvantages of Digital Communication:
1. Large System Bandwidth:- Digital transmission requires a large system bandwidth to
communicate the same information in a digital format as compared to analog format.

2. System Synchronization:- Digital detection requires system synchronization whereas
the analog signals generally have no such requirement.

1. Channels for Digital Communications The modulation and coding used in a
digital communication system depend on the characteristics of the channel. The
two main characteristics of the channel are BANDWIDTH and POWER. In
addition the other characteristics are whether the channel is linear or nonlinear, and
how free the channel is free from the external interference.

Five channels are considered in the digital communication, namely: telephone channels,
coaxial cables, optical fibers, microwave radio, and satellite channels. Telephone channel:
It is designed to provide voice grade communication. Also good for data communication
over long distances. The channel has a band-pass characteristic occupying the frequency
range 300Hz to 3400hz, a high SNR of about 30db, and approximately linear response.
For the transmission of voice signals the channel provides flat amplitude response. But
for the transmission of data and image transmissions, since the phase delay variations are
important an equalizer is used to maintain the flat amplitude response and a linear phase
response over the required frequency band. Transmission rates upto16.8 kilobits per
second have been achieved over the telephone lines.

Coaxial Cable: The coaxial cable consists of a single wire conductor centered inside an
outer conductor, which is insulated from each other by a dielectric. The main advantages
of the coaxial cable are wide bandwidth and low external interference. But closely spaced
repeaters are required. With repeaters spaced at 1km intervals the data rates of 274
megabits per second have been achieved.

Optical Fibers: An optical fiber consists of a very fine inner core made of silica glass,
surrounded by a concentric layer called cladding that is also made of glass. The refractive
index of the glass in the core is slightly higher than refractive index of the glass in the
cladding. Hence if a ray of light is launched into an optical fiber at the right oblique
acceptance angle, it is continually refracted into the core by the cladding. That means the
difference between the refractive indices of the core and cladding helps guide the
propagation of the ray of light inside the core of the fiber from one end to the other.
Compared to coaxial cables, optical fibers are smaller in size and they offer higher
transmission bandwidths and longer repeater separations.

Microwave radio: A microwave radio, operating on the line-of-sight link, consists
basically of a transmitter and a receiver that are equipped with antennas. The antennas are
placed on towers at sufficient height to have the transmitter and receiver in line-of-sight
of each other. The operating frequencies range from 1 to 30 GHz.

Under normal atmospheric conditions, a microwave radio channel is very reliable and provides path for
high-speed digital transmission. But during meteorological variations, a severe degradation occurs in the
system performance. Satellite Channel: A Satellite channel consists of a satellite in geostationary orbit,
an uplink from ground station, and a down link to another ground station. Both link operate at
microwave frequencies, with uplink the uplink frequency higher than the down link frequency. In
general, Satellite can be viewed as repeater in the sky. It permits communication over long distances at
higher bandwidths and relatively low cost.

Bandwidth: Bandwidth is simply a measure of frequency range. The range of frequencies contained in
a composite signal is its bandwidth. The bandwidth is normally a difference between two numbers. For
example, if a composite signal contains frequencies between 1000 and 5000, its bandwidth is 5000 -
1000, or 4000. If a range of 2.40 GHz to 2.48 GHz is used by a device, then the bandwidth would be
0.08 GHz (or more commonly stated as 80MHz).It is easy to see that the bandwidth we define here is
closely related to the amount of data you can transmit within it - the more room in frequency space, the
more data you can fit in at a given moment. The term bandwidth is often used for something we should
rather call a data rate, as in my Internet connection has 1 Mbps of bandwidth, meaning it can transmit
data at 1 megabit per second.

2.Explain the geometric representation of signals.






3.Explain Gram Schmidt orthogonalisation procedure




4.Mathematical models of communication system.














UNIT II Base band formatting techniques
2 marks
1. Define Dirac comb or ideal sampling function. What is its Fourier Transform?
Dirac comb is nothing but a periodic impulse train in which the impulses
are spaced by a time interval of Ts seconds. The equation for the function is given




2. Give the interpolation formula for the reconstruction of the original signal g(t)
from the sequence of sample values {g(n/2W)}.



3. State sampling theorem.

If a finite energy signal g(t) contains no frequencies higher than W
hertz ,it is completely determined by specifying its co=ordinates at a
sequence of points spaced 1/2W seconds apart.
If a finite energy signal g(t) contains no frequencies higher than W hertz, it
may be completely recovered from its co=ordinates at a sequence of points
spaced 1/2W seconds apart.
4. Define quadrature sampling.

Quadrature sampling is used for uniform sampling of band pass signals


5. What is aliasing?
The phenomenon of a high-frequency in the spectrum of the original
signal g(t) seemingly taking on the identity of a lower frequency in the spectrum
of the sampled signal g(t) is called aliasing or foldover.
6. Give the expression for aliasing error and the bound for aliasing error.


respectively and then suppressing the sum-frequency components by means of
appropriate low pass filter. Under the assumption that fc>W,we find that
g
I
(t)&g
Q
(t) are both low-pass signals limited to -W<f<W. Accordingly each
component may be sampled at the rate of 2W samples per second. This type of
sampling is called quadrature sampling.



7. What is meant by PCM?

Pulse code modulation (PCM) is a method of signal coding in which the
message signal is sampled, the amplitude of each sample is rounded off to the
nearest one of a finite set of discrete levels and encoded so that both time and
amplitude are represented in discrete form.. This allows the message to be
transmitted by means of a digital waveform.
8. Define quantizing process.

The conversion of analog sample of the signal into digital form is called
quantizing process.
9. What are the two fold effects of quantizing process.

1. The peak-to-peak range of input sample values subdivided into a finite set of
decision levels or decision thresholds
2. The output is assigned a discrete value selected from a finite set of
representation levels are reconstruction values that are aligned with the treads
of the staircase.

10. What is meant by idle channel noise?

Idle channel noise is the coding noise measured at the receiver output with
zero transmitter input.

11. What is meant by prediction error?

The difference between the actual sample of the process at the time of
interest and the predictor output is called a prediction error.

12. Define delta modulation.

Delta modulation is the one-bit version of differential pulse code
modulation.

13. Define adaptive delta modulation.

The performance of a delta modulator can be improved significantly by
making the step size of the modulator assume a time- varying form. In particular,
during a steep segment of the input signal the step size is increased. Conversely,
when the input signal is varying slowly, the step is reduced , In this way, the step
size is adapting to the level of the signal. The resulting method is called adaptive
delta modulation (ADM).
14. Name the types of uniform quantizer?

1. Mid tread type quantizer.

2. Mid riser type quantizer.


15. Define mid tread quantizer?

Origin of the signal lies in the middle of a tread of the staircase.
Output


3a




2a



a Overload level
-3a/2 -a/2




Input



-a




-2a







Peak to peak excursion where a=delta




16. Define mid-riser quantizer?

Origin of the signal lies in the middle of a riser of the staircase



O/p








3a/2






a/2

Over load level



a 2a 3a 4a i/p








17. Define quantization error?

Quantization error is the difference between the output and input values of
quantizer.

18. What you mean by non-uniform quantization?

Step size is not uniform. Non-uniform quantizer is characterized by a step
size that increases as the separation from the origin of the transfer characteristics is
increased. Non-uniform quantization is otherwise called as robust quantization
.

19. Draw the quantization error for the mid tread and mid-rise type of quantizer?

For mid tread type:

Quantization
error a/2

Input


-a/2 a




For mid riser type:


Quantization error




a/2


Input


a


20. What is the disadvantage of uniform quantization over the non-
uniform quantization?

SNR decreases with decrease in input power level at the uniform
quantizer but non-uniform quantization maintains a constant SNR for wide
range of input power levels. This type of quantization is called as robust
quantization.




21. What do you mean by companding? Define compander.

The signal is compressed at the transmitter and expanded at the receiver. This is
called as companding. The combination of a compressor and expander is called

a compander.


22. Draw the block diagram of compander? Mention the types of
companding? Block diagram:

Input Compressor uniform quantizer expander o/p signal

Transmitter receiver
Types of companding:

1. law companding

2. A law companding


23. What is PAM?

PAM is the pulse amplitude modulation. In pulse amplitude
modulation, the amplitude of a carrier consisting of a periodic train of
rectangular pulses is varied in proportion to sample values of a message
signal.



24. What is the need for speech coding at low bit rates?

The use of PCM at the standard rate of 64 Kbps demands a high channel
bandwidth for its transmission ,so for certain applications, bandwidth is at
premium, in which case there is a definite need for speech coding at low bit
rates, while maintaining acceptable fidelity or quality of reproduction.

25. Define ADPCM.

It means adaptive differential pulse code modulation, a combination of
adaptive quantization and adaptive prediction. Adaptive quantization refers to a
quantizer that operates with a time varying step size. The autocorrelation
function and power spectral density of speech signals are time varying functions
of the respective variables. Predictors for such input should be time varying. So
adaptive predictors are used.



26. What is meant by forward and backward estimation?

AQF: Adaptive quantization with forward estimation. Unquantized
samples of the input signal are used to derive the forward estimates.

AQB: Adaptive quantization with backward estimation. Samples of
the quantizer output are used to derive the backward estimates.
APF: Adaptive prediction with forward estimation, in which
unquantized samples of the input signal are used to derive the forward
estimates of the predictor coefficients.

APB: Adaptive prediction with backward estimation, in which Samples
of the quantizer output and the prediction error are used to derive estimates of
the predictor coefficients.

27. What are the limitations of forward estimation with backward stimation?
Side information

Buffering
Delay


28. How are the predictor coefficients determined?

For the adaptation of the predictor coefficients the least mean
square (LMS) algorithm is used.
29. Define adaptive subband coding?

It is a frequency domain coder, in which the speech signal is divided in to
number of subbands and each one is coded separately. It uses non masking
phenomenon in perception for a better speech quality. The noise shaping is done
by the adaptive bit assignment.


30. What are formant frequencies?

In the context of speech production the formant frequencies are the
resonant frequencies of the vocal tract tube. The formants depend on the shape
and dimensions of the vocal tract.

31. What is the bit rate in
ASBC? Nfs= (MN)
(fs/M) Nfs->bit rate

M->number of subbands of equal
bandwidths N->average number of bits
fs/M->sampling rate for each subband


32. Define Adaptive filter?

It is a nonlinear estimator that provides an estimate of some desired
response without requiring knowledge of correlation functions, where the
filter coefficients are data dependent. A popular filtering algorithm is the LMS
algorithm.
33. Define data Signalling Rate.


Data signalling rate is defined as the rate measured in terms bits per
second(b/s) at which data are transmitted.
Data signaling rate Rb=I/Tb Where
Tb=bit duration.
16 marks.
1.State and prove Sampling theorem.
SAMPLING:















rate. sampling higher have or bandwidth signal
limit the may we aliasing, avoid .To occurs aliasing
sampling) (under limited - band not is signal When the
2
1
interval Nyquist
2 rate Nyquist
)
2
( from recovered completely be can signal The . 2
. )
2
( by described
completely be can , to limited is which signal 1.a
signals limited - band strictly for Theorem Sampling
W
W
W
n
g
W
n
g
W f W
rate sampling : 1
period sampling : where
(3.1) ) ( ) ( ) (
signal sampled ideal the denote ) ( Let
s s
s
s
n
s
T f
T
nT t nT g t g
t g
















n
s
m
m
s s s
s
n
s
m
s s
m
s s
m s s
n
s
W
n f j
W
n
g f G
W
T W f f G
mf f G f f G f f G
nf T j nT g f G
mf f G f t g
mf f G f
T
m
f
T
f G
nT t t
(3.4) ) exp( )
2
( ) (
2
1
and for 0 ) ( If
(3.5) ) ( ) ( ) ( or
(3.3) ) 2 exp( ) ( ) (
obtain to (3.1) on Transform ier apply Four may or we
(3.2) ) ( ) (
) (
) (
1
) (
) ( ) g(
have we A6.3 Table From
0
















Figure 3.3 (a) Spectrum of a signal. (b) Spectrum of an undersampled
version of the signal exhibiting the aliasing phenomenon.

) ( of formula ion interpolat an is (3.9)
(3.9) - , ) 2 ( sin )
2
(

2
) 2 sin(
)
2
(
(3.8) )
2
( 2 exp
2
1
)
2
(
) 2 exp( ) exp( )
2
(
2
1

) 2 exp( ) ( ) (
have may we , )
2
( from ) ( t reconstruc To
t g
t n Wt c
W
n
g
n Wt
n Wt
W
n
g
df
W
n
t f j
W W
n
g
df f t j
W
n f j
W
n
g
W
df ft j f G t g
W
n
g t g
n
n
n
W
W
W
W
n


Figure 3.4 (a) Anti-alias filtered spectrum of an information-bearing signal. (b) Spectrum of
instantaneously sampled version of the signal, assuming the use of a sampling rate greater than the
Nyquist rate. (c) Magnitude response of reconstruction filter

2.Explain Quantisation in detail
Quantization Process:









function. staircase a is which stic, characteri quantizer the called is
(3.22) ) g( mapping The
size. step the is , levels tion reconstruc or tion representa the are
L , 1,2, , where is output quantizer the then ) ( If
3.9 Fig in shown as ) (
amplitude discrete a into ) ( amplitude sample
the ing transform of process The : on quantizati Amplitude
. threshold decision or the level decision the is Where
(3.21) , , 2 , 1 , :
cell partition Define
1

1
m
m m
t m
nT
nT m
m
L k m m m
k k
s
s
k
k k

k J
J
k k
k
k











Figure 3.10 Two types of quantization: (a) midtread and (b) midrise.

Quantization Noise:



Figure 3.11 Illustration of the quantization process












(3.28)
12


1
) ( ] [
(3.26)
otherwise
2 2

, 0
,
1
) (
levels of number total : ,
(3.25)
2
is size - step the
type midrise the of quantizer uniform a Assuming
(3.24) ) 0 ] [ ( ,
(3.23)
value sample of variable
random by the denoted be error on quantizati Let the
2
2
2
2
2
2
2 2 2
max max
max
dq q dq q f q Q E
q
q f
L m m m
L
m
M E V M Q
m q
q Q
Q Q
Q














). (bandwidth increasing lly with exponentia increases (SNR)
(3.33) )2
3
(
) (
) ( of power average the denote Let
(3.32) 2
3
1

(3.31)
2
2

(3.30) log
sample per bits of number the is where
(3.29) 2
form, binary in expressed is sample quatized When the
o
2
2
max
2
o
2 2
max
2
2
max
R
m
P
P
SNR
t m P
m
m
L R
R
L
R
Q
R
Q
R
R


3.Explain PCM in detail.


















5.Explain DPCM in detail.














6.Explain Delta modulation in detail.










7.Explain ADM in detail.





8.Compare all the digital modulation techniques.




9.Explain Linear prediction in detail.
Linear Prediction (to reduce the sampling rate):
Consider a finite-duration impulse response (FIR)
discrete-time filter which consists of three blocks :
1. Set of p ( p: prediction order) unit-delay elements (z-1)
2. Set of multipliers with coefficients w1,w2,wp
3. Set of adders ( )









(3.62)
2
have we (3.61) and (3.60) (3.59) From
minimize to , , , Find
(3.61) error) square (mean
be e performanc of index Let the
(3.60)
is error prediction The
(3.59) ) (
is ) input the of predition linear (The output filter The
1 1
1
2
2 1
2
1

p
j
p
k
k j
p
k
k
p
p
k
k
k n x j n x E w w
k n x n x E w n x E J
J w w w
n e E J
n x n x n e
k n x w n x

equations Hopf - Wiener called are (3.64)
(3.64) 2 1 ,
0 2 2
(3.63) 2
as simplify may We
) (
ation autocorrel The

) (
0) ]] [ [ ( mean zero with process stationary is ) ( Assume
1
1
1 1 1
2
2
2 2 2
,p , , k k R k R j k R w
j k R w k R
w
J
j k R w w k R w J
J
k n x n x E k R kT R
n x E
n x E n x E
n x E t X
p
j
X X X j
p
j
X j X
k
p
j
p
k
X k j
p
k
X k X
X
s
X
X

2
min
1

1 2
0
2
1
2
1 1
2
min
2 1 0

1
0
1
than less always is 0,
(3.67)

2
yields (3.63) into (3.64) ng Substituti
, , 1 , 0
0 2 1
2 0 1
1 1 0

]] [ ],..., 2 [ ], 1 [ [
, , , where
(3.66) exists if , as
X X X
T
X
X X
T
X X
T
X X
p
k
X k X
p
k
X k
p
k
X k X
X X X
X X X
X X X
X X X
X
T
X X X X
T
p
X X X
J
k R w
k R w k R w J
p R R R
R p R p R
p R R R
p R R R
p R R R
w w w
r R r
r R r w r
R
r
w
r R w R

Linear adaptive prediction :

on. presentati of
e convenienc for is
2
1
and parameter size - step a is where
(3.69) 2 1 ,
2
1
1
1 update Then . n iteration at value the denotes
(3.68) 2 1 ,
ector gradient v the Define
descent steepest of method the using iteration Do 2.
values initial any starting , , , 2 , 1 , Compute 1.
sense follow in the adaptive is predictor The
,p , , k g n w n w
n w n w
,p , , k
w
J
g
p k w
k k k
k
k
k
k
k

algorithm square - mean - lease called are equations above The

(3.73) (3.60) (3.59) by where
) 72 . 3 ( , , 2 , 1 ,
1
) 71 . 3 ( , , 2 , 1 , 2 2
n) expectatio the (ignore
k]] - E[x[n]x[n for use we computing he simplify t To
(3.70) , , 2 , 1 , 2 2
2 2

1
1
1
1
1
j n x n w n x n e
p k n e k n x n w
j n x n w n x k n x n w n w
p k k n x j n x n w k n x n x n g
k n x n x
p k k n x j n x E w k n x n x E
j k R w k R
w
J
g
p
j
j
k
p
j
j k k
p
j
j
p
j
j
P
j
X j X
k
k
k

Figure 3.27
Block diagram illustrating the linear adaptive prediction process