Publication number | US7499498 B2 |

Publication type | Grant |

Application number | US 11/256,182 |

Publication date | Mar 3, 2009 |

Filing date | Oct 21, 2005 |

Priority date | Dec 23, 1999 |

Fee status | Paid |

Also published as | CA2327910A1, EP1111863A2, EP1111863A3, EP1111863B1, US6999521, US20060039492 |

Publication number | 11256182, 256182, US 7499498 B2, US 7499498B2, US-B2-7499498, US7499498 B2, US7499498B2 |

Inventors | Kameran Azadet, Erich Franz Haratsch |

Original Assignee | Alcatel-Lucent Usa Inc. |

Export Citation | BiBTeX, EndNote, RefMan |

Patent Citations (13), Non-Patent Citations (11), Referenced by (1), Classifications (17), Legal Events (4) | |

External Links: USPTO, USPTO Assignment, Espacenet | |

US 7499498 B2

Abstract

A method and apparatus are disclosed for improving the processing time of reduced complexity sequence estimation techniques, such as reduced state sequence estimation (RSSE). The possible values for the branch metrics in the RSSE are precomputed to permit pipelining and the shortening of the critical path. The computational load of the precomputations is reduced for multi-dimensional trellis codes by precomputing each dimension of the multi-dimensional trellis code separately. Prefiltering techniques are used to reduce the computational complexity by shortening the channel memory. A hybrid survivor memory architecture is disclosed for RSSE for a channel having a channel memory of length L, where the survivors corresponding to the L past decoding cycles are stored in a register exchange architecture, and survivors corresponding to later decoding cycles are stored in a trace-back architecture (TBA) or register exchange architecture (REA). Symbols are mapped to information bits to reduce the word size before being moved from the first register exchange architecture to the trace-back architecture (TBA) or the second register exchange architecture.

Claims(8)

1. A hybrid survivor memory architecture for a reduced complexity sequence estimator for a channel having a channel memory of length L, comprising:

a register exchange architecture (REA) for storing the survivors corresponding to the L past decoding cycles; and

a trace-back architecture (TBA) for storing survivors corresponding to later decoding cycles, wherein symbols outputted from said register exchange architecture (REA), before being moved from said register exchange architecture to said trace-back architecture (TBA), are mapped to information bits.

2. The survivor memory architecture of claim 1 , wherein said reduced complexity sequence estimation technique is a reduced state sequence estimation (RSSE) technique.

3. The survivor memory architecture of claim 1 , wherein said reduced complexity sequence estimation technique is an implementation of a Viterbi algorithm.

4. The survivor memory architecture of claim 1 , wherein said reduced complexity sequence estimation technique is an implementation of an M algorithm.

5. A hybrid survivor memory architecture for a reduced complexity sequence estimator for a channel having a channel memory of length L, comprising:

a first register exchange architecture (REA) for storing the survivors corresponding to the L past decoding cycles; and

a second register exchange architecture (REA) for storing survivors corresponding to later decoding cycles, wherein symbols moved from said first register exchange architecture (REA), before being moved from said first register exchange architecture to said second register exchange architecture (REA), are mapped to information bits.

6. The survivor memory architecture of claim 5 , wherein said reduced complexity sequence estimation technique is an reduced state sequence estimation (RSSE) technique.

7. The survivor memory architecture of claim 5 , wherein said reduced complexity sequence estimation technique is an implementation of a Viterbi algorithm.

8. The survivor memory architecture of claim 5 , wherein said reduced complexity sequence estimation technique is an implementation of an M algorithm.

Description

This application is a divisional application of U.S. patent application Ser. No. 09/471,920 filed Dec. 23, 1999 now U.S. Pat. No. 6,999,521, incorporated by reference herein.

The present invention relates generally to channel equalization and decoding techniques, and more particularly, to sequence estimation techniques with shorter critical paths.

The transmission rates for local area networks (LANs) that use twisted pair conductors have progressively increased from 10 Megabits-per-second (Mbps) to 1 Gigabit-per-second (Gbps). The Gigabit Ethernet 1000 Base-T standard, for example, operates at a clock rate of 125 MHz and uses category 5 cabling with four copper pairs to transmit 1 Gbps. Trellis-coded modulation (TCM) is employed by the transmitter, in a known manner, to achieve coding gain. The signals arriving at the receiver are typically corrupted by intersymbol interference (ISI), crosstalk, echo, and noise. A major challenge for 1000 Base-T receivers is to jointly equalize the channel and decode the corrupted trellis-coded signals at the demanded clock rate of 125 MHz, as the algorithms for joint equalization and decoding incorporate non-linear feedback loops that cannot be pipelined.

Data detection is often performed using maximum likelihood sequence estimation (MLSE), to produce the output symbols or bits. A maximum likelihood sequence estimator considers all possible sequences and determines which sequence was actually transmitted, in a known manner. The maximum likelihood sequence estimator is the optimum decoder and applies the well-known Viterbi algorithm to perform joint equalization and decoding. For a more detailed discussion of a Viterbi implementation of a maximum likelihood sequence estimator, see Gerhard Fettweis and Heinrich Meyr, “High-Speed Parallel Viterbi Decoding Algorithm and VLSI-Architecture,” IEEE Communication Magazine (May 1991), incorporated by reference herein.

In order to reduce the hardware complexity for the maximum likelihood sequence estimator that applies the Viterbi algorithm, a number of suboptimal approaches, such as “reduced state sequence estimation (RSSE)” algorithms, have been proposed or suggested. For a discussion of reduced state sequence estimation techniques, as well as the special cases of decision-feedback sequence estimation (DFSE) and parallel decision-feedback equalization (PDFE) techniques, see, for example, P. R. Chevillat and E. Eleftheriou, “Decoding of Trellis-Encoded Signals in the Presence of Intersymbol Interference and Noise”, IEEE Trans. Commun., vol. 37, 669-76, (July 1989), M. V. Eyuboglu and S. U. H. Qureshi, “Reduced-State Sequence Estimation For Coded Modulation On Intersymbol Interference Channels”, IEEE JSAC, vol. 7, 989-95 (August 1989), or A. Duel-Hallen and C. Heegard, “Delayed decision-feedback sequence estimation,” IEEE Trans. Commun., vol. 37, pp. 428-436, May 1989, each incorporated by reference herein. For a discussion of the M algorithm, see, for example, E. F. Haratsch, “High-Speed VLSI Implementation of Reduced Complexity Sequence Estimation Algorithms With Application to Gigabit Ethernet 1000 Base-T,” Int'l Symposium on VLSI Technology, Systems, and Applications, Taipei (June 1999), incorporated by reference herein.

Generally, reduced state sequence estimation techniques reduce the complexity of the maximum likelihood sequence estimators by merging several states. The reduced state sequence estimation technique incorporates non-linear feedback loops that cannot be pipelined. The critical path associated with these feedback loops is the limiting factor for high-speed implementations.

U.S. patent application Ser. No. 09/326,785, filed Jun. 4, 1999 and entitled “Method and Apparatus for Reducing the Computational Complexity and Relaxing the Critical Path of Reduced State Sequence Estimation Techniques,” incorporated by reference herein, discloses a reduced state sequence estimation algorithm that reduces the hardware complexity of reduced state sequence estimation techniques for a given number of states and also relaxes the critical path problem. While the disclosed reduced state sequence estimation algorithm exhibits significantly improved processing time, additional processing gains are needed for many high-speed applications. A need therefore exists for a reduced state sequence estimation algorithm with improved processing time. Yet another need exists for a reduced state sequence estimation algorithm that is better suited for a high-speed implementation using very large scale integration (VLSI) techniques.

Generally, a method and apparatus are disclosed for improving the processing time of the reduced complexity sequence estimation techniques, such as the reduced state sequence estimation technique, for a given number of states. According to one feature of the invention, the possible values for the branch metrics in the reduced state sequence estimation technique are precomputed in a look-ahead fashion to permit pipelining and the shortening of the critical path. Thus, the present invention provides a delay that is similar to a traditional optimum Viterbi decoder. Precomputing the branch metrics for all possible symbol combinations in the channel memory in accordance with the present invention makes it possible to remove the branch metrics unit (BMU) and decision-feedback unit (DFU) from the feedback loop, thereby reducing the critical path. In the illustrative implementation, the functions of the branch metrics unit and decision-feedback unit are performed by a look-ahead branch metrics unit (LABMU) and an intersymbol interference canceller (ISIC) that are removed from the critical path.

A reduced state sequence estimator is disclosed that provides a look-ahead branch metrics unit to precompute the branch metrics for all possible values for the channel memory. At the beginning of each decoding cycle, a set of multiplexers (MUXs) select the appropriate branch metrics based on the survivor symbols in the corresponding survivor path cells (SPCs), which are then sent to an add-compare-select unit (ACSU). The critical path now comprises one multiplexer, add-compare-select unit and survivor path cell. The disclosed reduced state sequence estimator can be utilized for both one-dimensional and multi-dimensional trellis codes.

For multi-dimensional trellis codes where the precomputation of multi dimensional branch metrics becomes computationaly too expensive, a modified reduced state sequence estimator is disclosed to reduce the computational load. The metrics for each dimension of the multi-dimensional trellis code are precomputed separately. The appropriate one-dimensional branch metrics are then selected based on the corresponding survivor symbols in the corresponding survivor path cell for that dimension. A multi-dimensional branch metrics unit then combines the selected one-dimensional branch metrics to form the multi-dimensional branch metrics. According to another aspect of the invention, prefiltering techniques are used to reduce the computational complexity by shortening the channel memory. An example is provided of a specific implementation for a 1000 Base-T Gigabit Ethernet implementation that truncates the postcursor channel memory length to one.

A novel memory-partitioned survivor memory architecture for the survivor memory units in the survivor path cell is also disclosed. In order to prevent latency for the storage of the survivor symbols, which are required in the decision feedback unit or the multiplexer unit with zero latency, a hybrid survivor memory arrangement is disclosed for reduced state sequence estimation. In a reduced state sequence estimator implementation for a channel memory of length L, the survivor symbols corresponding to the L past decoding cycles are utilized (i) for intersymbol interference cancellation in the decision-feedback units of a conventional reduced state sequence estimator, and (ii) for the selection of branch metrics in the multiplexers in an reduced state sequence estimator according to the present invention. The present invention stores the survivors corresponding to the L past decoding cycles in a register exchange architecture (REA), and survivors corresponding to later decoding cycles are stored in a trace-back architecture (TBA) or register exchange architecture. Before symbols are moved from the register exchange architecture to the trace-back architecture, they are mapped to information bits to reduce the word size. In a 1000 Base-T implementation, the register exchange architecture is used for the entire survivor memory, as the latency introduced by the trace-back architecture in the second memory partition would lead to a violation of the tight latency budget specified for the receiver in the 1000 Base-T standard.

As previously indicated, the processing speed for reduced complexity sequence estimation techniques, such as reduced state sequence estimation, is limited by a recursive feedback loop. According to one feature of the present invention, the processing speed for such reduced state sequence estimation techniques is improved by precomputing the branch metrics in a look-ahead fashion. The precomputation of the branch metrics shortens the critical path, such that the delay is of the same order as in a traditional Viterbi decoder. According to another feature of the present invention, the computational load of the precomputations is significantly reduced for multi-dimensional trellis codes. Prefiltering can reduce the computational complexity by shortening the channel memory. The reduced state sequence estimation techniques of the present invention allow the implementation of reduced state sequence estimation for high-speed communications systems, such as the Gigabit Ethernet 1000 Base-T standard.

As previously indicated, reduced state sequence estimation techniques reduce the computational complexity of the Viterbi algorithm, when the reduced state sequence estimation techniques are used to equalize uncoded signals or jointly decode and equalize signals, which have been coded, using trellis-coded modulation. While the present invention is illustrated herein using decoding and equalization of trellis coded signals, the present invention also applies to the equalization of uncoded signals, as would be apparent to a person of ordinary skill in the art. Trellis-coded modulation is a combined coding and modulation scheme for band-limited channels. For a more detailed discussion of trellis-coded modulation, see, for example, G. Ungerboeck, “Trellis-Coded Modulation With Redundant Signal Sets,” IEEE Comm., Vol. 25, No. 2, 5-21 (February 1987), incorporated by reference herein.

As shown in _{n }consisting of m bits are fed into a trellis-coded modulation encoder **110**. The rate m′/(m′+1) encoder **110** operates on m′ input bits and produces m′+1 encoded bits, which are used to select one of the 2^{m′+1 }subsets (each of size 2^{m−m′}) from the employed signal constellation of size 2^{m+1}, while the uncoded bits are used to select one symbol a_{n }within the chosen subset. In the illustrative implementation, Z-level pulse amplitude modulation (Z-PAM) is used as the modulation scheme for the symbols a_{n}. The techniques of the present invention, however, can be applied to other modulation schemes such as PSK or QAM, as would be apparent to a person of ordinary skill in the art. The selected symbol a_{n }is sent over the equivalent discrete-time channel. Assuming a one-dimensional channel, the channel output z_{n }at time instant n is given by:

where q_{n }is the signal corrupted by intersymbol interference, {f_{i}}, i∈[0, . . . , L] are the coefficients of the equivalent discrete-time channel impulse response (f_{0}=1 is assumed without loss of generality), L is the length of the channel memory, and {w_{n}} represents white Gaussian noise with zero mean and variance σ^{2}.

The concatenation of the trellis coder and channel defines a combined code and channel state, which is given by

ξ_{n}=(μ_{n} *;a* _{n−L} *, . . . , a* _{n−1}), (2)

where μ_{n }is the code state and α_{n}=(a_{n−L}, . . . , a_{n−1}) is the channel state at time n. The optimum decoder for the received signal is the maximum likelihood sequence estimator that applies the Viterbi algorithm to the super trellis defined by the combined code and channel state. The computation and storage requirements of the Viterbi algorithm are proportional to the number of states. The number of states of the super trellis is given by:

*T=S×*2^{mL}, (3)

where s is the number of code states.

The Viterbi algorithm searches for the most likely data sequence by efficiently accumulating the path metrics for all states. The branch metric for a transition from state ξ_{n }under input a_{n }is given by:

Among all paths entering state ξ_{n+1 }from predecessor states {ξ_{n}}, the most likely path is chosen according to the following path metric calculation, which is commonly referred to as add-compare-select (ACS) calculation:

An implementation of the Viterbi algorithm is shown in **200** shown in **210**, an add-compare-select unit **220** and a survivor memory unit (SMU) **230**. The branch metric unit **210** calculates the metrics for the state transitions according to equation (4). The add compare-select unit (ACSU) **220** evaluates equation (5) for each state, and the survivor memory unit **230** keeps track of the surviving paths. The data flow in the branch metric unit **210** and survivor memory unit **230** is strictly feed-forward and can be pipelined at any level to increase throughput. The bottleneck for high-speed processing is the add-compare-select unit **220**, as the recursion in the add-compare-select operation in equation (5) demands that a decision is made before the next step of the trellis is decoded.

Reduced state sequence estimation techniques reduce the complexity of the maximum likelihood sequence estimator by truncating the channel memory such that only the first K of the L channel coefficients {f_{i}}, i∈[1, . . . , L], are taken into account for the trellis. See, A. Duel-Hallen and C. Heegard, “Delayed decision-feedback sequence estimation,” IEEE Trans. Commun., vol. 37, pp. 428-436, May 1989, incorporated by reference herein. In addition, the set partitioning principles described in P. R. Chevillat and E. Eleftheriou, “Decoding of Trellis-Encoded Signals in the Presence of Intersymbol Interference and Noise,” IEEE Trans. Comm., Vol. 37, 669-676 (July 1989) and M. V. Eyuboglu and S. U. Qureshi, “Reduced-State Sequence Estimation for Coded Modulation on Intersymbol Interference Channels,” IEEE JSAC, Vol. 7, 989-995 (August 1989), each incorporated by reference herein, are applied to the signal alphabet. The reduced combined channel and code state is given in reduced state sequence estimation by

ρ_{n}=(μ_{n} *;J* _{n−K} *, . . . ,J* _{n−1}), (6)

where J_{n−i }is the subset the data symbol a_{n−i }belongs to. The number of different subsets J_{n−i }is given by 2^{m} ^{ i }, where m_{i }defines the depth of subset partitioning at time instant n−i. It is required that

m′≦m_{K}≦m_{K−1}≦ . . . ≦m_{1}≦m. (7)

The number of states in the reduced super trellis is given as follows:

*R=S×*2^{m} ^{ K } ^{+ . . . +m} ^{ 1 }. (8)

In reduced state sequence estimation, the branch metric for reduced state ρ_{n }under input a_{n }takes the modified form:

λ_{n}(*z* _{n} *,a* _{n},ρ_{n})=(*z* _{n} *−a* _{n} *+u* _{n}(ρ_{n}))^{2}, (9)

where:

{circumflex over (α)}_{n}(ρ_{n})=(â_{n−L}(ρ_{n}), . . . , â_{n−1}(ρ_{n})) is the survivor sequence leading to the reduced state ρ_{n }and â_{n−i}(ρ_{n}) is the associated survivor symbol at time instant n−i. In equation (10), an intersymbol interference estimate u(ρ_{n}) is calculated for state ρ_{n }by taking the data symbols associated with the path history of state ρ_{n }as tentative decisions. The best path metric for state ρ_{n+1 }is obtained by evaluating

Reduced state sequence estimation can be viewed as a sub-optimum trellis decoding algorithm where each state uses decision-feedback from its own survivor path to account for the intersymbol interference not considered in the reduced trellis.

**340** calculate R intersymbol interference estimates by considering the survivors in the corresponding survivor path cell (SPC) of the survivor memory unit **330** according to equation (10). Each branch metric cell (BMC) in the branch metric unit **310** computes the metrics for the b=2^{m′} transitions leaving one state. For each state, the best path selection is performed in the add-compare-select cell (ACSC) according to equation (11). In contrast to Viterbi decoding, the decision-feedback cell, branch metric cell, and survivor path cells are in the critical loop in addition to the add-compare-select cell. The techniques for parallel processing of the Viterbi algorithm exploit the fact that the branch metric computation in equation (4) does not depend on the decision of the add-compare-select function in equation (5). Thus, branch metrics can be calculated for k trellis steps in a look-ahead fashion to obtain a k-fold increase of the throughput. Sees G. Fettweis and H. Meyr, “High-Speed Viterbi Processor: A Systolic Array Solution,” IEEE JSAC, Vol. 8, 1520-1534 (October 1990) or U.S. Pat. No. 5,042,036, incorporated by reference herein. However, for reduced state sequence estimation techniques, the branch metric computation in equation (9) depends on the decision of the add-compare-select cell in the add-compare-select unit **320**, which evaluates equation (11), in the previous symbol period, as the surviving symbols in the survivor path cell of the survivor memory unit **330** are needed for the decision-feedback computations in equation (10). Thus, the block processing techniques described in G. Fettweis and H. Meyr, referenced above, cannot be applied to speed up the processing of reduced state sequence estimation.

The critical path in reduced state sequence estimation involves more operations than in the Viterbi algorithm. In particular, the branch metric computations in the branch metric cell can be very expensive in terms of processing time, as euclidean distances have to be obtained by either squaring or performing a table-lookup to achieve good coding gain performance. Also, the evaluation of equation (10) in the decision-feedback cell **340**-*n *may have a significant contribution to the critical path. Precomputing all branch metrics for all possible symbol combinations in the channel memory in accordance with the present invention makes it possible to remove the branch metric unit **310** and decision-feedback unit **340** from the feedback loop. This potentially allows for a significant reduction of the critical path in reduced state sequence estimation.

In principle, the channel state α_{n}=(a_{n−L}, . . . , a_{n−1}) can take U=(2^{m+1})^{L }different values. The intersymbol interference estimates for a particular channel assignment {tilde over (α)}=(ã_{n−L}, . . . , ã_{n−1}) can be obtained by evaluating the following equation:

It is noted that equation (12) does not depend on the time n and is thus a constant for a particular channel assignment {tilde over (α)}. The speculative branch metric for a transition from channel assignment {tilde over (α)} under input a_{n }is then given by

{tilde over (λ)}_{n}(*z* _{n} *,a* _{n},{tilde over (α)})=(*z* _{n} *−a* _{n} *+ũ*({tilde over (α)}))^{2}. (13)

The trellis coder **100** in ^{m′+1 }different subsets. Assuming that in the case of parallel transitions the best representative in a subset is obtained by slicing, a maximum of M=2b×U=2^{m′+1}×2^{(m+1)L }different branch metrics {tilde over (λ)}_{n}(z_{n},a_{n},{tilde over (α)}) are possible and have to be precomputed. The trellis coder shown in _{n}. Therefore, the number of branch metrics which have to be precomputed might be less than M. The actual number of branch metrics which have to be precomputed should be determined from the reduced super trellis.

For the add-compare-select cell **320**-*n*, the appropriate branch metrics λ_{n }(z_{n}, a_{n}, ρ_{n}) among all precomputed branch metrics {tilde over (λ)}_{n}(z_{n},a_{n},{tilde over (α)}) are selected by using the survivor path {circumflex over (α)}_{n}(ρ_{n})

λ_{n}(*z* _{n} *,a* _{n} *,ρ* _{n})=*sel*{Λ_{n}(*z* _{n} *,a* _{n},ρ_{n}),{circumflex over (α)}_{n}(ρ_{n})}. (14)

In equation (14), Λ_{n}(z_{n},a_{n},ρ_{n}) is a vector containing the 2^{mL }branch metrics {circumflex over (λ)}_{n}(z_{n},a_{n},{circumflex over (α)}), which can occur for a transition from state ρ_{n }under input a_{n }for different channel assignments {tilde over (α)}. The selector function in equation (14) can be implemented with a 2^{mL }to 1 multiplexer.

It is noted that equations (12) and (13) are both independent from the decision in the recursive add-compare-select function in equation (11). Thus, the precomputations in equations (12) and (13) are strictly feed-forward and can be pipelined at any level. Only the selection function in equation (14) lies in the critical path in addition to the add-compare-select cell and survivor path cell.

The architecture of a reduced state sequence estimation **400** with precomputation of branch metrics in accordance with the present invention is shown in **420** calculates all U values which can occur for ũ({tilde over (α)}). Each of these U values is used by a corresponding look-ahead branch metric cell **410**-*n *to calculate 2b speculative branch metrics {tilde over (λ)}_{n}(z_{n},a_{n},{tilde over (α)}). All the M=2bU branch metrics precomputed in the look-ahead branch metrics unit **410** are then sent to the multiplexer unit (MUXU) **430**. Then, at the beginning of each decoding cycle, each multiplexer **430**-*n *in the multiplexer unit **430** selects the appropriate branch metrics based on the survivor symbols in the corresponding survivor path cell **450**-*n*, which are then sent to the add-compare-select unit **440**. Each multiplexer **430**-*n *in the multiplexer unit **430** takes L past symbols from the corresponding survivor path cell **450**-*n*. The add-compare-select unit **440** and survivor memory unit **450** may be embodied as in the conventional reduced state sequence estimation **300** of **410** is placed in a pipeline register **460**. The critical path now comprises of just the multiplexer **430**, add-compare-select cell **440**-*n*, and survivor path cell PC **450**-*n*. The multiplexer **430** selects a branch metric in accordance with equation (14) dependent on the symbols in the survivor path cell **450**-*n*. Although the number of precomputed branch metrics increases exponentially with the channel memory L and the number of information bits m, this technique is feasible for small m (corresponding to small symbol constellation sizes) and short L.

Significant coding gains for large signal constellations can be achieved with multidimensional trellis-coded modulation. _{n}=(a_{n,1}, . . . , a_{n,B}), where ā_{n }is a vector, is sent over the B-dimensional channel with the channel coefficients {f_{i,j}}, i∈[0, . . . , L], j∈[1 . . . , B] such that the channel output _{n}=(z_{n,1}, . . . , z_{n,B}), is a vector given as

where {w_{n,j}}, j∈[1, . . . ,B] are B uncorrelated independent white Gaussian noise sources. Z-PAM is considered as the transmission scheme for each channel. The following results are valid for other modulation schemes as well. Such an equivalent discrete time channel can be found for example in Gigabit Ethernet 1000 Base-T over copper, where B=4, m=8, m′=2, S=8, Z=5. See K. Azadet, “Gigabit Ethernet Over Unshielded Twisted Pair Cables,” Int'l Symposium on VLSI Technology, Systems, and Applications, Taipei (June 1999), incorporated by reference herein.

As the complexity for the precomputation of branch metrics grows exponentially with the number of information bits m, there might be cases where the precomputation of multi-dimensional branch metrics as shown in

The 1-dimensional branch metric in the dimension j is precomputed by evaluating the following expressions:

{tilde over (λ)}_{n,j}(*z* _{n,j} *,a* _{n,j},{tilde over (α)}_{j})=(*z* _{n,j} *−a* _{n,j} *+ũ* _{j}({tilde over (α)}_{j}))^{2}, (16)

where {tilde over (α)}_{j}=(ã_{n−L,j}, . . . ,ã_{n−1,j}) is a particular assignment for the channel state α_{j}=(a_{n−L,j}, . . . ,a_{n−1,j}) in dimension j.

There are V=Z^{L }possible 1-dimensional channel assignments {tilde over (α)}_{j}. For a given channel assignment {tilde over (α)}_{j}, C inputs a_{n,j }have to be considered to calculate all possible 1-dimensional branch metrics {tilde over (λ)}_{n,j}(z_{n,j},a_{n,j},{tilde over (α)}_{j}), where c, C≦Z is the number of 1-dimensional subsets. Each of these C inputs a_{n,j }corresponds to the point in the corresponding subset to which (z_{n,j}) has been sliced to after the cancellation of the intersymbol interference according to equations (16) and (17). Consequently, considering all B dimensions, a total N=B×C×V 1-dimensional branch metrics have to be precomputed. This can be considerably less than the number of precomputations necessary for multidimensional precomputations as discussed above in the section entitled “Precomputation of Branch Metrics.” In the case of the Gigabit Ethernet 1000 Base-T, with C=2 L=1, and Z=5 1-dimensional precomputation yields a total of 4×2×5=40 1-dimensional branch metric computations, whereas multidimensional precomputation results in 2^{3}×2^{9}=4096 4-dimensional branch metric computations.

The selection of the appropriate 1-dimensional branch metrics for further processing in reduced state sequence estimation is given by:

λ_{n,j}(*z* _{n,j} *,a* _{n,j},ρ_{n})=*sel{Λ* _{n,j}(z_{n,j} *,a* _{n,j}),{circumflex over (α)}_{n,j}(ρ_{n})} (18)

where Λ_{n,j}(z_{n,j},a_{n,j}) is the vector containing all V possible 1-dimensional branch metrics {tilde over (λ)}_{n,j}(z_{n,j},a_{n,j},{tilde over (α)}_{j}) under input a_{n,j }for different one-dimensional channel assignments {tilde over (α)}_{j }and {circumflex over (α)}_{n,j}(ρ_{n}) is the survivor sequence in dimension j leading to state ρ_{n}. This can be implemented using a V to 1 multiplexer compared to the 2^{mL }to 1 multiplexer needed for multi-dimensional precomputation (e.g., in the 1000 Base-T example above, 5 to 1 multiplexers are required c.f. to 256 to 1 MUXs). After the appropriate 1D branch metrics have been selected, the multidimensional branch metric is given as

**600** for 1-dimensional precomputation for multi-dimensional reduced state sequence estimation. Each 1D-ISIC **620**-*n *calculates the V intersymbol interference cancellation terms ũ_{j}({tilde over (α)}_{j}). For each of these ũ_{j}({tilde over (α)}_{j}), the corresponding 1D-LABMC **610**-*n *precomputes C one-dimensional branch metrics per channel assignment and dimension in the 1D-LABMU **610**. The multiplexer unit **630** selects for each state the appropriate one-dimensional branch metrics dependent on the survivor symbols in the SPC **660**-*n*. Each multi-dimensional branch metric cell **640**-*n *calculates the multi-dimensional branch metrics by using the selected 1-dimensional branch metrics. The critical path now comprises one multiplexer **630**, multi-dimensional branch metric cell **640**, add-compare-select cell **650** and survivor path cell **660**. The multi-dimensional branch metric cell **640** performs B−1 additions and consequently has a minor contribution to the overall critical path, as the number of dimensions B is typically low.

It has been shown that the complexity for the precomputation of branch metrics increases exponentially with the channel memory L. However, using the prefilter **710**, shown in **710** could be implemented as a linear filter, such as those described in D. D. Falconer and F. R. Magee, “Adaptive Channel Memory Truncation for Maximum-Likelihood Sequence Estimation,” The Bell Systems Technical Journal, Vol. 52, No. 9, 1541-62 (November 1973), incorporated by reference herein.

Thus, for channels with large channel memories where the precomputation of branch metrics is too expensive, a prefilter could be used to truncate the channel memory such that precomputation becomes feasible.

The following is an example of a specific implementation for a 1000 Base-T Gigabit Ethernet receiver. For a detailed discussion of the 1000 Base-T Gigabit Ethernet standard and related terminology and computations used herein, see, for example, M. Hatamian et al., “Design considerations for Gigabit Ethernet 1000 Base-T twisted pair transceivers,” Proc. CICC, Santa Clara, Calif., pp. 335-342, May 1998, incorporated by reference herein.

A decision-feedback prefilter for the 1000 Base-T Gigabit Ethernet implementation is shown in

Decision-Feedback Prefilter

A decision-feedback prefilter **800** that truncates the postcursor memory length on wire pair j from fourteen to one is shown in **800** resembles the structure of a decision-feedback equalizer (DFE) as it uses tentative decisions obtained by its own slicer to remove the tail of the postcursor channel impulse response.

Precomputation of 1D Branch Metrics

As the effective postcursor channel memory is one after the decision-feedback prefilter **800**, the computational complexity for look-ahead precomputations of 1D branch metrics on each wire pair is modest. The speculative 1D branch metric for wire pair j under the assumption that the channel memory contains ã_{n−1,j }is

{tilde over (λ)}_{n,j}(*y* _{n,j} *,a* _{n,j} *,ã* _{n−1,j})=(*y* _{n,j} *−a* _{n,j} *−f* _{1,j} *ã* _{n−1,j})^{2}. (20)

As there are 5 possible values for ã_{n,j}, and as y_{n,j }after removal of intersymbol interference has to be sliced to the closest representative of both 1D subsets A as well as B, a total of 10 1D branch metrics have to be precomputed per wire pair. This is shown in **910**-*n *calculate the difference to the closest point in 1D subset A or B. There is one clock cycle time for one addition, slicing, and squaring. It should be noted that the computational complexity of precomputing branch metrics increases exponentially with the channel memory. If the channel memory were two, 50 1D branch metrics would have to be precomputed per wire pair, and for a channel memory of three this number would increase to 250.

Selection of 1D Branch Metrics

The multiplexer unit **630** selects for each wire pair j and code state ρ_{n }the appropriate 1D branch metrics corresponding to subsets A and B based on the past survivor symbol â_{n−i,j}(ρ_{n}). This is done with 5:1 multiplexers **1010** as shown in

Computation of 4D Branch Metrics

The 4D-BMU **640** adds up the 1D branch metrics to calculate the 4D branch metrics corresponding to state transitions in the trellis. The 4D-BMU **640** is in the critical loop. Bringing the 4D-BMU **640** out of the critical loop by look-ahead precomputations of 4D branch metrics would be impractical in terms of computational complexity, as shown in the example discussed above in the section entitled “Precomputation of Multi-Dimensional Trellis Codes.” It can be easily seen that there are too many possibilities, which must be considered.

Add-Compare-Select

For each state, a 4-way add-compare-select has to be performed. To speed up the processing, the architecture proposed in P. J. Black and T. H. Meng, “A 140-Mb/s, 32-state, radix-4 Viterbi decoder,” IEEE JSSC, vol. 27, pp. 1877-1885, December 1992, has been chosen, where the minimum path metric among the 4 candidates is selected by 6 comparisons in parallel. State metric normalization is done using modulo arithmetic, See, A. P. Hekstra, “An Alternative To Metric Rescaling In Viterbi Decoders”, IEEE Trans. Commun., vol. 37, pp. 1220-1222, November 1989.

Survivor Memory

In Viterbi decoding, usually the trace-back architecture is the preferred architecture for the survivor memory as it has considerably less power consumption than the register exchange architecture. R. Cypher and C. B. Shung, “Generalized Trace-Back Techniques For Survivor Memory Management In The Viterbi Algorithm,” Journal of VLSI Signal Processing, vol. 5, pp. 85-94, 1993. However, as the trace-back architecture introduces latency it cannot be used to store the survivor symbols, which are required in the decision-feedback unit or multiplexer unit with zero latency. Thus, a hybrid survivor memory arrangement seems to be favorable for a reduced state sequence estimation implementation for a channel of memory length L. The survivors corresponding to the L past decoding cycles are stored in a register exchange architecture, and survivors corresponding to later decoding cycles in a trace-back architecture. Before symbols are moved from the register exchange architecture to the trace-back architecture, they are mapped to information bits to reduce the word size. However, in 1000 Base-T the register exchange architecture must be used for the entire survivor memory, as the latency introduced by the trace-back architecture would lead to a violation of the tight latency budget specified for the receiver in the 1000 Base-T standard. Likewise, symbols moved from the first register exchange architecture to the second register exchange architecture are mapped to information bits to reduce the word size.

The survivor memory architecture is shown in _{n}(ρ_{n}) denotes the decision for 4D subset SX for a transition from state ρ_{n }(for definition of 4D subsets see, Hatamian et al.), {circumflex over (b)}_{n−i}(ρ_{n}) are the 8 information bits which correspond to the 4D survivor symbol â_{n−i}(ρ_{n}) and d_{n}(1) is the 2-bit decision of the add-compare-select for state one. As the channel memory seen by the reduced state sequence estimation is one, only the first column stores 4D symbols, which are represented by 12 bits and are fed into the multiplexer unit. After this first column, the survivor symbols are mapped to information bits and then stored as 8 bits. For a merge depth of 14, this architecture needs 928 REGs compared to 1344 REGs in a survivor memory unit which does not apply the hybrid memory partition, where all decisions are stored as 12 bit 4D symbols.

It is to be understood that the embodiments and variations shown and described herein are merely illustrative of the principles of this invention and that various modifications may be implemented by those skilled in the art without departing from the scope and spirit of the invention.

Patent Citations

Cited Patent | Filing date | Publication date | Applicant | Title |
---|---|---|---|---|

US5136593 | Oct 30, 1989 | Aug 4, 1992 | Carnegie-Mellon University | Apparatus and method for fixed delay tree search |

US5220570 | Nov 30, 1990 | Jun 15, 1993 | The Board Of Trustees Of The Leland Stanford Junior University | Programmable viterbi signal processor |

US5537424 * | Aug 12, 1994 | Jul 16, 1996 | International Business Machines Corporation | Matched spectral null codes with partitioned systolic trellis structures |

US5802115 * | Aug 23, 1996 | Sep 1, 1998 | Sgs-Thomson Microelectronics S.A. | Convolution decoder using the Viterbi algorithm |

US5870433 | Dec 4, 1996 | Feb 9, 1999 | Ke Kommunikations-Eletronik Gmbh & Co. | Method of processing signals in a viterbi decoder according to delayed decision feedback sequence estimation (DDFSE) algorithm |

US5910968 | Feb 18, 1997 | Jun 8, 1999 | U.S. Philips Corporation | Continuous phase modulation digital communication system |

US5931966 | May 19, 1997 | Aug 3, 1999 | Carnegie Mellon University | Viterbi detector with a pipelined look-up table of squared errors |

US6035006 | Jun 30, 1997 | Mar 7, 2000 | Nec Corporation | Estimator having a feedback loop |

US6201831 | Nov 12, 1999 | Mar 13, 2001 | Broadcom Corporation | Demodulator for a multi-pair gigabit transceiver |

US6553541 * | Apr 5, 2000 | Apr 22, 2003 | Texas Instruments Incorporated | Reduced-complexity sequence detection |

US6651215 * | Dec 17, 1998 | Nov 18, 2003 | Sony Corporation | Viterbi decoding apparatus and viterbi decoding method |

US6738949 * | May 13, 1999 | May 18, 2004 | Matsushita Electric Industrial Co., Ltd. | Error correction circuit and error correction method |

US7363576 * | Sep 26, 2005 | Apr 22, 2008 | Agere Systems Inc. | Method and apparatus for pipelined joint equalization and decoding for gigabit communications |

Non-Patent Citations

Reference | ||
---|---|---|

1 | Bednarz et al., "Design, Performance, and Extensions of the RAM-DFE Architecture," IEEE Transactions on Magnetics, vol. 31, No. 2, 1196-1201 (Mar. 1995). | |

2 | Black et al., "A 140-Mb/s, 32-State, Radix-4 Viterbi Decoder," IEEE Journal of Solid-State Circuits, vol. 27, No. 12, Dec. 1992. | |

3 | Chevillat et al., "Decoding of Trellis-Encoded Signals in the Presence of Intersymbol Interference and Noise," IEEE Transactions on Communications, vol. 37, No. 7, Jul. 1989. | |

4 | Cypher et al. "Generalized Trace-Back Techniques for Survivor Memory Management in the Viterbi Algorithm*," Journal of VLSI Signal Processing, 5, 85-94(1993). | |

5 | Erich F. Haratsch, "High-Speed VLSI Implementation of Reduced Complexity Sequence Estimation Algorithms with Application to Gigabit Ethernet 1000Base-T", International Symposium on VLSI Technology, Systems, and Applications, pp. 171-174, Jun. 1999. | |

6 | Erich F. Haratsch, "High-Speed VLSI Implementation of Reduced Complexity Sequence Estimation Algorithms with Application to Gigabit Ethernet 1000Base-T," Bell Laboratories, Lucent Technologies, Holmdel, NJ, USA. | |

7 | Fettweis et al., "High-Speed Parallel Viterbi Decoding: Algorithm and VLSI-Architecture," IEEE Communications Magazine, May 1991. | |

8 | K. Azadet, "Gigabit Ethernet over Unshielded Twisted Pair Cables", International Symposium on VLSI Technology, Systems, and Applications, pp. 161-17, Jun. 1999. | |

9 | K. Azadet, "Gigabit Ethernet over Unshielded Twisted Pair Cables," Bell Laboratories, Lucent Technologies, Holmdel, NJ, USA. | |

10 | Keshab K. Parhi, "Pipelining in Algorithms with Quantizer Loops," IEEE Transactions on Circuits and Systems, vol. 38. No. 7, 745-754 (Jul. 1991). | |

11 | Rizos et al., "Reduced-Complexity Sequence Detection Approaches for PR-Shaped, Coded Linear Modulations," IEEE Global Telecommunications Conference, vol. 1, 342-346 (Nov. 1997). |

Referenced by

Citing Patent | Filing date | Publication date | Applicant | Title |
---|---|---|---|---|

US20090193321 * | Jun 26, 2008 | Jul 30, 2009 | Samsung Electronics Co., Ltd. | Viterbi decoder and viterbi decoding method |

Classifications

U.S. Classification | 375/262, 714/796, 375/341, 711/100, 375/265, 714/795 |

International Classification | H04L23/02, G06F11/10, H03M13/41, H03M13/39, H04L5/12, H04L27/01, H04L25/03 |

Cooperative Classification | H04L25/03299, H04L25/03197, H04L25/03235 |

European Classification | H04L25/03B7A3 |

Legal Events

Date | Code | Event | Description |
---|---|---|---|

Jan 12, 2009 | AS | Assignment | Owner name: ALCATEL-LUCENT USA INC., NEW JERSEY Free format text: MERGER;ASSIGNOR:LUCENT TECHNOLOGIES INC.;REEL/FRAME:022088/0352 Effective date: 20081101 |

Aug 28, 2012 | FPAY | Fee payment | Year of fee payment: 4 |

Mar 7, 2013 | AS | Assignment | Owner name: CREDIT SUISSE AG, NEW YORK Effective date: 20130130 Free format text: SECURITY INTEREST;ASSIGNOR:ALCATEL-LUCENT USA INC.;REEL/FRAME:030510/0627 |

Oct 9, 2014 | AS | Assignment | Owner name: ALCATEL-LUCENT USA INC., NEW JERSEY Effective date: 20140819 Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:CREDIT SUISSE AG;REEL/FRAME:033949/0531 |

Rotate