Multi-pair transceiver decoder system with low computation slicer
First Claim
1. A symbol decoder included in a receiver configured to receive information encoded in accordance with a multi-level symbolic scheme and over a multi-dimensional transmission channel, the symbol decoder comprising:
- an input, coupled to receive an input signal;
a first slicer, coupled to detect the input signal with respect to a first one of two disjoint one-dimensional symbol-subsets; and
a second slicer, coupled to detect the input signal with respect to a second one of the two disjoint one-dimensional symbol-subsets;
wherein the first slicer outputs a first decision term and a first error term with respect to the first one of the two disjoint one-dimensional symbol-subsets, the second slicer outputting a second decision term and a second error term with respect to the second one of the two disjoint one-dimensional symbol-subsets; and
wherein each of the first and second error terms is expressed by a digital representation having substantially fewer bits than the input signal.
8 Assignments
0 Petitions
Accused Products
Abstract
A method and a system for decoding information signals encoded by a multi-state encoding architecture 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 detected in a symbol decoder, implemented using 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 symbol decoder is implemented as a pair of slicers, each detecting an input signal with respect to one of two disjoint symbol-subsets. A third slicer detects the input with respect to the union of the two disjoint symbol-subsets. Decisions from the first, second and third slicers are processed to define 1D square error terms expressed in Hamming metrics. Reduced bit count error terms allow follow-on error processing to be performed with a minimum of computational complexity. The 1D errors are combined 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.
104 Citations
26 Claims
-
1. A symbol decoder included in a receiver configured to receive information encoded in accordance with a multi-level symbolic scheme and over a multi-dimensional transmission channel, the symbol decoder comprising:
-
an input, coupled to receive an input signal;
a first slicer, coupled to detect the input signal with respect to a first one of two disjoint one-dimensional symbol-subsets; and
a second slicer, coupled to detect the input signal with respect to a second one of the two disjoint one-dimensional symbol-subsets;
wherein the first slicer outputs a first decision term and a first error term with respect to the first one of the two disjoint one-dimensional symbol-subsets, the second slicer outputting a second decision term and a second error term with respect to the second one of the two disjoint one-dimensional symbol-subsets; and
wherein each of the first and second error terms is expressed by a digital representation having substantially fewer bits than the input signal. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. A symbol decoder included in a receiver configured to receive information encoded in accordance with a multi-level symbolic scheme and over a multi-dimensional transmission channel, the symbol decoder comprising:
-
an input to receive an input signal;
a first slicer coupled to the input, the first slicer detecting the input signal with respect to a first one of two disjoint one-dimensional symbol-subsets;
a second slicer coupled to the input, the second slicer detecting the input signal with respect to a second one of the two disjoint one-dimensional symbol-subsets; and
a third slicer coupled to detect the input signal with respect to a union set of the two disjoint one-dimensional symbol-subsets. - View Dependent Claims (8, 9, 10, 11, 12, 13, 14, 15, 16)
wherein the first slicer outputs a first decision with respect to the first one of the two disjoint one-dimensional symbol-subsets; wherein the second slicer ouputs a second decision with respect to the second one of the two disjoint one-dimensional symbol-subsets; and
wherein the third slicer outputs a third decision with respect to the union set of the two disjoint one-dimensional symbol-subsets.
-
-
9. The symbol decoder according to claim 8 further comprising:
-
a first combination logic block configured to combine the first decision with the third decision, the first combination logic block defining a first error term; and
a second combination logic block configured to combine the second decision with the third decision, the second combination logic block defining a second error term.
-
-
10. The symbol decoder according to claim 9 further comprising:
-
a first square error generation block configured to operate on the first error term so as to define a square error representation thereof; and
a second square error generation block configured to operate on the second error term so as to define a square error representation thereof.
-
-
11. The symbol decoder according to claim 10, wherein each of the first and second combination logic blocks is implemented using a look-up table, the combination operation and error term definition being performed by consulting an appropriate entry in the look-up table.
-
12. The symbol decoder according to claim 11, wherein each the first and second square error generation blocks is implemented using a look-up table, the square error definition being performed by consulting an appropriate entry in the look-up table.
-
13. The symbol decoder according to claim 11, wherein the look-up table is implemented in a read-only-memory storage device.
-
14. The symbol decoder according to claim 11, wherein the look-up table is implemented as a random logic integrated circuit.
-
15. The symbol decoder according to claim 11, wherein the look-up table is implemented as a programmable-logic-array integrated circuit.
-
16. The symbol decoder according to claim 11, wherein each of the error terms is expressed as a digital representation having one bit.
-
17. A method for symbol decoding in a receiver configured to receive information encoded in accordance with a multi-level symbolic scheme and over a multi-dimensional transmission channel, the method comprising:
-
providing an input for receiving an input signal;
detecting the input signal with respect to a first one of two disjoint one-dimensional symbol-subsets in a first slicer;
detecting the input signal with respect to a second one of the two disjoint one-dimensional symbol-subsets in a second slicer; and
detecting the input signal with respect to a union set of the two disjoint one-dimensional symbol-subsets in a third slicer. - View Dependent Claims (18, 19, 20, 21, 22, 23, 24, 25, 26)
producing from the first slicer a first decision with respect to the first one of the two disjoint one-dimensional symbol-subsets;
producing from the second slicer a second decision with respect to the second one of the two disjoint one-dimensional symbol-subsets; and
producing from the third slicer a third decision with respect to the union set of the two disjoint symbol-subsets.
-
-
19. The method according to claim 18, further comprising:
-
combining the first decision with the third decision in a first combination block so as to define a first error term; and
combining the second decision with the third decision in a second combination block so as to define a second error term.
-
-
20. The method according to claim 19, further comprising:
-
operating on the first error term so as to define a square error representation thereof in a first square error block; and
operating on the second error term so as to define a square error representation thereof in a second square error block.
-
-
21. The method according to claim 20, wherein each of the first and second combination blocks is implemented using a look-up table, the combination operation and error term definition being performed by consulting an appropriate entry in the look-up table.
-
22. The method according to claim 21, wherein each of the first and second square error blocks is implemented using a look-up table, the square error definition being performed by consulting an appropriate entry in the look-up table.
-
23. The method according to claim 21, wherein the look-up table is implemented in a read-only-memory storage device.
-
24. The method according to claim 21, wherein the look-up table is implemented as a random logic integrated circuit.
-
25. The method according to claim 21, wherein the look-up table is implemented as a programmable-logic-array integrated circuit.
-
26. The method according to claim 21, wherein each of the first and second error terms is expressed as a digital representation having one bit.
Specification