Data transmission method, communication node, and computer readable storage medium
Disclosed are a data transmission method, a communication node, and a non-transitory computer readable storage medium. The method is applied to a first communication node and may include: acquiring a first bit sequence f 0 , f 1 , f 2 , . . . , f E−1 ; mapping every Qm bits in the first bit sequence f 0 , f 1 , f 2 , . . . , f E−1 to one complex-valued modulation symbol based on a Regular Amplitude Phase Shift Keying (RAPSK) constellation to obtain a symbol sequence x 0 , x 1 , x 2 , . . . , x E/Qm−1 , wherein E denotes a length of the first bit sequence and is a positive integer, Qm denotes a modulation order of RAPSK modulation, and the RAPSK constellation has 2 Qm constellation points; and transmitting the symbol sequence x 0 , x 1 , x 2 , . . . , x E/Qm−1 to a second communication node.
1 . A data transmission method, performed by a first communication node, the method comprising:
acquiring a first bit sequence f 0 , f 1 , f 2 , . . . , f E−1 ;
mapping every Qm bits in the first bit sequence f 0 , f 1 , f 2 , . . . , f E−1 to one complex-valued modulation symbol based on a Regular Amplitude Phase Shift Keying (RAPSK) constellation to obtain a symbol sequence x 0 , x 1 , x 2 , . . . , x E/Qm−1 , wherein E denotes a length of the first bit sequence and is a positive integer, Qm denotes a modulation order of RAPSK modulation, and the RAPSK constellation has 2 Qm constellation points; and
transmitting the symbol sequence x 0 , x 1 , x 2 , . . . , x E/Qm−1 to a second communication node;
wherein the RAPSK constellation comprises at least one of the following features:
all the constellation points in the RAPSK constellation are located on Na=2 ma concentric circles, wherein ma denotes a number of amplitude mapping bits, and ma=Qm/2−1;
all the constellation points in the RAPSK constellation are located on Na=2 ma concentric circles, and there are Np=2 mp constellation points on each concentric circle, wherein ma denotes a number of amplitude mapping bits, mp denotes a number of phase mapping bits, and mp=Qm−ma;
there are Np=2 mp constellation points on each concentric circle of the RAPSK constellation, wherein mp denotes a number of phase mapping bits, and mp=Qm/2+1;
all the constellation points in the RAPSK constellation are located on Na=2 ma concentric circles, and a concentric circle labeled i has a radius of r i =r 0 +i·D, wherein i=0, 1, . . . , Na−1, ma denotes a number of amplitude mapping bits, r 0 denotes a minimum radius, D denotes an interval between adjacent concentric circles, and r 0 has a value range which is a function of Qm; or
all the constellation points in the RAPSK constellation are located on Na=2 ma concentric circles, and a concentric circle labeled i has a radius of r i =r 0 +i·D, wherein i=0, 1, . . . , Na−1, ma denotes a number of amplitude mapping bits, r 0 denotes a minimum radius, D denotes an interval between adjacent concentric circles, and D has a value range which is a function of Qm.
2 . The method of claim 1 , wherein every Qm bits [f k·Qm , f 1+k·Qm , f 2+k·Qm , . . . f Qm−1+k·Qm ]=[b 0 , b 1 , . . . , b Qm−1 ] in the first bit sequence f 0 , f 1 , f 2 , . . . , f E−1 are mapped to one complex-valued modulation symbol x k =x, where k=0, 1, . . . , E/Qm−1; and
the mp phase mapping bits c 1,0 , c 1,1 , . . . , c 1,mp−1 are determined in any one of the following manners:
the phase mapping bits c 1,0 , c 1,1 , . . . , c 1,mp−1 are the first mp bits of the Qm bits b 0 , b 1 , . . . , b Qm−1 ;
the phase mapping bits c 1,0 , c 1,1 , . . . , c 1,mp−1 are the first mp bits of the Qm bits b 0 , b 1 , . . . , b Qm−1 with positions of the bits b 0 and b 1 exchanged;
the phase mapping bits c 1,0 , c 1,1 , . . . , c 1,mp−1 are the last mp bits of the Qm bits b 0 , b 1 , . . . , b Qm−1 ; or
the phase mapping bits c 1,0 , c 1,1 , . . . , c 1,mp−1 are the first 2 bits and the odd-indexed bits in the last Qm−2 bits of the Qm bits b 0 , b 1 , . . . , b Qm−1 .
3 . The method of claim 1 , wherein every Qm bits [f k·Qm , f 1+k·Qm , f 2+k·Qm , . . . , f Qm−1+k·Qm ]=[b 0 , b 1 , . . . , b Qm−1 ] in the first bit sequence f 0 , f 1 , f 2 , . . . , f E−1 are mapped to one complex-valued modulation symbol x k =x, where k=0, 1, . . . , E/Qm−1; and
the ma amplitude mapping bits c 2,0 , c 2,1 , . . . , c 2,ma−1 are determined in any one of the following manners:
the amplitude mapping bits c 2,0 , c 2,1 , . . . , c 2,ma−1 are the last ma bits of the Qm bits b 0 , b 1 , . . . , b Qm−1 ;
the amplitude mapping bits c 2,0 , c 2,1 , . . . , c 2,ma−1 are the first ma bits of the Qm bits b 0 , b 1 , . . . , b Qm−1 ; or
the amplitude mapping bits c 2,0 , c 2,1 , . . . , c 2,ma−1 are the even-indexed bits in the last Qm−2 bits of the Qm bits b 0 , b 1 , . . . , b Qm−1 .
4 . The method of claim 1 , wherein every Qm bits [f k·Qm , f 1+k·Qm , f 2+k·Qm , . . . f Qm−1+k·Qm ]=[b 0 , b 1 , . . . , b Qm−1 ] in the first bit sequence f 0 , f 1 , f 2 , . . . , f E−1 are mapped to one complex-valued modulation symbol x k =x, where k=0, 1, . . . , E/Qm−1;
the Qm bits of one complex-valued modulation symbol x comprise a first segment of bits, a second segment of bits, and a third segment of bits; and
the first segment of bits comprises two sign mapping bits d 1,0 and d 1,1 , the second segment of bits comprises mp−2 bits d 2,0 , d 2,1 , . . . , d 2,mp−3 , and the third segment of bits comprise ma=Qm-mp bits d 3,0 , d 3,1 , . . . , d 3,ma−1 , wherein 2≤mp<Qm.
5 . The method of claim 4 , wherein the first segment of bits d 1,0 and d 1,1 are determined in any one of the following manners:
the first segment of bits d 1,0 and d 1,1 are the first 2 bits of the Qm bits b 0 , b 1 , . . . , b Qm−1 ;
the first segment of bits d 1,0 and d 1,1 are the first 2 bits of the Qm bits b 0 , b 1 , . . . , b Qm−1 with positions of the bits b 0 and b 1 exchanged; or
the first segment of bits d 1,0 and d 1,1 are the two bits with indexes ma and ma+1 in the Qm bits b 0 , b 1 , . . . , bd.
6 . The method of claim 4 , wherein the second segment of bits d 2,0 , d 2,1 , . . . , d 2,mp−3 are determined in any one of the following manners:
the second segment of bits d 2,0 , d 2,1 , . . . , d 2,mp−3 are the bits with indexes from 2 to mp−1 in the Qm bits b 0 , b 1 , . . . , b Qm−1 ;
the second segment of bits d 2,0 , d 2,1 , . . . , d 2,mp−3 are the last mp−2 bits of the Qm bits b 0 , b 1 , . . . , b Qm−1 ; or
the second segment of bits d 2,0 , d 2,1 , . . . , d 2,mp−3 are the odd-indexed bits in the last Qm−2 bits of the Qm bits b 0 , b 1 , . . . , b Qm−1 .
7 . The method of claim 4 , wherein the third segment of bits d 3,0 , d 3,1 , . . . , d 3,ma−1 are determined in any one of the following manners:
the third segment of bits d 3,0 , d 3,1 , . . . , d 3,ma−1 are the last ma bits of the Qm bits b 0 , b 1 , . . . , b Qm−1 ;
the third segment of bits d 3,0 , d 3,1 , . . . , d 3,ma−1 are the first ma bits of the Qm bits b 0 , b 1 , . . . , b Qm−1 ; or
the third segment of bits d 3,0 , d 3,1 , . . . , d 3,ma−1 are the even-indexed bits in the last Qm−2 bits of the Qm bits b 0 , b 1 , . . . , b Qm−1 .
8 . The method of claim 1 , wherein, in a case where mp or ma is greater than 1, mp phase mapping bits c 1,0 , c 1,1 , . . . , c 1,mp−1 and ma amplitude mapping bits c 2,0 , c 2,1 , . . . , c 2,ma−1 use the same Gray mapping scheme.
9 . The method of claim 1 , wherein, in a case where mp−2 or ma is greater than 1, mp−2 bits d 2,0 , d 2,1 , . . . , d 2,mp−3 and ma bits d 3,0 , d 3,1 , . . . , d 3,ma−1 use the same Gray mapping scheme.
10 . The method of claim 1 , wherein acquiring a first bit sequence f 0 , f 1 , f 2 , . . . , f E−1 comprises:
acquiring a second bit sequence e 0 , e 1 , e 2 , . . . , e E−1 from a transport block; and
subjecting the second bit sequence e 0 , e 1 , e 2 , . . . , e E−1 to bit interleaving to obtain the first bit sequence f 0 , f 1 , f 2 , . . . , f E−1 .
11 . The method of claim 10 , wherein the first K bits of the second bit sequence e 0 , e 1 , e 2 , . . . , e E−1 are input bits of channel coding, wherein 0<K<E.
12 . A communication node, comprising a processor, wherein
the processor is configured to perform the data transmission method of claim 1 when executing a computer program.
13 . A non-transitory computer-readable storage medium storing a computer program which, when executed by a processor, causes the processor to perform the data transmission method of claim 1 .
14 . A data transmission method, performed by a second communication node, the method comprising:
receiving a symbol sequence x 0 , x 1 , x 2 , . . . , x E/Qm−1 transmitted by a first communication node, the symbol sequence x 0 , x 1 , x 2 , . . . , x E/Qm−1 being obtained by the first communication node mapping every Qm bits in a first bit sequence f 0 , f 1 , f 2 , . . . , f E−1 to one complex-valued modulation symbol based on a Regular Amplitude Phase Shift Keying (RAPSK) constellation, wherein E denotes a length of the first bit sequence and is a positive integer, Qm denotes a modulation order of RAPSK modulation, and the RAPSK constellation has 2 Qm constellation points;
wherein the RAPSK constellation comprises at least one of the following features:
all the constellation points in the RAPSK constellation are located on Na=2 ma concentric circles, wherein ma denotes a number of amplitude mapping bits, and ma=Qm/2−1;
all the constellation points in the RAPSK constellation are located on Na=2 ma concentric circles, and there are Np=2 mp constellation points on each concentric circle, wherein ma denotes a number of amplitude mapping bits, mp denotes a number of phase mapping bits, and mp=Qm−ma;
there are Np=2 mp constellation points on each concentric circle of the RAPSK constellation, wherein mp denotes a number of phase mapping bits, and mp=Qm/2+1;
all the constellation points in the RAPSK constellation are located on Na=2 ma concentric circles, and a concentric circle labeled i has a radius of r i =r 0 +i·D, wherein i=0, 1, . . . , Na−1, ma denotes a number of amplitude mapping bits, r 0 denotes a minimum radius, D denotes an interval between adjacent concentric circles, and r 0 has a value range which is a function of Qm; or
all the constellation points in the RAPSK constellation are located on Na=2 ma concentric circles, and a concentric circle labeled i has a radius of r i =r 0 +i·D, wherein i=0, 1, . . . , Na−1, ma denotes a number of amplitude mapping bits, r 0 denotes a minimum radius, D denotes an interval between adjacent concentric circles, and D has a value range which is a function of Qm.
15 . The method of claim 14 , wherein every Qm bits [f k·Qm , f 1+k·Qm , f 2+k·Qm , . . . , f Qm−1+k·Qm ]=[b 0 , b 1 , . . . , b Qm−1 ] in the first bit sequence f 0 , f 1 , f 2 , . . . , f E−1 are mapped to one complex-valued modulation symbol x k =x, where k=0, 1, . . . , E/Qm−1;
the mp phase mapping bits c 1,0 , c 1,1 , . . . , c 1,mp−1 are determined in any one of the following manners:
the phase mapping bits c 1,0 , c 1,1 , . . . , c 1,mp−1 are the first mp bits of the Qm bits b 0 , b 1 , . . . , b Qm−1 ;
the phase mapping bits c 1,0 , c 1,1 , . . . , c 1,mp−1 are the first mp bits of the Qm bits b 0 , b 1 , . . . , b Qm−1 with positions of the bits b 0 and b 1 exchanged;
the phase mapping bits c 1,0 , c 1,1 , . . . , c 1,mp−1 are the last mp bits of the Qm bits b 0 , b 1 , . . . , b Qm−1 ; or
the phase mapping bits c 1,0 , c 1,1 , . . . , c 1,mp−1 are the first 2 bits and the odd-indexed bits in the last Qm−2 bits of the Qm bits b 0 , b 1 , . . . , b Qm−1 .
16 . The method of claim 14 , wherein every Qm bits [f k·Qm , f 1+k·Qm , f 2+k·Qm , . . . , f Qm−1+k·Qm ]=[b 0 , b 1 , . . . , b Qm−1 ] in the first bit sequence f 0 , f 1 , f 2 , . . . , f E−1 are mapped to one complex-valued modulation symbol x k =x, where k=0, 1, . . . , E/Qm−1;
the mp phase mapping bits c 1,0 , c 1,1 , . . . , c 1,mp−1 are determined in any one of the following manners:
the phase mapping bits c 1,0 , c 1,1 , . . . , c 1,mp−1 are the first mp bits of the Qm bits b 0 , b 1 , . . . , b Qm−1 ;
the phase mapping bits c 1,0 , c 1,1 , . . . , c 1,mp−1 are the first mp bits of the Qm bits b 0 , b 1 , . . . , b Qm−1 with positions of the bits b 0 and b 1 exchanged;
the phase mapping bits c 1,0 , c 1,1 , . . . , c 1,mp−1 are the last mp bits of the Qm bits b 0 , b 1 , . . . , b Qm−1 ; or
the phase mapping bits c 1,0 , c 1,1 , . . . , c 1,mp−1 are the first 2 bits and the odd-indexed bits in the last Qm−2 bits of the Qm bits b 0 , b 1 , . . . , b Qm−1 .
17 . A communication node, comprising a processor, wherein the processor is configured to perform the data transmission method of claim 14 when executing a computer program.
18 . A non-transitory computer-readable storage medium storing a computer program which, when executed by a processor, causes the processor to perform the data transmission method of claim 14 .