# US 5,710,790 A · Communication arrangement with improved echo and noise suppression in a channel containing quantization

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 5,710,790 A
- Document ID: US5710790A
- Status: Granted
- Kind: A
- Application number: 08/384,498
- Filed: 1995-02-01
- Granted: 1998-01-20
- Earliest claimed: 1995-02-01
- Assignees: Lucent Technologies Inc.
- Inventors: Hanan Herzberg; Burton Reuben Saltzberg
- Web page: https://patentgrep.com/patent/US5710790A

## CPC

- H04B 3/23: using a replica of transmitted signal in the time domain, e.g. echo cancellers
- H03M 1/0854: {of quantisation noise}
- H03M 13/35: Unequal or adaptive error protection, e.g. by providing a different level of protection according to significance of source information or by adapting the coding according to the change of transmission channel characteristics
- H04L 1/004: {by using forward error control (H04L1/0618 takes precedence; coding, decoding or code conversion, for error detection or correction H03M13/00)}
- H04L 25/03343: {Arrangements at the transmitter end}
- H04L 25/4927: {using levels matched to the quantisation levels of the channel}
- H03M 1/12: Analogue/digital converters ({H03M1/001 – } H03M1/10 take precedence)
- H03M 1/66: Digital/analogue converters ({H03M1/001 – } H03M1/10 take precedence)
- H04B: TRANSMISSION
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A modem that matches itself to a central office codec to which it is connected and incorporates encoding of the data. An echo canceller following the central office codec subtracts an estimate of the echo introduced in the central offices. More particularly, digital data applied to the modem is multi-level encoded and mapped onto a subset of the levels recognized by the central office codec. In an illustrative embodiment, the multi-level encoding encodes the two least significant bits in the binary representation of the levels delivered by the modem. The least significant bit is encoded with a code that is more robust than the code of the next-to-least significant bit, in recognition of the fact that errors in the least significant bit are much more likely. The corresponding echo canceller in the network first estimates the echo and subtracts it from the signal applied to the digital network by the central office. Thereafter, a decoder decodes the received signal in stages. In the first stage, the least significant bit of symbols is identified based on a first error correcting code. In the second stage the remaining bits of the symbols are determined, with the aid of a second error correcting code and the results of the first stage. Block or convolutional encoding can be used.

## Claims

### Claim 1

Communication apparatus including a level selector for developing analog levels in response to digitized symbols, and means responsive to said analog levels for communicating signals to a remote quantizer, where levels of the signals communicating to the remote quantizer are set to correspond to quantization levels of the remote quantizer, the improvement comprising:
an encoder responsive to an applied digital signal for developing said digitized symbols, where said digitized symbols comport with a preselected error correcting code.

### Claim 2 (depends on 1)

The apparatus of claim 1 further comprising means, responsive to signals derived from said quantizer for adjusting signals levels developed by said level selector.

### Claim 3 (depends on 1)

The apparatus of claim 1 wherein said error correcting code is a block code.

### Claim 4 (depends on 3)

The apparatus of claim 3 where a sequence of symbols is developed from a contiguous block of bits of said applied digital signal.

### Claim 5 (depends on 1)

The apparatus of claim 1 wherein said error correcting code is a convolutional code.

### Claim 6 (depends on 1)

The apparatus of claim 1 wherein said encoder comprises a mapper which, in response to every A bits of said applied signal that are applied to the mapper develops B sets of bits, where each set of bits contains C bits which comprise the most significant bits of the symbols, where A, B, and C are integers.

### Claim 7 (depends on 6)

The apparatus of claim 6 where the mapper is a fractional bit rate mapper.

### Claim 8 (depends on 6)

The apparatus of claim 6 where A/B is a mixed fraction.

### Claim 9 (depends on 6)

The apparatus of claim 6 further comprising coding means responsive to bits of said applied signal for developing bits which comprise the least significant bits of said symbols and which contain redundancy adapted to enable error correction.

### Claim 10 (depends on 6)

The apparatus of claim 6 further comprising:
first coding means responsive to bits of said applied signal for developing the least significant bits of said symbols; and
second coding means responsive to bits of said applied signal for developing the next to least significant bits of said symbols.

### Claim 11 (depends on 6)

The apparatus of claim 6 further comprising:
first coding means responsive to bits of said applied signal for developing the least significant bits of said symbols, where said least significant bits of said symbols comport with a first preselected error correcting code; and
second coding means responsive to bits of said applied signal for developing the next to least significant bit of said symbols, where said next to least significant bits of said symbols comport with a second preselected error correcting code.

### Claim 12 (depends on 11)

The apparatus of claim 11 where said first preselected error correcting code is different from said second preselected error correcting code.

### Claim 13 (depends on 11)

The apparatus of claim 11 where said first preselected error correcting code is more capable at correcting errors than said second preselected error correcting code.

### Claim 14 (depends on 6)

The apparatus of claim 6 further comprising:
first coding means responsive to bits of said applied signal for developing groups of bits comprising the least significant bits of said symbols, where said least significant bits of said symbols comport with a first preselected error correcting code; and
second coding means responsive to bits of said applied signal for developing middle groups of bits comprising the bits of said symbols that are between said least significant bits of said symbols and said most significant bits of said symbols, where said middle groups of bits of said symbols comport with a second preselected error correcting code.

### Claim 15 (depends on 6)

The apparatus of claim 6 further comprising:
first coding means responsive to bits of said applied signal for developing groups D of bits, where said groups D comport with a first preselected error correcting code; and
second coding means responsive to bits of said applied signal for developing groups E of bits, where said middle groups of bits of said symbols comport with a second preselected error correcting code;
where each of said symbols is a concatenation of the C bits from the mapper and the bits from groups E, and D, in order, where the C bits of the mapper comprise the most significant bits of each symbol.

### Claim 16 (depends on 6)

The apparatus of claim 6 further comprising:
first coding means responsive to bits of said applied signal for developing groups D of bits, where said groups D comport with a first preselected error correcting code; and
second coding means responsive to bits of said applied signal for developing groups E of bits, where said middle groups of bits of said symbols comport with a second preselected error correcting code;
means for developing groups F from preselected bits of said applied signal; and
means for forming symbols from said groups D, E, and F, and the C bits from the mapper, where each of said symbols is a concatenation of the C bits from the mapper and the bits from groups F, E, and D, in order, where the C bits of the mapper comprise the most significant bits of each symbol.

### Claim 17 (depends on 1)

The apparatus of claim 1 where said encoder comprises a fractional bit rate mapper and coding means and where, according to a preselected routing schema, some bits of said applied digital signal are applied to said fractional bit rate mapper to develop sets A of bits, and some bits of said applied digital signal are applied to said coding means to develop sets B of bits, where sets A of bits and sets B of bits combine to drive the level selector.

### Claim 18 (depends on 17)

The apparatus of claim 17 where said coding means performs multi-level coding.

### Claim 19 (depends on 17)

The apparatus of claim 17 where
said coding means performs multi-level coding to create sets B of bits,
each set B comprises two subsets, and
one of the subsets comports with a first preselected error correction code, and the other of the subsets is unencoded.

### Claim 20 (depends on 17)

The apparatus of claim 17 where
said coding means performs multi-level coding to create sets B of bits,
each set B comprises two subsets, and
one of the subsets comports with a first preselected error correction code, and the other of the subsets comports with a second preselected error correction code.

### Claim 21 (depends on 20)

The apparatus of claim 20 where said first preselected error correction code is a block code, and said second preselected error correction code is a parity code.

### Claim 22 (depends on 20)

The apparatus of claim 20 where said first preselected error correction code is a convolution code, and said second preselected error correction code is a parity code.

### Claim 23 (depends on 20)

The apparatus of claim 20 where said first preselected error correction code is a convolution code, and said second preselected error correction code is a block code.

### Claim 24 (depends on 17)

The apparatus of claim 17 where
said coding means performs multi-level coding to create sets B of bits,
each set B comprises three subsets, and
one of the subsets comports with a first preselected error correction code, another of the subsets comports with a second preselected error correction code, and a third of the subsets is uncoded.

### Claim 25

Decoding apparatus for developing a stream of output symbols comprising:
means for receiving a stream of received symbol levels that is related to a stream of transmitted symbols;
means for subtracting interference estimate levels from said stream of received symbol levels to develop subtractor output symbol levels, and
a decoder responsive to said means for subtracting, having
a first stage that identifies the most likely sequence of transmitted symbols corresponding to said stream of received symbols based on a first error correcting code associated with a first set of bits of a label related to the subtractor output symbol levels, and
a second stage responsive to the first stage and employing a second error correcting code associated with second set of bits of a label related to the subtractor output symbol levels, for developing said stream of output symbols that corresponds to the most likely sequence of transmitted symbols.

### Claim 26 (depends on 25)

The decoding apparatus of claim 25 where the first stage identifies the most likely sequence of transmitted symbols with the aid of metrics that are related to the distance between said subtractor output symbol levels and preselected thresholds.

### Claim 27 (depends on 25)

The decoding apparatus of claim 25 where the first error correcting code is a block code.

### Claim 28 (depends on 25)

The decoding apparatus of claim 25 where the first error correcting code is a convolutional code.

### Claim 29 (depends on 25)

The decoding apparatus of claim 25 where the first error correcting code is more robust than the second error correcting code.

### Claim 30 (depends on 25)

The decoding apparatus of claim 25 where the second error correcting code is a parity code.

### Claim 31 (depends on 25)

The apparatus of claim 25 where the first set of decoded bits is the least significant bit.

### Claim 32 (depends on 25)

The apparatus of claim 25 where the first set of decoded bits is the least significant bit and the second set of bits the next to least significant bit.

### Claim 33 (depends on 25)

The apparatus of claim 25 where the first stage determines the first set of bits of each symbol in said stream of output symbols, and the second stages determines remaining bits of each symbol in said stream of output symbols.