The present invention relates to digital signal processing and transmission in wire-lined communication systems. More specifically, it relates to low complexity designs of adaptive echo and near-end crosstalk (NEXT) cancellers in multi-channel DSP transceivers with Tomlinson-Harashima precoders.
Many multi-channel wire-line communication systems, such as DSL (digital subscribe line) systems and gigabit Ethernet systems suffer from echo and cross channel interferences, i.e., crosstalks. Generally, echo and NEXT cancellers are used to mitigate the effect of echo and NEXT noise. The typical way to implement those noise cancellers is to use finite impulse response (FIR) filters in digital domain. This straightforward approach, however, will lead to a significant hardware complexity if the number of taps in the FIR filters is large. For example, in the typical 10GBase-T application, one echo canceller and three NEXT cancellers are used for each pair of cables. Since there are four pairs of cables (four channels) in 10GBASE-T, a total of four echo cancellers and twelve NEXT cancellers are needed at the receiver end. To achieve high performance noise cancellation, each FIR based echo and NEXT canceller requires hundreds of taps, and then the total number of taps in these cancellers is around 5600˜6800. Furthermore, all these cancellers need to be adapted to accommodate channel variations. Implementing these adaptive cancellers will consume large silicon area and power consumption. Therefore, efficient implementation of these adaptive cancellers is very important for a successful DSP transceiver design.
How to achieve a cost-effective design of adaptive echo and NEXT cancellers in multi-channel DSP transceivers is a challenging task. It is apparent in the industry that the FIR techniques used in 1000Base-T solutions, if implemented in a straightforward way, would result in a complexity increase on the order of 45× over 1000Base-T. By using FFT transformation, approximate complexity saving can be 90%. However, new issues such as block processing latency, increased memory and increased precision, make it unsuitable for the multi-channel wire-line data transmission systems such as 10GBase-T. Because of the inherent time-varying and randomness of the channel impulse responses, simple techniques to extend the length of the impulse response to be cancelled, such as continuous-time analog filters or infinite impulse response (IIR) digital filters are not acceptable as flexible solutions. The problem becomes even worse when introducing Tomlinson-Harashima precoding (TH precoding) in 10GBase-T as the inputs to echo and NEXT cancellers are no longer simple PAM-M symbols but numbers uniformly distributed on [−M, M). These make look-ahead and pre-computation techniques difficult to apply (See, e.g., K. K. Parhi, “Pipelining of Parallel Multiplexer Loops and Decision Feedback Equalizers,” in Proceedings of ICASSP 2004, vol. 5, pp. 21-24, May 2004). Furthermore, the word-length of these inputs needs to be long enough (i.e., 10-bit) to achieve required noise cancellation level. Thus, the implementation cost of these adaptive echo and NEXT cancellers increases significantly.
To solve these problems, a new word-length reduction scheme was proposed in one of previous inventions (See, Keshab K. Parhi, and Yongru Gu, “System and method for low-power echo and NEXT cancellers”, U.S. patent application Ser. No. 11/487,041, filed on Jul. 13, 2006), where the hardware cost of these echo and NEXT cancellers was reduced by about 10.82% without any performance loss. However, the proposed word-length reduction technique can not be easily applied to the weight (coefficient) adaptation part in the adaptive filters. Complexity analysis also showed that the hardware cost saving was mainly due to hardware cost reduction of the filter part in these adaptive cancellers. Therefore, the problem of reducing hardware cost of the weight update part in these adaptive cancellers remained unsolved.
What is needed is a new design methodology and an implementation method to deal with the weight update part in these adaptive echo and NEXT cancellers so that the overall hardware cost of implementing these cancellers can be further reduced.
The present invention proposes a new complexity reduction scheme for the weight update part in adaptive echo and NEXT cancellers, and also describes a high-speed implementation method for the proposed low complexity adaptive echo and NEXT cancellers in a multi-channel data transmission system with TH precoding.
In accordance with the present invention, the overall hardware cost reduction in adaptive echo and NEXT canceller is achieved by incorporating both word-length reduction scheme and the proposed weight update scheme. First, the retiming technique is applied to obtain a filtered error LMS architecture (See, e.g., S. Shaffer and C. S. Williams, “The Filtered Error LMS Algorithm,” in Proceedings of ICASSP 1983, vol. 8, pp. 41-44, April 1983), such that the inputs to both filter part and weight update part can then be replaced by a finite signal, v(n). Applying the word-length reduction scheme (See, e.g., J. Chen, Y. Gu and K. K. Parhi, “Low Complexity ECHO And NEXT Cancellers for High-Speed Ethernet Transceivers”, in IEEE Trans. Circuits and Systems-I: Regular Papers, 55(9), pp. 2827-2840, October 2008), the overall hardware cost of these cancellers can be reduced. Moreover, an efficient weight-updating scheme is proposed by exploiting the property of the sum of two adaptive filters to further reduce the overall computational complexity. The proposed scheme is general and can be applied to multiple-input-multiple-output (MIMO) systems such that hardware cost of both echo and NEXT cancellers can be reduced in a typical 10GBase-T Ethernet system.
Further embodiments, features, and advantages of the present invention, as well as the structure and operation of the various embodiments of the present invention are described in detail below with reference to accompanying drawings.
The present invention is described with reference to the accompanying figures. The accompanying figure, which are incorporated herein, form part of the specification, illustrate the present invention and, together with the description, further serve to explain the principles of the invention and to enable a person skilled in the relevant art to make and use the invention.
Table 1 lists the performance comparison for different designs in terms of residual error signal power at the input to the FFE.
Table 2 lists the hardware complexity comparison of the resulting adaptive echo and NEXT cancellers by applying different architectures.
Recently, TH precoding has been proposed to be used in 10GBase-T because it can eliminate error propagation and allow use of capacity-achieving channel codes, such as low-density parity-check (LDPC) codes, in a natural way. However, the use of TH precoding technology significantly increases the complexity of adaptive echo and NEXT cancellers in 10GBase-T.
Consider the block diagram of a typical 10GBase-T transceiver for one pair in
To reduce the complexity of echo and NEXT cancellers, a method based on word-length reduction technique was proposed in one of previous inventions (See, Keshab K. Parhi, and Yongru Gu, “System and method for low-power echo and NEXT cancellers”, U.S. patent application Ser. No. 11/487,041, filed on Jul. 13, 2006). The proposed design was derived from converting a TH precoder to its equivalent form where the TH precoder could be viewed as an infinite impulse response (IIR) filter
with an input equal to the sum of the original input to the TH precoder x(n) and a finite-level compensation signal v(n). Instead of using the output of the TH precoder t(n) as the input to the echo and NEXT cancellers, the sum signal x(n)+v(n) was proposed to be the input to these cancellers, as shown in
In real applications, echo and NEXT channels are slowly-varying and adaptive filters are needed for noise cancellation. The prior word-length reduction technique can also be applied to the design of these adaptive cancellers. In the following, we only consider adaptive echo cancellers to illustrate the design methodology since the architecture of NEXT cancellers is similar to that of echo cancellers except that the inputs are replaced by the transmitted signals from the adjacent transmitters.
Direct application of the idea shown in
with fixed coefficients is inserted into the echo cancellation path after the output of the echo canceller. By doing so, it can be shown that this modified design and the traditional design in
However, the main drawback in previous invention (See, Keshab K. Parhi, and Yongru Gu, “System and method for low-power echo and NEXT cancellers”, U.S. patent application Ser. No. 11/487,041, filed on Jul. 13, 2006) is that the hardware cost of the weight update part in the adaptive filter remains unchanged, which limits the overall hardware cost reduction. This is because the input to the weight update part is still t(n), which is uniform in [−M, M) such that the word-length reduction technique can not be easily applied. Thus, a new method is needed to reduce the hardware complexity of the weight update part in the adaptive filter such that the overall hardware complexity can be further reduced.
Consider the traditional architecture of adaptive echo canceller in
In order to minimize the mean square error, E[|e(n)|2] and also to track the time-varying channel environment, the LMS adaptive algorithm is applied to the proposed design. Since the update error signal e(n) is filtered before the weight update part, the resulting adaptive algorithm is usually referred as filtered error LMS algorithm (e.g., S. Shaffer and C. S. Williams, “The Filtered Error LMS Algorithm,” ICASSP 83, vol. 8, pp. 41-44, April 1983), and it can be summarized as:
{circumflex over (y)}(n)=[{circumflex over (g)}(n)Hd(n)]*h−1, EQ.(1)
e(n)=y(n)−{circumflex over (y)}(n), EQ.(2)
{circumflex over (g)}(n+1)={circumflex over (g)}(n)+μd(n)[e(n)*h], EQ.(3)
where ĝ(n) denotes tap weights of the adaptive echo canceller at n-th interation, d(n) is the input vector at n-th iteration, h−1 denotes the equivalent impulse response of the IIR filter
h denotes impulse response of the FIR filter H(z), μ is the step size, and * denotes convolution operation.
Noting that d(n) is the sum of x(n) and v(n), we can write EQ.(1) as
{circumflex over (y)}(n)=[{circumflex over (g)}(n)Hx(n)+{circumflex over (g)}(n)Hv(n)]*h−1, EQ.(4)
which means the echo canceller in
{circumflex over (y)}(n)=[ĝ1(n)Hx(n)+ĝ2(n)Hv(n)]*h−1, EQ.(5)
where ĝ1(n) represents the weights of the filter with the input x(n), and ĝ2(n) represents the weights of the filter with the input v(n). Then the error signal e(n) can be expressed as
e(n)=y(n)−[ĝ1(n)Hx(n)]*h−1−[ĝ2(n)Hv(n)]*h−1. EQ.(6)
To minimise E[|e(n)|2], modified weight update equations can be derived as:
ĝ1(n+1)=ĝ1(n)+μ1x(n)[e(n)*h], EQ.(7)
and
ĝ2(n+1)=ĝ2(n)+μ2v(n)[e(n)*h], EQ.(8)
where μ1 and μ2 are step sizes for the corresponding adaptive filters.
From EQ.(7) and EQ.(8), it is seen that the sum of the two adaptive filters can be adapted separately with their own input signals. Based on this observation, we can obtain an architecture of the adaptive echo canceller as shown in
However, it is not efficient to update both ĝ1(n) and ĝ2(n) every iteration. By observing the optimal coefficients ĝ1opt and ĝ2opt after convergence, it is found that both of them will converge to the same optimal value, i.e., ĝ1opt=ĝ2opt. This implies that only one of the equations in EQ.(7) and EQ.(8) is needed for weight updating. Based on this fact, we can use either x(n) or v(n) as the input to the weight update part in adaptive filter, and then use the updated coefficients in both filters for filtering operation. The advantage is that the hardware complexity of the weight update part can be further reduced because x(n) or v(n) can be encoded to have fewer bits than the sum signal d(n).
By exploiting the property of the compensation signal v(n), it is found that it could be encoded to have fewer bits than x(n). If v(n) is used as the input to the weight update part, the hardware complexity can be reduced more. On the other hand, we note that v(n) dominates the eigenvalue spread of the sum signal d(n). It is better to use v(n) instead of x(n) to avoid the performance degradation. Thus, we propose to use v(n) as the input to the weight update the part in the adaptive echo canceller as shown in
Experimental results are provided to illustrate the performance of the proposed weight-updating scheme. In
It is mentioned that the proposed method is general and can be applied to adaptive NEXT cancellers as well in the application of 10GBase-T.
Next, fixed point simulation results are presented to evaluate the system performance in terms of the residual error signal power by applying the proposed scheme. In addition, the hardware complexity analysis is presented to demonstrate the complexity reduction of the proposed adaptive echo and NEXT cancellers in a typical 10GBase-T system.
The simulation is performed under Cat-6 unshielded twisted-pair (UTP) channel environment. The measured data of channel models with different lengths can be obtained from the IEEE 802.3an website. A PAM-2 signal is used as the training symbol while data symbol is assumed to be PAM-16. In addition, the transmit power is assumed to be 5 dBm, AWGN power is assumed to be −150 dBm. It is also assumed that the number of taps in each echo canceller is 500, the number of taps in each NEXT canceller is 300, the number of taps in each TH precoder is 13, and the number of taps in each feed-forward equalizer (FFE) is 64.
Table 1 shows the performance comparison in terms of residual error signal power at the input to the FFE. In the simulation, we evaluate the proposed design over Cat-6 measured channel models with different lengths: 100 m, 75 m, and 55 m respectively. As we can see from this table, the proposed design has around 1.5 dB performance penalty compared with the traditional design and proposed design in previous invention (See, Keshab K. Parhi, and Yongru Gu, “System and method for low-power echo and NEXT cancellers”, U.S. patent application Ser. No. 11/487,041, filed on Jul. 13, 2006).
To evaluate the hardware cost of the proposed design, we use XOR2 (Cxor), 1-bit D flip-flop (Creg), and basic 2-input gates (Cgate) such as NAND2, NOR2, to represent the total cost of the adaptive echo and NEXT cancellers, where Cxor, Creg, and Cgate are technology dependent constants. For example, a one-bit fulladder can be represented as Cfa=2×Cxor+3×Cgate. Furthermore, we assume Cgate=1, Cxor=1.75, and Creg=5.5.
Table 2 shows the hardware complexity comparison of the resulting adaptive echo and NEXT cancellers by applying different architectures. From this table, it is seers that the proposed architecture can save the hardware cost of total adaptive cancellers about 42.02%, while the previous invention (See, Keshab K. Parhi, and Yongru Gu, “System and method for low-power echo and NEXT cancellers”, U.S. patent application Ser. No. 11/487,041, filed on Jul. 13, 2006) can only save about 10.08%. The further cost reduction is mainly due to the efficient weight-updating scheme such that word-length of the input signal to the weight update part can be significantly reduced. As we can see from the table, the hardware cost of the weight update part in both echo and NEXT cancellers has been greatly reduced in the proposed architecture.
A new method to further reduce the hardware cost of adaptive echo and NEXT cancellers is presented, and the proposed method can be used to design a low complexity transceiver in high-speed multi-channel wireline communication systems with TH precoders, such as 10GBase-T. It is shown that the proposed method can reduce the hardware cost by about 42.02% only with about 1.5 dB performance penalty, compared with the traditional design.
It will be understood by those skilled in the art that various changes in form and details can be made therein without departing from the spirit and scope of the invention as defined in the appended claims. Thus, the breadth and scope of the present invention should not be limited by any of the above-described exemplary embodiments, but should be defined only in accordance with the following claims and their equivalents.
This application claims the benefit of U.S. Provisional Application No. 61/274,902, filed on Aug. 24, 2009, the entire content of which is incorporated herein by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
6400761 | Smee et al. | Jun 2002 | B1 |
8009823 | Parhi et al. | Aug 2011 | B2 |
20030086515 | Trans et al. | May 2003 | A1 |
20030223505 | Verbin et al. | Dec 2003 | A1 |
20040125973 | Fang et al. | Jul 2004 | A1 |
20060056521 | Parhi et al. | Mar 2006 | A1 |
Number | Date | Country | |
---|---|---|---|
20110044448 A1 | Feb 2011 | US |
Number | Date | Country | |
---|---|---|---|
61274902 | Aug 2009 | US |