System and method for trellis decoding in a multi-pair transceiver system
First Claim
1. A method for computing a distance of a received data word from a codeword, the codeword being a concatenation of L symbols selected from two disjoint symbol subsets X and Y, the codeword being included in one of a plurality of code-subsets, the received data word being represented by L inputs, each of the L inputs uniquely corresponding to one of L dimensions, the method comprising the operations of:
- (a) producing a set of one-dimensional decisions and a corresponding set of one-dimensdional errors from the L inputs, each of the one-dimensional errors representing a distance metric between one of the L inputs and a symbol in one of the two disjoint symbol-subsets; and
(b) combining the one-dimensional decisions with the one-dimensional errors to produce a set of L-dimensional decisions and a corresponding set of L-dimensional errors such that each of the L-dimensional errors is a distance of the received data word from a nearest codeword in one of the code-subsets.
6 Assignments
0 Petitions
Accused Products
Abstract
A method and a system for decoding information signals encoded in accordance with a multi-state encoding scheme and transmitted over a multi-dimensional transmission channel by computing a distance of a received word from a codeword. One-dimensional (1D) input signals are processed in a pair of symbol decoders, implemented as look-up tables, to produce a pair of 1D errors, with each representing a distance metric between the input signal and a symbol in one of two disjoint symbol-subsets. The 1D errors are combined based on the multi-state encoding scheme in order to produce a set of multi-dimensional error terms. Each of the multi-dimensional error terms corresponds to a distance between a received word and a nearest codeword.
29 Citations
37 Claims
-
1. A method for computing a distance of a received data word from a codeword, the codeword being a concatenation of L symbols selected from two disjoint symbol subsets X and Y, the codeword being included in one of a plurality of code-subsets, the received data word being represented by L inputs, each of the L inputs uniquely corresponding to one of L dimensions, the method comprising the operations of:
-
(a) producing a set of one-dimensional decisions and a corresponding set of one-dimensdional errors from the L inputs, each of the one-dimensional errors representing a distance metric between one of the L inputs and a symbol in one of the two disjoint symbol-subsets; and (b) combining the one-dimensional decisions with the one-dimensional errors to produce a set of L-dimensional decisions and a corresponding set of L-dimensional errors such that each of the L-dimensional errors is a distance of the received data word from a nearest codeword in one of the code-subsets. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18)
-
-
19. A system for computing a distance of a received data word from a codeword, the codeword being a concatenation of L symbols selected from two disjoint symbol-subsets X and Y, the codeword being included in one of a plurality of code-subsets, the received data word being represented by L inputs, each of the L inputs uniquely corresponding to one of L dimensions, the system comprising:
-
(a) a set of slicers for producing a set of one-dimensional decisions and a corresponding set of one-dimensional errors from the L inputs, each of the one-dimensional errors representing a distance metric between one of the L_inputs and a symbol in one of the two disjoint symbol-subsets; and (b) a combining module for combining the one-dimensional decisions with the one-dimensional errors to produce a set of L-dimensional errors such that each of the L-dimensional errors is a distance of the received data word from a nearest codeword in one of the code-subsets. - View Dependent Claims (20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37)
-
Specification