## Servicios Personalizados

## Articulo

## Indicadores

- Citado por SciELO

## Links relacionados

- Citado por Google
- Similares en SciELO
- Similares en Google

## Bookmark

## Latin American applied research

*versión impresa* ISSN 0327-0793

### Lat. Am. appl. res. v.33 n.4 Bahía Blanca oct./dic. 2003

**On the design of robust orthogonal adaptative decision feedback equalizers for uncertain dispersive channels**

**P. D. Doñate ^{1}, C. Muravchik^{2} and J. E. Cousseau^{1}**

^{1} *Dto. de Ing. Eléctrica y Computadoras, Univ. Nac. del Sur, 8000 Bahía Blanca, Argentina pdonate@criba.edu.ar*

^{2}

*Fac. de Ing., Univ. Nac. de La Plata, 1900 La Plata, Argentina*

carlosm@ing.unlp.edu.ar

carlosm@ing.unlp.edu.ar

** Abstract** ¾

**This paper presents the theoretical aspects of a methodology for the design of robust orthogonal adaptive decision feedback equalizers. The dispersive transmission channel is assumed to have a transfer function type of description with small uncertainties in the parameters. A decision feedback equalizer is designed minimizing a mean square error objective function that takes into account the uncertain description of the channel. The equalizer is conceived with an orthogonal basis structure, so that the basis parameters inherit the robustness properties of the design to parameter perturbations. Adaptation of the coefficients that linearly combine the basis elements is also considered and the development of the adaptation algorithm is included. The resulting equalizer has a very flexible, modular and easy to implement structure. An example with comparisons of performance with FIR designs is included.**

** Keywords** ¾

**Communications. Uncertainty Modeling. Equalization. Robust Filtering.**

**I. INTRODUCTION**

Channel equalization is nowadays an unavoidable signal processing procedure to apply if high-speed communication over severely band limited channels is to be established. This is particularly true when we are dealing with the transmission of digital information over copper wire lines such as in Digital Subscriber Line systems (xDSL). The lack of shielding, minimum conditioning and narrow bandwidths are the reasons for the heavy intersymbol interference (ISI) present in these channels (Starr *et al.*, 1999; Bingham, 2000). Linear Equalization (LE) and the more efficient Decision Feedback Equalization (DFE) are effective methods of reducing the ISI and constitute a good tradeoff between computational cost and performance (Belfiore and Park, 1979; Cioffi *et al.*, 1995).

The design of the equalizer relies in the a priori knowledge of the channel characteristics that can be materialized in a mathematical model. This model will normally represent a compromise between good practical representation of measured effects and mathematical tractability.

This paper presents a design procedure for an orthogonal adaptive DFE. The design requires good knowledge of the transmission channel, with a transfer function type of model, of known order but allowing the existence of small uncertainty in the parameters. The uncertainty is described from a statistical point of view and the design minimizes a mean square error objective function. This approach follows the lines of work of Sternad and Ahlén (1990, 1993) and Chen and Lin (1996). An orthogonal structure is then considered for the implementation of the DFE and a coefficient updating algorithm is developed based on this representation.

The paper is organized as follows. Section II introduces some notation, gives a description of the equalization problem and presents the channel model. Section III deals with the design procedure. Section IV, presents the implementation structure using orthogonal functions. Section V describes the development of an updating algorithm and an example is presented in Section VI. Finally, some conclusions are drawn in Section VII.

**II. EQUALIZATION PROBLEM AND CHANNEL MODELING**

Figure 1 shows the usual structure of a DFE. The random uncorrelated symbol sequence *a*(*k*) of variance s_{a}^{2} is dispersed in time by the channel *H*(*q*^{-1},a)and is corrupted by noise. *D*(*q*^{-1},b) is the linear filter that shapes the white noise sequence *n*(*k*), of variance s^{2}_{n}. The sequences *a*(*k*) and *n*(*k*) are independent with *E*{*a*(*k*)*n*(*k*)}. The received signal enters the precursor portion of the equalizer *F*(*q*^{-1}) that deals with the non-causal effects of the ISI and noise. The detected symbols are filtered by *R*(*q*^{-1}) and fed back to the detector input. *R*(*q*^{-1}) is the causal part or post cursor portion of the DFE and it has the function of canceling the ISI introduced by the past symbols.

Both *H*(a) and *H*(b) are considered linear time invariant filters, of orders *N* and *S* respectively, with uncertainties in the parameter vectors a and b. They have causal impulse responses and belong to the space H_{2}(*T*) of square (Lebesgue) integrable functions on the unit circle , which are analytic outside *T*, . a and b are parameter vectors of the form a = a_{0} + da and b = b_{0} + db with *E*[a] = a_{0} and *E*[b] = b_{0} respectively. The zero mean perturbations da and db are described by the *a priori* known covariance matrices *E*[dada* ^{T}*] = g

_{a}and

*E*[dbdb

*] = g*

^{T}_{b}.

Fig. 1: Transmission channel, noise and DFE models.

The uncertainty on the parameters results in an uncertain channel plus noise system which can be described as having a different realization for each particular value of the parameter vectors a and b. The uncertain system is modeled as

*H*(a_{0} + da) = *H*(a_{0}) + D*H* (1)

*H*(b_{0} + db) = *H*(b_{0}) + D*D* (2)

The perturbations D*H* and D*D* are approximated by the linear terms of the Taylor series expansion of *H*(a) and *D*(b) around the mean values *H*(a_{0}) and *D*(b_{0}), so , and where and are the Jacobian matrices of *H* and *D*, respectively. The statistical characterization of the uncertainties is now straightforward:

(3) |

and

(4) |

where the symbol * stands for the joint operations of conjugation and transposition.

**III. DFE DESIGN**

To present the design procedure, the blocks representing the precursor and poscursor filters of the DFE along with the signals involved are expanded and shown with more detail in Fig. 2.

Fig. 2: Expanded view of the DFE

*F* and *R* are (initially) time invariant linear filters, and will be designed with an infinite number of terms in their impulse responses (IIR). In this case, the optimum design can be performed in two steps (Lee and Messerschmitt, 1994). First, the linear equalizer *F _{L}*(

*q*

^{-1}) is constructed to minimize the

*Mean Square Error*(MSE)

*E*{

*e*

^{2}

*}. Second, as the remaining error sequence*

_{L}*e*(

_{L}*k*) will generally be correlated, and thus its variance (power) can be further reduced, the addition of a prediction error filter is considered.

Assuming the decisions of the detector are correct, *F _{P}*(

*q*

^{-1}) and the block

*F*(

_{P}*q*

^{-1}) - 1 in the feedback loop of the detector constitute a practical prediction error filter in the sense it is strictly causal (

*F*(

_{P}*q*

^{-1}) is monic) and is so realizable (Lee and Messerschmitt, 1994). Its output will depend only of past values of the input, i.e., it depends only of past symbols. When the delay

*L*is different from zero, the filters that constitute the equalizer are actually performing smoothing on the received signal

*w*(

*k*).

The problem to solve is to design the DFE following the two steps mentioned above and additionally give the design an orthogonal structure that can easily be adjusted in an adaptive manner. For this purpose the orthogonal family of functions considered were introduced by Ninnes and Gustafsson (1997):

(5) |

where *d* = 0 or 1 and is a normalization constant. The basis of (5) has the property of allowing the inclusion of a variety of modes (different poles) and provides a unifying formulation for almost all known system identification techniques supported by orthogonal basis, such as FIR, Laguerre and Kautz models.

**A. Precursor equalizer design**

The problem of designing the precursor portion of the DFE when the system (channel plus noise) has an uncertain type of model description can be treated as a deconvolution problem (Doñate *et al.*, 2000a, b). From Fig. 2, the expression for the error *e _{L}*(

*k*) is obtained when

*R*= 0 or equivalently when

*F*= 1:

_{P}(6) |

where *q ^{-L}* takes into account the propagation delay considered for the error evaluation. Assuming

*a*(

*k*) and

*n*(

*k*) are independent of the models uncertainties and using (3) and (4), the

*mean square error over the system uncertainties*can be evaluated as

(7) |

where *E*_{D}{.} is the expectation operator over the models uncertainties. The performance index to be used is the mean value of x over time:

(8) |

We see from (8) that the uncertainties in the parameters of the system are contemplated in the objective function *J* by means of the rational functions G_{D}* _{H}* and G

_{D}

*. Finding the optimal*

_{D}*F*that minimizes

_{LO}*J*will yield a filter that is slightly more conservative than the classical nominal design but that will generally have a better overall performance in terms of the MSE if the system parameters depart from their nominal values.

To minimize *J*, (8) is first written in the transform domain with the aid of Parseval´s theorem. Then, a perturbation is added to the optimal deconvolution processor *F = F _{LO}* + kz(z

^{-1}), where k is a small, real, positive number and z(z

^{-1}) is an arbitrary, rational in

*z*and realizable function, analytic in . To accomplish the necessary and sufficient conditions for a minimum in

*J*,

*i.e.*and (Leitman, 1981), the following integrals must be zero,

(9) |

Introducing the spectral factorization,

(10)

replacing in (9) and rearranging, the condition to be satisfied is now

(11)

where

The operator {.}_{+}(resp., {.}_{-}) takes the analytic part of the argument outside (resp., inside) the unit circle. Applying Cauchy's theorem to (11), the following part of the integrand must be zero, since it is the only one which may have poles inside the unit circle:

(12)

From (12), *J* is minimized by

(13)

Three comments on this result follow. First, a realizable *F _{LO}* can only eliminate the parts of the integrand that involve {.}

_{+}terms (must be analytic outside the unit circle and as so, causal). Second, the {.}

_{-}term must be a rational function starting with a free

*z*to cancel the pole at the origin of the integrand. Third, for symmetry reasons, if one of the integrals in (11) is zero so will be the other. The readers may like to compare this derivation with the one in Appendix A of Ahlén and Sternad (1991) and also the approach of Chen and Lin (1996).

Assuming there are uncertain parameters in the denominators of both *H* and *D*, from (3), (4), and (10), the maximum degree for the polynomials of y is 2(*N + S*). Therefore, the order of y^{-1}, the IIR part of the optimal precursor equalizer, if the prediction error filter is included, will generally be *M* ³ 2(*N + S*). From (13), noting that *H ^{*}* and y

^{*}have all the roots outside the unit circle, the {.}

_{+}operation reduces to a constant if

*L*= 0 or a FIR type of filter, of length

*L*, if

*L*> 0. So, the resulting structure for the precursor portion of the DFE including

*F*, may generally (when the symbol sequence is white noise) be considered as a cascade of a FIR filter and an IIR filter as shown in Fig. 3.

_{P}

Fig. 3: General structure for the precursor portion of the DFE

**B. Poscursor equalizer design**

As a second step, we want to evaluate the part *F _{P}* of the equalizer that minimizes the prediction error. The spectral density of the error over the detector when

*F*= 1 is:

_{P}(14) |

where s_{e}^{2}*E ^{*}E* is the spectral factorization of , s

_{e}

^{2}is the MSE and

*E*is a monic, rational, minimum phase function that is also analytic in . The optimal prediction error filter is then

*F _{P}*(

*q*

^{-1}) =

*E*

^{-1}(

*q*

^{-1}) (15)

In addition, the existence of the poscursor filter is guaranteed, even for the case when the delay *L* = 0, because *R*(*q*^{-1}) = *F _{P}*(

*q*

^{-1}) - 1 is a strictly causal filter.

**IV. ORTHOGONAL REALIZATION**

Each of the filters that conform the robust DFE is to be realized using a linear combination of the orthogonal basis of (5) as:

(16) |

where the number of terms *Q* + 1 of Eqn. (13) must be greater or equal to the order of the functions to be represented. The parameter vector l is chosen to include all of the poles of *F* and *R* in each case, to achieve an exact representation. The parameters that linearly combine the basis elements are calculated by

(17) |

where the integral can be evaluated using Cauchys residue theorem.

Assuming M is the order of the robust precursor filter, the vector Q* _{F}* groups the coefficients associated with this filter:

(18)

and Q* _{R}* groups the coefficients of the orthogonal realization of the poscursor filter

*R*:

(19)

*P* in (18) is the largest degree of the polynomials of *R*. If the degree of *F _{LO}* is , then from (14), the polynomials of

*E*(and

*R*) will have a degree .

From (5) is simple to establish the relation between two successive members of the basis:

(20) |

where , and . This relation will be useful for the practical implementation of the DFE.

Up to this point in the design procedure, we have a DFE that has an orthogonal structure for each of its filters and is, by design, robust to small parametric perturbations in the system model.

**V. UPDATING OF THE BASIS COEFFICIENTS**

To improve the performance of the equalizer and to incorporate the ability of tracking larger changes in the system dynamics, *i. e.* changes that exceed g_{a} and g_{b}, the updating of the coefficients that linearly combine the basis elements is next considered. The coefficients Q are now treated as time varying and noted:

(21)

The error functional for the adaptive algorithm, assuming the decisions of the detector are correct and as a function of the coefficient set is

(22) |

where

(23)

is conformed by

(24) |

which is the generalized precursor regressor build of delayed and basis-filtered versions of the received signal *w*(*k*) and

(25) |

that is the generalized poscursor regressor composed of basis-filtered versions of the detected symbols *a*(*k*).

Expanding (21)

(26)

with *p = E*[*a*(*k - L*)*X*(*k*)] and *R _{I} = E*[

*X*(

*k*)

*X*(

^{T}*k*)], and considering the update equation

Q(*k* + 1) = Q(*k*) - m*G*(*k*) (27)

where

(28) |

is the gradient of the error functional in the parameter space, a gradient-based family of adaptive algorithms can be generated.

Fig. 4: Structure of the Robust Orthogonal Adaptive DFE. The blocks illustrate the case when the basis parameters are real.

Different estimates of *G*(*k*) result in different algorithms. The approach considered for the DFE in this paper uses the instantaneous value of *p* and *R _{I}* as estimates of their mean so, , and the estimated gradient is

(29)

The updating equation finally results

Q(*k* + 1) = Q(*k*) + 2m*e*(*k*)*X*(*k*) (30)

and the algorithm may be classified as a transform domain *Least Mean Square *(Diniz, 1997).

Figure 4 shows the complete structure for the implementation of the Robust Orthogonal Adaptive DFE. This structure follows from (20) and is illustrated for the particular case of a DFE with real poles in both filters *F* and *R*. The inclusion of complex modes in the basis has to be done in conjugate pairs. In this case, the new basis functions are formed as linear combinations of the basis generated by (5), (see Ninnes and Gustafsson, 1997, for the details of this construction). This procedure assures that the impulse response of the basis functions with complex modes is real.

**VI. EXAMPLE**

A first order low pass transmission channel model corrupted by colored noise will be used to illustrate the performance of the proposed design. The system is

and

.

The gain of these filters are adjusted so that the signal to noise ratio in the input of the precursor filter is 30 dB. The design is performed assuming uncertainty in the parameter *b*_{1} of *H*, with = 0.0003 and *L* = 0.

Figure 5 shows the variation of MSE achieved by the DFE when the parameter *b*_{1} departs from its nominal value. The curve in solid line is the nominal fixed recursive design. Both filters of the DFE are IIR. This design gives the best performance when the parameters remain at the nominal design values. When *b*_{1} changes the MSE raises and the performance degrades quickly.

The curve in dashed line is the fixed robust design. The performance around the nominal value of the parameter is slightly worse than the nominal design. When *b*_{1} is perturbed, the robust DFE equals and outperform the nominal design for positive (negative) variations of more that 4% (-2%) in the parameter.

The robust design has the effect of extending the range of "good" performance of the equalizer for changes in *b*_{1} at the expense of loosing performance around the nominal value of this parameter.

Figure 6 shows the performance of the robust orthogonal adaptive DFE. In this case the initial value of the coefficients Q are those of the robust design and the updating Eqn. (30) is used to adjust these coefficients as *b*_{1} departs from its nominal value.

Fig. 5: MSE vs. Percentage of change in parameter *b*_{1} for fixed recursive DFE designs. Solid line: Nominal design. Dashed line: Robust design.

The MSE attainable when the algorithm converges is plotted vs. the percentage of variation of *b*_{1} (dashed line curve). Also included in this figure is the performance of the fixed nominal design (solid line) and the MSE attainable by an adaptive FIR DFE (dash-dot line). The FIR DFE requires 20 taps to achieve a constant MSE that equals the nominal design. The robust orthogonal adaptive DFE exhibits a performance that is less than 1 dB within the minimum MSE for 6% of variation in *b*_{1}. This performance is achieved using only 5 adaptive coefficients.

Fig. 6: MSE vs. Percentage of change in parameter *b*_{1} for adaptive DFE designs. Solid line: Nominal fixed design included for reference. Dashed line: Robust orthogonal adaptive design (5 adaptive coefficients). Dash-dot line: FIR adaptive design, 10 taps precursor filter and 10 taps poscursor filter.

**VII. CONCLUSIONS**

The paper has presented the theoretical aspects for the design of robust adaptive DFE with an orthogonal implementation structure. The DFE designed by this methodology presents robustness to small parametric uncertainties in the channel and noise models, a very modular construction by the use of orthogonal bases, and adaptation capability with the use of a simple algorithm. A numerical example was presented that shows the good performance of the robust orthogonal adaptive DFE in terms of MSE. The example also shows the reduced computational cost when compared with adaptive FIR designs. All these properties make this design a good candidate for practical DSP implementations.

Further research is currently being performed to apply this robust DFE to xDSL systems.

**REFERENCES**

1. Ahlén A. and M. Sternad. "Wiener Filter Design Using Polynomial Equations". *IEEE Trans. On Signal Processing*, **39**, No. 11, pp. 2387-2399. (1991). [ Links ]

2. Belfiore C. A. and J. H. Park, "Decision Feedback Equalization", *Proc. IEEE*, **67**, No. 8, pp. 1143-1157. (1979). [ Links ]

3. Bingham J. A., *ADSL, VDSL and Multicarrier Modulation*, John G. Proakis Ed., John Wiley & Sons, New York. (2000). [ Links ]

4. Chen, B. S. and C. W. Lin, "Optimal Deconvolution Filter Design Under Parameters Perturbation in Transmission Channels", *Circuits Systems Signal Processing*, **15**, No. 2, pp 213-231, (1996). [ Links ]

5. Cioffi J. M., G. P. Dudevoir, M. V. Eyuboglu and G. D. Jr. Forney, "MMSE Decision-Feedback equalizers and coding -- Part I: Equalization results", *IEEE Trans. Commun.*, **43**, No. 10, pp. 2582-2594. (1995). [ Links ]

6. Diniz, P. S. R., *Adaptive Filtering – Algorithms and practical implementation*. Kluwer Academic Publishers. (1997). [ Links ]

7. Doñate P., J. Cousseau, C. Muravchik and L. Salama, "Robust Adaptive Deconvolution Processor with orthogonal Basis". *Proc. of the Intnl. Conf. on Signal Processing Appls. and Technologies - ICSPAT'2000*. October 16-19, Dallas, USA. (2000a). [ Links ]

8. Doñate P., C. Muravchik, J. Cousseau. "On the Design of Robust Orthogonal Adaptive Deconvolution Filters" *Proc. of the IEEE South Amer. Workshop on Circ. and Systs. 2000 (IEEE SAW CAS 2000)* – Rio de Janeiro, Brazil – B. Blanca, Argentina, October, (2000b). [ Links ]

9. Lee E. A. and D. G. Messerschmitt, *Digital Communication*. Second Edition. Kluwer Academic Publishers. (1994). [ Links ]

10. Leitmann G., *The Calculus of Variations and Optimal Control*, Plenum Press, New York and London. (1981). [ Links ]

11. Ninnes B. M. and F. Gustafsson, "A Unifying Construction of Orthonormal Bases for System Identification", *IEEE Trans. on Automatic Control*, **42**, No. 4, pp. 515-521, (1997). [ Links ]

12. Starr T., J. M. Cioffi and P. J. Silverman, *Understanding Digital Subscriber Line Technology*, Prentice Hall PTR, Upper Saddle River, NJ 07458. (1999). [ Links ]

13. Sternad M. and A. Ahlén, "Robust filtering and feedfoward control based on probabilistic description of model errors", *Automatica*, **29**, pp. 661-679, (1993). [ Links ]

14. Sternad M. and A. Ahlén, "The structure and design of realizable decision feedback equalizers for IIR channel with colored noise", *IEEE Trans. on Information Theory*, **36**, pp. 848-858, (1990). [ Links ]