Coded modulation probability shaping method and related device

Abstract

The invention provides a coding modulation probability shaping method and a related device. The coding modulation probability shaping method executed by a transmitter can comprise the following steps: dividing an information bit sequence to be transmitted into a first information bit subsequence and a second information bit subsequence; generating an amplitude bit sequence by polarization transformation based on the first information bit sub-sequence; performing channel coding on the amplitude bit sequence and the second information bit sub-sequence to obtain a code word containing the amplitude bit sequence and the polar bit sequence; and mapping the codeword into a sequence of modulation symbols.

Description

Technical Field

[0001] The present invention relates to the field of mobile communications, and in particular to a coding modulation probability shaping method and related devices. Background Art

[0002] With the commercial deployment of fifth-generation mobile communication systems (5G) and the advancement of research on sixth-generation mobile communication systems (6G), the requirements for transmission rate, spectrum efficiency, and communication reliability in mobile communication systems continue to increase. In this context, the joint optimization of channel coding and modulation techniques has become one of the key technologies for improving system performance.

[0003] The core purpose of channel coding is to introduce redundant information into the original bits, enabling the receiver to detect and correct errors caused by factors such as noise and interference during transmission, thereby improving the reliability of the communication link. Polar codes are the first channel coding scheme theoretically proven to asymptotically reach the Shannon channel capacity in a symmetric binary discrete memory channel. Due to their excellent error correction performance and low complexity, polar codes have been adopted by the 3GPP standard as the coding scheme for 5G control channels, becoming a key component of the next-generation mobile communications standard.

[0004] On the other hand, in order to meet the demand for large bandwidth for high-speed services (such as ultra-high-definition video and augmented reality), improving spectrum utilization has become an important goal of the evolution of mobile communication systems. Among them, high-order constellation modulation technologies (such as 16-QAM, 64-QAM, 256-QAM, etc.) can carry more bits in a single modulation symbol (for example, m In QAM modulation, each modulation symbol can carry m bits, significantly increasing the information transmission rate. QAM stands for Quadrature Amplitude Modulation (QAM). However, as the modulation order m increases, the Euclidean distance between symbols in the modulation constellation decreases, increasing the system's sensitivity to channel noise and interference, and consequently, increasing the bit error rate. Therefore, it is necessary to jointly optimize channel coding and high-order modulation to achieve both high spectral efficiency and reliability. Summary of the Invention

[0005] In view of this, the embodiments of the present disclosure provide a coding modulation probability shaping method and related devices, which can improve the spectral efficiency of signal transmission, give full play to the performance gain brought by probability shaping, and effectively reduce the implementation complexity of the receiving end.

[0006] The coding modulation probability shaping method described in the embodiment of the present disclosure is executed by a transmitter, including: dividing the information bit sequence to be transmitted into a first information bit subsequence and a second information bit subsequence; generating an amplitude bit sequence based on the first information bit subsequence through polarization transformation; channel coding the amplitude bit sequence and the second information bit subsequence to obtain a codeword including an amplitude bit sequence and a polarity bit sequence, wherein the polarity bit sequence includes: the second information bit subsequence and a check sequence; and mapping the codeword into a modulation symbol sequence.

[0007] In an embodiment of the present disclosure, dividing the information bit sequence to be transmitted into a first information bit subsequence and a second information bit subsequence includes: allocating the information bits in the information bit sequence to the first information bit subsequence based on a preset upper limit on the length of the first information bit subsequence; and allocating the unallocated information bits in the information bit sequence to the second information bit subsequence.

[0008] In an embodiment of the present disclosure, generating an amplitude bit sequence based on the first information bit subsequence through polarization transformation includes: dividing the first information bit subsequence of length K1 to obtain a third information bit subsequence of length K3 and a fourth information bit subsequence of length K4, satisfying K1=K3+K4; adding (m-1-β)N-K3 frozen bits to the third information bit subsequence to obtain a first modulation label bit sequence of length (m-1-β)N; wherein m is the modulation order; N is the length of the modulation symbol sequence; β is the predetermined transmission The number of polarization conversion modules included in the machine is determined; βN-M-K4 frozen bits are added to the fourth information bit subsequence to obtain a second modulation label bit sequence of length βN-M; wherein M represents the total number of shaped bits to be added in the preset polarization conversion; the second modulation label bit sequence is divided to obtain β subsequences; the polarization conversion is performed on each of the β subsequences to obtain β label bit sequences of length N; and the first modulation label bit sequence and the β label bit sequences are bit-by-bit combined to obtain an amplitude bit sequence of length (m-1)N.

[0009] In an embodiment of the present disclosure, the above-mentioned coding modulation probability shaping method may further include: before dividing the information bit sequence into the first information bit subsequence and the second information bit subsequence, adding a scrambling index bit to the information bit sequence; and after dividing the information bit sequence into the first information bit subsequence and the second information bit subsequence, determining a pseudo-random scrambling sequence based on the scrambling index bit and performing scrambling processing on the first information bit subsequence using the pseudo-random scrambling sequence; wherein the pseudo-random scrambling sequence is a sequence with the highest similarity between the empirical distribution of the corresponding amplitude sequence and the target probability distribution in the pseudo-random sequence set.

[0010] In an embodiment of the present disclosure, channel coding is performed on the amplitude bit sequence and the second information bit subsequence to obtain a codeword containing the amplitude bit sequence and the polarity bit sequence, including: generating a check bit sequence of length N-K2 based on an amplitude bit sequence of length (m-1)N and a second information bit subsequence of length K2; wherein m is the modulation order; N is the length of the modulation symbol sequence; and combining the second information bit subsequence and the check bit sequence into a polarity bit sequence of length N.

[0011] In an embodiment of the present disclosure, mapping the amplitude bit sequence and the polarity bit sequence into a modulation symbol sequence includes: selecting m-1 bits from the amplitude bit sequence as the first m-1 bits of the target modulation label; selecting 1 bit from the polarity bit sequence as the last bit of the target modulation label; and combining the first m-1 bits and the last bit to obtain the target modulation label; based on a pre-set modulation mapping rule, mapping the target modulation label to a modulation symbol in a modulation symbol set as a modulation symbol in the modulation symbol sequence; and returning to the step of selecting m-1 bits from the amplitude bit sequence as the first m-1 bits of the target modulation label until the modulation symbol sequence of length N is generated; wherein m is the modulation order; and N is the length of the modulation symbol sequence.

[0012] In an embodiment of the present disclosure, mapping the amplitude bit sequence and the polarity bit sequence into a modulation symbol sequence includes: mapping the amplitude bit sequence into an amplitude sequence; mapping each bit in the polarity bit sequence into a binary polarity value to generate a polarity sequence; and bitwise multiplying the amplitude sequence with the corresponding elements in the polarity sequence to obtain a modulation symbol to generate the modulation symbol sequence.

[0013] The coded modulation probability shaping method described in the embodiment of the present disclosure is executed by a receiver, including: demodulating a received modulation symbol sequence to obtain a codeword to be decoded; decoding the codeword to be decoded to obtain an amplitude bit sequence and a second information bit subsequence; restoring the amplitude bit sequence to a first information bit subsequence through an inverse polarization transformation operation on a binary bit domain; and merging the first information bit subsequence and the second information bit subsequence to obtain an information bit sequence.

[0014] Corresponding to the above-mentioned coding modulation probability shaping method, an embodiment of the present disclosure also provides a transmitter, including: a splitter, used to divide the information bit sequence to be transmitted into a first information bit subsequence and a second information bit subsequence; an amplitude distribution matcher, used to generate an amplitude bit sequence based on the first information bit subsequence through polarization transformation; a channel encoder, used to channel encode the amplitude bit sequence and the second information bit subsequence to obtain a codeword containing an amplitude bit sequence and a polarity bit sequence; and a modulation mapper, used to map the codeword into a modulation symbol sequence.

[0015] Corresponding to the above-mentioned coding modulation probability shaping method, an embodiment of the present disclosure also provides a receiver, including: a demodulator, used to demodulate the received modulation symbol sequence to obtain a codeword to be decoded; a channel decoder, used to decode the codeword to obtain an amplitude bit sequence and a second information bit subsequence; an amplitude distribution anti-matcher, used to restore the amplitude bit sequence to a first information bit subsequence through an inverse polarization transformation operation on a binary bit domain; and a multiplexer, used to merge the first information bit subsequence and the second information bit subsequence to obtain an information bit sequence.

[0016] The proposed polarization-based coded modulation probabilistic shaping system architecture utilizes polarization transformation to achieve modulation amplitude distribution matching. This architecture can be cascaded with channel coding in existing communication systems, improving the spectral efficiency of signal transmission and leveraging the performance gains of probabilistic shaping while effectively reducing implementation complexity at the receiving end. Furthermore, this system architecture can be flexibly integrated with any channel coding scheme that utilizes system coding, enhancing system compatibility and making it suitable for mainstream mobile communication systems, including 5G.

[0017] Furthermore, by leveraging the controllable bit distribution characteristics of polarization transformation, precise matching of the modulation symbol probability distribution is achieved at the transmitter. At the receiver, the original information bits are recovered through the inverse polarization transformation structure, eliminating the need for complex anti-matching devices at the receiver. The recovery process is performed through bit-level logic operations, resulting in low computational complexity and a simple implementation structure. This effectively addresses the high implementation complexity of existing distribution matching schemes, such as constant component distribution matching and enumerated sphere shaping, which rely on complex operations such as arithmetic decoding and recursive search at the receiver. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] In order to more clearly illustrate the technical solutions in the present disclosure or related technologies, the following briefly introduces the drawings required for use in the embodiments or related technical descriptions. Obviously, the drawings described below are only embodiments of the present disclosure. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0019] Figure 1 The structure of a communication system to which the coding modulation probability shaping method described in the embodiment of the present disclosure is applicable is shown.

[0020] Figure 2 The embodiment of the present disclosure shows the implementation process of the coding modulation probability shaping method performed by the transmitter.

[0021] Figure 3 The embodiment of the present disclosure shows an implementation process of the coding modulation probability shaping method performed by the receiver.

[0022] Figure 4 The structure of a transmitter for implementing the coded modulation probability shaping method based on polarization transformation described in some embodiments of the present disclosure is shown.

[0023] Figure 5 The specific implementation process of the polarization transformation-based coded modulation probability shaping method performed by the transmitter according to the embodiment of the present disclosure is shown.

[0024] Figure 6 The structure of the amplitude distribution matcher described in an embodiment of the present disclosure is shown.

[0025] Figure 7 The specific implementation process of the amplitude distribution matcher described in the embodiment of the present disclosure converting the input first information bit subsequence into an amplitude bit sequence is shown.

[0026] Figure 8 The structure of a receiver for implementing the coded modulation probability shaping method based on polarization conversion described in an embodiment of the present disclosure is shown.

[0027] Figure 9The specific implementation process of the coded modulation probability shaping method based on polarization transformation performed by the receiver according to the embodiment of the present disclosure is shown.

[0028] Figure 10 The structure of the amplitude distribution anti-matcher described in an embodiment of the present disclosure is shown.

[0029] Figure 11 A more specific schematic diagram of the hardware structure of an electronic device described in some embodiments of the present disclosure is shown. DETAILED DESCRIPTION

[0030] In order to make the objectives, technical solutions and advantages of the present disclosure more clearly understood, the present disclosure is further described in detail below in conjunction with specific embodiments and with reference to the accompanying drawings.

[0031] It should be noted that, unless otherwise defined, the technical terms or scientific terms used in the embodiments of the present disclosure should have the usual meanings understood by people with ordinary skills in the field to which the present disclosure belongs. The "first", "second" and similar words used in the embodiments of the present disclosure do not indicate any order, quantity or importance, but are only used to distinguish different components. "Include" or "comprise" and similar words mean that the elements or objects appearing before the word include the elements or objects listed after the word and their equivalents, without excluding other elements or objects. "Connect" or "connected" and similar words are not limited to physical or mechanical connections, but may include electrical connections, whether direct or indirect. "Up", "down", "left", "right" and the like are only used to indicate relative position relationships. When the absolute position of the described object changes, the relative position relationship may also change accordingly.

[0032] It is understandable that before using the technical solutions of each embodiment of the present disclosure, the type, scope of use, usage scenarios, etc. of the personal information involved will be informed to the user in an appropriate manner, and the user's authorization will be obtained.

[0033] For example, in response to a user's active request, a prompt message is sent to the user to clearly inform the user that the requested operation will require the acquisition and use of the user's personal information. This allows the user to independently choose whether to provide personal information to the electronic device, application, server, storage medium, or other software or hardware that performs the operation of the disclosed technical solution based on the prompt message.

[0034] As an optional but non-limiting implementation, in response to receiving a user's active request, the prompt information may be sent to the user in the form of a pop-up window, in which the prompt information may be presented in text form. Furthermore, the pop-up window may also contain a selection control for the user to select "agree" or "disagree" to provide personal information to the electronic device.

[0035] It is understandable that the above notification and user authorization process are merely illustrative and do not constitute a limitation on the implementation of the present disclosure. Other methods that comply with relevant laws and regulations may also be applied to the implementation of the present disclosure.

[0036] As mentioned earlier, with the commercial deployment of 5G and the advancement of 6G research, the requirements of mobile communication systems for transmission rate, spectrum efficiency and communication reliability are constantly increasing. Therefore, it is necessary to jointly optimize channel coding and high-order modulation to achieve both high spectrum efficiency and reliability.

[0037] Under traditional high-order modulation methods, all symbols in the modulation constellation are transmitted with equal probability, but this uniform input distribution is not optimal in the actual channel, resulting in a significant gap between system performance and channel capacity. For example, under the Additive White Gaussian Noise (AWGN) channel, the optimal input distribution of the channel is a Gaussian distribution, and the capacity loss using a uniform distribution can reach about 1.53dB. In order to further approach the Shannon limit, Probabilistic Constellation Shaping technology came into being. Constellation probability shaping technology adjusts the transmission probability of different symbols so that the actual input distribution is closer to the optimal input distribution of the channel (such as Gaussian distribution), thereby reducing the required signal-to-noise ratio without increasing the bandwidth or transmission power, thereby obtaining a "shaping gain". Theoretical and experimental studies have shown that probability shaping can effectively improve the spectral efficiency and reliability of high-order modulation systems,

[0038] Despite the significant advantages of probabilistic shaping technology, its application in practical mobile communication systems still faces numerous challenges. For one thing, current systems generally employ coding schemes such as polar codes or low-density parity-check (LDPC) codes. Further research is needed to organically integrate probabilistic shaping with existing physical layer coding architectures without changing them. Furthermore, terminal devices impose strict constraints on computational complexity and power consumption. Therefore, the design of probabilistic shaping must balance performance gains, implementation complexity, and standard compatibility to meet actual deployment requirements.

[0039] In recent years, modulation schemes combining multilevel coding (MLC) with polar codes have become a mainstream approach to achieving probabilistic representation. However, since MLC-based probabilistic shaping schemes are typically designed based on polar codes, their shaping and coding process is closely dependent on the structural characteristics of polar codes. Consequently, the design methods for these schemes are still unclear when applied to other types of channel coding, especially the LDPC codes currently widely adopted in 5G NR, making direct migration and reuse difficult. Consequently, their scalability and compatibility are poor.

[0040] Probabilistic Amplitude Shaping (PAS) is another major technical approach for achieving constellation probabilistic shaping. Compared to the MLC scheme, PAS requires only an additional amplitude distribution matcher before the channel encoder, with the receiver performing the corresponding inverse operation. It is independent of the specific channel coding scheme, requiring only the system encoder. Therefore, PAS is easier to integrate with the 5G channel coding architecture. However, these methods still face significant challenges in terms of computational complexity and resource utilization, limiting their widespread application in communication systems.

[0041] In addition, Constant Composition Distribution Matching (CCDM) is a distribution matching method with fixed-length, reversible mapping. CCDM outputs stable statistical distribution of symbols under fixed composition conditions, allowing precise control of amplitude probability. However, when the code length is short, CCDM suffers from coding rate loss. Furthermore, CCDM's inverse mapping process is based on an arithmetic coding algorithm, which involves multiple high-precision numerical operations and high computational complexity, hindering the implementation of low latency and low power consumption at the receiving end.

[0042] Furthermore, to improve the efficiency of the distribution matcher and reduce the entropy loss caused by code length, the Enumerative Sphere Shaping (ESS) method has been proposed in recent years. Compared to CCDM, ESS offers lower rate loss under limited code lengths. However, ESS requires enumeration or recursive calculation of the space of legal symbol sequences that satisfy energy constraints during encoding and decoding, resulting in complex encoding logic. Furthermore, using table lookup or prefix code schemes for acceleration requires pre-storage of large-scale mapping tables, increasing system storage resources.

[0043] From this, it can be seen that there is still an urgent need to propose a probabilistic shaping method that is highly compatible with the channel coding scheme, has low implementation complexity and good shaping gain, so as to fully unleash the potential of the joint design of high-order modulation and channel coding and provide high spectral efficiency and high reliability transmission solutions for future mobile communication systems such as 6G.

[0044] In view of the problems of the above-mentioned probability shaping technology, the embodiments of the present disclosure propose a coding modulation probability shaping method, which can improve the spectrum efficiency of signal transmission, give full play to the performance gain brought by probability shaping, and effectively reduce the implementation complexity of the receiving end.

[0045] The core technical features of the embodiments of the present disclosure may include: introducing an amplitude distribution matching structure based on polarization transformation at the transmitting end, and jointly designing the above-mentioned distribution matching module and the channel coding module. The above-mentioned structure can be flexibly integrated with existing system coding methods (such as polar codes, LDPC codes, Turbo codes, and convolutional codes, etc.) and has good system compatibility. At the receiving end, the received sequence is first demodulated and channel decoded to recover the amplitude bit sequence. The receiver can use the prior structure information in the polarization transformation to assist channel decoding and improve the decoding performance. After the channel decoding is completed, the recovered amplitude bit sequence can be directly restored to the original information bit sequence through the amplitude distribution anti-matching structure based on the inverse polarization transformation. This process only relies on bit-level logical operations, avoiding high-complexity operations such as arithmetic decoders, large-scale table lookups, or recursive searches used in traditional probability amplitude shaping schemes, greatly simplifying the data processing flow at the receiving end.

[0046] The embodiments of the present disclosure will be described in detail below with reference to the accompanying drawings and specific examples.

[0047] First, the coding modulation probability shaping method described in the embodiment of the present disclosure is applicable to the channel coding and modulation transmission process in the physical layer of the communication system, and is particularly applicable to the probability shaping communication system scenario that requires both high spectrum efficiency and low complexity receiver. Figure 1 The structure of the communication system to which the coding modulation probability shaping method described in the embodiment of the present disclosure is applicable is shown. Figure 1 As shown, the communication system to which the above-mentioned coded modulation probability shaping method is applicable may include: a transmitter 110, a communication network 120, and a receiver 130. In some embodiments of the present disclosure, the above-mentioned communication network 120 may generally refer to a wireless communication network.

[0048] In some embodiments of the present disclosure, the coded modulation probability shaping method performed by the transmitter 110 may be as follows: Figure 2 As shown, the following steps may be included.

[0049] In step 210, the information bit sequence to be transmitted is divided into a first information bit subsequence and a second information bit subsequence.

[0050] In step 220, an amplitude bit sequence is generated based on the first information bit subsequence through polarization transformation.

[0051] Specifically, in the embodiments of the present disclosure, an amplitude bit sequence close to the target amplitude distribution can be generated by adding an appropriate amount of redundant bits and achieving probability matching of the amplitude distribution during the polarization transformation process.

[0052] In step 230, channel coding is performed on the amplitude bit sequence and the second information bit subsequence to obtain a codeword including the amplitude bit sequence and the polarity bit sequence.

[0053] Specifically, in some embodiments of the present disclosure, the polarity bit sequence may include: a second information bit subsequence and a check sequence.

[0054] At step 240, the codeword is mapped into a modulation symbol sequence.

[0055] Specifically, in the embodiment of the present disclosure, the above-mentioned modulation symbol sequence can be used as the output signal of the transmitter 110.

[0056] In some embodiments of the present disclosure, the coded modulation probability shaping method performed by the receiver 130 may be as follows: Figure 3 As shown, it includes the following steps.

[0057] In step 310, the received modulation symbol sequence is demodulated to obtain a codeword to be decoded.

[0058] In step 320, the codeword to be decoded is decoded, and an amplitude bit sequence and a second information bit subsequence are output.

[0059] In step 330, the amplitude bit sequence is restored to a first information bit subsequence through polarization transformation.

[0060] In step 340, the first information bit subsequence and the second information bit subsequence are combined to restore the information bit sequence.

[0061] The embodiments of the present disclosure will be described in detail below with reference to the accompanying drawings and specific examples.

[0062] To more clearly illustrate the technical solution of the embodiment of the present disclosure, the specific parameters involved in the embodiment of the present disclosure are first described in detail. It should be noted that the specific parameters described below are only for exemplary purposes.

[0063] In the embodiments of the present disclosure, the length of the information bit sequence to be transmitted is set to K, and the length of the modulation symbol sequence to be sent is N. Based on this, the coding rate of the communication system can be determined as R = K / N (unit: bits / channel use). In some embodiments of the present disclosure, the modulation method used by the transmitter can be 2 mAmplitude Shift Keying (ASK) modulation, where m is the modulation order. m The value set of the modulation symbol of binary ASK modulation can be recorded as The corresponding amplitude set can be recorded as

[0064] It can be understood that m bits The modulation mapping rule between the modulation label and the modulation symbol can be recorded as The mapping relationship represented by this mapping rule can be expressed as in, Represents a one-to-one mapping. Without loss of generality, assume that the first m-1 bits of the modulation tag Determines the amplitude of the modulation symbol, then the last bit b of the modulation tag m Determines the polarity of the modulation symbol. In addition, the mapping relationship between the modulation label and the amplitude can be further defined, which can be recorded as in, Since without loss of generality, the first m-1 bits of the modulation tag Determines the amplitude of the modulation symbol. Therefore, the mapping relationship between the modulation label and the amplitude may only involve the first m-1 bits of the modulation label.

[0065] In the embodiment of the present disclosure, the target probability distribution of the modulation symbols can be expressed as {P X (x)}, the target probability distribution of the amplitude can be {P A (a)}. It can be understood that the target probability distribution of the modulation symbol and the target probability distribution of the amplitude usually satisfy P A (a) = 2P X (x). In addition, the average energy of the modulation symbol can be expressed as:

[0066]

[0067] Where θ is the scaling factor that controls the average energy of the modulation symbols. It can be seen that by setting the specific value of θ, the overall transmit power level can be flexibly adjusted.

[0068] It should be noted that the coding modulation structure proposed in the embodiment of the present disclosure is mainly described and designed for ASK modulation. Since the quadrature amplitude modulation (QAM) widely used in communication systems can be regarded as a combination structure of two independent ASK modulations (corresponding to the in-phase component I and the quadrature component Q respectively), the amplitude distribution matching and coding joint design mechanism in the embodiment of the present disclosure has good structural versatility and can be directly extended to QAM without making substantial changes to the core algorithm structure, thereby achieving support and adaptation for mainstream modulation methods. For example, in some embodiments, the modulation method adopted by the transmitter can also be 2 m Base QAM, that is, 2 m -QAM.

[0069] In combination with the above specific parameters, the structures and specific operation processes of the transmitter and receiver will be further described in detail below with reference to examples and drawings.

[0070] Some embodiments of the present disclosure provide a transmitter structure that can implement a polarization-based coded modulation probability shaping method. In these embodiments, by introducing a polarization-based coded modulation mechanism at the transmitter, the amplitude distribution of modulation symbols can be matched. Furthermore, by co-designing the coded modulation system with a channel encoder, both the reliability and spectral efficiency can be improved.

[0071] Figure 4 The structure of the transmitter for implementing the coded modulation probability shaping method based on polarization conversion according to the embodiment of the present disclosure is shown. Figure 4 As shown, the transmitter implementing the polarization-based coded modulation probability shaping method may include: a splitter 410, an amplitude distribution matcher 420, a channel encoder 430, and a modulation mapper 440. In some embodiments of the present disclosure, the transmitter may further include: a scrambling index embedding module 405 and a scrambling module 415. In other embodiments of the present disclosure, the transmitter may further include: a pre-processing module 425.

[0072] Figure 5 The specific implementation process of the coding modulation probability shaping method based on polarization transformation performed by the transmitter according to the embodiment of the present disclosure is shown. Figure 5 As shown, the above-mentioned coded modulation probability shaping method based on polarization transformation performed by the transmitter may specifically include the following steps.

[0073] In step 510 , the information bit sequence to be transmitted is divided into a first information bit subsequence and a second information bit subsequence by the splitter 410 .

[0074] In the embodiment of the present disclosure, assuming that the length of the information bit sequence to be sent is K, the length of the first information bit subsequence is K1, and the length of the second information bit subsequence is K2, then K=K1+K2 can be satisfied.

[0075] In some embodiments of the present disclosure, a partitioning strategy that can be adopted by the above-mentioned splitter 410 may include: allocating information bits in the information bit sequence to the first information bit subsequence based on a pre-set upper limit on the length of the first information bit subsequence; and allocating unallocated information bits in the information bit sequence to the second information bit subsequence. It can be seen that by preferentially allocating the first information bit subsequence, the number of input bits subsequently participating in the channel coding portion can be effectively reduced while meeting the input requirements of the amplitude distribution matcher 420, thereby reducing the actual code rate of the channel coding and improving the error correction capability of the channel coding. It should be noted that in the process of preferentially allocating information bits in the information bit sequence to the first information bit subsequence, the information bits allocated to the first information bit subsequence can be selected from the information bit sequence in any manner according to the above-mentioned upper limit on the length. The number of selected information bits can be equal to the above-mentioned upper limit on the length. In addition, in the process of selecting information bits, selection can be carried out in a sequential manner or according to a pre-set rule, and the embodiments of the present disclosure do not limit the specific method for selecting information bits.

[0076] Optionally, in some embodiments of the present disclosure, the upper limit of the length of the first information bit subsequence can be set to (m-1)NM. Wherein, M can represent the total number of shaped bits required to be input by the predefined amplitude distribution matcher 420. N and m are both the aforementioned parameters. Wherein, N can be the length of the modulation symbol sequence to be sent; m can be the modulation order of the modulation method adopted by the modulation mapper 440 (for example, the 2 m m in the binary ASK modulation method).

[0077] Optionally, in some embodiments of the present disclosure, a scrambling operation may be further performed on the information bit sequence to be transmitted. The scrambling operation may specifically include two operations: one is to add a scrambling index bit to the information bit sequence before performing the branching operation; the other is to perform scrambling processing on the first information bit subsequence after performing the branching operation.

[0078] Specifically, the operation of adding the scrambling index bit can be performed by adding the scrambling index bit to the information bit sequence to be sent through the scrambling index embedding module 405. The length of the scrambling index bit can be K SCR, whose value can be used to indicate the index of the pseudo-random scrambling sequence used in the subsequent scrambling operation. In some embodiments, the above-mentioned scrambling index bit can be a binary representation of the index of the pseudo-random scrambling sequence. Based on this, it can be understood that the index of the pseudo-random scrambling sequence can be first determined based on the scrambling index bit, and further based on the index of the pseudo-random scrambling sequence, the pseudo-random scrambling sequence used when scrambling the information bit sequence can be directly determined. The setting of the above-mentioned scrambling index bit facilitates the flexible selection and synchronous configuration of the pseudo-random scrambling sequence. It should be noted that the above-mentioned scrambling index bit usually only plays a placeholder role in the above-mentioned step 510. It can be seen from this that when the scrambling operation is enabled, the length of the information bit sequence will be extended to K ′ =K+K SCR Therefore, in the above embodiments, after being divided by the splitter 410, the lengths of the first information bit subsequence and the second information bit subsequence obtained should satisfy K ′ =K1+K2.

[0079] In step 520 , the first information bit subsequence is input into the amplitude distribution matcher 420 , and the amplitude distribution matcher 420 generates an amplitude bit sequence based on the input first information bit subsequence through polarization transformation.

[0080] In the embodiment of the present disclosure, the length of the amplitude bit sequence is (m-1) N. The specific method of generating the amplitude bit sequence based on the input first information bit subsequence through polarization transformation will be described in detail in subsequent embodiments and will not be described here for the time being.

[0081] As mentioned above, optionally, in some embodiments of the present disclosure, before dividing the information bit sequence into the first information bit subsequence and the second information bit subsequence, a scrambling index bit may be added to the information bit sequence. In this case, before executing the above step 520, the first information bit subsequence may also be scrambled. Specifically, it includes: first, determining a pseudo-random scrambling sequence based on the scrambling index bit (which may include: first determining the index of the pseudo-random scrambling sequence based on the scrambling index bit, and further determining the pseudo-random scrambling sequence based on the index of the pseudo-random scrambling sequence); then, using the determined pseudo-random scrambling sequence to perform scrambling processing on the first information bit subsequence. It should be noted that the length of the determined pseudo-random scrambling sequence should be the same as the length of the first information bit subsequence, for example, the length is the same as K1. Specifically, the above scrambling processing may include: using the determined pseudo-random scrambling sequence to perform a bit-level exclusive OR operation (that is, a bit-by-bit modulo 2 addition operation) on the first information bit subsequence to generate a scrambled first information bit subsequence. Furthermore, in some embodiments, if the first information bit subsequence includes a scrambling index bit, to ensure the recoverability of the pseudo-random scrambling sequence and receiver synchronization, the scrambling operation does not perform an exclusive-OR operation on the scrambling index bit. That is, only the remaining bits excluding the scrambling index bit are scrambled to ensure that the index of the pseudo-random scrambling sequence can be correctly restored at the receiver.

[0082] Furthermore, in an embodiment of the present disclosure, the pseudo-random scrambling sequence may be a sequence in a pre-generated set of pseudo-random sequences that has the highest similarity between the empirical distribution of the corresponding amplitude sequence and a pre-set target probability distribution. The pseudo-random sequence set may be a set consisting of pseudo-random scrambling sequences of length K1. Alternatively, in some embodiments of the present disclosure, the pseudo-random scrambling sequences in the pseudo-random sequence set may be selected from pseudo-random sequences commonly used in communication systems, such as Gold sequences, m sequences, and Scrambler sequences.

[0083] In addition, each pseudo-random scrambling sequence in the above pseudo-random sequence set can be respectively associated with an index i SCR One-to-one correspondence, that is, any pseudo-random scrambling sequence can be represented by an index i SCR Uniquely determine. Set the above index i SCR The value range is 0≤i SCR <M SCR , where M SCR represents the number of pseudo-random scrambling sequences contained in the above pseudo-random sequence set. Therefore, in some embodiments, the above length K can be scr The scrambling index bits are set to the binary representation of the above index. Therefore, the number of pseudo-random scrambling sequences M contained in the above pseudo-random sequence set is SCRShould satisfy

[0084] In addition, some embodiments of the present disclosure may use the Kullback-Leibler divergence (KL divergence) to calculate the empirical distribution (Empirical Distribution) of the amplitude sequence corresponding to the pseudo-random scrambling sequence. The similarity between the target amplitude probability distribution P is quantitatively evaluated, which is defined as in, represents the empirical probability of a symbol with amplitude a in the sequence; P(a) represents the target probability of a symbol with amplitude a in the sequence, where Empirical distribution of amplitude sequence corresponding to pseudo-random scrambling sequence The smaller the KL divergence between the amplitude sequence and the target amplitude probability distribution P, the higher the similarity between the two. Therefore, the pseudo-random scrambling sequence used in the scrambling operation is the sequence with the smallest KL divergence between the empirical distribution of the corresponding amplitude sequence in the pre-generated pseudo-random sequence set and the pre-set target probability distribution.

[0085] In order to determine the empirical distribution of the amplitude sequence corresponding to the above-mentioned pseudo-random scrambling sequence, each pseudo-random scrambling sequence in the above-mentioned pseudo-random sequence set is used to perform scrambling operations on the first information bit subsequence respectively to obtain multiple scrambled candidate first information bit subsequences. Next, each candidate first information bit subsequence is input into the amplitude distribution matcher 420, and the amplitude distribution matcher 420 generates multiple candidate amplitude bit sequences based on the input candidate first information bit subsequence through polarization transformation. As mentioned above, the length of the above-mentioned candidate amplitude bit sequence is (m-1)N. Next, based on the pre-set mapping relationship between the modulation label and the amplitude in, The above multiple candidate amplitude bit sequences can be mapped to multiple candidate amplitude sequences of length N. Specifically, for each candidate amplitude bit sequence of length (m-1)N, it can be divided into (m-1) label bit sequences of length N. Then, in order, one bit is extracted from each of the (m-1) label bit sequences of length N to form the first (m-1) bits of the modulation label. In this way, we can get the first (m-1) bits of N modulation labels. Finally, we use the mapping relationship between the modulation label and the amplitude Map the first (m-1) bits of the N modulation labels to amplitudes respectively, thus obtaining a candidate amplitude sequence of length N. It can be understood that the above candidate amplitude sequence is in the amplitude set The distribution on is usually non-uniform. Assuming that the number of symbols with amplitude value a in the generated candidate amplitude sequence is N(a), it should satisfy Thus, the empirical probability of a symbol with amplitude a in the candidate amplitude sequence can be expressed as: Next, based on the empirical probability of the symbol with amplitude a in the sequence and the preset target probability of the symbol with amplitude a in the sequence, the empirical distribution (Empirical Distribution) of the amplitude sequence corresponding to each pseudo-random scrambling sequence in the pseudo-random sequence set can be obtained. The KL divergence between the two probability distributions is used as a measure of similarity. Finally, the pseudo-random scrambling sequence with the smallest KL divergence is selected as the pseudo-random scrambling sequence used in this scrambling operation, and the binary representation of its index is used as the scrambling index bit to be added to the information bit sequence before performing the branching operation.

[0086] In step 530, the amplitude bit sequence output by the amplitude distribution matcher 420 and the second information bit subsequence are sent to the channel encoder 430 for channel coding to obtain an amplitude bit sequence and a polarity bit sequence.

[0087] In the embodiment of the present disclosure, due to the use of a systematic coding method, the output codeword contains the original content of the input information bits, namely the amplitude bit sequence (length is (m-1)N) and the second information bit subsequence (length is K2). The remaining N-K2 bits in the above codeword are the check bit sequence. Furthermore, the above check bit sequence and the second information bit subsequence together constitute a polarity bit sequence of length N. The bit distribution in the above polarity bit sequence approaches a uniform distribution, so that when it is subsequently mapped to the modulation symbol polarity (i.e., positive and negative symbols), the symmetry of the modulated signal in the overall statistical characteristics is achieved. In the embodiment of the present disclosure, the total length of the codeword output by the above channel encoder 430 can be mN bits, and the corresponding encoding rate is R FEC =((m-1)N+K2) / mN.

[0088] Optionally, the channel coding method used in the embodiments of the present disclosure may include: polar code (Polar Code), low-density parity check code (LDPC), turbo code, convolutional code, etc. The specific channel coding method can be flexibly selected according to the communication scenario, system requirements, complexity constraints or performance indicators, and the embodiments of the present disclosure are not limited to this.

[0089] In step 540 , the amplitude bit sequence and the polarity bit sequence are jointly mapped into a modulation symbol sequence by the modulation mapper 440 .

[0090] Optionally, in some embodiments of the present disclosure, a combined mapping method based on modulation tag bits can be used: each time m-1 bits corresponding to a certain amplitude are selected from the amplitude bit sequence as the first m-1 bits of the modulation tag, and 1 bit is selected from the polarity bit sequence as the last bit of the modulation tag, and the combination forms a complete modulation tag. Then, according to the modulation mapping rule Map the modulation label to a set of modulation symbols A modulation symbol in . And so on, a modulation symbol sequence of length N is finally generated. Specifically, in the process of selecting m-1 bits corresponding to a certain amplitude from the amplitude bit sequence as the first m-1 bits of the modulation label, the amplitude bit sequence of length (m-1)N can be first divided into (m-1) label bit sequences of length N; next, one bit is extracted from each of the (m-1) label bit sequences of length N in order to form the first (m-1) bits of the modulation label. In this way, the first (m-1) bits of N modulation labels can be obtained.

[0091] Optionally, in some other embodiments of the present disclosure, a decoupled mapping method may also be adopted: first, the amplitude bit sequence is mapped to an amplitude sequence of length N based on the mapping relationship ψ between the modulation label and the amplitude; then, each bit in the polarity bit sequence is mapped to a binary polarity value (±1) to form a polarity sequence. Next, the corresponding elements in the amplitude sequence and the polarity sequence are combined bit by bit into modulation symbols, that is, each modulation symbol is obtained by multiplying an amplitude value and a polarity symbol. The modulation symbol sequence finally generated also has a length of N. Specifically, in the process of mapping the amplitude bit sequence to an amplitude sequence of length N based on the mapping relationship ψ between the modulation label and the amplitude, the amplitude bit sequence of length (m-1)N can be first divided into (m-1) label bit sequences of length N. Next, one bit is extracted from each of the (m-1) label bit sequences of length N in order to form the first (m-1) bits of the modulation label. In this way, we can get the first (m-1) bits of N modulation labels. Finally, we use the mapping relationship between the modulation label and the amplitude The first (m-1) bits of the N modulation labels are respectively mapped to amplitudes, thereby obtaining an amplitude sequence with a length of N.

[0092] Furthermore, as previously mentioned, in some other embodiments of the present disclosure, the transmitter may further include a preprocessing module 425. The preprocessing module 425 may perform preprocessing operations on the information bit sequence before performing scrambling or splitting operations on the information bit sequence. In some embodiments of the present disclosure, the preprocessing operations include, but are not limited to, segmenting the information bit sequence, appending cyclic redundancy check (CRC) bits, adding parity check bits, inserting synchronization identifiers, or performing bit rearrangement, or any combination thereof. The preprocessing operations are intended to enhance the system's coding robustness, error detection capability, or overall transmission performance, and their specific implementation can be flexibly configured according to system design requirements.

[0093] Some embodiments of the present disclosure also provide an implementation of an amplitude distribution matcher. This solution uses a polarization conversion structure to regulate the probability distribution of the amplitude corresponding to each modulation tag bit, so that the actual distribution of the modulation symbol amplitude is closer to the pre-set target probability distribution, thereby achieving high-performance symbol probability shaping. Therefore, in the embodiments of the present disclosure, the amplitude distribution matcher can also be referred to as a polarization conversion-based amplitude distribution matcher. Figure 6 The structure of the amplitude distribution matcher described in the embodiment of the present disclosure is shown. Figure 6 As shown, the amplitude distribution matcher may include: a first branching module 610 , a first frozen bit embedding module 620 , a second frozen bit embedding module 630 , a second branching module 640 , β polarization conversion modules 650 and a multiplexer 660 .

[0094] Before executing the above step of converting the input first information bit subsequence into an amplitude bit sequence, it is necessary to pre-set parameters of the amplitude distribution matcher.

[0095] In some embodiments of the present disclosure, the amplitude distribution matcher may employ β polarization conversion modules 650. The polarization conversion modules 650 are configured to perform a shaping operation on a portion of the bit distribution of the m-1 bits corresponding to the modulation symbol amplitude, thereby achieving an approximate design goal for the amplitude probability distribution.

[0096] In some embodiments of the present disclosure, the number β of the polarization conversion modules can be determined as follows. Based on the mapping relationship ψ between the modulation label and the amplitude and the pre-set target amplitude probability distribution P, the joint probability of the modulation label can be further derived. Where 1≤k≤m-1. And calculate each modulation label B accordingly k The (conditional) entropy of: Among them, B k It can be used to represent the random variable corresponding to the kth modulation label; It can be used to represent the random variables corresponding to the 1st to kth modulation labels. In addition, the observed value or specific value of the kth modulation label can be expressed as b k Indicates that the observed values ​​or specific values ​​of the 1st to kth modulation labels can be used In particular, when k = 1, Based on the pre-set threshold parameter ε∈[0,1], if there is a modulation label B k satisfy The modulated tags are considered to have a non-uniform distribution characteristic and need to be probabilistically shaped by the polarization conversion module. Finally, all the modulated tags that meet the above conditions are counted, and the number of modulated tags obtained is the number of polarization conversion modules required, β.

[0097] In addition, polarization transformation recursively converts a set of uncoded bit sequences of length N into codewords of the same length N. Under the shaping operation, the uncoded bit sequence includes not only information bits and frozen bits, but also shaping bits used to control the probability distribution of codeword bits. For the k-th polarization transformation module, let M k is the number of shaped bits in its uncoded bit sequence, denoted by S k is the corresponding shaped bit position set. is the total number of shaped bits required for polarization conversion.

[0098] Optionally, in some embodiments, M k One way to determine can be: Among them, the operator Represents the floor operation.

[0099] Optionally, in some embodiments, the shaping bit set S k Optional conditional entropy The lowest position, i.e. the uncoded bit U i In a given preamble bit And the existing label bit sequence X (1) ,X (2) ,…,X (k-1) The above conditional entropy can be numerically calculated using the density evolution method, or approximated based on the Bhattacharyya parameter, or other alternative calculation methods can be used.

[0100] Optionally, the shaping bit set S k It can also be determined based on the polarization sequence generation method in the 5G communication system. The specific method is: in the reliability ranking of the polarization sequence, select the M with the lowest ranking. kbit positions (i.e., the highest reliability), and ensure that their position indexes do not exceed the code length N to form a shaped bit set.

[0101] Figure 7 The specific implementation process of the amplitude distribution matcher according to the embodiment of the present disclosure converting the input first information bit subsequence into an amplitude bit sequence is shown. Figure 7 As shown, the above method may include the following steps.

[0102] In step 710, the first information bit subsequence input to the amplitude distribution matcher, whose length is K1, is divided by the first splitter 610 to obtain a third information bit subsequence of length K3 and a fourth information bit subsequence of length K4, and K1 = K3 + K4. In addition, 0 ≤ K4 ≤ βN-M and 0 ≤ K3 ≤ (m-1-β)NM.

[0103] Optionally, in an embodiment of the present disclosure, a division strategy adopted by the first splitter 610 includes: preferentially allocating information bits to the fourth information bit subsequence, and after the fourth information bit subsequence reaches the upper limit of length βN-M, allocating the remaining information bits to the third information bit subsequence. That is:

[0104]

[0105] And, K3=K1-K4.

[0106] In step 720, the first frozen bit embedding module 620 adds (m-1-β)N-K3 frozen bits to the third information bit subsequence to obtain a first sequence with a length of (m-1-β)N.

[0107] In the embodiment of the present disclosure, the first sequence of length (m-1-β)N can be divided into (m-1-β) tag bit sequences according to a pre-set structure, which are respectively denoted as X (1) ,X (2) ,…,X (m-1-β) , where the length of each tag bit sequence is N.

[0108] In step 730, the second frozen bit embedding module 630 adds (βN-M-K4) frozen bits to the fourth information bit subsequence to obtain a second sequence with a length of J=βN-M.

[0109] It should be noted that the value of the frozen bit is preset in advance and is known in both the transmitter and the receiver.

[0110] In step 740, the second sequence is sent to the second branching module 640 for division to obtain β subsequences.

[0111] In the embodiment of the present disclosure, the length of the k-th subsequence is J k =(NM k ), where m-β≤k≤m-1, and M=∑ k M k The β subsequences correspond to β tag bit sequences respectively, and are used for subsequent shaping bit position selection and polarization conversion, further achieving fine control over the distribution of modulation tag bits.

[0112] In step 750, β polarization transformation modules 650 are used to perform polarization transformation on β subsequences to obtain β tag bit sequences, which are denoted as X. (m-β) ,X (m-β+1) ,…,X (m-1) .

[0113] Specifically, in step 750, the k-th polarization conversion module (numbered #k) may be used to perform a shaping operation on the k-th modulated tag bit to generate a tag bit sequence of length N: Where, m-β≤k≤m-1. (k) Can represent the kth tag bit sequence; It can represent the i-th bit in the k-th tag bit sequence.

[0114] Specifically, the length of the input to the polarization conversion module #k is J k The second sequence is embedded into the sequence The set of unshaped bit positions Fill in the information bits The remaining shaped bit position set S k Shaped bits on The value of U is to be determined through forming calculation. (k) It can represent the sequence to be embedded in the second sequence corresponding to the k-th tag bit sequence; can represent the i-th bit in the above sequence.

[0115] Optionally, polar code decoding methods can be used to calculate shaped bits. Specific methods include serial cancellation decoding (SC) and serial cancellation list decoding (SCL). The decoding process can calculate the value of the shaped bit based on the log-likelihood ratio (LLR) and a known unshaped bit sequence, thereby achieving the desired probability distribution matching effect.

[0116] Optionally, LLR is calculated as follows: 1≤i≤N. The conditional probability can be calculated from the joint probability of the modulated tag bits:

[0117] In the calculation of the shaped bit Then, it is combined with the unformed bit input to the polarization conversion module #k Combine to form a complete input sequence of length N Then, the input sequence is polarized and converted to obtain the corresponding codeword sequence X (k) =U (k) G N , where G N is the polarization transformation matrix with dimension N×N (equivalent to the polarization code generation matrix). The resulting codeword X (k) As the kth label bit sequence, given the first (k-1) label bit sequence X (1) ,X (2) ,…,X (k-1) Under the condition of , its bit distribution approaches the conditional probability distribution According to the chain rule of probability, the above tag bit sequences jointly define the joint probability distribution of the (m-1) modulated tag bits corresponding to the symbol amplitude. Therefore, the distribution of the generated symbol amplitude after mapping will approach the set target amplitude probability distribution P.

[0118] In step 760 , the first modulated label bit sequence and the β label bit sequences are bit-wise combined by the multiplexer 660 to obtain an amplitude bit sequence.

[0119] In the above step 760, the first sequence with a length of (m-1-β)N and β tag bit sequences with a length of N are bit-by-bit combined by the multiplexer 660 to obtain an amplitude bit sequence with a length of (m-1)N.

[0120] Corresponding to the structure of the transmitter and the amplitude distribution matching mechanism described above, some embodiments of the present disclosure further provide a receiver. The receiver first demodulates and performs channel decoding on the received signal to recover the amplitude bit sequence constructed by the transmitter, and then performs reverse matching processing on it using the polarization inverse transformation operation on the binary bit domain to reconstruct the original information bit sequence. Compared with traditional distributed reverse matching methods (such as arithmetic decoding and complex table lookup), this solution completes information restoration through bit-level logical operations, significantly reducing the implementation complexity of the receiving end, and has the advantages of simple structure and high decoding efficiency.

[0121] Figure 8 The structure of the receiver according to the embodiment of the present disclosure is shown. Figure 8As shown, the receiver may include a demodulator 810, an amplitude bit decoding information correction module 820, a channel decoder 830, an amplitude distribution anti-matcher 840, and a multiplexer 850. In some embodiments of the present disclosure, the receiver may further include a descrambling module 845 and a scrambling index bit removal module 855.

[0122] Figure 9 The specific implementation process of the coded modulation probability shaping method based on polarization transformation performed by the receiver according to the embodiment of the present disclosure is shown. Figure 9 As shown, the above-mentioned coded modulation probability shaping method based on polarization transformation may include the following steps.

[0123] In step 910, the demodulator 810 demodulates the received modulation symbol sequence to obtain an amplitude bit sequence and a polarity bit sequence.

[0124] It can be seen that the above demodulation process aims to extract the amplitude bit sequence and polarity bit sequence corresponding to the transmitter modulation label from the modulation symbol sequence. Among them, the length of the above codeword is mN, including: m label bit sequences X (1) ,X (2) ,…,X (m) Among them, the first m-1 tag bit sequences X (1) ,X (2) ,…,X (m-1) As the above amplitude bit sequence; and the last tag bit sequence X (m) As the above-mentioned polarity bit sequence.

[0125] In some embodiments of the present disclosure, the demodulation process requires the use of modulation symbol probability distribution information. Optionally, the used probability distribution can be a pre-set target modulation symbol probability distribution or an empirical probability distribution obtained from receiving end observation data statistics.

[0126] Optionally, in an embodiment of the present disclosure, the amplitude bit sequence and polarity bit sequence can be either hard decision information (such as 0 / 1 decision result) or soft decision information (such as log likelihood ratio LLR or log posterior probability LLR-APP).

[0127] In step 920 , the amplitude bit decoding information correction module 820 corrects the amplitude bit sequence output by the demodulator 810 to improve subsequent channel decoding performance and recovery accuracy.

[0128] In the embodiment of the present disclosure, the amplitude bit sequence can be composed of m-1 tag bit sequences X (1) ,X (2) ,…,X (m-1)The first (m-1-β) tag bit sequences are unformed bits, and the last β tag bit sequences are bit sequences output by the polarization conversion module at the transmitting end. Based on the above characteristics, step 920 may specifically include the following steps.

[0129] First, the decoding information of the amplitude bit is modified based on the corresponding frozen bit position in the first (m-1-β) tag bit sequences. Specifically, when hard-decision decoding is used, the decoding result of the corresponding bit can be directly set to the fixed value of the frozen bit (0 or 1) to ensure consistency. When soft-decision decoding is used, the corresponding soft information can be set to positive infinity or negative infinity based on the value of the frozen bit, or replaced with a positive or negative number with a large absolute value to strengthen the weight of the bit in subsequent decoding.

[0130] Secondly, for the last β tag bit sequences, the corresponding decoded information can be further corrected based on the frozen bit positions in the uncoded sequence corresponding to the polarization conversion module input at the transmitter. Specifically, when hard decision information is used, consistency correction can be performed on logically conflicting decision bits based on the constraints between bits in polarization conversion (i.e., the mapping relationship between uncoded bits and codeword bits). When soft decision information is used, the soft-input, soft-output decoding algorithm of the polar code (such as the LLR update mechanism in BP and SCAN decoding) can be utilized in combination with frozen bits to update and correct the soft information output by the demodulator.

[0131] In step 930, the corrected amplitude bit decoding information and polarity bit decoding information are input to the channel decoder 830 for decoding.

[0132] In some embodiments of the present disclosure, the channel decoder 830 may be a polar code decoder, LDPC decoder, turbo decoder, convolutional code decoder, or other type of decoding module corresponding to the transmitter encoder. Furthermore, the channel decoding operation can recover the amplitude bit sequence and the second information bit subsequence before encoding by the transmitter.

[0133] In step 940 , the amplitude bit sequence output by the channel decoder 830 is input to the amplitude distribution anti-matcher 840 to restore the first information bit subsequence.

[0134] Specifically, in an embodiment of the present disclosure, restoring the first information bit subsequence may include:

[0135] First, for the first (m-1-β) label bit sequences in the amplitude bit sequence, the frozen bits are removed, thereby extracting the third information bit subsequence.

[0136] Secondly, for the last β tag bit sequences in the amplitude bit sequence, the inverse transformation operation of polarization transformation (also called polarization inverse transformation) is performed on the binary bit domain to restore the corresponding uncoded bit sequence. Let the kth tag bit sequence be X (k) , and its corresponding inverse transformed bit sequence is recorded as U (k) The process can be expressed as Among them, m-β≤k≤m-1, In particular, when the polarization transformation matrix (polarization code generation matrix) in 5G is adopted, that is, ( represents the log2 N-th Kronecker product of the matrix), then we have

[0137] Then, for all β uncoded bit sequences U recovered above (m-β) ,U (m-β+1) ,…,U (m) , in each bit sequence, the frozen bits and the shaped bits are further removed, and only the information bit part is retained to form a fourth information bit subsequence.

[0138] Finally, the recovered third information bit subsequence and the fourth information bit subsequence are multiplexed to reconstruct the complete first information bit subsequence.

[0139] At step 950, the first information bit subsequence is combined with the second information bit subsequence to obtain a restored information bit sequence, which will be output by the receiver.

[0140] Optionally, when the transmitter enables the scrambling operation, the first information bit subsequence recovered by the receiving end is the scrambled bit sequence, and further descrambling operation is required to restore the original information. Since the scrambling operation of the transmitting end does not involve the scrambling index bit, the receiving end can determine the length K contained in the scrambled first information bit subsequence and the second information bit subsequence. SCR scrambling index bit. Next, based on the determined scrambling index bit, the index of the pseudo-random scrambling sequence adopted by the transmitting end can be determined, thereby determining the pseudo-random scrambling sequence adopted by the transmitting end. Subsequently, a bit-level exclusive OR operation (i.e., bit-by-bit modulo 2 addition operation) is performed on the pseudo-random scrambling sequence and the scrambled first information bit subsequence, thereby completing the descrambling process of the first information bit subsequence. The above descrambling process is also not targeted at the scrambling index bit. Finally, the descrambled first information bit subsequence is multiplexed with the second information bit subsequence to reconstruct the complete information bit sequence, thereby achieving effective recovery of the original transmitted information.

[0141] Some embodiments of the present disclosure further provide an implementation scheme for an amplitude distribution anti-matcher. In the embodiments of the present disclosure, the amplitude distribution anti-matcher can also be referred to as an amplitude distribution anti-matcher based on polarization conversion. Figure 10 The structure of the amplitude distribution anti-matcher according to the embodiment of the present disclosure is shown. Figure 10 As shown, the amplitude distribution anti-matcher may include: a branching module 1010, a first information bit extraction module 1020, a second information bit extraction module 1030, β polarization inverse transformation modules 1040, a first multiplexer 1050 and a second multiplexer 1060.

[0142] Specifically, in an embodiment of the present disclosure, the input amplitude bit sequence can be divided into a first modulation label bit sequence of the first (m-1-β)N bits and a subsequent β label bit sequence of length N through the branching module 1010.

[0143] Next, for the first modulation label bit sequence, the first information bit extraction module 1020 is used to remove the frozen bits in the first modulation label bit sequence to extract a third information bit subsequence.

[0144] At the same time, for the last β tag bit sequences in the amplitude bit sequence, β polarization inverse transformation modules 1040 are used to perform inverse transformation operations on the binary bit domain to recover the corresponding uncoded bit sequence U (m-β) ,U (m -β+1) ,…,U (m) . Among them, let the kth tag bit sequence be X (k) , and its corresponding inverse transformed bit sequence is recorded as U (k) The process can be expressed as Among them, m-β≤k≤m-1, In particular, when the polarization transformation matrix (polarization code generation matrix) in 5G is adopted, that is, ( represents the log2 N-th Kronecker product of the matrix), then we have

[0145] Next, for all β uncoded bit sequences U recovered above (m-β) ,U (m-β+1) ,…,U (m) , and multiplexed into a second modulated label bit sequence using the first multiplexer 1050.

[0146] For the second modulation tag bit sequence, the second information bit extraction module 1030 is used to remove the frozen bits and shaped bits in the second modulation tag bit sequence, and only the information bit portion is retained to obtain a fourth information bit subsequence.

[0147] Finally, the second multiplexer 1060 is used to multiplex the recovered third information bit subsequence and the fourth information bit subsequence to reconstruct the complete first information bit subsequence.

[0148] It can be understood that the specific operations of the above-mentioned receiver and amplitude distribution anti-matcher can be understood as the inverse operations of the transmitter and amplitude distribution matcher. The execution process can be determined by referring to the specific operation process of the transmitter and amplitude distribution matcher in the aforementioned embodiment, and will not be repeated here.

[0149] The proposed polarization-based coded modulation probabilistic shaping system architecture utilizes polarization transformation to achieve modulation amplitude distribution matching. This architecture can be cascaded with channel coding in existing communication systems, improving the spectral efficiency of signal transmission and leveraging the performance gains of probabilistic shaping while effectively reducing implementation complexity at the receiving end. Furthermore, this system architecture can be flexibly integrated with any channel coding scheme that utilizes system coding, enhancing system compatibility and making it suitable for mainstream mobile communication systems, including 5G.

[0150] Furthermore, by leveraging the controllable bit distribution characteristics of polarization transformation, precise matching of the modulation symbol probability distribution is achieved at the transmitter. At the receiver, the original information bits are recovered through the inverse polarization transformation structure, eliminating the need for complex anti-matching devices at the receiver. The recovery process is a bit-level logic operation, offering advantages such as low computational complexity and a simple implementation structure. This effectively addresses the high implementation complexity of existing distributed matching schemes such as CCDM and ESS, which rely on complex operations such as arithmetic decoding and recursive search at the receiver.

[0151] Based on the same inventive concept, corresponding to any of the above-mentioned embodiments and methods, the present disclosure also provides an electronic device, including: a memory, a processor, and a computer program stored in the memory and runnable on the processor, wherein when the processor executes the computer program, the coding modulation probability shaping method described in any of the above embodiments is implemented.

[0152] Figure 111 is a schematic diagram showing the hardware structure of a more specific electronic device provided in this embodiment. The device may include: a processor 2010, a memory 2020, an input / output interface 2030, a communication interface 2040, and a bus 2050. The processor 2010, the memory 2020, the input / output interface 2030, and the communication interface 2040 are communicatively connected to each other within the device via the bus 2050.

[0153] The processor 2010 can be implemented using a general-purpose CPU (Central Processing Unit), a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of this specification.

[0154] The memory 2020 can be implemented in the form of ROM (Read Only Memory), RAM (Random Access Memory), static storage devices, dynamic storage devices, etc. The memory 2020 can store an operating system and other application programs. When the technical solutions provided in the embodiments of this specification are implemented through software or firmware, the relevant program code is stored in the memory 220 and is called and executed by the processor 2010.

[0155] The input / output interface 2030 is used to connect input / output devices to enable information input and output. Input / output devices can be configured as components within the device or externally connected to the device to provide corresponding functions. Input devices may include microphones and various sensors, while output devices may include displays, speakers, vibrators, indicator lights, etc.

[0156] The communication interface 2040 is used to connect to a communication module (not shown) to enable communication between the device and other devices. The communication module can communicate via a wired method (such as USB, network cable, etc.) or a wireless method (such as mobile network, WiFi, Bluetooth, etc.).

[0157] The bus 2050 comprises a path for transmitting information between the various components of the device (eg, the processor 2010 , the memory 2020 , the input / output interface 2030 , and the communication interface 2040 ).

[0158] It should be noted that although the above device only shows the processor 2010, the memory 2020, the input / output interface 2030, the communication interface 2040, and the bus 2050, in a specific implementation, the device may also include other components necessary for normal operation. In addition, those skilled in the art will understand that the above device may only include the components necessary to implement the embodiments of this specification, and does not necessarily include all the components shown in the figure.

[0159] The electronic device of the above embodiment is used to implement the corresponding coding modulation probability shaping method in any of the above embodiments, and has the beneficial effects of the corresponding method embodiment, which will not be described in detail here.

[0160] Based on the same inventive concept, corresponding to any of the above-mentioned embodiment methods, the present disclosure also provides a non-transitory computer-readable storage medium, wherein the non-transitory computer-readable storage medium stores computer instructions, and the computer instructions are used to enable the computer to execute the coding modulation probability shaping method described in any of the above embodiments.

[0161] The computer-readable media of this embodiment include permanent and non-permanent, removable and non-removable media that can be used to store information by any method or technology. The 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, read-only compact disc read-only memory (CD-ROM), digital versatile disc (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.

[0162] The computer instructions stored in the storage medium of the above embodiment are used to enable the computer to execute the coding modulation probability shaping method as described in any of the above embodiments, and have the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0163] Based on the same inventive concept, corresponding to the coding and modulation probability shaping method of any of the above-described embodiments, the present disclosure further provides a computer program product comprising computer program instructions. In some embodiments, when the computer program instructions are executed on a computer, the computer executes each step of each embodiment of the coding and modulation probability shaping method. Corresponding to the execution subject corresponding to each step in each embodiment of the coding and modulation probability shaping method, the processor executing the corresponding step may belong to the corresponding execution subject.

[0164] The computer program product of the above embodiment is used to enable a processor to execute the coding modulation probability shaping method described in any of the above embodiments, and has the beneficial effects of the corresponding method embodiment, which will not be repeated here.

[0165] Those skilled in the art should understand that the discussion of any of the above embodiments is merely illustrative and is not intended to imply that the scope of the present disclosure (including the claims) is limited to these examples. Within the scope of the present disclosure, the technical features in the above embodiments or different embodiments may be combined, the steps may be implemented in any order, and there are many other variations of the different aspects of the embodiments of the present disclosure as described above, which are not provided in detail for the sake of simplicity.

[0166] In addition, to simplify the description and discussion, and so as not to obscure the embodiments of the present disclosure, known power / ground connections to integrated circuit (IC) chips and other components may or may not be shown in the provided figures. In addition, devices may be shown in the form of block diagrams to avoid obscuring the embodiments of the present disclosure, and this also takes into account the fact that the details of the implementation of these block diagram devices are highly dependent on the platform on which the embodiments of the present disclosure are to be implemented (i.e., these details should be fully within the purview of those skilled in the art). Where specific details (e.g., circuits) are set forth to describe exemplary embodiments of the present disclosure, it will be apparent to those skilled in the art that the embodiments of the present disclosure may be implemented without these specific details or with variations in these specific details. Therefore, these descriptions should be considered illustrative rather than restrictive.

[0167] Although the present disclosure has been described in conjunction with specific embodiments thereof, many alternatives, modifications, and variations of these embodiments will be apparent to those skilled in the art based on the foregoing description. For example, other memory architectures (e.g., dynamic RAM (DRAM)) may use the embodiments discussed.

[0168] The embodiments of the present disclosure are intended to cover all such substitutions, modifications, and variations that fall within the broad scope of the appended claims. Therefore, any omissions, modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the embodiments of the present disclosure should be included in the scope of protection of the present disclosure.

Claims

1. A coded modulation probability shaping method, performed by a transmitter, comprising: Dividing the information bit sequence to be transmitted into a first information bit subsequence and a second information bit subsequence; generating an amplitude bit sequence based on the first information bit subsequence through polarization transformation; Channel coding the amplitude bit sequence and the second information bit subsequence to obtain a codeword including the amplitude bit sequence and the polarity bit sequence; wherein the polarity bit sequence includes: the second information bit subsequence and a check sequence; and The codeword is mapped into a modulation symbol sequence.

2. The method according to claim 1, wherein Dividing the information bit sequence to be transmitted into a first information bit subsequence and a second information bit subsequence includes: allocating information bits in the information bit sequence to the first information bit subsequence based on a preset upper limit on the length of the first information bit subsequence; and Allocate unallocated information bits in the information bit sequence to the second information bit subsequence.

3. The method according to claim 1, wherein Generating an amplitude bit sequence based on the first information bit subsequence through polarization transformation includes: Dividing the first information bit subsequence of length K1 to obtain a third information bit subsequence of length K3 and a fourth information bit subsequence of length K4, satisfying K1=K3+K4; Adding (m-1-β)N-K3 frozen bits to the third information bit subsequence to obtain a first modulation label bit sequence of length (m-1-β)N; wherein m is the modulation order; N is the length of the modulation symbol sequence; and β is the predetermined number of polarization conversion modules included in the transmitter; Adding βN-M-K4 frozen bits to the fourth information bit subsequence to obtain a second modulation label bit sequence of length βN-M, where M represents a preset total number of shaped bits to be added in the polarization transformation; Divide the second modulated label bit sequence to obtain β subsequences; Performing the polarization transformation on each of the β subsequences to obtain β tag bit sequences of length N; and The first modulated label bit sequence and β label bit sequences are bit-wise combined to obtain an amplitude bit sequence with a length of (m-1)N.

4. The method according to claim 1, further comprising: Before dividing the information bit sequence into the first information bit subsequence and the second information bit subsequence, adding a scrambling index bit to the information bit sequence; as well as After dividing the information bit sequence into the first information bit subsequence and the second information bit subsequence, a pseudo-random scrambling sequence is determined based on the scrambling index bit, and scrambling processing is performed on the first information bit subsequence using the pseudo-random scrambling sequence; wherein the pseudo-random scrambling sequence is a sequence with the highest similarity between the empirical distribution of the corresponding amplitude sequence and the target probability distribution in the pseudo-random sequence set.

5. The method according to claim 1, wherein Channel coding the amplitude bit sequence and the second information bit subsequence to obtain a codeword including the amplitude bit sequence and the polarity bit sequence includes: Generate a parity bit sequence of length N-K2 based on an amplitude bit sequence of length (m-1)N and a second information bit subsequence of length K2; wherein m is the modulation order; N is the length of the modulation symbol sequence; and The second information bit subsequence and the check bit sequence are combined into a polarity bit sequence of length N.

6. The method according to claim 1, wherein Mapping the codeword into a modulation symbol sequence includes: Selecting m-1 bits from the amplitude bit sequence as the first m-1 bits of the target modulation label; Selecting one bit from the polarity bit sequence as the last bit of the target modulation label; and Combine the first m-1 bits and the last bit to obtain the target modulation label; Based on a preset modulation mapping rule, mapping the target modulation label to a modulation symbol in a modulation symbol set as a modulation symbol in the modulation symbol sequence; and Return to the step of selecting m-1 bits from the amplitude bit sequence as the first m-1 bits of the target modulation label until the modulation symbol sequence of length N is generated; where m is the modulation order; and N is the length of the modulation symbol sequence.

7. The method according to claim 1, wherein Mapping the codeword into a modulation symbol sequence includes: Mapping the amplitude bit sequence into an amplitude sequence based on a preset mapping relationship between the modulation label and the amplitude; Mapping each bit in the polarity bit sequence to a binary polarity value to generate a polarity sequence; and The amplitude sequence is bit-wise multiplied by corresponding elements in the polarity sequence to obtain modulation symbols, thereby generating the modulation symbol sequence.

8. A method for coding modulation probability shaping, performed by a receiver, comprising: Demodulate the received modulation symbol sequence to obtain the codeword to be decoded; Decoding the codeword to be decoded to obtain an amplitude bit sequence and a second information bit subsequence; Restoring the amplitude bit sequence to a first information bit subsequence by performing an inverse polarization transform operation on a binary bit domain; as well as The first information bit subsequence and the second information bit subsequence are combined to obtain an information bit sequence.

9. A transmitter comprising: A splitter, configured to divide the information bit sequence to be transmitted into a first information bit subsequence and a second information bit subsequence; an amplitude distribution matcher, configured to generate an amplitude bit sequence based on the first information bit subsequence through polarization transformation; a channel encoder configured to perform channel coding on the amplitude bit sequence and the second information bit subsequence to obtain a codeword comprising an amplitude bit sequence and a polarity bit sequence; wherein the polarity bit sequence comprises: the second information bit subsequence and a check sequence; and A modulation mapper is used to map the codeword into a modulation symbol sequence.

10. A receiver comprising: A demodulator, configured to demodulate the received modulation symbol sequence to obtain a codeword to be decoded; a channel decoder, configured to decode the codeword to be decoded to obtain an amplitude bit sequence and a second information bit subsequence; an amplitude distribution anti-matcher, configured to restore the amplitude bit sequence to a first information bit subsequence by performing an inverse polarization transformation operation on a binary bit domain; as well as A multiplexer is used to combine the first information bit subsequence and the second information bit subsequence to obtain an information bit sequence.

Images