The present invention is related to a Trellis-Coded-Modulation (TCM) decoder.
A Trellis-Coded-Modulation (TCM) decoder is utilized in a Gigabit Ethernet (1000BASE-T) receiver for performing error correction decoding operations. Current TCM decoders are designed to have a fixed trace-back length, i.e. a generated output code is output after returning a received input code for a fixed depth (or a fixed period length). The trace-back length or the fixed depth also directly reflects latency of the receiver in that the longer the trace-back length, the longer the latency. Furthermore, as quality of a signal received by the receiver is not regular, the trace-back length of the TCM decoder should be set to be relatively long in order to guarantee the success of operations of the TCM decoder. This, however, worsens the signal latency.
This in mind, an objective of the present invention is to provide a Trellis-Coded-Modulation decoder (TCM) and an associated decoding method, which can determined a trace-back length suitable for the TCM decoder according to a signal quality of a receiver. As the trace-back length may be automatically modified according to the signal quality of the receiver, unnecessary latency of the received signal can be reduced, which solves the problem of the related art.
In one embodiment of the present invention, a TCM decoder applied in a receiver is disclosed. The TCM decoder comprises a branch metric unit, a path metric unit, a trace-back length selection circuit and a survival path management circuit. In operations of the TCM decoder, the branch metric unit is configured to receive multiple input codes to generate multiple sets of branch information. The path metric unit is configured to calculate multiple survival paths according to the multiple sets of branch information. The trace-back length selection circuit is configured to select a trace-back length, wherein the trace-back length is determined according to a signal quality of the receiver. The survival path management circuit is configured to return the multiple survival paths for the trace-back length to generate an output code.
In another embodiment of the present invention, a decoding method for a TCM decoder is disclosed. The decoding method comprises the following steps: receiving multiple input codes to generate multiple sets of branch information; calculating multiple survival paths according to the multiple sets of branch information; selecting a trace-back length, wherein the trace-back length is determined according to a signal quality of the receiver; and returning the multiple survival paths for the trace-back length in order to generate an output code.
In another embodiment of the present invention, a receiver is disclosed. The receiver comprises a front-end circuit, an analog-to-digital converter (ADC), an equalizer and a TCM decoder. In operations of the receiver, the front-end circuit is configured to receive a network signal from a network cable. The ADC is configured to convert the network signal into a digital signal. The equalizer is configured to perform an equalization operation on the digital signal for eliminating Inter-Symbol Interference (ISI), to generate multiple input codes. The TCM decoder is configured to perform decoding operations on the multiple input codes to generate multiple output codes, wherein a trace-back length utilized by the TCM decoder is determined according to a signal quality of the network signal.
These and other objectives of the present invention will no doubt become obvious to those of ordinary skill in the art after reading the following detailed description of the preferred embodiment that is illustrated in the various figures and drawings.
In operations of the receiver 100, the front-end circuit 110 processes a network signal from the network connector 102 and transmits the signal to the ADC 120, where analog-to-digital conversion is performed to generate a digital signal. The equalizer 130 then performs an equalization operation on the digital signal for eliminating Inter-Symbol Interference (ISI), to generate multiple input codes. The TCM decoder 140 is configured to perform a decoding operation on the multiple input codes to generate multiple output codes to backend circuit(s). In the embodiment of
The path merit unit 220 then calculates the multiple test survival paths according to the multiple sets of test branch information, where the multiple test survival paths are illustrated by thick arrows in
As the aforementioned four survival paths may converge to a single state (i.e. from left to right, the second state of the path 10) after returning four input codes, the survival path management circuit 240 may determine the convergence length as “4” according to the aforementioned four test survival paths. It should be noted that the aforementioned steps may be repeatedly executed according to the input codes that are sequentially input; i.e. the convergence length finally determined by the survival path management 240 is determined according to the previously calculated convergence lengths, e.g. by selecting the longest within the convergence lengths.
The trace-back length selection circuit 230 may then determine the trace-back length according to the convergence length determined by the survival path management circuit 240. For example, the trace-back length may be equal to the convergence length, or the trace-back length may be slightly greater than the convergence length.
After the trace-back length selection circuit 230 determines the trace-back length, for network signals (data signals) that are subsequently received by the receiver 100, the branch merit unit 210 generates multiple sets of branch information according to the multiple input codes generated by the equalizer 130, the path merit unit 220 calculates multiple test survival paths according to the multiple sets of test branch information, and the survival path management circuit 210 returns the multiple survival paths for the trace-back length to generate an output code. Taking
Taking
It should be noted that the focal point of the present invention is automatically determining the trace-back length in the TCM decoder 140 according to the signal quality, rather than the states and the content being directed in the TCM decoder 140. The content illustrated in
In this embodiment, the TCM decoder 140 may determine the trace-back length for subsequent usage only when the receiver 100 establishes a network link with the electronic device 106, i.e. the TCM decoder 100 will not determine a new trace-back length again during the process of the receiver 100 receiving data signals. In another embodiment, when the receiver 100 is in an idle state, the TCM decoder 140 may also receive other signals from the electronic device 106 to determine a new trace-back length.
Step 400: the flow starts.
Step 402: receive multiple input codes to generate multiple sets of branch information.
Step 404: calculate multiple survival paths according to the multiple sets of branch information.
Step 406: select a trace-back length, wherein the trace-back length is determined according to a signal quality of the receiver.
Step 408: return the multiple survival paths for the trace-back length, to generate an output code.
Those skilled in the art will readily observe that numerous modifications and alterations of the device and method may be made while retaining the teachings of the invention. Accordingly, the above disclosure should be construed as limited only by the metes and bounds of the appended claims.
Number | Date | Country | Kind |
---|---|---|---|
109111207 | Apr 2020 | TW | national |
Number | Name | Date | Kind |
---|---|---|---|
4777636 | Yamashita | Oct 1988 | A |
4823346 | Kobayashi | Apr 1989 | A |
5150369 | Costa | Sep 1992 | A |
5490178 | Blaker | Feb 1996 | A |
5537445 | Blaker | Jul 1996 | A |
5991341 | Shin | Nov 1999 | A |
6035428 | Jekal | Mar 2000 | A |
6041433 | Kamada | Mar 2000 | A |
6263473 | Kamada | Jul 2001 | B1 |
6327317 | Chennakeshu | Dec 2001 | B1 |
6452985 | Hatakeyama | Sep 2002 | B1 |
6487694 | Bajwa | Nov 2002 | B1 |
6591395 | Tsai | Jul 2003 | B1 |
6601215 | Thurnhofer | Jul 2003 | B1 |
6654929 | Kamada | Nov 2003 | B1 |
6690750 | Hocevar | Feb 2004 | B1 |
6697442 | Todoroki | Feb 2004 | B1 |
6788750 | Reuven | Sep 2004 | B1 |
6999521 | Azadet | Feb 2006 | B1 |
7035356 | Langhammer | Apr 2006 | B1 |
7173985 | Diaz-Manero | Feb 2007 | B1 |
7331013 | Rudosky | Feb 2008 | B2 |
7404139 | Prasad | Jul 2008 | B2 |
7561641 | Kuo | Jul 2009 | B2 |
7564930 | Diaz-Manero | Jul 2009 | B1 |
7861146 | Watanabe | Dec 2010 | B2 |
8301990 | Wilson | Oct 2012 | B2 |
8891695 | Ahmed | Nov 2014 | B2 |
10256845 | Yksel | Apr 2019 | B1 |
11165446 | Quitzk | Nov 2021 | B1 |
20010007142 | Hocevar | Jul 2001 | A1 |
20020112211 | Brick | Aug 2002 | A1 |
20020168017 | Berthet | Nov 2002 | A1 |
20040064781 | Kamada | Apr 2004 | A1 |
20040243916 | Kim | Dec 2004 | A1 |
20050074070 | Betts | Apr 2005 | A1 |
20060136802 | Jeon | Jun 2006 | A1 |
20060262832 | Kaewell | Nov 2006 | A1 |
20070168845 | Endo | Jul 2007 | A1 |
20070183539 | Nishijima | Aug 2007 | A1 |
20080072125 | Norris | Mar 2008 | A1 |
20080072126 | Norris | Mar 2008 | A1 |
20080178063 | Norris | Jul 2008 | A1 |
20090089649 | Wilson | Apr 2009 | A1 |
20090213967 | Yeh | Aug 2009 | A1 |
20100229076 | Shinagawa | Sep 2010 | A1 |
20120042229 | Tang | Feb 2012 | A1 |
20120210197 | Jang | Aug 2012 | A1 |
20130028299 | Tsai | Jan 2013 | A1 |
20130287147 | Ahmed | Oct 2013 | A1 |
20210314202 | Shih | Oct 2021 | A1 |
Number | Date | Country |
---|---|---|
5476838 | Apr 2014 | JP |
Number | Date | Country | |
---|---|---|---|
20210314202 A1 | Oct 2021 | US |