Subband
Decomposition
Techniques for
Adaptive
Channel
Equalisation
Hafizal
Mohamad', Stephan Weiss2,
Nor Azhar Mohd Arif' and Mohamad Yusoff Alias11 Faculty of Engineering, Multimedia University, Cyberjaya, Selangor, Malaysia
2 School of Electronics & Computer Science, University ofSouthampton, UK
{hafizal,norazhar,yusoff}@mmu.edu.my, [email protected]
Abstract-In this contribution, the convergence behaviour
of the adaptive linear equaliser based on subband
decompo-sition technique is investigated. Two different subband-based
linear equalisers are employed, with the aim ofimproving the
equaliser's convergence performance. Simulation results over
threechannel modelshavingdifferentspectralcharacteristicare
presented. Computer simulations indicate that subband-based
equalisers outperformthe conventionalfullband linearequaliser
whenchannel exhibitsevere spectral dynamic. Convergencerate
of subband equalisers are governed by the slowest subband,
whereby different convergence behaviour in each individual
subband is observed. Finally, the complexity of fullband and
subbandequalisers is discussed.
I. INTRODUCTION
Indigitalcommunicationsystems,each symboltransmitted over a time-dispersive channel will be blurred over a time
intervallarger thanasymbol period.Linearchannel distortions
causedbymulti-path propagation and limitedbandwidth lead
tointer-symbolinterference(ISI)atthe
receiver,
which in turn results in ahighbit errorrate inthe detection. ISI is one ofthe major obstacles to reliable high-speed data transmission
overwireless channels of limited bandwidth [1].
Linearequaliser (LE)hasbeenwidelyemployedtomitigate
the effect of ISI for itssimple implementation. However,there
are some limitation imposed to LE, for instance, poor
per-formance ofLEwas reportedwhen channel exhibits
spectral
dynamics[1]. Ageneral channel andequaliserblockdiagram
isdepicted inFig. 1, where theequaliserhas the tasktoundo distortion exhibitedbythechannel.The equaliser
w[n]
lies incascade betweenthepropagationchannel
c[nr
andthedecisioncircuit,where
x[n]
andy[rn]
arethe equaliser'sinput
and outputsignals, respectively. The transmitted symbol is denoted by
u[n],
while the noise corrupting the received signalx4n]
isrepresented by v[n].
v[n]
u[n] chan.nel +
xLn]
[equaliser
yAn]
c[n)
wtnFig. 1. General channel andequaliser block diagram.
Least meansquare(LMS) algorithm is popular in numerous
adaptive
filtering
applications, includingadaptiveequalisation,due to its simplicity in implementation and its robustness
characteristic. It is also known that the convergence speed
of LMS algorithm is inversely proportional to the eigenvalue
spreadof its inputsignal[2]. Theconventionallinearequaliser
may suffer from slow convergence due to strong spectral
dynamics at the input of the equaliser [3]. Alternatively, by
using recursive least square (RLS)
algorithms,
fasterconver-gence speed can be obtained at the cost of increasing the
computational complexity of order
0(L2),
where L denotesthe filterlength [41.
Motivated by the advantage ofprewhitening effect of
thp
filter banks and parallelisation properties
[51,
[6], notablesuccessof subbanddecomposition methodinadaptive filtering
applications e.g echo cancellation has been reported in
[7].
Therefore, in this paper, we investigate the performance of
subband-based linear equaliser with the aim of increasing the convergence speed while maintaining the low complexity of
the LMS
algonrthm
of order0(L).
Two different subbandequaliserstructures are employed to improve the equaliser's
performanceintermsof mean square error (MSE) convergence
behaviour as compared to the conventional linear equaliser
benchmark.
The remaining of this paper is organised as follows. In
Section
II
we briefly describe the channel characteristics,eigenvalue spread and their relation to the convergence of
LMS-type algorithm. Then, we introduce various fullband and
subband-based linear equaliser structures as well asdiscussing
their computational complexity in Section III. Finally, in
Section IV, we present some simulation results to demonstrate the performance of the subband decomposition approach.
II. CHANNEL CHARACTERISTICS
In this section, we introduce three discrete-time channels
thatwill be used in our simulations. The channel models are
listed in Tab.
I.
The three channels exhibit varying degrees ofspectral dynamic as shown in Fig. 2, whereby the minimum
magnitude of Channel 1, 2 and 3 are -60dB, -25dB and
-8dB, respectively.The channels represents
different
spectraldynamic with Channel 1 displays an example of mild channel thatexhibitsless spectral dynamic. The worst spectral dynamic amongst the three channels is represented by Channel 3,
while Channel 2 provides the medium spectral dynamic in
comparisonto Channel 1 and Channel 3.
An illustration of a generalised discrete Fourier
transform
(GDFT) modulated filter banks having K = 4 number of
Channel Label ChannelImpulse Response(CIR)
Channel 1 0.182 +0.269z-'+0.888z-2
+0.269z-3+0.182z-4
Channel 2 0.292+ 0.360z- + 0.756z2
+0.360z-3+0.292z-4
Channel 3 0.227+O.460z-1l+0.688z'
+0.460z-3+O.227z-4
TABLE I
STATICDISPERSIVE CHANNELIMPULSERESPONSES
now
sub-dividing
thewhole channel models spectrum into4smaller
frequency
bands(so-called
"subbands"),
which intumwill reducethechanneloutput
eigenvalue
spread within each subband. Theeigenvalue
spreadcan be approximatedby
theratiobetween themaximumand minimum valueofthe channel
powerspectral dynamic. Notethat the deep channel spectrum
islocatedin the2nd and3rdsubbandscovering the
frequency
interval
Q/wr
[0.5;
1.01
andQ/lr
=[1.0;
1.5],
respectively.
On the other
hand,
observe thatwithin 1st and4th
subbandsrepresentchannelspectrums that exhibitlessspectral
dynamic,
viz. lesseigenvalue spread.
_t
0
0
0-Q-20 t-30 0
E
Channels SpectrumandProtoy FRterwlthK=4;N23;Lp=60
0 0.2 0.4 0.6 0.8 1 1.2 1.4 1.6 1.8 2
normalisedangular frequency Dln
Fig.2. Channelspectralcharacteristicforthreechannelslisted in Tab.I.An
exampleof GDFTmodulatedfilterbanks with K=4number of subbands is also shownbythe dottedlinesindicatingthebandedges.
III. EQUALISER STRUCTURES
A general schematic ofa linear equaliser is depicted in
Fig. 3, whereby x[n] and y[n] denote the equaliser's input
(received signal) and equaliser's output (equalised signal),
respectively In thefollowing,wewillderiveerrorformulation
using LMS-type algorithm for minimum mean square error
(MMSE) adaptation. Let the input signal to the equaliser as
x(n) where
x(n)= [x(n) x(n- 1) *- x(n- Lfullband -1)T (1)
and Lfullband denotes thelength offillband equaliser.
The error signal e(n) is defined asthe difference between
thetrainingsequenced(n) and theoutputthroughtheequaliser y(n),
e(n)=d(n) -y(n) =d(n)- w(n)Hx(n) (2)
By applying a normalised LMS (NLMS) algorithm, the
weightvector attime n +1 is updated by
w(n
±1)
=w(n)
+p.x(n)e*(n)
x(n)HX(nt)
+a (3) where ,u is the step size, while a is a constant value.It is known that LMS-type algorithm suffers from slow
convergence speed when the input signal to the adaptive equaliser x(n) iscorrelated [2]. As mentioned in Section II, the convergence rate very much depends on the eigenvalue spreadoftheequaliser input signal. To circumventthis prob-lem,we employ two subband structures in order to increase the equaliser's convergence rate [5], [6], [7] that decompose
the equaliser inputx(n) byusing filter banksimplementation.
d[n]
=u[n-A]o
x[
n
et[n
y[n]
Fig. 3. Block diagram of linearfullband adaptive equaliser.
A. SubbandEqualiserStructures
Afirststructure ofsubband equaliser, called StructureI, is shownFig.4,wherebyH andG denoteanalysis and synthesis filter bank blocks including decimationandexpansionasgiven
in Fig. 5. Thefilters in both analysis and synthesis bank are
bandpassfilters, which, together with the decimation process
yielda prewhitening ofthe subband signals comparedto the
input.
The system block W is a diagonal polynomial matrices
representing filters for weight updating within each ofthe Ksubbands. Adaptive filteringcan beoperated in each band independently,whichlendsitself to a parallel implementation. However, subband structures introducealiasing that limits the
algorithm
performance.Therefore, oversampled
filter banks (OSFB) with an oversampling ratio K/N > 1 are preferredhere [5].
d[n] =
u[n-A]l
Fig.4. Blockdiagramofsubband StructureIadaptiveequaliser.
Let the subband
decomposition
byanalysis
filter bank Hdivide the sequenceatthe equaliser
input,
x(n),
into Ksub-band sequences,
x()(n),..
- ,x()
(n),
where thesuperscript
(k)
denotes the datacomponentatthekth subband. WedefineX(n)= [(x(1)(n)) (x(2)(n)) ... (x(K)(n))1 (4)
.. _ .. .... ....
* channel2
IchanneI23
. . , 8 ,, _
d~~~~chnneI3
, -,,i,i,,,, j . n mm ID.
u-'-I1
x[n]
X [ y[n]analysis filter bank weight synthesisfilterbank
Fig. 5. Subbanddecomposition usingK number of subband decimatedby
afactor of N withanalysisfilters H andsynthesisfilters G. Anindependent
filterweightupdateW is also shown.
asthe datavector forthe subband
equaliser
withx(k)(n)=
[X(k)(n)
...x(k)(n-
Lsubband -1)1 (5)where
Lsubband
denotes the length of subband equaliser.Therefore, the error signalwithin each subband becomes
e(k)
(n) =d(n) -y(n) =d(n)- w(k)(n)Hx(k)(n) (6)The error is evaluated based on reconstructed
y(n)
bysynthesis filterbank
G,
and isprojected
backinto the subbanddomaintoupdatethe filters intheweightvector
W(k),
defined asW(n)-
[(w(1)(n))
(w(2)(n))
(w(K)(n))]
(7)
The system block W is a
diagonal
polynomial
matricesrepresenting filters for
weight updating
within each of theKsubbands.
Adaptive
filtering
can beoperated
ineach bandindependently,which lends itselfto aparallel
implementation.
Theadaptive subband-basedcanimplementanormalized LMS(NLMS)algorithm,wheretheadaptation of theweight vector
are carriedoutindependently ineach subband and is
updated
by
w(k)(n+1) -w(k)(n)+
Ax(k)(n)HX(k)(n)
x(k)(n)e(k)*
+n
(8)+a
As an alternative subband implementation and for
com-parison purpose, we will
modify
the subband Structure I and forming a new subband equaliser structure. The new subband structure will evaluateerrorandupdate weightvectorcoefficients in subband domain. The schematic of subband Structure II is shown in Fig.6.
d[n] =u[n- A]
Fig.6. Blockdiagramof subband Structure1Iadaptiveequaliser.
For the derivation, we will follow the same definition
that waspresented for Structure L The error formulation for
Structure II is define as,
E(n) - D(n) - Y(n) = D(n) -diag{WH(n)X(n)}
(9)
where the capital letter denotes the operations in subband
domain and the definition is according to those in Eqn. 6.
The estimates of the weight vector is givenby
W(n+1) =W(n) +
AX(n)diag{E*(n)}
P
(10)
where P=diag[P(k),k = 1,2..
,K]
is a diagonal matrixwith thesignal power at the kth subband
p(k) =E
[(x(k))Hx(k)
+a] as its kthdiagonal element.Fromboth derivation for subbandStructure IandStructure
II for LMS-type algorithm, it is expected for subband to
convergefaster then the fullband counterpart, as the equaliser
input x(n) will be decorrelated by the prewhitening effect
ofthe filter banks. Furthermore, theeigenvalue spread of the
input to the equaliser will be reduced in each sub-divided
subband implementation [8], as evident in Section 1I.
B. Computational Complexity
An impulse response in the decimated subband domain
canbemodelledwith less equalisercoefficients than required in the fullband case due to the increased sampling period,
thereby achieving.In
general,
thelength of subband equalisercoefficients,
Lsubband,
is given by[7],
Lfullband+ 2
.Lp
Lsubbana
-N(I1)
where N is the decimation factor and
Lfullband
is theequiv-alent fullband equaliser length. Note that
Lp
is the lengthof a filter used in the filter bank implementation, which is
oftenrefereed to as prototypefilter.In
(11),
subbandequaliser reduces the necessaryfullband equaliser length by a factor ofN, wherebyamoderate overhead of
Lp
has tobe taken intoaccount asinthe subband domainpotentially fractional delays
haveto bemodelled.
Thecomplexity of the fullband equaliserexpressedin terms
of thenumber ofmultiply-accumulate (MAC) whenusing an
NLMS algorithm for updating is approximately given by
Cfullband
=4.
2Lfullband
- 8,Lfullband
[MAC],
(12)
where Lfullband denotes the number of filter taps in the
fullband equaliser. As the complex input signal is utilised
throughout this treatise, the equaliser taps are also complex
valued. Since each complex multiplication is equivalent to 4
real multiplication, the factor of 4 in (12) accounts for the
requiredcomplex valued arithmetic.
In the context of subband equaliser, the complexity of
the filter banks has to be taken in consideration. In a fast
implementation, one GDFT analysis or synthesis filter bank operationrequires
numberof MAC operationsperfuillband samplingperiod [9],
whereN, K and
Lp
denotethedecimationfactor, thenumberof subbands and prototype filter length,
respectively.
Thusthe complexity ofboth subband-based equaliser StructuresI
and Structure IIutilising 3filter banks and using the NLMS
adaptive algorithmisgiven by
K
Csubband = N 8-Lsubband+3*Cfilter bank [MAC]. (14)
IV. SIMULATION RESULTS
In thissection, simulationresults anddiscussionconcerning
theperformance of the conventionalfullbandand theproposed
subband equalisers introduced in Sec. III are presented. For
computer simulations, we consider a quadrature amplitude
modulation (QAM) system having a 64QAM constellation
transmitted over two different channel models displayed in
Fig. 2. AnNLMS algorithm with a step size of u = 0.4 is
utilised foradaptationof the fullband and subbandequalisers. The signalto noise ratio (SNR) is set at SNR= 30dB for all
simulations. The perfonnance of both fullband and subband equalisers is measured in terms their mean squared error
(MSE)convergence
behaviour, whereby
boththetransient andsteady statebehaviour are of interest.
Inthe
following
subsections, we investigate the MSEper-formance comparison for fuillband and subband
equalisers
utilising K=4subbands.
Further,
theindividual(lst,
2nd,
3rd
and4th)
subbands convergence speed is analysed. Thecom-putational
complexity
for different system designsemploying
different number ofsubbands is alsoinvestigated.
A. MSE
Performance
Comparison of FullbandandSubbandEqualisers
The MSE convergence performance comparison of the
fullband and subband equalisers overtwo different channels
is depicted in
Fig.
7. The MSE convergence curves wereaveraged over anensemble of 20runs.
Forsubbandequalisers,the OFSBssplitsthe fullband
signal
intoK=4numberof subbandssignals
decimatedby
afactorof N = 3 with the prototype filter
length
ofLp
= 60. Thelength offullband filterwas selected to be
Lf
=100,
whilefor thesame
modelling capability,
thecorresponding
subbandfilter
length
ofL.
= 53waschosen.Observe that for Channel 1 that has a mild spectrum
dynamic, the MSE convergence
performance
of fullband iscomparable to subband
-equalisers performance
as shown inFig. 7(top).However, forChannel2,aslowconvergence rate of fullband
equaliser
isnoticeable in inFig.
7(middle).
Fora severespectrum
dynamic
Channel3, theconvergencespeed of the subband
equalisers
considerably
outperform
thefullband
equaliser
asevidenceinFig.
7(bottom).
Thesuperi-ority ofthe subband
equaliser
performance
canbe attributedto the reduction in
eigenvalue spread
viasub-dividing
severespectrum
dynamic
channel intoa smallerfrequency
bins.B. MSE Convergence ofIndividualSubbands
The subband decomposition ofthe received signal, which
has been transmitted over three channel models, enables a
reduction in eigenvalue spread values with each subband.
The eigenvalue spread can be approximated by the ratio of
the maximum and the minimum spectral dynamic in each
subbands. Due to different eigenvaluespread for within each
K =4 subbands, the leaming characteristic ofan individual
subband is different. The MSE convergence behaviour with
respect to the individual subband's eigenvalue spread for
subband-based equaliser is shown in Fig. 8.
a 5
:2.
w-10
U) 2-tS
a)
63 -20
MSE forChanrnel1withK=4
0 0.2 0.4 0.6 0.8 1 1.2 1.4 1.6 1.8 2
iterations x 0
MSE for Channel 2withK=4
MSE forChanne3wthK4fullband
ffi - - structure
'-;o lc<\
1wi5~~~~~~~~~~~~~~~~~~~truscture
It-20'| z
0 0.5 1 1.5 2 2.5 3 3.5 4
iterations x10
MSE forChannel 3 wfith K =4
0r
-2
aa -8 -6
0)
> -8
-lo, I I
0 0.5 1 1.5 2
iterations 2.5 3 3.5 X
Fig. 7. MSE perfornance of the fullband, StructureIandStructure II for
(top) Channel 1,(middle) Channel 2, and (bottom) Channel 3, whereby K=
4subbandswereemployed.
Duetodifferenteigenvalue spread for each K=4subbands,
the leamingcharacteristic ofanindividual channel is different.
The simulation results for subband Structure Iare shown in
Fig. 8. It is indicative that the overall MSE perfonnance for
the simulated channels is influenceby theconvergenceof the
slowestsubbands. Note that forall threechannels,the 2nd and
3rd subbands that encompasses high eigenvalue spreadlimits
the overall achievable MSE convergenceof theequaliser.
\ ~~~~~~~~~~~~~~~~~~~--structure
\ ~~~~~~~~~~~~~~~~~~~~~~....structure11.
~~~~~~~~~~~.
-fullband I--structure tI
' **sncue1
Structuret: Channel 1
* ~~~~~~~~~~~~overallMSE
k URqFfS KW4 K \MSEfr2r dKand3,dK
-t5
w
-20 \
-35
0 0.2 0.4 0.6 0.8 1 1'2 1.4 1.6 1.8 2
iteratons I symbols xls'
Structure1: Channel 2
0
-. overall MSE -5 i . SMSEfce 1CaKand4thK
_-10~ >~ * . MSEfor2aiK and3,dK
X-30_
-35
0 O.S 1 1.5 2 2.5 3 3.5 4
iterations I symbols xle
Structure 1: Channel 3
C.Copttoa Complexit
L .lddueto operating in the decimoverate MSE
-5 i d a flfofMSE and4stK servethat as K incrase, te r d saM5Efor2Kand 3elK
4>-20
<|-25
----3nL5 d e .F , i a
0 0.5 1 1.5 2 2.5 3 3.5 4
iterationsIsymbols x 104
Fig. 8. Illustration of individual subband MSEconvergence behaviourof the K 4subband Structure I for(top)Channel1,(middle)Channel2,and
(bottom)Channel 3.
C.
Compultational Complexity
In Section II we have noted that the subband
equaliser
length
Lqubbald
is shorter than thefKllband equaliserlength
L5fllband
due tooperating
in the decimated domain. Thisreduction of
Laubbdydweth
respecttoLfm.llbd
obeys (II).
Therequired
equaliserlength
of fullband and subbandsystems
is shown in
Fig.
9,
where thelegend
indicates differentimplementations
varying
the number of subbands K.Ob-serve that as K
increases,
therequired
subbandequaliser
length
Lsubbd
decreases. Forexample,
ifafsllbandequaliser
requires
Lfnllbnd
= 300 number of taps, thecorrespond-ing
subbandequaliser
having
K - 4 subbands will needLsubband = 140 filter coefficients
pex
ofbthedfiltereas thesubband
equaliser
associatedwith K=32requires
L,ubba,,d
=65 filtertaps for
acbieving
thesimilarmodelling
capabilities
as the farllbandsystem.Consider a fullband
equaliser
and a subbandequaliser
inK = 4 subbands with N = 3 and
Lp
= 60.Assuming
Lfullband -=150,
we obtainLsubband
=90according
to(11).
The
complexity
of the fullbandequaliser
asgiven
in(12)
isCfullband
= 8-Lfullband
= 8 -150 = 1200 MACs. Forthe subband
realisation,
thecomplexity
of the filter bankimplementation
hastobe taken into consideration and isgiven
in
(13)
asCfilter
bank = ' *(2(60)
+4(4)10924
+8(4))
Fulibandequaliser length,Lband
Fig. 9. Equivalence of fiillband equaliser length Lfullband and subband
equaliserlength Lsubband calculatedaccordingto(I1).
61MACs. Therefore,the complexity of the subbandequaliser
basedon(14)is
Csubband
= -8 90+361- 1143MACs. Forthe abovecalculation, it is observed that the subbandequaliser gains a reduction in computational cost in comparison to its
fullbandcounterpart.
V. CONCLUSIONS
In this paper, we investigate two structures for subband
adaptive equalisation. Simulations results indicate the clear
advantage of using subband-based equaliser when channel
exhibits spectral dynamic, while maintaining the similar
per-formance for mild channel in comparison to the fullband
equaliserbenchmark. Convergencerateofsubbandequalisers
are govemedby the slowest subband having a large spectral
dynamicincomparisontoothersubbands.Intermsof
compu-tational complexity, subbandstructuresare veryuseful whena
lengthy equaliserresponse isneededto copewithamultipath
channel that exhibits alarge delay spread. The advantages of
thesubband equliserstructurescanbeexploited fornumerous
potential applications such as broadband wireline
communi-cations, e.g.ADSL modems.
REFERENCES
[1] J. G. Proakis, DigitalCommunication, 4thEd, Mc-Graw Hill Interna-tional, 2000.
[21 B. Widrow and S. D. Steams, Adaptive Signal Processing, PrenticeHall, Englewood Cliffs, New York, 1985.
[3] M.Rupp,"OntheLearning Behaviour of Decision Feedback Equalizers,"
inAsilomarConferenceonSignals, Systems,andComputers, Monterey,
CA, October 1999.
[4] S. Haykin, Adaptive Filter T7heory, Prentice Hall, Upper Saddle River, N.J., 1996.
[5] W.Kellermann,"AnalysisandDesignof MultirateSystemsfor Cancella-tion ofAcoustical Echoes," inProc.IEEEICASSP, vol.5,pp.2570-2573,
NewYork, 1988.
[6] J. J.Shynk,"Frequency-DomainandMultirateAdaptive Filtering,"IEEE
SignalProcessing Magazine, vol.9,pp. 14-37,January1992.
[7] A.Gilloireand M.Vetterli, "Adaptive Filtering in Subbands with Critical Sampling: Analysis, Experiments and Applications to Acoustic Echo Cancellation," IEEETransactionsonSignal Processing, vol.SP-40,no.8,
pp.1862-1875, August 1992.
[8] S. S. PradhanandV. U.Reddy,"ANewApproachtoSubbandAdaptive Filtering," IEEE Transactions on SignalProcessing, vol. 47, no. 3, pp. 655-664, March 1999.
[9] S. Weiss and R. W. Stewart, "Fast Implementation of Oversampled Modulated Filter Banks," IEE Electronics Letters, vol. 36, no. 17, pp. 1502 1503, August2000.