# US 2013/0232397 A1 · Systems and methods for a soft-input decoder of linear network codes

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

- Number: US 2013/0232397 A1
- Document ID: US20130232397A1
- Status: Published application
- Kind: A1
- Application number: 13/596,005
- Filed: 2012-08-27
- Published: 2013-09-05
- Earliest claimed: 2011-08-26
- Assignees: Texas Instruments Incorporated
- Inventors: Samantha Rose SUMMERSON; Anuj BATRA
- Web page: https://patentgrep.com/patent/US20130232397A1

## CPC

- G06F 11/0751: {Error or fault detection not based on redundancy (power supply failures G06F1/30; network fault management H04L41/06)}
- H03M 13/00: Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes (error detection or error correction for analogue/digital, digital/analogue or code conversion H03M1/00 – H03M11/00; specially adapted for digital computers G06F11/08; for information storage based on relative movement between record carrier and transducer G11B, e.g. G11B20/18; for static stores G11C)
- H04L 1/00: Arrangements for detecting or preventing errors in the information received {(correcting synchronisation H04L7/00)}
- H04L 1/0076: {Distributed coding, e.g. network coding, involving channel coding (coding in both space and time H04L1/0618; cooperative diversity H04B7/022)}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- 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)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method for decoding linear network codes that includes receiving a plurality of packets from an ererror detector and generating a matrix out of the plurality of packets where elements of each column of the matrix correspond to symbols of the plurality of packets. Then decoding across each row of the matrix using only the symbols with highest associated reliability values to obtain a decoded matrix, where each column of the decoded matrix corresponds to a message packet.

## Claims

### Claim 1

A method for decoding linear network codes, comprising:
receiving, by a processor, a plurality of packets from an error detector;
generating, by the processor, a matrix wherein elements of each column of the matrix correspond to symbols of the plurality of packets; and
decoding, by the processor, across each row of the matrix using only the symbols with highest associated reliability values to obtain a decoded matrix, wherein each column of the decoded matrix corresponds to a message packet.

### Claim 2 (depends on 1)

The method of claim 1 further comprising:
receiving, by a processor, a plurality of packets from an error detector, wherein the plurality of packets comprises recovered packets and at least one erasure packet, wherein all symbols in recovered packets have high associated reliability values;
selecting, by the processor, a replacement packet from a physical layer that corresponds to the erasure packet, wherein each symbol in the replacement packet comprises a reliability value; and
replacing, by the processor, the at least one erasure packet with the replacement packet.

### Claim 3 (depends on 1)

The method of claim 1 further comprising:
selecting, by the processor, a replacement packet from a physical layer that corresponds to each of the plurality of packets from the error detector, wherein each symbol in the replacement packet comprises a reliability value; and
replacing, by the processor, the plurality of packets with the replacement packets.

### Claim 4 (depends on 1)

The method of claim 1 wherein the number of symbols selected from each row to perform the decoding is at least equal to a number of message packets originally encoded.

### Claim 5 (depends on 1)

The method of claim 1 wherein the symbols selected from each row to perform the decoding are taken from a linearly independent set of columns, wherein the number of columns decoded is at least equal to the number of message packets originally encoded.

### Claim 6 (depends on 1)

The method of claim 1 wherein the reliability values comprise a characterization made by the physical layer that represents a level of confidence in each symbol being received without error, and the associated reliability value is a continuum of values ranging from low to high.

### Claim 7 (depends on 1)

The method of claim 1 further comprising:
decoding, by the processor, across each row of the matrix using an inverted subs-matrix of a linear operator matrix;
wherein the inverted sub-matrix of the linear operator matrix is determined by the symbols having associated high reliability values; and
wherein the subset of the invertible linear operator matrix is only applied to the symbols of the matrix having associated high reliability values.

### Claim 8

A system for decoding linear network codes, comprising:
a packet receiver configured to:
receive a plurality of packets from an error detector; and
receive a plurality of packets from a physical layer, wherein each packet from the physical layer corresponds to one of the packets from the error detector and each symbol in the packets from the physical layer comprises a reliability value;
a matrix generator configured to generate a decoding matrix, wherein elements of each column of the decoding matrix correspond to symbols of one of the plurality of packets; and
a decoder configured to decode across each row of the decoding matrix using only the symbols having a highest reliability value to obtain a decoded matrix, wherein all bits in recovered packets have high reliability values;
wherein the columns of the decoded matrix correspond to a message packet.

### Claim 9 (depends on 8)

The system of claim 8 further comprising:
a packet replacement unit configured to replace an erasure packet with its corresponding packet from the physical layer;
wherein the plurality of packets received from the error detector comprise recovered packets and at least one erasure packet; and

### Claim 10 (depends on 8)

The system of claim 8 wherein the packet replacement unit is further configured to replace the plurality of packets with their corresponding packets from the physical layer.

### Claim 11 (depends on 8)

The system of claim 8 wherein the reliability values comprise a characterization made by the physical layer that represents a level of confidence of the physical layer in each symbol being received without error, and the reliability value is a continuum of values ranging from low to high.

### Claim 12 (depends on 8)

The system of claim 8 wherein the decoder is further configured to select for decoding a number of symbols from each row at least equal to a number of message packets originally encoded.

### Claim 13 (depends on 8)

The system of claim 8 wherein the decoder is further configured to select for decoding symbols from each row from a linearly independent set of columns, wherein the number of columns selected is at least equal to the number of message packets originally encoded.

### Claim 14

A method for decoding linear network codes, comprising:
receiving, by a processor, a plurality of output packets from an error detector, wherein each packet comprises symbols with associated reliability values;
generating, by the processor, a decoding matrix, wherein elements of each column of the decoding matrix correspond to symbols of one of the plurality of output packets; and
decoding, by the processor, across each row of the decoding matrix, using only the symbols having a highest reliability value, wherein each column of the resulting decoded matrix represents a message packet.

### Claim 15 (depends on 14)

The method of claim 14 further comprising:
wherein the plurality of output packets comprises of recovered packets and at least one erasure packet, wherein all symbols in the recovered packets have high reliability values;
selecting, by the processor, a packet from a physical layer that corresponds to the at least one erasure packet, wherein each symbol in the packet from the physical layer comprises an associated reliability value ranging from low to high; and
replacing, by the processor, the erasure packet with the packet from the physical layer.

### Claim 16 (depends on 15)

The method of claim 15 further comprising:
replacing, by the processor, the plurality of output packets with their corresponding packets from the physical layer.

### Claim 17 (depends on 14)

The method of claim 14 wherein the reliability values correspond to a characterization made by the physical layer that denotes the physical layer's level of confidence in each symbol being received without error, and the associated reliability value is a continuum of values ranging from low to high.

### Claim 18 (depends on 14)

The method of claim 14 wherein the number of symbols selected to perform the decoding is at least equal to a number of message packets originally encoded.

### Claim 19 (depends on 14)

The method of claim 14 wherein the symbols selected to perform the decoding are taken from a linearly independent set of columns, wherein the number of columns decoded is at least equal to the number of message packets originally encoded.

### Claim 20 (depends on 15)

The method of claim 15 wherein at least one of the plurality of output packets is not recovered by the physical layer and the error checker replaces it with an erasure packet.
