Granted Patent B2

US 12,542,621 · App. 18/648,918 · Granted Feb 3, 2026

Inventors: Xianbin Wang (Hangzhou, CN); Huazi Zhang (Hangzhou, CN); Jiajie Tong (Hangzhou, CN); Shengchen Dai (Hangzhou, CN); Rong Li (Boulogne Billancourt, FR); Jun Wang (Hangzhou, CN)

Assignee: HUAWEI TECHNOLOGIES CO., LTD.

H04L1/0009H04L1/0033H04L1/0057H03M13/00

Abstract

Claims (174)

1 . An information processing method implemented via a first communication device having processing circuitry including at least one processor, the method comprising:

obtaining, via the first communication device, information bits having K bits, wherein K is a positive integer; and

mapping, via the first communication device, the information bits to a target symbol sequence based on a trellis diagram, wherein

the target symbol sequence includes M symbols,

M is a positive integer greater than K,

the M symbols include m symbols whose values are first values,

the trellis diagram includes at least M directed edges, and

a directed edge, from the M directed edges, corresponds to a value of a first symbol in the target symbol sequence, wherein

the method further comprises:

sequentially determining, via the first communication device, M+1 element nodes in the trellis diagram based on the information bits, wherein the directed edge between two adjacent element nodes, in the M+1 element nodes, is used to determine the value of the first symbol in the target symbol sequence, wherein

a first element node, in the M+1 element nodes, is related to a value of M and a value of m,

the first element node is any one of first M element modes in the M+1 element nodes,

a next mode of the first element mode is a second element node in the M+1 element nodes,

the first element node points to one or more element nodes in the trellis diagram, and

the second element mode is one of the one or more element nodes; and

outputting, via the first communication device, the target symbol sequence to a communication channel.

2 . The method according to claim 1 , wherein the first element node points to a plurality of element nodes, of the one or more element nodes, and values of symbols corresponding to directed edges between the first element node and the plurality of element nodes, to which the first element node points, are different.

3 . The method according to claim 2 , wherein

each element node, from the M+1 element nodes, in the trellis diagram has a value,

the first element node points to the plurality of element nodes, and

a value of the first element node is less than or equal to a sum of values of the plurality of element nodes to which the first element node points.

4 . The method according to claim 1 , wherein

a third element node is any one of the M+1 element nodes,

the third element node indicates a combinatorial number C_I{circumflex over ( )}i, a value of the third element node is less than or equal to the combinatorial number C_I{circumflex over ( )}i, 0≤i≤I, 0≤I≤N, N≥M, and i, I, and N are all integers, and

different element nodes in the trellis diagram indicate different combinatorial numbers.

5 . The method according to claim 4 , wherein

an effective number of bits in a binary number corresponding to the combinatorial number C_I{circumflex over ( )}i is greater than a target effective number of bits,

the value of the third element node is less than the combinatorial number C_I{circumflex over ( )}i, and

the effective number of bits in the binary number corresponding to the value of the third element node is the target effective number of bits.

6 . The method according to claim 4 , wherein

an effective number of bits in a binary number corresponding to the combinatorial number C_I{circumflex over ( )}i is less than or equal to a target effective number of bits, and

the value of the third element node is equal to the combinatorial number C_I{circumflex over ( )}i.

7 . The method according to claim 4 , wherein

a value of I is an even number, and

0

≤

i

≤

I

2

⁢

or

⁢

I

2

≤

i

≤

I

,

a value of I is an odd number, and

0

≤

i

≤

I

-

1

2

⁢

or

⁢

I

-

1

2

<

i

≤

I

.

8 . A communication apparatus, comprising:

a processor; and

a memory configured to store computer readable instructions that, when executed by the processor, cause the communication apparatus to:

obtain information bits having K bits, and wherein K is a positive integer; and

map the information bits to a target symbol sequence based on a trellis diagram, wherein

the target symbol sequence includes M symbols,

M is a positive integer greater than K,

the M symbols include m symbols whose values are first values,

the trellis diagram includes at least M directed edges, and

a directed edge, from the M directed edges, corresponds to a value of a first symbol in the target symbol sequence, wherein

the communication is further caused to:

sequentially determine M+1 element modes in the trellis diagram based on the information bits, wherein the directed edge between two adjacent element nodes, in the M+1 element nodes, is used to determine the value of the first symbol in the target symbol sequence, wherein

a first element node, in the M+1 element nodes, is related to a value of M and a value of m,

the first element node is any one of first M element nodes in the M+1 element nodes,

a next mode of the first element mode is a second element mode in the M+1 element nodes,

the first element node points to one or more element nodes in the trellis diagram, and

the second element mode is one of the one or more element modes; and

output the target symbol sequence to a communication channel.

9 . The communication apparatus according to claim 8 , wherein the first element node points to a plurality of element nodes, of the one or more element nodes, and values of symbols corresponding to directed edges between the first element node and the plurality of element nodes, to which the first element node points, are different.

10 . The communication apparatus according to claim 9 , wherein

each element node, from the M+1 element nodes, in the trellis diagram has a value,

the first element node points to the plurality of element nodes, and

a value of the first element node is less than or equal to a sum of values of the plurality of element nodes to which the first element node points.

11 . The communication apparatus according to claim 8 , wherein

a third element node is any one of the M+1 element nodes,

the third element node indicates a combinatorial number C_I{circumflex over ( )}i, a value of the third element node is less than or equal to the combinatorial number C_I{circumflex over ( )}i, 0≤i≤I, 0≤I≤N, N≥M, and i, I, and N are all integers, and

different element nodes in the trellis diagram indicate different combinatorial numbers.

12 . The communication apparatus according to claim 11 , wherein

an effective number of bits in a binary number corresponding to the combinatorial number C_I{circumflex over ( )}i is greater than a target effective number of bits,

the value of the third element node is less than the combinatorial number C_I{circumflex over ( )}i, and

the effective number of bits in the binary number corresponding to the value of the third element node is the target effective number of bits.

13 . The communication apparatus according to claim 11 , wherein

an effective number of bits in a binary number corresponding to the combinatorial number C_I{circumflex over ( )}i is less than or equal to a target effective number of bits, and

the value of the third element node is equal to the combinatorial number C_I{circumflex over ( )}i.

14 . The communication apparatus according to claim 11 , wherein

a value of I is an even number, and

0

≤

i

≤

I

2

⁢

or

⁢

I

2

≤

i

≤

I

,

a value of I is an odd number, and

0

≤

i

≤

I

-

1

2

or

I

-

1

2

<

i

≤

I

.

15 . A non-transitory computer-readable storage medium having computer readable instructions that, when executed by a computer of a communication apparatus, cause the communication apparatus to provide execution comprising:

obtaining information bits having K bits, and wherein K is a positive integer; and

mapping the information bits to a target symbol sequence based on a trellis diagram, wherein

the target symbol sequence includes M symbols,

M is a positive integer greater than K,

the M symbols include m symbols whose values are first values,

the trellis diagram includes at least M directed edges, and

a directed edge, from the M directed edges, corresponds to a value of a first symbol in the target symbol sequence, wherein

the communication apparatus is further caused to provide execution that comprises:

sequentially determining M+1 element nodes in the trellis diagram based on the information bits, wherein the directed edge between two adjacent element nodes, in the M+1 element nodes, is used to determine the value of the first symbol in the target symbol sequence, wherein

a first element node, in the M+1 element nodes, is related to a value of M and a value of m,

the first element mode is any one of first M element nodes in the M+1 element nodes,

a next mode of the first element node is a second element mode in the MAIL element nodes,

the first element node points to one or more element nodes in the trellis diagram, and

the second element node is one of the one or more element nodes; and

outputting the target symbol sequence to a communication channel.

16 . The non-transitory computer-readable storage medium according to claim 15 , wherein the first element node points to a plurality of element nodes, of the one or more element nodes, and values of symbols corresponding to directed edges between the first element node and the plurality of element nodes, to which the first element node points, are different.

17 . The non-transitory computer-readable storage medium according to claim 16 , wherein

each element node, from the M+1 element nodes, in the trellis diagram has a value,

the first element node points to the plurality of element nodes, and

a value of the first element node is less than or equal to a sum of values of the plurality of element nodes to which the first element node points.

18 . The non-transitory computer-readable storage medium according to claim 15 , wherein

a third element node is any one of the M+1 element nodes,

the third element node indicates a combinatorial number C_I{circumflex over ( )}i, a value of the third element node is less than or equal to the combinatorial number C_I{circumflex over ( )}i, 0≤i≤I, 0≤I≤N, N≥M, and i, I, and N are all integers, and

different element nodes in the trellis diagram indicate different combinatorial numbers.

19 . The non-transitory computer-readable storage medium according to claim 18 , wherein

an effective number of bits in a binary number corresponding to the combinatorial number C_I{circumflex over ( )}i is greater than a target effective number of bits,

the value of the third element node is less than the combinatorial number C_I{circumflex over ( )}i, and

the effective number of bits in the binary number corresponding to the value of the third element node is the target effective number of bits.

20 . The non-transitory computer-readable storage medium according to claim 18 , wherein

an effective number of bits in a binary number corresponding to the combinatorial number C_I{circumflex over ( )}i is less than or equal to a target effective number of bits, and

the value of the third element node is equal to the combinatorial number C_I{circumflex over ( )}i.

Assignments (1)

Priority Claims (1)

Continuity (2)

References Cited (10)