The invention relates generally to a multi-carrier communication system and, more particularly, to channel equalization in a multi-carrier communication system.
A multi-carrier communication system, such as a Discrete Multi-Tone (DMT) system in the various types of Digital Subscriber Line, for example, asymmetric digital subscriber line (ADSL) and very high-speed digital subscriber line (VDSL) systems, carries an information bit stream from a transmitter to a receiver. The information bit stream is typically converted into a sequence of data symbols having a number of tones. Each tone may be a group of one or more frequencies defined by a center frequency and a set bandwidth. The tones are also commonly referred to as sub-carriers or sub-channels. Each tone acts as a separate communication channel to carry information between a local transmitter-receiver (transceiver) device and a remote transceiver device.
DMT communication systems, such as ADSL, may experience channel distortion that causes the data symbols to spread. Therefore, there are certain limitations to how close symbols can be lined up next to each other without the use of a channel distortion compensation technique. The effect of channel distortion can be minimized using a channel equalizer.
{circumflex over (X)}i=F·Yi
where Yi is the vertical DFT output vector of length N at time i (i.e., the tones) and F is the diagonal matrix of FEQ taps (the last N/2−1 elements of Yi contain redundant information and may be ignored).
In practice, the length of the channel impulse response is often much longer than the cyclic prefix length. This results in inter-symbol interference (ISI) and inter-channel interference (ICI) that reduces the signal-to-noise ratio (SNR) that is achieved. This is almost always the case for ADSL systems. The most common way to equalize the channel in these cases is to use a time-domain equalizer (TEQ) to perform channel shortening. Many different methods can be used for computing the TEQ coefficients. Using a TEQ can significantly improve channel equalization, but rarely eliminates ISI completely. The lower band-edge of the downstream channel in ADSL systems often proves particularly difficult to equalize only using a TEQ.
Alternative equalization methods such as a generalized decision-feedback equalizer (GDFE) can be used for channel equalization of multi-carrier systems such as DMT, but the complexity may be very large when compared to TEQ/DFT/FEQ equalization.
The present invention is illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings in which:
In the following description, numerous specific details are set forth, such as examples of specific commands, named components, connections, number of frames, etc., in order to provide a thorough understanding of the present invention. It will be apparent, however, to one skilled in the art that the present invention may be practiced without these specific details. In other instances, well known components or methods have not been described in detail but rather in a block diagram in order to avoid unnecessarily obscuring the present invention. Thus, the specific details set forth are merely exemplary. The specific details may be varied from and still be contemplated to be within the spirit and scope of the present invention.
Some portions of the description that follow are presented in terms of algorithms and symbolic representations of operations on data that may be stored within a memory and operated on by a processor. These algorithmic descriptions and representations are the means used by those skilled in the art to effectively convey their work. An algorithm is generally conceived to be a self-consistent sequence of acts leading to a desired result. The acts are those requiring manipulation of quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, parameters, or the like.
The following detailed description includes several modules, which will be described below. These modules may be implemented by hardware components, such as logic, or may be embodied in machine-executable instructions, which may be used to cause a general-purpose or special-purpose processor programmed with the instructions to perform the operations described herein. Alternatively, the operations may be performed by a combination of hardware and software. The term “coupled to” as used herein means coupled directly to or indirectly to through one or more intervening components.
A method and apparatus for channel equalization in a multi-carrier communication system is described. The method may include receiving a symbol having multiple sub-carriers and reducing an error on at least one of the sub-carriers of the symbol by adding to it, one or more weighted multiples of other sub-carriers. The added weighted multiples may be from neighboring sub-carriers in the same symbol and/or from other symbols, for example, a previous or next symbol. The method may be implemented with a block linear equalizer (BLE) as described below.
The first transceiver 102, such as a Discrete Multi-Tone transmitter, transmits and receives communication signals from the second transceiver 104 over a transmission medium 106, such as a telephone line. Other devices such as telephones 108 may also connect to this transmission medium 106. An isolating filter 110 generally exists between the telephone 108 and the transmission medium 106. A training period occurs when initially establishing communications between the first transceiver 102 and a second transceiver 104.
The discrete multi-tone system 100 may include a central office, multiple distribution points, and multiple end users. The central office may contain the first transceiver 102 that communicates with the second transceiver 104 at an end user's location.
Each transmitter portion 117, 119 of the transceivers 102, 104, respectively, may transmit data over a number of mutually independent sub-channels i.e., tones. In a DMT communication system, data samples on each tone are represented as one of a set of finite number of points in a two-dimensional (2D) Quadrature Amplitude Modulation (QAM) constellation. The transmitted data in a multi-carrier system is usually represented by a point from a constellation of finite set of possible data points, regularly distributed over a two dimensional space. Each sub-channel carries only a certain portion of data through QAM of the sub-carrier. The number of information bits loaded on each tone and the size of corresponding QAM constellation may potentially vary from one tone to another and depend generally on the relative power of signal and noise at the receiver. When the characteristics of signal and noise are known for all tones, a bit-loading algorithm may determine the optimal distribution of data bits and signal power amongst sub-channels. Thus, a transmitter portion 117, 119 of the transceivers 102, 104 modulates each sub-carrier with a data point in a QAM constellation.
It should be noted that embodiments of the present invention are described below in reference to receiver 116 for ease of discussion, and that receiver 118 may operate in a similar manner as described below for receiver 116.
Received samples of a multi-tone signal are provided to the TEQ 310 to shorten the channel impulse response to mitigate the inter-symbol interference (ISI). The TEQ reduces ISI from the received signal by shortening the channel impulse response to approximately the width in samples of a guard period generated by the transmitter 117. In an embodiment, the length in samples of the shortened impulse response may equal the duration of the guard period plus one sample. The TEQ 310 may apply an algorithm to minimize the mean square error and inter-symbol interference simultaneously on the multi-tone signal in order to shorten the sample length channel impulse response. TEQ 310 is coupled to a CP removal module 320 that removes the cyclic prefix prior to the DFT module 330.
The DFT module 330 receives the output of the CP removal module 320. The DFT module 330 transforms the data samples of the multi-tone signal from the time-domain to the frequency-domain, such that a stream of data for each sub-carrier may be output from the DFT module 330. Essentially, the DFT module 330 acts as a demodulator to separate data corresponding to each tone in the multi-tone signal. Processing of each sub-carrier may be performed in parallel or in series.
In this embodiment, the DFT module 330 is directly coupled to a block linear equalizer (BLE) 340. The resultant signal from the DFT module 330 is sent to BLE 340. The output signal 341 from the BLE 340 is an estimate of the transmitted signal. SNR module 350 is coupled to BLE 340 to receive the signal estimate and noise detector 315 to receive the detected noise. The signal estimate is compared to detected noise to determine a signal to noise ratio (SNR) that is used in performing bit loading. The signal-to-noise ratio is provided to bit-loading module 360 to determine bit-loading for all sub-carriers. The bit rate for a tone determined by the bit-loading module 360 may then be transmitted, using transmitter portion 119, to the transceiver 102 (e.g., at a central office) to enable the transmitter 117 of transceiver 102 to know how many bits to use on each tone. A TEQ, CP removal module, DFT module, noise detector, SNR module and bit-loading module are known in the art; accordingly, a more detailed discussion is not provided.
In this embodiment, equalization using BLE 340 may be expressed mathematically in a matrix format as:
where Yi is the DFT output vector of length N and Wk are the N-by-N BLE matrices whose diagonal values are referred to as frequency taps. For practical DMT systems, the channel impulse response is shorter than a DMT symbol. In this case, the BLE matrices Wk are zero matrices for |k|>1 since ISI is only from the neighboring symbols. The BLE becomes:
The matrix W0 replaces the diagonal FEQ matrix F of the conventional receiver structured discussed above in regards to
In an alternative embodiment, the one or more weighted multiples that are added to a sub-carrier being operated on (e.g., Y1 of symbol 420), in step 520, may correspond to a previous symbol's weighted multiples 411 and/or next symbol's weight multiples 429.
The method may also include allowing or forcing one or more of the weighted multiples to a predetermined value, step 530. In one embodiment, at least one of the weighted multiples is allowed or forced to zero. In another embodiment, approximately twenty of the weighted multiples corresponding to lowest used tones are allowed or forced to zero. In yet another embodiment, approximately ten to twenty of the weight multiples are allowed or forced to be non-zero, and the rest are forced to zero.
The method may also include training the one or more weighted multiples, step 540. Training may be performed using a least-mean squares algorithm as discussed below in further detail.
In this embodiment, the frequency-domain equalization and block linear equalization functions are described mathematically in a matrix format as:
where F is again the diagonal FEQ matrix.
A block linear equalizer (BLE) for equalization for DMT systems has been described. For DMT systems with a large number of tones (large N), the complexity of a BLE can be very large. However, it is often the case that the majority of ISI and ICI around the low-frequency band edge are caused by other low-frequency tones. That is, only the tones around the lower band edge (e.g., lowest 15 tones) significantly contribute to the error. This allows the use of BLE matrices that are not full (e.g., very sparse BLE matrices) that dramatically reduce the implementation complexity. Some portion of the off-diagonal elements in the W matrices is allowed to be non-zero.
For example, consider an ADSL downstream channel using 256 sub-carriers (N=512). The lowest tone (e.g., first usable tone) is usually 33 for non-overlapped ADSL. The implementation of the BLE described herein would require 3*512*(512/2)=393216 complex multiplies per DMT symbol. With a modest TEQ, assume significant residual ISI and ICI at the lower band edge is restricted to the lowest 15 tones and is primarily caused by the same 15 tones. In one embodiment, the BLE matrices may be restricted to 15×15 nonzero elements (except for the W0 matrix which contains the FEQ taps on the diagonal). The complexity is reduced to 3*15*15=675 complex multiplies per DMT symbol.
Various methods may be used to compute the BLE taps. In one embodiment, a least-mean squares (LMS) algorithm may be used. Using LMS, BLE matrix taps are iteratively updated as:
Wk,i+1=Wk,i+μ·ei·Y*i+k
where
ei=Xi−{circumflex over (X)}i
is the vector of error estimates at time i.
In one embodiment, only the elements of the matrices Wk that are designated to be non-zero are updated. It should be noted that computation of the BLE taps is not limited to use of a LMS algorithm. In an alternative embodiment, another adaptive algorithm may be used to compute the BLE taps.
The BLE described herein may substantially improve channel equalization with low complexity. The BLE may be an extension of a conventional FEQ equalization for DMT systems and, therefore, a fairly adaptable to existing architectures. Furthermore, embodiments of the BLE described herein are conducive to real-time updates to adapt to changes in the channel over time.
In one embodiment, the methods described above may be embodied onto a machine-readable medium. A machine-readable medium includes any mechanism that provides (e.g., stores and/or transmits) information in a form readable by a machine (e.g., a computer). For example, a machine-readable medium includes read only memory (ROM); random access memory (RAM); magnetic disk storage media; optical storage media; flash memory devices; DVD's, electrical, optical, acoustical or other form of propagated signals (e.g., carrier waves, infrared signals, digital signals, EPROMs, EEPROMs, FLASH, magnetic or optical cards, or any type of media suitable for storing electronic instructions. The information representing the apparatuses and/or methods stored on the machine-readable medium may be used in the process of creating the apparatuses and/or methods described herein.
While some specific embodiments of the invention have been shown the invention is not to be limited to these embodiments. The invention is to be understood as not limited by the specific embodiments described herein, but only by scope of the appended claims.
This application claims the benefit of U.S. Provisional Application No. 60/632,019, filed Nov. 30, 2004, which is hereby incorporated by reference.
Number | Name | Date | Kind |
---|---|---|---|
4024359 | DeMarco et al. | May 1977 | A |
4024360 | Biraghi et al. | May 1977 | A |
4173714 | Bloch et al. | Nov 1979 | A |
4384355 | Wemer | May 1983 | A |
4679227 | Hughes-Hartogs | Jul 1987 | A |
4733389 | Puvogel | Mar 1988 | A |
4845466 | Hariton et al. | Jul 1989 | A |
4882733 | Tanner | Nov 1989 | A |
4977591 | Chen et al. | Dec 1990 | A |
5285474 | Chow et al. | Feb 1994 | A |
5304940 | Harasawa et al. | Apr 1994 | A |
5483551 | Huang et al. | Jan 1996 | A |
5524125 | Tsujimoto | Jun 1996 | A |
5555274 | Sheets | Sep 1996 | A |
5559890 | Obermeier et al. | Sep 1996 | A |
5596258 | Kimura et al. | Jan 1997 | A |
5596439 | Dankberg et al. | Jan 1997 | A |
5627859 | Parr | May 1997 | A |
5703904 | Langberg | Dec 1997 | A |
5768473 | Eatwell et al. | Jun 1998 | A |
5815538 | Grell et al. | Sep 1998 | A |
5818872 | Gupta | Oct 1998 | A |
5844940 | Goodson et al. | Dec 1998 | A |
5852630 | Langberg et al. | Dec 1998 | A |
5867539 | Koslov | Feb 1999 | A |
5901205 | Smith et al. | May 1999 | A |
5909178 | Balch et al. | Jun 1999 | A |
5930268 | Kurby et al. | Jul 1999 | A |
5952914 | Wynn | Sep 1999 | A |
5974098 | Tsuda | Oct 1999 | A |
5978373 | Hoff et al. | Nov 1999 | A |
6006083 | Tong et al. | Dec 1999 | A |
6014376 | Abreu et al. | Jan 2000 | A |
6052420 | Yeap et al. | Apr 2000 | A |
6118769 | Pries et al. | Sep 2000 | A |
6147963 | Walker et al. | Nov 2000 | A |
6161209 | Moher | Dec 2000 | A |
6185429 | Gehrke et al. | Feb 2001 | B1 |
6205220 | Jacobsen et al. | Mar 2001 | B1 |
6205410 | Cai | Mar 2001 | B1 |
6212227 | Ko et al. | Apr 2001 | B1 |
6226322 | Mukherjee | May 2001 | B1 |
6256326 | Kudo | Jul 2001 | B1 |
6266347 | Amrany et al. | Jul 2001 | B1 |
6266422 | Ikeda | Jul 2001 | B1 |
6295323 | Gabara | Sep 2001 | B1 |
6345071 | Hamdi | Feb 2002 | B1 |
6351509 | Vitenberg et al. | Feb 2002 | B1 |
6359926 | Isaksson | Mar 2002 | B1 |
6363109 | Polley et al. | Mar 2002 | B1 |
6378234 | Luo | Apr 2002 | B1 |
6411657 | Verbin et al. | Jun 2002 | B1 |
6433819 | Li et al. | Aug 2002 | B1 |
6445773 | Liang et al. | Sep 2002 | B1 |
6456673 | Wiese et al. | Sep 2002 | B1 |
6459739 | Vitenberg | Oct 2002 | B1 |
6466588 | Michaels | Oct 2002 | B1 |
6493395 | Isaksson et al. | Dec 2002 | B1 |
6498808 | Tzannes | Dec 2002 | B1 |
6507608 | Norrell | Jan 2003 | B1 |
6519291 | Dagdeviren et al. | Feb 2003 | B1 |
6542028 | Norrell et al. | Apr 2003 | B1 |
6546025 | Dupuy | Apr 2003 | B1 |
6556635 | Dehghan | Apr 2003 | B1 |
6597732 | Dowling | Jul 2003 | B1 |
6621346 | Nabicht et al. | Sep 2003 | B1 |
6631175 | Harikumar et al. | Oct 2003 | B2 |
6633545 | Milbrandt | Oct 2003 | B1 |
6674795 | Liu et al. | Jan 2004 | B1 |
6690666 | Norrell et al. | Feb 2004 | B1 |
6721394 | Murphy et al. | Apr 2004 | B1 |
6731914 | Creigh et al. | May 2004 | B2 |
6738418 | Stiscia et al. | May 2004 | B1 |
6754170 | Ward | Jun 2004 | B1 |
6763061 | Strait et al. | Jul 2004 | B1 |
6775241 | Levin | Aug 2004 | B1 |
6791995 | Azenkot et al. | Sep 2004 | B1 |
6798735 | Tzannes et al. | Sep 2004 | B1 |
6822998 | Yun et al. | Nov 2004 | B1 |
6826404 | Delfs et al. | Nov 2004 | B2 |
6839429 | Gaikwad et al. | Jan 2005 | B1 |
6859488 | Azenkot et al. | Feb 2005 | B2 |
6871066 | Khullar et al. | Mar 2005 | B1 |
6898236 | Sun | May 2005 | B1 |
6940973 | Yeap et al. | Sep 2005 | B1 |
6965636 | DesJardins et al. | Nov 2005 | B1 |
6999504 | Amrany et al. | Feb 2006 | B1 |
6999507 | Jin | Feb 2006 | B2 |
7023910 | Norrell | Apr 2006 | B1 |
7031669 | Vaidyanathan et al. | Apr 2006 | B2 |
7035661 | Yun | Apr 2006 | B1 |
7085315 | Kelton | Aug 2006 | B1 |
7085539 | Furman | Aug 2006 | B2 |
7120211 | Shmulyian et al. | Oct 2006 | B2 |
7155007 | Upton | Dec 2006 | B1 |
7174022 | Zhang et al. | Feb 2007 | B1 |
7177419 | Sedarat et al. | Feb 2007 | B2 |
7184467 | Jacobsen et al. | Feb 2007 | B2 |
7200196 | Li et al. | Apr 2007 | B2 |
7215727 | Yousef et al. | May 2007 | B2 |
7221722 | Thomas et al. | May 2007 | B2 |
7260117 | Long et al. | Aug 2007 | B2 |
7283509 | Moon et al. | Oct 2007 | B2 |
7283598 | Akita et al. | Oct 2007 | B2 |
7302379 | Cioffi et al. | Nov 2007 | B2 |
7315592 | Tsatsanis et al. | Jan 2008 | B2 |
7315967 | Azenko et al. | Jan 2008 | B2 |
7330544 | D'Angelo et al. | Feb 2008 | B2 |
7356049 | Rezvani | Apr 2008 | B1 |
7366258 | Kolze et al. | Apr 2008 | B2 |
7369607 | Sedarat | May 2008 | B2 |
7421015 | Sedarat | Sep 2008 | B2 |
7433395 | Sedarat | Oct 2008 | B2 |
7443916 | Sedarat et al. | Oct 2008 | B2 |
7502336 | Romano et al. | Mar 2009 | B2 |
7529984 | Heise | May 2009 | B2 |
7555037 | Sedarat | Jun 2009 | B2 |
7630489 | Oksman et al. | Dec 2009 | B2 |
20010009850 | Kushige | Jul 2001 | A1 |
20010011019 | Jokimies | Aug 2001 | A1 |
20010055332 | Sadjadpour et al. | Dec 2001 | A1 |
20020001340 | Shenoi et al. | Jan 2002 | A1 |
20020044597 | Shively et al. | Apr 2002 | A1 |
20020057713 | Bagchi et al. | May 2002 | A1 |
20020078247 | Lu et al. | Jun 2002 | A1 |
20020122515 | Bodenschatz | Sep 2002 | A1 |
20020154620 | Azenkot et al. | Oct 2002 | A1 |
20020163959 | Haddad | Nov 2002 | A1 |
20030021240 | Moon et al. | Jan 2003 | A1 |
20030035469 | Frank et al. | Feb 2003 | A1 |
20030043925 | Stopler et al. | Mar 2003 | A1 |
20030048368 | Bosco et al. | Mar 2003 | A1 |
20030055996 | Mori et al. | Mar 2003 | A1 |
20030091053 | Tzannes et al. | May 2003 | A1 |
20030099285 | Graziano et al. | May 2003 | A1 |
20030099286 | Graziano et al. | May 2003 | A1 |
20030099350 | Bostoen et al. | May 2003 | A1 |
20030108094 | Lai et al. | Jun 2003 | A1 |
20030112860 | Erdogan | Jun 2003 | A1 |
20030112887 | Sang et al. | Jun 2003 | A1 |
20030124983 | Parssinen et al. | Jul 2003 | A1 |
20030185176 | Lusky et al. | Oct 2003 | A1 |
20030206579 | Bryant | Nov 2003 | A1 |
20030227967 | Wang et al. | Dec 2003 | A1 |
20040057502 | Azenkot et al. | Mar 2004 | A1 |
20040066865 | Yousef et al. | Apr 2004 | A1 |
20040071240 | Betts | Apr 2004 | A1 |
20040087278 | Lin et al. | May 2004 | A1 |
20040091025 | Sindhushayana et al. | May 2004 | A1 |
20040111345 | Chuang et al. | Jun 2004 | A1 |
20040141548 | Shattil | Jul 2004 | A1 |
20040156441 | Peeters et al. | Aug 2004 | A1 |
20040176063 | Choi | Sep 2004 | A1 |
20040185852 | Son et al. | Sep 2004 | A1 |
20040213170 | Bremer | Oct 2004 | A1 |
20040223449 | Tsuie et al. | Nov 2004 | A1 |
20050041753 | Cunningham | Feb 2005 | A1 |
20050047489 | Yousef et al. | Mar 2005 | A1 |
20050047514 | Bolinth et al. | Mar 2005 | A1 |
20050053229 | Tsatsanis et al. | Mar 2005 | A1 |
20050094550 | Huh et al. | May 2005 | A1 |
20050099967 | Baba | May 2005 | A1 |
20050111561 | Sedarat et al. | May 2005 | A1 |
20050143008 | Bailey | Jun 2005 | A1 |
20050159128 | Collins et al. | Jul 2005 | A1 |
20050169357 | Sedarat | Aug 2005 | A1 |
20050190825 | Sedarat | Sep 2005 | A1 |
20050190848 | Kiyanagii et al. | Sep 2005 | A1 |
20050190871 | Sedarat | Sep 2005 | A1 |
20050216441 | Thomas et al. | Sep 2005 | A1 |
20050271129 | Reina | Dec 2005 | A1 |
20050276355 | Chow et al. | Dec 2005 | A1 |
20060002457 | Romano et al. | Jan 2006 | A1 |
20060019687 | Garg et al. | Jan 2006 | A1 |
20060039550 | Chadha et al. | Feb 2006 | A1 |
20060062379 | Sedarat et al. | Mar 2006 | A1 |
20060067388 | Sedarat et al. | Mar 2006 | A1 |
20060078044 | Norrell et al. | Apr 2006 | A1 |
20060083321 | Sedarat | Apr 2006 | A1 |
20060083322 | DesJardins et al. | Apr 2006 | A1 |
20060083323 | DesJardins et al. | Apr 2006 | A1 |
20060083324 | DesJardins et al. | Apr 2006 | A1 |
20060115030 | Erving et al. | Jun 2006 | A1 |
20060171480 | Erving et al. | Aug 2006 | A1 |
20060193390 | Sedarat | Aug 2006 | A1 |
20060203843 | Liu | Sep 2006 | A1 |
20060222098 | Sedarat et al. | Oct 2006 | A1 |
20060227913 | Sedarat | Oct 2006 | A1 |
20060253515 | Sedarat | Nov 2006 | A1 |
20060291537 | Fullerton et al. | Dec 2006 | A1 |
20070002940 | Zhou | Jan 2007 | A1 |
20070183526 | Norrell et al. | Aug 2007 | A1 |
20070217492 | Cox et al. | Sep 2007 | A1 |
Number | Date | Country |
---|---|---|
0 377 965 | Jul 1989 | EP |
0 844 758 | May 1998 | EP |
0 966 134 | Dec 1999 | EP |
1 389 846 | Feb 2004 | EP |
1 388 944 | Apr 2004 | EP |
WO 2006042274 | Apr 2006 | WO |
Number | Date | Country | |
---|---|---|---|
20060126747 A1 | Jun 2006 | US |
Number | Date | Country | |
---|---|---|---|
60632019 | Nov 2004 | US |