Information transmission method and system, electronic device and readable storage medium

Abstract

The application provides an information transmission method, system, electronic equipment and readable storage medium. The information transmission method comprises the following steps: acquiring an information block to be transmitted, acquiring a bit position reliability sorting table and a conditional entropy sorting table corresponding to a first component code, wherein the conditional entropy sorting table is used to determine a shaping bit in the bit position, and the number of shaping bits of the first component code is greater than or equal to 1; determining the bit position of each component code according to the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code, wherein the bit position comprises an information bit, a frozen bit and / or a shaping bit; and generating a modulation symbol sequence according to the information block to be transmitted and the bit position of each component code. In the application, the probability shaping construction process in the information transmission process determines the bit position by constructing a table, and has low execution difficulty, low complexity, high flexibility and practicability.

Description

Technical Field

[0001] The present invention relates to the field of wireless communication technology, and in particular to an information transmission method, system, electronic device and readable storage medium. Background Technology

[0002] Polar codes are the first coding scheme that can be theoretically proven to reach the Shannon capacity limit. They have advantages such as low-complexity encoding and decoding capabilities and excellent error correction performance. Therefore, polar codes have become the control channel coding scheme in the enhanced mobile broadband (eMBB) scenario of the fifth generation mobile communication system (5G).

[0003] In practical communication systems, joint modulation of channel coding and constellation modulation is an effective way to achieve high spectral efficiency and reliable transmission. However, the "uniform and equiprobable distribution" constellation modulation method used in existing 5G systems has a significant gap with the channel capacity limit. To overcome this problem and improve system performance, channel coding can be combined with constellation shaping technology. Based on the method of obtaining performance gains, constellation shaping technology can be divided into probabilistic shaping and geometric shaping. Because probabilistic shaping schemes require less modification to the coding and modulation system, they are easier to implement and promote.

[0004] For Polar-Coded Modulation (PCM) systems, Multilevel Polar-Coded Modulation (MLC-PCM) is one of the mainstream schemes for the joint design of polar coding and constellation modulation. The performance of MLC-PCM probabilistic shaping systems is highly dependent on the selection of information bits and shaping bits; therefore, the method of constructing the system is key to information transmission.

[0005] Existing construction methods include numerical search to construct MLC-PCM probabilistic shaping systems, but this method is highly complex and lacks flexibility. When shaping bits need to be added to other polarization component codes, the complexity increases exponentially. Another method uses a simplified density evolution approach, but this requires a large amount of storage space to ensure computational accuracy, thus limiting its practicality. Summary of the Invention

[0006] The present invention provides an information transmission method, system, electronic device, and readable storage medium to solve the problems of high complexity, low flexibility, and lack of practicality in the probabilistic shaping construction process in existing information transmission methods.

[0007] To solve the above-mentioned technical problems, the present invention is implemented as follows:

[0008] In a first aspect, embodiments of the present invention provide an information transmission method, applied at a sending end, comprising:

[0009] Obtain the information block to be transmitted, obtain the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code, wherein the conditional entropy sorting table is used to determine the forming bits in the bit position, and the number of forming bits of the first component code is greater than or equal to 1.

[0010] The bit position of each component code is determined according to the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code. The bit position includes information bits, frozen bits and / or shaped bits.

[0011] A modulation symbol sequence is generated based on the information block to be transmitted and the bit position of each component code.

[0012] Optionally, the step of obtaining the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code includes:

[0013] Acquire channel state information and downlink control information;

[0014] Based on the channel state information and the downlink control information, determine the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code.

[0015] Optionally, the reception of channel state information and downlink control information includes, before:

[0016] Receive configuration information;

[0017] Based on the configuration information, a preprocessing operation is performed on the information block to be transmitted to obtain the preprocessed information block to be transmitted.

[0018] Optionally, the preprocessing operation includes at least one of the following:

[0019] The information block to be transmitted is segmented, auxiliary bits are added to the information block to be transmitted, the positions of the bits in the information block to be transmitted are swapped, and the information block to be transmitted is interleaved.

[0020] Optionally, determining the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code based on the channel state information and the downlink control information includes:

[0021] Based on the channel state information, determine the signal-to-noise ratio of the current channel;

[0022] Based on the downlink control information, obtain the modulation and coding scheme information used for transmitting data, wherein the modulation and coding scheme information includes at least the modulation order and coding rate;

[0023] The encoding length of the component encoder is determined based on the length of the information block to be transmitted and the encoding rate.

[0024] The Maxwell-Boltzmann distribution parameters are determined based on the signal-to-noise ratio and the modulation order.

[0025] The number of shaping bits required for each component code is determined based on the Maxwell-Boltzmann distribution parameters and the modulation order.

[0026] Based on the signal-to-noise ratio, modulation order, Maxwell-Boltzmann distribution parameters, and component encoder encoding length, a bit position reliability sorting table is obtained.

[0027] Based on the number of shaped bits required for each component code, obtain the conditional entropy sorting table for the first component code.

[0028] Optionally, determining the bit position of each component code based on the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code includes:

[0029] According to the bit position reliability table, the first number of bit positions with reliability from low to high in the bit position reliability table are selected as the frozen bits of all component codes, and the frozen bits are used to carry frozen bits;

[0030] The freeze bit of each component code is determined based on the freeze bits of all the component codes;

[0031] Based on the number of formed bits, determine the first component code with a formed bit number greater than or equal to 1 and the second component code with a formed bit number of 0;

[0032] For the first component code, the second number of bit positions in the conditional entropy sorting table corresponding to the first component code, from low to high, are selected as shaping bits, and the shaping bits are located in the bit positions of the first component code excluding the frozen bits. The shaping bits are used to carry the shaping bits.

[0033] The bit positions in the first component code, excluding the freeze bit and the forming bit, are used as the information bits of the first component code, and the information bits are used to carry information bits.

[0034] The bit positions of the first component code are determined based on the information bits, freeze bits, and forming bits of the first component code.

[0035] For the second component code, the bit positions in the second component code, excluding the freeze bit, are used as the information bits of the second component code;

[0036] The bit positions of the second component code are determined based on the information bits and freeze bits of the second component code.

[0037] Optionally, generating the modulation symbol sequence based on the information block to be transmitted and the bit position of each component code includes:

[0038] Based on the information block to be transmitted and the bit position of each component code, obtain the input bit sequence corresponding to each component encoder;

[0039] Based on the input bit sequence corresponding to each component encoder, obtain the codeword sequence corresponding to each component code;

[0040] Based on the codeword sequence corresponding to each component code, a modulation symbol sequence to be transmitted is generated.

[0041] Optionally, obtaining the input bit sequence corresponding to each component encoder based on the information block to be transmitted and the bit position of each component code includes:

[0042] The information block to be transmitted is sequentially mapped to the information bits of each component code to obtain the information bits of each component code;

[0043] Set the bit corresponding to the frozen bit of each component code to a specified value to obtain the frozen bit of each component code;

[0044] Based on the likelihood ratio of the codeword bits, information bits, and frozen bits of the first component code, determine the value of the bit corresponding to the forming bit of the first component code, and obtain the forming bit of the first component code.

[0045] Based on the information bits, frozen bits, and the shaped bits of the first component code, the input bit sequence corresponding to each component encoder is obtained.

[0046] Optionally, generating the modulation symbol sequence to be transmitted based on the codeword sequence corresponding to each component code includes:

[0047] One bit is taken from the same position in the codeword sequence corresponding to each component code to form a fourth number of bit vectors, where the fourth number is consistent with the encoding length of the component encoder.

[0048] According to the modulation mapping rule, the fourth number of bit vectors are mapped to the fourth number of modulation symbols, and the fourth number of modulation symbols form a modulation symbol sequence.

[0049] Secondly, embodiments of the present invention provide an information transmission method applied at a receiving end, comprising:

[0050] The received channel transmits a sequence of modulated symbols;

[0051] Obtain a bit position reliability sorting table and a conditional entropy sorting table corresponding to the first component code, wherein the conditional entropy sorting table is used to determine the shaped bits in the bit position, and the number of shaped bits in the first component code is greater than or equal to 1.

[0052] The bit position of each component code is determined according to the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code. The bit position includes information bits, frozen bits and / or shaped bits.

[0053] Based on the modulation symbol sequence and the bit position of each component code, the decoded information bits are obtained.

[0054] Optionally, before obtaining the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code, the method further includes:

[0055] Acquire channel state information and downlink control information;

[0056] Based on the channel state information and the downlink control information, determine the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code.

[0057] Thirdly, embodiments of the present invention provide an information transmission system applied at a sending end, comprising:

[0058] The acquisition module is used to acquire the information block to be transmitted, acquire the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code, wherein the conditional entropy sorting table is used to determine the forming bits in the bit position, and the number of forming bits of the first component code is greater than or equal to 1.

[0059] The first bit position module is used to determine the bit position of each component code according to the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code. The bit position includes information bits, frozen bits and / or shaped bits.

[0060] The sequence module is used to generate a modulation symbol sequence based on the information block to be transmitted and the bit position of each component code.

[0061] Fourthly, embodiments of the present invention provide an information transmission system applied at a receiving end, comprising:

[0062] The third receiving module is used to receive the modulation symbol sequence transmitted through the channel;

[0063] The fourth receiving module is used to obtain a bit position reliability sorting table and a conditional entropy sorting table corresponding to the first component code, wherein the conditional entropy sorting table is used to determine the shaped bits in the bit position, and the number of shaped bits of the first component code is greater than or equal to 1.

[0064] The second bit position module is used to determine the bit position of each component code according to the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code. The bit position includes information bits, frozen bits and / or forming bits.

[0065] The decoding module is used to obtain the decoded information bits based on the modulation symbol sequence and the bit position of each component code.

[0066] Fifthly, embodiments of the present invention provide an electronic device, including: a processor, a memory, and a program stored in the memory and executable on the processor, wherein when the program is executed by the processor, it implements the steps of the information transmission method as described in the first aspect above; or, when the program is executed by the processor, it implements the steps of the information transmission method as described in the second aspect above.

[0067] In a sixth aspect, embodiments of the present invention provide a computer-readable storage medium storing a computer program, wherein when the computer program is executed by a processor, it implements the steps of the information transmission method as described in the first aspect above; or when the computer program is executed by a processor, it implements the steps of the information transmission method as described in the second aspect above.

[0068] In this invention, the information block to be transmitted, the bit position reliability sorting table, and the conditional entropy sorting table corresponding to the first component code are first obtained. Based on the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code, the bit position of each component code is determined, making the process more concise. Finally, based on the information block to be transmitted and the bit position of each component code, a modulation symbol sequence is generated, resulting in lower complexity and higher flexibility. The information transmission method implemented through this invention has a lower block error rate. At the same block error rate, a lower minimum signal-to-noise ratio is required. While improving signal transmission accuracy, it is also easy to implement, has high processing efficiency, and is more practical. Attached Figure Description

[0069] Various other advantages and benefits will become apparent to those skilled in the art upon reading the following detailed description of preferred embodiments. The accompanying drawings are for illustrative purposes only and are not intended to limit the invention. Furthermore, the same reference numerals denote the same parts throughout the drawings. In the drawings:

[0070] Figure 1This is a schematic diagram of a polar code channel transformation and construction provided by an embodiment of the present invention;

[0071] Figure 2 This is an architecture of an MLC-PCM probabilistic shaping system provided in an embodiment of the present invention;

[0072] Figure 3 This is an example diagram of a constellation point probability distribution provided in an embodiment of the present invention;

[0073] Figure 4 This is a flowchart of the forming bit calculation process in an MLC-PCM probabilistic forming system provided by an embodiment of the present invention;

[0074] Figure 5 This is a flowchart of an information transmission method provided in an embodiment of the present invention;

[0075] Figure 6 This is a flowchart illustrating the operation steps of an embodiment of an information transmission method provided by the present invention.

[0076] Figure 7 This is a flowchart of an information block preprocessing method provided in an embodiment of the present invention;

[0077] Figure 8 This is a flowchart illustrating the determination of transmission parameters and a construction table provided in an embodiment of the present invention;

[0078] Figure 9A This is a schematic diagram of the bit position of the first polarization component code in one embodiment of the present invention;

[0079] Figure 9B This is a schematic diagram of the bit position of the second polarization component code in one embodiment of the present invention;

[0080] Figure 9C This is a schematic diagram of the bit position of the third polarization component code in one embodiment of the present invention;

[0081] Figure 10 This is a simulation performance curve of an MLC-PCM probabilistic shaping system implemented based on an embodiment of the present invention under 8ASK modulation, provided by an embodiment of the present invention.

[0082] Figure 11 This is a simulation performance curve of an MLC-PCM probabilistic shaping system implemented according to an embodiment of the present invention under 16ASK modulation.

[0083] Figure 12 This is a flowchart of another information transmission method provided in an embodiment of the present invention;

[0084] Figure 13This is a schematic diagram of the structure of an information transmission system provided in an embodiment of the present invention;

[0085] Figure 14 This is a schematic diagram of another information transmission system provided in an embodiment of the present invention;

[0086] Figure 15 This is a schematic diagram of the structure of an electronic device provided in an embodiment of the present invention. Detailed Implementation

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

[0088] Joint modulation of channel coding and constellation modulation is an effective way to achieve high spectral efficiency and reliable transmission. Polar coding and constellation modulation are among the mainstream design schemes. Channel polarization is the core idea of ​​polar codes, referring to the modulation of N=2... n An independent binary input discrete memoryless channel (B-DMC) W with identical channel characteristics is transformed into another set of polarization sub-channels with correlation and different reliability through recursive coding. Given an information sequence of length K, the reliability of the above N polarization sub-channels needs to be evaluated and ranked. The K sub-channels with the highest reliability are selected for transmitting information bits, while the remaining (NK) sub-channels transmit frozen bits known to both the sender and receiver. This process is called the construction of polar codes. Let... and These represent the sets of polarization subchannel indices that carry information bits and frozen bits, respectively.

[0089] Please refer to Figure 1 Given a source sequence The encoding process of polar codes is represented as follows:

[0090] c = uG N (1)

[0091] Where c represents the encoded codeword sequence, This is the generator matrix introduced during the channel polarization transformation process. Represents a matrix Perform n Kronecker products operate.

[0092] Furthermore, as one of the mainstream schemes for the joint design of polar coding and constellation modulation, the key to the design of the MLC-PCM system is how to construct the system.

[0093] For a given M=2 m In an MLC-PCM system with N-dimensional modulation and N symbols, the total code length is equal to mN, corresponding to mN polarization sub-channels. Under the probabilistic shaping scheme, in order to make the input symbols of the channel approximate a Gaussian distribution as closely as possible, thus approaching the capacity limit of the Additive White Gaussian Noise (AWGN) channel, the probability of the values ​​of the constellation points corresponding to the modulation symbols should follow a Maxwell-Boltzmann distribution, that is:

[0094]

[0095] in, This means M = 2 m The set of constellation points for dimensional modulation, with Maxwell-Boltzmann parameters v used to balance the average power and probability distribution of the input symbols.

[0096] Therefore, in order to make the modulation symbols output by the MLC-PCM system conform to the target Maxwell-Boltzmann distribution, some shaping bits need to be added at the input of the encoder in addition to the information bits and freeze bits. Let This represents the set of polarization subchannel indices carrying shaped bits, where...

[0097] Please refer to Figure 2 The transmitter of the probabilistic shaping MLC-PCM system employs m polar component encoders, each corresponding to a polar code of length N. The input source sequence u for each component encoder is... k =(u k，1 u k，2 , ..., u k，N According to the set and Each bit carries a corresponding information bit, a frozen bit, and a formed bit, and outputs an N-bit codeword sequence c. k =(c k，1 c k，2 c k，NTake one bit from the same position in each of the m sequences to form N m-dimensional bit vectors. Then, map them into N modulation symbols according to the set partitioning (SP) mapping rule to form the transmission sequence x and send it into the channel for transmission.

[0098] The receiver employs multi-stage decoding (MSD). First, based on the received N symbols, the soft bit information of the first polar component decoder is calculated and sent to the decoder for decoding. The decoded result is then encoded and sent back to the demodulator to assist in calculating the soft bit information of the second polar component decoder. This process continues sequentially until the m-th polar component decoder is decoded. Finally, information bits are extracted from the mN decoded bits as the final output.

[0099] Because MLC-PCM uses SP mapping, under the Maxwell-Boltzmann distribution, the probability of a modulation symbol's value is primarily determined by the first bit of the m-dimensional bit vector before mapping (corresponding to the last polarization component code). For example, please refer to... Figure 3 When parameter v = 0.01, the probability distribution of constellation points in 16ASK modulation is as follows: Figure 3 As shown. At this point, according to the method for calculating the conditional entropy of the codeword bits corresponding to the polar component codes, the conditional entropies of the codeword bits corresponding to the four polar component codes are respectively: H(B1) = 1, H(B2|B1) = 1, and This indicates that the codeword bits of the first polar component code are all equally distributed between 0 and 1, the codeword bits of the third polar component code are approximately equally distributed between 0 and 1, and only the codeword bits of the fourth polar component code have a significantly different probability of being 0 and 1. Based on this phenomenon, there exists an MLC-PCM first-bit probability shaping scheme, which adjusts the bit probabilities of the codeword by adding shaping bits to the last polar component encoder, thereby making the mapped modulation symbols match the target Maxwell-Boltzmann distribution.

[0100] Of course, this first-bit probabilistic shaping scheme can be extended to a more general form: in addition to the last polarization component code, shaping bits can also be added to other polarization component codes to make the probability distribution of the modulation symbol better match the target Maxwell-Boltzmann distribution.

[0101] The shaped bits can be determined using the following method:

[0102] Given the information bits of an MLC-PCM probabilistic shaping system Freeze position and forming position The corresponding position sets of the k-th polarization component code are as follows:

[0103]

[0104] The k-th polarization component encoder calculates its codeword bits c based on the codeword sequence output by the previous (k-1) encoders and the target Maxwell-Boltzmann distribution. k，i Likelihood Ratio (LR)Λ(c k，i The specific calculation formula is as follows:

[0105]

[0106] Among them, c k，i Represents the codeword sequence c k The i-th bit, c 1，i c k-1，i Similarly; Indicates SP mapping; Represents an m-dimensional bit vector exist The constellation points below are calculated as shown in equation (2) above. Similarly, for the k-th polarization component code, since the information bits and frozen bits are known bits, only the shaped bits need to be calculated. Therefore, the likelihood ratio {Λ(c)} of the channel-side codeword bits can be used. k，i By decoding the polar code, the values ​​of the shaped bits and the encoded codeword c can be obtained. k Finally, by mapping the codeword bits of the m polarization component encoders sequentially to the modulation symbol sequence, the target Maxwell-Boltzmann distribution can be matched well.

[0107] Clearly, the performance of the MLC-PCM probabilistic forming system is highly dependent on the selection of information bits and forming bits. Regarding the shortcomings of current methods for selecting information bits and forming bits, please refer to... Figure 5 and Figure 6 This invention provides an information transmission method applied at a sending end, comprising:

[0108] Step 11: Obtain the information block to be transmitted, obtain the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code, wherein the conditional entropy sorting table is used to determine the shaped bits in the bit position, and the number of shaped bits of the first component code is greater than or equal to 1.

[0109] Step 12: Determine the bit position of each component code according to the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code. The bit position includes information bits, frozen bits and / or forming bits.

[0110] Step 13: Generate a modulation symbol sequence based on the information block to be transmitted and the bit position of each component code.

[0111] In this invention, the information block to be transmitted, the bit position reliability sorting table, and the conditional entropy sorting table corresponding to the first component code are first obtained. Based on the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code, the bit position of each component code is determined, making the process more concise. Finally, based on the information block to be transmitted and the bit position of each component code, a modulation symbol sequence is generated, resulting in lower complexity and higher flexibility. The information transmission method implemented through this invention has a lower block error rate. At the same block error rate, a lower minimum signal-to-noise ratio is required. While improving signal transmission accuracy, it is also easy to implement, has high processing efficiency, and is more practical.

[0112] In this embodiment of the invention, the method for constructing probabilistic shaping in information transmission can be executed by a terminal, which indicates the sending end and receiving end in the channel transmission process.

[0113] In an embodiment of the present invention, optionally, the acquisition of the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code includes:

[0114] Acquire channel state information and downlink control information;

[0115] Based on the channel state information and the downlink control information, determine the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code.

[0116] In this embodiment of the invention, the implementation of the conditional entropy sorting table is relatively simple and the processing is faster. The bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code can be calculated during each transmission or calculated in advance before transmission. This invention does not impose any restrictions.

[0117] In this embodiment of the invention, optionally, the following is included before receiving the channel state information and downlink control information:

[0118] Receive configuration information;

[0119] Based on the configuration information, a preprocessing operation is performed on the information block to be transmitted to obtain the preprocessed information block to be transmitted.

[0120] In this embodiment of the invention, before transmission, the terminal physical layer determines what preprocessing operation to apply to the information block to be transmitted based on the configuration information passed from the upper layer. Specifically...

[0121] In this embodiment of the invention, optionally, the preprocessing operation includes at least one of the following:

[0122] The information block to be transmitted is segmented, auxiliary bits are added to the information block to be transmitted, the positions of the bits in the information block to be transmitted are swapped, and the information block to be transmitted is interleaved.

[0123] Of course, in this embodiment of the invention, the preprocessing operation includes, but is not limited to, segmentation, adding additional auxiliary bits, and swapping the positions of bits.

[0124] Please refer to Figure 7 , where I seg I crc I int The parameters correspond to segmentation, CRC, and interleaving operations, respectively. When they are 1, it means that the relevant operation is performed, and when they are 0, it means that the relevant operation is not performed.

[0125] Optionally, when the length of the information block to be transmitted exceeds a set threshold, the information block to be transmitted can be divided into multiple smaller sub-information blocks, which are then encoded and modulated separately.

[0126] For example, let a = (a1, a2, ..., a... A () represents the information sequence of the information block to be transmitted, where A is the length of the information block. When performing equal-length segmentation, and the number of sub-blocks after segmentation is 2, the length of each sub-block is... When A is odd, the first sub-block consists of the first part of the original sequence a. The second sub-block consists of one bit and one placeholder bit, and the second sub-block is composed of the last bit of the original sequence a. It consists of 10 bits; when no segmentation operation is performed, A′ = A.

[0127] Optionally, the information block can also be CRC encoded, and CRC check bits can be added to assist the receiver in decoding, thereby improving the accuracy of decoding.

[0128] For example, when using Cyclic Redundancy Check (CRC) encoding, let a′ = (a′1, a′2, ..., a′...). A Let p = (p1, p2, ..., p...) represent the sub-blocks of information obtained after the segmentation operation. L ) represents the CRC checksum bit sequence, where L is the number of CRC checksum bits. The checksum bits are generated by the cyclic generator polynomial g. CRCL (D) is generated, where g CRCL (D)=[D L +g L-1 D L-1 +g L-2 D L-2 +…+g1D 1+1], and the coefficients of the polynomial satisfy g L-1 g L-2 ..., g1∈{0,1}. CRC encoding is implemented in the form of systematic code, that is, in the binary finite field (Galois Field of 2, GF(2)), the polynomial a1D... A′+L-1 +a2D A′+L-2 +…+a A′ D L +p1D L-1 +p2D L-2 +…+p L-1 D 1 +p L Divided by the CRC generator polynomial g CRCL The remainder of (D) is 0. The bit sequence obtained after CRC encoding is represented as v = (v1, v2, ..., v...). K ), where K=A′+L, and:

[0129]

[0130] Alternatively, information blocks can be interleaved to reduce or eliminate the correlation between bits.

[0131] For example, when v = (v1, v2, ..., v... K When interleaving is used, the output bit sequence is v′=(v′1,v′2,...,v′) K ), where v′ j =v Π(j) Let j = 1, 2, ..., K, and the interleaving pattern Π be a one-to-one mapping from the set {1, 2, ..., K} to {1, 2, ..., K}. In particular, when Π(k) = k, it is equivalent to not using interleaving of the input sequences.

[0132] In this embodiment of the invention, by preprocessing the information block to be processed, the transmission efficiency of the signal can be effectively improved, the bit error rate in the signal transmission can be reduced, the correctness of the decoding can be improved, the reliability of the signal can be improved, and the correlation between bits can be reduced or eliminated.

[0133] Furthermore, based on the channel state information and downlink control information, the parameters are determined, and then the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code are determined. Specifically...

[0134] In this embodiment of the invention, optionally, determining the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code based on the channel state information and the downlink control information includes:

[0135] Based on the channel state information, determine the signal-to-noise ratio of the current channel;

[0136] Based on the downlink control information, obtain the modulation and coding scheme information used for transmitting data, wherein the modulation and coding scheme information includes at least the modulation order and coding rate;

[0137] The encoding length of the component encoder is determined based on the length of the information block to be transmitted and the encoding rate.

[0138] The Maxwell-Boltzmann distribution parameters are determined based on the signal-to-noise ratio and the modulation order.

[0139] The number of shaping bits required for each component code is determined based on the Maxwell-Boltzmann distribution parameters and the modulation order.

[0140] Based on the signal-to-noise ratio, modulation order, Maxwell-Boltzmann distribution parameters, and component encoder encoding length, a bit position reliability sorting table is obtained.

[0141] Based on the number of shaped bits required for each component code, obtain the conditional entropy sorting table for the first component code.

[0142] In this embodiment of the invention, the parameters of the probabilistic shaping system are determined using Channel State Information (CSI) and Downlink Control Information (DCI). Furthermore, the system parameters are used to determine the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code. Please refer to [reference needed]. Figure 8 Specifically, it consists of the following steps.

[0143] Step A: The terminal uses the received CSI and DCI to determine the parameters of the probabilistic shaping system.

[0144] First, the current channel quality is estimated by detecting the Channel Signal-to-Noise Ratio (SNR). Then, the Modulation Sequence Scale (MCS) information used for the transmitted data is obtained based on the received Digital Channel Index (DCI). This MCS information includes the modulation order m and the coding rate R. Based on this, the coding length of the component encoder is determined to be N = K / R, where K represents the preprocessed information block length.

[0145] Step B: Next, the terminal uses the signal-to-noise ratio (SNR) and modulation order m to determine the parameter v of the Maxwell-Boltzmann distribution.

[0146] Alternatively, the parameter v can be obtained by the following formula:

[0147]

[0148] Among them, v * Given the current SNR, M = 2 maximizes the AWGN channel capacity. m The Maxwell-Boltzmann parameters corresponding to the points of the modulation constellation. The upper limit of the control parameter v can be preset based on the modulation order m, signal-to-noise ratio (SNR), and coding rate (R).

[0149] Optionally, parameter v can also be set to a fixed value within a certain range of signal-to-noise ratio (SNR) or coding rate (R) based on the modulation order m.

[0150] Step C: Based on the calculated or selected Maxwell-Boltzmann parameter v and modulation order m, determine the number of shaping bits E required for each component code. k , where 1≤k≤m.

[0151] Optionally, the number of shaped bits E k It can be obtained through the following formula:

[0152] Calculate M = 2 based on parameter v. m The probability of each constellation point in the dimensional modulation is:

[0153]

[0154] Each constellation point corresponds to an m-dimensional bit vector, and the mapping process from this vector to the constellation point can be represented as follows:

[0155] The conditional entropy of the codeword bits corresponding to each component code is calculated as follows: For the k-th component code, the calculation method is as follows:

[0156]

[0157] in, This indicates that the first k bits of the m-dimensional bit vector corresponding to the modulation symbol are equal to The probability, in, Determined by equation (7); Similarly, B k Represents bit b k A random variable.

[0158] Finally, the number of shaped bits E k The value of is calculated according to the following formula:

[0159]

[0160] in, This indicates a down-fetch operation.

[0161] Step D: Finally, based on the signal-to-noise ratio (SNR), modulation order (m), Maxwell-Boltzmann parameter (v), and component encoder coding length (N), obtain the reliability ranking table Q for bit positions. mN ={Q1, Q2, ..., Q} mN}

[0162] Optionally, Q mN It can be determined based on SNR, in order to reduce the actual communication system's reliance on Q. mN The computational or storage requirements can be reduced by using a fixed “constructed signal-to-noise ratio dSNR” within a certain SNR range.

[0163] Optionally, given the upper limit uSNR and lower limit lSNR of the SNR range, a reliability ranking table Q is selected. mN The signal-to-noise ratio of the structure can be set as follows:

[0164] dSNR=α·uSNR+(1-α)·lSNR (10)

[0165] Where 0≤α≤1 are preset coefficients.

[0166] Alternatively, the signal-to-noise ratio can also be determined based on the coding rate R indicated in the MCS, for example:

[0167] dSNR = 10log 10 (2 2R -1)+β(dB) (11)

[0168] Where dSNR is in dB and β is a preset coefficient.

[0169] The choice of depends on the Maxwell-Boltzmann parameter v. Similarly, to reduce the computational and storage requirements of practical communication systems, parameter v can be determined using the method described in step B above.

[0170] Based on the number of forming bits E required for each component code k Obtain the conditional entropy sorting table of the k-th component code. It is worth noting that the conditional entropy sorting table only needs to be applied to E. k The first component code ≠ 0.

[0171] In this embodiment of the invention, the reliability sorting table of bit positions and the conditional entropy sorting table corresponding to the first component code are obtained by using conditional entropy and the number of shaped bits required for each component code. This method is easy to implement, has low execution difficulty, and is more practical.

[0172] In this embodiment of the invention, optionally, determining the bit position of each component code based on the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code includes:

[0173] According to the bit position reliability table, the first number of bit positions with reliability from low to high in the bit position reliability table are selected as the frozen bits of all component codes, and the frozen bits are used to carry frozen bits;

[0174] The freeze bit of each component code is determined based on the freeze bits of all the component codes;

[0175] Based on the number of formed bits, determine the first component code with a formed bit number greater than or equal to 1 and the second component code with a formed bit number of 0;

[0176] For the first component code, the second number of bit positions in the conditional entropy sorting table corresponding to the first component code, from low to high, are selected as shaping bits, and the shaping bits are located in the bit positions of the first component code excluding the frozen bits. The shaping bits are used to carry the shaping bits.

[0177] The bit positions in the first component code, excluding the freeze bit and the forming bit, are used as the information bits of the first component code, and the information bits are used to carry information bits.

[0178] The bit positions of the first component code are determined based on the information bits, freeze bits, and forming bits of the first component code.

[0179] For the second component code, the bit positions in the second component code, excluding the freeze bit, are used as the information bits of the second component code;

[0180] The bit positions of the second component code are determined based on the information bits and freeze bits of the second component code.

[0181] In this embodiment of the invention, a method for determining the bit position of each component code based on a bit position reliability sorting table and a conditional entropy sorting table corresponding to the first component code is also provided. More specifically, the method mainly includes the following steps.

[0182] Step a: In this embodiment of the invention, the reliability ranking table Q mN ={Q1, Q2, ..., Q} mN The components are arranged in ascending order of reliability for all mN bit positions corresponding to the m component encoders, i.e., W(Q1) < W(Q2) < ... < W(QN). mN ), where Q j =(k-1)N+i, W(Q) j) represents the reliability of the i-th bit position of the k-th component code, 1≤j≤mN, 1≤k≤m, 1≤i≤N.

[0183] Conditional Entropy Sort Table Arrange them in ascending order of the conditional entropy of all N bits corresponding to the k-th component code, i.e., Z(P k，1 )<Z(P k，2 ) < ... < Z(P) k，N ), where Z(P k，j ) represents the Pth polarization component code in the kth polarization component. k，j The conditional entropy of each bit position, 1≤P k，i ≤N, 1≤k≤N, 1≤j≤N.

[0184] Optionally, Q mN and It can be obtained through online calculation, that is, directly calculated based on the parameters in the aforementioned method without storage. Alternatively, all the required Q values ​​can be obtained online. mN and Store it and retrieve it by querying the table to avoid duplicate calculations.

[0185] Step b: In this embodiment of the application, Q is selected. mN The first (mN-KE) bit positions in the sorting table are used to carry frozen bits, and all of them satisfy (k-1)N+1≤Q. j The bit positions ≤kN constitute the set of frozen bits for the kth polarization component code. For the first component code, according to E k Conditional entropy sorting table Select E k The conditional entropy is minimized and lies in the set. The bit positions within form a shaped bit set The remaining bit positions constitute the information bit set. Right now It should be noted that when E k When = 0, that is, no shaping bits need to be added to the second component code.

[0186] The bit positions of the first component code are determined based on the information bits, freeze bits, and forming bits of the first component code; the bit positions of the second component code are determined based on the information bits and freeze bits of the second component code.

[0187] The bit positions determined by the calculation method in this embodiment of the invention can effectively reduce the bit error rate, improve system signal reliability, and enhance system performance. Furthermore, selecting the bit positions of the component code using a lookup table is more convenient and avoids redundant calculations.

[0188] Furthermore, after determining the bit position of each component code, a modulation symbol sequence is generated based on the information block to be transmitted and the bit position of each component code. Specifically:

[0189] In this embodiment of the invention, optionally, generating a modulation symbol sequence based on the information block to be transmitted and the bit position of each component code includes:

[0190] Based on the information block to be transmitted and the bit position of each component code, obtain the input bit sequence corresponding to each component encoder;

[0191] Based on the input bit sequence corresponding to each component encoder, obtain the codeword sequence corresponding to each component code;

[0192] Based on the codeword sequence corresponding to each component code, a modulation symbol sequence to be transmitted is generated.

[0193] First, this embodiment of the invention provides a method for obtaining the input bit sequence corresponding to each component code, which sequentially maps the preprocessed information block to information bits. Up; then freeze the position The corresponding bits are set to pre-configured values ​​(known to both the transceiver and receiver in the communication system); then, the likelihood ratio of the codeword bits is calculated based on the probability distribution of the constellation points corresponding to the Maxwell-Boltzmann parameter v, and the shaped bits are calculated using the polar code decoding algorithm. Specifically, the values ​​of the corresponding bits are:

[0194] In this embodiment of the invention, optionally, obtaining the input bit sequence corresponding to each component encoder based on the information block to be transmitted and the bit position of each component code includes:

[0195] The information block to be transmitted is sequentially mapped to the information bits of each component code to obtain the information bits of each component code;

[0196] Set the bit corresponding to the frozen bit of each component code to a specified value to obtain the frozen bit of each component code;

[0197] Based on the likelihood ratio of the codeword bits, information bits, and frozen bits of the first component code, determine the value of the bit corresponding to the forming bit of the first component code, and obtain the forming bit of the first component code.

[0198] Based on the information bits, frozen bits, and the shaped bits of the first component code, the input bit sequence corresponding to each component encoder is obtained.

[0199] More specifically, firstly, the preprocessed output bit sequence v′=(v′1,v′2,...,v′) is...K Split into m subsequences in The method for determining the elements of a subsequence is as follows:

[0200] w k，j =v′ t+j for j=1, 2,...,K, where t=K1+K2+...+K k-1 (12)

[0201] Next, starting with the first component code, the shaped bit values ​​of each component code are calculated sequentially, and polar code encoding is performed.

[0202] Let u k =(u k，1 u k，2 , ..., u k，N ) represents the input bit sequence of the k-th component encoder.

[0203] w k Mapped sequentially to Above, immediately ordered in

[0204] Then u k Freeze position The bits are set to pre-configured values, and the values ​​of the frozen bits are known at both the transmitting and receiving ends of the communication system.

[0205] Please refer to Figure 4 Furthermore, based on the codeword sequence output by the previous (k-1) component encoders and the set Maxwell-Boltzmann parameter v, the current component codeword bits c are calculated. k，i The likelihood ratio Λ(c) k，i The calculation method is as follows:

[0206]

[0207] Among them, c k，i Represents the codeword sequence c k The i-th bit, c 1，i c k-1，i Similarly; Represents modulation mapping; Represents an m-dimensional bit vector In mapping The modulation symbol under the given conditions, and its probability of value. Determined by the above equation (7), Similarly.

[0208] According to the likelihood ratio Λ(c) k，iand the information bits at the encoder input. and frozen bits Calculate the shaped bits using polar code decoding algorithms Corresponding bits The value of .

[0209] Finally, the codeword sequence for each component code is obtained by polar code encoding as c. k =u k G N G N is the generator matrix of the polar code.

[0210] In this embodiment of the invention, the value of the bit corresponding to the shaped bit is calculated based on the likelihood ratio, and the codeword sequence of each component code is further obtained by polar code encoding. This can further reduce the bit error rate, improve signal reliability, reduce distortion in signal transmission, and improve system performance.

[0211] Furthermore, after obtaining the codeword sequence of each component code, modulation mapping is performed to generate a modulation symbol sequence to be transmitted. One bit is sequentially extracted from the same position in the m codeword sequences to form N m-dimensional bit vectors. Each bit vector is then mapped to a modulation symbol, ultimately resulting in a modulation symbol sequence x of length N, which is then sent into the channel for transmission. Specifically:

[0212] In this embodiment of the invention, optionally, generating the modulation symbol sequence to be transmitted based on the codeword sequence corresponding to each component code includes:

[0213] One bit is taken from the same position in the codeword sequence corresponding to each component code to form a fourth number of bit vectors, where the fourth number is consistent with the encoding length of the component encoder.

[0214] According to the modulation mapping rule, the fourth number of bit vectors are mapped to the fourth number of modulation symbols, and the fourth number of modulation symbols form a modulation symbol sequence.

[0215] First, one bit is sequentially taken from the same position in each codeword sequence to form N m-dimensional bit vectors. Then, according to the modulation mapping rules, these vectors are mapped to N modulation symbols, forming a modulation symbol sequence x = (x1, x2, ..., xn) of length N. N And then it is sent into the channel for transmission. This process can be represented as:

[0216]

[0217] Where, x i Let c represent the i-th modulation symbol of x. k，i Indicates codeword c k The i-th bit, 1≤i≤N.

[0218] This invention proposes an information transmission method utilizing MLC-PCM probabilistic shaping. In this embodiment, the terminal physical layer first preprocesses the information block to be transmitted based on the configuration information transmitted from the upper layer. Subsequently, the terminal determines the modulation order and coding rate to be used during transmission by detecting channel state information and control information, and obtains the required construction table based on these parameters. Next, the terminal performs polarization coding and constellation modulation operations to obtain the symbol sequence to be transmitted.

[0219] Through the above embodiments of the invention, an information transmission method has been completed, realizing the practical application of MLC-PCM probabilistic shaping and improving its practical value. Furthermore, the method of determining the shaping bits by constructing a table in the embodiments of the invention has low complexity and higher flexibility. Moreover, the method of pre-storing the construction table can reduce the amount of computation, storage space, and bit error rate. An embodiment is provided below to describe in detail the experimental process and performance analysis of the embodiments of the invention.

[0220] Taking K=384, SNR=11dB, 8ASK modulation (modulation order m=3), R=1.5, v=0.041 as an example, the component encoder's encoding length is N=K / R=256. Based on v and m, the number of shaping bits required for each component code are E1=0, E2=0, and E3=69, respectively. Therefore, only the third component code needs to have shaping bits added. The bit position reliability sorting table Q is used. 768 And the bit position conditional entropy sorting table of the third component code. As shown in Table 1 and Table 2 respectively.

[0221] Table 1

[0222]

[0223]

[0224]

[0225]

[0226] Table 2

[0227] <![CDATA[Z(P 3，j )]]> <![CDATA[P 3，j ]]> <![CDATA[Z(P 3，j )]]> <![CDATA[P 3，j ]]> <![CDATA[Z(P 3，j )]]> <![CDATA[P 3，j ]]> <![CDATA[Z(P 3，j )]]> <![CDATA[P 3，j ]]> <![CDATA[Z(P 3，j )]]> <![CDATA[P 3，j ]]> <![CDATA[Z(P 3，j )]]> <![CDATA[P 3，j ]]> 1 256 44 124 87 116 130 107 173 153 216 53 2 255 45 215 88 156 131 150 174 162 217 51 3 254 46 241 89 110 132 106 175 24 218 50 4 252 47 189 90 181 133 201 176 16 219 49 5 248 48 176 91 203 134 93 177 149 220 45 6 240 49 214 92 152 135 143 178 105 221 43 7 224 50 187 93 95 136 148 179 147 222 42 8 253 51 120 94 108 137 103 180 146 223 41 9 251 52 233 95 202 138 142 181 141 224 39 10 250 53 160 96 94 139 102 182 101 225 38 11 247 54 207 97 144 140 91 183 139 226 37 12 246 55 212 98 179 141 140 184 99 227 36 13 244 56 186 99 104 142 177 185 138 228 35 14 192 57 112 100 199 143 100 186 98 229 34 15 239 58 183 101 225 144 197 187 89 230 33 16 238 59 206 102 121 145 90 188 135 231 29 17 236 60 229 103 63 146 136 189 134 232 27 18 223 61 125 104 92 147 61 190 132 233 26 19 222 62 182 105 178 148 87 191 85 234 25 20 232 63 217 106 173 149 195 192 193 235 23 21 128 64 204 107 198 150 86 193 83 236 22 22 249 65 96 108 62 151 59 194 82 237 21 23 220 66 227 109 88 152 194 195 57 238 20 24 245 67 123 110 196 153 79 196 77 239 19 25 243 68 175 111 171 154 84 197 75 240 18 26 191 69 180 112 60 155 58 198 161 241 17 27 237 70 200 113 80 156 78 199 145 242 15 28 216 71 226 114 117 157 169 200 137 243 14 29 242 72 122 115 170 158 55 201 133 244 13 30 190 73 64 116 56 159 76 202 131 245 12 31 235 74 213 117 157 160 54 203 130 246 11 32 188 75 174 118 167 161 72 204 129 247 10 33 234 76 119 119 48 162 47 205 97 248 9 34 221 77 159 120 209 163 52 206 81 249 8 35 208 78 172 121 115 164 46 207 74 250 7 36 231 79 118 122 166 165 165 208 73 251 6 37 127 80 211 123 32 166 31 209 71 252 5 38 184 81 185 124 155 167 44 210 70 253 4 39 219 82 158 125 114 168 113 211 69 254 3 40 230 83 111 126 109 169 30 212 68 255 2 41 126 84 168 127 164 170 40 213 67 256 1 42 218 85 205 128 154 171 163 214 66 43 228 86 210 129 151 172 28 215 65

[0228] To determine the freeze bits, information bits, and shaping bits for each polarization component code, we first consult Table 1 and select the first (768-384-69) = 315 bit positions to carry the freeze bits, thus obtaining the set of freeze bits. and For the first two polarization component codes, since E1 = E2 = 0, therefore For the third polarization component code, consult Table 2 and select the first 69 codes that are not in the table. Bit positions within The remaining positions constitute

[0229] Please refer to Figure 9A , Figure 9B and Figure 9C These are the specific values ​​of the frozen bit, information bit, and forming bit of each polarization component code in the embodiments of the present invention.

[0230] The performance of the final results of the embodiments of the present invention is evaluated below. Please refer to... Figure 10 The block error rate performance curve of the MLC-PCM probabilistic shaping system implemented based on the embodiment of the present invention is shown when the component encoder has a coding length N = 256, uses 8ASK modulation (modulation order m = 3), and Maxwell-Boltzmann parameter v = 0.041.

[0231] As a comparative approach, this embodiment of the invention also provides block error rate performance curves for an MLC-PCM system without probabilistic shaping, where the constellation points are uniformly and equally distributed. The coding rates R corresponding to the six sets of block error rate performance curves from left to right are 1, 1.25, 1.5, 1.75, 2.0, and 2.25, respectively, and the preprocessed information block length K = NR. According to... Figure 10 As a result, the MLC-PCM probabilistic shaping system in this embodiment of the invention has significant performance advantages compared to the MLC-PCM system using a traditional uniform and equiprobable constellation. Specifically, it has a lower block error rate at the same signal-to-noise ratio and requires a smaller minimum signal-to-noise ratio at the same block error rate.

[0232] Please refer to Figure 11 Comparison of simulation performance when Maxwell-Boltzmann parameter v = 0.01. Figure 11 Six sets of simulation performance curves are presented. From left to right, the corresponding coding rates R are 2, 2.25, 2.5, 2.75, 3, and 3.25, respectively, and the preprocessed information block length K = NR. Similarly, under 16ASK modulation, the MLC-PCM probabilistic shaping system has significant performance advantages compared to the MLC-PCM system using a traditional uniform and equal-probability constellation.

[0233] Of course, it's worth noting that QAM modulation is widely used in existing communication systems. For a 2... 2m In QAM modulation with binary number system, since the I / Q channels are independent, its constellation diagram can be viewed as two binary numbers. m The Cartesian product of the ASK constellation diagram in base 2. To construct a 2^3 ASK constellation diagram... 2m-QAM modulation, an MLC-PCM system with N symbols can use a component encoder with a length of 2N. m -ASK modulation is used. Therefore, the method proposed in this invention can be directly extended to QAM modulation, achieving good compatibility with existing communication systems, reducing implementation difficulty and deployment costs, and having a wider range of application scenarios.

[0234] Please refer to Figure 12 This invention provides an information transmission method applied at a receiving end, comprising:

[0235] Step 21: Receive the modulation symbol sequence transmitted through the channel;

[0236] Step 22: Obtain the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code, wherein the conditional entropy sorting table is used to determine the shaped bits in the bit position, and the number of shaped bits of the first component code is greater than or equal to 1.

[0237] Step 23: Determine the bit position of each component code according to the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code. The bit position includes information bits, frozen bits and / or forming bits.

[0238] Step 24: Obtain the decoded information bits based on the modulation symbol sequence and the bit position of each component code.

[0239] In this embodiment of the invention, at the receiving end, the decoded information bits are obtained according to the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code, which can ensure the smooth progress of the decoding process and guarantee the accuracy of the decoding result.

[0240] It is worth noting that the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code at the receiving end can be calculated by the sending end and the results sent to the receiving end. Alternatively, the receiving end can search for the pre-calculated and stored construction table in the database. Of course, the receiving end can also perform online calculations. Specifically:

[0241] In this embodiment of the invention, optionally, the method further includes, before obtaining the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code:

[0242] Acquire channel state information and downlink control information;

[0243] Based on the channel state information and the downlink control information, determine the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code.

[0244] In this embodiment of the invention, the robustness of the system can be enhanced by online calculation at the receiving end, avoiding the problem of increased bit error rate caused by errors in the constructed table by the sender.

[0245] In this embodiment of the invention, the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code can be applied not only to the encoding process at the transmitting end, but also to the decoding process at the receiving end. This makes it more practical and has a wider range of applications. It can ensure the reliability of transmission from both the sending and receiving sides, reduce the bit error rate, and improve flexibility.

[0246] Please refer to Figure 13 This application also provides an information transmission system 30, applied at a sending end, comprising:

[0247] The acquisition module 31 is used to acquire the information block to be transmitted, acquire the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code, wherein the conditional entropy sorting table is used to determine the forming bits in the bit position, and the number of forming bits of the first component code is greater than or equal to 1.

[0248] The first bit position module 32 is used to determine the bit position of each component code according to the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code. The bit position includes information bits, frozen bits and / or forming bits.

[0249] Sequence module 33 is used to generate a modulation symbol sequence based on the information block to be transmitted and the bit position of each component code.

[0250] Optionally, the acquisition module 31 includes:

[0251] The first receiving module is used to acquire channel state information and downlink control information;

[0252] The table module is used to determine the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code based on the channel state information and the downlink control information.

[0253] Optionally, in this embodiment of the application, the information transmission system 30 further includes:

[0254] The preprocessing module is used to receive configuration information;

[0255] Based on the configuration information, a preprocessing operation is performed on the information block to be transmitted to obtain the preprocessed information block to be transmitted.

[0256] Optionally, in this embodiment of the application, the preprocessing operation includes at least one of the following:

[0257] The information block to be transmitted is segmented, auxiliary bits are added to the information block to be transmitted, the positions of the bits in the information block to be transmitted are swapped, and the information block to be transmitted is interleaved.

[0258] Optionally, in this embodiment of the application, the table module further includes:

[0259] The table submodule is used to determine the signal-to-noise ratio of the current channel based on the channel state information;

[0260] Based on the downlink control information, obtain the modulation and coding scheme information used for transmitting data, wherein the modulation and coding scheme information includes at least the modulation order and coding rate;

[0261] The encoding length of the component encoder is determined based on the length of the information block to be transmitted and the encoding rate.

[0262] The Maxwell-Boltzmann distribution parameters are determined based on the signal-to-noise ratio and the modulation order.

[0263] The number of shaping bits required for each component code is determined based on the Maxwell-Boltzmann distribution parameters and the modulation order.

[0264] Based on the signal-to-noise ratio, modulation order, Maxwell-Boltzmann distribution parameters, and component encoder encoding length, a bit position reliability sorting table is obtained.

[0265] Based on the number of shaped bits required for each component code, obtain the conditional entropy sorting table for the first component code.

[0266] Optionally, in this embodiment of the application, the first bit position module 32 further includes:

[0267] The first bit submodule is used to select, according to the bit position reliability table, a first number of bit positions with reliability from low to high as frozen bits for all component codes, and the frozen bits are used to carry frozen bits;

[0268] The freeze bit of each component code is determined based on the freeze bits of all the component codes;

[0269] Based on the number of formed bits, determine the first component code with a formed bit number greater than or equal to 1 and the second component code with a formed bit number of 0;

[0270] For the first component code, the second number of bit positions in the conditional entropy sorting table corresponding to the first component code, from low to high, are selected as shaping bits, and the shaping bits are located in the bit positions of the first component code excluding the frozen bits. The shaping bits are used to carry the shaping bits.

[0271] The bit positions in the first component code, excluding the freeze bit and the forming bit, are used as the information bits of the first component code, and the information bits are used to carry information bits.

[0272] The bit positions of the first component code are determined based on the information bits, freeze bits, and forming bits of the first component code.

[0273] For the second component code, the bit positions in the second component code, excluding the freeze bit, are used as the information bits of the second component code;

[0274] The bit positions of the second component code are determined based on the information bits and freeze bits of the second component code.

[0275] Optionally, in this embodiment of the application, the sequence module 33 further includes:

[0276] The sequence submodule is used to obtain the input bit sequence corresponding to each component encoder based on the information block to be transmitted and the bit position of each component code;

[0277] Based on the input bit sequence corresponding to each component encoder, obtain the codeword sequence corresponding to each component code;

[0278] Based on the codeword sequence corresponding to each component code, a modulation symbol sequence to be transmitted is generated.

[0279] Optionally, in this embodiment of the application, the sequence submodule further includes:

[0280] The mapping module is used to sequentially map the information block to be transmitted to the information bits of each component code, and obtain the information bits of each component code;

[0281] Set the bit corresponding to the frozen bit of each component code to a specified value to obtain the frozen bit of each component code;

[0282] Based on the likelihood ratio of the codeword bits, information bits, and frozen bits of the first component code, determine the value of the bit corresponding to the forming bit of the first component code, and obtain the forming bit of the first component code.

[0283] Based on the information bits, frozen bits, and the shaped bits of the first component code, the input bit sequence corresponding to each component encoder is obtained.

[0284] Optionally, in this embodiment of the application, the sequence submodule further includes:

[0285] The modulation module is used to extract one bit from the same position in the codeword sequence corresponding to each component code in sequence to form a fourth number of bit vectors, wherein the fourth number is consistent with the encoding length of the component encoder.

[0286] According to the modulation mapping rule, the fourth number of bit vectors are mapped to the fourth number of modulation symbols, and the fourth number of modulation symbols form a modulation symbol sequence.

[0287] The information transmission system provided in this embodiment of the invention can achieve Figures 1 to 11 The various processes implemented in the method embodiments achieve the same technical effect, and will not be described again here to avoid repetition.

[0288] Please refer to Figure 14 This application also provides an information transmission system 40, applied at a receiving end, comprising:

[0289] The third receiving module 41 is used to receive the modulation symbol sequence transmitted through the channel;

[0290] The fourth receiving module 42 is used to obtain a bit position reliability sorting table and a conditional entropy sorting table corresponding to the first component code, wherein the conditional entropy sorting table is used to determine the shaped bits in the bit position, and the number of shaped bits of the first component code is greater than or equal to 1.

[0291] The second bit position module 43 is used to determine the bit position of each component code according to the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code. The bit position includes information bits, frozen bits and / or forming bits.

[0292] The decoding module 44 is used to obtain the decoded information bits according to the modulation symbol sequence and the bit position of each component code.

[0293] Optionally, in this embodiment of the application, the information transmission system 40 further includes:

[0294] The online calculation module is used to acquire channel state information and downlink control information;

[0295] Based on the channel state information and the downlink control information, determine the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code.

[0296] The information transmission system provided in this embodiment of the invention can achieve Figure 12 The various processes implemented in the method embodiments achieve the same technical effect, and will not be described again here to avoid repetition.

[0297] This invention provides an electronic device 50, see [link to relevant documentation]. Figure 15 As shown, Figure 15This is a schematic block diagram of an electronic device 50 according to an embodiment of the present invention, including a processor 51, a memory 52, and a program or instructions stored in the memory 52 and executable on the processor 51. When the program or instructions are executed by the processor, they implement the steps in any information transmission method of the present invention.

[0298] This invention provides a readable storage medium on which a program or instruction is stored. When the program or instruction is executed by a processor, it implements the various processes of the information transmission method embodiments described above and achieves the same technical effect. To avoid repetition, further details are omitted here.

[0299] Computer-readable media include both permanent and non-permanent, removable and non-removable media, which can store information using any method or technology. Information can be computer-readable instructions, data structures, modules of programs, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic magnetic disk storage or other magnetic storage devices, or any other non-transferable medium that can be used to store information accessible by a computing device. As defined herein, computer-readable media does not include transient computer-readable media, such as modulated data signals and carrier waves.

[0300] It should be noted that, in this document, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Unless otherwise specified, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes that element.

[0301] The sequence numbers of the above embodiments of the present invention are for descriptive purposes only and do not represent the superiority or inferiority of the embodiments.

[0302] Through the above description of the embodiments, those skilled in the art can clearly understand that the methods of the above embodiments can be implemented by means of software plus necessary general-purpose hardware platforms. Of course, they can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk) and includes several instructions to cause a service classification device (which may be a mobile phone, computer, server, air conditioner, or network device, etc.) to execute the methods described in the various embodiments of this application.

[0303] The above description is only a preferred embodiment of this application. It should be noted that for those skilled in the art, several improvements and modifications can be made without departing from the principle of this application, and these improvements and modifications should also be considered within the scope of protection of this application.

Claims

1. An information transmission method, applied at a sending end, characterized in that, include: Obtain the information block to be transmitted, obtain the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code, wherein the conditional entropy sorting table is used to determine the forming bits in the bit position, and the number of forming bits of the first component code is greater than or equal to 1. The bit position of each component code is determined according to the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code. The bit position includes information bits, frozen bits and / or shaped bits. Based on the information block to be transmitted and the bit position of each component code, a modulation symbol sequence is generated; Before acquiring the information block to be transmitted, the following steps are included: Receive configuration information; Based on the configuration information, a preprocessing operation is performed on the information block to be transmitted to obtain the preprocessed information block to be transmitted. The preprocessing operation includes at least one of the following: segmenting the information block to be transmitted, adding auxiliary bits to the information block to be transmitted, swapping the positions of bits in the information block to be transmitted, and performing an interleaving operation on the information block to be transmitted. The acquisition bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code include: Acquire channel state information and downlink control information; Based on the channel state information and the downlink control information, determine the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code; The step of determining the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code based on the channel state information and the downlink control information includes: Based on the channel state information, determine the signal-to-noise ratio of the current channel; Based on the downlink control information, obtain the modulation and coding scheme information used for transmitting data, wherein the modulation and coding scheme information includes at least the modulation order and coding rate; The encoding length of the component encoder is determined based on the length of the information block to be transmitted and the encoding rate. The Maxwell-Boltzmann distribution parameters are determined based on the signal-to-noise ratio and the modulation order. The number of shaping bits required for each component code is determined based on the Maxwell-Boltzmann distribution parameters and the modulation order. Based on the signal-to-noise ratio, modulation order, Maxwell-Boltzmann distribution parameters, and component encoder encoding length, a bit position reliability sorting table is obtained. Based on the number of shaped bits required for each component code, obtain the conditional entropy sorting table for the first component code.

2. The method according to claim 1, characterized in that, The step of determining the bit position of each component code based on the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code includes: According to the bit position reliability table, the first number of bit positions with reliability from low to high in the bit position reliability table are selected as the frozen bits of all component codes, and the frozen bits are used to carry frozen bits; The freeze bit of each component code is determined based on the freeze bits of all the component codes; Based on the number of formed bits, determine the first component code with a formed bit number greater than or equal to 1 and the second component code with a formed bit number of 0; For the first component code, the second number of bit positions in the conditional entropy sorting table corresponding to the first component code, from low to high, are selected as shaping bits, and the shaping bits are located in the bit positions of the first component code excluding the frozen bits. The shaping bits are used to carry the shaping bits. The bit positions in the first component code, excluding the freeze bit and the forming bit, are used as the information bits of the first component code, and the information bits are used to carry information bits. The bit positions of the first component code are determined based on the information bits, freeze bits, and forming bits of the first component code. For the second component code, the bit positions in the second component code, excluding the freeze bit, are used as the information bits of the second component code; The bit positions of the second component code are determined based on the information bits and freeze bits of the second component code.

3. The method according to claim 1, characterized in that, The step of generating a modulation symbol sequence based on the information block to be transmitted and the bit position of each component code includes: Based on the information block to be transmitted and the bit position of each component code, obtain the input bit sequence corresponding to each component encoder; Based on the input bit sequence corresponding to each component encoder, obtain the codeword sequence corresponding to each component code; Based on the codeword sequence corresponding to each component code, a modulation symbol sequence to be transmitted is generated.

4. The method according to claim 3, characterized in that, The step of obtaining the input bit sequence corresponding to each component encoder based on the information block to be transmitted and the bit position of each component code includes: The information block to be transmitted is sequentially mapped to the information bits of each component code to obtain the information bits of each component code; Set the bit corresponding to the frozen bit of each component code to a specified value to obtain the frozen bit of each component code; Based on the likelihood ratio of the codeword bits, information bits, and frozen bits of the first component code, determine the value of the bit corresponding to the forming bit of the first component code, and obtain the forming bit of the first component code. Based on the information bits, frozen bits, and the shaped bits of the first component code, the input bit sequence corresponding to each component encoder is obtained.

5. The method according to claim 3, characterized in that, The step of generating the modulation symbol sequence to be transmitted based on the codeword sequence corresponding to each component code includes: One bit is taken from the same position in the codeword sequence corresponding to each component code to form a fourth number of bit vectors, where the fourth number is consistent with the encoding length of the component encoder. According to the modulation mapping rule, the fourth number of bit vectors are mapped to the fourth number of modulation symbols, and the fourth number of modulation symbols form a modulation symbol sequence.

6. An information transmission method, applied at a receiving end, characterized in that, include: The received channel transmits a sequence of modulated symbols; Obtain a bit position reliability sorting table and a conditional entropy sorting table corresponding to the first component code, wherein the conditional entropy sorting table is used to determine the shaped bits in the bit position, and the number of shaped bits in the first component code is greater than or equal to 1. The bit position of each component code is determined according to the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code. The bit position includes information bits, frozen bits and / or shaped bits. Based on the modulation symbol sequence and the bit position of each component code, obtain the decoded information bits; The process of obtaining the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code before obtaining the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code includes: obtaining channel state information and downlink control information; and determining the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code based on the channel state information and the downlink control information. The step of determining the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code based on the channel state information and the downlink control information includes: Based on the channel state information, determine the signal-to-noise ratio of the current channel; Based on the downlink control information, obtain the modulation and coding scheme information used for transmitting data, wherein the modulation and coding scheme information includes at least the modulation order and coding rate; The encoding length of the component encoder is determined based on the length of the information block to be transmitted and the encoding rate. The Maxwell-Boltzmann distribution parameters are determined based on the signal-to-noise ratio and the modulation order. The number of shaping bits required for each component code is determined based on the Maxwell-Boltzmann distribution parameters and the modulation order. Based on the signal-to-noise ratio, modulation order, Maxwell-Boltzmann distribution parameters, and component encoder encoding length, a bit position reliability sorting table is obtained. Based on the number of shaped bits required for each component code, obtain the conditional entropy sorting table for the first component code.

7. An information transmission system, applied at a sending end, characterized in that, include: The acquisition module is used to acquire the information block to be transmitted, acquire the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code, wherein the conditional entropy sorting table is used to determine the forming bits in the bit position, and the number of forming bits of the first component code is greater than or equal to 1. The first bit position module is used to determine the bit position of each component code according to the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code. The bit position includes information bits, frozen bits and / or shaped bits. The sequence module is used to generate a modulation symbol sequence based on the information block to be transmitted and the bit position of each component code; The method further includes, before obtaining the information block to be transmitted, receiving configuration information; performing a preprocessing operation on the information block to be transmitted according to the configuration information to obtain a preprocessed information block to be transmitted; the preprocessing operation includes at least one of the following: segmenting the information block to be transmitted, adding auxiliary bits to the information block to be transmitted, swapping the positions of bits in the information block to be transmitted, and performing an interleaving operation on the information block to be transmitted. The acquisition bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code include: Acquire channel state information and downlink control information; Based on the channel state information and the downlink control information, determine the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code; The step of determining the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code based on the channel state information and the downlink control information includes: Based on the channel state information, determine the signal-to-noise ratio of the current channel; Based on the downlink control information, obtain the modulation and coding scheme information used for transmitting data, wherein the modulation and coding scheme information includes at least the modulation order and coding rate; The encoding length of the component encoder is determined based on the length of the information block to be transmitted and the encoding rate. The Maxwell-Boltzmann distribution parameters are determined based on the signal-to-noise ratio and the modulation order. The number of shaping bits required for each component code is determined based on the Maxwell-Boltzmann distribution parameters and the modulation order. Based on the signal-to-noise ratio, modulation order, Maxwell-Boltzmann distribution parameters, and component encoder encoding length, a bit position reliability sorting table is obtained. Based on the number of shaped bits required for each component code, obtain the conditional entropy sorting table for the first component code.

8. An information transmission system, applied at a receiving end, characterized in that, include: The third receiving module is used to receive the modulation symbol sequence transmitted through the channel; The fourth receiving module is used to obtain a bit position reliability sorting table and a conditional entropy sorting table corresponding to the first component code, wherein the conditional entropy sorting table is used to determine the shaped bits in the bit position, and the number of shaped bits of the first component code is greater than or equal to 1. The second bit position module is used to determine the bit position of each component code according to the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code. The bit position includes information bits, frozen bits and / or forming bits. The decoding module is used to obtain the decoded information bits based on the modulation symbol sequence and the bit position of each component code; The process of obtaining the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code before obtaining the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code includes: obtaining channel state information and downlink control information; and determining the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code based on the channel state information and the downlink control information. The step of determining the bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code based on the channel state information and the downlink control information includes: Based on the channel state information, determine the signal-to-noise ratio of the current channel; Based on the downlink control information, obtain the modulation and coding scheme information used for transmitting data, wherein the modulation and coding scheme information includes at least the modulation order and coding rate; The encoding length of the component encoder is determined based on the length of the information block to be transmitted and the encoding rate. The Maxwell-Boltzmann distribution parameters are determined based on the signal-to-noise ratio and the modulation order. The number of shaping bits required for each component code is determined based on the Maxwell-Boltzmann distribution parameters and the modulation order. Based on the signal-to-noise ratio, modulation order, Maxwell-Boltzmann distribution parameters, and component encoder encoding length, a bit position reliability sorting table is obtained. Based on the number of shaped bits required for each component code, obtain the conditional entropy sorting table for the first component code.

9. An electronic device, characterized in that, include: A processor, a memory, and a program stored in the memory and executable on the processor, wherein the program, when executed by the processor, implements the steps of the information transmission method as described in any one of claims 1 to 5; or the program, when executed by the processor, implements the steps of the information transmission method as described in claim 6.

10. A computer-readable storage medium, characterized in that, A computer-readable storage medium stores a computer program that, when executed by a processor, implements the steps of the information transmission method as described in any one of claims 1 to 5; or, when executed by the processor, implements the steps of the information transmission method as described in claim 6.

Images