# US 10,122,496 B2 · Method for dynamic and selective FD-DSDF transmission of a digital signal for a MARC system with a full-duplex relay, and corresponding program product and relay device

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

- Number: US 10,122,496 B2
- Document ID: US10122496B2
- Status: Granted
- Kind: B2
- Application number: 15/321,712
- Filed: 2015-06-25
- Published: 2017-05-18
- Granted: 2018-11-06
- Earliest claimed: 2014-06-27
- Assignees: Orange
- Applicants: Orange
- Inventors: Abdulaziz Mohamad; Raphaël Visoz; Antoine Berthet
- Web page: https://patentgrep.com/patent/US10122496B2

## CPC

- H04L 1/0076: {Distributed coding, e.g. network coding, involving channel coding (coding in both space and time H04L1/0618; cooperative diversity H04B7/022)}
- H04B 7/15592: {Adapting at the relay station communication parameters for supporting cooperative relaying, i.e. transmission of the same data via direct - and relayed path (cooperative diversity H04B7/024)}
- H04B 7/17: employing pulse modulation, e.g. pulse code modulation
- H04L 1/0077: {Cooperative coding}
- H04L 5/14: Two-way operation using the same type of signal, i.e. duplex
- H04L 25/03331: {Arrangements for the joint estimation of multiple sequences}
- H04L 2001/0097: {Relays}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04B: TRANSMISSION

## Abstract

Some embodiments relate to a full-duplex relay for a telecommunications system comprising a plurality of sources, the relay, and a destination. The relay comprises a decoder which estimates for each source a code word xS,t encoding a K-bit message uS,t, from received blocks corresponding to successive code words xS,t transmitted simultaneously by the sources during T time slots, such that at each time slot t, t=1, . . . , T, a code word xS,t comprises B blocks xS,t(1), xS,t(2), . . . , xS,t(B) of which the first can be decoded independently of the other blocks. It also comprises a decision component which enables the relay to detect messages that have been decoded without error and to take a decision and an encoder and transmitter which encode a signal and transmit it to the destination, which signal is representative only of messages that have been decoded without error. After each received block, the encoding and transmission unit is under the control of the decision component.

## Claims

### Claim 1

A relaying method performed by a full-duplex relay for a telecommunications system comprising a plurality of sources, the full-duplex relay, and a destination, the method comprising:
a decoding process comprising estimating for each source a code word xS,t from received blocks corresponding to successive code words xS,t transmitted simultaneously by the plurality of sources during T time slots, such that, at each time slot t, t=1, . . . , T, the code word xS,t comprises B blocks xS,t(1), xS,t(2), . . . , xS,t(B), a first block of the B blocks to be decoded independently of the other blocks, a code word xS,t encoding a K-bit message uS,t, where K, B, and T are natural integers, B>2, T>1;
detecting, by the full-duplex relay, messages that have been decoded without error and taking a decision; and
encoding a signal and transmitting it to the destination, wherein the signal is representative only of messages that have been decoded without error;
wherein, after each received block, the encoding and transmission are performed under the control of the process of detecting messages that have been decoded without error and of taking a decision in compliance with a selection scheme, and wherein the selection scheme is such that a representative signal relating to a message that has been decoded without error during a time slot is transmitted by the full-duplex relay during the same time slot.

### Claim 2 (depends on 1)

A method according to claim 1, further comprising storing messages that have been decoded without error.

### Claim 3 (depends on 1)

A method according to claim 1, wherein in the absence of a message that has been decoded without error during a current time slot t, the error detection and decision taking process allows a message that has been decoded without error during a preceding time slot to be encoded and transmitted.

### Claim 4 (depends on 1)

A method according to claim 1, wherein the decision allows a message to be encoded and transmitted as soon as it has been decoded without error.

### Claim 5 (depends on 1)

A method according to claim 1, wherein after each received block, detection and decoding are under the control of the process of detecting messages that have been decoded without error and of taking a decision in compliance with a selection scheme.

### Claim 6 (depends on 5)

A method according to the claim 5, wherein if all the messages are decoded without error during a current time slot t, then the process of detecting messages that have been decoded without error and of taking decisions stops detection and decoding until the end of the current time slot and allows encoding and transmission.

### Claim 7 (depends on 1)

A method according to claim 1, wherein the selection scheme is such that, at each current time slot t, the transmitted signal is representative of the messages decoded without error up to the current time slot t.

### Claim 8 (depends on 1)

A method according to claim 1, wherein the selection scheme is such that, during each current time slot t, the transmitted signal is representative of the messages that have been decoded without error solely during the current time slot t.

### Claim 9 (depends on 1)

A method according to claim 1, wherein the encoding and transmission process comprises interleaving for each source for which a message has been decoded without error prior to network coding.

### Claim 10 (depends on 1)

A method according to claim 1, wherein the encoding and transmission process comprises network coding followed by first interleaving, by channel coding, and by second interleaving distinct from the first.

### Claim 11

A full-duplex relay for a telecommunications system comprising a plurality of sources, the full-duplex relay, and a destination, the full-duplex relay comprising:
a decoder configured to estimate for each source a code word xS,t from received blocks corresponding to successive code words xS,t transmitted simultaneously by the plurality of sources during T time slots, such that, at each time slot t, t=1, . . . , T, the code word xS,t comprises B blocks xS,t(1), xS,t(2), . . . , xS,t(B) , a first block of the B blocks to be decoded independently of the other blocks, a code word xS,t encoding a K-bit message uS,t, where K, B, and T are natural integers, B>2, B>2;
a decision component configured to enable the full-duplex relay to detect messages that have been decoded without error and to take a decision; and
an encoder and transmitter configured to encode a signal and transmit it to the destination, wherein the signal is representative only of messages that have been decoded without error;
wherein the full-duplex relay is configured such that, after each received block, the encoder and transmitter is under the control of the decision component which detects messages that have been decoded without error and which takes a decision in compliance with a selection scheme, and wherein the selection scheme is such that a representative signal relating to a message that has been decoded without error during a time slot is transmitted by the full-duplex relay during the same time slot.

### Claim 12 (depends on 1)

A reception method for a receiver of at least one MARC system for performing a relaying method according to claim 1, wherein the method comprises:
jointly detecting and decoding blocks coming from the sources and of messages coming from the full-duplex relay, the detection and decoding being performed iteratively at the end of each time slot t such that t ϵ{Q, . . . , T} over the duration of a sliding window of length Q, Q ϵ{1, . . . , T}, with propagation of probabilities between the iterations in order to estimate Q messages for each source;
wherein the decoding of the messages from the full-duplex relay is configured in each sub slot on the basis of signalling information coming from the full-duplex relay indicating whether the full-duplex relay is cooperating on this block b, b=1, . . . B; and
wherein the propagation of probabilities is configured for each block b, b=1, . . . B, on the basis of signalling information coming from the full-duplex relay indicating the selection scheme of the full-duplex relay, with B and T being natural integers, B>2, T>1.

### Claim 13

A receiver for at least one multiple-access relay channel (MARC) system, said receiver comprising:
a detector and decoder configured to jointly detect and decode blocks coming from a plurality of sources and messages coming from a relay, the detection and decoding being performed iteratively at the end of each time slot t such that t ϵ{Q, . . . , T} over the duration of a sliding window of length Q, Q ϵ{1, . . . , T}, with propagation of probabilities between the iterations in order to estimate Q messages for each source of the plurality of sources;
wherein the receiver is configured such that the decoding of the messages from the relay is configured in each sub slot on the basis of signalling information coming from the relay indicating whether the relay is cooperating on this block b, b=1, . . . B; and
such that the propagation of probabilities is configured for each block b, b=1, . . . B, on the basis of signaling information coming from the relay indicating the selection scheme of the relay, with B and T being natural integers, B>2, T>1.

### Claim 14

A method of transmitting a digital signal for a telecommunications system comprising a plurality of sources, a relay, and a destination implementing a spatially distributed network code, the method comprising for each source:
encoding messages uS,t including respective CRCs into code words cs,t; and
transmitting the code words cs,t during T time slots to the relay and to the destination;
wherein the encoding is of finite incremental redundancy type and, at each sub slot b=1, 2, . . . , B of a time slot, it delivers a block cS,t(b) such that the B successive blocks {cS,t(b): 1≤b≤B} form a code word cs,t of the code words, a first block of the B blocks to be decoded independently of the other blocks, such that the following blocks are parity bits that add redundancy to the first block, with B and T natural integers, B>2, T>1.

### Claim 15

A transmitter of a digital signal for a telecommunications system having a plurality of sources, a relay, and a destination implementing a spatially distributed network code, comprising:
an encoder which encodes messages uS,t having respective CRCs into code words cs,t; and
a transmitter which transmits the code words cs,t during T time slots to the relay and to the destination;
wherein the encoder is of finite incremental redundancy type and, at each sub slot b=1, 2, . . . B of a time slot, it delivers a block cS,t(b) such that the B successive blocks {cS,t(b): 1≤b≤B} form a code word cs,tof the code words, a first block of the B blocks to be decoded independently of the other blocks, such that the following blocks are parity bits that add redundancy to the first block, with B and T natural integers, B>2, T>1.