The present invention relates generally to transceivers for duplex communication, and specifically to echo cancellation in such transceivers.
Echo cancellation is commonly used in duplex communication systems in which transceivers simultaneously transmit and receive signals over the same frequency band or on mutually-adjacent bands. Echo cancellation is used to eliminate the echo of the near-end signal transmitted by the transceiver from the far-end signal that it receives. Typically, the echo of the near-end signal is very strong by comparison with the far-end signal. In Digital Subscriber Line (DSL) systems, for example, the far-end signal received by a modem may be attenuated by the channel by as much as 40-50 dB. Therefore, DSL modems and other high-speed data receivers may be required to suppress echo power by as much as 70-80 dB in order to achieve an acceptable signal-to-echo interference ratio at the receiver.
In general, the echo conditions to which a given modem is subject vary over time, due to temperature and voltage changes, for example. The echo canceller used in the modem should be able to adapt to such variations. As the level of integration and modem density in communication systems increase, the rate of change of echo conditions tends to increase, as well, due to adjacent modems being activated, deactivated or changing their operational mode. Therefore, it is important that the echo canceller be able to adapt quickly and accurately to changes in the echo conditions.
In a typical modem, the echo canceller (EC) comprises a transversal filter with tap spacing equal to the symbol interval. The EC processes an input from the transmitter, using the transversal filter, to generate an estimate of the echo signal, which is subtracted from the received signal. The resulting echo-canceled signal is then equalized and decoded to recover the data from the received signal. The echo-canceled signal itself is used as an error signal to adjust the tap coefficients of the EC transversal filter, typically by means of the well-known stochastic least-mean-square (LMS) algorithm. The LMS algorithm is described, for example, by Haykin, in Chapter 9 of Adaptive Filter Theory (3rd edition, Prentice Hall, 1996), which is incorporated herein by reference.
The error-canceled signal, however, typically contains high-level noise power, due mainly to the far-end signal itself, which is uncorrelated noise as far as the echo canceller is concerned, as well as to thermal noise and crosstalk. This high-level noise induces a slow adaptation rate, i.e., a long adaptation time constant τ. Specifically, the adaptation of the tap coefficients of the echo canceller transversal filter can be expressed as:
Ck(n+1)=Ck(n)+μ·e(n)·x(n−k) (1)
Here Ck(n) is tap coefficient k at time n, μ is the adaptation step size, e(n) is the error signal, and x(n) is the tap input. Given σx as the root-mean-square (RMS) variance of the input signal to the echo canceller, and NEC as the length of the echo canceller transversal filter (in symbols), the adaptation time constant is given approximately by:
In this equation, SNR is the adaptation signal/noise ratio (in dB), i.e., 10−SNR/10
σAD is the RMS variance of the adaptation noise in the echo-canceled signal, and σFAR is the RMS variance of the far-end signal (along with additive noise sources, such as crosstalk) in the echo-canceled signal.
It will be observed that τ increases with the required SNR and with NEC. For example, if the adaptation noise is required to be 50 dB weaker than the far-end signal (SNR=50 dB), and the echo canceller spans 200 symbols, then τ is 107 symbols long. The adaptation time becomes longer still if a polyphase echo canceller structure is used.
A number of solutions to the problem of long echo canceller adaptation time have been proposed. For example, Banerjea et al. describe a modem with enhanced echo canceller convergence in U.S. Pat. No. 6,240,128, whose disclosure is incorporated herein by reference. The modem includes two echo cancellers: a “conventional” echo canceller, which processes the transmitted signal and generates an echo cancellation signal for subtraction from the received signal before equalization; and a post-equalization echo canceller, which uses the equalized signal as an input to cancel residual echo signals that may result from drift in the echo characteristics during operation. The conventional echo canceller is “trained” during initial half-duplex operation of the modem, and its coefficients are then fixed, while the post-equalization echo canceller is allowed to continue adapting.
It is an object of some aspects of the present invention to provide improved methods and devices for echo cancellation, and particularly to accelerate the rate of adaptation of an echo canceller.
In preferred embodiments of the present invention, a receiver comprises an echo canceller with a residual echo cancellation circuit for controlling the adaptation of the echo canceller tap coefficients. The echo canceller processes transmitted signals in order to generate an echo cancellation signal for subtraction from the received signal, before equalization. The residual echo cancellation circuit processes the equalized signal in order to estimate the residual echo in the signal, and then modifies the tap coefficients of the echo canceller accordingly.
In other words, rather than adding an additional stage of echo cancellation after equalization, as proposed by Banerjea, the echo canceller of the present invention casts the post-equalization residual echo back to the pre-equalization echo cancellation stage. Therefore, implementation of the present invention requires only a single echo canceller in the receiver signal path, rather than two successive echo cancellers as in Banerjea's receiver. By measuring changes in the echo signal in the low-noise post-equalization environment, the residual echo cancellation circuit of the present invention is able to detect and correct for these changes much more rapidly than is possible with pre-equalization echo signal measurement alone. At the same time, because the correction is cast back to the pre-equalization echo canceller, the echo level in the echo-canceled input to the equalizer is also reduced, thus improving the performance of the equalizer, too, and reducing its adaptation time.
There is therefore provided, in accordance with a preferred embodiment of the present invention, a receiver for receiving an incoming signal over a communication medium, the receiver including:
Preferably, the residual echo cancellation circuit is adapted to estimate a residual echo component in the equalized signal, and to update the variable processing coefficients so as to cancel the residual echo component. Typically, the receiver includes a decision unit, which is coupled to receive the equalized signal and to determine output data values responsive thereto, wherein the residual echo cancellation circuit includes a subtractor, which is coupled to take a difference between the equalized signal and the output data values in order to determine the residual echo component. Preferably, the residual echo cancellation circuit is coupled to receive the outgoing signal, and to process the outgoing signal together with the residual echo component in order to update the variable processing coefficients. Most preferably, the residual echo cancellation circuit includes a digital filter having multiple taps, having respective tap coefficients associated therewith, and the digital filter is coupled to apply the digital filter to the outgoing signal while adjusting the tap coefficients responsive to the residual echo component, and the variable processing coefficients of the echo canceller are updated responsive to the adjusted tap coefficients of the digital filter.
Preferably, the echo canceller includes a first digital filter having first taps, and the variable processing coefficients include first tap coefficients, which are respectively associated with the first taps, and the echo canceller is coupled to apply the first digital filter to the outgoing signal in order to generate the echo cancellation signal. The residual echo cancellation circuit includes a second digital filter having second taps, having respective second tap coefficients associated therewith, and the residual echo cancellation circuit is coupled to apply the second digital filter to the outgoing signal so as to generate a filter output, while adjusting the second tap coefficients responsive to the filter output, and to update the first tap coefficients responsive to the adjusted second tap coefficients.
In a preferred embodiment, the second digital filter includes multiple phases, including respective subsets of the second taps, and the residual echo cancellation circuit is adapted to determine the second tap coefficients for all of the multiple phases, for use in updating the first tap coefficients.
In another preferred embodiment, the residual echo cancellation circuit includes a variable delay element, which is coupled to convey the outgoing signal to the second digital filter at a plurality of different time lags, and the residual echo cancellation circuit is adapted to determine the second tap coefficients for each of the different time lags, for use in updating the first tap coefficients.
In a further embodiment, the residual echo cancellation circuit is adapted to apply a maximum likelihood estimator to the adjusted second tap coefficients in order to determine updated values of the first tap coefficients. In an alternative embodiment, the residual echo cancellation circuit is adapted to apply a maximum a posteriori (MAP) filter to the adjusted second tap coefficients in order to determine updated values of the first tap coefficients.
In still another preferred embodiment, the residual echo cancellation circuit is adapted to find a gradient of the adjusted second tap coefficients in order to determine an increment to be applied to update the first tap coefficients. Preferably, the residual echo cancellation circuit is adapted to update the first tap coefficients while applying a leakage to at least one of the first and second tap coefficients.
Typically the equalizer includes a time-domain equalizer, preferably a feed-forward equalizer (FFE). In a preferred embodiment, the FFE is adapted to operate on the echo-cancelled signal at an equalization rate that is a non-integer fraction of a symbol rate of the incoming signal, and the residual echo cancellation circuit includes a digital filter having multiple phases, and is coupled to process the outgoing signal using the multiple phases in order to update the variable processing coefficients. Preferably, the receiver includes a slicer, which is coupled to receive the equalized signal and to determine output data values responsive thereto, wherein the residual echo cancellation circuit includes a subtractor, which is coupled to take a difference between the equalized signal and the output data values in order to determine an error signal for use in updating the variable processing coefficients.
In an alternative embodiment, the equalizer includes a frequency-domain equalizer. In this case, the incoming and outgoing signals may be multi-tone signals.
In a preferred embodiment, the incoming signal is received by the receiver at a first rate, and the outgoing signal is transmitted at a second rate, which is different from the first rate.
There is also provided, in accordance with a preferred embodiment of the present invention, a method for processing an incoming signal received over a communication medium, the method including:
processing an outgoing signal, which is to be transmitted over the communication medium, using a set of variable processing coefficients in order to generate an echo cancellation signal;
combining the incoming signal with the echo cancellation signal so as to generate an echo-cancelled signal;
applying an equalization operation to the echo-cancelled signal so as to generate an equalized signal; and
processing the equalized signal so as to adaptively update the variable processing coefficients used in generating the echo cancellation signal.
The present invention will be more fully understood from the following detailed description of the preferred embodiments thereof, taken together with the drawings in which:
In the transmit path of transceiver 20, an encoder 22 encodes the bits of an input data stream, and a mapper 24 maps these bits to symbols, as is known in the art. The transmitted symbol stream is labeled TXS in the figure. (In the detailed analysis of transceiver 20 given below, it is assumed, for the sake of example, that the transceiver uses a pulse amplitude modulation (PAM) symbol constellation. Extension of the methods and circuits of the present invention to other modulation schemes, including complex schemes such as quadrature amplitude modulation (QAM), is straightforward.) The transmitted symbols TXS are filtered by a digital transmit filter 26, and are then input to an analog front end 28, as is known in the art.
In front end 28, a digital/analog converter (DAC) 30 converts the symbol stream to an analog signal, which is amplified and filtered by an amplifier 32 and analog low-pass filter (LPF) 34. A hybrid coupling circuit 36 couples the outgoing signals into a communication channel for transmission to a remote receiver. Some of the transmitted signal energy, however, is reflected back into the receive path of transceiver 20, resulting in an echo in the received signals. Although hybrid circuit 36 is typically designed to attenuate this echo, the attenuation is imperfect (generally only 15-30 dB) due to problems of impedance mismatch.
On the receive path, incoming signals are coupled by hybrid coupler 36 into an amplifier 38, followed by an input LPF 40. The signals are then sampled and digitized by an analog/digital converter (ADC) 42 to generate a stream of digital input samples, labeled SIN. An echo canceller 44 processes the transmitted symbols TXS to generate an echo cancellation signal, labeled ECO, which should be a replica of the echo signal from front end 28. Typically, the echo canceller comprises an adaptive transversal (time domain) filter, fed by TXS, based on the assumption that the echo is linear in the transmitted power. The length of the transversal filter preferably exceeds the time span of the actual echo in the received signals. A summer 46 subtracts ECO from SIN to produce an echo-canceled signal, labeled ECS.
The next part of the receive path of transceiver 20 is an equalization stage, comprising a feed-forward equalizer (FFE) 48 and a slicer 50, with a decision feedback equalizer (DFE) 52. The FFE and DFE typically comprise multi-tap digital filters, whose tap coefficients are determined adaptively, as is known in the art. FFE 48 may operate at a rate that is a non-integer fraction of the symbol rate, as is known in the art, for example, 3/2 the symbol rate (so that the FFE operates on interpolated samples spaced in time by 2/3 of the actual symbol spacing). A forward-equalized sample stream output by FFE 48, labeled FFEO, is combined in a summer 54 with a decision feedback signal generated by DFE 52, to generate a final, equalized sample stream DFES. Slicer 50 quantizes DFES to produce decision values of the symbols, labeled SLC. These values are then decoded by a decoder 56 to generate the output data stream from transceiver 20.
The tap coefficients of echo canceller 44 are determined using a residual error canceling circuit (ECR) 58. This circuit comprises a transversal filter, similar to that in echo canceller 44. ECR 58 receives the transmitted symbol stream TXS as its input, and generates a residual-corrected output, labeled ECRO. The error signal input to ECR 58, labeled ECRS, is derived from the equalized sample stream of the receiver, DFES, following FFE 48 and summer 54. A summer 60 subtracts the decision values SLC from the equalized samples DFES to generate a residual error signal, labeled SLS. The residual-corrected output ECRO of ECR 58 is subtracted from the residual error signal SLS by a further summer 62 to generate the error signal input ECRS. The tap coefficients of ECR 58 adapt, typically using LMS adaptation, so that ECRO cancels the residual error signal SLS. To ensure full estimation of the residual echo, the transversal filter in ECR 58 is preferably substantially longer than that in echo canceller 44, so as to cover the complete time span of any possible residual echo in DFES.
A digital signal processor (DSP) 64 reads the tap coefficients of ECR 58 (which can be represented as a vector hECR—shown in the figure as HECR). The DSP uses these coefficients to calculate the correction that is required in the tap coefficients of echo canceller 44 (hEC, or HEC). In principle, assuming perfect convergence of ECR 58, applying these corrected tap coefficients in the echo canceller will exactly cancel the residual echo at ECS. Because of the low noise in the error signal ECRS, ECR 58 is able to adapt to changes in echo conditions with a substantially lower time constant than echo canceller 44 could adapt by itself. DSP 64 thus updates the coefficients of echo canceller 44 at a relatively high rate, obviating the requirement for any further adaptation by echo canceller 44 itself while transceiver 20 is in normal operation. Alternatively, adaptation by echo canceller 44 may continue in parallel with the operation of ECR 58. In the description that follows, the combined operation of ECR 58 and DSP 64 in updating the coefficients of echo canceller 44 is referred to as “convergence acceleration.”
The equalization stage of transceiver 20 that is shown in
The operation of echo canceller 44 is represented in terms of a transversal filter 74, having lEC taps. The overall response of the filter is given by the impulse response of the residual echo, HE(Z)=HECHO(z)−HEC(z), wherein HECHO(Z) is the echo response from TXS to the location of ECS; and HEC(z) is the response of echo canceller 44. In order to take into account the possibility that FFE 48 operates at a non-integer rate of N/M times the symbol rate (M and N mutually-prime integers), transversal filter 74 is modeled as running at a sample rate NX, i.e., N times the transmitted symbol rate X. Therefore, from a conceptual point of view, the input symbols X(z) are first upsampled by an expander 72. The echo-canceled samples ECS are obtained by downsampling the output of filter 74 by a factor M in a decimator 76. A similar arrangement of upsampling and/or downsampling may be used to adjust the output rate of the echo canceller when the transmitted symbol rate of the transceiver is different from the received symbol rate.
FFE 48 is similarly represented by an expander 78, which upsamples ECS by M, followed by a filter 80 with response F(z). The filtered samples are downsampled by N in a decimator 82, so that the equalized samples DFES are generated at the received symbol rate. Alternatively, when equalization is performed at the symbol rate, M and N are equal, and may simply both be set to 1.
The output of FFE 48 contains the residual echo signal E(z). Assuming no decision errors by slicer 50, the signal SLS that is output by summer 60 is the sum of the residual echo E(z), together with inter-symbol interference (ISI) and additive noise. Thus, SLS can be modeled by summing a noise source VNSLC(Z), representing the ISI and additive noise, with E(z). When the coefficients of FFE 48 and DFE 52 have converged to the minimum mean-square-error solution, VNSLC(z) becomes a white noise source. DFE 52 can thus be omitted from the model.
ECR 58 comprises M phases 84, labeled ECR0 . . . ECRM−1, each of which is a multi-tap filter of length lECR. (When equalization is performed at the symbol rate, a single phase 84 is sufficient, and the derivation below is simplified accordingly.) A switch 86 schematically represents selection of the appropriate phase to activate for each successive symbol. The phases alternate in sequence from one symbol interval to the next, cycling through all the phases, so that the selected phase p for symbol number n is given by p=nmodM. The sum of the phases depends directly on the echo, while the differences among the phases correspond to aliases of the echo, as described in greater detail below.
To determine the relationship between the tap coefficients of ECR 58, hECR, and those of echo canceller 44, hEC, we start by computing E(z), the z-transform of the residual echo interference, based on the transmitted symbols X(z) and the response F(z) of the FFE at rate NX:
E(z)={└((X(zN)·HE(z))↑M┘·F(z)}↓N (3)
Here M-fold decimation and N-fold expansion are denoted by ↓ M and ↑ N, respectively. Expanding equation (3) using
gives:
Thus, as noted above, E(z) has M components, one depending on the echo directly (i.e., HE(z)), and the others on echo aliases (HE(z·WMk), for k≠0). If ECR 58 were simply allowed to adapt on all the transmitted symbols, it would converge to (F(z)·HE(Z)/M)↓ N, thus ignoring the aliases. ECR 58 accounts for the aliases, however, by using M phases 84 (ECR0 . . . ECRM−1), wherein the p-th phase ECRP adapts only on the samples e(n) for which p=n mod M. It can be shown that phase p of E(z) is a decimation by M of a linear, time-invariant function of X(z), with a different linear function for each p. For each phase 84 of ECR 58, receiving its samples e(n) in the proper alternation, LMS adaptation will cause the respective phase response ECRp to converge to:
In terms of the tap coefficients ECRp(m) of phases 84, the phase response can be expressed as:
Here hE(n) is the n-th tap of the residual echo in signal ECS, and f(n) is the n-th tap of FFE 48. Summing over k gives the simplified form:
The response of ECR 58 can be summarized in matrix form as follows:
Here ECRp is the vector of taps m for phase p of ECR 58, and hECR is a concatenation of all the ECR phases; V(n) is the adaptation noise (a vector process of dimension,
Each Fp matrix is an lECR×lEC matrix defined as Fp={Fm,n}|m=0 . . . l
In the common case of N=3, M=2 (i.e., a 1.5× fractionally-spaced equalizer), for example, ECR 58 will have two phases, in which F0 includes only the even taps of FFE 48, while F1 includes only the odd taps of the FFE. Thus,
Assuming FFE 48 has an even number of taps, the components of hECR are as follows:
Assuming the adaptation noise V(n) is white and Gaussian, a maximum likelihood (ML) approach can be used to find the correction that must be applied to the tap coefficients of echo canceller 44, based on the adapted coefficients hECR of ECR 58, in order to cancel the residual echo response hE. The cost function to be minimized, C(hE), is defined in the following least-square (LS) form:
Solving for the estimator
gives the generalized inverse form:
hE=(FHF)−1FHhECR (11)
Equation (11) can be solved directly by inverting (FHF), but the complexity of inverting an (M·lECR)×(M·lECR) matrix is considerable. If FFE 48 is non-adapting, one inversion is sufficient. To enable continuous updating of the echo cancellation coefficients while the FFE keeps adapting, however, the inversion will have to be repeated frequently.
Furthermore, if F has a large eigenvalue spread, solving equation (11) directly to find hE may increase the adaptation noise of echo canceller 44 unacceptably. To overcome this problem, it is possible to determine hE directly using a MAP (maximum a posteriori) filter, on the assumption that the adaptation noise and residual echo error of the different taps hE(n) are uncorrelated and white, i.e., E(V·VH)=σv2·I and E(hE·hEH)=σhe2·I, wherein I is the identity matrix, and E is the ensemble expectancy. The optimal MAP filter is then given by:
Derivation of this filter is shown in Appendix A.
Instead of these direct, computation-intensive solutions, the correction to be applied to the coefficients of echo canceller 44 may be determined by a gradient descent method, based on finding gradients of the cost function of equation (10). Differentiating the cost function in terms of the taps of the residual echo hE gives the following solution for the adaptation steps of the tap coefficients of echo canceller 44, hEC(l), in terms of the tap coefficients ECRp(m) of phases 84 of ECR 58:
Here the phase designation ECR(N·m−1)/N mod M should be understood to indicate the choice of the phase index pε0 . . . M−1 such that (N·m−1) mod M=(N·p) mod M. (Assuming M and N are chosen to be relatively prime, p is unique.) μ is the step size of the adaptation, and μCA=2·μ is defined to simplify subsequent notation. μCA is chosen heuristically. Its value is preferably chosen so as to ensure convergence stability while bounding the adaptation noise, as derived in Appendix B.
Implementation of the principles of the present invention in the manner shown in
In light of this concept,
In all other respects, transceiver 90 is substantially similar to transceiver 20, as described above. Although measuring the residual error in pieces slows down the convergence of echo canceller 44 in transceiver 90, the adaptation of the echo canceller in this embodiment is still typically considerably faster than the echo canceller could achieve on its own.
The feedback function given by equation (13), for determining the tap coefficients hEc of echo canceller 44 in terms of the adapted coefficients hECR of ECR 58 (or ECR 94), takes into account that the ECR response is available only at the symbol rate 1/T (wherein T is the symbol period), while the echo canceller has a tap spacing of T/N. As a result of this rate mismatch, the residual echo may not be completely correctable by the ECR. If the coefficients of FFE 48 are simultaneously changing due to adaptation, there may even be instability in the convergence acceleration process.
This potential instability is preferably corrected by introducing tap leakage, ρCA, into the adaptation properties of the ECR. Most preferably, the tap coefficients of echo canceller 44 are themselves allowed to continue adapting, simultaneously with adaptation of the ECR, with a leakage rate ρEC. Therefore, the echo canceller will still converge (although at a slower rate) along directions in the lEC-dimensional space in which the convergence acceleration matrix has zero or even negative eigenvalues. Since the adaptation of the ECR (and thus the convergence acceleration provided by the ECR and DSP) is typically orders of magnitude faster than LMS adaptation of the echo canceller, PEc is preferably much smaller than ρCA, i.e., ρEC/ρCA≈τCA/τEC<<1.
At start-up of transceiver 90, initial values of the tap coefficients of echo canceller 44 are determined, typically by conventional LMS adaptation of the echo canceller itself, at an initialization step 100. The initial adaptation may be carried out during a training period, using a dedicated half-duplex training mode, or by any other suitable method known in the art. Subsequently, adaptation of echo canceller 44 is preferably allowed to go on continuously, simultaneously with the convergence acceleration, as noted above. Alternatively, further adaptation of the echo canceller may be inhibited, with ECR 94 providing for all subsequent adaptation of the echo canceller tap coefficients unless retraining becomes necessary.
While transceiver 90 is running, DSP 64 controls VDL 92 to provide samples of the transmitted symbols TXS to ECR 94 at a sequence of different time lags, at a segment processing step 102. For each time lag, the ECR adapts a respective subset of the tap coefficients of all its phases (assuming the ECR includes multiple phases 84, as shown in
Based on the ECR coefficients, DSP 64 estimates the correction to be applied to the coefficients of echo canceller 44, at an estimation step 106. Preferably, the DSP uses the gradient descent method expressed by equation (13), along with tap leakage as described above, to find the coefficient for each tap n of echo canceller 44, n=0: lEC−1. For each tap n, the gradient given by equation (13) is:
As noted above, DSP 64 preferably uses separate tap leakage factors, ρCA and ρEC, for the convergence accelerator and for normal adaptation of echo canceller 44, respectively. An accumulator vector ACA is defined and used by the accelerator in order to keep track of the accumulated changes in the echo canceller taps from time t=0.
For each tap n of the echo canceller at step 106, the DSP first applies tap leakage to the corresponding echo canceller coefficient independent of the convergence accelerator contribution:
EC(n)=(EC(n)−ACA(n))·(1−ρEC) (15)
The DSP then updates the accumulator entry based on the latest gradient descent step, including leakage of the convergence accelerator contribution:
ACA(n)=ACA(n)·(1−ρCA)+μCA·GCA(n) (16)
Finally, at a coefficient update step 108, the DSP updates the values of the coefficients of echo canceller 44, based on both equations (15) and (16):
EC(n)=EC(n)+ACA(n) (17)
Steps 102 through 108 are preferably repeated each time a new estimation of the tap coefficients of ECR 94 is completed. Typically, a complete cycle of this sort takes a few thousand symbols. Therefore, the added complexity of computing equations (15) and (16) once each cycle for each coefficient does not significantly increase the overall burden on DSP 64.
The use of the method of
(For a detailed convergence analysis, see Appendix B.) In this expression, σXT(m) accounts for cross talk and additive background noise in the echo-canceled signal, along the direction of m-th eigenvector of the acceleration matrix. σFAR is the entire variance of the far-end signal, as defined in the Background of the Invention, which is clearly many times greater than σXT(m). The added update time due to using NLAGS multiple different delays (applied by VDL 92) reduces the degree of acceleration achieved by the present invention, but the speed advantage over conventional echo cancellation methods is still very substantial.
It will be appreciated that the preferred embodiments described above are cited by way of example, and that the present invention is not limited to what has been particularly shown and described hereinabove. Rather, the scope of the present invention includes both combinations and subcombinations of the various features described hereinabove, as well as variations and modifications thereof which would occur to persons skilled in the art upon reading the foregoing description and which are not disclosed in the prior art.
At each iteration of ECR 58, an optimal estimation of the echo canceller correction hE is desired, based only on the residual echo following the equalizer, hECR. Assuming that the adaptation noise V and the residual echo error hE(n) are both white across coordinates and time, with a known power, i.e., E(v·vT)=σv2·I, and E(hE·hET)=σhe2·I, we derive an optimal linear filter as follows. Denoting the optimal filter by BH, using the orthogonality principle gives:
Here F is defined as in equation (8) above. Using Singular Value Decomposition of F, i.e., F=U·ΛF·VH, gives:
Note that for σv2/σhe2=0, the optimal filter of equation (13) equals the generalized inverse of equation (12), since generally
FT·(F·FT)−1=(FTF)−1FT.
This appendix presents a convergence analysis of the gradient descent method of equation (13). The analysis includes the following stages:
The steepest descent step derived in equation (13) can be generalized and rewritten in a matrix form. Then, substituting from equation (8) gives the following echo canceller update formula:
Here B is a (m·lECR)×lEC matrix used for feedback from the ECR to the echo canceller. (In the gradient descent case represented by equation (13), B=F.) The index n refers to time instants. The recursion equation for the tap-weight error vector hE can then be written as:
Since F and B are not square matrices, we apply singular value decomposition (SVD) analysis to equation (B2). Assume F=U·ΛF·VH, with ΛF a diagonal matrix of the same dimension as F; and U and V are unitary matrices, of dimensions (M·lECR)×(M·lECR) and lEC×lEC, respectively. We now choose B=U·ΛB·VH, with ΛB a diagonal (M·lECR)×lEC matrix. This choice of B facilitates easy control of convergence rate and adaptation noise. The tap-weight error vector hE can now be rewritten as
We define gE=VH·hE, which admits the following relation:
gE(n+1)=vH·hE(n+1)=(I−μCA·ΛBHΛF)·gE(n)−μCA·ΛBH·UH·v(n) (equation B4)
Solving this equation for given initial conditions gE(0) and noise v(k) gives:
Since ΛBHΛF is a square lEC×lECdiagonal matrix, we can view the equation for gE(n+1) as system of lECsingle-variable independent equations.
The error associated with gE(m) (i.e., the m-th equation, or coordinate m) decays according to (1−μCA·λB*(m)λF(m))n, wherein λF(m)=ΛF(m, m) and λB(m)=ΛB(m,m). To prevent divergence, we require |1−μCA·λB*(m)λF(m)|<1. One extreme choice for this purpose is λB*(m)=(λF(m))−1 for λF(m)≠0, and 0 otherwise, corresponding to the generalized inverse of equation (11). This choice minimizes the cost function of equation (10), and thus is optimal in the least square/maximum likelihood sense. It does not trade off adaptation noise (var(v)) against tracking noise (var(gE)), and thus may give inferior results in terms of convergence speed.
To obtain the adaptation noise, we assume that v(n) is a white process whose entries are independent and identically distributed, i.e., ∀m1, m2, n1, n2: E((v(n
Here U is defined by SVD decomposition of F, i.e. F=U·ΛF·vH. Note that
since U is a (M·lECR)×(M·lECR) unitary matrix.
We will use this analysis to choose a good feedback (B) matrix. For a given convergence rate |1−μTA·λB*(m)·λF(m))|, it is obviously desirable to minimize |λB(m)| in order to decrease the adaptation noise. This implies Im(λB*(m)·λF(m))=0 and arg(λB(m))=arg(λF(m)). Thus, assuming |μCA·λB*(m)·λF(m)|<<1:
We now consider various choices of feedback matrix B, starting with the optimal MAP solution. Using equation (12), and assuming we know σv2 and σhe2 as defined there, the optimal filtering/MAP solution is:
Let
For γ<<1, the adaptation noise is not significant, so that equation (B8) gives the least square solution again. According to equation (B7), for this case, the adaptation noise is inversely proportional to λF(m)2, so that small values (or zero) of λF(m) are problematic. For γ>>1, the tracking noise is not significant, so that λB(m) is proportional to λF(m), as in the gradient descent algorithm defined above, wherein λB(m)=λF(m). For this choice of γ, the adaptation noise is white:
The next step is to analyze the convergence of ECR 58. The ECR convergence rate and adaptation noise will then be combined with the preceding results in order to produce overall convergence parameters. The ECR update formula has the following form, wherein each phase is adapted only once in each M symbols:
ECRp(n+1)=ECRp(n)+μECR·(d(n·M+p)−ECRPT(n)·x(n·M+p)) (equation B10)
Here x(n) are the vectors of the transmitted symbols TXS, having cross correlation RXX=I·σx2, wherein σx2 is the power of the transmitted symbols. d(n) is the signal that ECR 58 attempts to estimate; and μECR is the LMS adaptation step size of the ECR.
Convergence of the elements of ECR depends on two factors: the period (in symbols) allotted for ECR to converge (denoted tD), and the adaptation constant μECR. Increasing μECR speeds up ECR convergence, but it also increases adaptation noise. Excessive μECR, however, will make ECR adaptation diverge. If tD and μECR are such that ECR does not fully converge, μCA (the gain of the convergence acceleration method described above) can be set to compensate for the situation. Thus, there is a tradeoff between μECR, tD and μCA, which is further analyzed hereinbelow.
We can use standard LMS analysis (as described, for example, in the above-mentioned book by Haykin) to analyze the adaptation characteristics of ECR 58. Although LMS analysis usually uses the independence assumption, which is not applicable for ECR, the results of this analysis are still useful for small adaptation step size μECR. Defining ε(n)=ECRPOPT−ECRP(n), and k(n)=diag└E (ε(n)·ε(n)H)┘, it can be shown that:
ECRp(0)=0, since ECR starts zeroed, and subsequently ε(0)=ECRPOPT. Therefore,
In these equations,
since the ECR phase is adapted once in M symbols; A=μECR2·λXλXH+(I−μECR·σx2·I)2; λX=diag (σx2·I); σNSLC2 is the power of the noise signal at slicer 50; and km(n) is the m-th component of k(n).
In relation to equation (8) above, it was assumed that ECR converges completely, and thus that the convergence rate of the echo canceller is determined only by μCA. It is possible, however, that only partial convergence is reached by the filter in ECR 58, i.e., hECR=μ1·F·hE+V, wherein using equation (B11), μ1=1−(1−μECR·σX2)t
To facilitate subsequent analysis, we normalize the ECR response by μ1:
The expectation value of hECRNORM is the same as for full convergence, and is independent of μECR and tD. The only difference between the full- and partial-convergence cases is in the adaptation noise. For μ1→1, it is useless to further increase μECR, since based on equation (B13), the adaptation noise V increases linearly, while the effect of increasing μ1 diminishes. We therefore expect effective values of μECR to allow only partial ECR convergence.
To further simplify the subsequent analysis, we consider only the extreme case of tD·μECR<<1, so that μ1<<1. In this case, equation (B11) gives:
Since μECR<<1, A≈(I−μECR·σx2·I)2, and equation (B12) can be used to compute the variance σECR2, which is common to all the ECRp(tD) components:
The “normalized” ECR (hECRNORM) variance, σv2, is given by:
Note that the normalized variance is not dependent on μECR, assuming tD·μECR<<1.
Finally substituting σv2 into equation (B9) gives:
is the effective adaptation rate (in units of symbols−1) along the direction of the m-th eigenvector direction according to equation (B4). λF(m) is the eigenvalue of the m-th eigenvector.
Number | Name | Date | Kind |
---|---|---|---|
5132963 | Ungerboeck | Jul 1992 | A |
5353305 | Fukuda et al. | Oct 1994 | A |
5812537 | Betts et al. | Sep 1998 | A |
6223194 | Koike | Apr 2001 | B1 |
6240128 | Banerjea et al. | May 2001 | B1 |
6327302 | Shen | Dec 2001 | B1 |
6687235 | Chu | Feb 2004 | B1 |
20030118094 | Wang et al. | Jun 2003 | A1 |
Number | Date | Country |
---|---|---|
100 52 718 | May 2002 | DE |
1 187 360 | Mar 2002 | EP |
60-16032 | Jan 1985 | JP |
WO 9838582 | Sep 1998 | WO |
Number | Date | Country | |
---|---|---|---|
20040114542 A1 | Jun 2004 | US |