<< Chapter < Page Chapter >> Page >

Transversal Equalizer

A training sequence used for equalization is often chosen to be a noise-like sequence which is needed to estimate the channel frequency response.

In the simplest sense, training sequence might be a single narrow pulse, but a pseudonoise (PN) signal is preferred in practise because the PN signal has larger average power and hence larger SNR for the same peak transmitted power.

Figure 1 Received pulse exhibiting distortion.

Consider that a single pulse was transmitted over a system designated to have a raised-cosine transfer function H RC ( t ) = H t ( f ) . H r ( f ) size 12{H rSub { size 8{ ital "RC"} } \( t \) =H rSub { size 8{t} } \( f \) "." H rSub { size 8{r} } \( f \) } {} , also consider that the channel induces ISI, so that the received demodulated pulse exhibits distortion, as shown in Figure 1, such that the pulse sidelobes do not go through zero at sample times. To achieve the desired raised-cosine transfer function, the equalizing filter should have a frequency response

H e ( f ) = 1 H c ( f ) = 1 H c ( f ) e c ( f ) size 12{H rSub { size 8{e} } \( f \) = { {1} over {H rSub { size 8{c} } \( f \) } } = { {1} over { lline H rSub { size 8{c} } \( f \) rline } } e rSup { size 8{ - jθ rSub { size 6{c} } \( f \) } } } {} (1)

In other words, we would like the equalizing filter to generate a set of canceling echoes. The transversal filter, illustrated in Figure 2, is the most popular form of an easily adjustable equalizing filter consisting of a delay line with T-second taps (where T is the symbol duration). The tab weights could be chosen to force the system impulse response to zero at all but one of the sampling times, thus making H e ( f ) size 12{H rSub { size 8{e} } \( f \) } {} correspond exactly to the inverse of the channel transfer function H c ( f ) size 12{H rSub { size 8{c} } \( f \) } {}

Figure 2 Transversal filter

Consider that there are 2N + 1 size 12{2N+1} {} taps with weights c N , c N + 1 , . . . c N size 12{c rSub { size 8{ - N} } ,c rSub { size 8{ - N+1} } , "." "." "." c rSub { size 8{N} } } {} . Output samples z ( k ) size 12{z \( k \) } {} are the convolution the input sample x ( k ) size 12{x \( k \) } {} and tap weights c n size 12{c rSub { size 8{n} } } {} as follows:

z ( k ) = n = N N x ( k n ) c n size 12{z \( k \) = Sum cSub { size 8{n= - N} } cSup { size 8{N} } {x \( k - n \) c rSub { size 8{n} } } } {} k = 2N , . . . 2N size 12{k= - 2N, "." "." "." 2N} {} (2)

By defining the vectors z and c and the matrix x as respectively,

z = z ( 2N ) z ( 0 ) z ( 2N ) size 12{z= left [ matrix { z \( - 2N \) {} ##dotsvert {} ## z \( 0 \) {} ##dotsvert {} ## z \( 2N \)} right ]} {} c = c N ) c 0 c N size 12{c= left [ matrix { c rSub { size 8{ - N} } \) {} ##dotsvert {} ## c rSub { size 8{0} } {} ##dotsvert {} ## c rSub { size 8{N} }} right ]} {} x = x ( N ) 0 0 0 0 x ( N + 1 ) x ( N ) 0 x ( N ) x ( N 1 ) x ( N 2 ) x ( N + 1 ) x ( N ) 0 0 0 x ( N ) x ( N 1 ) 0 0 0 0 x ( N ) size 12{x= left [ matrix { x \( - N \) {} # 0 {} # 0 {} # dotslow {} # 0 {} # 0 {} ##x \( - N+1 \) {} # x \( - N \) {} # 0 {} # dotslow {} # dotslow {} # dotslow {} ## dotsvert {} # {} # {} # dotsvert {} # {} # dotsvert {} ##x \( N \) {} # x \( N - 1 \) {} # x \( N - 2 \) {} # dotslow {} # x \( - N+1 \) {} # x \( - N \) {} ## dotsvert {} # {} # {} # dotsvert {} # {} # dotsvert {} ##0 {} # 0 {} # 0 {} # dotslow {} # x \( N \) {} # x \( N - 1 \) {} ## 0 {} # 0 {} # 0 {} # dotslow {} # 0 {} # x \( N \) {}} right ]} {}

We can describe the relationship among z ( k ) size 12{z \( k \) } {} , x ( k ) size 12{x \( k \) } {} and c n size 12{c rSub { size 8{n} } } {} more compactly as

z = x . c size 12{z=x "." c} {} (3a)

Whenever the matrix x is square, we can find c by solving the following equation:

c = x 1 z size 12{c=x rSup { size 8{ - 1} } z} {} (3b)

Notice that the index k was arbitrarily chosen to allow for 4N + 1 size 12{4N+1} {} sample points. The vectors z and c have dimensions 4N + 1 size 12{4N+1} {} and 2N + 1 size 12{2N+1} {} . Such equations are referred to as an overdetermined set. This problem can be solved in deterministic way known as the zero-forcing solution, or, in a statistical way, known as the minimum mean-square error (MMSE) solution.

Zero-Forcing Solution

At first, by disposing top N rows and bottom N rows, matrix x is transformed into a square matrix of dimension 2N + 1 size 12{2N+1} {} by 2N + 1 size 12{2N+1} {} . Then equation c = x 1 z size 12{c=x rSup { size 8{ - 1} } z} {} is used to solve the 2N + 1 size 12{2N+1} {} simultaneous equations for the set of 2N + 1 size 12{2N+1} {} weights c n size 12{c rSub { size 8{n} } } {} . This solution minimizes the peak ISI distortion by selecting the C n size 12{C rSub { size 8{n} } } {} weight so that the equalizer output is forced to zero at N sample points on either side of the desired pulse.

z ( k ) = { 1 k = 0 0 k = ± 1, ± 2, ± 3 size 12{z \( k \) = left lbrace matrix { 1 {} # k=0 {} ##0 {} # k= +- 1, +- 2, +- 3{} } right none } {} (4)

For such an equalizer with finite length, the peak distortion is guaranteed to be minimized only if the eye pattern is initially open. However, for high-speed transmission and channels introducing much ISI, the eye is often closed before equalization. Since the zero-forcing equalizer neglects the effect of noise, it is not always the best system solution.

Minimum MSE Solution

A more robust equalizer is obtained if the c n size 12{c rSub { size 8{n} } } {} tap weights are chose to minimize the mean-square error (MSE) of all the ISI term plus the noise power at the out put of the equalizer. MSE is defined as the expected value of the squared difference between the desire data symbol and the estimated data symbol.

By multiplying both sides of equation (4) by x T size 12{x rSup { size 8{T} } } {} , we have

x T z = x T xc size 12{x rSup { size 8{T} } z=x rSup { size 8{T} } ital "xc"} {} (5)

And

R xz = R xx c size 12{R rSub { size 8{ ital "xz"} } =R rSub { size 8{ ital "xx"} } c} {} (6)

Where R xz = x T z size 12{R rSub { size 8{ ital "xz"} } =x rSup { size 8{T} } z} {} is called the cross-correlation vector and R xx = x T x size 12{R rSub { size 8{ ital "xx"} } =x rSup { size 8{T} } x} {} is call the autocorrelation matrix of the input noisy signal. In practice, R xz size 12{R rSub { size 8{ ital "xz"} } } {} and R xx size 12{R rSub { size 8{ ital "xx"} } } {} are unknown, but they can be approximated by transmitting a test signal and using time average estimated to solve for the tap weights from equation (6) as follows:

c = R xx 1 R xz size 12{c=R rSub { size 8{ ital "xx"} } rSup { size 8{ - 1} } R rSub { size 8{ ital "xz"} } } {}

Most high-speed telephone-line modems use an MSE weight criterion because it is superior to a zero-forcing criterion; it is more robust in the presence of noise and large ISI

Questions & Answers

Do somebody tell me a best nano engineering book for beginners?
s. Reply
what is fullerene does it is used to make bukky balls
Devang Reply
are you nano engineer ?
s.
what is the Synthesis, properties,and applications of carbon nano chemistry
Abhijith Reply
so some one know about replacing silicon atom with phosphorous in semiconductors device?
s. Reply
Yeah, it is a pain to say the least. You basically have to heat the substarte up to around 1000 degrees celcius then pass phosphene gas over top of it, which is explosive and toxic by the way, under very low pressure.
Harper
how to fabricate graphene ink ?
SUYASH Reply
for screen printed electrodes ?
SUYASH
What is lattice structure?
s. Reply
of graphene you mean?
Ebrahim
or in general
Ebrahim
in general
s.
Graphene has a hexagonal structure
tahir
On having this app for quite a bit time, Haven't realised there's a chat room in it.
Cied
what is biological synthesis of nanoparticles
Sanket Reply
what's the easiest and fastest way to the synthesize AgNP?
Damian Reply
China
Cied
types of nano material
abeetha Reply
I start with an easy one. carbon nanotubes woven into a long filament like a string
Porter
many many of nanotubes
Porter
what is the k.e before it land
Yasmin
what is the function of carbon nanotubes?
Cesar
I'm interested in nanotube
Uday
what is nanomaterials​ and their applications of sensors.
Ramkumar Reply
what is nano technology
Sravani Reply
what is system testing?
AMJAD
preparation of nanomaterial
Victor Reply
Yes, Nanotechnology has a very fast field of applications and their is always something new to do with it...
Himanshu Reply
good afternoon madam
AMJAD
what is system testing
AMJAD
what is the application of nanotechnology?
Stotaw
In this morden time nanotechnology used in many field . 1-Electronics-manufacturad IC ,RAM,MRAM,solar panel etc 2-Helth and Medical-Nanomedicine,Drug Dilivery for cancer treatment etc 3- Atomobile -MEMS, Coating on car etc. and may other field for details you can check at Google
Azam
anybody can imagine what will be happen after 100 years from now in nano tech world
Prasenjit
after 100 year this will be not nanotechnology maybe this technology name will be change . maybe aftet 100 year . we work on electron lable practically about its properties and behaviour by the different instruments
Azam
name doesn't matter , whatever it will be change... I'm taking about effect on circumstances of the microscopic world
Prasenjit
how hard could it be to apply nanotechnology against viral infections such HIV or Ebola?
Damian
silver nanoparticles could handle the job?
Damian
not now but maybe in future only AgNP maybe any other nanomaterials
Azam
Hello
Uday
I'm interested in Nanotube
Uday
this technology will not going on for the long time , so I'm thinking about femtotechnology 10^-15
Prasenjit
can nanotechnology change the direction of the face of the world
Prasenjit Reply
At high concentrations (>0.01 M), the relation between absorptivity coefficient and absorbance is no longer linear. This is due to the electrostatic interactions between the quantum dots in close proximity. If the concentration of the solution is high, another effect that is seen is the scattering of light from the large number of quantum dots. This assumption only works at low concentrations of the analyte. Presence of stray light.
Ali Reply
how did you get the value of 2000N.What calculations are needed to arrive at it
Smarajit Reply
Privacy Information Security Software Version 1.1a
Good
Got questions? Join the online conversation and get instant answers!
QuizOver.com Reply

Get the best Algebra and trigonometry course in your pocket!





Source:  OpenStax, Principles of digital communications. OpenStax CNX. Jul 29, 2009 Download for free at http://cnx.org/content/col10805/1.1
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Principles of digital communications' conversation and receive update notifications?

Ask