# US 2025/0055733 A1 · Receiver, transceiver system and associated receiving method

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

- Number: US 2025/0055733 A1
- Document ID: US20250055733A1
- Status: Published application
- Kind: A1
- Application number: 18/719,573
- Filed: 2022-12-13
- Published: 2025-02-13
- Earliest claimed: 2021-12-17
- Assignees: Institut Mines-Telecom
- Applicants: Institut Mines Telecom
- Inventors: Raphaël LE BIDAN
- Web page: https://patentgrep.com/patent/US20250055733A1

## CPC

- H04L 25/03038: {with a non-recursive structure (H04L25/03031 takes precedence)}
- H04L 25/03057: {with a recursive structure (H04L25/03031 takes precedence)}
- H04L 2025/03636: {Algorithms using least mean square [LMS]}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

The receiver includes a sampler designed to provide one or more samples (yn) per received symbol, the symbols belonging to a predefined alphabet; an equalizer designed to compute, for each received symbol, an estimate (zn) of this symbol based on a linear combination (y′n) of the samples (yn) for this symbol; and a decision module designed to determine the symbol of the alphabet closest to the estimate (zn) as detected symbol. The alphabet exhibits a decentering such that the transmitted symbols have a non-zero predefined expectation, and the equalizer is designed to add a non-zero scalar component (θ) to the linear combination (y′n) in order to compensate at least partially for the decentering.

## Claims

### Claim 1

A digital data receiver comprising:
a sampler designed to sample a received signal (r(t)) that has propagated in a propagation channel, successive symbols (sn) being encoded in this received signal (r(t)), in order to provide one or more samples (yn) per received symbol (sn), the symbols (sn) belonging to a predefined alphabet (Ω);
an equalizer designed to compute, for each received symbol (sn), an estimate (zn) of this symbol (sn) based on a linear combination (y′n) of the samples (yn) for this symbol (sn); and
a decision module designed to determine the symbol of the alphabet (Ω) closest to the estimate (zn) as detected symbol (ŝn);
wherein the alphabet (Ω) exhibits a decentering such that the transmitted symbols (sn) have a non-zero predefined expectation ([sn]), and in that the equalizer is designed to add a non-zero scalar component (θ) to the linear combination (y′n) in order to compensate at least partially for the decentering; the equalizer being designed to iteratively (B1, B2) update the scalar component (θ) on the basis of symbols previously determined by the decision module.

### Claim 2 (depends on 1)

The receiver as claimed in claim 1, wherein the equalizer is designed to compute the scalar component (θ) based on coefficients (pH) of the linear combination (y′n) of the samples (yn) and the predefined expectation ([sn]).

### Claim 3 (depends on 2)

The receiver as claimed in claim 2, wherein the equalizer is designed to compute the scalar component (θ) based on a channel matrix (H) representative of the propagation channel.

### Claim 4 (depends on 3)

The receiver as claimed in claim 3, wherein said channel matrix (H) is a block Toeplitz matrix.

### Claim 5 (depends on 1)

The receiver as claimed in claim 1, wherein the equalizer is designed to compute said scalar component (θ) so as to minimize a mean squared error between the transmitted symbols (sn) and the estimates (zn).

### Claim 6 (depends on 1)

The receiver as claimed in claim 1, wherein the equalizer comprises a feedforward filter, preferably a finite impulse response filter, and the equalizer is designed to apply this feedforward filter to the samples (yn) in order to provide said linear combination (y′n).

### Claim 7 (depends on 1)

The receiver as claimed in claim 1, wherein the equalizer is designed to compute, for each received symbol (sn), the estimate (zn) of this symbol (sn) independently of previously detected symbols.

### Claim 8 (depends on 1)

The receiver as claimed in claim 1, wherein the equalizer is designed to compute, for each received symbol (sn), the estimate (zn) of this symbol (sn) based on a difference (d) between the linear combination (y′n) of the samples (yn) for this symbol (sn) and a linear combination (ŝ′) of previously detected symbols (ŝn−1, . . . , ŝn-Δ), the scalar component (θ) being added to this difference (d)).

### Claim 9 (depends on 8)

The receiver as claimed in claim 8, wherein the equalizer furthermore comprises what is referred to as a backward filter, preferably a finite impulse response filter, and the equalizer is designed to apply this backward filter to the previously detected symbols (ŝn−1, . . . , ŝn-Δ) so as to provide said linear combination (ŝ′) of previously detected symbols (ŝn−1, . . . , ŝn-Δ))).

### Claim 10 (depends on 6)

The receiver as claimed in claim 6, wherein the equalizer is designed to compute the scalar component (Θ) based on the feedforward filter.

### Claim 11 (depends on 9)

The receiver as claimed in claim 9, wherein the equalizer is designed to compute the scalar component (Θ) based on the backward filter as well.

### Claim 12 (depends on 1)

The receiver as claimed in claim 1, wherein the equalizer is configured to compute the scalar component (θ) using the following recurrence relation:
Θ
n
+
1
=
Θ
n
-
μ
2
⁢
e
n
[
Math
⁢
12
]
where en=zn−sn-Δ denotes the difference (or error) between the estimate zn and the symbol sn-Δ transmitted with a delay Δ for a symbol period Tn; μ2 denotes an adaptation step, preferably less than 1, for the adaptation of the scalar component θ.

### Claim 13 (depends on 1)

A digital communication system, comprising a transmitter designed to transmit symbols selected from an alphabet (Ω) with a non-zero expectation, and a receiver as claimed in claim 1.

### Claim 14

A method for receiving digital data, comprising:
for each of multiple successive symbols (sn) encoded in a received signal that has propagated in a propagation channel, the symbols (sn) belonging to a predefined alphabet (Ω), receiving multiple samples (yn);
carrying out a linear equalization by computing, for each received symbol (sn), an estimate (zn) of this symbol (sn) based on a linear combination (y′n) of the samples (yn) for this symbol (sn); and
determining the symbol of the alphabet (Ω) closest to the estimate (zn) as detected symbol (ŝn);
wherein the alphabet (Ω) exhibits a decentering such that the transmitted symbols (sn) have a non-zero predefined expectation ([sn]), and in that the linear equalization comprises adding a non-zero scalar component (θ) to the linear combination (y′n) in order to compensate at least partially for the decentering, the scalar component (θ) being updated iteratively (B1, B2) on the basis of symbols determined previously by the decision module.

### Claim 15 (depends on 14)

A computer program (P) able to be downloaded from a communication network and/or recorded on a computer-readable medium, comprising instructions for executing the steps of a method as claimed in claim 14 when said program (P) is executed on a computer.
