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

Abstract

The invention provides an information transmission method and system, electronic equipment and a readable storage medium, and the information transmission method comprises the steps: obtaining a to-be-transmitted information block, obtaining a bit position reliability ranking table and a conditional entropy ranking table corresponding to a first component code, the conditional entropy ranking table is used for determining a shaping bit in a bit position, and the shaping bit is used for determining the reliability of the to-be-transmitted information block; the forming bit number of the first component code is greater than or equal to 1; according to the bit position reliability ranking table and the conditional entropy ranking table corresponding to the first component code, the bit position of each component code is determined, and the bit position comprises an information bit, a freezing bit and / or a forming bit; and generating a modulation symbol sequence according to the information block to be transmitted and the bit position of each component code. According to the method, the bit position is determined through the construction table in the probability forming construction process in the information transmission process, the execution difficulty is low, the complexity is low, the flexibility is high, and practicability is achieved.

Description

Technical Field

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

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

[0003] In actual communication systems, jointly modulating channel coding and constellation modulation is an effective way to achieve high spectral efficiency and reliable transmission. However, for the "uniform equiprobability distribution" constellation modulation method used in existing 5G systems, there is a large gap between it and the channel capacity limit. In order to overcome this problem and improve the performance of the system, channel coding can be combined with constellation shaping technology (Constellation Shaping). According to the method of obtaining performance gain, constellation shaping technology can be divided into: probability shaping and geometric shaping. Since the probability shaping scheme makes less changes to the coding modulation system, it is easier to implement and promote.

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

[0005] Among the existing construction methods, there is a method of using numerical search to realize the construction of the MLC-PCM probability shaping system, but this method is very complex and lacks flexibility. When it is necessary to add shaping bits to other polarization component codes, the complexity of this method will increase exponentially. There is also a simplified density evolution method for construction, but this method requires a large amount of storage space to ensure the accuracy of its calculation, so it is less practical. Summary of the invention

[0006] The embodiments of the present invention provide 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 probability shaping construction process in existing information transmission.

[0007] In order to solve the above-mentioned technical problems, the present invention is achieved as follows:

[0008] In a first aspect, an embodiment of the present invention provides an information transmission method, which is applied to a sending end and includes:

[0009] Acquire an information block to be transmitted, acquire a bit position reliability ranking table and a conditional entropy ranking table corresponding to the first component code, wherein the conditional entropy ranking table is used to determine a shaped bit in a bit position, and the number of shaped bits of the first component code is greater than or equal to 1;

[0010] Determine the bit position of each component code according to the bit position reliability ranking table and the conditional entropy ranking table corresponding to the first component code, wherein the bit position includes an information bit, a frozen bit and / or a shaped bit;

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

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

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

[0014] A bit position reliability ranking table and a conditional entropy ranking table corresponding to the first component code are determined according to the channel state information and the downlink control information.

[0015] Optionally, before the receiving channel state information and downlink control information, the step includes:

[0016] Receive configuration information;

[0017] According to 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 blocks to be transmitted are segmented, auxiliary bits are added to the information blocks to be transmitted, positions of bits in the information blocks to be transmitted are exchanged, and an interleaving operation is performed on the information blocks to be transmitted.

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

[0021] Determining a signal-to-noise ratio of a current channel according to the channel state information;

[0022] Acquire, according to the downlink control information, modulation and coding scheme information adopted for transmitting data, wherein the modulation and coding scheme information at least includes a modulation order and a coding rate;

[0023] Determining the coding length of the component encoder according to the length of the information block to be transmitted and the coding rate;

[0024] Determining a Maxwell-Boltzmann distribution parameter according to the signal-to-noise ratio and the modulation order;

[0025] Determining the number of shaped bits required for each component code according to the Maxwell-Boltzmann distribution parameter and the modulation order;

[0026] Obtaining a bit position reliability ranking table according to the signal-to-noise ratio, the modulation order, the Maxwell-Boltzmann distribution parameter, and the coding length of the component encoder;

[0027] According to the number of shaping bits required for each component code, a conditional entropy sorting table of the first component code is obtained.

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

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

[0030] Determining the frozen bits of each component code according to the frozen bits of all component codes;

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

[0032] For the first component code, selecting a second number of bit positions whose conditional entropy is from low to high in the conditional entropy sorting table corresponding to the first component code as forming bits, and the forming bits are located in the bit positions of the first component code except the frozen bits, and the forming bits are used to carry the forming bits;

[0033] Using bit positions other than frozen bits and shaped bits in the bit positions of the first component code as information bits of the first component code, wherein the information bits are used to carry information bits;

[0034] determining a bit position of the first component code according to information bits, frozen bits, and shaped bits of the first component code;

[0035] For the second component code, using bit positions of the second component code except frozen bits as information bits of the second component code;

[0036] The bit position of the second component code is determined according to the information bit and the frozen bit of the second component code.

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

[0038] According to the information block to be transmitted and the bit position of each component code, obtaining an input bit sequence corresponding to each component encoder;

[0039] Obtaining a codeword sequence corresponding to each component code according to an input bit sequence corresponding to each component encoder;

[0040] A modulation symbol sequence to be sent is generated according to the codeword sequence corresponding to each component code.

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

[0042] Mapping the information block to be transmitted to the information bit of each component code in sequence to obtain the information bit of each component code;

[0043] Setting 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] Determine, according to the likelihood ratio of the codeword bits of the first component code, the information bits and the frozen bits, the value of the bit corresponding to the shaping bit of the first component code, and obtain the shaping bit of the first component code;

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

[0046] Optionally, generating a modulation symbol sequence to be sent according to a codeword sequence corresponding to each component code includes:

[0047] Sequentially taking out one bit from the same position of the codeword sequence corresponding to each component code to form a fourth number of bit vectors, wherein the fourth number is consistent with the coding length of the component encoder;

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

[0049] In a second aspect, an embodiment of the present invention provides an information transmission method, which is applied to a receiving end, including:

[0050] receiving a modulation symbol sequence transmitted by a channel;

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

[0052] Determine the bit position of each component code according to the bit position reliability ranking table and the conditional entropy ranking table corresponding to the first component code, wherein the bit position includes an information bit, a frozen bit and / or a shaped bit;

[0053] The decoded information bits are obtained according to the modulation symbol sequence and the bit position of each component code.

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

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

[0056] A bit position reliability ranking table and a conditional entropy ranking table corresponding to the first component code are determined according to the channel state information and the downlink control information.

[0057] In a third aspect, an embodiment of the present invention provides an information transmission system, applied to a sending end, including:

[0058] An acquisition module, used to acquire an information block to be transmitted, and acquire a bit position reliability ranking table and a conditional entropy ranking table corresponding to the first component code, wherein the conditional entropy ranking table is used to determine a shaped bit in a bit position, and the number of shaped bits of the first component code is greater than or equal to 1;

[0059] A first bit position module, configured to determine a bit position of each component code according to the bit position reliability ranking table and a conditional entropy ranking table corresponding to the first component code, wherein the bit position includes an information bit, a frozen bit and / or a shaped bit;

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

[0061] In a fourth aspect, an embodiment of the present invention provides an information transmission system, applied to a receiving end, including:

[0062] A third receiving module, used to receive a modulation symbol sequence transmitted by a channel;

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

[0064] A second bit position module, configured to determine a bit position of each component code according to the bit position reliability ranking table and a conditional entropy ranking table corresponding to the first component code, wherein the bit position includes an information bit, a frozen bit and / or a shaped bit;

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

[0066] In a fifth aspect, an embodiment of the present invention provides an electronic device, comprising: 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, the steps of the information transmission method described in the first aspect are implemented; or, when the program is executed by the processor, the steps of the information transmission method described in the second aspect are implemented.

[0067] In a sixth aspect, an embodiment of the present invention provides a computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the steps of the information transmission method as described in the first aspect above are implemented; or when the computer program is executed by a processor, the steps of the information transmission method as described in the second aspect above are implemented.

[0068] In the present invention, firstly, the information block to be transmitted, the bit position reliability ranking table and the conditional entropy ranking table corresponding to the first component code are obtained, and the bit position of each component code is determined according to the bit position reliability ranking table and the conditional entropy ranking table corresponding to the first component code. The process is more concise, and finally, according to the information block to be transmitted and the bit position of each component code, a modulation symbol sequence is generated, which has lower complexity and higher flexibility. The information transmission method implemented by the embodiment of the present invention has a lower block error rate. Under the same block error rate, the required minimum signal-to-noise ratio is smaller. While improving the accuracy of signal transmission, the execution difficulty is low, the processing efficiency is fast, and it is more practical. BRIEF DESCRIPTION OF THE DRAWINGS

[0069] Various other advantages and benefits will become apparent to those of ordinary skill in the art by reading the detailed description of the preferred embodiments below. The accompanying drawings are only for the purpose of illustrating the preferred embodiments and are not to be considered as limiting the present invention. Moreover, the same reference symbols are used throughout the accompanying drawings to represent the same components. In the accompanying drawings:

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

[0071] Figure 2 It is an architecture of an MLC-PCM probability shaping system provided by an embodiment of the present invention;

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

[0073] Figure 4 is a shaping bit calculation flow chart under an MLC-PCM probability shaping system provided by an embodiment of the present invention;

[0074] Figure 5 is a flow chart of an information transmission method provided by an embodiment of the present invention;

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

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

[0077] Figure 8 It is a flow chart of determining a transmission parameter and a construction table provided by an embodiment of the present invention;

[0078] Fig.9A 1 is a schematic diagram of the bit positions of a first polarization component code of an embodiment provided by an embodiment of the present invention;

[0079] Fig. 9B is a schematic diagram of the bit position of the second polarization component code of an embodiment provided by an embodiment of the present invention;

[0080] Fig. 9C is a schematic diagram of bit positions of a third polarization component code of an embodiment provided by an embodiment of the present invention;

[0081] Fig.10 It is a simulation performance curve of an MLC-PCM probability shaping system implemented based on an embodiment of the present invention under 8ASK modulation provided by an embodiment of the present invention;

[0082] Fig.11 It is a simulation performance curve of an MLC-PCM probability shaping system implemented based on an embodiment of the present invention under 16ASK modulation provided by an embodiment of the present invention;

[0083] Fig.12 is a flow chart of another information transmission method provided by an embodiment of the present invention;

[0084] Fig.13is a structural schematic diagram of an information transmission system provided by an embodiment of the present invention;

[0085] Fig.14 is a schematic diagram of the structure of another information transmission system provided by an embodiment of the present invention;

[0086] Fig.15 It is a structural schematic diagram of an electronic device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0087] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0088] The joint modulation of channel coding and constellation modulation is an effective way to achieve high spectral efficiency and reliable transmission. Polarization coding and constellation modulation are one of the mainstream schemes for joint design. Channel polarization is the core idea of ​​polarization code, which means that N = 2 n An independent binary input discrete memoryless channel (B-DMC) W with the same channel characteristics is transformed into another set of polarization sub-channels with correlation and different reliability through recursive coding. Given the length K of the information sequence, it is necessary to evaluate and sort the reliability of the above N polarization sub-channels, and select the K sub-channels with the highest reliability to transmit information bits, and the remaining (NK) sub-channels transmit frozen bits known to both the sender and the receiver. This process is called the construction of polar codes. Let and denote the set of polarization subchannel numbers carrying information bits and frozen bits, respectively, and

[0089] Please refer to Figure 1 , given the source sequence The encoding process of polar code is expressed as:

[0090] c=uG N (1)

[0091] Where c represents the encoding codeword sequence, is the generator matrix introduced in the process of channel polarization transformation, Represents the matrix Perform n Kronecker products operate.

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

[0093] For a system with M=2 m For an MLC-PCM system with N-dimensional modulation and N symbols, the total code length is mN, corresponding to mN polarization sub-channels. Under the probability shaping scheme, in order to make the input symbols of the channel as close to the Gaussian distribution as possible and thus approach the capacity limit of the Additive White Gaussian Noise (AWGN) channel, the probability of the value of the constellation point corresponding to the modulation symbol should obey the Maxwell-Boltzmann distribution, that is:

[0094]

[0095] in, It means M=2 m The Maxwell-Boltzmann parameter v is 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 obey the target Maxwell-Boltzmann distribution, in addition to the information bits and frozen bits, some additional shaping bits need to be added at the input of the encoder. represents the set of polarization subchannel numbers that carry the shaped bits.

[0097] Please refer to Figure 2 The transmitting end of the MLC-PCM system adopts the architecture of probability shaping and uses m polarization component encoders, each of which corresponds to a polarization code with a code length of N. The source sequence u is input to each component encoder. k =(u k，1 ,u k，2 , ..., u k，N )According to the collection and They carry the corresponding information bits, frozen bits and shaped bits respectively, and output an N-bit long codeword sequence c k =(c k，1 , c k，2 , ..., c k，N). A bit is taken out from the same position of the m sequences in turn to form N m-dimensional bit vectors, which are then mapped into N modulation symbols according to the set partitioning (SP) mapping rule to form a transmission sequence x and sent to the channel for transmission.

[0098] The receiving end uses a multi-stage decoding (MSD) method. First, based on the received N symbols, the bit soft information of the first polarization component decoder is calculated and sent to the decoder for decoding. The decoding result is then encoded and sent back to the demodulator to assist in calculating the bit soft information of the second polarization component decoder. The above process is carried out in sequence until the decoding of the mth polarization component encoder is completed. Finally, the information bit is extracted from the mN decoded bits as the final output.

[0099] Since MLC-PCM uses SP mapping, under the Maxwell-Boltzmann distribution, the probability of the modulation symbol is mainly 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 the parameter v = 0.01, the probability distribution of the constellation points of 16ASK modulation is as follows: Figure 3 At this time, according to the calculation method of the conditional entropy of the codeword bits corresponding to the polarization component codes, the conditional entropies of the codeword bits corresponding to the four polarization component codes are: H(B 1 )=1,H(B 2 |B 1 )=1, and This shows that the codeword bits of the first polarization component code are equally distributed between 0 and 1, the codeword bits of the third polarization component code are approximately equally distributed between 0 and 1, and only the codeword bits of the fourth polarization component code have a large difference in the probability of taking 0 and 1. Based on this phenomenon, there is a first bit probability shaping scheme for MLC-PCM, that is, by adding shaping bits in the last polarization component encoder to adjust the bit probability of its codeword, the mapped modulation symbol can match the target Maxwell-Boltzmann distribution.

[0100] Of course, this first bit probability shaping scheme can be extended to a more general form: except for 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 determination of the shaped bit can be obtained according to the following method:

[0102] Given the information bits of the MLC-PCM probabilistic shaping system Freeze Bit and forming position The corresponding position sets of the kth polarization component code are:

[0103]

[0104] The kth polar component encoder calculates its codeword bit c according to the codeword sequence output by the previous (k-1) encoder 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 of 1，i , ..., c k-1，i Similarly; Indicates SP mapping; represents an m-dimensional bit vector exist The constellation points under are calculated as shown in the above formula (2). Similarly, for the kth polarization component code, since both the information bits and the frozen bits are known bits, only the shaped bits need to be calculated. Therefore, the likelihood ratio of the codeword bits on the channel side {Λ(c k，i )} to decode the polar code, and then we can get the value of the shaped bit and the coded codeword c k Finally, the codeword bits of the m polar component encoders are sequentially mapped into modulation symbol sequences, which can well match the target Maxwell-Boltzmann distribution.

[0107] Obviously, the performance of the MLC-PCM probabilistic shaping system is very dependent on the selection of information bits and shaping bits. For the defects of the current methods of selecting information bits and shaping bits, please refer to Figure 5 and Figure 6 The embodiment of the present invention provides an information transmission method, which is applied to a sending end and includes:

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

[0109] Step 12: determining the bit position of each component code according to the bit position reliability ranking table and the conditional entropy ranking table corresponding to the first component code, wherein the bit position includes an information bit, a frozen bit and / or a shaped bit;

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

[0111] In the present invention, firstly, the information block to be transmitted, the bit position reliability ranking table and the conditional entropy ranking table corresponding to the first component code are obtained, and the bit position of each component code is determined according to the bit position reliability ranking table and the conditional entropy ranking table corresponding to the first component code. The process is more concise, and finally, according to the information block to be transmitted and the bit position of each component code, a modulation symbol sequence is generated, which has lower complexity and higher flexibility. The information transmission method implemented by the embodiment of the present invention has a lower block error rate. Under the same block error rate, the required minimum signal-to-noise ratio is smaller. While improving the accuracy of signal transmission, the execution difficulty is low, the processing efficiency is fast, and it is more practical.

[0112] In the embodiment of the present invention, the method for constructing probability shaping in information transmission may be executed by a terminal, and the terminal indication includes a transmitting end and a receiving end in the channel transmission process.

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

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

[0115] A bit position reliability ranking table and a conditional entropy ranking table corresponding to the first component code are determined according to the channel state information and the downlink control information.

[0116] In an embodiment of the present invention, the conditional entropy forming conditional entropy sorting table is less difficult to implement and the processing process is faster. The bit position reliability sorting table and the conditional entropy sorting table corresponding to the first component code can be calculated each time the transmission is performed, or can be calculated in advance before the transmission, and the present invention does not impose any restrictions.

[0117] In the embodiment of the present invention, optionally, before the receiving channel state information and downlink control information, the method includes:

[0118] Receive configuration information;

[0119] According to 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 the embodiment of the present invention, before transmission, the terminal physical layer determines what kind of pre-processing operation to apply to the information block to be transmitted according to the configuration information transmitted from the upper layer. Specifically.

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

[0122] The information blocks to be transmitted are segmented, auxiliary bits are added to the information blocks to be transmitted, positions of bits in the information blocks to be transmitted are exchanged, and an interleaving operation is performed on the information blocks to be transmitted.

[0123] Of course, in the embodiment of the present invention, the preprocessing operation includes but is not limited to segmentation, adding additional auxiliary bits, exchanging positions between bits, etc.

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

[0125] Optionally, when the length of the information block to be transmitted exceeds a set threshold, the information block to be transmitted may be divided into a plurality of sub-information blocks of smaller lengths, and the sub-blocks are encoded and modulated respectively.

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

[0127] Optionally, CRC encoding may be performed on the information block, and CRC check bits may be added to assist the receiving end in decoding, thereby improving the accuracy of decoding.

[0128] For example, when using cyclic redundancy check (CRC) coding, let a′=(a′ 1 , a′ 2 , ..., a′ A ) represents the sub-information block obtained after the segmentation operation. Let p = (p 1 , p2 , ..., p L ) represents the CRC check bit sequence, where L is the number of CRC check bits. The check bits are generated by the cyclic generating polynomial g CRCL (D) Generate, where g CRCL (D)=[D L +g L-1 D L-1 +g L-2 D L-2 +…+g 1 D 1 +1], and the coefficients of the polynomial satisfy g L-1 , g L-2 , ..., g 1 ∈{0, 1}. CRC coding is implemented in the form of a systematic code, that is, in a binary finite field (Galois Field of 2, GF(2)), the polynomial a 1 D A′+L-1 +a 2 D A′+L-2 +…+a A′ D L +p 1 D L-1 +p 2 D L-2 +…+p L-1 D 1 +p L Divide by the CRC generator polynomial g CRCL The remainder of (D) is 0. The bit sequence obtained after CRC encoding is expressed as v = (v 1 , v 2 , ..., v K ), where K = A' + L, and:

[0129]

[0130] Optionally, an interleaving operation may be performed on the information blocks to reduce or eliminate the correlation between bits.

[0131] For example, when v=(v 1 , v 2 , ..., v K )When the interleaving operation is used, the output bit sequence is v′=(v′ 1 , v′ 2 , ..., v′ K ), where v′ j =v Π(j), j = 1, 2, ..., K, the interleaving pattern Π is 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 input sequence interleaving.

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

[0133] Further, the parameter determination is completed according to the channel state information and the downlink control information, 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 the embodiment of the present invention, optionally, determining the bit position reliability ranking table and the conditional entropy ranking table corresponding to the first component code according to the channel state information and the downlink control information includes:

[0135] Determining a signal-to-noise ratio of a current channel according to the channel state information;

[0136] Acquire, according to the downlink control information, modulation and coding scheme information adopted for transmitting data, wherein the modulation and coding scheme information at least includes a modulation order and a coding rate;

[0137] Determining the coding length of the component encoder according to the length of the information block to be transmitted and the coding rate;

[0138] Determining a Maxwell-Boltzmann distribution parameter according to the signal-to-noise ratio and the modulation order;

[0139] Determining the number of shaped bits required for each component code according to the Maxwell-Boltzmann distribution parameter and the modulation order;

[0140] Obtaining a bit position reliability ranking table according to the signal-to-noise ratio, the modulation order, the Maxwell-Boltzmann distribution parameter, and the coding length of the component encoder;

[0141] According to the number of shaping bits required for each component code, a conditional entropy sorting table of the first component code is obtained.

[0142] In the embodiment of the present invention, the probability shaping system parameters are determined by the channel state information (CSI) and the downlink control information (DCI), and the bit position reliability ranking table and the conditional entropy ranking table corresponding to the first component code are further determined by the system parameters. Please refer to Figure 8, specifically, it is divided into the following steps.

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

[0144] First, the current channel quality is estimated by detecting CSI to obtain the signal-to-noise ratio (SNR) of the channel. Then, the MCS information used for transmitting data is obtained according to the received DCI. The 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 length of the information block after preprocessing.

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

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

[0147]

[0148] Among them, v * M = 2 is the maximum AWGN channel capacity under the current SNR m The Maxwell-Boltzmann parameters corresponding to the dimensional modulation constellation points. To control an upper limit of the size of the parameter v, it can be preset according to the modulation order m, the signal-to-noise ratio SNR, and the coding rate R.

[0149] Optionally, the parameter v may also be set to a fixed value within a certain signal-to-noise ratio SNR or coding rate R range according to the modulation order m.

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

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

[0152] According to the parameter v, calculate M=2 m The probability of taking values ​​of each constellation point in dimensional modulation is:

[0153]

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

[0155] Calculate the conditional entropy of the codeword bits corresponding to each component code. For the kth component code, the calculation method is:

[0156]

[0157] in, The first k bits of the m-dimensional bit vector corresponding to the modulation symbol are equal to The probability of in, Determined by formula (7); Similarly, B k Indicates 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, Indicates a downward value operation.

[0161] Step D: Finally, according to the signal-to-noise ratio SNR, the modulation order m, the Maxwell-Boltzmann parameter v, and the coding length N of the component encoder, the reliability ranking table Q of the bit position is obtained. mN = {Q 1 , Q 2 , ..., Q mN}.

[0162] Optionally, Q mN It can be determined based on SNR. In order to reduce the actual communication system for Q mN To reduce the amount of computation or storage, a fixed “constructed signal-to-noise ratio dSNR” can be used within a certain SNR range.

[0163] Optionally, the upper limit uSNR and the lower limit lSNR of the given SNR range are used to select the reliability ranking table Q mN The construction signal-to-noise ratio can be set as:

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

[0165] Among them, 0≤α≤1 is the preset coefficient.

[0166] Optionally, the constructed signal-to-noise ratio may also be determined according to a coding rate R indicated in the MCS, for example:

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

[0168] The unit of dSNR is dB, and β is a preset coefficient.

[0169] The selection of depends on the Maxwell-Boltzmann parameter v. Similarly, in order to reduce the amount of calculation and storage in an actual communication system, the parameter v can be determined by referring to the method in step B above.

[0170] According to the number of shaping bits E required for each component code k , get the conditional entropy sorting table of the kth component code It is worth noting that the conditional entropy sorting table only needs to be k ≠0 first component code.

[0171] In the embodiment of the present invention, the reliability ranking table of the bit position and the conditional entropy ranking table corresponding to the first component code are obtained through the conditional entropy and the number of shaping bits required for each component code. The execution difficulty is low, it is easy to implement, and it is more practical.

[0172] In the embodiment of the present invention, optionally, determining the bit position of each component code according to the bit position reliability ranking table and the conditional entropy ranking table corresponding to the first component code includes:

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

[0174] Determining the frozen bits of each component code according to the frozen bits of all component codes;

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

[0176] For the first component code, selecting a second number of bit positions whose conditional entropy is from low to high in the conditional entropy sorting table corresponding to the first component code as forming bits, and the forming bits are located in the bit positions of the first component code except the frozen bits, and the forming bits are used to carry the forming bits;

[0177] Using bit positions other than frozen bits and shaped bits in the bit positions of the first component code as information bits of the first component code, wherein the information bits are used to carry information bits;

[0178] determining a bit position of the first component code according to information bits, frozen bits, and shaped bits of the first component code;

[0179] For the second component code, using bit positions of the second component code except frozen bits as information bits of the second component code;

[0180] The bit position of the second component code is determined according to the information bit and the frozen bit of the second component code.

[0181] In an embodiment of the present invention, a method for 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 is also provided. More specifically, the method mainly includes the following steps.

[0182] Step a: In the embodiment of the present invention, the reliability ranking table Q mN = {Q 1 , Q 2 , ..., Q mN} Arrange the mN bit positions in order of reliability from low to high according to the m component encoders, that is, W(Q 1 )<W(Q 2 )<…W(Q 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 sorting table Arrange them in ascending order according to the conditional entropy corresponding to all N bit positions in the kth component code, that is, 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 code k，j The conditional entropy of bit positions, 1≤P k，i ≤N, 1≤k≤N, 1≤j≤N.

[0184] Optionally, Q mN and It can be obtained by online calculation, that is, directly calculated according to the parameters in the above method without storage. Alternatively, all the required Q mN and Store it and obtain it through query table to avoid repeated calculation.

[0185] Step b: In the present embodiment, select Q mN The first (mN-KE) bit positions in the sorted table are used to carry frozen bits, and all bits satisfying (k-1)N+1≤Q jThe bit positions ≤kN constitute the frozen bit set of the kth polarization component code For the first component code, according to E k And conditional entropy sorting table Select the front E k The conditional entropy is the smallest and is located in the set The bit positions in the The remaining bit positions constitute the information bit set Right now It should be noted that when E k = 0, that is, no shaping bit needs to be added to the second component code.

[0186] The bit position of the first component code is determined according to the information bit, frozen bit and shaped bit of the first component code; the bit position of the second component code is determined according to the information bit and frozen bit of the second component code.

[0187] The bit position determined by the calculation method in the embodiment of the present invention can effectively reduce the bit error rate, improve the system signal reliability, and improve the system performance. Furthermore, the bit position of the component code is selected by querying the table, which is more convenient and can avoid repeated calculations.

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

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

[0190] According to the information block to be transmitted and the bit position of each component code, obtaining an input bit sequence corresponding to each component encoder;

[0191] Obtaining a codeword sequence corresponding to each component code according to an input bit sequence corresponding to each component encoder;

[0192] A modulation symbol sequence to be sent is generated according to the codeword sequence corresponding to each component code.

[0193] First, the embodiment of the present invention provides a method for obtaining an input bit sequence corresponding to each component code, mapping the preprocessed information blocks to the information bits in sequence. Then move the frozen The corresponding bits are set to pre-configured values ​​(known to both the transmitting and receiving ends of 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. The corresponding bit value, specifically:

[0194] In the embodiment of the present invention, optionally, acquiring the input bit sequence corresponding to each component encoder according to the information block to be transmitted and the bit position of each component code includes:

[0195] Mapping the information block to be transmitted to the information bit of each component code in sequence to obtain the information bit of each component code;

[0196] Setting 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] Determine, according to the likelihood ratio of the codeword bits of the first component code, the information bits and the frozen bits, the value of the bit corresponding to the shaping bit of the first component code, and obtain the shaping bit of the first component code;

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

[0199] Specifically, first, the bit sequence v′=(v′ 1 , v′ 2 , ..., v′ K ) is split into m subsequences in The method for determining the subsequence elements is:

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

[0201] Next, starting from the first component code, the shaped bit value of each component code is calculated in sequence, 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 kth component encoder.

[0203] w k Mapped to On, that is in

[0204] Then u k The frozen bit The bits are set to preconfigured 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 , further, according to the codeword sequence output by the first (k-1) component encoders and the set Maxwell-Boltzmann parameter v, the current component codeword bit c is calculated k，i The likelihood ratio Λ(c k，i ), the calculation method is:

[0206]

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

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

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

[0210] In the embodiment of the present invention, the value of the bit corresponding to the shaped bit is calculated according to the likelihood ratio, and the codeword sequence of each component code is obtained by further encoding the polar code, which 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 the modulation symbol sequence to be sent, and one bit is taken out from the same position of the m codeword sequences in turn to form N m-dimensional bit vectors, and then each bit vector is mapped to a modulation symbol, and finally an N modulation symbol sequence x of length is obtained and sent to the channel for transmission. Specifically:

[0212] In the embodiment of the present invention, optionally, generating a modulation symbol sequence to be sent according to a codeword sequence corresponding to each component code includes:

[0213] Sequentially taking out one bit from the same position of the codeword sequence corresponding to each component code to form a fourth number of bit vectors, wherein the fourth number is consistent with the coding length of the component encoder;

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

[0215] First, a bit is taken from the same position of the codeword sequence in turn to form N m-dimensional bit vectors, and then mapped into N modulation symbols according to the modulation mapping rule to form a modulation symbol sequence x=(x 1 , x 2 , ..., x N ) and sent to the channel for transmission. This process can be expressed as:

[0216]

[0217] Among them, x i represents the i-th modulation symbol of x, c k，i Represents codeword c k The i-th bit of , 1≤i≤N.

[0218] The embodiment of the present invention proposes an information transmission method, which uses an implementation method of MLC-PCM probability shaping. In the embodiment of the invention, the terminal physical layer first pre-processes the information block to be transmitted according to the configuration information transmitted by the upper layer. Subsequently, the terminal determines the modulation order and coding rate used in 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 a symbol sequence to be sent.

[0219] Through the above-mentioned invention embodiments, an information transmission method is completed, the practical application of MLC-PCM probability shaping is realized, and the practical value is improved. In addition, the method of determining the shaping bit through the construction table in the embodiment of the present invention has low complexity and higher flexibility, and the amount of calculation and storage space can be reduced by storing the construction table in advance, and the bit error rate can also be reduced. The following provides an embodiment to introduce the test process of the embodiment of the present invention and its performance analysis in detail.

[0220] Take K = 384, SNR = 11dB, 8ASK modulation (modulation order m = 3), R = 1.5, v = 0.041 as an example. The encoding length of the component encoder is N = K / R = 256. According to v and m, the number of shaping bits required for each component code is E 1 =0,E 2 =0 and E 3 =69. Therefore, only the shaping bit needs to be added in the third component code. The bit position reliability ranking table Q 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] In order to determine the frozen bits, information bits and shaped bits of each polarization component code, first query Table 1 and select the first (768-384-69) = 315 bit positions to carry the frozen bits to obtain the frozen bit set: and For the first two polarization component codes, due to E 1 =E 2 =0, so For the third polarization component code, query Table 2 and select the first 69 in the table that are not in The bit positions in The remaining positions

[0229] Please refer to Fig.9A , Fig. 9B and Fig. 9C , respectively, are specific values ​​of the frozen bit, information bit and shaping bit of each polarization component code in the embodiment of the present invention.

[0230] The performance of the final result of the embodiment of the present invention is evaluated below. Fig.10, the coding length N of the component encoder is 256, 8ASK modulation (modulation order m=3) is adopted, and the Maxwell-Boltzmann parameter v=0.041, and the block error rate performance curve of the MLC-PCM probability shaping system during transmission based on the embodiment of the present invention.

[0231] As a comparative scheme, the embodiment of the present invention also provides the block error rate performance curve of the MLC-PCM system without probability shaping. The constellation points in this scheme are evenly and equally distributed. The coding rates R corresponding to the six groups of block error rate performance curves from left to right are 1, 1.25, 1.5, 1.75, 2.0, and 2.25, respectively. The length of the information block after preprocessing is K=NR. According to Fig.10 The results in FIG. 4 show that the MLC-PCM probability shaping system in the embodiment of the present invention has a significant performance advantage over the MLC-PCM system using the traditional uniform equal-probability constellation, that is, it has a lower block error rate at the same signal-to-noise ratio; at the same block error rate, the required minimum signal-to-noise ratio is smaller.

[0232] Please refer to Fig.11 , comparison of simulation performance when Maxwell-Boltzmann parameter v = 0.01. Fig.11 A total of 6 groups of simulation performance curves are given. The coding rates R corresponding to the groups of curves from left to right are 2, 2.25, 2.5, 2.75, 3, and 3.25, respectively, and the information block length after preprocessing K = NR. Similarly, under 16ASK modulation, the MLC-PCM probability shaping system has a significant performance advantage over the MLC-PCM system using the traditional uniform equal probability constellation.

[0233] Of course, it is worth pointing out that QAM modulation is widely used in existing communication systems. 2m The constellation diagram of binary QAM modulation can be seen as two 2 m In order to construct a 2-bit ASK constellation 2m -QAM modulation, MLC-PCM system with N symbols, can use 2 with a component encoder length of 2N m Therefore, the method proposed in the present invention can be directly extended to the case of QAM modulation, can be well compatible with the existing communication system, reduce the difficulty of implementation and deployment cost, and has a wider range of application scenarios.

[0234] Please refer to Fig.12 The embodiment of the present invention provides an information transmission method, which is applied to a receiving end and includes:

[0235] Step 21: receiving a modulation symbol sequence transmitted by a channel;

[0236] Step 22: Obtain a bit position reliability ranking table and a conditional entropy ranking table corresponding to the first component code, wherein the conditional entropy ranking 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: determining the bit position of each component code according to the bit position reliability ranking table and the conditional entropy ranking table corresponding to the first component code, wherein the bit position includes an information bit, a frozen bit and / or a shaped bit;

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

[0239] In the embodiment of the present 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 the accuracy of the decoding result.

[0240] It is worth noting that the bit position reliability ranking table of the receiving end and the conditional entropy ranking table corresponding to the first component code can be calculated by the sending end and the result can be sent to the receiving end. The receiving end can also search the calculated and stored construction table in the database. Of course, the receiving end can also perform online calculation. Specifically:

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

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

[0243] A bit position reliability ranking table and a conditional entropy ranking table corresponding to the first component code are determined according to the channel state information and the downlink control information.

[0244] In the embodiment of the present invention, the robustness of the system can be enhanced through online calculation at the receiving end, thereby avoiding the problem of increased bit error rate caused by errors in the construction table of the sending side.

[0245] In the embodiment of the present 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 of the transmitting end, but also to the decoding process of the receiving end. It is more practical and has a wider application. It can ensure the reliability of transmission from both sending and receiving aspects, reduce the bit error rate, and improve flexibility.

[0246] Please refer to Fig.13 The embodiment of the present application further provides an information transmission system 30, applied to a sending end, comprising:

[0247] An acquisition module 31 is used to acquire an information block to be transmitted, and acquire a bit position reliability ranking table and a conditional entropy ranking table corresponding to the first component code, wherein the conditional entropy ranking table is used to determine a shaped bit in a bit position, and the number of shaped bits of the first component code is greater than or equal to 1;

[0248] A first bit position module 32, configured to determine the bit position of each component code according to the bit position reliability ranking table and the conditional entropy ranking table corresponding to the first component code, wherein the bit position includes an information bit, a frozen bit and / or a shaped bit;

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

[0250] Optionally, the acquisition module 31 includes:

[0251] A first receiving module, used to obtain channel state information and downlink control information;

[0252] A table module is used to determine a bit position reliability ranking table and a conditional entropy ranking table corresponding to the first component code according to the channel state information and the downlink control information.

[0253] In the embodiment of the present application, optionally, the information transmission system 30 further includes:

[0254] A preprocessing module, used for receiving configuration information;

[0255] According to 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] In an embodiment of the present application, optionally, the preprocessing operation includes at least one of the following:

[0257] The information blocks to be transmitted are segmented, auxiliary bits are added to the information blocks to be transmitted, positions of bits in the information blocks to be transmitted are exchanged, and an interleaving operation is performed on the information blocks to be transmitted.

[0258] In the embodiment of the present application, optionally, the table module further includes:

[0259] A table submodule, used to determine the signal-to-noise ratio of the current channel according to the channel state information;

[0260] Acquire, according to the downlink control information, modulation and coding scheme information adopted for transmitting data, wherein the modulation and coding scheme information at least includes a modulation order and a coding rate;

[0261] Determining the coding length of the component encoder according to the length of the information block to be transmitted and the coding rate;

[0262] Determining a Maxwell-Boltzmann distribution parameter according to the signal-to-noise ratio and the modulation order;

[0263] Determining the number of shaped bits required for each component code according to the Maxwell-Boltzmann distribution parameter and the modulation order;

[0264] Obtaining a bit position reliability ranking table according to the signal-to-noise ratio, the modulation order, the Maxwell-Boltzmann distribution parameter, and the coding length of the component encoder;

[0265] According to the number of shaping bits required for each component code, a conditional entropy sorting table of the first component code is obtained.

[0266] In the embodiment of the present application, optionally, the first bit position module 32 further includes:

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

[0268] Determining the frozen bits of each component code according to the frozen bits of all component codes;

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

[0270] For the first component code, selecting a second number of bit positions whose conditional entropy is from low to high in the conditional entropy sorting table corresponding to the first component code as forming bits, and the forming bits are located in the bit positions of the first component code except the frozen bits, and the forming bits are used to carry the forming bits;

[0271] Using bit positions other than frozen bits and shaped bits in the bit positions of the first component code as information bits of the first component code, wherein the information bits are used to carry information bits;

[0272] determining a bit position of the first component code according to information bits, frozen bits, and shaped bits of the first component code;

[0273] For the second component code, using bit positions of the second component code except frozen bits as information bits of the second component code;

[0274] The bit position of the second component code is determined according to the information bit and the frozen bit of the second component code.

[0275] In the embodiment of the present application, optionally, the sequence module 33 further includes:

[0276] A sequence submodule, configured to obtain an input bit sequence corresponding to each component encoder according to the information block to be transmitted and the bit position of each component code;

[0277] Obtaining a codeword sequence corresponding to each component code according to an input bit sequence corresponding to each component encoder;

[0278] A modulation symbol sequence to be sent is generated according to the codeword sequence corresponding to each component code.

[0279] In the embodiment of the present application, optionally, the sequence submodule further includes:

[0280] A mapping module, used for mapping the information block to be transmitted to the information bit of each component code in sequence to obtain the information bit of each component code;

[0281] Setting 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] Determine, according to the likelihood ratio of the codeword bits of the first component code, the information bits and the frozen bits, the value of the bit corresponding to the shaping bit of the first component code, and obtain the shaping bit of the first component code;

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

[0284] In the embodiment of the present application, optionally, the sequence submodule further includes:

[0285] A modulation module, used for sequentially taking out one bit from the same position of the codeword sequence corresponding to each component code to form a fourth number of bit vectors, wherein the fourth number is consistent with the coding length of the component encoder;

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

[0287] The information transmission system provided by the embodiment of the present invention can realize Figures 1 to 11 The various processes implemented by the method embodiment and achieving the same technical effect are not described here to avoid repetition.

[0288] Please refer to Fig.14 The embodiment of the present application further provides an information transmission system 40, which is applied to a receiving end and includes:

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

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

[0291] A second bit position module 43, configured to determine the bit position of each component code according to the bit position reliability ranking table and the conditional entropy ranking table corresponding to the first component code, wherein the bit position includes an information bit, a frozen bit and / or a shaped bit;

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

[0293] In the embodiment of the present application, optionally, the information transmission system 40 further includes:

[0294] An online calculation module, used to obtain channel state information and downlink control information;

[0295] A bit position reliability ranking table and a conditional entropy ranking table corresponding to the first component code are determined according to the channel state information and the downlink control information.

[0296] The information transmission system provided by the embodiment of the present invention can realize Fig.12 The various processes implemented by the method embodiment and achieving the same technical effect are not described here to avoid repetition.

[0297] An embodiment of the present invention provides an electronic device 50, see Fig.15 As shown, Fig.15 This is a principle block diagram of an electronic device 50 according to an embodiment of the present invention, which includes a processor 51, a memory 52, and a program or instruction stored in the memory 52 and executable on the processor 51. When the program or instruction is executed by the processor, the steps in any information transmission method of the present invention are implemented.

[0298] An embodiment of the present invention provides a readable storage medium, on which a program or instruction is stored. When the program or instruction is executed by a processor, the various processes of an embodiment of an information transmission method such as any one of the above-mentioned items are implemented, and the same technical effect can be achieved. To avoid repetition, it will not be repeated here.

[0299] Computer readable media include permanent and non-permanent, removable and non-removable media, and can be implemented by any method or technology to store information. Information can be computer readable instructions, data structures, program modules 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 technology, compact disk read-only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices or any other non-transmission media that can be used to store information that can be accessed by a computing device. As defined herein, computer readable media does not include temporary computer readable media (transitory media), such as modulated data signals and carrier waves.

[0300] It should be noted that, in this article, the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, an element defined by the sentence "comprises a ..." does not exclude the existence of other identical elements in the process, method, article or device including the element.

[0301] The serial numbers of the above embodiments of the present invention are only for description and do not represent the advantages or disadvantages of the embodiments.

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

[0303] The above is only a preferred implementation of the present application. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles of the present application. These improvements and modifications should also be regarded as the scope of protection of the present application.

Claims

1. An information transmission method, applied to a sending end, characterized in that: include: Acquire an information block to be transmitted, acquire a bit position reliability ranking table and a conditional entropy ranking table corresponding to the first component code, wherein the conditional entropy ranking table is used to determine a shaped bit in a bit position, and the number of shaped bits of the first component code is greater than or equal to 1; Determine the bit position of each component code according to the bit position reliability ranking table and the conditional entropy ranking table corresponding to the first component code, wherein the bit position includes an information bit, a frozen bit and / or a shaped bit; A modulation symbol sequence is generated according to the information block to be transmitted and the bit position of each component code.

2. The method according to claim 1, characterized in that The step of obtaining a bit position reliability ranking table and a conditional entropy ranking table corresponding to the first component code includes: Acquire channel state information and downlink control information; A bit position reliability ranking table and a conditional entropy ranking table corresponding to the first component code are determined according to the channel state information and the downlink control information.

3. The method according to claim 1, characterized in that The step of obtaining the information block to be transmitted includes: Receive configuration information; According to the configuration information, a preprocessing operation is performed on the information block to be transmitted to obtain the preprocessed information block to be transmitted.

4. The method according to claim 3, characterized in that The pre-processing operation includes at least one of the following: The information blocks to be transmitted are segmented, auxiliary bits are added to the information blocks to be transmitted, positions of bits in the information blocks to be transmitted are exchanged, and an interleaving operation is performed on the information blocks to be transmitted.

5. The method according to claim 2, characterized in that: The determining, according to the channel state information and the downlink control information, a bit position reliability ranking table and a conditional entropy ranking table corresponding to the first component code comprises: Determining a signal-to-noise ratio of a current channel according to the channel state information; Acquire, according to the downlink control information, modulation and coding scheme information adopted for transmitting data, wherein the modulation and coding scheme information at least includes a modulation order and a coding rate; Determining the coding length of the component encoder according to the length of the information block to be transmitted and the coding rate; Determining a Maxwell-Boltzmann distribution parameter according to the signal-to-noise ratio and the modulation order; Determining the number of shaped bits required for each component code according to the Maxwell-Boltzmann distribution parameter and the modulation order; Obtaining a bit position reliability ranking table according to the signal-to-noise ratio, the modulation order, the Maxwell-Boltzmann distribution parameter, and the coding length of the component encoder; According to the number of shaping bits required for each component code, a conditional entropy sorting table of the first component code is obtained.

6. The method according to claim 1, characterized in that The step of determining the bit position of each component code according to the bit position reliability ranking table and the conditional entropy ranking table corresponding to the first component code comprises: According to the bit position reliability table, a first number of bit positions with reliability from low to high in the bit position reliability table are selected as frozen bits of all component codes, wherein the frozen bits are used to carry frozen bits; Determining the frozen bits of each component code according to the frozen bits of all component codes; According to the number of shaping bits, determine a first component code with a shaping bit number greater than or equal to 1 and a second component code with a shaping bit number of 0; For the first component code, selecting a second number of bit positions whose conditional entropy is from low to high in the conditional entropy sorting table corresponding to the first component code as forming bits, and the forming bits are located in the bit positions of the first component code except the frozen bits, and the forming bits are used to carry the forming bits; Using bit positions other than frozen bits and shaped bits in the bit positions of the first component code as information bits of the first component code, wherein the information bits are used to carry information bits; determining a bit position of the first component code according to information bits, frozen bits, and shaped bits of the first component code; For the second component code, using the bit positions of the second component code except the frozen bits as the information bits of the second component code; The bit position of the second component code is determined according to the information bit and the frozen bit of the second component code.

7. The method according to claim 1, characterized in that Generating a modulation symbol sequence according to the information block to be transmitted and the bit position of each component code includes: According to the information block to be transmitted and the bit position of each component code, obtaining an input bit sequence corresponding to each component encoder; Obtaining a codeword sequence corresponding to each component code according to an input bit sequence corresponding to each component encoder; A modulation symbol sequence to be sent is generated according to the codeword sequence corresponding to each component code.

8. The method according to claim 7, characterized in that The acquiring, according to the information block to be transmitted and the bit position of each component code, an input bit sequence corresponding to each component encoder comprises: Mapping the information block to be transmitted to the information bit of each component code in sequence to obtain the information bit of each component code; Setting the bit corresponding to the frozen bit of each component code to a specified value to obtain the frozen bit of each component code; Determine, according to the likelihood ratio of the codeword bits of the first component code, the information bits and the frozen bits, the value of the bit corresponding to the shaping bit of the first component code, and obtain the shaping bit of the first component code; An input bit sequence corresponding to each component encoder is obtained according to the information bits, the frozen bits and the shaped bits of the first component code.

9. The method according to claim 7, characterized in that: Generating a modulation symbol sequence to be sent according to the codeword sequence corresponding to each component code includes: Sequentially taking out one bit from the same position of the codeword sequence corresponding to each component code to form a fourth number of bit vectors, wherein the fourth number is consistent with the coding length of the component encoder; According to a modulation mapping rule, the fourth number of bit vectors are mapped to a fourth number of modulation symbols, and the fourth number of modulation symbols constitute a modulation symbol sequence.

10. An information transmission method, applied to a receiving end, characterized in that: include: receiving a modulation symbol sequence transmitted by a channel; Obtaining a bit position reliability ranking table and a conditional entropy ranking table corresponding to the first component code, wherein the conditional entropy ranking table is used to determine a shaped bit in a bit position, and the number of shaped bits of the first component code is greater than or equal to 1; Determine the bit position of each component code according to the bit position reliability ranking table and the conditional entropy ranking table corresponding to the first component code, wherein the bit position includes an information bit, a frozen bit and / or a shaped bit; The decoded information bits are obtained according to the modulation symbol sequence and the bit position of each component code.

11. The method according to claim 10, characterized in that Before obtaining the bit position reliability ranking table and the conditional entropy ranking table corresponding to the first component code, the following further comprises: Acquire channel state information and downlink control information; A bit position reliability ranking table and a conditional entropy ranking table corresponding to the first component code are determined according to the channel state information and the downlink control information.

12. An information transmission system, applied to a sending end, characterized in that: include: An acquisition module, used to acquire an information block to be transmitted, and acquire a bit position reliability ranking table and a conditional entropy ranking table corresponding to the first component code, wherein the conditional entropy ranking table is used to determine a shaped bit in a bit position, and the number of shaped bits of the first component code is greater than or equal to 1; A first bit position module, configured to determine a bit position of each component code according to the bit position reliability ranking table and a conditional entropy ranking table corresponding to the first component code, wherein the bit position includes an information bit, a frozen bit and / or a shaped bit; The sequence module is used to generate a modulation symbol sequence according to the information block to be transmitted and the bit position of each component code.

13. An information transmission system, applied to a receiving end, characterized in that: include: A third receiving module, used to receive a modulation symbol sequence transmitted by a channel; A fourth receiving module is used to obtain a bit position reliability ranking table and a conditional entropy ranking table corresponding to the first component code, wherein the conditional entropy ranking table is used to determine a shaped bit in a bit position, and the number of shaped bits of the first component code is greater than or equal to 1; A second bit position module, configured to determine a bit position of each component code according to the bit position reliability ranking table and a conditional entropy ranking table corresponding to the first component code, wherein the bit position includes an information bit, a frozen bit and / or a shaped bit; The decoding module is used to obtain decoded information bits according to the modulation symbol sequence and the bit position of each component code.

14. 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 9; or the program, when executed by the processor, implements the steps of the information transmission method as described in any one of claims 10 or 11.

15. A computer-readable storage medium, characterized in that: A computer program is stored on a computer-readable storage medium, and when the computer program is executed by a processor, the steps of the information transmission method as described in any one of claims 1 to 9 are implemented; or when the program is executed by the processor, the steps of the information transmission method as described in any one of claims 10 or 11 are implemented.

Images