# US 2019/0356342 A1 · Information Transmission Method, And Decoding Method And Apparatus

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

- Number: US 2019/0356342 A1
- Document ID: US20190356342A1
- Status: Published application
- Kind: A1
- Application number: 16/529,514
- Filed: 2019-08-01
- Published: 2019-11-21
- Earliest claimed: 2017-02-03
- Assignees: Huawei Technologies Co., Ltd.
- Applicants: Huawei Technologies Co., Ltd.
- Inventors: Huazi ZHANG; Rong LI; Yunfei QIAO; Hejia LUO; Gongzheng ZHANG; Ying CHEN
- Web page: https://patentgrep.com/patent/US20190356342A1

## CPC

- H03M 13/13: Linear codes
- H04L 1/0061: {Error detection codes}
- H03M 13/09: Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
- H03M 13/1174: {Parity-check or generator matrices built from sub-matrices representing known block codes such as, e.g. Hamming codes, e.g. generalized LDPC codes}
- H03M 13/157: {Polynomial evaluation, i.e. determination of a polynomial sum at a given value}
- H03M 13/2906: {using block codes (H03M13/2957 takes precedence)}
- H03M 13/616: {Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations}
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- 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

The present disclosure relates to information transmission method, decoding method, and apparatus. One example method includes encoding, by a sending device, a to-be-encoded sequence based on preset parameters to obtain an encoded sequence, where the preset parameters include a quantity of check bits, positions of the check bits, and a check equation, and sending the encoded sequence to a receiving device.

## Claims

### Claim 1

An information transmission method, comprising:
encoding a to-be-encoded sequence based on preset parameters to obtain an encoded sequence, wherein the preset parameters comprise a quantity of check bits, positions of the check bits, and a check equation, wherein a length of the to-be-encoded sequence is K, and wherein K is an integer greater than 0; and
sending the encoded sequence.

### Claim 2 (depends on 1)

The method according to claim 1, wherein:
the quantity of the check bits is preconfigured;
the quantity of the check bits is determined based on a list length of a decoder;
the quantity of the check bits is determined based on a code length and a code rate;
the quantity of the check bits is determined based on a preconfigured quantity of bits, a list length of a decoder, a code length, and a code rate;
the quantity of the check bits is J, and J≥log2(T/FAR), wherein T is a maximum quantity of checks that are allowed to be performed by using a check bit, and wherein FAR is a maximum false alarm rate of a single check performed by using a check bit; or
the quantity of the check bits is J(T), and J(T)=J(1)+ΔJ=J(1)+log2T, wherein J(1) is a quantity of check bits that need to be used in a single check, wherein J(T) is a quantity of check bits that need to be used in T checks, and wherein T is a maximum quantity of checks that are allowed to be performed by using a check bit.

### Claim 3 (depends on 1)

The method according to claim 1, wherein a position sequence number of a bit in the to-be-encoded sequence is any integer greater than or equal to 0 and less than K; and
wherein the positions of the check bits are:
positions of FP consecutive bits selected starting from a bit whose position sequence number is NX in descending order of position sequence numbers of bits in the to-be-encoded sequence; or
positions of FP consecutive bits selected starting from a bit whose position sequence number is NX in ascending order of position sequence numbers of bits in the to-be-encoded sequence, wherein 0≤NX≤K, and wherein 0<FP<K.

### Claim 4 (depends on 1)

The method according to claim 1, wherein the positions of the check bits are:
bit positions selected from a new generator matrix, wherein the new generator matrix is obtained by performing row-column transformation on a check generator matrix and moving check bits in the check generator matrix that depend only on some information bits to subchannels with smaller sequence numbers.

### Claim 5 (depends on 1)

The method according to claim 1, wherein:
the positions of the check bits correspond to a position of any bit in the to-be-encoded sequence;
the positions of the check bits correspond to positions of a plurality of bits in the to-be-encoded sequence, wherein positions of at least two of the plurality of bits are non-consecutive; or
the positions of the check bits are determined based on position parameters, wherein the position parameters comprise at least an information threshold ZI and a check threshold ZP, wherein the information threshold ZI is used to represent reliability corresponding to a least reliable subchannel of all information subchannels, and wherein the check threshold ZP is used to represent reliability corresponding to a least reliable subchannel in a set of subchannels whose reliability is greater than the information threshold ZI and whose row weight is the largest among all check subchannels.

### Claim 6 (depends on 1)

The method according to claim 1, wherein the check equation is determined based on a polynomial, wherein the polynomial is represented by using one of a binary form, an octal form, a decimal form, a hexadecimal form, and a position vector.

### Claim 7 (depends on 1)

The method according to claim 1, wherein the check equation is determined based on a check equation table, wherein the check equation table comprises at least check bits, information bits, and information bits that participate in the check equation.

### Claim 8 (depends on 1)

The method according to claim 1, wherein optional positions of the check bits are all subchannel positions whose reliability is less than information threshold Z1, wherein the information threshold Z1 is reliability or a polarization weight corresponding to a least reliable subchannel of all information subchannels.

### Claim 9 (depends on 1)

The method according to claim 1, wherein the check bits are parity check bits, and wherein positions of the parity check bits are selected based on a subchannel row weight.

### Claim 10

An information transmission method, comprising:
receiving an encoded sequence, wherein the encoded sequence is obtained by encoding a to-be-encoded sequence based on preset parameters, wherein a length of the to-be-encoded sequence is K, and wherein K is an integer greater than 0; and
decoding the encoded sequence based on the preset parameters to obtain a decoded sequence, wherein the preset parameters comprise a quantity of check bits, positions of the check bits, and a check equation.

### Claim 11 (depends on 10)

The method according to claim 10, wherein:
the quantity of the check bits is preconfigured;
the quantity of the check bits is determined based on a list length of a decoder;
the quantity of the check bits is determined based on a code length and a code rate;
the quantity of the check bits is determined based on a preconfigured quantity of bits, a list length of a decoder, a code length, and a code rate;
the quantity of the check bits is J, and J≥log2(T/FAR), wherein T is a maximum quantity of checks that are allowed to be performed by using a check bit, and wherein FAR is a maximum false alarm rate of a single check performed by using a check bit; or
the quantity of the check bits is J(T), and J(T)=J(1)+ΔJ=J(1)+log2T, wherein J(1) is a quantity of check bits that need to be used in a single check, wherein J(T) is a quantity of check bits that need to be used in T checks, and wherein T is a maximum quantity of checks that are allowed to be performed by using a check bit.

### Claim 12 (depends on 10)

The method according to claim 10, wherein a position sequence number of a bit in the to-be-encoded sequence is any integer greater than or equal to 0 and less than K, and wherein the positions of the check bits are:
positions of FP consecutive bits selected starting from a bit whose position sequence number is NX in descending order of position sequence numbers of bits in the to-be-encoded sequence; or
positions of FP consecutive bits selected starting from a bit whose position sequence number is NX in ascending order of position sequence numbers of bits in the to-be-encoded sequence, wherein 0≤NX≤K, and wherein 0<FP<K.

### Claim 13 (depends on 10)

The method according to claim 10, wherein the positions of the check bits are:
bit positions selected from a new generator matrix, wherein the new generator matrix is obtained by performing row-column transformation on a check generator matrix and moving check bits in the check generator matrix that depend only on some information bits to sub channels with smaller sequence numbers.

### Claim 14 (depends on 10)

The method according to claim 10, wherein:
the positions of the check bits correspond to a position of any bit in the to-be-encoded sequence;
the positions of the check bits correspond to positions of a plurality of bits in the to-be-encoded sequence, wherein positions of at least two of the plurality of bits are non-consecutive; or
the positions of the check bits are determined based on position parameters, wherein the position parameters comprise at least an information threshold ZI and a check threshold ZP, wherein the information threshold ZI is used to represent reliability corresponding to a least reliable subchannel of all information subchannels, and wherein the check threshold ZP is used to represent reliability corresponding to a least reliable subchannel in a set of subchannels whose reliability is greater than the information threshold ZI and whose row weight is the largest among all check subchannels.

### Claim 15 (depends on 10)

The method according to claim 10, wherein the check equation is determined based on a polynomial, wherein the polynomial is represented by using one of a binary form, an octal form, a decimal form, a hexadecimal form, and a position vector.

### Claim 16 (depends on 10)

The method according to claim 10, wherein the check equation is determined based on a check equation table, wherein the check equation table comprises at least check bits, information bits, and information bits that participate in the check equation.

### Claim 17 (depends on 10)

The method according to claim 10, wherein optional positions of the check bits are all subchannel positions whose reliability is less than information threshold ZI, wherein the information threshold ZI is reliability or a polarization weight corresponding to a least reliable subchannel of all information subchannels.

### Claim 18 (depends on 10)

The method according to claim 10, wherein the check bits are parity check bits, and wherein positions of the parity check bits are selected based on a subchannel row weight.

### Claim 19

An information transmission apparatus, comprising:
at least one processor, the at least one processor configured to encode a to-be-encoded sequence based on preset parameters to obtain an encoded sequence, wherein the preset parameters comprise a quantity of check bits, positions of the check bits, and a check equation, wherein a length of the to-be-encoded sequence is K, and wherein K is an integer greater than 0; and
a transmitter, the transmitter configured to send the encoded sequence to a receiving device.

### Claim 20 (depends on 19)

The apparatus according to claim 19, wherein:
the quantity of the check bits is preconfigured;
the quantity of the check bits is determined based on a list length of a decoder;
the quantity of the check bits is determined based on a code length and a code rate;
the quantity of the check bits is determined based on a preconfigured quantity of bits, a list length of a decoder, a code length, and a code rate;
the quantity of the check bits is J, and J≥log2(T/FAR), wherein T is a maximum quantity of checks that are allowed to be performed by using a check bit, and wherein FAR is a maximum false alarm rate of a single check performed by using a check bit; or
the quantity of the check bits is J(T), and J(T)=J(1)+ΔJ=J(1)+log2T, wherein J(1) is a quantity of check bits that need to be used in a single check, wherein J(T) is a quantity of check bits that need to be used in T checks, and wherein T is a maximum quantity of checks that are allowed to be performed by using a check bit.

### Claim 21 (depends on 19)

The apparatus according to claim 19, wherein a position sequence number of a bit in the to-be-encoded sequence is any integer greater than or equal to 0 and less than K, and wherein the positions of the check bits are:
positions of FP consecutive bits selected starting from a bit whose position sequence number is Nx in descending order of position sequence numbers of bits in the to-be-encoded sequence; or
positions of FP consecutive bits selected starting from a bit whose position sequence number is NX in ascending order of position sequence numbers of bits in the to-be-encoded sequence, wherein 0≤NX≤K, and wherein 0<FP<K.

### Claim 22 (depends on 19)

The apparatus according to claim 19, wherein the positions of the check bits are:
bit positions selected from a new generator matrix, wherein the new generator matrix is obtained by performing row-column transformation on a check generator matrix and moving check bits in the check generator matrix that depend only on some information bits to sub channels with smaller sequence numbers.

### Claim 23 (depends on 19)

The apparatus according to claim 19, wherein:
the positions of the check bits correspond to a position of any bit in the to-be-encoded sequence;
the positions of the check bits correspond to positions of a plurality of bits in the to-be-encoded sequence, wherein positions of at least two of the plurality of bits are non-consecutive; or
the positions of the check bits are determined based on position parameters, wherein the position parameters comprise at least an information threshold ZI and a check threshold ZP, wherein the information threshold ZI is used to represent reliability corresponding to a least reliable subchannel of all information subchannels, and wherein the check threshold ZP is used to represent reliability corresponding to a least reliable subchannel in a set of subchannels whose reliability is greater than the information threshold ZI and whose row weight is the largest among all check subchannels.

### Claim 24 (depends on 19)

The apparatus according to claim 19, wherein the check equation is determined based on a polynomial, wherein the polynomial is represented by using one of a binary form, an octal form, a decimal form, a hexadecimal form, and a position vector.

### Claim 25 (depends on 19)

The apparatus according to claim 19, wherein the check equation is determined based on a check equation table, wherein the check equation table comprises at least check bits, information bits, and information bits that participate in the check equation.

### Claim 26 (depends on 19)

The apparatus according to claim 19, wherein optional positions of the check bits are all subchannel positions whose reliability is less than information threshold ZI, wherein the information threshold ZI is reliability or a polarization weight corresponding to a least reliable subchannel of all information subchannels.

### Claim 27 (depends on 19)

The apparatus according to claim 19, wherein the check bits are parity check bits, and wherein positions of the parity check bits are selected based on a subchannel row weight.

### Claim 28 (depends on 1)

An apparatus in a wireless communication network, comprising a memory and at least one processor, wherein the memory stores program instructions which, when executed by the at least one processor, cause the apparatus to perform the method according to claim 1.

### Claim 29

An information transmission apparatus, comprising:
a receiver, the receiver configured to receive an encoded sequence sent by a sending device, wherein the encoded sequence is obtained by encoding a to-be-encoded sequence based on preset parameters, wherein a length of the to-be-encoded sequence is K, and wherein K is an integer greater than 0; and
at least one processor, the at least one processor configured to decode the encoded sequence based on the preset parameters to obtain a decoded sequence, wherein the preset parameters comprise a quantity of check bits, positions of the check bits, and a check equation.

### Claim 30 (depends on 29)

The apparatus according to claim 29, wherein:
the quantity of the check bits is preconfigured,
the quantity of the check bits is determined based on a list length of a decoder;
the quantity of the check bits is determined based on a code length and a code rate;
the quantity of the check bits is determined based on a preconfigured quantity of bits, a list length of a decoder, a code length, and a code rate;
the quantity of the check bits is J, and J≥log2(T/FAR), wherein T is a maximum quantity of checks that are allowed to be performed by using a check bit, and wherein FAR is a maximum false alarm rate of a single check performed by using a check bit; or
the quantity of the check bits is J(T) and J(T)=J(1)+ΔJ=J(1)30 log2T, wherein J(1) is a quantity of check bits that need to be used in a single check, wherein J(T) is a quantity of check bits that need to be used in T checks, and wherein T is a maximum quantity of checks that are allowed to be performed by using a check bit.

### Claim 31 (depends on 29)

The apparatus according to claim 29, wherein a position sequence number of a bit in the to-be-encoded sequence is any integer greater than or equal to 0 and less than K, and wherein the positions of the check bits are:
positions of FP consecutive bits selected starting from a bit whose position sequence number is NX in descending order of position sequence numbers of bits in the to-be-encoded sequence; or positions of FP consecutive bits selected starting from a bit whose position sequence number is NX in ascending order of position sequence numbers of bits in the to-be-encoded sequence, wherein 0≤NX≤K, and wherein 0<FP<K.

### Claim 32 (depends on 29)

The apparatus according to claim 29, wherein the positions of the check bits are:
bit positions selected from a new generator matrix, wherein the new generator matrix is obtained by performing row-column transformation on a check generator matrix and moving check bits in the check generator matrix that depend only on some information bits to sub channels with smaller sequence numbers.

### Claim 33 (depends on 29)

The apparatus according to claim 29, wherein:
the positions of the check bits correspond to a position of any bit in the to-be-encoded sequence;
the positions of the check bits correspond to positions of a plurality of bits in the to-be-encoded sequence, wherein positions of at least two of the plurality of bits are non-consecutive; or
the positions of the check bits are determined based on position parameters, wherein the position parameters comprise at least an information threshold ZI and a check threshold ZP, wherein the information threshold ZI is used to represent reliability corresponding to a least reliable subchannel of all information subchannels, and wherein the check threshold ZP is used to represent reliability corresponding to a least reliable subchannel in a set of subchannels whose reliability is greater than the information threshold ZI and whose row weight is the largest among all check subchannels.

### Claim 34 (depends on 29)

The apparatus according to claim 29, wherein the check equation is determined based on a polynomial, wherein the polynomial is represented by using one of a binary form, an octal form, a decimal form, a hexadecimal form, and a position vector.

### Claim 35 (depends on 29)

The apparatus according to claim 29, wherein the check equation is determined based on a check equation table, wherein the check equation table comprises at least check bits, information bits, and information bits that participate in the check equation.

### Claim 36 (depends on 29)

The apparatus according to claim 29, wherein optional positions of the check bits are all subchannel positions whose reliability is less than information threshold ZI, wherein the information threshold ZI is reliability or a polarization weight corresponding to a least reliable subchannel of all information subchannels.

### Claim 37 (depends on 29)

The apparatus according to claim 29, wherein the check bits are parity check bits, and wherein positions of the parity check bits are selected based on a subchannel row weight.

### Claim 38 (depends on 10)

An apparatus in a wireless communication network, comprising a memory and at least one processor, wherein the memory stores program instructions which, when executed by the at least one processor, cause the apparatus to perform the method according to claim 10.

### Claim 39 (depends on 1)

A non-transitory computer-readable storage medium comprising instructions which, when executed by at least one processor of a sending device, cause the sending device to perform the method according to claim 1.

### Claim 40 (depends on 10)

A non-transitory computer-readable storage medium comprising instructions which, when executed by at least one processor of a receiving device, cause the receiving device to perform the method according to claim 10.