Communication method, communication device, storage medium, and program product

Abstract

The embodiment of the disclosure provides a communication method, a communication device, a storage medium and a program product, relates to the technical field of communication, and can solve the technical problem of low spectrum efficiency in signal transmission in the related art. The method is applied to a first node, and the method comprises the following steps: obtaining an encoding related parameter; determining a first bit sequence based on the encoding related parameter; determining a target sequence based on the encoding related parameter and the first bit sequence; the target sequence is obtained based on a probability amplitude shaping scheme from the first bit sequence; and transmitting a signal comprising the target sequence to a second node.

Description

Technical Field

[0001] This disclosure relates to the field of communication technology, and in particular to a communication method, communication device, storage medium, and program product. Background Technology

[0002] In the fifth-generation (5G) mobile communication system standard of the 3rd Generation Partnership Project (3GPP), quadrature amplitude modulation (QAM) can be used to modulate and transmit signals, thereby improving link-level spectral efficiency.

[0003] However, signal modulation and transmission based solely on quadrature amplitude modulation suffers from low channel capacity, thus lacking a reliable and highly spectral-efficient communication method. Summary of the Invention

[0004] This disclosure provides a communication method, communication device, storage medium, and program product, which can solve the technical problem of low spectral efficiency during signal transmission in related technologies.

[0005] On the one hand, a communication method is provided, applied to the first node, the method including:

[0006] Obtain encoding-related parameters;

[0007] The first bit sequence is determined based on the encoding-related parameters;

[0008] The target sequence is determined based on the encoding-related parameters and the first bit sequence; the target sequence is obtained from the first bit sequence based on the probabilistic amplitude shaping (PAS) scheme.

[0009] Send a signal containing the target sequence to the second node.

[0010] In another aspect, a communication device is provided, comprising: an acquisition module, a determination module, and a transmission module;

[0011] The acquisition module is used to obtain encoding-related parameters;

[0012] The determination module is used to determine the first bit sequence based on encoding-related parameters;

[0013] The determination module is also used to determine the target sequence based on the encoding-related parameters and the first bit sequence; the target sequence is obtained from the first bit sequence based on a probability amplitude shaping scheme;

[0014] The sending module is used to send a signal including the target sequence to the second node.

[0015] On the other hand, a communication method is provided for application to a second node, the method including:

[0016] Obtain encoding-related parameters;

[0017] Receive a signal from the first node that includes the target sequence; the target sequence is obtained from the first bit sequence based on a probability amplitude shaping scheme;

[0018] The first bit sequence is determined based on the encoding-related parameters and the signal including the target sequence.

[0019] In another aspect, a communication device is provided, comprising: an acquisition module, a receiving module, and a determination module;

[0020] The acquisition module is used to obtain encoding-related parameters;

[0021] The receiving module is used to receive a signal including a target sequence from the first node; the target sequence is obtained from the first bit sequence based on a probability amplitude shaping scheme.

[0022] The determination module is used to determine the first bit sequence based on encoding-related parameters and signals including the target sequence.

[0023] In another aspect, a communication device is provided, comprising: a memory and a processor; the memory and the processor are coupled; the memory is used to store a computer program; and the processor, when executing the computer program, implements the method described in any of the above embodiments.

[0024] In another aspect, a computer-readable storage medium is provided, on which computer program instructions are stored, which, when executed by a processor, implement the method described in any of the above embodiments.

[0025] In another aspect, a computer program product is provided, the computer program product including computer program instructions that, when executed by a processor, implement the method described in any of the above embodiments.

[0026] This disclosure provides a communication method applied to a first node. The method includes: acquiring encoding-related parameters; determining a first bit sequence based on the encoding-related parameters; determining a target sequence based on the encoding-related parameters and the first bit sequence; the target sequence being obtained from the first bit sequence using a probability amplitude shaping scheme; and transmitting a signal including the target sequence to a second node. The probability amplitude shaping scheme indicates that equally distributed bits to be encoded are converted into a bit sequence or a symbol sequence with unequal probability distributions. Unequal probability distributions indicate that different symbols have unequal (or uneven) probabilities of occurrence during signal transmission. By using unequal probability distributions, the frequency of occurrence of different symbols during signal transmission can be adjusted, thus ensuring that the occurrence of symbols during signal transmission is as desired, thereby achieving the desired effect. Since the target sequence is obtained from the first bit sequence using the probability amplitude shaping scheme, the distribution of different symbols in the target sequence satisfies the desired distribution, thus enabling more reliable and efficient transmission of signals including the target sequence. Attached Figure Description

[0027] To more clearly illustrate the technical solutions in this disclosure, the accompanying drawings used in some embodiments of this disclosure will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of this disclosure. For those skilled in the art, other drawings can be obtained based on these drawings.

[0028] Figure 1 This disclosure provides a system architecture diagram of a communication system.

[0029] Figure 2 A block diagram of a transmitter link with probability amplitude shaping provided for some embodiments of this disclosure;

[0030] Figure 3 This is a block diagram of a shaping encoder provided in this disclosure;

[0031] Figure 4 A block diagram of a block code-based shaping encoder link provided in this disclosure;

[0032] Figure 5 A block diagram of a low-density parity check code encoding chain provided in this disclosure;

[0033] Figure 6 A block diagram of a probability amplitude shaping coding chain based on a distributed matcher and low-density parity-check code provided in this disclosure;

[0034] Figure 7 A flowchart illustrating a communication method provided in this disclosure;

[0035] Figure 8 This is a schematic diagram illustrating the relationship of a bit sequence provided in this disclosure;

[0036] Figure 9 A flowchart illustrating another communication method provided in this disclosure;

[0037] Figure 10 A schematic diagram of another communication device provided in this disclosure;

[0038] Figure 11 A schematic diagram of another communication device provided in this disclosure;

[0039] Figure 12 A schematic diagram of another communication device provided in this disclosure. Detailed Implementation

[0040] The technical solutions of this disclosure will now be clearly and completely described with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this disclosure, and not all embodiments. Based on the embodiments of this disclosure, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this disclosure.

[0041] It should be noted that, in this disclosure, the terms "exemplary" or "for example" are used to indicate examples, illustrations, or descriptions. Any embodiment or design described as "exemplary" or "for example" in this disclosure should not be construed as being more preferred or advantageous than other embodiments or designs. Specifically, the use of terms such as "exemplary" or "for example" is intended to present the relevant concepts in a concrete manner.

[0042] Hereinafter, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature.

[0043] In the description of this disclosure, unless otherwise stated, " / " means "or," for example, A / B can mean A or B. "And / or" in this document is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, and B alone. Furthermore, "at least one" means one or more, and "more than one" means two or more.

[0044] In this disclosure, mod(x,y) represents the modulo operation, that is, the remainder when x is divided by y. ceil(x) or floor(x) is the floor function, representing the smallest integer greater than or equal to x. Let be the floor function, representing the largest integer less than or equal to x. In the description of this disclosure, the notations S(n) to S(p) and [S(n),...,S(p)] are equivalent and interchangeable, both representing a sequence containing p-n+1 elements. The number of elements p-n+1 contained in the sequence S(n) to S(p) is also called the length or size of the sequence. Without ambiguity, the letter S can also refer to the sequence [S(n),...,S(p)]. For two sequences S1 = [S1(n1),...,S1(p1)] and S2 = [S2(n2),...,S2(p2)], [S1,S2] represents the sequence [S1(n1),...,S1(p1),S2(n2),...,S2(p2)] of length p1-n1+p2-n2+2 formed by concatenating the sequences S1 = [S1(n1),...,S1(p1)] and S2 = [S2(n2),...,S2(p2)] and S2 = [S2(n2),...,S2(p2)].

[0045] In the 5G standard of the 3G Partnership, quadrature amplitude modulation can be used for signal modulation and transmission, thereby improving link spectrum efficiency.

[0046] However, signal modulation and transmission based solely on quadrature amplitude modulation suffers from low channel capacity, thus lacking a reliable and highly spectral-efficient communication method.

[0047] To address the aforementioned technical problems, this disclosure provides a communication method in which a probability amplitude shaping scheme is used to instruct the conversion of equally distributed bits to be encoded into a bit sequence or a symbol sequence with unequal probability distribution. The unequal probability distribution indicates that different symbols have unequal (or uneven) probabilities of occurrence during signal transmission. By using the unequal probability distribution, the frequency of occurrence of different symbols during signal transmission can be adjusted, thus ensuring that the occurrence of symbols during signal transmission is as desired, thereby achieving the desired effect. Since the target sequence is obtained from the first bit sequence based on the probability amplitude shaping scheme, the distribution of different symbols in the target sequence can satisfy the desired distribution, thus enabling more reliable and efficient transmission of signals including the target sequence.

[0048] The communication method provided in this disclosure can be applied to systems with various communication standards. For example, the systems to which the communication method provided in this disclosure is applicable include, but are not limited to, long-term evolution (LTE) systems, various versions based on LTE evolution, 5th generation mobile communication technology (5G) systems, future mobile communication networks (such as 6G and 7G mobile communication networks), or multiple converged communication systems. Furthermore, the communication method provided in this disclosure can also be applied to future-oriented communication systems.

[0049] For example, the above communication method can be applied to, for example, Figure 1 In the aforementioned communication system, such as Figure 1 As shown, the communication system includes: a first node 101 and a second node 102.

[0050] The first node 101 is used to generate a signal including the target sequence and send it to the second node 102; the target sequence is generated based on the first bit sequence and encoding related parameters.

[0051] The second node 102 is used to receive the signal including the target sequence sent from the first node 101, and obtain the first bit sequence by demodulation and decoding.

[0052] In some embodiments, the first bit sequence may be referred to as the information bit sequence.

[0053] In some embodiments, the first node 101 and the second node 102 satisfy one of the following:

[0054] The first node 101 is a base station, and the second node 102 is a terminal;

[0055] The first node 101 is a terminal, and the second node 102 is a base station;

[0056] The first node 101 is a terminal, and the second node 102 is a terminal.

[0057] In some embodiments, the terminal can be a device with wireless transceiver capabilities, which can be deployed on land, including indoors or outdoors, handheld, wearable, or vehicle-mounted; it can also be deployed on water (such as on ships); and it can also be deployed in the air (e.g., on airplanes, balloons, and satellites). The terminal can be a mobile phone, tablet computer, computer with wireless transceiver capabilities, virtual reality (VR) terminal, augmented reality (AR) terminal, wireless terminal in industrial control, wireless terminal in self-driving, wireless terminal in remote medical care, wireless terminal in smart grid, wireless terminal in transportation safety, wireless terminal in smart city, wireless terminal in smart home, etc. The embodiments of this application do not limit the application scenarios. The term "terminal" can sometimes also refer to a user, user equipment (UE), access terminal, UE unit, UE station, mobile station, mobile station, remote station, remote terminal, mobile device, UE terminal, wireless communication device, UE agent, or UE device, etc., but the embodiments of this application do not limit this to these terms.

[0058] In some embodiments, the base station may be a base station in Long Term Evolution (LTE), Long Term Evolution Advanced (LTEA), or an evolved Node B (eNB or eNodeB), a base station device in a 5G network, or a base station in a future communication system, such as gNB, gNodeB, hNB, hNodeB, iNB, or iNodeB. The base station may include various macro base stations, micro base stations, femtocell base stations, wireless remotes, reconfigurable intelligent surfaces (RISS), routers, wireless fidelity (WIFI) devices, or various network-side devices such as primary cells and secondary cells.

[0059] It should be noted that, Figure 1 This is just an example framework diagram. Figure 1 The number of devices included and the names of each device are unlimited.

[0060] like Figure 2 The diagram shown is a block diagram of a probability amplitude shaping transmitter chain provided in an embodiment of this disclosure, including a splitter 201, a shaping encoder 202, a channel encoder 203, and a modulation mapper 204.

[0061] The splitter 201 is used to split, segment, or separate the first bit sequence into a first part and a second part.

[0062] In some embodiments, the first bit sequence can be a bit sequence b(0) to b(K-1) consisting of K bits. The first part is a bit sequence [b1(0),...,b1(K1-1)] consisting of K1 bits, and the second part is a bit sequence [b2(0),...,b2(K2-1)] consisting of K2 bits, where K1 and K2 are non-negative integers, and K, K1, and K2 satisfy K = K1 + K2.

[0063] In some embodiments, b = [b1, b2].

[0064] In some embodiments, b = [b2, b1].

[0065] In some embodiments, a bit sequence b(0) to b(K-1) comprising K bits is a sequence of bits constituting a transport block, wherein the length of the bit sequence b(0) to b(K-1) or the number of bits K is the transport block size.

[0066] In some embodiments, a bit sequence b(0) to b(K-1) of K bits is a sequence obtained by splicing the bits of the transport block and the cyclic redundancy check bits calculated from the bits of the transport block, wherein the length or number of bits K of the bit sequence b(0) to b(K-1) is the sum of the number of bits of the transport block and the number of cyclic redundancy check bits calculated from the bits of the transport block.

[0067] The shaping encoder 202 takes the data of the first part b1(0) to b1(K1-1) of the bit sequence b(0) to b(K-1) as input. It is used to obtain a shaped encoded bit sequence c(0) to c(N1-1) of length N1 from the K1 bits of the first part b1(0) to b1(K1-1) according to the specified non-uniform probability distribution.

[0068] In some embodiments, the ratio K1 of the number of bits in the first part b1(0) to b1(K1-1) and N1 of the number of bits in the shaped bit sequence c(0) to c(N1-1) is called the shaping rate. In this application, the shaping rate is denoted as R. sh Therefore, we have R. sh =K1 / N1.

[0069] In some embodiments, the first part b1(0) to b1(K1-1) is divided into multiple blocks and then shaped and encoded to obtain a bit sequence c of multiple shaped blocks. r The bit sequence c of multiple shaping blocks. r Concatenate to obtain the integer encoded bit sequence c(0)~c(N1-1).

[0070] The channel encoder 203 takes the second part of the bit sequence b2(0)~b2(K2-1) output by the splitter 201 and the bit sequence c(0)~c(N1-1) output by the shaping encoder 202 as input. The channel encoder 203 encodes the input to obtain a channel encoder output bit sequence g(0)~g(Ng-1) of multiple shaping blocks with a length of Ng. Here, Ng is a positive integer.

[0071] In some embodiments, the output bit sequence g(0)~g(Ng-1) of the channel encoder is called the codeword of the channel encoder.

[0072] In some embodiments, the output bit sequence g(0) to g(Ng-1) of the channel encoder is called the check bit sequence of the channel encoder.

[0073] In some embodiments, the channel encoder 203 is typically implemented using binary forward error correction (FEC) codes.

[0074] In some embodiments, the forward error correction code can be one of the following: polar code, low-density parity check code, convolutional code, turbo code, Reed-Muller code, Reed-Solomon code, Bose-Chaudhuri-Hocquenghem code, concatenated code, cyclic code, block code, Hamming code, Golay code, repetition code, or single-parity-check code.

[0075] In some embodiments, the ratio of the length of the input bit sequence of the channel encoder 203 to the length of the output bit sequence of the channel encoder 203 is called the code rate of the FEC code. In this disclosure, the code rate of the FEC code is denoted as R. fec .

[0076] In some embodiments, the FEC code rate R fec It may be specified by the modulation and coding scheme (MCS) and may be indicated by an MCS table.

[0077] Modulation mapper 204 takes the encoded channel encoder output bit sequence g(0)~g(Ng-1) as input. Modulation mapper 204 is configured to map the channel encoder output bit sequence (g) to symbols (e.g., QAM symbols, amplitude-shift keying (ASK) symbols) to obtain a sequence of shaping symbols X(0)~X(Nx-1).

[0078] In some embodiments, the transmitter link further includes a transmitter. The shaped symbol sequence can be transmitted via the transmitter over a wireless channel.

[0079] like Figure 3 The diagram shown is a block diagram of a shaping encoder 202 provided in an embodiment of this application, including a distribution matcher (DM) 301 and an amplitude-to-bit mapper 302.

[0080] The distribution matcher 301 is used to map the K1 bits of the first part b1(0) to b1(K1-1) to the amplitude symbol sequence A(0) to A(NA-1) of the specified non-uniform probability distribution, where NA is a positive integer.

[0081] In some embodiments, each element A(j) in the amplitude symbol sequence takes a value from the set {1,3,5,...,(2...}. Qm / 2 -3),(2 Qm / 2 -1)}, that is, A(j)∈{1,3,5,...,(2 Qm / 2 -3),(2 Qm / 2 -1)}, where Qm is the modulation order of the quadrature amplitude modulation constellation used by the modulation mapper 204 in the transmitter link.

[0082] In some embodiments, each element A(j) in the amplitude symbol sequence takes a value from the amplitude set {1,3,5,...,(2...}). m -3),(2 m -1)}, where m is the modulation order of the amplitude shift keying modulation used by the modulation mapper 204 in the transmitter link. Hereafter, the set {1,3,5,...,(2)} is referred to as the set {1,3,5,...,(2)}. Qm / 2 -3),(2 Qm / 2 -1)} or {1,3,5,...,(2 m -3),(2 m -1)} is the amplitude set.

[0083] In some embodiments, the ratio K1 of the number of bits K1 in the first part b1(0) to b1(K1-1) and the number of amplitudes NA in the amplitude symbol sequence A(0) to A(NA-1) is called the shaping rate. In this case, the shaping rate is also called the distribution matching rate, and the distribution matching rate is also denoted as R. sh R sh =K1 / NA. make This represents the probability that the amplitude symbol A(j) takes the value 2i+1 in all possible amplitude symbol sequences.

[0084] In some embodiments, the integer code rate R sh The amplitude entropy H(A) of the amplitude symbol sequence is determined, and this process satisfies the following formula 1:

[0085]

[0086] Where Qm is the modulation order of the quadrature amplitude modulation constellation used by the modulation mapper 204 in the transmitter link. In some embodiments, the integer code rate R sh The amplitude entropy H(A) of the amplitude symbol sequence is determined, and this process satisfies the following formula 2:

[0087]

[0088] Where m is the modulation order of amplitude shift keying (APS) modulation used by modulation mapper 204 in the transmitter link. A non-uniform probability distribution refers to the existence of i ≠ i' such that... Not equal to Pr(A(j)=2i'+1).

[0089] The amplitude-to-bit mapper 302 takes the amplitude symbol sequence A(0)~A(NA-1) output by the distribution matcher 301 as input; the amplitude-to-bit mapper 302 can output an ordered bit sequence c(0)~c(N1-1).

[0090] In some embodiments, the amplitude-to-bit mapper 302 converts each amplitude A(j) in the amplitude symbol sequence into Qm / 2-1 bits c(j·(Qm / 2-1)), c(j·(Qm / 2-1)+1),...,c(j·(Qm / 2-1)+Qm / 2-2) according to a preset mapping method, and then concatenates them into an ordered bit sequence c(0)~c(N1-1), where the length N1 of the ordered bit sequence c(0)~c(N1-1) is equal to NA·(Qm-2), Qm is the modulation order of the orthogonal amplitude modulation constellation used by the modulation mapper 204 in the transmitter link, and NA is equal to twice the length of the modulation symbol sequence output by the modulation mapper 204 in the transmitter link.

[0091] In some embodiments, the amplitude-to-bit mapper 302 converts each amplitude A(j) in the amplitude symbol sequence into m-1 bits c(j·(m-1)), c(j·(m-1)+1),...,c(j·(m-1)+m-2) according to a preset mapping method, and then concatenates them into an ordered bit sequence c(0)~c(N1-1), where the length N1 of the ordered bit sequence c(0)~c(N1-1) is equal to NA·(m-1), m is the modulation order of the amplitude shift keying modulation used by the modulation mapper in the transmitter link, and NA is equal to the length of the modulation symbol sequence output by the modulation mapper 204 in the transmitter link.

[0092] For example, Table 1 shows a variety of amplitude-to-bit mapping methods.

[0093] Table 1

[0094]

[0095] The diagram shows the bit strings mapped to the amplitude when Qm and m have different values, with N / A indicating that it is not applicable.

[0096] In some embodiments, the ratio K1 of the number of bits K1 in the first part b1(0) to b1(K1-1) input to the distribution matcher 301 and the number of bits N1 in the ordered bit sequence c(0) to c(N1-1) output by the amplitude-to-bit mapper 302 is called the shaping code rate. This shaping code rate is also called the distribution matching code rate, and it is denoted as R. sh R sh =K1 / N1.

[0097] It should be noted that the distributed matcher 301 is the key component of the PAS architecture and represents the earliest implementation of the shaping encoder within it. Transmitters with a PAS architecture can use the distributed matcher to provide non-uniform (i.e., shaped) probability modulation symbols for the constellation. Relying on PAS technology, the distributed matcher 301 can take a sequence of K1 independent bits as input and provide a sequence of NA amplitude symbols with non-uniform probabilities as output. This amplitude symbol sequence represents the first part of the message, b1(0) to b1(K1-1).

[0098] In some embodiments, the distributed matcher may use any of a number of suitable algorithms and any of a number of suitable configurations.

[0099] In some embodiments, the distribution matcher 301 can be one of the following: a constant-composition distribution matcher (CCDM), a bit-level distribution matcher (BL-DM), a product distribution matcher (PDM), a multi-composition distribution matcher (MCDM), a multiset-partition distribution matcher (MPDM), a partition-based distribution matcher, a parallel-amplitude distribution matcher with subset ranking, a streaming distribution matcher, a prefix-free code distribution matcher, a shell mapping, an enumerative sphere shaping (ESS), an approximate enumerative sphere shaping (AESS), or a partial enumerative sphere shaping. Sphere shaping (PESS), Huffman-coded sphere shapingFraming of variable-length distribution matcher outputs into fixed-length blocks, distribution matcher with mark ratio control, hierarchical distribution matcher, parallel bisection-based distribution matcher, and polar-coded distribution matcher.

[0100] It should be noted that the distributed matching techniques listed above are all different. However, the general purpose of distributed matching is to generate a probabilistically determined sequence of symbols for constructing shaped signals, such as ASK or QAM signals.

[0101] Figure 4 A block diagram of a shaping encoder chain based on block code is given, including a log-likelihood ratio generator 401, a channel decoder 402, a channel encoder 403, a bit mask 404, and a multiplexer 405.

[0102] Among them, the shaping encoder link can acquire a set of information bits, such as the bit sequence b1(0)~b1(K1-1) of the first part of the output of the splitter 201, i.e., u=b1.

[0103] In some embodiments, the information bit group u may be equally distributed and may be a bit sequence u = [u0, u1, u2, ..., u] corresponding to a sequence of amplitude symbols. m-1 ], where m is the modulation order of amplitude shift keying modulation used by the modulation mapper in the transmitter link, or m is half of the modulation order Qm of quadrature amplitude modulation used by the modulation mapper in the transmitter link.

[0104] For example, assuming the transmitter link uses a 64-QAM constellation or a corresponding 8-ASK constellation, the number of bits carried by each amplitude symbol is... Or m = log28 = 3. In this case, u = [u0, u1, u2]. The information bit group u may be input to the log-likelihood ratio generator 401 in the shaping encoder link. The log-likelihood ratio generator 401 is configured to generate a set of log-likelihood ratios (LLR) LLR(0) ~ LLR(NL-1) corresponding to the information bit group u.

[0105] In some embodiments, the log-likelihood ratio generator 401 further divides the log-likelihood ratio group into multiple integer blocks according to the length of the integer blocks based on at least a portion of the log-likelihood ratio group for decoding by the channel decoder 402.

[0106] In some embodiments, the goal of probability amplitude shaping is to generate a covering code that maximizes power savings after bit masking. Therefore, the log-likelihood ratio generator 401 can be configured to generate log-likelihood ratios LLR(0) to LLR(NL-1) for the information bit group u based on the amount of power saved by bit flipping.

[0107] For example, assuming the amplitude of the corresponding information bit group is set such that (u0, u1) in the symbol sequence u is equal to (1, 1), flipping or masking u0 will yield... The associated power change is 16. In this case, the corresponding LLR is denoted as "16". For example, Table 2 shows examples of bit flips, LLR values, and power savings.

[0108] Table 2

[0109]

[0110] In some embodiments, dividing the log-likelihood ratio set LLR(0) to LLR(NL-1) into multiple integer blocks can be based on one or more parameters. For example, these parameters may include the number of integer blocks (Cs), which can be defined as... Nre is the number of resource elements (REs) used to transmit information bit groups, and Nsmax is the maximum integer block length. In some cases, Nsmax can be a fixed value in wireless communication standards, such as 512 (i.e., 2^9). The integer block length (Ns) can be defined as... If the length NL of the log-likelihood ratio group LLR(0)~LLR(NL-1) or the length Nin of the input symbol (e.g., possibly defined as NL=Nin=2×Nre) is greater than the length of the integer block (Ns), then multiple integer blocks can be generated by segmentation.

[0111] In some embodiments, after the log-likelihood ratio group LLR(0) to LLR(NL-1) is divided into multiple shaping blocks, the shaping blocks can be sent to the channel decoder 402.

[0112] Channel decoder 402 is configured to decode multiple integer blocks using linear codes or forward error correction codes (FEC codes) to obtain shaping bits (s(0)~s(Ks-1)).

[0113] For example, the channel decoder 402 can be configured according to the integer code rate (R). sh Decoding multiple integer blocks, the integer code rate can be defined as R. sh =Ks / Ns, where Ks is the number of integer bits (s) and Ns is the codeword length (i.e., the length of the integer block) output by the channel encoder 403.

[0114] For example, the channel decoder 402 can be configured according to the integer code rate (R). sh Decoding multiple integer blocks, the integer code rate can be defined as R. sh = Ns / Ks, where Ks is the number of integer bits (s) and Ns is the codeword length (i.e., the length of the integer block) output by the channel encoder 403.

[0115] In some embodiments, linear codes or FEC codes may depend on an integer code rate R. sh The length Ns of the shaping block is determined.

[0116] In some embodiments, the generator matrix (G) of a linear code or FEC code can be based on an integer code rate R. sh Construct the shape block with length Ns.

[0117] In some embodiments, the linear code or FEC code can be one of the following: polar code, low-density parity check code, convolutional code, turbo code, Reed-Muller code, Reed-Solomon code, Bose-Chaudhuri-Hocquenghem code, concatenated code, cyclic code, block code, Hamming code, Golay code, repetition code, or single-parity-check code.

[0118] In some embodiments, the length of the shaped block (Ns) can be determined based on the rate distortion bound and the decoding process of the linear code or FEC code.

[0119] It should be noted that the integer block length (Ns) should be as large as possible, because a larger integer block length can asymptotically reach the rate distortion bound. However, a larger integer block length may cause problems for decoding linear codes or FEC codes, such as concerns about decoding complexity and latency.

[0120] In some embodiments, the number of shaped bits (Ks) can be limited based on the signal-to-noise ratio (SNR) of the wireless channel.

[0121] It should be understood that a larger value for the number of shaping bits (e.g., Ks) can provide better shaping performance, but it increases overhead and reduces the amount of effective data that can be transmitted. Therefore, a trade-off needs to be struck between the number of shaping bits (Ks) and overall performance, similar to distribution matching (DM), where optimization is performed for a specific distribution (e.g., CCDM) or to minimize transmission power (e.g., spherical shaping). Thus, the number of shaping bits (Ks) can be limited based on the signal-to-noise ratio (SNR) of the wireless channel.

[0122] The channel encoder 403 takes an integer bit sequence as input. It can re-encode the integer bit sequence according to the integer code rate and generate an integer code word (v(0)~v(Nv-1)) using linear code or FEC code.

[0123] For example, in order to obtain an integer codeword v, the channel encoder 403 can multiply the integer bit sequence (s) with the generator matrix (G) of the linear code or FEC code according to v = s × G.

[0124] Bit mask module 404 can perform shaping operations on a subset of information bit group u to generate a shaped information bit sequence.

[0125] It should be noted that the goal of shaping is to maximize power savings. Therefore, in order to maximize power savings, the bit masking module 404 can be configured to apply the shaped codeword v to the bit-level of amplitude symbols that have the greatest impact on signal power, such as the most-significant bit (MSB) u0.

[0126] For example, bitmasking module 404 may perform a shaping operation on the MSB, and according to Applied to integer codeword v, where, This indicates bitwise modulo 2 addition.

[0127] Multiplexer 405, to shape information bit sequences (e.g. The unshaped remaining subset of the information bit group u (e.g., u1, u2, ..., u...) m-1 The input consists of an integer bit sequence (s) and an integer bit sequence (s). Based on the input, the output bit sequence c(0) to c(N1-1) of the integer encoder is generated.

[0128] In some embodiments, the multiplexer 405 shaped the information bit sequence and the unerected remaining subsets u1, u2, ..., u in the information bit group u. m-1 And the shaped bit sequence (s) is combined into the output bit sequence c(0)~c(N1-1) of the shaped encoder.

[0129] For example,

[0130] In other embodiments,

[0131] In some other embodiments,

[0132] In some other embodiments,

[0133] In some embodiments, u in the unshaped residual subset of the information bit group u j It is a sequence of length Nx or 2×Nx, where Nx is the length of the modulation symbol sequence output by the modulation mapper 204 in the transmitter link.

[0134] like Figure 5 The diagram shown is a block diagram of a low-density parity-check (LDPC) coding chain provided in an embodiment of this disclosure, including transport block (TB) cyclic redundancy check (CRC) bit attachment 501, code block segmentation and code block CRC attachment 502, LDPC coding 503, rate matching 504, and code block concatenation 505.

[0135] Among them, the CRC attachment 501 of the transmission block is used to determine the CRC attachment output bit sequence b'(0)~b'(Nb'-1) of length Nb'.

[0136] In some embodiments, the transport block CRC attach 501 determines the CRC attach output bit sequence b'(0)~b'(Nb'-1) of length Nb' based on the following parameters: transport block bit sequence a'(0)~a'(Na'-1), the length of transport block bit sequence a' is Na', and the cyclic generator polynomial.

[0137] For example, the cyclic generator polynomial satisfies the following formula 3:

[0138] g CRC (D)=g Lcrc ·D Lcrc +g Lcrc-1 ·D Lcrc-1 +…+g2·D 2 +g1·D 1 +g0 formula 3.

[0139] Where Lcrc is the cyclic generator polynomial g CRC (D) is the highest power, Lcrc is also the number of cyclic redundancy check bits, D is a dummy variable representing the circuit delay, and g Lcrc gLcrc-1 g, ..., g2, g1, g0 are cyclic generating polynomials g CRC (D) The coefficient of the corresponding power term, coefficient g Lcrc-1 g1, g2, and g1 can take values ​​of 0 or 1, and the coefficient g Lcrc =g0=1.

[0140] In some embodiments, the transport block bit sequence a' can be a bit sequence obtained by concatenating the output bit sequence c(0) to c(N1-1) of the shaping encoder output by the shaping encoder 202 and the second part bit sequence b2(0) to b2(K2-1) output by the splitter 201. In one specific example, a' = [c, b2]. In another specific example, a' = [b2, c].

[0141] In some embodiments, the cyclic generator polynomial g CRC The highest power Lcrc of (D) is determined by the length Na' of the transport block bit sequence a' in the following manner:

[0142] When Na' > Nath, Lcrc = 24;

[0143] When Na'≤Nath, Lcrc=16.

[0144] Where Nath is a positive integer. In one specific example, Nath = 3824. In another specific example, Nath = 8424. In yet another specific example, Nath = 1008.

[0145] In some embodiments, the transport block CRC attachment 501 inputs a transport block bit sequence a'(0) to a'(Na'-1) of length Na' into the cyclic generator polynomial g. CRC (D)=g Lcrc ·D Lcrc +g Lcrc-1 ·D Lcrc-1 +…+g2·D 2 +g1·D 1 After calculating Lcrc CRC bits p(0)~p(Lcrc-1), the transport block bit sequence a'(0)~a'(Na'-1) of length Na' is concatenated with Lcrc CRC bits p(0)~p(Lcrc-1) to obtain a CRC attached output bit sequence b'(0)~b'(Nb'-1) of length Nb'=Na'+Lcrc. In this sequence, bits with indices less than Na' in the CRC attached output bit sequence b' are bits in the transport block bit sequence a', and bits with indices greater than or equal to Na' in the CRC attached output bit sequence b' are bits in the Lcrc CRC bits p.

[0146] In the CRC-attached output bit sequence b', the bits with indices less than Na' are the bits in the transport block bit sequence a', and the bits with indices greater than or equal to Na' in the CRC-attached output bit sequence b' are the bits in the Lcrc CRC bits p, satisfying the following formula 4:

[0147] b'(k)=a'(k),k=0,1,2,…,Na'-1,

[0148] b'(k)=p(k-Na'),k=Na',Na'+1,Na'+2,...,Na'+Lcrc-1. Formula 4;

[0149] Code block segmentation and code block CRC attachment 502 are used to segment the CRC-attached output bit sequence b'(0)~b'(Nb'-1) of length Nb' into C code block system bit sequences c'0,c'1,…,c' of length Nc'. C-1 .

[0150] In some embodiments, code block segmentation and code block CRC attachment 502 divide the CRC attachment output bit sequence b'(0)~b'(Nb'-1) of length Nb' into C code block system bit sequences c'0,c'1,…,c' of length Nc' according to the following parameters. C-1 : CRC attached output bit sequence b'(0)~b'(Nb'-1), length of CRC attached output bit sequence Nb', maximum code block size Kcb, number of columns NB of the matrix of the base graph of LDPC code, number of rows MB of the matrix of the base graph of LDPC code, boost value Z.

[0151] Wherein, the boost value Z is the matrix H from the base graph of the LDPC code. BG Extend this to the lifting value of the parity check matrix H, where Kcb and Kb are positive integers.

[0152] In some embodiments, Kcb can take the value 8448 or 3840.

[0153] In some embodiments, Kb can take the value 22, 10, 9, 8 or 6.

[0154] Code block segmentation and code block CRC attachment: 502 divides the CRC-attached output bit sequence b'(0)~b'(Nb'-1) of length Nb' into C code block system bit sequences c'0,c'1,…,c' of length Nc'. C-1 This includes the following steps:

[0155] Step 1: Determine the number of code blocks C, the number of CRC bits per code block L, and the transport block size B' including the CRC bits per code block based on the length Nb' of the CRC attached output bit sequence and the maximum code block size Kcb.

[0156] For example, if LDPC encoding uses the base Figure 1 (base graph 1), set Kcb = 8448; if LDPC encoding uses the base... Figure 2 (base graph 2), set Kcb=3840.

[0157] For example, if Nb' ≤ Kcb, set L = 0, C = 1, and B' = B; if Nb' > Kcb, set L = 24. B' = B + C·L.

[0158] Step 2: Determine the lift value Z for LDPC encoding.

[0159] Step 2-1: Determine the size of the unfilled code block K' = B' / C.

[0160] For example, if LDPC encoding uses the base Figure 1 Set the number of valid system columns to Kb = 22.

[0161] For example, if LDPC encoding uses the base Figure 2 And since B > 640, set Kb = 10.

[0162] For example, if LDPC encoding uses the base Figure 2 And since 640≥B>560, set Kb=9.

[0163] For example, if LDPC encoding uses the base Figure 2 And since 560≥B>192, set Kb=8.

[0164] For example, if LDPC encoding uses the base Figure 2 And B≤192, set Kb=6.

[0165] Step 2-2: Determine the set of elements that satisfy Kb·Z≥K' from the candidate set, and take the minimum value in the set of elements that satisfy the condition as the value of the boost value Z.

[0166] For example, Table 3 shows a candidate set of LDPC lift values ​​Z.

[0167] Table 3

[0168]

[0169] Step 3: Set the length of the bit sequence of a single code block system.

[0170] For example, if LDPC encoding uses the base Figure 1 Set the length Nc' of the bit sequence of a single code block system to Nc' = (NB - MB)·Z = 22·Z.

[0171] For example, if LDPC encoding uses the base Figure 2 Set the length Nc' of the bit sequence of a single code block system to Nc' = (NB - MB)·Z = 10·Z.

[0172] Step 4: Perform code block segmentation and code block CRC attachment operations on r = 0, 1, 2, ..., C-1 to obtain the code block systematic bit sequence c'. r (0)~c' r (Nc'-1).

[0173] Step 4-1: For k = 0, 1, ..., K'-L-1, set c' r (k)=b'((K'-L)·r+k).

[0174] Step 4-2: If the number of code blocks C is greater than 1, then for the bit sequence c' r (0)~c' r (K'-L-1) uses a generating loop to generate the polynomial g'. CRC (D) Calculate L CRC check bits p r (0)~p r (L-1). Where L is the number of CRC bits in the code block.

[0175] For example, generating a cyclic generator polynomial g′ CRC (D)=g CRC24B (D)=D 24 +D 23 +D 6 +D 5 +D+1 and L=24.

[0176] Step 4-3: Plot the L CRC check bits p r (0)~p r (L-1) is attached to the bit sequence c' r (0)~c' r (K'-L-1) followed by L, where L is the number of CRC bits in the code block.

[0177] For example, for k = K'-L, K'-L+1, ..., K'-1, set c' r (k)=p r (k+L-K').

[0178] For example, for k = K', K'+1, ..., Nc'-1, set c' r (k) = <NULL>, where, <null>This indicates a filler bit or an empty bit that is neither "0" nor "1".

[0179] LDPC encoding 503 is used to encode a code block system bit sequence c' of length Nc'. r Encoded as an LDPC-encoded bit sequence d of length Nd r .

[0180] In some embodiments, LDPC encoding 503 uses the following parameters to encode a code block system bit sequence c' of length Nc'. r Encoded as an LDPC-encoded bit sequence d of length Nd r : Code block system bit sequence c' r The following parameters are considered: length of the systematic bit sequence Nc', boost value Z, number of systematic bit punctures Npunc, number of effective systematic columns Kb, and matrix H of the LDPC code's fundamental graph. BG The number of columns NB of the matrix of the LDPC code's base graph, the number of rows MB of the matrix of the LDPC code's base graph, and the parity check matrix H of the LDPC code.

[0181] In some embodiments, the boost value Z is the boost value determined by code block segmentation and code block CRC attachment 502.

[0182] In some embodiments, the number of system bit punctures Npunc is the code block system bit sequence c' r It does not appear in the coded bit sequence d r The number of bits.

[0183] In some embodiments, the number of system bit punches Npunc is equal to the boost value Z.

[0184] In some embodiments, the number of system bit punctures, Npunc, is equal to twice the boost value Z.

[0185] In some embodiments, the effective systematic column number Kb is the number of systematic columns corresponding to the information bits and filler bits in the matrix of the base graph of the LDPC code.

[0186] In some embodiments, the number of columns NB of the matrix of the LDPC code's foundation graph is equal to the number of columns H of the LDPC code's foundation graph. BG The number of columns. MB is the number of rows in the matrix of the LDPC code's fundamental graph, and H is the number of columns in the matrix of the LDPC code's fundamental graph. BG The number of rows. The parity check matrix H of the LDPC code is a matrix H derived from the fundamental graph of the LDPC code. BG The matrix obtained by enhancing or expanding.

[0187] LDPC encoding 503 encodes a code block system bit sequence c' of length Nc'. r Encoded as an LDPC-encoded bit sequence d of length Nd r This includes the following steps:

[0188] Step 1: Set the LDPC encoded bit sequence d r The length is Nd = NB × Z - Npunc.

[0189] Step 2: For k = Npunc, Npunc+1, ..., Nc'-1, set the LDPC encoded bit sequence d as follows. r System bit portion:

[0190] If c' r (k) is not equal to <null>, set d r (k-Npunc)=c' r (k);

[0191] If c' r (k) equals <null>Set c' r (k)=0、d r (k-Npunc) = <NULL>.

[0192] Step 3: Generate Nd+Npunc-Nc' parity bits w = [w(0),...,w(Nd+Npunc-Nc'-1)] such that H×[c' r ,w] T =θ, where, [c' r ,w] T Let θ be a column vector of length NB×Z, and let θ be a zero vector of length MB×Z. Matrix and vector multiplication is performed over the Galois field GF(2). The parity check matrix H of the LDPC code is derived from the matrix H of the fundamental graph of the LDPC code. BG The lift value Z and the set index i corresponding to the lift value Z in Table 3 LS It has been determined.

[0193] Step 4: For k = Nc', Nc'+1, ..., Nd+Npunc, set the LDPC encoded bit sequence d. r The parity bit portion: d r (k-Npunc)=w(k-Nc').

[0194] Rate matching 504 is used to encode bit sequence d from LDPC. r Determine the rate-matched output bit sequence.

[0195] In some embodiments, rate matching 504 is based on the following parameters from the LDPC encoded bit sequence d r Determine the rate-matched output bit sequence: Circular buffer length Ncb, number of transmission layers N layer Modulation order Qm, number of code blocks C, total number of coded bits Ng, redundancy version number rv id The starting position of the redundant version is k0.

[0196] In some embodiments, rate matching 504 includes two modules: bit selection 5041 and bit interleaving 5042.

[0197] For the code block with index r, bit selection 5041 is used to encode the bit sequence d from the LDPC according to the following parameters. r Determine the bit selection sequence e r : Circular buffer length Ncb, number of transport layers N layer , boost value Z, modulation order Qm, number of code blocks C, total number of coded bits Ng, redundancy version number rv id The redundant version starts at position k0.

[0198] In some embodiments, the circular cache length Ncb is determined by higher layer parameters.

[0199] In some embodiments, the number of transport layers N layer Determined by high-level parameters.

[0200] In some embodiments, the boost value Z is the boost value determined by code block segmentation and code block CRC attachment 502.

[0201] In some embodiments, the modulation order Qm is the modulation order of the modulation constellation used by the modulation mapper 204 in the probability amplitude-shaping transmitter link.

[0202] In some embodiments, the number of code blocks C is the number of code blocks determined by code block segmentation and code block CRC attachment 502 in the LDPC coding chain.

[0203] In some embodiments, the total number of coded bits Ng is the total number of coded bits available for transmission of the transport block, and the number of resource elements Nre and the number of transport layers N, determined by higher-layer parameters, are also included. layer The product of the modulation order Qm, G, and the product of the two is given by G = N. layer ×Nre×Qm.

[0204] In some embodiments, the redundant version number rv id Determined by high-level parameters.

[0205] In some embodiments, the redundant version number rv id Obtained from downlink control information.

[0206] In some embodiments, the redundant version number rv id Obtained from the uplink control information.

[0207] In some embodiments, the redundant version start position k0 is determined by the base graph used by the LDPC code and the redundant version number rv. id The circular cache length Ncb and the boost value Z are determined.

[0208] For example, Table 4 shows the starting position k0 for different redundant versions.

[0209] Table 4

[0210]

[0211] The specific operations of bit selection 5041 include:

[0212] Step 1: Set the bit selection sequence e for each code block r Length E r When the code block index r is less than or equal to set up Otherwise, set in, For floor function, it represents the largest integer less than or equal to x; The integer part is the smallest integer greater than or equal to x.

[0213] Step 2: Based on the base diagram and redundancy version number rv used in LDPC codes id The circular cache length Ncb and the boost value Z are determined from Table 4 to determine the starting position k0 of the redundant version.

[0214] Step 3: For the code block with index r, encode the bit sequence d from the LDPC. r Starting with the bit at index k0, E is selected cyclically with a circular buffer length Ncb. r The bit selection sequence e is obtained from the non-filler bits. r .

[0215] For example, the pseudocode corresponding to step 3 is as follows:

[0216]

[0217] Bit interleaving 5042, based on a code block of length E with index r. r bit selection sequence e r Determine the bit interleaving sequence f r .

[0218] In some embodiments, bit interleaving 5042 is based on the following parameters, for a code block with index r, starting from a length of E r bit selection sequence e r Determine the bit interleaving sequence f r Bit selection sequence e r Bit selection sequence e r Length E r Modulation order Qm.

[0219] In some embodiments, the modulation order Qm is the modulation order of the modulation constellation used by the modulation mapper 204 in the probability amplitude-shaping transmitter link.

[0220] In some embodiments, the specific operation of bit interleaving 5042 includes: selecting a bit sequence e for index r. r Select the bit sequence e r Write E in row-first-column order. r A cache matrix of / Qm rows and Qm columns is then read out column by column, followed by row, into a matrix of length E. r bit interleaved sequence f r That is, for r = 0, 1, ..., C-1, j = 0, 1, ..., E r / Qm-1, i = 0, 1, ..., Qm-1, set f r (i+j·Qm)=e r (i·E r / Qm+j).

[0221] In some embodiments, the C bit-interleaved sequences f0, f1, ..., f output by the bit-interleaved 5042 are... C-1 It is also the rate-matched 504 output bit sequence in the LDPC coding chain.

[0222] The specific operation of code block concatenation 505 is as follows: The lengths of C code blocks are E0, E1, ..., E... C-1 The bit interleaved sequence f0, f1, ..., f C-1 Concatenating the bits yields a concatenated bit sequence g of length Ng, i.e., g = [f0, f1, ..., f C-1 ], where the length Ng is Ng=E0+E1+…+E C-1 In some embodiments, the code block concatenation bit sequence g of length Ng is the output bit sequence of the channel encoder 203 in the transmitter link.

[0223] In some embodiments, the LDPC code is a quasi-cyclic (QC) LDPC code.

[0224] In some embodiments, LDPC codes can be defined by a parity check matrix (PCM).

[0225] In some embodiments, a quasi-cyclic LDPC code can be defined by an MB×Z row, NB×Z column parity check matrix H consisting of MB×NB submatrices, where each submatrix is ​​a different power of the fundamental permutation matrix P of size Z×Z or a Z×Z all-zero matrix. BG By improving or expanding upon this, we can obtain:

[0226]

[0227] Among them, H BG (i,j) represents the element with row index i and column index j, H BG (i,j) takes the value 0 or 1, and Z is called the lifting size or expansion factor. Therefore, Z is the matrix H from the base graph. BG The lift or expansion factor extended to the parity check matrix H represents the multiple by which the number of rows or columns of the matrix changes, or is lifted or expanded. Lifting or expansion refers to the increase or decrease in the number of rows or columns of the matrix when H... BG When (i,j) is 0, H is set to BG (i,j) is replaced by a Z×Z all-zero matrix and when H BG When (i,j) is 1, H is set to BG The process of replacing (i,j) with different powers of the basic permutation matrix P of size Z×Z to finally obtain the parity check matrix H with MB×Z rows and NB×Z columns.

[0228] For example, the basic permutation matrix P is shown below:

[0229]

[0230] If j = mod(i+1, Z), then P ij =1, otherwise P ij =0. Different powers of the fundamental permutation matrix P of size Z×Z are obtained by cyclic shifting the identity matrix to obtain the corresponding powers.

[0231] For example, P 5 This can be obtained by cyclically shifting the identity matrix five times. The matrix H corresponding to the basic graph of the LDPC code is... BG The MB×NB matrix used to indicate different powers of the fundamental permutation matrix P is shown below:

[0232]

[0233] Where V(i,j) is -1, NULL, or undefined, it indicates that H should be set to 1. BG (i,j) is replaced with a Z×Z matrix of all zeros. If V(i,j) is greater than or equal to 0, it indicates that H is replaced. BG (i,j) is represented by a Z×Z matrix P. V(i,j) , where P V(i,j) V is a matrix that raises the basic permutation matrix P to the power of V(i,j). Therefore, matrix V is also called the shift value matrix. Since there is a one-to-one correspondence between matrix V and parity check matrix H, matrix V is sometimes also called the parity check matrix.

[0234] In some embodiments, the base diagram can be an LDPC base. Figure 1 (LDPC basegraph1) or LDPC base Figure 2 (LDPC basegraph 2). LDPC foundation Figure 1 The matrix has MB = 46 rows and NB = 68 columns. LDPC Basics Figure 2 The matrix has MB = 42 rows and NB = 52 columns.

[0235] For example, Figure 6 A block diagram of a probability amplitude shaping coding chain based on a distributed matcher and low-density parity-check code encoding provided in this disclosure includes: a splitter 601, shaping block segmentation 602, a distributed matcher 603, shaping block concatenation 604, an amplitude-to-bit mapper 605, CRC attachment 606, LDPC encoding 607, and rate matching 608.

[0236] Among them, splitter 601: (1) determines the length K1 of the first part b1 output by splitter 601 according to the first target distribution matching code rate Rsh1, the first spectral effect SE1, and the length Ka of the first bit sequence a.

[0237] For example, in, Cs represents the number of integer blocks, Rsh1 is defined as the ratio of the number of bits in the input of the distributed matcher to the number of amplitude symbols in the output, and Nsmax1 is the maximum number of amplitude symbols in the output of each integer block of the distributed matcher.

[0238] In some embodiments, the length K1 of the first part b1 output by the splitter 601 is the third length N3 determined in Example 5 or Example 6, i.e., K1 = N3. (2) The length K2 of the second part b2 output by the splitter 601 is determined according to the length Ka of the first bit sequence a and the length K1 of the first part b1 output by the splitter 601. This length K2 is equal to the difference between the length Ka of the first bit sequence a and the length K1 of the first part b1 output by the splitter 601, i.e., K2 = Ka - K1. (3) The first part b1 and the second part b2 output by the splitter 601 are determined according to the length Ka of the first bit sequence a, the first bit sequence a, the length K1 of the first part b1 output by the splitter 601, and the length K2 of the second part b2 output by the splitter 601. In a specific example, the first part b1 of the output of splitter 601 consists of the first K1 bits of the first bit sequence a (i.e., bits with indices less than K1), and the second part b2 of the output of splitter 601 consists of the last K2 bits of the first bit sequence a (i.e., bits with indices greater than or equal to K1).

[0239]

[0240] Integer block segmentation 602: (1) The number of integer code blocks Cs is determined at least based on the length Ka of the first spectral effect SE1 and the first bit sequence a. In a specific example, the number of integer code blocks Cs is: Cs represents the number of integer blocks, and Nsmax1 represents the maximum number of output amplitude symbols per integer block of the distributed matcher.

[0241] (2) The first part b1 of the output of the splitter 601 with an integer block segmentation input of length K1 is segmented into Cs integer block input bit sequences of length K1', b1'0, b1'1, ..., b1'. Cs-1 Where K1' = K1 / Cs. For example, the integer block input bit sequence b1' with index r. r The first part b1 output by splitter 601 consists of bits whose indices are greater than or equal to r×K1' and less than (r+1)×K1', i.e.

[0242] b1' r (k)=b1(r×K1'+k),k=0,1,...,K1'-1.

[0243] (3) Determine the total length NA of the output amplitude symbol sequences of the Cs integer blocks based on the length Ka of the first spectral effect SE1 and the first bit sequence a. In a specific example, NA = ceil(2×Ka / SE1).

[0244] (4) Determine the lengths of the output amplitude symbol sequences of the Cs integer blocks, respectively, based at least on the lengths of the first spectral effect SE1 and the first bit sequence a, namely NA'0, NA'1, ..., NA'. Cs-1 , among which, NA'0+NA'1+…+NA' Cs-1 =NA. In a specific example, when the index r is less than mod(NA, Cs), the length NA' of the amplitude sign sequence of the integer block. r for When the index r is greater than or equal to mod(NA, Cs), the length NA' of the amplitude sign sequence of the integer block. r for In another specific example, for all indices r = 0, 1, ..., Cs-1, the length NA' of the amplitude sign sequence of the integer block r for

[0245] Distributed Matcher 603: For all indices r = 0, 1, ..., Cs-1, at least based on the integer block length K1' and the integer block input bit sequence b1' with index r. r The length NA' of the output amplitude sign sequence of the integer block with index r r Performing distribution matching yields a length of NA' r The output amplitude sign sequence A' of the shaping block r In this context, distribution matching can use any one of a number of suitable algorithms and any one of a number of suitable configurations.

[0246] In some embodiments, distribution matching includes, but is not limited to, constant-composition distribution matcher (CCDM), bit-level distribution matcher (BL-DM), product distribution matcher (PDM), multi-composition distribution matcher (MCDM), multiset-partition distribution matcher (MPDM), partition-based distribution matcher, parallel-amplitude distribution matcher with subset ranking, streaming distribution matcher, prefix-free codedistribution matcher, shell mapping, enumerative sphereshaping (ESS), approximate enumerative sphere shaping (AESS), partial enumerative sphere shaping (PESS), and Huffman-coded sphere shaping.Framing of variable-length distribution matcher outputs into fixed-length blocks, distribution matcher with mark ratio control, hierarchical distribution matcher, parallel bisection-based distribution matcher, polar-coded distribution matcher, and block-code-based shaping encoder.

[0247] Integer block cascade 604: This cascades the output amplitude sign sequence A'0, A'1, ..., A' of the Cs integer blocks output by the distributed matcher 603. Cs-1 A concatenated integer output amplitude symbol sequence A of length NA, where NA is the sum of the lengths of the output amplitude symbol sequences of the Cs integer blocks determined in integer block segmentation 602. A concrete example is an integer output amplitude symbol sequence A where the index is greater than or equal to NA'0 + NA'1 + ... + NA'. r-1 And less than NA'0+NA'1+…+NA' r The amplitude sign is the output amplitude sign sequence A' of the integer block with index r. r The amplitude sign, i.e., A(NA'0+…+NA') r-1 +j)=A' r (j), j = 0, 1, ..., NA' r -1.

[0248] Amplitude-to-bit mapper 605: Converts each amplitude symbol in the shaped output amplitude symbol sequence A of length NA from the output of the shaped block concatenation 604 into a bit string according to the set amplitude-to-bit mapping rule, and concatenates them to obtain an ordered bit sequence c of length N1, where NA is the sum of the lengths of the output amplitude symbol sequences of the Cs shaped blocks determined in the shaped block segmentation 602. In a specific example, amplitude-to-bit mapper 605 converts each amplitude A(j) in the shaped output amplitude symbol sequence A into Qm / 2-1 bits c(j·(Qm / 2-1)), c(j·(Qm / 2-1)+1),...,c(j·(Qm / 2-1)+Qm / 2-2) according to the preset mapping method, and then concatenates them into an ordered bit sequence c, where the length N1 of the ordered bit sequence c(0)~c(N1-1) is equal to NA·(Qm1-2), and Qm1 is the first modulation order Qm1. In one specific example, Qm is the first modulation order Qm1. In another specific example, the amplitude-to-bit mapper 605 converts each amplitude A(j) in the shaped output amplitude symbol sequence A into m-1 bits c(j·(m-1)), c(j·(m-1)+1),...,c(j·(m-1)+m-2) according to a preset mapping method, and then concatenates them into an ordered bit sequence c, where the length N1 of the ordered bit sequence c is equal to NA·(m-1), and m is the first modulation order Qm1.

[0249] CRC Attachment 606: (1) Determine the lift value Z based on the length K2 of the second part b2 output by the splitter 601, the length N1 of the ordered bit sequence c output by the amplitude-to-bit mapper 605, the number of CRC bits Lcrc, and the number of columns of the LDPC code system, where the lift value Z is the matrix H of the base graph of the MB row and NB column of the LDPC code. BG The lifting value of the parity check matrix H extended to LDPC codes, where Kb is less than or equal to the matrix H of the underlying graph of the LDPC code. BG The difference between the number of columns and the number of rows is NB-MB. For example, Z is a set S. Z Find the minimum value of S that satisfies Kb×Z≥K2+N1+Lcrc. Z (2) The number of system bits Npunc of the LDPC code is determined based on at least one of the following: the length K2 of the second part b2 output by the splitter 601, the number of CRC bits Lcrc, the boost value Z, the minimum number of system bits Npth, and the maximum number of system bits Npm.

[0250] Exemplarily, the minimum system bit puncturing number Npth can be Z.

[0251] Exemplarily, the minimum system bit puncturing number Npth can be 0.5×Z.

[0252] Exemplarily, the minimum system bit puncturing number Npth can be 0.25×Z.

[0253] Exemplarily, the maximum system bit puncturing number Npm can be 2×Z.

[0254] Exemplarily, the maximum system bit puncturing number Npm can be Z.

[0255] Exemplarily, the maximum system bit puncturing number Npm can be 0.5×Z.

[0256] Exemplarily, when K2 + Lcrc < Npm, Npunc = K2 + Lcrc, Figure 8 The number of non - amplitude bits in

[0257] In some other embodiments, the system bit puncturing number Npunc of the LDPC code is equal to Npm.

[0258] In some other embodiments, when K2 + Lcrc ≥ Npm, Npunc = Npm, Figure 8 The number of non - amplitude bits in

[0259] In yet another specific example, when Npth ≤ K2 + Lcrc < Npm, Npunc = K2 + Lcrc; when K2 + Lcrc < Npth or K2 + Lcrc ≥ Npm, Npunc = Npm.

[0260] (3) According to the ordered bit sequence c output by the amplitude - to - bit mapper 605, the length N1 of the ordered bit sequence c, the second part b2 output by the splitter 601, the length K2 of the second part b2 output by the splitter 601, and the cyclic generation polynomial g CRC (D) = g Lcrc ·D Lcrc +g Lcrc-1 ·D Lcrc-1 +…+g2·D 2 +g1·D 1 +g0 determines Lcrc CRC bits p(0), p(1), ..., p(Lcrc-1), where Lcrc CRC bits p(0), p(1), ..., p(Lcrc-1) are Lcrc CRC bits p(0)~p(Lcrc-1) calculated from the ordered bit sequence c output by amplitude-to-bit mapper 605 and the second part b2 output by splitter 601, which is a bit sequence of length K2+N1. (3) The ordered bit sequence c output by amplitude-to-bit mapper 605, the second part b2 output by splitter 601, and Lcrc CRC bits p(0)~p(Lcrc-1) are multiplexed and filled with filler bits. <null>"We obtain the systematic bit sequence c' of LDPC encoding with length Nc' = (NB - MB) × Z, where NB and MB are the matrix H of the base graph of the MB row and NB column of the LDPC code, respectively." BG The number of columns and rows, Z is the matrix H of the base graph of the MB row and NB column of the LDPC code. BG The lifting value of the parity check matrix H extended to LDPC codes.

[0261] LDPC encoding 607: The matrix H of the base graph of the system bit puncture number Npunc, boost value Z, and MB rows and NB columns of the LDPC code, determined by CRC attachment 606. BG The number of columns NB, the parity check matrix H of the LDPC code, the systematic bit sequence c' of the LDPC code, and the length Nc' of the systematic bit sequence c' of the LDPC code determine the codeword bit sequence d of the LDPC code.

[0262] For example, the length Nd of the codeword bit sequence d encoded by LDPC is Nd = NB × Z - Npunc.

[0263] For example, the bits with indices less than Nc'-Npunc in the LDPC-encoded codeword bit sequence d are determined as follows: For indices k greater than or equal to Npunc and less than Nc', the bit c'(k) with index k in the LDPC-encoded systematic bit sequence c' is a non-padded bit (i.e., c'(k) ≠ Nc'). <null>When the LDPC-encoded codeword bit sequence d is set, the bit d(k-Npunc) at index k-Npunc is set as bit c'(k), i.e., d(k-Npunc) = c'(k); when the LDPC-encoded system bit sequence c' has index k, the bit c'(k) at index k is set as a padding bit. <null>"When setting the bit d(k-Npunc) at index k-Npunc in the LDPC-encoded codeword bit sequence d, the bit is set as a padding bit." <null>That is, d(k-Npunc) = <null>.

[0264] For example, first, the padding bits in the LDPC-encoded system bit sequence c' are... <null>Replace the bits with "0", and then generate Nd + Npunc - Nc' parity bits w = [w(0), ..., w(Nd + Npunc - Nc' - 1)] based on the replaced LDPC encoded system bit sequence c' and the LDPC code parity check matrix H, such that H × [c', w] T =θ, where [c',w] T Let θ be a column vector of length NB×Z, and let θ be a zero vector of length MB×Z. Matrix and vector multiplication is performed over the Galois field GF(2). The parity check matrix H of the LDPC code is an MB×Z matrix with NB×Z columns, and the parity check matrix H of the LDPC code is based at least on the matrix H of the fundamental graph of the LDPC code. BG The value is determined by the increase Z.

[0265] For example, the bits in the LDPC-encoded codeword bit sequence d whose index is greater than or equal to Nc'-Npunc are set as bits in the check bit w: For indices k = Nc', Nc'+1, ..., Nd+Npunc, the check bit part of the LDPC-encoded codeword bit sequence d is set as: d(k-Npunc) = w(k-Nc').

[0266] Rate matching 608: Rate matching 608 consists of two parts: bit selection 6081 and bit interleaving 6082. Rate matching 608 is based at least on the LDPC encoded codeword bit sequence d, the second modulation order Qm2, Nre, and N. layer Determine the output bit sequence of rate-matched 608 (i.e., the output bit sequence of bit-interleaved 6082).

[0267] Bit Selection 6081: Bit Selection 6081 is based on the LDPC-encoded codeword bit sequence d, the second modulation order Qm2, Nre, and N. layer Determine the bit selection sequence e output by the bit selection 6081. In a specific example, the length Ne of the bit selection sequence e is equal to the second modulation order Qm2, Nre, and N. layer The product of the three, namely Ne = N layer ×Nre×Qm2. In a specific example, starting from the bit at index k0 of the LDPC-encoded codeword bit sequence d, Ne non-filler bits are selected cyclically with a circular buffer length Ncb to obtain the bit selection sequence e, where k0 is a non-negative integer and Ncb is a positive integer.

[0268] In some embodiments, pseudocode for implementing bit selection is as follows:

[0269]

[0270] Bit Interleaving 6082: Bit Interleaving 6082 determines the bit interleaving sequence f output by Bit Interleaving 6082 based on the bit selection sequence e output by Bit Selection 6081, the second modulation order Qm2, and the length Ne of the bit selection sequence e. In a specific example, the length Nf of the bit interleaving sequence f output by Bit Interleaving 6082 is equal to the length Ne of the bit selection sequence e output by Bit Selection 6081, i.e., Nf = Ne. For example, the bit selection sequence e is written into a buffer matrix of Ne / Qm2 rows and Qm2 columns in a row-first, column-second order, and then read out into a bit interleaving sequence f of the same length Nf in a column-first, row-second order. That is, for j = 0, 1, ..., Ne / Qm2-1, i = 0, 1, ..., Qm2-1, set f(i+j·Qm2) = e(i·Ne / Qm2+j).

[0271] Finally, the bit-interleaved sequence f output by the bit-interleaved 6082 is the target sequence Y in step 5 of Example 1, and the length Ny of the target sequence Y is equal to the length Nf of the bit-interleaved sequence f output by the bit-interleaved 6082, that is, Y = f and Ny = Nf.

[0272] The application scenarios of the embodiments disclosed herein are not limited. The system architecture and business scenarios described in the embodiments of this disclosure are for the purpose of more clearly illustrating the technical solutions of the embodiments of this disclosure, and do not constitute a limitation on the technical solutions provided by the embodiments of this disclosure. As those skilled in the art will know, with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided by the embodiments of this disclosure are also applicable to similar technical problems.

[0273] The communication method provided in the embodiments of this disclosure will now be described in detail with reference to the accompanying drawings.

[0274] The communication method provided in this disclosure can be applied to... Figure 1 The first node 101 in the communication system shown. Figure 7 A flowchart of a communication method is shown, such as... Figure 7 As shown, the communication method includes the following S701-S704:

[0275] S701, Obtain encoding-related parameters.

[0276] In some embodiments, the encoding-related parameters can be determined by the first node.

[0277] In some embodiments, encoding-related parameters can be obtained by the first node receiving information from other nodes, which is used to indicate or carry one of the following: encoding-related parameters, the index or identifier of encoding-related parameters.

[0278] S702. Determine the first bit sequence based on the encoding-related parameters.

[0279] It should be understood that the coding-related parameters are used to indicate / characterize / reflect the coding scheme corresponding to the signal transmission process. Since the coding scheme can reflect the relevant information of the first bit sequence, the first bit sequence can be determined based on the coding-related parameters.

[0280] In some embodiments, S702, the first bit sequence is determined based on the encoding-related parameters by: determining the length of the first bit sequence based on the encoding-related parameters; and determining the first bit sequence based on the information to be sent and the length of the first bit sequence.

[0281] It should be noted that in some embodiments, during signal transmission, the transmitting end can first determine the available resources for this transmission. Based on the available resources, the length of the transmittable bit sequence can be determined. Encoding-related parameters can be determined based on the available resources, or in other words, the encoding-related parameters can reflect relevant information about the available resources during the transmission process. Therefore, the first bit sequence can be determined based on the encoding-related parameters.

[0282] In some embodiments, the encoding-related parameters can be encoding modulation parameters.

[0283] In some embodiments, the first bit sequence may be an information bit sequence containing valid information (or information to be sent).

[0284] In some embodiments, the encoding-related parameters include a first parameter and a second parameter.

[0285] In some embodiments, S702, the first bit sequence is determined based on encoding-related parameters by determining the first bit sequence based on the first parameter and / or the second parameter.

[0286] S703. Determine the target sequence based on the encoding-related parameters and the first bit sequence.

[0287] The target sequence is obtained from the first bit sequence based on a probability amplitude shaping scheme.

[0288] It should be understood that the coding-related parameters are used to indicate / characterize / reflect the coding scheme corresponding to the signal transmission process. Therefore, the target sequence can be determined based on the coding-related parameters and the first bit sequence.

[0289] It should be understood that probability amplitude shaping schemes are used to indicate the transformation of equally distributed bits to be encoded into a sequence of bits or symbols with unequal probability distributions. Unequal probability distributions indicate that different symbols have unequal (or uneven) probabilities of appearing during signal transmission. By using unequal probability distributions, the frequency of different symbols appearing during signal transmission can be adjusted, thus ensuring that the occurrence of symbols during signal transmission is as desired, thereby achieving the desired effect.

[0290] For example, unequal probability distributions can be used to reduce the frequency of higher power symbols and increase the frequency of lower power symbols, thereby reducing the average transmit power and increasing channel capacity.

[0291] In some embodiments, the above probability amplitude shaping scheme can also be explained using a constellation diagram. In this case, the unequal probability distribution is used to indicate that the probabilities of different constellation points appearing during signal transmission are not equal (or not uniform). By using the unequal probability distribution, the frequency of different constellation points appearing during signal transmission can be adjusted, thus ensuring that the distribution of constellation points in the constellation diagram during signal transmission is the desired distribution, thereby achieving the desired effect.

[0292] For example, unequal probability distributions can be used to reduce the frequency of constellation points corresponding to higher power symbols and increase the frequency of constellation points corresponding to lower power symbols. In this way, the average transmit power can be reduced and the channel capacity can be increased.

[0293] In some embodiments, the encoding-related parameters include parameters for implementing the probability amplitude shaping scheme.

[0294] In some embodiments, when the encoding-related parameters are encoding-modulation parameters, the target sequence is the encoded-modulated sequence.

[0295] In some embodiments, S703, the target sequence is determined based on the encoding-related parameters and the first bit sequence, which is achieved by determining the target sequence based on the first parameter, the second parameter, and the first bit sequence.

[0296] S704, Send a signal including the target sequence to the second node.

[0297] It should be understood that since the target sequence is obtained from the first bit sequence based on a probability amplitude shaping scheme, the distribution of different symbols in the target sequence can meet the desired distribution. Thus, signals including the target sequence can be transmitted more reliably and efficiently.

[0298] In some embodiments, the first parameter and the second parameter are used to implement processes other than modulation mapping in the probability amplitude shaping scheme, and one of the parameters is also used to implement the modulation mapping process.

[0299] For example, the first parameter and the second parameter are used to determine the processing procedures of the splitter, the shaping encoder, and the channel encoder, and the second parameter is used to determine the processing procedures of the modulation mapper.

[0300] In some embodiments, one of the first parameter and the second parameter is used to determine the input and output of the probability amplitude shaping scheme, and the other is used to determine the intermediate processes in the probability amplitude shaping scheme other than the input and output.

[0301] For example, the first parameter is used to determine the output of the splitter, the input and output of the shaping encoder, and the input and output of the channel encoder; the second parameter is used to determine the input of the splitter and the output of the modulation mapper.

[0302] In some embodiments, in retransmission scenarios, the parameters related to distribution matching (such as the distribution matching process or the integer coding process) in the first and second parameters, or the content related to distribution matching in the parameters, remain unchanged.

[0303] It should be noted that the target sequence generated based on the first bit sequence may include parity bits. Parity bits are the check bits corresponding to the valid information (which can be called a message or a transport block) in the first bit sequence, used by the receiver to recover the original information if there are errors in the received information. During the first transmission, the sender selects a portion from a message and parity bits for transmission. If an error occurs in the first transmission, the sender selects another portion from a message and parity bits for retransmission. At this time, the receiver combines the signals received from the two transmissions and performs forward error correction decoding to recover the message the sender intended to transmit. However, when the sender performs probabilistic amplitude shaping, the input to the forward error correction module (the module used to generate parity bits, forward error correction bits, or forward error correction codewords) is not the message itself, but a bit sequence converted from the amplitude symbol sequence of the message after distribution matching processing. When the parameter configuration for distribution matching changes in two transmissions of the same information, the bit sequences converted from the amplitude symbol sequence after distribution matching processing are no longer the same. Different bit sequences input into the forward error correction (FEC) module will produce different FEC codewords. These different FEC codewords cannot be combined and decoded at the receiver, leading to a decrease in error correction performance. Therefore, in retransmission scenarios, the parameters related to distribution matching (such as the distribution matching process or the integer coding process) in the first and second parameters, or the content related to distribution matching in these parameters, can remain unchanged. This ensures that the receiver can combine and decode the corresponding FEC codewords from multiple transmissions in retransmission scenarios, guaranteeing error correction performance during data transmission.

[0304] In some embodiments, the first parameter is related to the shaping code in the probability magnitude shaping scheme. The shaping code includes distribution matching.

[0305] In some embodiments, the first parameter includes at least one of the following: a modulation and coding scheme (MCS) index, or a distribution matching parameter.

[0306] The first parameter includes a coding and modulation scheme that can indicate information related to the shaping coding in probability amplitude shaping. It can perform probability amplitude shaping on some or all bits of the first bit sequence so that the probability distribution of the symbols corresponding to the bits after probability amplitude shaping is a non-uniform probability distribution.

[0307] The first parameter includes distribution matching parameters, which can indicate information related to distribution matching during the shaping encoding process, so as to perform distribution matching operations on some or all bits of the first bit sequence to obtain a non-uniform probability amplitude symbol sequence. Furthermore, a non-uniform probability distribution bit sequence can be obtained based on this amplitude symbol sequence.

[0308] In some embodiments, the second parameter includes at least one of the following: coding modulation scheme index, transport block size.

[0309] The second parameter includes the coding and modulation scheme index, which can indicate information related to the generation of the target sequence based on the first bit sequence during the probability amplitude shaping process, and can determine the length of the target sequence and the first bit sequence.

[0310] The second parameter, including the size of the transport block, can be used to determine the length of the first bit sequence.

[0311] When both the first and second parameters include a coding-modulation scheme index, the coding-modulation scheme index included in the first parameter and the coding-modulation scheme index included in the second parameter are used together to implement the process of generating the target sequence based on the first bit sequence. The difference between the two is that the coding-modulation scheme index included in the second parameter is also used to implement the modulation mapping process; or the coding-modulation scheme index included in the second parameter is also used to determine the input and output of the entire coding-modulation process, and the two indexes jointly determine the intermediate process of coding-modulation; or the coding-modulation scheme index included in the first parameter is used to implement the process related to integer coding, and the coding-modulation scheme index included in the second parameter is used to determine the entire coding-modulation process.

[0312] In some embodiments, the size of the transport block can be determined as the length of the first bit sequence.

[0313] In some embodiments, the coding modulation scheme index is used to indicate at least one of the following coding modulation parameters: modulation order, channel coding rate, distribution matching rate, integer code rate, proportion of non-integer information bits, probability distribution of elements in the amplitude set, entropy of amplitude symbols, and spectral efficiency.

[0314] In some embodiments, the modulation order is the modulation order used in the modulation mapping process.

[0315] In some embodiments, the modulation order is the modulation order used by the modulation constellation during modulation mapping. It should be understood that the modulation order is used to determine the number of bits that a modulation symbol can map during modulation mapping.

[0316] In some embodiments, the channel coding rate is used to indicate the code rate of channel coding. It should be understood that the channel coding rate can indicate the ratio between redundant bits (or forward error correction codeword bits) and effective information bits (bits in the input bit sequence of the channel coding process, such as the first bit sequence or a bit sequence derived from the first bit sequence).

[0317] In some embodiments, the channel coding rate is used to indicate the code rate of the low-density parity code encoding. It should be understood that the code rate of the low-density parity code encoding can indicate the ratio between the low-density parity codeword and the low-density parity code input bits.

[0318] In some embodiments, the integer code rate is the integer code rate of the integer encoding process. It should be understood that the integer code rate can indicate the ratio between the input bits and the output bits of the integer encoding process. For example, the integer code rate can be as described above. Figure 3 The shaping code rate used by the shaping encoder shown is illustrated. For example, the shaping code rate can be as described above. Figure 4 The shaping code rate used by the shaping encoder shown.

[0319] In some embodiments, the first bit sequence comprises a first portion and a second portion. The proportion of non-integer information bits is used to indicate one of the following:

[0320] The ratio between the size of the second part of the first bit sequence and the size of the bit sequence after amplitude shaping of the first part;

[0321] The ratio between the size of the second part of the first bit sequence and the size of the bit sequence after the distribution matching of the first part;

[0322] The ratio between the size of the second part of the first bit sequence and the size of the amplitude sign sequence after amplitude shaping of the first part;

[0323] The ratio between the size of the second part of the first bit sequence and the size of the amplitude symbol sequence after the distribution matching of the first part;

[0324] The ratio between the size of the second part of the first bit sequence and the size of the target sequence;

[0325] The ratio between the size of the second part of the first bit sequence and the size of the target sequence is half.

[0326] In some embodiments, the first part of the first bit sequence is the part that needs to be shaped and encoded, and the second part is the part that does not need to be shaped and encoded.

[0327] It should be understood that the first node can determine the number of bits in the first bit sequence that do not need to be probability amplitude sizing based on the proportion of non-integer information bits, and it can also determine the number of bits in the first bit sequence that need to be probability amplitude sizing.

[0328] For example, the proportion of non-integer information bits can be used to indicate one of the following:

[0329] The proportion of non-integer information bits is as described above. Figure 2 The ratio (K2) of the length of the second bit sequence b2(0)~b(K2-1) output by the splitter 201 to the length (N1) of the bit sequence output by the shaping encoder 202; or the ratio of the length (K2) of the second bit sequence b2(0)~b(K2-1) output by the splitter 201 to the length (N1) of the bit sequence output by the shaping encoder 202. Figure 2 The length (K2) of the second part of the bit sequence b2(0)~b(K2-1) output by the splitter 201 is the same as the above. Figure 3 The ratio of the length (N1) of the bit sequence output by the medium amplitude to bit mapper 302;

[0330] The proportion of non-integer information bits is as described above. Figure 2 The length (K2) of the second part of the bit sequence b2(0)~b(K2-1) output by the splitter 201 is the same as the above. Figure 3 The ratio of the length (NA) of the amplitude symbol sequence output by the medium distribution matcher 301;

[0331] The proportion of non-integer information bits is as described above. Figure 2 The ratio of the length (K2) of the second bit sequence b2(0)~b(K2-1) output by splitter 201 to the length (Nx) of the modulation symbol sequence output by modulation mapper 204;

[0332] The proportion of non-integer information bits is as described above. Figure 2 The length (K2) of the second part bit sequence b2(0)~b(K2-1) output by splitter 201 is half the ratio of the length (Nx) of the modulation symbol sequence output by modulation mapper 204.

[0333] In some embodiments, the probability distribution of elements in the amplitude set is a discrete function of the probability of each element in the set {1,3,5,...,(2^m-3),(2^m-1)}. Here, m is the modulation order or half of the modulation order.

[0334] In some embodiments, the entropy of the amplitude symbol is the information entropy corresponding to the probability distribution of the elements in the amplitude set. A specific example of the entropy of the amplitude symbol is... Where Pr(A=2i+1) represents the probability value that the amplitude A is 2i+1.

[0335] In some embodiments, the coding and modulation scheme index is used to indicate the parameters used in the coding and modulation scheme. Each coding and modulation scheme index corresponds to a specific combination of coding and modulation parameters. Multiple combinations of coding and modulation parameters constitute a table called the coding and modulation index table (MCS index table).

[0336] For example, Table 5 shows a coding and modulation index table used by the Physical Downlink Shared Channel (PDSCH):

[0337] Table 5

[0338]

[0339]

[0340] Table 5 consists of four columns. In Table 5, the first column is the coding / modulation scheme index I. MCS The second column is the modulation order Qm used in the coding and modulation scheme; the third column is the target code rate R multiplied by 1024; and the fourth column is the spectral efficiency of the coding and modulation scheme. The target code rate in the third column indicates 3GPP 5G LDPC coding, and spectral efficiency is also simply called spectral effectiveness (SE), measured in bits per symbol. Except for the header in the first row, each row in Table 5 indicates a coding and modulation scheme index and the combination of coding and modulation scheme parameters it represents. For example, in Table 5, the coding and modulation scheme index I... MCS The line with value 17 indicates that the modulation order Qm is 6 and the target code rate R is... The combination of coding and modulation parameters has a spectral efficiency of 2.5664 bits / symbol, and this combination of coding and modulation parameters is represented by the value 17. In Table 5, the three columns with coding and modulation scheme indices 29, 30, and 31 only indicate the specific value of the modulation order Qm, without specifying the target code rate R and spectral efficiency. In some cases, these three coding and modulation scheme indices are used when the target code rate does not fall within the range of coding and modulation scheme indices 0 to 28 during transport block retransmission.

[0341] For example, Table 6 provides a specific example of a coding modulation index table for probability amplitude shaping schemes, comprising five columns, where the first column is the coding modulation scheme index (MCS index). MCS The second column is the modulation order Qm used in the coding and modulation scheme, the third column is the target code rate R multiplied by 1024, the fourth column is the target distribution matching code rate (Rsh), and the fifth column is the spectral efficiency of the coding and modulation scheme. The target code rate is the same as the channel coding code rate.

[0342] Table 6

[0343]

[0344]

[0345] In some embodiments, Table 6 is used to indicate Figure 2 The transmitter link encoding with probability amplitude shaping, where, Figure 2 The shaping encoder 202 in the transmitter link uses Figure 3 The shaping encoder.

[0346] In some embodiments, the second column in Table 6 is used to indicate Figure 2 The modulation order of the transmitter link modulation mapper 204 is used for probability amplitude shaping.

[0347] In some embodiments, the modulation order in the second column of Table 6 is the modulation order of quadrature amplitude modulation.

[0348] In some embodiments, the modulation order in the second column of Table 6 is the modulation order of amplitude shift keying modulation.

[0349] In some embodiments, the target bit rate in the third column of Table 6 is used to indicate Figure 2 The coding rate of the channel encoder 203 of the transmitter link is shaped by probability amplitude.

[0350] In some embodiments, the fourth column in Table 6 is used to indicate the target distribution matching code rate. Figure 3 The encoding of the distributed matching unit 301 is given by the distributed matching code rate, which is the bit value of the number of input bits K1 and the number of output amplitude symbols NA of the distributed matching unit 301, i.e., Rsh = K1 / NA. In the table, N / A indicates that it is not applicable, meaning that the encoding modulation scheme corresponding to this index belongs to one of the following states: the scheme does not use probability amplitude shaping, the scheme does not use a distributed matching unit, the number of input bits of the distributed matching unit is 0, the distributed matching code rate is 0, the distributed matching code rate is Qm-2, the distributed matching code rate is m-1, the number of input bits of the distributed matching unit is NA×(Qm-2), or the number of input bits of the distributed matching unit is NA×(m-1). Here, Qm is the modulation order of QAM, and m is the modulation order of ASK.

[0351] In some embodiments, the fifth column of Table 6 represents the spectral efficiency of the probability amplitude shaping scheme, wherein the spectral efficiency is... Figure 2 The ratio of the length K of the input bit sequence of the splitter 201 to the length Nx of the modulation symbol sequence output by the modulation mapper 204.

[0352] In some embodiments, apart from the header of the first row, each of the other rows in Table 6 indicates a probability amplitude-shaped coding modulation scheme index and the combination of coding modulation scheme parameters it represents. For example, in Table 6, the coding modulation scheme index I MCS The line with value 17 indicates that the modulation order Qm is 6 and the target code rate R is... The target distribution matches a combination of coding and modulation parameters with a code rate Rsh of 1.0432 and a spectral efficiency of 2.5664 bits / symbol, and the value 17 is used to refer to this combination of coding and modulation parameters.

[0353] In some embodiments, the parameters of distribution matching include at least one of the following: distribution matching bitrate, index of distribution matching bitrate, index of distribution matching scheme, and proportion of non-integer information bits.

[0354] For example, Table 7 provides an index table of distribution matching schemes:

[0355] Table 7

[0356]

[0357]

[0358] In some embodiments, the first parameter and the second parameter satisfy one of the following:

[0359] The first parameter and the second parameter are parameters of different types;

[0360] The first and second parameters are of the same type.

[0361] The first parameter and the second parameter are of the same type, but the values ​​of the first parameter and the second parameter are different.

[0362] In some embodiments, the first parameter and the second parameter each have the same value.

[0363] In some embodiments, the first parameter and the second parameter have different values.

[0364] In some embodiments, the first parameter is obtained in one of the following ways:

[0365] Receive signaling carrying the first parameter;

[0366] Determined based on higher layer parameters;

[0367] Determined by the first node.

[0368] In some embodiments, the second parameter is obtained in one of the following ways:

[0369] Receive signaling carrying the second parameter;

[0370] Determined based on high-level parameters;

[0371] Determined by the first node.

[0372] In some embodiments, the signaling carrying the first parameter or the second parameter is higher layer signaling.

[0373] In some embodiments, the aforementioned higher-level parameters may include downlink control information (DCI).

[0374] In some embodiments, both the first parameter and the second parameter are carried on downlink control information, and the first parameter and the second parameter satisfy one of the following:

[0375] The first parameter is one field in the downlink control information, and the second parameter is another field in the downlink control information;

[0376] The first parameter is carried in the first downlink control information, and the second parameter is carried in the second downlink control information.

[0377] In some embodiments, downlink control information includes necessary information for determining the transmission and reception formats of transport blocks.

[0378] In some embodiments, the downlink control information is used to perform at least one of the following functions:

[0379] (1) Carrying information for scheduling (including allocating physical resources) of downlink data to be transmitted on the Physical Downlink Shared Channel (PDSCH).

[0380] (2) Carrying information for scheduling (including allocating physical resources) of uplink data to be transmitted on the Physical Uplink Shared Channel (PUSCH).

[0381] (3) Carry information for power control by adjusting uplink power (including physical uplink shared channel power and physical uplink control channel (PUCCH) power).

[0382] DCI is used to schedule downlink data channels (e.g., PDSCH) or uplink data channels (e.g., PUSCH). The 3GPP 5G standard defines several DCI formats.

[0383] For example, Table 8 shows the DCI format and its contents. Each DCI format includes multiple fields, each consisting of several bits. The coding and modulation-related fields in the DCI include at least frequency domain resource assignment, time domain resource assignment, modulation and coding scheme, redundancy version, precoding information, and the number of layers. The frequency domain resource assignment field and the time domain resource assignment field can be used to determine the number (Nre) of resource elements (the base station allocates for the current transport block transmission), and the precoding information and layer number field can be used for the number of layers (N) of the current transport block transmission. layer The modulation coding scheme field can be used to determine various parameters involved in coding and modulation, such as modulation order and code rate.

[0384] Table 8

[0385]

[0386]

[0387] In some embodiments, the first parameter satisfies at least one of the following:

[0388] The first parameter is used to determine the length of the first bit sequence in conjunction with the number of resource elements in the downlink control information;

[0389] The first parameter is used to determine the parameters of the channel coding;

[0390] The first parameter is used to determine the parameters of the distribution matching code;

[0391] The first parameter is the index of the coding and modulation scheme corresponding to the first transmission of the transport block;

[0392] The first parameter is used to determine the base graph used for low-density parity check coding;

[0393] The first parameter is used to determine the boost value in low-density parity-check coding.

[0394] It should be understood that the number of resource elements in the downlink control information represents the number of resources available for transmitting a signal including the target sequence. The first parameter reflects the processing required to obtain the target sequence based on the first bit sequence. Therefore, the length of the first bit sequence can be determined based on the first parameter and the number of resource elements in the downlink control information.

[0395] It should be understood that the channel coding parameters determined by the first parameter enable the first node to perform channel coding based on these parameters, generating redundant bits corresponding to the first bit sequence to obtain the target sequence. These redundant bits improve the reliability of data transmission.

[0396] It should be understood that the parameters of the distribution matching encoding determined by the first parameter enable the first node to perform distribution matching on some or all bits in the first bit sequence based on the distribution matching parameters, so as to adjust the probability distribution of some or all bits in the first bit sequence to a non-uniform probability distribution.

[0397] It should be understood that the coding and modulation scheme of the first transmission of a transport block enables the first node to perform coding and modulation based on that scheme when transmitting a transport block for the first time.

[0398] In some embodiments, the second parameter satisfies at least one of the following:

[0399] The second parameter is used to determine the length of the first bit sequence;

[0400] The second parameter is used to determine the size of the transport block;

[0401] The second parameter is used to determine the length of the target sequence;

[0402] The second parameter is used to determine the modulation order used for the target sequence;

[0403] The second parameter is used to determine the modulation order of the signal including the target sequence;

[0404] The second parameter is the index of the coding and modulation scheme corresponding to the current transmission of the transport block;

[0405] The second parameter is used to determine the size of the current transfer block;

[0406] The second parameter is used to determine the modulation order used in the current transmission.

[0407] In some embodiments, the target sequence is a modulation symbol sequence after modulation mapping, and the modulation order of modulation mapping is determined based on a first parameter or a second parameter.

[0408] In some embodiments, the target sequence is determined by at least one of the following parameters:

[0409] The parameters of the channel coding determined based on the first parameter;

[0410] The encoding parameters of the distribution matcher are determined based on the first parameter;

[0411] The length of the first bit sequence is determined based on the second parameter;

[0412] The length of the target sequence is determined based on the second parameter;

[0413] The modulation order is determined based on the second parameter, which is the modulation order used in the target sequence;

[0414] The modulation order is determined based on the second parameter, which is the modulation order used by the signal including the target sequence.

[0415] In some embodiments, the first bit sequence satisfies at least one of the following:

[0416] The first bit sequence is the transmission block sent from the first node to the second node;

[0417] The length of the first bit sequence is the size of the transport block.

[0418] In some embodiments, the target sequence satisfies one of the following:

[0419] The target sequence is a sequence encoded with a low-density parity-check code;

[0420] The target sequence is the bit-selected sequence;

[0421] The target sequence is a bit-interleaved sequence;

[0422] The target sequence is the sequence obtained by concatenating code blocks;

[0423] The target sequence is the channel-coded sequence after the probability amplitude shaping process;

[0424] The target sequence is the modulation symbol sequence after modulation mapping during the probability amplitude shaping process.

[0425] In some embodiments, the target sequence is as described above. Figure 5 The output sequence of LDPC encoding 503.

[0426] In some embodiments, the target sequence is as described above. Figure 5 The output sequence of the middle bit selection is 5041.

[0427] In some embodiments, the target sequence is as described above. Figure 5 The output sequence of 5042 bits interleaved in the middle.

[0428] In some embodiments, the target sequence is as described above. Figure 5 The output sequence of the cascaded 505 code blocks.

[0429] In some embodiments, the target sequence is as described above. Figure 2 The output bit sequence of the mid-channel encoder 203.

[0430] In some embodiments, the target sequence is as described above. Figure 2 The modulation symbol sequence output by the modulation mapper 204.

[0431] In some embodiments, the target sequence is as described above. Figure 2 The modulation symbol sequence output by the modulation mapper 204 uses a modulation order determined by the first parameter P1.

[0432] In some embodiments, the target sequence is as described above. Figure 2 The modulation symbol sequence output by modulation mapper 204 uses a modulation order determined by the second parameter P2.

[0433] The following are examples of communication methods provided by embodiments of this disclosure:

[0434] Example 1: Assume the first node is User Equipment (UE) and the second node is a base station (BS). Both the first parameter P1 and the second parameter P2 are coding and modulation scheme indices. The coding and modulation scheme index corresponding to the first parameter P1 is called the first coding and modulation scheme index I. MCS1 The coding and modulation scheme index corresponding to the second parameter P2 is called the second coding and modulation scheme index I. MCS2 The following description will directly use the first coding and modulation scheme index I. MCS1 Second coding modulation scheme index I MCS2 The first parameter P1 and the second parameter P2 are replaced respectively, and the descriptions of the first parameter P1 and the second parameter P2 are no longer used. The steps of the communication method include:

[0435] Step 1: The first node determines the first coding and modulation scheme index I based on the first field and the second field in the same downlink control information sent to the first node by the second node. MCS1 Second coding modulation scheme index I MCS2 The first field is used to determine the index I of the first coding modulation scheme. MCS1 The second field is used to determine the index I of the second coding modulation scheme. MCS2 The first node determines the total number of resource elements Nre used for transport block transmission and the number of layers N used for transport block transmission based on the fields other than the first and second fields in the same downlink control information sent to the first node by the second node. layer The "first" and "second" in the first and second fields only indicate that the two fields are different, and do not represent a sequential relationship. The first coding modulation scheme index I... MCS1 Second coding modulation scheme index I MCS2 The encoding process of the transmitter link used to indicate probability amplitude shaping.

[0436] For example, the first coding modulation scheme index I MCS1 Second coding modulation scheme index I MCS2 These are respectively index 26 and index 16 of the coding and modulation scheme in Table 6, i.e., I MCS1 =26 and I MCS2 =16. Index I of the first coding modulation scheme MCS1 =26 indicates a probability amplitude shaping scheme with a first modulation order of Qm1=6, a first target code rate of R1=916.48 / 1024, a first target distribution matching code rate of Rsh1=1.8726, and a first spectral efficiency of SE1=5.1152 bits / symbol. Second coding modulation scheme index I MCS2 =16 indicates a probabilistic amplitude shaping scheme with a second modulation order of Qm2=4, a second target code rate of R2=764.59 / 1024, a second target distribution matching code rate of Rsh2=1.0452, and a second spectral effect of SE2=2.5703 bits / symbol, wherein the first modulation order Qm1 and the first modulation order Qm2 are the modulation orders of quadrature amplitude modulation.

[0437] Step 2: The first node must, at least according to the total number of resource elements Nre used for transporting blocks in Step 1 and the number of layers N used for transporting blocks in Step 1. layer and the second coding modulation scheme index I in step 1. MCS2 Determine the length Ka of the first bit sequence a.

[0438] For example, the first bit sequence is a transport block sent from the first node to the second node, and the length Ka of the first bit sequence a is the transport block size.

[0439] Step 3: The first node obtains the first bit sequence a from the higher layer by obtaining Ka bits based on the length Ka of the first bit sequence a in Step 2.

[0440] Step 4: The first node determines the second modulation order Qm2 as the index I of the second coding modulation scheme in Step 1. MCS2 The modulation order is indicated. The first node is determined based on the second modulation order Qm2, the total number of resource elements Nre used for transport block transmission in step 1, and the number of layers N used for transport block transmission in step 1. layer Determine the length Ny of the target sequence Y.

[0441] For example, the length Ny of the target sequence Y is equal to the second modulation order Qm2, the total number of resource elements Nre used for transport block transmission in step 1, and the number of layers N used for transport block transmission in step 1. layer The product of the three, i.e., Ny = N layer ×Nre×Qm2.

[0442] For example, the target sequence Y is the bit sequence g output by the channel encoder 203 of the transmitter link with probability amplitude shaping.

[0443] Step 5: The first node must at least follow the first coding and modulation scheme index I from Step 1. MCS1 The length K1 of the input bit sequence and the length N1 of the output bit sequence of the shaping encoder 202 are determined. The first node determines the target sequence Y based at least on the length K1 of the input bit sequence of the shaping encoder 202, the length N1 of the output bit sequence of the shaping encoder 202, the length Ka of the first bit sequence a in step 2, the first bit sequence a in step 3, the length Ny of the target sequence Y in step 4, and the second modulation order Qm2 in step 4.

[0444] For example, the first node determines the target sequence Y from the first bit sequence a in step 3 according to the probability amplitude shaped transmitter link, wherein the target sequence Y is the bit sequence g output by the channel encoder 203 in the probability amplitude shaped transmitter link.

[0445] Step 6: The first node sends a signal including the target sequence Y to the second node.

[0446] It should be noted that in the above operation, in the case of two transmissions, if the following conditions are met, the signals from the two transmissions can be simply combined, similar to LDPC codes, and the gain from multiple transmissions can be obtained:

[0447] Condition 1: Index I of the first coding and modulation scheme in step 1 of the two transmissions. MCS1 The values ​​are the same;

[0448] Condition 2: The length Ka of the first bit sequence a determined in step 2 of the two transmissions is the same;

[0449] Condition 3: The first bit sequence 'a' obtained in step 3 of the two transmissions is the same;

[0450] Condition 4: In step 5 of the two transmissions, the target sequence Y is a different part of the same codeword in the channel encoder 203 of the transmitter link, which is shaped by the first node according to the probability amplitude.

[0451] Condition 1 can be satisfied by setting the fields in the DCI. Condition 2 can be achieved by selecting a suitable second coding and modulation scheme index I, similar to how the transport block size is determined in the 3GPP 5G standard. MCS2 The total number of resource elements Nre used for transport block transfer and the number of layers N used for transport block transfer. layer And this is satisfied. Once condition 2 is satisfied, condition 3 only needs to be selected from the information transmitted by the higher layer in the first transmission. Condition 4 can be satisfied using a bit selection method similar to LDPC coding chain 5041 after conditions 2 and 3 are satisfied. Meanwhile, because the length Ny of the target sequence Y is at least based on the index I of the second coding modulation scheme... MCS2 Determined. Therefore, by changing the index I of the second coding modulation scheme in two transmissions. MCS2 The value of can be selected to enable flexible resource scheduling.

[0452] Example 2: Assume the first node is a user equipment and the second node is a base station. Both the first parameter P1 and the second parameter P2 are coding and modulation scheme indices. The coding and modulation scheme index corresponding to the first parameter P1 is called the first coding and modulation scheme index I. MCS1 The coding and modulation scheme index corresponding to the second parameter P2 is called the second coding and modulation scheme index I. MCS2 Subsequently, the first coding and modulation scheme index I will be used directly. MCS1 Second coding modulation scheme index I MCS2 The first parameter P1 and the second parameter P2 are replaced respectively, and the descriptions of the first parameter P1 and the second parameter P2 are no longer used. The steps of the communication method include:

[0453] Step 1: The second node obtains the index I of the first coding and modulation scheme from the higher layer. MCS1 Second coding modulation scheme index I MCS2 Among them, the first coding modulation scheme index I MCS1 Second coding modulation scheme index I MCS2 The encoding process of the transmitter link used to indicate probability amplitude shaping.

[0454] For example, the first coding modulation scheme index I MCS1 Second coding modulation scheme index I MCS2 These are respectively index 26 and index 16 of the coding and modulation scheme in Table 6, i.e., I MCS1 =26 and I MCS2 =16. Therefore, the index I of the first coding modulation scheme is... MCS1 =26 indicates a probability amplitude shaping scheme with modulation order Qm1=6, target code rate R1=916.48 / 1024, target distribution matching code rate Rsh1=1.8726, and spectral efficiency SE1=5.1152 bits / symbol; the second coding modulation scheme index I MCS2 =16 indicates a probabilistic amplitude shaping scheme with modulation order Qm2=4, target code rate R2=764.59 / 1024, target distribution matching code rate Rsh2=1.0452, and spectral efficiency SE2=2.5703 bits / symbol, where modulation order Qm1 and modulation order Qm2 are the modulation orders of quadrature amplitude modulation. The second node also obtains from higher layers the total number of resource elements Nre used for transport block transmission and the number of layers N used for transport block transmission. layer .

[0455] Step 2: The first node, based on the total number of resource elements Nre used for transporting blocks in Step 1 and the number of layers N used for transporting blocks in Step 1... layer Determine the length Ny of the target sequence Y.

[0456] For example, the length Ny of the target sequence Y is equal to the total number of resource elements Nre used for transporting blocks in step 1 and the number of layers N used for transporting blocks in step 1. layer The product of, i.e., Ny = N layer ×Nre.

[0457] For example, the target sequence Y is the modulation symbol sequence output by the modulation mapper 204 in the probability amplitude-shaped transmitter link.

[0458] Step 3: The second node receives the signal sent by the first node, which includes the target sequence Y.

[0459] Step 4: The first node, based on the total number of resource elements Nre used for transporting blocks in Step 1 and the number of layers N used for transporting blocks in Step 1... layer The length Ka of the first bit sequence a is determined by the second modulation order Qm2, the second target code rate R2, and the second distribution matching code rate Rsh2, where the second modulation order Qm2, the second target code rate R2, and the second distribution matching code rate Rsh2 are the index I of the second coding and modulation scheme in step 1. MCS2 The modulation order, target code rate, and distribution matching code rate are indicated. The length of the first bit sequence is the transport block size.

[0460] For example, the second modulation order Qm2 is the modulation order used by the modulation mapper 204.

[0461] Step 5: The second node estimates the first bit sequence a based at least on the second modulation order Qm2, the first target code rate R1, the first target shaping code rate Rsh1, the signal including the target sequence from step 3, and the length Ka of the first bit sequence a from step 4, where the second modulation order Qm2 is the index I of the second coding modulation scheme from step 1. MCS2 The indicated modulation order and first target code rate R1 are the index I of the first coding modulation scheme. MCS1 The indicated target code rate, the first target distribution matching code rate Rsh1, and the index I of the first coding and modulation scheme are... MCS1 The indicated target distribution matches the code rate.

[0462] For example, the first bit sequence is a portion of the input bit sequence of the splitter 201 in the transmitter link corresponding to probability amplitude shaping.

[0463] Example 3: Assume the first node is a base station and the second node is a user equipment. Both the first parameter P1 and the second parameter P2 are coding and modulation scheme indices. The coding and modulation scheme index corresponding to the first parameter P1 is called the first coding and modulation scheme index I. MCS1 The coding and modulation scheme index corresponding to the second parameter P2 is called the second coding and modulation scheme index I. MCS2 Subsequently, the first coding and modulation scheme index I will be used directly. MCS1 Second coding modulation scheme index I MCS2 Replace the first parameter P1 and the second parameter P2 respectively. The steps of the communication method include:

[0464] Step 1: The first node obtains the index I of the first coding and modulation scheme from the higher layer. MCS1 Second coding modulation scheme index I MCS2 Among them, the first coding modulation scheme index I MCS1 Second coding modulation scheme index I MCS2 The process used to indicate the transmitter link's probability amplitude shaping.

[0465] For example, Table 9 shows another type of coding modulation index table:

[0466] Table 9

[0467]

[0468]

[0469] It should be noted that the difference between Table 9 and Table 5 is as follows: In Table 5, except for the coding and modulation scheme indexes marked with "reserved", the spectral efficiency of the fourth column corresponding to all other coding and modulation scheme indices can be determined by the modulation order in the second column and the target code rate in the third column. For example, multiplying the modulation order in the second column and the target code rate in the third column and then dividing by 1024 can yield the spectral efficiency of the fourth column, i.e., SE = R × Qm; In Table 9, the spectral efficiency of the fourth column for at least one coding and modulation scheme index cannot be determined solely by the modulation order in the second column and the target code rate in the third column.

[0470] For example, the first coding modulation scheme index I MCS1 Second coding modulation scheme index I MCS2 These are respectively coding and modulation scheme index 26 and coding and modulation scheme index 16 in Table 9, i.e., I MCS1 =26 and I MCS2 =16. Index I of the first coding modulation scheme MCS1 =26 indicates a probability amplitude shaping scheme with a first modulation order of Qm1=6, a first target code rate of R1=916.48 / 1024, and a first spectral efficiency of SE1=5.1152 bits / symbol; the second coding modulation scheme index I MCS2 =16 indicates a probabilistic amplitude shaping scheme with a second modulation order of Qm2=4, a second target code rate of R2=764.59 / 1024, and a second spectral effect of SE2=2.5703 bits / symbol. Here, the first modulation order Qm1 and the second modulation order Qm2 are the modulation orders of quadrature amplitude modulation and are used to indicate the modulation process of the modulation mapper 204 in the probabilistic amplitude shaping transmitter link. The first target code rate and the second target code rate are used in the probabilistic amplitude shaping transmitter link to indicate the encoding process of the channel encoder 203. The shaping coding code rate Rsh of the shaping encoder 202 in the probabilistic amplitude shaping transmitter link can be calculated based on the modulation order Qm, the target code rate R, and the spectral effect SE. For example, The bit rate Rsh of the shaping encoder 202 is defined as the ratio of the number of input bits to the number of output bits of the shaping encoder 202.

[0471] The first node also obtains from higher layers the total number of resource elements Nre used for transporting blocks and the number of layers N used for transporting blocks. layer .

[0472] Step 2: The first node must, at least according to the total number of resource elements Nre used for transporting blocks in Step 1 and the number of layers N used for transporting blocks in Step 1. layer and the second coding modulation scheme index I in step 1. MCS2 Determine the length Ka of the first bit sequence a.

[0473] For example, the first bit sequence is a transport block sent from the first node to the second node, and the length Ka of the first bit sequence a is the transport block size.

[0474] Step 3: The first node obtains Ka bits from the higher layer to get the first bit sequence a based on the length Ka of the first bit sequence a in Step 2.

[0475] Step 4: The first node determines the second modulation order Qm2 as the index I of the second coding modulation scheme in Step 1. MCS2 The modulation order is indicated. The first node is determined based on the second modulation order Qm2, the total number of resource elements Nre used for transport block transmission in step 1, and the number of layers N used for transport block transmission in step 1. layer Determine the length Ny of the target sequence Y.

[0476] For example, the length Ny of the target sequence Y is equal to the second modulation order Qm2, the total number of resource elements Nre used for transport block transmission in step 1, and the number of layers N used for transport block transmission in step 1. layer The product of the three, i.e., Ny = N layer ×Nre×Qm2.

[0477] For example, the target sequence Y is the bit sequence g output by the transmitter link channel encoder 203 with probability amplitude shaping.

[0478] Step 5: The first node must at least follow the first coding and modulation scheme index I from Step 1. MCS1 The length K1 of the input bit sequence of the shaping encoder 202 and the length N1 of the output bit sequence of the shaping encoder 202 are determined. The first node determines the target sequence Y based at least on the length K1 of the input bit sequence of the shaping encoder 202, the length N1 of the output bit sequence of the shaping encoder 202, the length Ka of the first bit sequence a in step 2, the first bit sequence a in step 3, the length Ny of the target sequence Y in step 4, and the second modulation order Qm2 in step 4. For example, the first node determines the target sequence Y from the first bit sequence a in step 3 according to the probability amplitude shaped transmitter link, wherein the target sequence Y is the bit sequence g output by the channel encoder 203 in the probability amplitude shaped transmitter link.

[0479] Step 6: The first node sends a signal including the target sequence Y to the second node.

[0480] Example 4: Assume the first node is a base station and the second node is a user equipment. Both the first parameter P1 and the second parameter P2 are coding and modulation scheme indices. The coding and modulation scheme index corresponding to the first parameter P1 is called the first coding and modulation scheme index I. MCS1 The coding and modulation scheme index corresponding to the second parameter P2 is called the second coding and modulation scheme index I. MCS2 Subsequently, the first coding and modulation scheme index I will be used directly. MCS1 Second coding modulation scheme index I MCS2 The first parameter P1 and the second parameter P2 are replaced respectively, and their descriptions are no longer used. The steps of the communication method include:

[0481] Step 1: The second node determines the first coding and modulation scheme index I based on the first field and the second field in the same downlink control information sent to the second node by the first node. MCS1 Second coding modulation scheme index I MCS2 The first field is used to determine the index I of the first coding modulation scheme. MCS1 The second field is used to determine the index I of the second coding modulation scheme. MCS2 The second node determines the total number of resource elements Nre used for transport block transmission and the number of layers N used for transport block transmission based on the fields other than the first and second fields in the same downlink control information sent to the second node by the first node. layer The "first" and "second" in the first and second fields only indicate that the two fields are different, and do not represent a sequential relationship. The first coding modulation scheme index I... MCS1 Second coding modulation scheme index I MCS2 The encoding process of the transmitter link used to indicate probability amplitude shaping.

[0482] For example, the first coding modulation scheme index I MCS1 Second coding modulation scheme index I MCS2 These are respectively coding and modulation scheme index 26 and coding and modulation scheme index 16 in Table 9, i.e., I MCS1 =26 and I MCS2 =16. Index I of the first coding modulation scheme MCS1 =26 indicates a probability amplitude shaping scheme with a modulation order of Qm1=6, a target code rate of R1=916.48 / 1024, and a spectral efficiency of SE1=5.1152 bits / symbol. Second coding modulation scheme index I MCS2 =16 indicates a probabilistic amplitude shaping scheme with modulation order Qm2=4, target code rate R2=764.59 / 1024, and spectral efficiency SE2=2.5703 bits / symbol, where modulation order Qm1 and modulation order Qm2 are the modulation orders of quadrature amplitude modulation. The shaping code rate Rsh of the shaping encoder 202 in the transmitter link of the probabilistic amplitude shaping scheme can be determined based on the modulation order Qm1, Qm2, and Qm2.

[0483] The target code rate R and spectral efficiency SE are calculated, for example, The bit rate Rsh of the shaping encoder 202 is defined as the ratio of the number of input bits to the number of output bits of the shaping encoder 202.

[0484] Step 2: The second node, based on the total number of resource elements Nre used for transporting blocks in Step 1 and the number of layers N used for transporting blocks in Step 1... layer Determine the length Ny of the target sequence Y.

[0485] For example, the length Ny of the target sequence Y is equal to the total number of resource elements Nre used for transporting blocks in step 1 and the number of layers N used for transporting blocks in step 1. layer The product of, i.e., Ny = N layer ×Nre.

[0486] For example, the target sequence Y is the modulation symbol sequence output by the modulation mapper 204 in the probability amplitude-shaped transmitter link.

[0487] Step 3: The second node receives the signal sent by the first node, which includes the target sequence Y.

[0488] Step 4: The second node, based on the total number of resource elements Nre used for transporting blocks in Step 1 and the number of layers N used for transporting blocks in Step 1... layer The length Ka of the first bit sequence a is determined by the second modulation order Qm2, the second target code rate R2, and the second spectral effect SE2, where the second modulation order Qm2, the second target code rate R2, and the second spectral effect SE2 are respectively the indexes I of the second coding modulation scheme in step 1. MCS2 The modulation order, target code rate, and distribution matching code rate are indicated. The length of the first bit sequence is the transport block size.

[0489] For example, the second modulation order Qm2 is the modulation order used by the modulation mapper 204.

[0490] Step 5: The second node estimates the first bit sequence a based at least on the second modulation order Qm2, the first target code rate R1, the first spectral effect SE1, the signal including the target sequence Y from step 3, and the length Ka of the first bit sequence a from step 4, where the second modulation order Qm2 is the index I of the second coding modulation scheme from step 1. MCS2 The indicated modulation order and first target code rate R1 are the index I of the first coding modulation scheme. MCS1 The indicated target bit rate and first spectral effect SE1 are the index I of the first coding and modulation scheme. MCS1 The indicated spectral effect. For example, the first bit sequence is a portion of the input bit sequence of the splitter 201 in the transmitter link corresponding to probability amplitude shaping.

[0491] Example 5: Explanation of step 2 in Example 1. Hereafter, the second modulation order Qm2, the second target code rate R2, and the second target distribution matching code rate Rsh2 refer to the second coding modulation scheme index I in step 1 of Example 1, respectively. MCS2 The indicated modulation order, target code rate, and target distribution matching code rate. "Nre" refers to the total number of resource elements (Nre) used for transport block transmission in step 1 of Example 1. ya N l "Refers to the number of layers N used for transport block transmission in step 1 of Example 1" layer .

[0492] Assume the first bit sequence is a transport block sent from the first node to the second node, and the length Ka of the first bit sequence a is the transport block size. The first bit sequence a is the input bit sequence b(0)~b(K-1) of the splitter 201 in the probability amplitude shaping transmitter link, i.e., a=b and Ka=K. The target sequence Y in Example 1 is the output bit sequence g of the channel encoder 203 in the probability amplitude shaping transmitter link, including:

[0493] Determine the first length: based on Nre, N layer The second modulation order Qm2 determines the first length N1. A specific way to do this is as follows: N1 = N... layer ×Nre×(Qm2-2), where the first length N1 is the length of the output bit sequence of the shaping encoder 202 in the transmitter link of probability amplitude shaping.

[0494] Determine the second length: based on Nre, N layer The second modulation order Qm2 and the second target code rate R2 determine the second length N2.

[0495] For example, N2 = ceil(N layer ×Nre×Qm2×R2)-D2, where the second length N2 is the length of the input bit sequence of the channel encoder 203 in the transmitter link with probability amplitude shaping, and D2 is a non-negative integer.

[0496] In some embodiments, D2 can be the number of CRC bits.

[0497] For example, D2 = 0.

[0498] For example, D2 = 16.

[0499] For example, D2 = 24.

[0500] For example, D2 = 32.

[0501] Determine the third length: based on Nre, N layer The second target distribution matching code rate Rsh2 determines the third length N3. A specific method is N3 = ceil(2 × N) layer ×Nre×Rsh2), where the third length N3 is the length of the first part b1 output by the splitter 201 (that is, the length of the input bit sequence of the shaping encoder 202) K1.

[0502] Determine the length of the first bit sequence: The length Ka of the first bit sequence a is determined by the first length N1, the second length N2, and the third length N3.

[0503] For example, Ka = N3 + N2 - N1.

[0504] For example, Where T is a positive integer.

[0505] It should be understood that, through It can be guaranteed that the length of the first bit sequence is a multiple of T.

[0506] Example 6: Another specific example of step 2 in Example 1. Let the second modulation order Qm2, the second target code rate R2, and the second target distribution matching code rate Rsh2 refer to the index I of the second coding modulation scheme in step 1 of Example 1, respectively. MCS2 The indicated modulation order, target code rate, and target distribution matching code rate. "Nre" refers to the total number of resource elements (Nre) used for transport block transmission in step 1 of Example 1. r N eyal "Refers to the number of layers N used for transport block transmission in step 1 of Example 1" layer .

[0507] Assume the first bit sequence is a transport block sent from the first node to the second node, and the length Ka of the first bit sequence a is the sum of the transport block size and the number of cyclic redundancy check bits in the transport block. The first bit sequence a is the input bit sequence b(0)~b(K-1) of the splitter 201 in the probability amplitude shaping transmitter link, i.e., a=b and Ka=K. The target sequence Y in Example 1 is the output bit sequence g of the channel encoder 203 in the probability amplitude shaping transmitter link, including:

[0508] Determine the first length: based on Nre, N layer The second modulation order Qm2 determines the first length N1. A specific way to do this is as follows: N1 = N... layer ×Nre×(Qm2-2), where the first length N1 is the length of the output bit sequence of the shaping encoder 202 in the transmitter link of probability amplitude shaping.

[0509] Determine the second length: based on Nre, N layer The second modulation order Qm2 and the second target code rate R2 determine the second length N2. A specific method is N2 = ceil(N... layer ×Nre×Qm2×R2), where the second length N2 is the length of the input bit sequence of the channel encoder 203 in the transmitter link with probability amplitude shaping.

[0510] Determine the third length: based on Nre, N layer The second target distribution matching code rate Rsh2 and the maximum number of information bits in the integer block Ksmax determine the third length N3.

[0511] For example, in, Cs is the number of integer code blocks, Ksmax is the maximum number of information bits in the integer block, T is a positive integer, and the third length N3 is the length of the first part b1 of the splitter 201 (that is, the length of the output bit sequence of the shape encoder 202) K1.

[0512] Determine the length of the first bit sequence: The length Ka of the first bit sequence a is determined by the first length N1, the second length N2, and the third length N3.

[0513] For example, Ka = N3 + N2 - N1.

[0514] For example, Where T' is a positive integer.

[0515] Example 7: Another concrete example of step 2 in Example 1. The second modulation order Qm2, the second target code rate R2, and the second target distribution matching code rate Rsh2 refer to the index I of the second coding modulation scheme in step 1 of Example 1. MCS2 The modulation order, target code rate, and target distribution matching code rate are indicated. "Nre" refers to the total number of resource elements Nre used for transport block transmission in step 1 of Example 1. Refers to the number of layers N used for transport block transmission in step 1 of Example 1. layer .

[0516] It should be noted that the difference between this example and Example 6 is that the third length is determined in the following way: based on Nre, N layer The third length N3 is determined by the maximum number of symbols in the maximum integer block output amplitude Nsmax and the second target distribution matching code rate Rsh2. A specific method is as follows: in, Cs is the number of shaping blocks, and the third length N3 is the length of the first part b1 output by the splitter 201 (that is, the length of the output bit sequence of the shaping encoder 202) K1.

[0517] Example 8: Another specific example of step 2 in Example 1. The second modulation order Qm2, the second target code rate R2, and the second target integer code rate Rsh2 refer to the index I of the second coding modulation scheme in step 1 of Example 1. MCS2 The indicated modulation order, target code rate, and target shaping code rate, where the second target code rate Rsh2 is the ratio K1 / N1 of the input bit sequence length K1 of the shaping encoder 202 to the output bit sequence length N1 of the shaping encoder 202. "Nre" refers to the total number of resource elements Nre used for transport block transmission in step 1 of Example 1. a N l "Refers to the number of layers N used for transport block transmission in step 1 of Example 1" layer .

[0518] It should be noted that the difference between this example and Example 6 is that the third length is determined in the following way: based on Nre, N layer The third length N3 is determined by the maximum number of output bits of the shaping encoder Nsmax2, the second modulation order Qm2, and the second target shaping code rate Rsh2. A specific method is as follows: in, Cs is the number of shaping blocks, and the third length N3 is the length of the first part b1 output by the splitter 201 (that is, the length of the output bit sequence of the shaping encoder 202) K1.

[0519] Example 9: A specific example of step 5 in Example 1. The first modulation order Qm1, the first target code rate R1, the first target distribution-matched code rate Rsh1, and the first spectral effect SE1 respectively refer to the index I of the first coding modulation scheme in step 1 of Example 1. MCS1 The indicated modulation order, target code rate, target distribution-matched code rate, and spectral effect. In the following example, the second modulation order Qm2, the second target code rate R2, the second target distribution-matched code rate Rsh2, and the second spectral effect SE2 refer to the second coding modulation scheme index I in step 1 of Example 1. MCS2 The notation indicates the modulation order, target code rate, target distribution matched code rate, and spectral effect. In the examples below, the notation "Nre" refers to the total number of resource elements Nre used for transport block transmission in step 1 of Example 1. In the examples below, the notation "N layer "Refers to the number of layers N used for transport block transmission in step 1 of Example 1" layer The first node determines the target sequence Y based at least on the length Ka of the first bit sequence a, the first modulation order Qm1, the first target code rate R1, the first target distribution matching code rate Rsh1, the first bit sequence a, the length Ny of the target sequence Y, and the second modulation order Qm2, including the following steps:

[0520] Step 1: (1) Determine the length K1 of the first part b1 output by the splitter 601 based on the first target distribution matching code Rsh1, the first spectral effect SE1, and the length Ka of the first bit sequence a.

[0521] For example, in, Cs represents the number of integer blocks, Rsh1 is defined as the ratio of the number of bits in the input of the distributed matcher to the number of amplitude symbols in the output, and Nsmax1 is the maximum number of amplitude symbols in the output of each integer block of the distributed matcher.

[0522] In some embodiments, the length K1 of the first portion b1 output by the splitter 601 is the third length N3 determined in Example 5, Example 6, or Example 7, i.e., K1 = N3.

[0523] (2) Based on the length Ka of the first bit sequence a and the length K1 of the first part b1 output by the splitter 601, the length K2 of the second part b2 output by the splitter 601 is determined to be equal to the difference between the length Ka of the first bit sequence a and the length K1 of the first part b1 output by the splitter 601, i.e., K2 = Ka - K1.

[0524] (3) Determine the first part b1 and the second part b2 of the output of the splitter 601 based on the length Ka of the first bit sequence a, the length K1 of the first part b1 output by the splitter 601, and the length K2 of the second part b2 output by the splitter 601.

[0525] In some embodiments, the first part b1 output by the splitter 601 consists of the first K1 bits of the first bit sequence a (i.e., bits with indices less than K1), and the second part b2 output by the splitter 601 consists of the last K2 bits of the first bit sequence a (i.e., bits with indices greater than or equal to K1).

[0526]

[0527] Step 2: In the shaping block segmentation 602, (1) the number of shaping code blocks Cs is determined at least according to the length Ka of the first spectral effect SE1 and the first bit sequence a.

[0528] For example, the number of integer code blocks Cs is Cs represents the number of integer blocks, and Nsmax1 represents the maximum number of output amplitude symbols per integer block of the distributed matcher.

[0529] (2) The first part b1 of the output of the splitter 601 with length K1 of the integer block segmentation 602 input is divided into Cs integer block input bit sequences b1'0, b1'1, ..., b1' with length K1'. Cs-1 , where K1'=K1 / Cs.

[0530] For example, the integer block input bit sequence b1' with index r r The first part b1 output by splitter 601 consists of bits whose indices are greater than or equal to r×K1' and less than (r+1)×K1', i.e.

[0531] b1' r (k)=b1(r×K1'+k),k=0,1,...,K1'-1.

[0532] (3) Determine the total length NA of the output amplitude symbol sequence of Cs integer blocks based on the length Ka of the first spectral effect SE1 and the first bit sequence a.

[0533] For example, NA = ceil(2×Ka / SE1).

[0534] (4) Determine the lengths of the output amplitude symbol sequences of the Cs integer blocks, respectively, based at least on the lengths of the first spectral effect SE1 and the first bit sequence a, namely NA'0, NA'1, ..., NA'. Cs-1 , among which, NA'0+NA'1+…+NA' Cs-1 =NA.

[0535] In some embodiments, when the index r is less than mod(NA,Cs), the length NA' of the amplitude sign sequence of the integer block is... r for When the index r is greater than or equal to mod(NA, Cs), the length NA' of the amplitude sign sequence of the integer block. r for

[0536] In some embodiments, for all indices r = 0, 1, ..., Cs-1, the length NA' of the amplitude sign sequence of the integer block r for

[0537] Step 3: For indices r = 0, 1, ..., Cs-1, the distribution matcher 603 inputs a bit sequence b1' based on at least the integer block length K1' and the integer block with index r. r The length NA' of the output amplitude sign sequence of the integer block with index r r Performing distribution matching yields a length of NA' r The output amplitude sign sequence A' of the shaping block r .

[0538] In some embodiments, distribution matching may use any one of a number of suitable algorithms and any one of a number of suitable configurations.

[0539] In some embodiments, distribution matching includes, but is not limited to: constant-composition distribution matcher (CCDM), bit-level distribution matcher (BL-DM), product distribution matcher (PDM), multi-composition distribution matcher (MCDM), multiset-partition distribution matcher (MPDM), partition-based distribution matcher, parallel-amplitude distribution matcher with subset ranking, streaming distribution matcher, prefix-free codedistribution matcher, shell mapping, enumerative sphereshaping (ESS), approximate enumerative sphere shaping (AESS), partial enumerative sphere shaping (PESS), and Huffman-coded sphere shaping.Framing of variable-length distribution matcher outputs into fixed-length blocks, distribution matcher with mark ratio control, hierarchical distribution matcher, parallel bisection-based distribution matcher, polar-coded distribution matcher, and block-code-based shaping encoder.

[0540] Step 4: Convert the output amplitude sign sequence A'0, A'1, ..., A' of the Cs integer blocks output by the distributed matcher 603 in Step 3 into a sequence of Cs integer blocks. Cs-1 The cascaded output amplitude symbol sequence A is a shaped output amplitude symbol sequence of length NA, where NA is the sum of the lengths of the output amplitude symbol sequences of the Cs shaped blocks determined in step 2, segmentation 602.

[0541] For example, the index in the shaped output amplitude sign sequence A is greater than or equal to NA'0+NA'1+…+NA'. r-1 And less than NA'0+NA'1+…+NA' r The amplitude sign is the output amplitude sign sequence A' of the integer block with index r. r The amplitude sign, i.e., A(NA'0+…+NA') r-1 +j)=A' r (j), j = 0, 1, ..., NA' r -1.

[0542] Step 5: Convert each amplitude symbol in the amplitude symbol sequence A of length NA of the output amplitude of the cascaded 604 ...

[0543] For example, the amplitude-to-bit mapper 605 converts each amplitude A(j) in the shaped output amplitude symbol sequence A into Qm1 / 2-1 bits c(j·(Qm1 / 2-1)), c(j·(Qm1 / 2-1)+1),...,c(j·(Qm1 / 2-1)+Qm1 / 2-2) according to a preset mapping method, and then concatenates them into an ordered bit sequence c, where the length N1 of the ordered bit sequence c(0)~c(N1-1) is equal to NA·(Qm1-2), and Qm1 is the first modulation order Qm1.

[0544] For example, the amplitude-to-bit mapper 605 converts each amplitude A(j) in the shaped output amplitude symbol sequence A into m-1 bits c(j·(m-1)), c(j·(m-1)+1),...,c(j·(m-1)+m-2) according to a preset mapping method, and then concatenates them into an ordered bit sequence c, where the length N1 of the ordered bit sequence c is equal to NA·(m-1), and m is the first modulation order Qm1.

[0545] Step 6: (1) Determine the lift value Z based on the length K2 of the second part b2 output by the splitter 601 in Step 1, the length N1 of the ordered bit sequence c output by the amplitude-to-bit mapper 605 in Step 5, the number of CRC bits Lcrc, and the number of columns of the LDPC code system Kb, where the lift value Z is the matrix H of the base graph of the MB row and NB column of the LDPC code. BG The lifting value of the parity check matrix H extended to LDPC codes, where Kb is less than or equal to the matrix H of the underlying graph of the LDPC code. BG The difference between the number of columns and the number of rows is NB-MB.

[0546] For example, Z is a set S Z Find the minimum value of S that satisfies Kb×Z≥K2+N1+Lcrc. Z Zmax is a subset of positive integers that are less than or equal to Zmax. For example, the set of all lift values ​​in Table 3, where Zmax is a positive integer greater than 1.

[0547] (2) Determine the number of system bits Npunc of the LDPC code based on at least one of the length K2 of the second part b2 output by the splitter 601 in step 1, the number of CRC bits Lcrc, the boost value Z, the minimum number of system bits Npth, and the maximum number of system bits Npm.

[0548] For example, the minimum number of system bit punctures, Npth, can be Z.

[0549] For example, the minimum number of system bit punctures, Npth, can be 0.5 × Z.

[0550] Exemplarily, the minimum system bit puncturing number Npth can be 0.25×Z.

[0551] Exemplarily, the maximum system bit puncturing number Npm can be 2×Z.

[0552] Exemplarily, the maximum system bit puncturing number Npm can be Z.

[0553] Exemplarily, the maximum system bit puncturing number Npm can be 0.5×Z.

[0554] Exemplarily, when K2+Lcrc<Npm, Npunc = K2+Lcrc, as Figure 8 shown in (a) and 8(b), the number of non-amplitude bits in the figure is K2+Lcrc.

[0555] As Figure 8 shown, it is a schematic diagram of the relationship of a bit sequence provided by an embodiment of the present disclosure. A schematic diagram of the relationship among the ordered bit sequence c output by the amplitude-to-bit mapper 605 in multiple steps 5, the second part b2 output by the splitter 601 in step 1, Lcrc CRC bits p(0) to p(Lcrc-1), and the LDPC-encoded system bit sequence c', where Figure 8 the amplitude bits are the bits in the ordered bit sequence c, and the non-amplitude bits are the bits in the second part b2 output by the splitter 601 in step 1 and Lcrc CRC bits p(0) to p(Lcrc-1).

[0556] In some embodiments, the bits in the LDPC-encoded system bit sequence c' with an index less than the system bit puncturing number Npunc only include the second part b2 output by the splitter 601 in step 1 and Lcrc CRC bits p(0) to p(Lcrc-1), and the bits in the LDPC-encoded system bit sequence c' with an index greater than or equal to Npunc only include the ordered bit sequence c output by the amplitude-to-bit mapper 605 in step 5, as Figure 8 shown in (a).

[0557] In some embodiments, the bits in the LDPC-encoded system bit sequence c' with an index less than the system bit puncturing number Npunc only include the second part b2 output by the splitter 601 in step 1 and Lcrc CRC bits p(0) to p(Lcrc-1), and the bits in the LDPC-encoded system bit sequence c' with an index greater than or equal to Npunc only include the ordered bit sequence c output by the amplitude-to-bit mapper 605 in step 5 and padding bits, as Figure 8 shown in (b).

[0558] In some embodiments, the bits in the LDPC-encoded system bit sequence c' with indices less than the number of system bit punctures Npunc only include the second part b2 output by the splitter 601 in step 1, Lcrc CRC bits p(0) to p(Lcrc-1), and padding bits, and the bits in the LDPC-encoded system bit sequence c' with indices greater than or equal to Npunc only include the ordered bit sequence c output by the amplitude-to-bit mapper 605 in step 5, such as... Figure 8 As shown in (c).

[0559] In some embodiments, the bits in the LDPC-encoded system bit sequence c' with indices less than the number of system bit punctures Npunc only include the second part b2 of the output of the splitter 601 in step 1 and Lcrc CRC bits p(0) to p(Lcrc-1) and padding bits, and the bits in the LDPC-encoded system bit sequence c' with indices greater than or equal to Npunc only include the ordered bit sequence c of the amplitude-to-bit mapper 605 in step 5 and padding bits, such as Figure 8 As shown in (d).

[0560] In some embodiments, the bits in the LDPC-encoded system bit sequence c' with indices less than the number of system bit punctures Npunc only include the second part b2 and Lcrc CRC bits p(0) to p(Lcrc-1) output from the splitter 601 in step 1, and the bits in the LDPC-encoded system bit sequence c' with indices greater than or equal to Npunc only include the ordered bit sequence c output from the amplitude-to-bit mapper 605 in step 5, such as... Figure 8 As shown in (e).

[0561] In some embodiments, the bits in the LDPC-encoded system bit sequence c' with indices less than the number of system bit punctures Npunc only include the second part b2 output by the splitter 601 in step 1 and Lcrc CRC bits p(0) to p(Lcrc-1), and the bits in the LDPC-encoded system bit sequence c' with indices greater than or equal to Npunc only include the ordered bit sequence c output by the amplitude-to-bit mapper 605 in step 5 and the padding bits, such as... Figure 8 As shown in (f).

[0562] In some embodiments, the bits in the LDPC-encoded system bit sequence c' with indices less than the number of system bit punctures Npunc include only the second part b2 output by the splitter 601 in step 1 and Lcrc CRC bits p(0) to p(Lcrc-1), and the bits in the LDPC-encoded system bit sequence c' with indices greater than or equal to Npunc include the ordered bit sequence c output by the amplitude-to-bit mapper 605 in step 5, the second part b2 output by the splitter 601 in step 1, and Lcrc CRC bits p(0) to p(Lcrc-1), such as... Figure 8 As shown in (g).

[0563] In some embodiments, the bits in the LDPC-encoded system bit sequence c' with indices less than the number of system bit punctures Npunc include only the second part b2 output by the splitter 601 in step 1 and Lcrc CRC bits p(0) to p(Lcrc-1), and the bits in the LDPC-encoded system bit sequence c' with indices greater than or equal to Npunc include the ordered bit sequence c output by the amplitude-to-bit mapper 605 in step 5, the second part b2 output by the splitter 601 in step 1, Lcrc CRC bits p(0) to p(Lcrc-1), and padding bits, such as... Figure 8 As shown in (h).

[0564] In some embodiments, bits in the LDPC-encoded system bit sequence c' with indices less than the system bit puncture number Npunc do not include padding bits, and bits in the LDPC-encoded system bit sequence c' with indices greater than or equal to Npunc also do not include padding bits, such as... Figure 8 (a) Figure 8 Middle (e) or Figure 8 As shown in (g).

[0565] In some embodiments, bits in the LDPC-encoded system bit sequence c' with indices less than the system bit puncture number Npunc include padding bits, such as... Figure 8 (c) or Figure 8 As shown in (d).

[0566] In some embodiments, bits in the LDPC-encoded system bit sequence c' with indices less than the system bit puncture number Npunc include padding bits, and bits in the LDPC-encoded system bit sequence c' with indices greater than or equal to Npunc also include padding bits, such as... Figure 8 As shown in (d).

[0567] In some embodiments, bits with indices greater than or equal to Npunc in the LDPC-encoded system bit sequence c' also include padding bits, such as... Figure 8 (b) Figure 8 in (d), Figure 8 in (f) or Figure 8 as shown in (h).

[0568] In some embodiments, the bits in the LDPC - encoded systematic bit sequence c' with indices less than the systematic bit puncturing number Npunc do not include the bits in the ordered bit sequence c output by the amplitude - to - bit mapper 605 in step 5, and the bits in the LDPC - encoded systematic bit sequence c' with indices greater than or equal to Npunc + N1 include some bits of the second part b2 output by the splitter 601 in step 1, as Figure 8 shown in (g) and Figure 8 shown in (h).

[0569] It should be understood that the above - mentioned ways of multiplexing and inserting padding bits can make the bits in the ordered bit sequence c output by the amplitude - to - bit mapper 605 start from index 0 in the codeword bit sequence d after LDPC encoding, facilitating subsequent rate - matching operations.

[0570] In some embodiments, the systematic bit puncturing number Npunc of the LDPC code is equal to Npm, as Figure 8 shown in (c) to (h).

[0571] In some embodiments, when K2 + Lcrc ≥ Npm, Npunc = Npm, as Figure 8 shown in (e) to (h), and the number of non - amplitude bits in the figure is K2 + Lcrc.

[0572] In some embodiments, when Npth ≤ K2 + Lcrc < Npm, Npunc = K2 + Lcrc; when K2 + Lcrc < Npth or K2 + Lcrc ≥ Npm, Npunc = Npm.

[0573] (3) According to the ordered bit sequence c output by the amplitude - to - bit mapper 605 in step 5, the length N1 of the ordered bit sequence c, the second part b2 output by the splitter 601 in step 1, the length K2 of the second part b2 output by the splitter 601 in step 1, and the cyclic generating polynomial g CRC (D)=g Lcrc ·D Lcrc +g Lcrc-1 ·D Lcrc-1 +…+g2·D 2 +g1·D 1 +g0 determines Lcrc CRC bits p(0), p(1), ..., p(Lcrc-1), where Lcrc CRC bits p(0), p(1), ..., p(Lcrc-1) are Lcrc CRC bits p(0) to p(Lcrc-1) obtained by concatenating the ordered bit sequence c output by the amplitude-to-bit mapper 605 in step 5 with the second part b2 output by the splitter 601 in step 1.

[0574] (4) The ordered bit sequence c output by the amplitude-to-bit mapper 605 in step 5, the second part b2 output by the splitter 601 in step 1, and Lcrc CRC bits p(0) to p(Lcrc-1) are multiplexed and filled with filler bits. <null>"We obtain the systematic bit sequence c' of LDPC encoding with length Nc' = (NB - MB) × Z, where NB and MB are the matrix H of the base graph of the MB row and NB column of the LDPC code, respectively." BG The number of columns and rows, Z is the matrix H of the base graph of the MB row and NB column of the LDPC code. BG The lifting value of the parity check matrix H extended to LDPC codes.

[0575] Step 7: Based on the CRC Attach 606 determined in Step 6, the system bit puncture number Npunc, the boost value Z, and the base graph matrix H of the MB row and NB column of the LDPC code. BG The number of columns NB, the parity check matrix H of the LDPC code, the systematic bit sequence c' of the LDPC code, and the length Nc' of the systematic bit sequence c' of the LDPC code determine the codeword bit sequence d of the LDPC code.

[0576] For example, the length Nd of the codeword bit sequence d encoded by LDPC is Nd = NB × Z - Npunc.

[0577] For example, the bits with indices less than Nc'-Npunc in the LDPC-encoded codeword bit sequence d are determined as follows: For indices k greater than or equal to Npunc and less than Nc', the bit c'(k) with index k in the LDPC-encoded systematic bit sequence c' is a non-padded bit (i.e., c'(k) ≠ Nc'). <null>When the LDPC-encoded codeword bit sequence d is set, the bit d(k-Npunc) at index k-Npunc is set as bit c'(k), i.e., d(k-Npunc) = c'(k); when the LDPC-encoded system bit sequence c' has index k, the bit c'(k) at index k is set as a padding bit. <null>"When setting the bit d(k-Npunc) at index k-Npunc in the LDPC-encoded codeword bit sequence d, the bit is set as a padding bit." <null>That is, d(k-Npunc) = <null>.

[0578] For example, first, the padding bits in the LDPC-encoded system bit sequence c' are... <null>Replace the bits with "0", and then generate Nd + Npunc - Nc' parity bits w = [w(0), ..., w(Nd + Npunc - Nc' - 1)] based on the replaced LDPC encoded system bit sequence c' and the LDPC code parity check matrix H, such that H × [c', w] T =θ, where [c',w] T Let θ be a column vector of length NB×Z, and let θ be a zero vector of length MB×Z. Matrix and vector multiplication is performed over the Galois field GF(2). The parity check matrix H of the LDPC code is an MB×Z matrix with NB×Z columns, and the parity check matrix H of the LDPC code is based at least on the matrix H of the fundamental graph of the LDPC code. BG The value is determined by the increase Z.

[0579] For example, the bits in the LDPC-encoded codeword bit sequence d whose index is greater than or equal to Nc'-Npunc are set as bits in the check bit w: For indices k = Nc', Nc'+1, ..., Nd+Npunc, the check bit part of the LDPC-encoded codeword bit sequence d is set as: d(k-Npunc) = w(k-Nc').

[0580] Step 8: Based on the LDPC encoded codeword bit sequence d, the second modulation order Qm2, Nre, and N... layer Determine the output bit sequence of rate-matched 608 (i.e., the output bit sequence of bit-interleaved 6082).

[0581] (1) Bit selection 6081 is based on the LDPC encoded codeword bit sequence d, the second modulation order Qm2, Nre and N layer Determine the bit selection sequence e output by bit selection 6081. For example, the length Ne of the bit selection sequence e is equal to the second modulation order Qm2, Nre, and N... layer The product of the three, namely Ne = N layer ×Nre×Qm2. For example, starting from the bit at index k0 of the LDPC-encoded codeword bit sequence d, Ne non-filler bits are cyclically selected with a circular buffer length Ncb to obtain the bit selection sequence e, where k0 is a non-negative integer and Ncb is a positive integer. For example, pseudocode for implementing bit selection is as follows:

[0582]

[0583]

[0584] (2) Bit Interleaving 6082 determines the bit interleaving sequence f output by Bit Interleaving 6082 based on the bit selection sequence e output by Bit Selection 6081, the second modulation order Qm2, and the length Ne of the bit selection sequence e. For example, the length Nf of the bit interleaving sequence f output by Bit Interleaving 6082 is equal to the length Ne of the bit selection sequence e output by Bit Selection 6081, i.e., Nf = Ne. For example, the bit selection sequence e is written into a buffer matrix of Ne / Qm2 rows and Qm2 columns in a row-first, column-second order, and then read out into a bit interleaving sequence f of the same length Nf in a column-first, row-second order. That is, for j = 0, 1, ..., Ne / Qm2-1, i = 0, 1, ..., Qm2-1, set f(i+j·Qm2) = e(i·Ne / Qm2+j).

[0585] The bit interleaving sequence f output by the bit interleaving 6082 in step 8 is the target sequence Y in step 5 of Example 1, and the length Ny of the target sequence Y is equal to the length Nf of the bit interleaving sequence f output by the bit interleaving 6082 in step 8, that is, Y = f and Ny = Nf.

[0586] The communication method provided in this disclosure can be applied to... Figure 1 The second node 102 in the communication system shown. Figure 9 A flowchart of a communication method is shown, such as... Figure 9 As shown, the communication method includes the following S901-S903:

[0587] S901, Obtain encoding-related parameters.

[0588] S902, Receive the signal including the target sequence from the first node.

[0589] The target sequence is obtained from the first bit sequence based on a probability amplitude shaping scheme.

[0590] S903. Determine the first bit sequence based on the encoding-related parameters and the signal including the target sequence.

[0591] In some embodiments, the encoding-related parameters include a first parameter and a second parameter.

[0592] In some embodiments, the first parameter and the second parameter are used to implement processes other than modulation mapping in the probability amplitude shaping scheme, and one of the parameters is also used to implement the modulation mapping process.

[0593] In some embodiments, the first parameter includes at least one of the following:

[0594] Index of coding and modulation schemes;

[0595] Parameters for distribution matching.

[0596] In some embodiments, the coding modulation scheme index is used to indicate at least one of the following coding modulation parameters:

[0597] Modulation order, channel coding rate, distribution matching rate, integer code rate, proportion of non-integer information bits, probability distribution of elements in the amplitude set, entropy of amplitude symbols, and spectral efficiency.

[0598] In some embodiments, the channel coding rate is used to indicate the code rate of channel coding, or to indicate the code rate of low-density parity-check coding.

[0599] In some embodiments, the first bit sequence includes a first portion and a second portion; the proportion of non-integer information bits is used to indicate one of the following:

[0600] The ratio between the size of the second part of the first bit sequence and the size of the bit sequence after amplitude shaping of the first part;

[0601] The ratio between the size of the second part of the first bit sequence and the size of the bit sequence after the distribution matching of the first part;

[0602] The ratio between the size of the second part of the first bit sequence and the size of the amplitude sign sequence after amplitude shaping of the first part;

[0603] The ratio between the size of the second part of the first bit sequence and the size of the amplitude symbol sequence after the distribution matching of the first part;

[0604] The ratio between the size of the second part of the first bit sequence and the size of the target sequence;

[0605] The ratio between the size of the second part of the first bit sequence and the size of the target sequence is half.

[0606] In some embodiments, the parameters for distribution matching include at least one of the following:

[0607] The bit rate of the distribution matching, the index of the bit rate of the distribution matching, the index of the distribution matching scheme, and the proportion of non-integer information bits.

[0608] In some embodiments, the second parameter includes at least one of the following:

[0609] Index of coding and modulation schemes;

[0610] Transport block size.

[0611] In some embodiments, the first parameter and the second parameter satisfy one of the following:

[0612] The first parameter and the second parameter are parameters of different types;

[0613] The first and second parameters are of the same type.

[0614] The first parameter and the second parameter are of the same type, but the values ​​of the first parameter and the second parameter are different.

[0615] In some embodiments, the first parameter and the second parameter each have the same value.

[0616] In some embodiments, the first parameter and the second parameter have different values.

[0617] In some embodiments, the first parameter is obtained in one of the following ways:

[0618] Receive signaling carrying the first parameter;

[0619] Determined based on high-level parameters;

[0620] Determined by the first node.

[0621] In some embodiments, the second parameter is obtained in one of the following ways:

[0622] Receive signaling carrying the second parameter;

[0623] Determined based on high-level parameters;

[0624] Determined by the first node.

[0625] In some embodiments, both the first parameter and the second parameter are carried on downlink control information, and the first parameter and the second parameter satisfy one of the following:

[0626] The first parameter is one field in the downlink control information, and the second parameter is another field in the downlink control information;

[0627] The first parameter is carried in the first downlink control information, and the second parameter is carried in the second downlink control information.

[0628] In some embodiments, the first parameter satisfies at least one of the following:

[0629] The first parameter is used to determine the length of the first bit sequence;

[0630] The first parameter is used to determine the parameters of the channel coding;

[0631] The first parameter is used to determine the parameters of the distribution matching code;

[0632] The first parameter is the index of the coding and modulation scheme corresponding to the first transmission of the transport block;

[0633] The first parameter is used to determine the base graph used for low-density parity check coding;

[0634] The first parameter is used to determine the boost value in low-density parity-check coding.

[0635] In some embodiments, the second parameter satisfies at least one of the following:

[0636] The second parameter is used to determine the length of the first bit sequence;

[0637] The second parameter is used to determine the size of the transport block;

[0638] The second parameter is used to determine the length of the target sequence;

[0639] The second parameter is used to determine the modulation order used for the target sequence;

[0640] The second parameter is used to determine the modulation order of the signal including the target sequence;

[0641] The second parameter is the index of the coding and modulation scheme corresponding to the current transmission of the transport block;

[0642] The second parameter is used to determine the size of the current transfer block;

[0643] The second parameter is used to determine the modulation order used in the current transmission.

[0644] In some embodiments, the target sequence is a modulation symbol sequence after modulation mapping, and the modulation order of modulation mapping is determined based on a first parameter or a second parameter.

[0645] In some embodiments, the target sequence is determined by at least one of the following parameters:

[0646] The parameters of the channel coding determined based on the first parameter;

[0647] The encoding parameters of the distribution matcher are determined based on the first parameter;

[0648] The length of the first bit sequence is determined based on the second parameter;

[0649] The length of the target sequence is determined based on the second parameter;

[0650] The modulation order is determined based on the second parameter, which is the modulation order used in the target sequence;

[0651] The modulation order is determined based on the second parameter, which is the modulation order used by the signal including the target sequence.

[0652] In some embodiments, the first bit sequence satisfies at least one of the following:

[0653] The first bit sequence is the transmission block sent from the first node to the second node;

[0654] The length of the first bit sequence is the size of the transport block.

[0655] In some embodiments, the target sequence satisfies one of the following:

[0656] The target sequence is a sequence encoded with a low-density parity-check code;

[0657] The target sequence is the bit-selected sequence;

[0658] The target sequence is a bit-interleaved sequence;

[0659] The target sequence is the sequence obtained by concatenating code blocks;

[0660] The target sequence is the channel-coded sequence after the probability amplitude shaping process;

[0661] The target sequence is the modulation symbol sequence after modulation mapping during the probability amplitude shaping process.

[0662] In some embodiments, the first node and the second node satisfy one of the following:

[0663] The first node is the base station, and the second node is the terminal;

[0664] The first node is the terminal, and the second node is the base station;

[0665] The first node is the terminal, and the second node is the terminal.

[0666] It should be noted that it is applied to Figure 1 The explanation of an embodiment of the communication method of the second node 102 in the communication system shown can be referred to the application... Figure 1 The explanation of an embodiment of the communication method of the first node 101 in the communication system shown will not be repeated here.

[0667] The disclosed embodiments can divide the communication device into functional modules according to the above method embodiments. For example, each function can be divided into a separate functional module, or two or more functions can be integrated into one functional module. The integrated module can be implemented in hardware or software. It should be noted that the module division in this disclosed embodiment is illustrative and only represents one logical functional division. In actual implementation, there may be other division methods. The following description uses the example of dividing each functional module according to each function.

[0668] Figure 10 This is a schematic diagram of another communication device provided in an embodiment of this disclosure. The communication device can execute the communication method provided in the above-described method embodiments. Figure 10 As shown, the communication device includes: an acquisition module 1001, a determination module 1002, and a transmission module 1003.

[0669] Module 1001 is used to obtain encoding-related parameters.

[0670] The determination module 1002 is used to determine the first bit sequence based on the encoding-related parameters.

[0671] The determination module 1002 is also used to determine the target sequence based on the encoding related parameters and the first bit sequence; the target sequence is obtained from the first bit sequence based on the probability amplitude shaping scheme.

[0672] The sending module 1003 is used to send a signal including the target sequence to the second node.

[0673] In some embodiments, the encoding-related parameters include a first parameter and a second parameter.

[0674] In some embodiments, the determining module 1002 is specifically used to determine a first bit sequence based on a first parameter and / or a second parameter.

[0675] In some embodiments, the determining module 1002 is further configured to determine the target sequence based on the first parameter, the second parameter, and the first bit sequence.

[0676] In some embodiments, the first parameter and the second parameter are used to implement processes other than modulation mapping in the probability amplitude shaping scheme, and one of the parameters is also used to implement the modulation mapping process.

[0677] In some embodiments, the first parameter includes at least one of the following: a coding modulation scheme index; a distribution matching parameter.

[0678] In some embodiments, the coding modulation scheme index is used to indicate at least one of the following coding modulation parameters: modulation order, channel coding rate, distribution-matched rate, integer rate, proportion of non-integer information bits, probability distribution of elements in the amplitude set, entropy of amplitude symbols, and spectral efficiency.

[0679] In some embodiments, the channel coding rate is used to indicate the code rate of channel coding, or to indicate the code rate of low-density parity-check coding.

[0680] In some embodiments, the first bit sequence includes a first portion and a second portion; the proportion of non-integer information bits is used to indicate one of the following:

[0681] The ratio between the size of the second part of the first bit sequence and the size of the bit sequence after amplitude shaping of the first part;

[0682] The ratio between the size of the second part of the first bit sequence and the size of the bit sequence after the distribution matching of the first part;

[0683] The ratio between the size of the second part of the first bit sequence and the size of the amplitude sign sequence after amplitude shaping of the first part;

[0684] The ratio between the size of the second part of the first bit sequence and the size of the amplitude symbol sequence after the distribution matching of the first part;

[0685] The ratio between the size of the second part of the first bit sequence and the size of the target sequence;

[0686] The ratio between the size of the second part of the first bit sequence and the size of the target sequence is half.

[0687] In some embodiments, the parameters for distribution matching include at least one of the following:

[0688] The bit rate of the distribution matching, the index of the bit rate of the distribution matching, the index of the distribution matching scheme, and the proportion of non-integer information bits.

[0689] In some embodiments, the second parameter includes at least one of the following: coding modulation scheme index; transport block size.

[0690] In some embodiments, the first parameter and the second parameter satisfy one of the following:

[0691] The first parameter and the second parameter are parameters of different types;

[0692] The first and second parameters are of the same type.

[0693] The first parameter and the second parameter are of the same type, but the values ​​of the first parameter and the second parameter are different.

[0694] In some embodiments, the first parameter and the second parameter each have the same value.

[0695] In some embodiments, the first parameter and the second parameter have different values.

[0696] In some embodiments, the first parameter is obtained in one of the following ways:

[0697] Receive signaling carrying the first parameter;

[0698] Determined based on high-level parameters;

[0699] Determined by the first node.

[0700] In some embodiments, the second parameter is obtained in one of the following ways:

[0701] Receive signaling carrying the second parameter;

[0702] Determined based on high-level parameters;

[0703] Determined by the first node.

[0704] In some embodiments, both the first parameter and the second parameter are carried on downlink control information, and the first parameter and the second parameter satisfy one of the following:

[0705] The first parameter is one field in the downlink control information, and the second parameter is another field in the downlink control information;

[0706] The first parameter is carried in the first downlink control information, and the second parameter is carried in the second downlink control information.

[0707] In some embodiments, the first parameter satisfies at least one of the following:

[0708] The first parameter is used to determine the length of the first bit sequence in conjunction with the number of resource elements in the downlink control information;

[0709] The first parameter is used to determine the parameters of the channel coding;

[0710] The first parameter is used to determine the parameters of the distribution matching code;

[0711] The first parameter is the index of the coding and modulation scheme corresponding to the first transmission of the transport block;

[0712] The first parameter is used to determine the base graph used for low-density parity check coding;

[0713] The first parameter is used to determine the boost value in low-density parity-check coding.

[0714] In some embodiments, the second parameter satisfies at least one of the following:

[0715] The second parameter is used to determine the length of the first bit sequence;

[0716] The second parameter is used to determine the size of the transport block;

[0717] The second parameter is used to determine the length of the target sequence;

[0718] The second parameter is used to determine the modulation order used for the target sequence;

[0719] The second parameter is used to determine the modulation order of the signal including the target sequence;

[0720] The second parameter is the index of the coding and modulation scheme corresponding to the current transmission of the transport block;

[0721] The second parameter is used to determine the size of the current transfer block;

[0722] The second parameter is used to determine the modulation order used in the current transmission.

[0723] In some embodiments, the target sequence is a modulation symbol sequence after modulation mapping, and the modulation order of modulation mapping is determined based on a first parameter or a second parameter.

[0724] In some embodiments, the target sequence is determined by at least one of the following parameters:

[0725] The parameters of the channel coding determined based on the first parameter;

[0726] The encoding parameters of the distribution matcher are determined based on the first parameter;

[0727] The length of the first bit sequence is determined based on the second parameter;

[0728] The length of the target sequence is determined based on the second parameter;

[0729] The modulation order is determined based on the second parameter, which is the modulation order used in the target sequence;

[0730] The modulation order is determined based on the second parameter, which is the modulation order used by the signal including the target sequence.

[0731] In some embodiments, the first bit sequence satisfies at least one of the following:

[0732] The first bit sequence is the transmission block sent from the first node to the second node;

[0733] The length of the first bit sequence is the size of the transport block.

[0734] In some embodiments, the target sequence satisfies one of the following:

[0735] The target sequence is a sequence encoded with a low-density parity-check code;

[0736] The target sequence is the bit-selected sequence;

[0737] The target sequence is a bit-interleaved sequence;

[0738] The target sequence is the sequence obtained by concatenating code blocks;

[0739] The target sequence is the channel-coded sequence after the probability amplitude shaping process;

[0740] The target sequence is the modulation symbol sequence after modulation mapping during the probability amplitude shaping process.

[0741] In some embodiments, the first node and the second node satisfy one of the following:

[0742] The first node is the base station, and the second node is the terminal;

[0743] The first node is the terminal, and the second node is the base station;

[0744] The first node is the terminal, and the second node is the terminal.

[0745] Figure 11 This is a schematic diagram of another communication device provided in an embodiment of this disclosure. The communication device can execute the communication method provided in the above-described method embodiments. Figure 11 As shown, the communication device includes: an acquisition module 1101, a receiving module 1102, and a determination module 1103.

[0746] The acquisition module 1101 is used to acquire encoding-related parameters.

[0747] The receiving module 1102 is used to receive signals including the target sequence from the first node.

[0748] The target sequence is obtained from the first bit sequence based on a probability amplitude shaping scheme.

[0749] The determining module 1103 is used to determine the first bit sequence based on the encoding related parameters and the signal including the target sequence.

[0750] In some embodiments, the encoding-related parameters include a first parameter and a second parameter.

[0751] In some embodiments, the first parameter and the second parameter are used to implement processes other than modulation mapping in the probability amplitude shaping scheme, and one of the parameters is also used to implement the modulation mapping process.

[0752] In some embodiments, the first parameter includes at least one of the following:

[0753] Index of coding and modulation schemes;

[0754] Parameters for distribution matching.

[0755] In some embodiments, the coding modulation scheme index is used to indicate at least one of the following coding modulation parameters:

[0756] Modulation order, channel coding rate, distribution matching rate, integer code rate, proportion of non-integer information bits, probability distribution of elements in the amplitude set, entropy of amplitude symbols, and spectral efficiency.

[0757] In some embodiments, the channel coding rate is used to indicate the code rate of channel coding, or to indicate the code rate of low-density parity-check coding.

[0758] In some embodiments, the first bit sequence includes a first portion and a second portion; the proportion of non-integer information bits is used to indicate one of the following:

[0759] The ratio between the size of the second part of the first bit sequence and the size of the bit sequence after amplitude shaping of the first part;

[0760] The ratio between the size of the second part of the first bit sequence and the size of the bit sequence after the distribution matching of the first part;

[0761] The ratio between the size of the second part of the first bit sequence and the size of the amplitude sign sequence after amplitude shaping of the first part;

[0762] The ratio between the size of the second part of the first bit sequence and the size of the amplitude symbol sequence after the distribution matching of the first part;

[0763] The ratio between the size of the second part of the first bit sequence and the size of the target sequence;

[0764] The ratio between the size of the second part of the first bit sequence and the size of the target sequence is half.

[0765] In some embodiments, the parameters for distribution matching include at least one of the following:

[0766] The bit rate of the distribution matching, the index of the bit rate of the distribution matching, the index of the distribution matching scheme, and the proportion of non-integer information bits.

[0767] In some embodiments, the second parameter includes at least one of the following:

[0768] Index of coding and modulation schemes;

[0769] Transport block size.

[0770] In some embodiments, the first parameter and the second parameter satisfy one of the following:

[0771] The first parameter and the second parameter are parameters of different types;

[0772] The first and second parameters are of the same type.

[0773] The first parameter and the second parameter are of the same type, but the values ​​of the first parameter and the second parameter are different.

[0774] In some embodiments, the first parameter is obtained in one of the following ways:

[0775] Receive signaling carrying the first parameter;

[0776] Determined based on high-level parameters;

[0777] Determined by the first node.

[0778] In some embodiments, the second parameter is obtained in one of the following ways:

[0779] Receive signaling carrying the second parameter;

[0780] Determined based on high-level parameters;

[0781] Determined by the first node.

[0782] In some embodiments, both the first parameter and the second parameter are carried on downlink control information, and the first parameter and the second parameter satisfy one of the following:

[0783] The first parameter is one field in the downlink control information, and the second parameter is another field in the downlink control information;

[0784] The first parameter is carried in the first downlink control information, and the second parameter is carried in the second downlink control information.

[0785] In some embodiments, the first parameter satisfies at least one of the following:

[0786] The first parameter is used to determine the length of the first bit sequence;

[0787] The first parameter is used to determine the parameters of the channel coding;

[0788] The first parameter is used to determine the parameters of the distribution matching code;

[0789] The first parameter is the index of the coding and modulation scheme corresponding to the first transmission of the transport block;

[0790] The first parameter is used to determine the base graph used for low-density parity check coding;

[0791] The first parameter is used to determine the boost value in low-density parity-check coding.

[0792] In some embodiments, the second parameter satisfies at least one of the following:

[0793] The second parameter is used to determine the length of the first bit sequence;

[0794] The second parameter is used to determine the size of the transport block;

[0795] The second parameter is used to determine the length of the target sequence;

[0796] The second parameter is used to determine the modulation order used for the target sequence;

[0797] The second parameter is used to determine the modulation order of the signal including the target sequence;

[0798] The second parameter is the index of the coding and modulation scheme corresponding to the current transmission of the transport block;

[0799] The second parameter is used to determine the size of the current transfer block;

[0800] The second parameter is used to determine the modulation order used in the current transmission.

[0801] In some embodiments, the target sequence is a modulation symbol sequence after modulation mapping, and the modulation order of modulation mapping is determined based on a first parameter or a second parameter.

[0802] In some embodiments, the target sequence is determined by at least one of the following parameters:

[0803] The parameters of the channel coding determined based on the first parameter;

[0804] The encoding parameters of the distribution matcher are determined based on the first parameter;

[0805] The length of the first bit sequence is determined based on the second parameter;

[0806] The length of the target sequence is determined based on the second parameter;

[0807] The modulation order is determined based on the second parameter, which is the modulation order used in the target sequence;

[0808] The modulation order is determined based on the second parameter, which is the modulation order used by the signal including the target sequence.

[0809] In some embodiments, the first bit sequence satisfies at least one of the following:

[0810] The first bit sequence is the transmission block sent from the first node to the second node;

[0811] The length of the first bit sequence is the size of the transport block.

[0812] In some embodiments, the target sequence satisfies one of the following:

[0813] The target sequence is a sequence encoded with a low-density parity-check code;

[0814] The target sequence is the bit-selected sequence;

[0815] The target sequence is a bit-interleaved sequence;

[0816] The target sequence is the sequence obtained by concatenating code blocks;

[0817] The target sequence is the channel-coded sequence after the probability amplitude shaping process;

[0818] The target sequence is the modulation symbol sequence after modulation mapping during the probability amplitude shaping process.

[0819] In some embodiments, the first node and the second node satisfy one of the following:

[0820] The first node is the base station, and the second node is the terminal;

[0821] The first node is the terminal, and the second node is the base station;

[0822] The first node is the terminal, and the second node is the terminal.

[0823] In implementing the functionality of the integrated modules described above using hardware, this disclosure provides another possible structure for the communication device involved in the above embodiments. For example... Figure 12 As shown, the communication device includes: a processor 1202 and a bus 1204. Optionally, the communication device may also include a memory 1201; alternatively, the communication device may also include a communication interface 1203.

[0824] Processor 1202 may implement or execute various exemplary logic blocks, modules, and circuits described in conjunction with embodiments of this disclosure. Processor 1202 may be a central processing unit, a general-purpose processor, a digital signal processor, an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. It may implement or execute various exemplary logic blocks, modules, and circuits described in conjunction with embodiments of this disclosure. Processor 1202 may also be a combination of functions implementing computational capabilities, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, etc.

[0825] The communication interface 1203 is used to connect with other devices via a communication network. This communication network can be Ethernet, wireless access network, wireless local area network (WLAN), etc.

[0826] The memory 1201 may be a read-only memory (ROM) or other type of static storage device capable of storing static information and instructions, random access memory (RAM) or other type of dynamic storage device capable of storing information and instructions, or electrically erasable programmable read-only memory (EEPROM), disk storage medium or other magnetic storage device, or any other medium capable of carrying or storing desired program code in the form of instructions or data structures and accessible by a computer, but is not limited thereto.

[0827] As one possible implementation, the memory 1201 can exist independently of the processor 1202. The memory 1201 can be connected to the processor 1202 via a bus 1204 and is used to store instructions or program code. When the processor 1202 calls and executes the instructions or program code stored in the memory 1201, it can implement the method provided in the embodiments of this disclosure.

[0828] In another possible implementation, the memory 1201 can also be integrated with the processor 1202.

[0829] Bus 1204 can be an extended industry standard architecture (EISA) bus, etc. Bus 1204 can be divided into address bus, data bus, control bus, etc. For ease of representation, Figure 12 The bus is represented by a single thick line, but this does not mean that there is only one bus or one type of bus.

[0830] Some embodiments of this disclosure provide a computer-readable storage medium (e.g., a non-transitory computer-readable storage medium) storing computer program instructions that, when executed on a computer, cause the computer to perform the methods described in any of the above embodiments.

[0831] For example, the aforementioned computer-readable storage media may include, but are not limited to: magnetic storage devices (e.g., hard disks, floppy disks, or magnetic tapes), optical disks (e.g., compact disks (CDs), digital versatile disks (DVDs), etc.), smart cards, and flash memory devices (e.g., erasable programmable read-only memory (EPROMs), cards, sticks, or key drives, etc.). The various computer-readable storage media described in this disclosure may represent one or more devices for storing information and / or other machine-readable storage media. The term "machine-readable storage media" may include, but is not limited to, wireless channels and various other media capable of storing, containing, and / or carrying instructions and / or data.

[0832] This disclosure provides a computer program product containing instructions that, when run on a computer, cause the computer to perform the methods described in any of the above embodiments.

[0833] The above description is merely a specific embodiment of this disclosure, but the scope of protection of this disclosure is not limited thereto. Any changes or substitutions within the technical scope disclosed in this disclosure should be included within the scope of protection of this disclosure. Therefore, the scope of protection of this disclosure should be determined by the scope of the claims.< / null> < / null> < / null> < / null> < / null> < / null> < / null> < / null> < / null> < / null> < / null> < / null> < / null> < / null> < / null>

Claims

1. A communication method, characterized in that, Applied to the first node, the method includes: Obtain encoding-related parameters; Based on the encoding-related parameters, the first bit sequence is determined; Based on the encoding-related parameters and the first bit sequence, a target sequence is determined; the target sequence is obtained from the first bit sequence based on a probability amplitude shaping scheme. Send a signal including the target sequence to the second node.

2. The method according to claim 1, characterized in that, The encoding-related parameters include a first parameter and a second parameter.

3. The method according to claim 2, characterized in that, Determining the first bit sequence based on the encoding-related parameters includes: The first bit sequence is determined based on the first parameter and / or the second parameter.

4. The method according to claim 2, characterized in that, Determining the target sequence based on the encoding-related parameters and the first bit sequence includes: The target sequence is determined based on the first parameter, the second parameter, and the first bit sequence.

5. The method according to claim 2, characterized in that, The first parameter and the second parameter are used to implement the process in the probability amplitude shaping scheme other than modulation mapping, and one of the parameters is also used to implement the modulation mapping process.

6. The method according to claim 2, characterized in that, The first parameter includes at least one of the following: Index of coding and modulation schemes; Parameters for distribution matching.

7. The method according to claim 6, characterized in that, The coding and modulation scheme index is used to indicate at least one of the following coding and modulation parameters: Modulation order, channel coding rate, distribution matching rate, integer code rate, proportion of non-integer information bits, probability distribution of elements in the amplitude set, entropy of amplitude symbols, and spectral efficiency.

8. The method according to claim 7, characterized in that, The channel coding rate is used to indicate the code rate of channel coding, or to indicate the code rate of low-density parity-check code coding.

9. The method according to claim 7, characterized in that, The first bit sequence comprises a first part and a second part; the proportion of non-integer information bits is used to indicate one of the following: The ratio between the size of the second part of the first bit sequence and the size of the bit sequence after amplitude shaping of the first part; The ratio between the size of the second part of the first bit sequence and the size of the bit sequence after the distribution matching of the first part; The ratio between the size of the second part of the first bit sequence and the size of the amplitude sign sequence after amplitude shaping of the first part; The ratio between the size of the second part of the first bit sequence and the size of the amplitude symbol sequence after the distribution matching of the first part; The ratio between the size of the second part of the first bit sequence and the size of the target sequence; The ratio between the size of the second part of the first bit sequence and the size of the target sequence is half.

10. The method according to claim 6, characterized in that, The parameters for distribution matching include at least one of the following: The bit rate of the distribution matching, the index of the bit rate of the distribution matching, the index of the distribution matching scheme, and the proportion of non-integer information bits.

11. The method according to claim 2, characterized in that, The second parameter includes at least one of the following: Index of coding and modulation schemes; Transport block size.

12. The method according to claim 2, characterized in that, The first parameter and the second parameter satisfy one of the following: The first parameter and the second parameter are parameters of different types; The first parameter and the second parameter are of the same type; The first parameter and the second parameter are of the same type, and the values ​​of the first parameter and the second parameter are different.

13. The method according to claim 2, characterized in that, The first parameter is obtained in one of the following ways: Receive signaling carrying the first parameter; Determined based on high-level parameters; Determined by the first node.

14. The method according to claim 2, characterized in that, The second parameter is obtained in one of the following ways: Receive signaling carrying the second parameter; Determined based on high-level parameters; Determined by the first node.

15. The method according to claim 2, characterized in that, Both the first parameter and the second parameter are carried on downlink control information, and the first parameter and the second parameter satisfy one of the following: The first parameter is a field in the downlink control information, and the second parameter is another field in the downlink control information; The first parameter is carried in the first downlink control information, and the second parameter is carried in the second downlink control information.

16. The method according to claim 2, characterized in that, The first parameter satisfies at least one of the following: The first parameter is used to determine the length of the first bit sequence; The first parameter is used to determine the parameters of the channel coding; The first parameter is used to determine the parameters of the distribution matching code; The first parameter is the coding and modulation scheme index corresponding to the first transmission of the transport block; The first parameter is used to determine the base graph used by the low-density parity check coding; The first parameter is used to determine the boost value in low-density parity-check coding.

17. The method according to claim 2, characterized in that, The second parameter satisfies at least one of the following: The second parameter is used to determine the length of the first bit sequence; The second parameter is used to determine the size of the transport block; The second parameter is used to determine the length of the target sequence; The second parameter is used to determine the modulation order used in the target sequence; The second parameter is used to determine the modulation order of the signal including the target sequence; The second parameter is the index of the coding and modulation scheme corresponding to the current transmission of the transport block; The second parameter is used to determine the size of the currently transmitted transport block; The second parameter is used to determine the modulation order used in the current transmission.

18. The method according to claim 2, characterized in that, The target sequence is a modulation symbol sequence after modulation mapping, and the modulation order of modulation mapping is determined based on the first parameter or the second parameter.

19. The method according to claim 2, characterized in that, The target sequence is determined by at least one of the following parameters: The parameters of the channel coding determined based on the first parameter; The encoding parameters of the distribution matcher are determined based on the first parameter; The length of the first bit sequence determined based on the second parameter; The size of the target sequence determined based on the second parameter; The modulation order is determined based on the second parameter, where the modulation order is the modulation order used by the target sequence; The modulation order is determined based on the second parameter, which is the modulation order used by the signal including the target sequence.

20. The method according to claim 1, characterized in that, The first bit sequence satisfies at least one of the following: The first bit sequence is a transport block sent from the first node to the second node; The length of the first bit sequence is the size of the transport block.

21. The method according to claim 1, characterized in that, The target sequence satisfies one of the following: The target sequence is a sequence encoded with a low-density parity-check code. The target sequence is a bit-selected sequence; The target sequence is a bit-interleaved sequence; The target sequence is a sequence obtained by concatenating code blocks; The target sequence is the channel-coded sequence after the probability amplitude shaping process; The target sequence is the modulation symbol sequence after modulation mapping during the probability amplitude shaping process.

22. The method according to claim 1, characterized in that, The first node and the second node satisfy one of the following: The first node is a base station, and the second node is a terminal; The first node is a terminal, and the second node is a base station; The first node is a terminal, and the second node is a terminal.

23. A communication method, characterized in that, Applied to the second node, the method includes: Obtain encoding-related parameters; Receive a signal from the first node including a target sequence; the target sequence is obtained from the first bit sequence based on a probability amplitude shaping scheme; Based on the encoding-related parameters and the signal including the target sequence, a first bit sequence is determined.

24. A communication device, characterized in that, include: Memory and processor; Memory and processor are coupled; The memory is used to store instructions that can be executed by the processor; When the processor executes the instructions, it performs the method as described in any one of claims 1-22, or performs the method as described in claim 23.

25. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions that, when executed on a computer, cause the computer to perform the method as described in any one of claims 1-22, or to perform the method as described in claim 23.

26. A computer program product, characterized in that, The computer program product includes computing technology program instructions, which, when executed by a processor, implement the method as described in any one of claims 1-22, or implement the method as described in claim 23.

Images