# US 2010/0146361 A1 · Multiple input hardware reuse using LDPC codes.

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

- Number: US 2010/0146361 A1
- Document ID: US20100146361A1
- Status: Published application
- Kind: A1
- Application number: 12/331,292
- Filed: 2008-12-09
- Published: 2010-06-10
- Earliest claimed: 2008-12-09
- Assignees: Entropic Communications, Inc.
- Inventors: Shaw Yuan; Arndt Mueller; Brian Eidson
- Web page: https://patentgrep.com/patent/US20100146361A1

## CPC

- H04L 1/0052: {Realisations of complexity reduction techniques, e.g. pipelining or use of look-up tables}
- H03M 13/1105: {Decoding}
- H03M 13/116: {Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices}
- H03M 13/3761: {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}
- H03M 13/6561: {Parallelized implementations}
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H04L 27/2647: {Arrangements specific to the receiver only (equalisation H04L27/01)}
- H04L 1/005: {Iterative decoding, including iteration between signal detection and decoding operation}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- 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)

## Abstract

A network controller receives data substantially simultaneously from multiple client nodes. The network controller assigns to each client node one or more sub-carriers of an orthogonal frequency-division multiplexing access frequency spectrum. The client nodes transmit substantially simultaneously M LDPC codewords that are encoded in a parity check matrix so that the number of rows m′ depend on the code rate and are mapped on its assigned sub-carriers. The network controller computes a bit log-likelihood ratio for each received bit of the codewords and arranges the bit LLR by codeword to align with an equivalent parity check matrix. The network controller decodes the codewords with the equivalent parity check matrix.

## Claims

### Claim 1

A method of performing error checking on data at a receiving node, the method comprising:
receiving, substantially simultaneously, codewords from M transmitting nodes, wherein the received codewords are low-density parity-check (LDPC) codewords encoded using an OFMDA parity check matrix and wherein each of the codewords received from the M transmitting nodes are received on an assigned subset of sub-carriers of an orthogonal frequency-division multiplexing access (OFDMA) frequency spectrum over which each transmitting node was assigned to transmit the received codewords;
performing error checking on the received codewords from all M transmitting nodes simultaneously using an equivalent parity check matrix.

### Claim 2 (depends on 1)

The method of claim 1, wherein the codewords are encoded at a code rate, and wherein the OFMDA parity check matrix has m′ rows, the number of rows m′ depending on the code rate.

### Claim 3 (depends on 1)

The method of claim 1, wherein each of the codewords are M times shorter than an OFDM LDPC codeword.

### Claim at position 4 (depends on 3)

4 The method of claim 3, wherein the expansion factor of the OFDMA parity check matrix is M times smaller than the expansion factor of an OFDM parity check matrix.

### Claim 5 (depends on 4)

The method of claim 4, wherein the parity check matrix used to encode the codewords is defined by:
H
ofdma
=
[
h
1
,
1
h
1
,
2
h
1
,
3
…
h
1
,
n
′
h
2
,
1
h
2
,
2
h
2
,
3
…
h
2
,
n
′
h
3
,
1
h
3
,
2
h
3
,
3
…
h
3
,
n
′
⋮
⋮
⋮
⋰
⋮
h
m
′
,
1
h
m
′
,
2
h
m
′
,
3
…
h
m
′
,
n
′
]
;
where each sub-matrix, hi,j is either an all zeros matrix, an identity matrix, or a cyclic shift of an identity matrix.

### Claim 6 (depends on 5)

The method of claim 5, wherein the equivalent parity check matrix comprises:
H
eq
=
[
Q
1
,
1
Q
1
,
2
Q
1
,
3
…
Q
1
,
n
′
Q
2
,
1
Q
2
,
2
Q
2
,
3
…
Q
3
,
n
′
Q
3
,
1
Q
3
,
2
Q
3
,
3
…
Q
3
,
n
′
⋮
⋮
⋮
⋰
⋮
Q
m
′
,
1
Q
m
′
,
2
Q
m
′
,
3
…
Q
m
′
,
n
′
]
;
wherein
Q
i
,
j
=
[
h
i
,
j
(
1
)
0
0
…
0
0
h
i
,
j
(
2
)
0
…
0
0
0
h
i
,
j
(
3
)
…
0
⋮
⋮
⋮
⋰
⋮
0
0
0
…
h
i
,
j
(
M
)
]


and
each hi,j sub-matrix is P′×P′ and P′=P/M; wherein P is the expansion factor for the OFDM parity check matrix and P′ is the expansion factor for the OFDMA parity check matrix.

### Claim 7 (depends on 1)

The method of claim 1, wherein the equivalent parity check matrix comprises:
H
eq
=
[
Q
1
,
1
Q
1
,
2
Q
1
,
3
…
Q
1
,
n
′
Q
2
,
1
Q
2
,
2
Q
2
,
3
…
Q
2
,
n
′
Q
3
,
1
Q
3
,
2
Q
3
,
3
…
Q
3
,
n
′
⋮
⋮
⋮
⋰
⋮
Q
m
′
,
1
Q
m
′
,
2
Q
m
′
,
3
…
Q
m
′
,
n
′
]
;
wherein
Q
i
,
j
=
[
h
i
,
j
(
1
)
0
0
…
0
0
h
i
,
j
(
2
)
0
…
0
0
0
h
i
,
j
(
3
)
…
0
⋮
⋮
⋮
⋰
⋮
0
0
0
…
h
i
,
j
(
M
)
]


and
each hi,j(k) sub-matrix is P(k)×P(k) and Qi,j is Pt×Pt and a total expansion factor is
P
t
=
∑
i
=
1
M

P
(
i
)
≤
P
,
where P(i) is an expansion factor of the ith codeword.

### Claim 8 (depends on 7)

The method of claim 7, wherein each hi,j(k) sub-matrix is square, but wherein the dimension of each sub-matrix is independent of the other on-diagonal sub-matrices.

### Claim 9 (depends on 8)

The method of claim 8, wherein each zero sub-matrix is has a width equal to the width of the sub-matrix in the diagonal that is in that same row and a length equal to the length of the sub-matrix in the diagonal that is in that same column.

### Claim 10

A computer readable media having instructions stored thereon that, when executed by a processor, causes the processor to decode data received from a plurality of transmitting nodes, the instructions comprising logic for:
assigning to each transmitting nodes one or more sub-carriers of an Orthogonal frequency-division multiplexing access frequency spectrum;
receiving substantially simultaneously M codewords from the transmitting nodes, wherein the codewords are low-density parity-check (LDPC) codewords and are encoded in a parity check matrix so that a number of rows m′ depend on a code rate and are mapped on its assigned sub-carrier;
computing a bit log-likelihood ratio for each received bit of the codewords and arranging the bit LLR by codeword to align with an equivalent parity check matrix; and
decoding the codewords with the equivalent parity check matrix.

### Claim 11 (depends on 10)

The computer readable media of claim 10, wherein each of the codewords are M times shorter than an OFDM LDPC codeword.

### Claim 12 (depends on 10)

The computer readable media of claim 10, wherein the encoded parity check matrix comprises:
H
ofdma
=
[
h
1
,
1
h
1
,
2
h
1
,
3
…
h
1
,
n
′
h
2
,
1
h
2
,
2
h
2
,
3
…
h
2
,
n
′
h
3
,
1
h
3
,
2
h
3
,
3
…
h
3
,
n
′
⋮
⋮
⋮
⋰
⋮
h
m
′
,
1
h
m
′
,
2
h
m
′
,
3
…
h
m
′
,
n
′
]
.

### Claim 13 (depends on 10)

The computer readable media of claim 10, wherein the equivalent parity check matrix comprises:
H
eq
=
[
Q
1
,
1
Q
1
,
2
Q
1
,
3
…
Q
1
,
n
′
Q
2
,
1
Q
2
,
2
Q
2
,
3
…
Q
2
,
n
′
Q
3
,
1
Q
3
,
2
Q
3
,
3
…
Q
3
,
n
′
⋮
⋮
⋮
⋰
⋮
Q
m
′
,
1
Q
m
′
,
2
Q
m
′
,
3
…
Q
m
′
,
n
′
]
;
wherein
Q
i
,
j
=
[
h
i
,
j
(
1
)
0
0
…
0
0
h
i
,
j
(
2
)
0
…
0
0
0
h
i
,
j
(
3
)
…
0
⋮
⋮
⋮
⋰
⋮
0
0
0
…
h
i
,
j
(
M
)
]


and
each hi,j sub-matrix is P′×P′ and P′=P/M.

### Claim 14 (depends on 10)

The computer readable media of claim 10, wherein the equivalent parity check matrix comprises:
H
eq
=
[
Q
1
,
1
Q
1
,
2
Q
1
,
3
…
Q
1
,
n
′
Q
2
,
1
Q
2
,
2
Q
2
,
3
…
Q
2
,
n
′
Q
3
,
1
Q
3
,
2
Q
3
,
3
…
Q
3
,
n
′
⋮
⋮
⋮
⋰
⋮
Q
m
′
,
1
Q
m
′
,
2
Q
m
′
,
3
…
Q
m
′
,
n
′
]
;
wherein
Q
i
,
j
=
[
h
i
,
j
(
1
)
0
0
…
0
0
h
i
,
j
(
2
)
0
…
0
0
0
h
i
,
j
(
3
)
…
0
⋮
⋮
⋮
⋰
⋮
0
0
0
…
h
i
,
j
(
M
)
]


and
each hi,j(k) sub-matrix is P(k)×P(k) and Qij is Pt×Pt and a total expansion factor is
P
t
=
∑
i
=
1
M

P
(
i
)
≤
P
,
where P(i) is an expansion factor of the ith codeword.

### Claim 15 (depends on 14)

The method of claim 14, wherein each hi,j(k) sub-matrix is square, but wherein the dimension of each sub-matrix is independent of the other on-diagonal sub-matrices.

### Claim 16 (depends on 15)

The method of claim 15, wherein each zero sub-matrix is has a width equal to the width of the sub-matrix in the diagonal that is in that same row and a length equal to the length of the sub-matrix in the diagonal that is in that same column.

### Claim 17

A system for decoding data from a plurality of transmitting nodes, the system comprising:
means for assigning to each transmitting nodes one or more sub-carriers of an Orthogonal frequency-division multiplexing access frequency spectrum;
means for receiving substantially simultaneously M codewords from the transmitting nodes, wherein the codewords are low-density parity-check (LDPC) codewords and are encoded in a parity check matrix so that a number of rows m′ depend on a code rate and are mapped on its assigned sub-carrier;
means for computing a bit log-likelihood ratio for each received bit of the codewords and arranging the bit LLR by codeword to align with an equivalent parity check matrix; and
means for decoding the codewords with the equivalent parity check matrix.

### Claim 18

A network node comprising:
a transceiver;
a demodulator coupled to the transceiver; and
a decoder coupled to the demodulator, wherein the decoder is adapted to:
assign to each of a plurality of transmitting nodes one or more sub-carriers of an Orthogonal frequency-division multiplexing access frequency spectrum;
receive substantially simultaneously M codewords from the transmitting nodes, wherein the codewords are low-density parity-check (LDPC) codewords and are encoded in a parity check matrix so that a number of rows m′ depend on a code rate and are mapped on its assigned sub-carrier;
compute a bit log-likelihood ratio for each received bit of the codewords and arranging the bit LLR by codeword to align with an equivalent parity check matrix; and
decode the codewords with the equivalent parity check matrix.

### Claim 19 (depends on 18)

The network node of claim 18, wherein each of the codewords are M times shorter than an OFDM LDPC codeword.

### Claim 20 (depends on 18)

The network node of claim 18, wherein the encoded parity check matrix comprises:
H
ofdma
=
[
h
1
,
1
h
1
,
2
h
1
,
3
…
h
1
,
n
′
h
2
,
1
h
2
,
2
h
2
,
3
…
h
2
,
n
′
h
3
,
1
h
3
,
2
h
3
,
3
…
h
3
,
n
′
⋮
⋮
⋮
⋰
⋮
h
m
′
,
1
h
m
′
,
2
h
m
′
,
3
…
h
m
′
,
n
′
]
.

### Claim 21 (depends on 18)

The network node of claim 18, wherein the equivalent parity check matrix comprises:
H
eq
=
[
Q
1
,
1
Q
1
,
2
Q
1
,
3
…
Q
1
,
n
′
Q
2
,
1
Q
2
,
2
Q
2
,
3
…
Q
2
,
n
′
Q
3
,
1
Q
3
,
2
Q
3
,
3
…
Q
3
,
n
′
⋮
⋮
⋮
⋰
⋮
Q
m
′
,
1
Q
m
′
,
2
Q
m
′
,
3
…
Q
m
′
,
n
′
]
;
wherein
Q
i
,
j
=
[
h
i
,
j
(
1
)
0
0
…
0
0
h
i
,
j
(
2
)
0
…
0
0
0
h
i
,
j
(
3
)
…
0
⋮
⋮
⋮
⋰
⋮
0
0
0
…
h
i
,
j
(
M
)
]


and
each hi,j sub-matrix is P′×P′ and P′=P/M.

### Claim 22 (depends on 18)

The network node of claim 18, wherein the equivalent parity check matrix comprises:
H
eq
=
[
Q
1
,
1
Q
1
,
2
Q
1
,
3
…
Q
1
,
n
′
Q
2
,
1
Q
2
,
2
Q
2
,
3
…
Q
2
,
n
′
Q
3
,
1
Q
3
,
2
Q
3
,
3
…
Q
3
,
n
′
⋮
⋮
⋮
⋰
⋮
Q
m
′
,
1
Q
m
′
,
2
Q
m
′
,
3
…
Q
m
′
,
n
′
]
;
wherein
Q
i
,
j
=
[
h
i
,
j
(
1
)
0
0
…
0
0
h
i
,
j
(
2
)
0
…
0
0
0
h
i
,
j
(
3
)
…
0
⋮
⋮
⋮
⋰
⋮
0
0
0
…
h
i
,
j
(
M
)
]


and
each hi,j(k) sub-matrix is P(k)×P(k) and Qij is Pt×Pt and a total expansion factor is
P
t
=
∑
i
=
1
M

P
(
i
)
≤
P
,
where P(i) is an expansion factor of the ith codeword.

### Claim 23 (depends on 22)

The method of claim 22, wherein each hi,j(k) sub-matrix is square, but wherein the dimension of each sub-matrix is independent of the other on-diagonal sub-matrices.

### Claim 24 (depends on 23)

The method of claim 23, wherein each zero sub-matrix is has a width equal to the width of the sub-matrix in the diagonal that is in that same row and a length equal to the length of the sub-matrix in the diagonal that is in that same column.
