Decoding of a message and corresponding encoding of a message

Patent metadata

Field	Value
Publication number	US-10256943-B2
Application number	US-201315105243-A
Country	US
Kind code	B2
Filing date	Dec 17, 2013
Priority date	Dec 17, 2013
Publication date	Apr 9, 2019
Grant date	Apr 9, 2019

Abstract

The present disclosure concerns radio communication. More particularly, the disclosure relates to encoding/decoding. A method is performed by a receiver ( 300 ) for decoding data from a message which is received from a transmitter ( 100 ). The receiver ( 300 ) is generally configured to use a decoding matrix in the decoding. Furthermore, the message is typically split into a pre-defined number of sub-messages. The receiver ( 300 ) receives data packets from the transmitter ( 100 ), wherein the received data packets are formed according to a certain structure. Furthermore, the receiver ( 300 ) decodes the received data packets as the data packets are received and the decoding is performed sequentially with the arrival (i.e. reception) of the data packets. Hereby it is made possible to reduce, and thus received improve, the latency.

First claim

The invention claimed is:

1. A decoding method performed by a receiver for decoding data from a message M received from a transmitter, wherein the receiver uses a decoding matrix C in the decoding, and wherein said message M is split into a pre-defined number n of sub-messages M 1 to Mn, the decoding method comprising:
receiving data packets from the transmitter, wherein the received data packets are formed by a linear combination of said sub-messages M 1 to Mn according to:
P 1= C 11* M 1
P 2= C 21* M 1+ C 22* M 2
. . . = . . .
Pn=Cn 1* M 1+ Cn 2* M 2+ Cn 3* M 3+ . . . + Cnn*Mn,
where Pn is an n-th data packet, C is the decoding matrix with element Cij at position (i,j) and Mn is an n-th sub-message of said message M;

decoding said sub-messages M 1 to Mn from the received data packets until a decoding of a sub-message from the received data packets is unsuccessful, wherein the decoding of said sub-messages M 1 to Mn is performed according to:
M 1= C 11^(−1)* P 1

M 2= C 22^(−1)*( P 2− C 21* M 1)

. . . = . . .
Mn=Cnn ^(−1)*( Pn−C ( N− 1)* M ( N− 1)− . . . − C (1)* M (1))

as the data packets are received, wherein the decoding of said sub-messages M 1 to Mn is performed sequentially with an arrival of the data packets, and wherein the sequential decoding of said sub-messages M 1 to Mn with the arrival of the data packets allows performing a significant portion of calculations associated with the decoding of said sub-messages M 1 to Mn already at the reception of the data packets;

receiving all remaining data packets when the decoding, of said sub-message from the received data packets, is unsuccessful; and
decoding, all remaining sub-messages from said all remaining data packets, in response to a determination that said all remaining data packets have been received,
thereby reducing a delay in the decoding of said sub-messages M 1 to Mn from the received data packets.

2. An encoding method performed by a transmitter for encoding data of a message M to be transmitted to a receiver, the encoding method comprising:
splitting said message M into a pre-defined number n of sub-messages M 1 to Mn;
forming data packets by means of a linear combination of said sub-messages M 1 to Mn according to:
P 1= C 11* M 1
P 2= C 21* M 1+ C 22* M 2
. . . = . . .
Pn=Cn 1* M 1+ Cn 2* M 2+ Cn 3* M 3+ . . . + Cnn*Mn,
where Pn is an n-th data packet, C is an encoding matrix with element Cij at position (i,j) and Mn is an n-th sub-message of said message M; and

transmitting the formed data packets to the receiver, wherein the receiver sequentially decodes said sub-messages M 1 to Mn from the formed data packets with an arrival of the formed data packets, wherein the sequential decoding is performed until a decoding of a sub-message from the formed data packets is unsuccessful, wherein the sequential decoding allows the receiver to perform a significant portion of calculations associated with the decoding of said sub-messages M 1 to Mn already at a reception of the formed data packets, wherein the receiver receives all remaining formed data packets when the decoding, of said sub-message from the received data packets, is unsuccessful, and wherein the receiver further decodes, all remaining sub-messages from said all remaining formed data packets, in response to a determination that said all remaining formed data packets have been received, thereby reducing a delay in the decoding of said sub-messages M 1 to Mn from the formed data packets.

3. A receiver for decoding data from a message M receivable from a transmitter, wherein the receiver is configured to use a decoding matrix C in the decoding, and wherein said message M is split into a pre-defined number n of sub-messages M 1 to Mn, the receiver comprising:
a receiving circuit configured to receive data packets from the transmitter, wherein the received data packets are formed by a linear combination of said sub-messages M 1 to Mn according to:
P 1= C 11* M 1
P 2= C 21* M 1+ C 22* M 2
. . . = . . .
Pn=Cn 1* M 1+ Cn 2* M 2+ Cn 3* M 3+ . . . + Cnn*Mn,
where Pn is an n-th data packet, C is the decoding matrix with element Cij at position (i,j) and Mn is an n-th sub-message of said message M; and

a processing circuit configured to decode said sub-messages M 1 to Mn from the received data packets until a decoding of a sub-message from the received data packets is unsuccessful, wherein the decoding of said sub-messages M 1 to Mn is performed according to:
M 1= C 11^(−1)* P 1

M 2= C 22^(−1)*( P 2− C 21* M 1)

. . . = . . .
Mn=Cnn ^(−1)*( Pn−C ( N− 1)* M ( N− 1)− . . . − C (1)* M (1))

as the data packets are received, wherein the processing circuit is configured to decode said sub-messages M 1 to Mn from the received data packets sequentially with an arrival of the data packets, wherein the sequential decoding of said sub-messages M 1 to Mn with the arrival of the data packets allows performing a significant portion of calculations associated with the decoding of said sub-messages M 1 to Mn already at the reception of the data packets, wherein the receiving circuit is further configured to receive all remaining data packets when the decoding, of said sub-message from the received data packets, is unsuccessful;
and the processing circuit is further configured to decode, all remaining sub-messages from said all remaining data packets, in response to a determination that said all remaining data packets have been received, thereby reducing a delay in the decoding of said sub-messages M 1 to Mn from the received data packets.

4. A transmitter for encoding data of a message M to be transmitted to a receiver, the transmitter comprising:
a processing circuit configured to split said message M into a pre-defined number n of sub-messages M 1 to Mn, and to form data packets by means of a linear combination of said sub-messages M 1 to Mn according to:
P 1= C 11* M 1
P 2= C 21* M 1+ C 22* M 2
. . . = . . .
Pn=Cn 1* M 1+ Cn 2* M 2+ Cn 3* M 3+ . . . + Cnn*Mn,
where Pn is an n-th data packet, C is an encoding matrix with element Cij at position (i,j) and Mn is an n-th sub-message of said message M; and

a transmitting circuit configured to transmit the formed data packets to the receiver, wherein the receiver sequentially decodes said sub-messages M 1 to Mn from the formed data packets with an arrival of the formed data packets, wherein the sequential decoding is performed until a decoding of a sub-message from the formed data packets is unsuccessful, wherein the sequential decoding allows the receiver to perform a significant portion of calculations associated with the decoding of said sub-messages M 1 to Mn already at a reception of the formed data packets, wherein the receiver receives all remaining formed data packets when the decoding, of said sub-message from the formed data packets, is unsuccessful, and wherein the receiver further decodes, all remaining sub-messages from said all remaining formed data packets, in response to a determination that said all remaining formed data packets have been received, thereby reducing a delay in the decoding of said sub-messages M 1 to Mn from the formed data packets.

5. A system comprising:
a transmitter configured to encode data of a message M, wherein the transmitter comprises:
a processing circuit configured to split said message M into a pre-defined number n of sub-messages M 1 to Mn, and to form data packets by means of a linear combination of said sub-messages M 1 to Mn according to:
P 1= C 11* M 1
P 2= C 21* M 1+ C 22* M 2
. . . = . . .
Pn=Cn 1* M 1+ Cn 2* M 2+ Cn 3* M 3+ . . . + Cnn*Mn,
where Pn is an n-th data packet, C is an encoding matrix with element Cij

Assignees

• Ericsson Telefon Ab L M
• Telefonactiebolaget Lm Ericsson Publ

Inventors

• Gattami Ather

Classifications

• H04L1/0045

  Arrangements at the receiver end · CPC title

• H04L1/0041 Primary

  Arrangements at the transmitter end · CPC title

• H04L1/0058

  Block-coded modulation · CPC title

• H03M13/3761 Primary

  using code combining, i.e. using combining of codeword portions which may have been transmitted separately, e.g. Digital Fountain codes, Raptor codes or Luby Transform [LT] codes · CPC title