# US 2020/0287560 A1 · Digital resolution enhancement for high speed digital-to-analog converters

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

- Number: US 2020/0287560 A1
- Document ID: US20200287560A1
- Status: Published application
- Kind: A1
- Application number: 16/759,881
- Filed: 2018-11-01
- Published: 2020-09-10
- Earliest claimed: 2017-11-02
- Assignees: B. G. Negev Technologies and Applications Ltd., At Ben-Gurion University
- Applicants: B. G. Negev Technologies and Applications Ltd., At Ben-Gurion University
- Inventors: Yaron Yoffe; Dan Sadot
- Web page: https://patentgrep.com/patent/US20200287560A1

## CPC

- H03M 1/661: {Improving the reconstruction of the analogue output signal beyond the resolution of the digital input signal, e.g. by interpolation, by curve-fitting, by smoothing}
- H03M 1/0626: {by filtering}
- H04B 1/0475: {with means for limiting noise, interference or distortion (H04B1/0483 takes precedence)}
- H04B 2001/0425: {with linearisation using predistortion}
- 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)
- H04B: TRANSMISSION

## Abstract

A method for increasing the effective resolution of digital-to-analog conversion for the purpose of digital pre-distortion to compensate distortions of a communication channel, according to which a digital sequence of N samples x(n) to be transmitted over the communication channel are received and several quantization possibilities are generated by performing Soft Quantization (SQ) on each sample, using a soft quantizer, where low computational complexity is maintained by limiting the number of SQ possibilities. The Instantaneous costs for each possible SQ error is computed and converging paths in the Trellis diagram, which represents possible states and transitions between them, for each sample is eliminated. Then the averaged errors for each remaining path are computed and Hard-Quantization is performed to eliminate converging paths and to keep a constant number of states. These steps are repeated N times, one time for each sample and the optimal path with the lowest averaged error selecting. Then the sequence associated with the optimal path is fed into the DAC.

## Claims

### Claim 1

A method for increasing the effective resolution of digital-to-analog conversion for the purpose of digital pre-distortion to compensate distortions of a communication channel, comprising:
a) receiving a digital sequence of N samples x(n) to be transmitted over said communication channel;
b) generating several quantization possibilities by performing Soft Quantization (SQ) on each sample, using a soft quantizer;
c) maintaining low computational complexity by limiting the number of SQ possibilities;
d) computing the instantaneous costs for each possible SQ error by a path metric block;
e) for each sample, eliminating converging paths in the Trellis diagram, which represents possible states and transitions between them, for each sample;
f) computing the averaged errors for each remaining path;
g) performing Hard-Quantization to eliminate converging paths and to keep a constant number of states;
h) repeating steps b) to g) above N times, one time for each sample;
i) selecting the optimal path having the lowest averaged error; and
j) feeding the sequence associated with said optimal path into said DAC.

### Claim 2 (depends on 1)

A method according to claim 1, wherein elimination is performed by using a Viterbi algorithm.

### Claim 3 (depends on 1)

A method according to claim 1, wherein elimination is performed by using Maximum-Likelihood Sequence-Estimation (MLSE).

### Claim 4 (depends on 1)

A method according to claim 1, wherein the complexity is reduced by using channel shortening filters that reduce the number of channel taps.

### Claim 5 (depends on 1)

A method according to claim 1, wherein the quantization noise is shaped to be inversely related to the channel response.

### Claim 6 (depends on 1)

A method according to claim 1, wherein the quantization noise is centered at the far ends of the spectrum.

### Claim 7 (depends on 1)

A method according to claim 1, wherein the communication channel is an optical communication channel.

### Claim 8 (depends on 1)

A method according to claim 1, wherein the communication channel is selected from one or more of the following:
an ADSL communication channel;
a wireless communication channel;
a cellular communication channel;
a WiFi channel.

### Claim 9 (depends on 1)

A method according to claim 1, wherein feeding the sequence associated with the optimal path into the DAC reduces the quantization noise associated with said DAC, at the output of the communication channel.

### Claim 10 (depends on 9)

A method according to claim 9, wherein feeding the sequence associated with the optimal path into a DAC with lower resolution maintains the quantization noise at the output of the communication channel.

### Claim 11

Apparatus for compensating communication channel distortions by dynamic pre-distortion of Digital-to Analog conversion performed by a DAC before transmission over said communication channel, comprising:
a) a DSP circuit, adapted to generate a digital sequence of N samples x(n) to be transmitted over said communication channel;
b) a soft quantizer for generating several quantization possibilities by performing Soft Quantization (SQ) on each sample,
said DSP circuit is further adapted to:
maintain low computational complexity by limiting the number of SQ possibilities;
compute the instantaneous costs for each possible SQ error by a path metric block in said DSP circuit;
eliminate converging paths in the Trellis diagram, which represents possible states and transitions between them for each sample;
compute the averaged errors for each remaining path;
eliminate converging paths, to keep a constant number of states;
repeat the preceding steps N times, one time for each sample;
select the optimal path having the lowest averaged error; and
feed the sequence associated with said optimal path into said DAC.
