# US 10,374,635 B2 · Interleaving and mapping method and deinterleaving and demapping method for LDPC codeword

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

- Number: US 10,374,635 B2
- Document ID: US10374635B2
- Status: Granted
- Kind: B2
- Application number: 16/122,896
- Filed: 2018-09-06
- Published: 2019-01-03
- Granted: 2019-08-06
- Earliest claimed: 2014-02-20
- Assignees: Shanghai National Engineering Research Center of Digital Television Co., Ltd.
- Applicants: Shanghai National Engineering Research Center of Digital Television Co., Ltd.
- Inventors: Wenjun Zhang; Yijun Shi; Dazhi He; Yunfeng Guan; Yin Xu; Xufeng Guo
- Web page: https://patentgrep.com/patent/US10374635B2

## CPC

- H03M 13/2792: {Interleaver wherein interleaving is performed jointly with another technique such as puncturing, multiplexing or routing}
- H03M 13/036: {Heuristic code construction methods, i.e. code construction or code search based on using trial-and-error}
- H03M 13/1148: {Structural properties of the code parity-check or generator matrix}
- H03M 13/1165: {QC-LDPC codes as defined for the digital video broadcasting [DVB] specifications, e.g. DVB-Satellite [DVB-S2]}
- H03M 13/255: {with Low Density Parity Check [LDPC] codes}
- H03M 13/271: {Row-column interleaver with permutations, e.g. block interleaving with inter-row, inter-column, intra-row or intra-column permutations}
- H03M 13/2778: {Interleaver using block-wise interleaving, e.g. the interleaving matrix is sub-divided into sub-matrices and the permutation is performed in blocks of sub-matrices}
- H03M 13/2906: {using block codes (H03M13/2957 takes precedence)}
- H03M 13/6522: {Intended application, e.g. transmission or communication standard}
- H04L 1/0041: {Arrangements at the transmitter end}
- H04L 1/0058: {Block-coded modulation}
- H04L 1/0071: {Use of interleaving (interleaving per se H03M13/27)}
- H03M 13/152: {Bose-Chaudhuri-Hocquenghem [BCH] codes}
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H04L 27/18: Phase-modulated carrier systems, i.e. using phase-shift keying (H04L27/32 takes precedence)
- H04L 27/3405: {Modifications of the signal space to increase the efficiency of transmission, e.g. reduction of the bit error rate, bandwidth, or average power}
- 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

An interleaving and mapping method and a deinterleaving and demapping method for an LDPC codeword are provided. The interleaving and mapping method comprises: performing first bit interleaving on a parity bits part of the LDPC codeword to obtain interleaved parity bits; splicing an information bit part of the codeword and the interleaved parity bits into a codeword after the first bit interleaving; dividing the codeword after the first bit interleaving into multiple consecutive bit subblocks in a predetermined length, and changing the order of the bit subblocks according to a corresponding permutation order (bit-swapping pattern) to form a codeword after second bit interleaving; dividing the codeword after the second bit interleaving into two parts, and writing the two parts into storage space in a column order respectively and reading the two parts from the storage space in a row order respectively to obtain a codeword after third bit interleaving.

## Claims

### Claim 1

A transmitter, comprising:
a constellation mapper performing, according to a corresponding constellation diagram, constellation mapping on an LDPC codeword which is bit interleaved according to a bit interleaving pattern,
wherein for LDPC codewords with different code lengths, code rates and LDPC code matrices tables, such that the capacity of bit interleaved coding and modulation is maximized, matched constellation diagrams and bit interleaving patterns are designed by means of theoretical analysis and optimization, and
wherein the constellation diagram is distributed non-uniformly in a two-dimensional manner in a single quadrant, and distributed symmetrically in four quadrants.

### Claim 2 (depends on 1)

The transmitter of claim 1, wherein
the constellation diagram includes:
Constellation point
Complex symbol
0
0.3412 + 0.5241i
1
0.5241 + 0.3412i
2
0.5797 + 1.1282i
3
1.1282 + 0.5797i
4
−0.3412 + 0.5241i
5
−0.5241 + 0.3412i
6
−0.5797 + 1.1282i
7
−1.1282 + 0.5797i
8
0.3412 − 0.5241i
9
0.5241 − 0.3412i
10
0.5797 − 1.1282i
11
1.1282 − 0.5797i
12
−0.3412 − 0.5241i
13
−0.5241 − 0.3412i
14
−0.5797 − 1.1282i
15
−1.1282 − 0.5797i.

### Claim 3 (depends on 2)

The transmitter of claim 2, wherein
the constellation diagram is applicable to 16-QAM non-uniform constellation mapping,
the constellation diagram is applicable to an LDPC codeword with a code length of 16200 bits or 64800 bits, and
the constellation diagram is applicable to an LDPC codeword with a code rate of 4/15 or a code rate of 7/15.

### Claim 4 (depends on 1)

The transmitter of claim 1, wherein
the constellation diagram includes:
Constellation point
Complex symbol
0
0.2535 + 0.4923i
1
0.4923 + 0.2535i
2
0.4927 + 1.2044i
3
1.2044 + 0.4927i
4
−0.2535 + 0.4923i
5
−0.4923 + 0.2535i
6
−0.4927 + 1.2044i
7
−1.2044 + 0.4927i
8
0.2535 − 0.4923i
9
0.4923 − 0.2535i
10
0.4927 − 1.2044i
11
1.2044 − 0.4927i
12
−0.2535 − 0.4923i
13
−0.4923 − 0.2535i
14
−0.4927 − 1.2044i
15
−1.2044 − 0.4927i.

### Claim 5 (depends on 4)

The transmitter of claim 4, wherein
the constellation diagram is applicable to 16-QAM non-uniform constellation mapping,
the constellation diagram is applicable to an LDPC codeword with a code length of 16200 bits or 64800 bits, and
the constellation diagram is applicable to an LDPC codeword with a code rate of 8/15.

### Claim 6 (depends on 1)

The transmitter of claim 1, wherein
the constellation diagram includes:
Constellation point
Complex symbol
0
0.2592 + 0.4888i
1
0.4888 + 0.2592i
2
0.5072 + 1.1980i
3
1.1980 + 0.5072i
4
−0.2592 + 0.4888i
5
−0.4888 + 0.2592i
6
−0.5072 + 1.1980i
7
−1.1980 + 0.5072i
8
0.2592 − 0.4888i
9
0.4888 − 0.2592i
10
0.5072 − 1.1980i
11
1.1980 − 0.5072i
12
−0.2592 − 0.4888i
13
−0.4888 − 0.2592i
14
−0.5072 − 1.1980i
15
−1.1980 − 0.5072i.

### Claim 7 (depends on 6)

The transmitter of claim 6, wherein
the constellation diagram is applicable to 16-QAM non-uniform constellation mapping,
the constellation diagram is applicable to an LDPC codeword with a code length of 16200 bits or 64800 bits, and
the constellation diagram is applicable to an LDPC codeword with a code rate of 4/15 or a code rate of 7/15 or a code rate of 8/15.

### Claim 8

A receiver, characterized by comprising:
a constellation demapper performing, according to a corresponding constellation diagram, constellation demapping on signals to obtain an LDPC codeword which will be deinterleaved according to a bit deinterleaving pattern,
wherein for LDPC codewords with different code lengths, code rates and LDPC code matrices tables, such that the capacity of bit interleaved decoding and demodulation is maximized, matched constellation diagrams and bit deinterleaving patterns are designed by means of theoretical analysis and optimization, and
wherein the constellation diagram is distributed non-uniformly in a two-dimensional manner in a single quadrant, and distributed symmetrically in four quadrants.

### Claim 9 (depends on 8)

The receiver of claim 8, wherein
Constellation point
Complex symbol
0
0.3412 + 0.5241i
1
0.5241 + 0.3412i
2
0.5797 + 1.1282i
3
1.1282 + 0.5797i
4
−0.3412 + 0.5241i
5
−0.5241 + 0.3412i
6
−0.5797 + 1.1282i
7
−1.1282 + 0.5797i
8
0.3412 − 0.5241i
9
0.5241 − 0.3412i
10
0.5797 − 1.1282i
11
1.1282 − 0.5797i
12
−0.3412 − 0.5241i
13
−0.5241 − 0.3412i
14
−0.5797 − 1.1282i
15
−1.1282 − 0.5797i.

### Claim 10 (depends on 9)

The receiver of claim 9, wherein
the constellation diagram is applicable to 16-QAM non-uniform constellation demapping,
the constellation diagram is applicable to an LDPC codeword with a code length of 16200 bits or 64800 bits, and
the constellation diagram is applicable to an LDPC codeword with a code rate of 4/15 or a code rate of 7/15.

### Claim 11 (depends on 8)

The receiver of claim 8, wherein
the constellation diagram includes:
Constellation point
Complex symbol
0
0.2535 + 0.4923i
1
0.4923 + 0.2535i
2
0.4927 + 1.2044i
3
1.2044 + 0.4927i
4
−0.2535 + 0.4923i
5
−0.4923 + 0.2535i
6
−0.4927 + 1.2044i
7
−1.2044 + 0.4927i
8
0.2535 − 0.4923i
9
0.4923 − 0.2535i
10
0.4927 − 1.2044i
11
1.2044 − 0.4927i
12
−0.2535 − 0.4923i
13
−0.4923 − 0.2535i
14
−0.4927 − 1.2044i
15
−1.2044 − 0.4927i.

### Claim 12 (depends on 11)

The receiver of claim 11, wherein
the constellation diagram is applicable to 16-QAM non-uniform constellation demapping,
the constellation diagram is applicable to an LDPC codeword with a code length of 16200 bits or 64800 bits, and
the constellation diagram is applicable to an LDPC codeword with a code rate of 8/15.

### Claim 13 (depends on 8)

The receiver of claim 8, wherein
the constellation diagram includes:
Constellation point
Complex symbol
0
0.2592 + 0.4888i
1
0.4888 + 0.2592i
2
0.5072 + 1.1980i
3
1.1980 + 0.5072i
4
−0.2592 + 0.4888i
5
−0.4888 + 0.2592i
6
−0.5072 + 1.1980i
7
−1.1980 + 0.5072i
8
0.2592 − 0.4888i
9
0.4888 − 0.2592i
10
0.5072 − 1.1980i
11
1.1980 − 0.5072i
12
−0.2592 − 0.4888i
13
−0.4888 − 0.2592i
14
−0.5072 − 1.1980i
15
−1.1980 − 0.5072i.

### Claim 14 (depends on 13)

The receiver of claim 13, wherein
the constellation diagram is applicable to 16-QAM non-uniform constellation demapping,
the constellation diagram is applicable to an LDPC codeword with a code length of 16200 bits or 64800 bits, and
the constellation diagram is applicable to an LDPC codeword with a code rate of 4/15 or a code rate of 7/15 or a code rate of 8/15.

### Claim 15

A constellation mapping method, comprising:
performing, with at least one processor, according to a corresponding constellation diagram, constellation mapping on an LDPC codeword which is bit interleaved according to a bit interleaving pattern,
wherein for LDPC codewords with different code lengths, code rates and LDPC code matrices tables, such that the capacity of bit interleaved coding and modulation is maximized, matched constellation diagrams and bit interleaving patterns are designed by means of theoretical analysis and optimization, and
wherein the constellation diagram is distributed non-uniformly in a two-dimensional manner in a single quadrant, and distributed symmetrically in four quadrants.

### Claim 16 (depends on 15)

The constellation mapping method of claim 15, wherein
the constellation diagram includes:
Constellation point
Complex symbol
0
0.3412 + 0.5241i
1
0.5241 + 0.3412i
2
0.5797 + 1.1282i
3
1.1282 + 0.5797i
4
−0.3412 + 0.5241i
5
−0.5241 + 0.3412i
6
−0.5797 + 1.1282i
7
−1.1282 + 0.5797i
8
0.3412 − 0.5241i
9
0.5241 − 0.3412i
10
0.5797 − 1.1282i
11
1.1282 − 0.5797i
12
−0.3412 − 0.5241i
13
−0.5241 − 0.3412i
14
−0.5797 − 1.1282i
15
−1.1282 − 0.5797i.

### Claim 17 (depends on 16)

The constellation mapping method of claim 16, wherein
the constellation diagram is applicable to 16-QAM non-uniform constellation mapping,
the constellation diagram is applicable to an LDPC codeword with a code length of 16200 bits or 64800 bits, and
the constellation diagram is applicable to an LDPC codeword with a code rate of 4/15 or a code rate of 7/15.

### Claim 18 (depends on 15)

The constellation mapping method of claim 15, wherein
the constellation diagram includes:
Constellation point
Complex symbol
0
0.2535 + 0.4923i
1
0.4923 + 0.2535i
2
0.4927 + 1.2044i
3
1.2044 + 0.4927i
4
−0.2535 + 0.4923i
5
−0.4923 + 0.2535i
6
−0.4927 + 1.2044i
7
−1.2044 + 0.4927i
8
0.2535 − 0.4923i
9
0.4923 − 0.2535i
10
0.4927 − 1.2044i
11
1.2044 − 0.4927i
12
−0.2535 − 0.4923i
13
−0.4923 − 0.2535i
14
−0.4927 − 1.2044i
15
−1.2044 − 0.4927i.

### Claim 19 (depends on 18)

The constellation mapping method of claim 18, wherein
the constellation diagram is applicable to 16-QAM non-uniform constellation mapping,
the constellation diagram is applicable to an LDPC codeword with a code length of 16200 bits or 64800 bits, and
the constellation diagram is applicable to an LDPC codeword with a code rate of 8/15.

### Claim 20 (depends on 15)

The constellation mapping method of claim 15, wherein
the constellation diagram includes:
Constellation point
Complex symbol
0
0.2592 + 0.4888i
1
0.4888 + 0.2592i
2
0.5072 + 1.1980i
3
1.1980 + 0.5072i
4
−0.2592 + 0.4888i
5
−0.4888 + 0.2592i
6
−0.5072 + 1.1980i
7
−1.1980 + 0.5072i
8
0.2592 − 0.4888i
9
0.4888 − 0.2592i
10
0.5072 − 1.1980i
11
1.1980 − 0.5072i
12
−0.2592 − 0.4888i
13
−0.4888 − 0.2592i
14
−0.5072 − 1.1980i
15
−1.1980 − 0.5072i.

### Claim 21 (depends on 20)

The constellation mapping method of claim 20, wherein
the constellation diagram is applicable to 16-QAM non-uniform constellation mapping,
the constellation diagram is applicable to an LDPC codeword with a code length of 16200 bits or 64800 bits, and
the constellation diagram is applicable to an LDPC codeword with a code rate of 4/15 or a code rate of 7/15 or a code rate of 8/15.

### Claim 22

A constellation demapping method, comprising:
performing, with at least one processor, according to a corresponding constellation diagram, constellation demapping on signals to obtain an LDPC codeword which will be deinterleaved according to a bit deinterleaving pattern,
wherein for LDPC codewords with different code lengths, code rates and LDPC code matrices tables, such that the capacity of bit interleaved decoding and demodulation is maximized, matched constellation diagrams and bit deinterleaving patterns are designed by means of theoretical analysis and optimization, and
wherein the constellation diagram is distributed non-uniformly in a two-dimensional manner in a single quadrant, and distributed symmetrically in four quadrants.

### Claim 23 (depends on 22)

The constellation demapping method of claim 22, wherein
the constellation diagram includes:
Constellation point
Complex symbol
0
0.3412 + 0.5241i
1
0.5241 + 0.3412i
2
0.5797 + 1.1282i
3
1.1282 + 0.5797i
4
−0.3412 + 0.5241i
5
−0.5241 + 0.3412i
6
−0.5797 + 1.1282i
7
−1.1282 + 0.5797i
8
0.3412 − 0.5241i
9
0.5241 − 0.3412i
10
0.5797 − 1.1282i
11
1.1282 − 0.5797i
12
−0.3412 − 0.5241i
13
−0.5241 − 0.3412i
14
−0.5797 − 1.1282i
15
−1.1282 − 0.5797i.

### Claim 24 (depends on 23)

The constellation demapping method of claim 23, wherein
the constellation diagram is applicable to 16-QAM non-uniform constellation demapping,
the constellation diagram is applicable to an LDPC codeword with a code length of 16200 bits or 64800 bits, and
the constellation diagram is applicable to an LDPC codeword with a code rate of 4/15 or a code rate of 7/15.

### Claim 25 (depends on 22)

The constellation demapping method of claim 22, wherein
the constellation diagram includes:
Constellation point
Complex symbol
0
0.2535 + 0.4923i
1
0.4923 + 0.2535i
2
0.4927 + 1.2044i
3
1.2044 + 0.4927i
4
−0.2535 + 0.4923i
5
−0.4923 + 0.2535i
6
−0.4927 + 1.2044i
7
−1.2044 + 0.4927i
8
0.2535 − 0.4923i
9
0.4923 − 0.2535i
10
0.4927 − 1.2044i
11
1.2044 − 0.4927i
12
−0.2535 − 0.4923i
13
−0.4923 − 0.2535i
14
−0.4927 − 1.2044i
15
−1.2044 − 0.4927i.

### Claim 26 (depends on 25)

The constellation demapping method of claim 25, wherein
the constellation diagram is applicable to 16-QAM non-uniform constellation demapping,
the constellation diagram is applicable to an LDPC codeword with a code length of 16200 bits or 64800 bits, and
the constellation diagram is applicable to an LDPC codeword with a code rate of 8/15.

### Claim 27 (depends on 22)

The constellation demapping method of claim 22, wherein
the constellation diagram includes:
Constellation point
Complex symbol
0
0.2592 + 0.4888i
1
0.4888 + 0.2592i
2
0.5072 + 1.1980i
3
1.1980 + 0.5072i
4
−0.2592 + 0.4888i
5
−0.4888 + 0.2592i
6
−0.5072 + 1.1980i
7
−1.1980 + 0.5072i
8
0.2592 − 0.4888i
9
0.4888 − 0.2592i
10
0.5072 − 1.1980i
11
1.1980 − 0.5072i
12
−0.2592 − 0.4888i
13
−0.4888 − 0.2592i
14
−0.5072 − 1.1980i
15
−1.1980 − 0.5072i.

### Claim 28 (depends on 27)

The constellation demapping method of claim 27, wherein
the constellation diagram is applicable to 16-QAM non-uniform constellation demapping,
the constellation diagram is applicable to an LDPC codeword with a code length of 16200 bits or 64800 bits, and
the constellation diagram is applicable to an LDPC codeword with a code rate of 4/15 or a code rate of 7/15 or a code rate of 8/15.