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

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.

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.

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.

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.