WO2023160053A1 - 概率成型的映射方法及概率解成型的接收处理方法 - Google Patents

概率成型的映射方法及概率解成型的接收处理方法 Download PDF

Info

Publication number
WO2023160053A1
WO2023160053A1 PCT/CN2022/134093 CN2022134093W WO2023160053A1 WO 2023160053 A1 WO2023160053 A1 WO 2023160053A1 CN 2022134093 W CN2022134093 W CN 2022134093W WO 2023160053 A1 WO2023160053 A1 WO 2023160053A1
Authority
WO
WIPO (PCT)
Prior art keywords
bit
bits
shaped
target
amplitude
Prior art date
Application number
PCT/CN2022/134093
Other languages
English (en)
French (fr)
Inventor
金立强
Original Assignee
大唐移动通信设备有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 大唐移动通信设备有限公司 filed Critical 大唐移动通信设备有限公司
Publication of WO2023160053A1 publication Critical patent/WO2023160053A1/zh

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00Modulated-carrier systems
    • H04L27/32Carrier systems characterised by combinations of two or more of the types covered by groups H04L27/02, H04L27/10, H04L27/18 or H04L27/26
    • H04L27/34Amplitude- and phase-modulated carrier systems, e.g. quadrature-amplitude modulated carrier systems
    • H04L27/3405Modifications of the signal space to increase the efficiency of transmission, e.g. reduction of the bit error rate, bandwidth, or average power
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00Modulated-carrier systems
    • H04L27/32Carrier systems characterised by combinations of two or more of the types covered by groups H04L27/02, H04L27/10, H04L27/18 or H04L27/26
    • H04L27/34Amplitude- and phase-modulated carrier systems, e.g. quadrature-amplitude modulated carrier systems
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00Modulated-carrier systems
    • H04L27/32Carrier systems characterised by combinations of two or more of the types covered by groups H04L27/02, H04L27/10, H04L27/18 or H04L27/26
    • H04L27/34Amplitude- and phase-modulated carrier systems, e.g. quadrature-amplitude modulated carrier systems
    • H04L27/38Demodulator circuits; Receiver circuits
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00Modulated-carrier systems
    • H04L27/32Carrier systems characterised by combinations of two or more of the types covered by groups H04L27/02, H04L27/10, H04L27/18 or H04L27/26
    • H04L27/34Amplitude- and phase-modulated carrier systems, e.g. quadrature-amplitude modulated carrier systems
    • H04L27/38Demodulator circuits; Receiver circuits
    • H04L27/3809Amplitude regulation arrangements
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00Modulated-carrier systems
    • H04L27/32Carrier systems characterised by combinations of two or more of the types covered by groups H04L27/02, H04L27/10, H04L27/18 or H04L27/26
    • H04L27/34Amplitude- and phase-modulated carrier systems, e.g. quadrature-amplitude modulated carrier systems
    • H04L27/36Modulator circuits; Transmitter circuits

Definitions

  • the present disclosure relates to the technical field of wireless communication, and in particular to a probability shaping mapping method and a probability unshaping receiving processing method.
  • the constellation probability shaping scheme based on constant composition distribution matching has a large rate loss problem, while the enumerative sphere shaping (ESS) based ) constellation probability shaping scheme has high storage complexity.
  • Embodiments of the present disclosure provide a probability forming mapping method and a probability solution forming receiving processing method, which are used to solve the defects of relatively large rate loss or high storage complexity in constellation probability forming in the prior art, and realize smaller Rate loss and lower molding complexity.
  • the embodiment of the present disclosure provides a probabilistic shaping mapping method, which is applied to the sending end, including:
  • the shaped amplitude bits are obtained through a first decoder dedicated to the channel code;
  • the shaped amplitude bits are mapped to modulation constellation points.
  • the target amplitude probability distribution and bits to be shaped are based on the first
  • the decoder takes the shaped amplitude bits, including:
  • each bit layer corresponds to one of the first decoders
  • the decoding codewords corresponding to the multiple bit layers are obtained;
  • the shaped amplitude bits are obtained based on the decoded codewords respectively corresponding to the multiple bit layers.
  • the first decoders respectively corresponding to the multiple bit layers obtain
  • the decoding codewords corresponding to the plurality of bit layers respectively include:
  • decoding codewords respectively corresponding to the multiple bit layers are obtained.
  • the first decoders corresponding to the multiple bit layers and the syndromes respectively corresponding to the multiple bit layers are based on: Obtaining the decoding codewords corresponding to the plurality of bit layers respectively, including:
  • the first decoding codeword includes decoding codewords respectively corresponding to all bit layers before the target bit layer, and the target bit layer is other bit layers except the first bit layer.
  • the determining the code rates respectively corresponding to the multiple bit layers based on the target amplitude probability distribution includes:
  • the target amplitude probability distribution and the bits to be shaped are based on the channel code-specific
  • the first decoder obtains the shaped amplitude bits, including:
  • the determining the code rate of the multi-ary channel code based on the target amplitude probability distribution includes:
  • the code rate of the multi-ary channel code is determined.
  • the first decoder includes any of the following:
  • a decoder that supports soft input and soft output
  • a decoder that supports soft input and hard output
  • Decoder based on neural network training.
  • the mapping the shaped amplitude bits to modulation constellation points includes:
  • the shaping amplitude bits and target polarity bits are mapped to the modulation constellation points.
  • the method before mapping the shaped amplitude bits into modulation constellation points, the method further includes:
  • the target polarity bit is determined based on the first polarity bit and the shaped magnitude bit.
  • the determining the target polarity bit based on the first polarity bit and the shaping magnitude bit includes:
  • the method before obtaining the shaped amplitude bits through the first decoder dedicated to the channel code based on the target amplitude probability distribution and the bits to be shaped, the method also includes:
  • the embodiment of the present disclosure also provides a probabilistic solution-based receiving processing method, which is applied to the receiving end, including:
  • the shaped amplitude bits corresponding to the received signal are acquired by the first decoder dedicated to the channel code based on the target amplitude probability distribution and the bits to be shaped.
  • the deforming the received signal includes:
  • the inputting the shaping amplitude bits into the deshaping device to obtain the bits to be shaped includes:
  • the shaping amplitude bit is a hard value bit
  • the shaping amplitude bit is input to the de-shaping device to obtain the bit to be shaped, and the bit to be shaped is the channel
  • the inputting the shaping amplitude bits into the deshaping device to obtain the bits to be shaped includes:
  • the de-shaping device inputting the shaping amplitude bits to the de-shaping device to obtain bits to be shaped, the de-shaping device includes a second decoder of the channel code,
  • the bits to be shaped are soft-value bits corresponding to the syndrome of the channel code.
  • the deforming the received signal includes:
  • the demodulation and demodulation of the received signal to obtain the second codeword includes:
  • the demodulation information is a soft-value bit
  • the demodulation information is input to the demodulator to obtain the second encoded codeword, and the demodulator includes the second code word of the channel code.
  • a decoder wherein the second encoded codeword is a soft value bit corresponding to a syndrome of the channel code.
  • the demodulation and demodulation of the received signal to obtain the second codeword includes:
  • the demodulation information is a soft-valued bit
  • the demodulation information is input to the demodulator to obtain the second encoded codeword
  • the demodulator includes a third code word of the channel code.
  • a decoder wherein the second encoded codeword is a hard value bit corresponding to a syndrome of the channel code.
  • the deforming the received signal includes:
  • the target transmission bit corresponding to the received signal is obtained.
  • the embodiment of the present disclosure also provides a sending end, including a memory, a transceiver, and a processor:
  • the memory is used to store computer programs; the transceiver is used to send and receive data under the control of the processor; the processor is used to read the computer programs in the memory and perform the following operations:
  • the shaped amplitude bits are obtained through a first decoder dedicated to the channel code;
  • the shaped amplitude bits are mapped to modulation constellation points.
  • the target amplitude probability distribution and the bits to be shaped are passed through a first decoder dedicated to the channel code Get shaping magnitude bits, including:
  • each bit layer corresponds to one of the first decoders
  • the decoding codewords corresponding to the multiple bit layers are obtained;
  • the shaped amplitude bits are obtained based on the decoded codewords respectively corresponding to the multiple bit layers.
  • the first decoders respectively corresponding to the multiple bit layers are used to obtain the multiple The decoding codewords corresponding to each bit layer, including:
  • decoding codewords respectively corresponding to the multiple bit layers are obtained.
  • the first decoder corresponding to the multiple bit layers and the syndromes corresponding to the multiple bit layers are used to obtain the Decoded codewords corresponding to multiple bit layers, including:
  • the first decoding codeword includes decoding codewords respectively corresponding to all bit layers before the target bit layer, and the target bit layer is other bit layers except the first bit layer.
  • the determining the respective code rates corresponding to the multiple bit layers based on the target amplitude probability distribution includes:
  • the target amplitude probability distribution and the bits to be shaped are based on the first decoding dedicated to the channel code
  • the encoder obtains shaped amplitude bits, including:
  • the determining the code rate of the multi-ary channel code based on the target amplitude probability distribution includes:
  • the code rate of the multi-ary channel code is determined.
  • the first decoder includes any of the following:
  • a decoder that supports soft input and soft output
  • a decoder that supports soft input and hard output
  • Decoder based on neural network training.
  • the mapping the shaped amplitude bits to modulation constellation points includes:
  • the shaping amplitude bits and target polarity bits are mapped to the modulation constellation points.
  • the operation before mapping the shaped amplitude bits into modulation constellation points, the operation further includes:
  • the target polarity bit is determined based on the first polarity bit and the shaped magnitude bit.
  • the determining the target polarity bit based on the first polarity bit and the shaping amplitude bit includes:
  • the operation before obtaining the shaped amplitude bits through the first decoder dedicated to the channel code based on the target amplitude probability distribution and the bits to be shaped, the operation further includes:
  • the embodiment of the present disclosure also provides a receiving end, including a memory, a transceiver, and a processor:
  • the memory is used to store computer programs; the transceiver is used to send and receive data under the control of the processor; the processor is used to read the computer programs in the memory and perform the following operations:
  • the shaped amplitude bits corresponding to the received signal are acquired by the first decoder dedicated to the channel code based on the target amplitude probability distribution and the bits to be shaped.
  • the de-shaping the received signal includes:
  • the inputting the shaped amplitude bits to the deshaper to obtain the bits to be shaped includes:
  • the shaping amplitude bit is a hard value bit
  • the shaping amplitude bit is input to the de-shaping device to obtain the bit to be shaped, and the bit to be shaped is the channel
  • the inputting the shaped amplitude bits to the deshaper to obtain the bits to be shaped includes:
  • the de-shaping device inputting the shaping amplitude bits to the de-shaping device to obtain bits to be shaped, the de-shaping device includes a second decoder of the channel code,
  • the bits to be shaped are soft-value bits corresponding to the syndrome of the channel code.
  • the de-shaping the received signal includes:
  • the demodulation and demodulation of the received signal to obtain the second codeword includes:
  • the demodulation information is a soft-value bit
  • the demodulation information is input to the demodulator to obtain the second encoded codeword, and the demodulator includes the second code word of the channel code.
  • a decoder wherein the second encoded codeword is a soft value bit corresponding to a syndrome of the channel code.
  • the demodulating and demodulating the received signal to obtain the second encoded codeword includes:
  • the demodulation information is a soft-valued bit
  • the demodulation information is input to the demodulator to obtain the second encoded codeword
  • the demodulator includes a third code word of the channel code.
  • a decoder wherein the second encoded codeword is a hard value bit corresponding to a syndrome of the channel code.
  • the de-shaping the received signal includes:
  • the target transmission bit corresponding to the received signal is obtained.
  • the embodiment of the present disclosure also provides a probabilistic shaping mapping device, which is applied to the sending end, including:
  • the first acquisition unit is configured to acquire the shaped amplitude bits through the first decoder dedicated to the channel code based on the target amplitude probability distribution and the bits to be shaped;
  • the second acquiring unit is configured to map the shaped amplitude bits into modulation constellation points.
  • the first obtaining unit is specifically configured to:
  • each bit layer corresponds to one of the first decoders
  • the decoding codewords corresponding to the multiple bit layers are obtained;
  • the shaped amplitude bits are obtained based on the decoded codewords respectively corresponding to the multiple bit layers.
  • the first acquiring unit is specifically configured to:
  • the shaped amplitude bits are obtained based on the decoded codewords respectively corresponding to the multiple bit layers.
  • the first acquiring unit is specifically configured to:
  • the first decoding codeword includes decoding codewords respectively corresponding to all bit layers before the target bit layer, and the target bit layer is other bit layers except the first bit layer.
  • the first acquiring unit is specifically configured to:
  • the first acquiring unit is specifically configured to:
  • the first acquiring unit is specifically configured to:
  • the code rate of the multi-ary channel code is determined.
  • the first decoder includes any of the following:
  • a decoder that supports soft input and soft output
  • a decoder that supports soft input and hard output
  • Decoder based on neural network training.
  • the second acquiring unit is specifically configured to:
  • the shaping amplitude bits and target polarity bits are mapped to the modulation constellation points.
  • the apparatus further includes a third acquisition unit, before mapping the shaped amplitude bits into modulation constellation points, the third acquisition unit is configured to:
  • the target polarity bit is determined based on the first polarity bit and the shaped magnitude bit.
  • the third acquiring unit is specifically configured to:
  • the device further includes a fourth acquisition unit, before acquiring the shaped amplitude bits through the first decoder dedicated to the channel code based on the target amplitude probability distribution and the bits to be shaped, the fourth acquisition unit Used for:
  • the device further includes a determining unit, before acquiring the shaped amplitude bits through the first decoder dedicated to the channel code based on the target amplitude probability distribution and the bits to be shaped, the determining unit is configured to:
  • the target amplitude probability distribution is determined based on a target signal-to-noise ratio SNR and a target modulation order.
  • the embodiment of the present disclosure also provides a probabilistic solution-based receiving and processing device, which is applied to the receiving end, including:
  • the fifth acquisition unit is used to decompose the received signal
  • the shaped amplitude bits corresponding to the received signal are acquired by the first decoder dedicated to the channel code based on the target amplitude probability distribution and the bits to be shaped, the shaper includes the first decoder, the second A syndrome of a channel code corresponding to a decoder is determined based on the bits to be shaped.
  • the fifth acquiring unit is specifically configured to:
  • the target transmit bit is determined based on the bit to be shaped and the first polarity bit.
  • the fifth acquiring unit is specifically configured to:
  • the shaping amplitude bit is a hard value bit
  • the shaping amplitude bit is input to the de-shaping device to obtain the bit to be shaped, and the bit to be shaped is the channel
  • the fifth acquiring unit is specifically configured to:
  • the de-shaping device inputting the shaping amplitude bits to the de-shaping device to obtain bits to be shaped, the de-shaping device includes a second decoder of the channel code,
  • the bits to be shaped are soft-value bits corresponding to the syndrome of the channel code.
  • the fifth acquiring unit is specifically configured to:
  • the fifth acquiring unit is specifically configured to:
  • the demodulation information is a soft-value bit
  • the demodulation information is input to the demodulator to obtain the second encoded codeword, and the demodulator includes the second code word of the channel code.
  • a decoder wherein the second encoded codeword is a soft value bit corresponding to a syndrome of the channel code.
  • the fifth acquiring unit is specifically configured to:
  • the demodulation information is a soft-valued bit
  • the demodulation information is input to the demodulator to obtain the second encoded codeword
  • the demodulator includes a third code word of the channel code.
  • a decoder wherein the second encoded codeword is a hard value bit corresponding to a syndrome of the channel code.
  • the fifth acquiring unit is specifically configured to:
  • the target transmission bit corresponding to the received signal is obtained.
  • the embodiments of the present disclosure further provide a processor-readable storage medium, the processor-readable storage medium stores a computer program, and the computer program is used to enable the processor to execute the above-mentioned first aspect.
  • the mapping method for probabilistic shaping and the receiving processing method for probabilistic unshaping provided by the embodiments of the present disclosure can decode according to the target amplitude probability distribution through the first decoder dedicated to the channel code, and then can obtain the shaping amplitude bits, so that the shaping The amplitude bits can be close to the target amplitude probability distribution, which can realize probability shaping, and can achieve small rate loss and low shaping complexity. Under high signal-to-noise ratio and high spectral efficiency, it can effectively reduce shaping loss and improve communication system performance.
  • FIG. 1 is a schematic diagram of a post-decomposition PAS architecture provided by related technologies
  • Fig. 2 is a schematic diagram of the 8-ASK binary index number provided by the related art
  • Fig. 3 is one of the schematic flowcharts of the probabilistic modeling mapping method provided by the embodiment of the present disclosure
  • Fig. 4 is the second schematic flow diagram of the probabilistic modeling mapping method provided by the embodiment of the present disclosure.
  • Fig. 5 is the third schematic flowchart of the probabilistic modeling mapping method provided by the embodiment of the present disclosure.
  • FIG. 6 is a schematic diagram of a pre-decomposed PAS architecture provided by an embodiment of the present disclosure.
  • Fig. 7 is one of the schematic flowcharts of the probabilistic solution type receiving processing method provided by the embodiment of the present disclosure.
  • Fig. 8 is the second schematic flow diagram of the probabilistic solution type receiving processing method provided by the embodiment of the present disclosure.
  • FIG. 9 is a schematic diagram of a Tanner graph-based belief propagation decoder provided by an embodiment of the present disclosure.
  • FIG. 10 is one of the schematic structural diagrams of network-side devices provided by an embodiment of the present disclosure.
  • FIG. 11 is one of the schematic structural diagrams of a terminal provided by an embodiment of the present disclosure.
  • FIG. 12 is a second schematic structural diagram of network-side equipment provided by an embodiment of the present disclosure.
  • FIG. 13 is a second structural schematic diagram of a terminal provided by an embodiment of the present disclosure.
  • Fig. 14 is a schematic structural diagram of a probabilistic modeling mapping device provided by an embodiment of the present disclosure.
  • Fig. 15 is a schematic structural diagram of a probabilistic solution-based receiving and processing device provided by an embodiment of the present disclosure.
  • the total gain of the system can be obtained by two parts: coding gain and shaping gain.
  • the coding gain is mainly determined by the distance spectrum characteristic of channel coding, and the shaping gain depends on the design of the modulation constellation diagram. By designing the optimal constellation diagram, the communication system can obtain a progressive gain of about 1.53dB under high spectral efficiency and high signal-to-noise ratio.
  • Constellation shaping technology is a technology that makes the signal approach the optimal input distribution of the channel by adjusting the distance or occurrence probability of the constellation points. Based on the constellation shaping technique, bandwidth-limited high-order modulation systems can obtain shaping gains.
  • Signal constellation shaping can basically be divided into:
  • Geometric shaping considers that each constellation point is used with equal probability. By finding the position of the best constellation point or designing the unequal distance between constellation points, the geometric shape of the signal constellation is similar to a hypersphere;
  • PS Probability Shaping
  • GS molding and PS molding can be further divided into one-dimensional molding and multi-dimensional molding:
  • One-dimensional shaping only considers constellation points on a resource block (Resource Element, RE), so it is only necessary to adjust the coordinate distance of constellation points on a complex plane, or the use probability of rectangular QAM constellation points on a complex plane;
  • Multi-dimensional shaping considers multiple RE constellation points as a complex vector/sequence, and jointly adjusts the geometric shape of the complex vector/sequence constellation points in a high-dimensional space, or the probability of using a rectangular QAM constellation point in a high-dimensional space.
  • FIG. 1 is a schematic diagram of a post-de-shaping PAS architecture provided by the related art. As shown in FIG. 1 , the de-shaping device is located behind the channel decoder. In the post-decomposition Probability Amplitude Shaping (PAS) architecture scheme, the complex QAM constellation is regarded as two-way real ASK (Amplitude Shift Keying, ASK) modulation, and the positive and negative poles of the ASK constellation points The decoupling of sex and amplitude only needs to adjust the probability of occurrence of ASK amplitude, while the independent probability of positive and negative polarity does not need to be adjusted.
  • PPS Probability Amplitude Shaping
  • the constellation modulation is decomposed into two channels of 8-ASK, and the binary index (Binary Reflected Gray Code, BRGC) of 8-ASK uses three bits for labeling.
  • BRGC Binary Reflected Gray Code
  • Fig. 2 is a schematic diagram of the 8-ASK binary index label provided by the related art. As shown in Fig. 2, it can be seen from the binary label that the highest bit indicates the positive and negative polarity, and the lower two bits indicate the amplitude and are left-right symmetrical.
  • the sending end divides the binary bit stream to be transmitted into two parts Ua and Us after serial-to-parallel conversion, where Ua obtains the shaping amplitude bit A through the shaper, and Us and A are used as the forward error correction code of the system (Systematic Forward Error-correction Code, SFEC) system bit input, coded to obtain the check bit P of the SFEC error correction code, Us and P are combined into a polarity bit S.
  • SFEC Systematic Forward Error-correction Code
  • a and S uniquely determine the ASK constellation point.
  • the parity bit P is directly obtained from the amplitude bit A through SFEC encoding.
  • the receiving end obtains the demodulation information through demodulation according to the received signal, and then obtains the transmitted bits through SFEC decoding and decoding.
  • This scheme uses a post-decomposition module, so the shaping code is not required to support soft detection.
  • SFEC can be designed based on any system channel error correction code, and the shaper is the key to the whole system design, usually implemented based on CCDM or ESS shaping code.
  • the following introduces the CCDM-based shaper and ESS-based shaper:
  • the empirical distribution of sequence C is where n x (c) represents the number of occurrences of x in the sequence C, or
  • the specific way of rounding up and down can be determined by solving the minimum difference entropy D(P c
  • sequence C can be loaded bit information, the rate loss at this time is H(.) means computing information entropy.
  • H(.) means computing information entropy.
  • the sequence C that satisfies the ESS constraints is far more than the sequence C that satisfies the CCDM constraints, and is closer to n ⁇ H(A), so the shaper rate loss value R Loss based on ESS is smaller.
  • the index numbers can be described by Look Up Table (LUT) or Bounded Energy Trellis (BET), so as to realize probability shaping.
  • LUT Look Up Table
  • BET Bounded Energy Trellis
  • the space/storage complexity of the algorithm is O(L(n+1)nR),
  • the computational complexity is O(
  • shaper based on CCDM or ESS usually does not support soft input and soft output, so it needs to be combined with post-deformation PAS architecture.
  • the traditional CCDM-based shaper has a large rate loss
  • the ESS-based shaper overcomes the disadvantage of the rate loss, but when the shaped code block is large, its storage complexity is high , which is not conducive to the actual deployment of the communication system.
  • various embodiments of the present disclosure provide a probability shaping mapping method and a probability solution shaping receiving processing method.
  • the first decoder dedicated to the channel code can decode according to the target amplitude probability distribution, and can realize Probabilistic molding, and can achieve small rate loss and low molding complexity.
  • the applicable system may be a global system of mobile communication (GSM) system, a code division multiple access (CDMA) system, a wideband code division multiple access (WCDMA) general packet Wireless business (general packet radio service, GPRS) system, long term evolution (long term evolution, LTE) system, LTE frequency division duplex (frequency division duplex, FDD) system, LTE time division duplex (time division duplex, TDD) system, Long term evolution advanced (LTE-A) system, universal mobile telecommunications system (UMTS), worldwide interoperability for microwave access (WiMAX) system, 5G new air interface (New Radio, NR) system, etc.
  • GSM global system of mobile communication
  • CDMA code division multiple access
  • WCDMA wideband code division multiple access
  • GPRS general packet Wireless business
  • long term evolution long term evolution
  • LTE long term evolution
  • LTE frequency division duplex frequency division duplex
  • FDD frequency division duplex
  • TDD time division duplex
  • LTE-A Long term evolution advanced
  • the terminal device involved in the embodiments of the present disclosure may be a device that provides voice and/or data connectivity to users, a handheld device with a wireless connection function, or other processing devices connected to a wireless modem.
  • the name of the terminal equipment may be different.
  • the terminal equipment may be called User Equipment (User Equipment, UE).
  • the wireless terminal device can communicate with one or more core networks (Core Network, CN) via the radio access network (Radio Access Network, RAN), and the wireless terminal device can be a mobile terminal device, such as a mobile phone (or called a "cellular "telephones) and computers with mobile terminal equipment, such as portable, pocket, hand-held, computer built-in or vehicle-mounted mobile devices, which exchange language and/or data with the radio access network.
  • CN Core Network
  • RAN Radio Access Network
  • RAN Radio Access Network
  • the wireless terminal device can be a mobile terminal device, such as a mobile phone (or called a "cellular "telephones) and computers with mobile terminal equipment, such as portable, pocket, hand-held, computer built-in or vehicle-mounted mobile devices, which exchange language and/or data with the radio access network.
  • PCS Personal Communication Service
  • SIP Session Initiated Protocol
  • WLL Wireless Local Loop
  • PDA Personal Digital Assistant
  • Wireless terminal equipment can also be called system, subscriber unit, subscriber station, mobile station, mobile station, remote station, access point , remote terminal (remote terminal), access terminal (access terminal), user terminal (user terminal), user agent (user agent), and user device (user device), which are not limited in the embodiments of the present disclosure.
  • the network device involved in the embodiments of the present disclosure may be a base station, and the base station may include multiple cells that provide services for terminals.
  • the base station can also be called an access point, or it can be a device in the access network that communicates with the wireless terminal device through one or more sectors on the air interface, or other names.
  • the network device can be used to interchange received over-the-air frames with Internet Protocol (IP) packets and act as a router between the wireless terminal device and the rest of the access network, which can include the Internet Protocol (IP) communication network.
  • IP Internet Protocol
  • Network devices may also coordinate attribute management for the air interface.
  • the network equipment involved in the embodiments of the present disclosure may be a network equipment (Base Transceiver Station, BTS) in Global System for Mobile communications (GSM) or Code Division Multiple Access (Code Division Multiple Access, CDMA) ), it can also be a network device (NodeB) in Wide-band Code Division Multiple Access (WCDMA), or it can be an evolved network device in a long-term evolution (long term evolution, LTE) system (evolutional Node B, eNB or e-NodeB), 5G base station (gNB) in the 5G network architecture (next generation system), can also be a home evolved base station (Home evolved Node B, HeNB), relay node (relay node) , a home base station (femto), a pico base station (pico), etc., are not limited in this embodiment of the present disclosure.
  • a network device may include a centralized unit (centralized unit, CU) node and a distributed unit (distributed unit, DU) node
  • MIMO transmission can be Single User MIMO (Single User MIMO, SU-MIMO) or Multi-User MIMO (Multiple User MIMO, MU-MIMO).
  • MIMO transmission can be 2D-MIMO, 3D-MIMO, FD-MIMO, or massive-MIMO, or diversity transmission, precoding transmission, or beamforming transmission, etc.
  • Fig. 3 is one of the schematic flow charts of the probabilistic shaping mapping method provided by the embodiment of the present disclosure. As shown in Fig. 3 , the embodiment of the present disclosure provides a probability shaping mapping method, and the execution subject may be the sending end. The method includes:
  • Step 301 based on the target amplitude probability distribution and the bits to be shaped, obtain the shaped amplitude bits through the first decoder dedicated to the channel code;
  • the sending end can obtain the target sending bits, and then determine the bits to be shaped based on the target sending bits, and then perform probabilistic shaping on the bits to be shaped by the first decoder of the channel code, and obtain the shaped amplitude bits corresponding to the bits to be shaped.
  • the target transmission bit may be information to be subjected to constellation modulation, and after constellation modulation, a modulation constellation point corresponding to the target transmission bit may be obtained.
  • Step 302 mapping the shaped amplitude bits to modulation constellation points.
  • the transmitting end can determine the target polarity bit based on the target transmission bit, and then perform mapping based on the target polarity bit and the shaping amplitude bit to uniquely determine the modulation constellation point.
  • the sending end may be a network side device, such as a base station, and correspondingly, the receiving end may be a terminal.
  • the sending end may be a terminal, such as a mobile phone.
  • the receiving end may be a network side device.
  • the sending end may include a shaper
  • the shaper may include a first decoder of the channel code
  • the first decoder may use the syndrome corresponding to the first decoder as an input to perform decoding calculations, A decoded codeword can be obtained, and shaping amplitude bits can be obtained based on the decoded codeword.
  • the channel code may be a binary polar code and the shaper may comprise a first decoder of the binary polar code.
  • the channel code may be a multi-ary polar code
  • the shaper may include a first decoder of the multi-ary polar code
  • the channel code may be a binary Low Density Parity Check (LDPC for short) code
  • the shaper may include a first decoder of the binary LDPC code
  • the channel code may be a multi-ary LDPC code
  • the shaper may include a first decoder for the multi-ary LDPC code
  • the sending end can be implemented based on the post-decomposition PAS architecture. Based on the target amplitude probability distribution, the sending end can input the bits to be shaped as the syndrome of the channel code into the shaper to obtain the shaped amplitude bits, and then based on the shaped amplitude bits and target polarity bits to get modulation constellation points.
  • the shaping code constructed by the channel code in the embodiment of the present disclosure can support soft input and soft output deshaping, and is suitable for various deshaping PAS architecture.
  • the probability shaping mapping method provided by the embodiment of the present disclosure can decode according to the target amplitude probability distribution through the first decoder dedicated to the channel code, and then can obtain the shaping amplitude bits, so that the shaping amplitude bits can approach the target amplitude probability distribution , can realize probabilistic shaping, and can achieve small rate loss and low shaping complexity. Under high signal-to-noise ratio and high spectral efficiency, it can effectively reduce shaping loss and improve communication system performance.
  • the acquisition of the shaped amplitude bits through a first decoder dedicated to the channel code based on the target amplitude probability distribution and the bits to be shaped includes:
  • each bit layer corresponds to one of the first decoders
  • the decoding codewords corresponding to the multiple bit layers are obtained;
  • the shaped amplitude bits are obtained based on the decoded codewords respectively corresponding to the multiple bit layers.
  • the channel code may be a binary channel code
  • the shaper at the sending end may include multiple bit layers, and each bit layer may correspond to a first decoder.
  • the sending end can determine the bits to be shaped based on the target sent bits, and then input the bits to be shaped to the shaper, and then based on the target amplitude probability distribution and the bits to be shaped, through the first decoder corresponding to the multiple bit layers , the decoding codewords corresponding to multiple bit layers can be obtained, and then based on the decoding codewords corresponding to multiple bit layers, the shaping amplitude bits can be obtained, and then the modulation can be uniquely determined based on the shaping amplitude bits and the target polarity bits Constellation points.
  • multiple bit levels may be determined based on the binary labels of the constellation modulation symbols.
  • 64QAM modulation can be divided into 2-way 8-ASK modulation first, and each 8-ASK modulation symbol can have a 3-bit sequence A1A2A3 corresponding, and one of these 3 bits can be a target polarity bit (for example, it can be A1), further, the multiple bit layers may be A2 bit layer, A3 bit layer.
  • the channel code can be a binary channel code
  • the shaper at the sending end can include multiple bit layers, each bit layer can correspond to a first decoder, and the target amplitude probability distribution can be based on the first decoder in the shaper Decoding is performed, and then the shaping amplitude bits can be obtained, so that the shaping amplitude bits can be close to the target amplitude probability distribution, and probability shaping can be realized, and small rate loss and low shaping complexity can be achieved. Under the spectral efficiency, the molding loss can be effectively reduced, and the performance of the communication system can be improved.
  • the decoded codewords corresponding to the multiple bit layers are respectively obtained through the first decoders respectively corresponding to the multiple bit layers ,include:
  • decoding codewords respectively corresponding to the multiple bit layers are obtained.
  • the channel code may be a binary channel code
  • the shaper at the sending end may include multiple bit layers, and each bit layer may correspond to a first decoder.
  • the sender can determine the bits to be shaped based on the target sent bits, and then input the bits to be shaped to the shaper, and then based on the target amplitude probability distribution, can determine the code rates corresponding to multiple bit layers, and then based on the bits to be shaped
  • the code rates corresponding to the multiple bit layers respectively can determine the syndromes corresponding to the multiple bit layers respectively, and then based on the first decoder corresponding to the multiple bit layers and the syndromes corresponding to the multiple bit layers respectively,
  • the decoding codewords corresponding to multiple bit layers can be obtained, and then based on the decoding codewords corresponding to multiple bit layers, the shaping amplitude bits can be obtained, and then the modulation constellation can be uniquely determined based on the shaping amplitude bits and the target polarity bits point.
  • the channel code may be a binary polar code
  • the shaper at the sending end may include multiple bit layers, and each bit layer may correspond to a first decoder of the binary polar code.
  • the channel code may be a binary LDPC code
  • the shaper at the sending end may include multiple bit layers, and each bit layer may correspond to a first decoder of a binary LDPC code.
  • the shaping rate loss can be reduced by adjusting the code rate of each bit layer, and the shaper at the sending end can use channel codes (such as polar codes, LDPC codes) that support low decoding complexity, and then can Reduce molding complexity.
  • the channel code can be a binary channel code
  • the shaper at the sending end can include multiple bit layers, each bit layer can correspond to a first decoder, and the first decoder dedicated to the channel code can be used according to the target amplitude probability distribution, and then the shaping amplitude bits can be obtained, so that the shaping amplitude bits can be close to the target amplitude probability distribution, the probability shaping can be realized, and small rate loss and low shaping complexity can be achieved.
  • the molding loss can be effectively reduced, and the performance of the communication system can be improved.
  • the decoding codes corresponding to the multiple bit layers are respectively obtained. words, including:
  • the first decoding codeword includes decoding codewords respectively corresponding to all bit layers before the target bit layer, and the target bit layer is other bit layers except the first bit layer.
  • the sender can determine the bits to be shaped based on the target transmission bits, and then input the bits to be shaped to the shaper, and then determine the code rates corresponding to multiple bit layers based on the target amplitude probability distribution; and then based on the bits to be shaped
  • the code rates corresponding to the multiple bit layers respectively can determine the syndromes corresponding to the multiple bit layers respectively;
  • the sending end can input the syndrome corresponding to the first bit layer in the multiple bit layers into the first decoder corresponding to the first bit layer , and then the decoding codeword corresponding to the first bit layer can be obtained, and then for each target bit layer in multiple bit layers, the syndrome corresponding to the target bit layer and the first decoding codeword can be input into the target bit
  • the first decoder corresponding to the layer can obtain the decoding codeword corresponding to the target bit layer;
  • the shaping amplitude bits can be obtained, and then based on the shaping amplitude bits and the target polarity bits, the Uniquely determine the modulation constellation point.
  • FIG. 4 is the second schematic flow diagram of the probabilistic modeling mapping method provided by the embodiment of the present disclosure.
  • FIG. 4 is an optional example of the present disclosure, but not as a limitation of the present disclosure; as shown in FIG. 4 :
  • the layer is divided into a code rate R i , and each bit layer is assigned a channel code with a code rate R i and a corresponding decoder.
  • the shaper input bit Ua performs layer mapping according to the number of bits that each bit layer can carry, and is divided into Ua1, Ua2, and Ua3, and so on.
  • Uai is used as a syndrome, which is input to the channel code decoder of layer i, and the soft bits of the layer i decoder are distributed according to the target amplitude conditional probability Calculate, where A 1 A 2 ...A i-1 is the decoding result of the previous i-1 layer.
  • the shaper adopts a layer-by-layer decoding method to obtain the decoding codeword of each layer.
  • the decoding codeword of layer 1 can be The decoded codeword for layer 2 can be The decoded codeword for layer 3 can be By analogy, all the bit-layer codewords are finally converted to parallel and serialized as the shaping amplitude bit A and output.
  • the information bits are loaded onto the syndrome of the channel code, and since the soft bits of the decoder are calculated layer by layer according to the target amplitude probability distribution PA , the final code obtained each time The word will be close to the target magnitude conditional probability distribution
  • the shaped amplitude bits A will also be close to the target amplitude probability distribution P A .
  • the channel code can be a binary channel code
  • the shaper at the sending end can include multiple bit layers, each bit layer can correspond to the first decoder, and the first decoder dedicated to the channel code can be used according to the target amplitude probability distribution Decoding is performed, and then the shaping amplitude bits can be obtained, so that the shaping amplitude bits can be close to the target amplitude probability distribution, and probability shaping can be realized, and small rate loss and low shaping complexity can be achieved. Under the spectral efficiency, the molding loss can be effectively reduced, and the performance of the communication system can be improved.
  • the determining the code rates respectively corresponding to the multiple bit layers based on the target amplitude probability distribution includes:
  • the entropy corresponding to the amplitude bits of each bit layer can be determined based on the target amplitude probability distribution, and then the code rates corresponding to multiple bit layers can be determined based on the entropy corresponding to multiple bit layers respectively, and then based on the bits to be shaped and
  • the code rates corresponding to the multiple bit layers respectively can determine the syndromes corresponding to the multiple bit layers respectively, and then based on the first decoder corresponding to the multiple bit layers and the syndromes corresponding to the multiple bit layers respectively, it can be Obtain the decoding codewords corresponding to multiple bit layers, and then based on the decoding codewords corresponding to multiple bit layers, the shaping amplitude bits can be obtained, and then based on the shaping amplitude bits and target polarity bits, the modulation constellation point can be uniquely determined .
  • the shaper at the sending end can determine the code rates corresponding to the multiple bit layers based on the entropy corresponding to the multiple bit layers respectively, and then determine the syndromes corresponding to the multiple bit layers respectively, and then through the first in the shaper
  • a decoder performs decoding according to the target amplitude probability distribution and the syndrome, and then can obtain the shaped amplitude bits, so that the shaped amplitude bits can be close to the target amplitude probability distribution, which can realize probability shaping, and can achieve smaller rate loss and higher Low molding complexity, under high signal-to-noise ratio and high spectral efficiency, can effectively reduce molding loss and improve communication system performance.
  • the acquisition of the shaped amplitude bits through a first decoder dedicated to the channel code based on the target amplitude probability distribution and the bits to be shaped includes:
  • the channel code may be a multi-ary channel code
  • the shaper at the sending end may include a first decoder for the multi-ary channel code
  • the sender can determine the bits to be shaped based on the target sent bits, and then determine the code rate of the multi-ary channel code based on the target amplitude probability distribution, and then based on the bits to be shaped and the code rate of the multi-ary channel code, it can obtain
  • the multi-ary system bits to be shaped corresponding to the bits to be formed, and then based on the multi-ary system bits to be formed and the target amplitude probability distribution, the multi-ary system decoding codeword corresponding to the multi-ary system bits to be formed can be obtained, and then the multi-ary system decoded
  • the code word is converted into binary, and the shaping amplitude bits can be obtained, and then based on the shaping amplitude bits and the target polarity bits, the modulation constellation point can be uniquely determined.
  • the channel code may be a multi-ary polar code
  • the shaper at the sending end may include a first decoder of the multi-ary polar code
  • the channel code may be a multi-ary LDPC code
  • the shaper at the sending end may include a first decoder for the multi-ary LDPC code
  • FIG. 5 is the third schematic flow diagram of the probabilistic modeling mapping method provided by the embodiment of the present disclosure.
  • FIG. 5 is an optional example of the present disclosure, but not as a limitation of the present disclosure; as shown in FIG. 5 :
  • the code rate R of the multi-ary channel code can be determined according to a certain criterion (for example, information entropy), and the number of information symbols and information that can be loaded can be further determined according to the code rate R number of bits.
  • the shaper no longer needs to perform layer mapping, but converts the binary bit stream into a multi-ary symbol V a and loads it on the multi-ary syndrome, and the decoder decodes on the multi-ary system to obtain a multi-ary system decoding Code code word V.
  • the soft bit output of the decoder can be calculated according to the target amplitude probability distribution PA , and the final decoded codeword is transformed into binary by multi-ary system to obtain the shaped amplitude bit A.
  • the codeword symbols obtained by decoding will also be close to the distribution of PA , so that probability shaping can be realized.
  • the shaper based on multi-ary codes does not require layer-by-layer serial decoding, and the shaping delay is lower, which is suitable for future high-throughput business scenarios.
  • the shaping rate loss can be reduced by adjusting the code rate of the multi-ary channel code, and when the shaper at the sending end can use a channel code that supports low decoding complexity (for example, polar code, LDPC code), and then The molding complexity can be reduced.
  • a channel code that supports low decoding complexity for example, polar code, LDPC code
  • the channel code can be a multi-ary channel code
  • the shaper at the sending end can include a first decoder for the multi-ary channel code, and the first decoder dedicated to the channel code can be decoded according to the target amplitude probability distribution , and then the shaping amplitude bits can be obtained, so that the shaping amplitude bits can be close to the target amplitude probability distribution, probabilistic shaping can be realized, and small rate loss and low shaping complexity can be achieved.
  • the shaper based on the multi-ary code does not need Layer-by-layer serial decoding with lower forming delay, suitable for future high-throughput business scenarios.
  • the determining the code rate of the multi-ary channel code based on the target amplitude probability distribution includes:
  • the code rate of the multi-ary channel code is determined.
  • the entropy corresponding to all amplitude bits can be determined based on the target amplitude probability distribution, and then the code rate of the multi-ary channel code can be determined based on the entropy corresponding to all amplitude bits, and then the code rate of the multi-ary channel code can be determined based on the bits to be shaped and the code of the multi-ary channel code rate, the multi-ary system bits to be formed corresponding to the bits to be formed can be obtained, and then based on the multi-ary system to be formed bits and the target amplitude probability distribution, the multi-ary system decoding codeword corresponding to the multi-ary system to be formed bits can be obtained, and then the The multi-ary decoding codeword is converted into binary, and the shaping amplitude bits can be obtained, and then based on the shaping amplitude bits and the target polarity bits, the modulation constellation point can be uniquely determined.
  • the shaper at the sending end can determine the code rate of the multi-ary channel code based on the entropy corresponding to all amplitude bits, and then can determine the multi-ary system bits to be shaped, and then can use the first decoder in the shaper according to the target amplitude
  • the probability distribution and multi-ary system bits to be shaped are decoded, and then the shaped amplitude bits can be obtained, so that the shaped amplitude bits can be close to the target amplitude probability distribution, probability shaping can be realized, and small rate loss and low shaping complexity can be achieved
  • the shaper based on the multi-ary code does not require layer-by-layer serial decoding, and the shaping delay is lower, which is suitable for future high-throughput business scenarios.
  • the first decoder includes any of the following:
  • a decoder that supports soft input and soft output
  • a decoder that supports soft input and hard output
  • Decoder based on neural network training.
  • the first decoder may be a decoder that supports soft input and soft output.
  • the first decoder can be a BP belief propagation decoder
  • the BP belief propagation decoder can use the syndrome corresponding to the BP belief propagation decoder as an input to perform decoding calculation, and can obtain the decoded code word , the shaped amplitude bits can be obtained based on the decoded codeword.
  • the first decoder may be a decoder that supports soft input and hard output.
  • the first decoder can be a list decoder
  • the list decoder can use the syndrome corresponding to the list decoder as an input to perform decoding calculations, and can obtain a decoding codeword, based on the decoding codeword Shaping amplitude bits can be obtained.
  • the first decoder may be a decoder obtained based on neural network training.
  • the first decoder can be a BP decoder obtained based on Deep Neural Networks (Deep Neural Networks, DNN) training, that is, a DNN-BP decoder, and the DNN-BP decoder can be combined with the DNN-BP
  • DNN Deep Neural Networks
  • the syndrome corresponding to the decoder is used as input, and the decoding calculation is performed, and the decoding codeword can be obtained, and the shaping amplitude bits can be obtained based on the decoding codeword.
  • the first decoder can be any one of various types of decoders, and the first decoder can use the syndrome corresponding to the first decoder as input to perform decoding calculations, and can obtain Decoding the codeword, based on the decoding codeword, the shaping amplitude bits can be obtained, so that the shaping amplitude bits can be close to the target amplitude probability distribution, and the probability shaping can be realized, and the small rate loss and low shaping complexity can be achieved. Under the signal-to-noise ratio and high spectral efficiency, the forming loss can be effectively reduced, and the performance of the communication system can be improved.
  • mapping the shaped amplitude bits to modulation constellation points includes:
  • the shaping amplitude bits and target polarity bits are mapped to the modulation constellation points.
  • the transmitting end can determine the target polarity bit based on the target transmission bit, and then perform mapping based on the target polarity bit and the shaping amplitude bit to uniquely determine the modulation constellation point.
  • the modulation constellation point can be uniquely determined by the shaping amplitude bit and the target polarity bit. Since the shaping amplitude bit is obtained by decoding according to the target amplitude probability distribution by the first decoder in the shaper, the shaping amplitude bit can be close to The target amplitude probability distribution can realize probability shaping, and can achieve small rate loss and low shaping complexity. Under high signal-to-noise ratio and high spectral efficiency, it can effectively reduce shaping loss and improve communication system performance.
  • the method before mapping the shaped amplitude bits to modulation constellation points, the method further includes:
  • the target polarity bit is determined based on the first polarity bit and the shaped magnitude bit.
  • the sending end performs serial-to-parallel conversion on the target sending bit, and can obtain the bit to be formed and the first polarity bit;
  • the sender can determine the bits to be shaped based on the target sent bits, and then based on the target amplitude probability distribution, input the bits to be shaped as the syndrome of the channel code to the shaper of the sender to obtain the shaped amplitude bits;
  • the sending end can determine the target polarity bit based on the first polarity bit and the shaping amplitude bit, and then based on the shaping amplitude bit and the target polarity bit, unique Determine the modulation constellation points.
  • the sending end can be implemented based on the post-decomposition PAS architecture.
  • the sending end can input the bits to be shaped as the syndrome of the channel code into the shaper based on the target amplitude probability distribution to obtain the shaped amplitude bits, and then based on Shape amplitude bits and target polarity bits to get modulation constellation points.
  • the transmitter can convert the M-QAM complex constellation modulation into two real-number Modulation, calculated based on Signal-to-Noise Ratio (SNR)
  • SNR Signal-to-Noise Ratio
  • the modulated target probability distribution P ⁇ , P ⁇ can be The optimal probability distribution for modulation, BRGC binary labels can be used, and the probability distribution P ⁇ can be further decoupled into the target amplitude probability distribution P A and the target polarity probability distribution P S ,
  • the sending end can be implemented based on the post-decomposition PAS architecture, and the sending end can input the bits to be shaped as the syndrome of the channel code into the shaper based on the target amplitude probability distribution to obtain the shaped amplitude bits, so that the shaped amplitude bits can be Close to the target amplitude probability distribution, probability shaping can be realized, and small rate loss and low shaping complexity can be achieved. Under high signal-to-noise ratio and high spectral efficiency, shaping loss can be effectively reduced, and communication system performance can be improved.
  • the determining the target polarity bit based on the first polarity bit and the shaping amplitude bit includes:
  • the sending end performs serial-to-parallel conversion on the target sending bit, and can obtain the bit to be formed and the first polarity bit;
  • the sender can determine the bits to be shaped based on the target sent bits, and then based on the target amplitude probability distribution, input the bits to be shaped as the syndrome of the channel code to the shaper of the sender to obtain the shaped amplitude bits;
  • the sending end can perform forward error correction coding on the first polarity bit and the shaping amplitude bit, obtain the first parity bit, and then perform the first verification bit
  • the serial-to-parallel conversion of the bit and the first polarity bit can obtain the target polarity bit, and then based on the shaping amplitude bit and the target polarity bit, the modulation constellation point can be uniquely determined.
  • the sending end can be implemented based on the post-decomposition PAS architecture, and the sending end can input the bits to be shaped as the syndrome of the channel code into the shaper based on the target amplitude probability distribution to obtain the shaped amplitude bits, so that the shaped amplitude bits can be Close to the target amplitude probability distribution, probability shaping can be realized, and small rate loss and low shaping complexity can be achieved. Under high signal-to-noise ratio and high spectral efficiency, shaping loss can be effectively reduced, and communication system performance can be improved.
  • the method before obtaining the shaped amplitude bits through the first decoder dedicated to the channel code based on the target amplitude probability distribution and the bits to be shaped, the method further includes:
  • the sending end can perform forward error correction coding on the target transmission bit, can obtain the first code word, and then perform serial-to-parallel conversion on the first code word, and can obtain the bit to be formed and the target polarity bit;
  • the sender can input the bits to be shaped as the syndrome of the channel code to the shaper of the sender based on the target amplitude probability distribution, and can obtain the shaped amplitude bits, and then based on the shaped amplitude bits and
  • the target polarity bit can uniquely determine the modulation constellation point.
  • FIG. 6 is a schematic diagram of a front-end solution-based PAS architecture provided by an embodiment of the present disclosure.
  • FIG. 6 is an optional example of the present disclosure, but not as a limitation of the present disclosure; as shown in FIG. 6 , the sending end It can be realized based on the pre-deformation PAS architecture.
  • the sender Based on the probability distribution of the target amplitude, the sender can input the bits to be shaped as the syndrome of the channel code into the shaper to obtain the shaped amplitude bits, and then based on the shaped amplitude bits and the target pole Sex bits, get modulation constellation points.
  • the sender performs forward error correction coding first, and then performs probabilistic shaping on the codewords of the error correction code.
  • the transmitter can convert the M-QAM complex constellation modulation into two real-number Modulation, calculated based on Signal-to-Noise Ratio (SNR)
  • SNR Signal-to-Noise Ratio
  • the modulated target probability distribution P ⁇ , P ⁇ can be The optimal probability distribution for modulation, BRGC binary labels can be used, and the probability distribution P ⁇ can be further decoupled into the target amplitude probability distribution P A and the target polarity probability distribution P S ,
  • the sending end can be implemented based on the pre-decomposition PAS architecture, and the sending end can input the bits to be shaped as the syndrome of the channel code into the shaper based on the target amplitude probability distribution to obtain the shaped amplitude bits, so that the shaped amplitude bits can be Close to the target amplitude probability distribution, probability shaping can be realized, and small rate loss and low shaping complexity can be achieved. Under high signal-to-noise ratio and high spectral efficiency, shaping loss can be effectively reduced, and communication system performance can be improved.
  • the method before obtaining the shaped amplitude bits through the first decoder dedicated to the channel code based on the target amplitude probability distribution and the bits to be shaped, the method further includes:
  • the target amplitude probability distribution is determined based on a target signal-to-noise ratio SNR and a target modulation order.
  • the transmitting end can determine the bits to be shaped based on the target transmission bits, and can determine the target amplitude probability distribution based on the target signal-to-noise ratio SNR and the target modulation order;
  • the sender can input the bits to be shaped as the syndrome of the channel code to the shaper of the sender based on the target amplitude probability distribution to obtain the shaped amplitude bits, and then based on Shaping amplitude bits and target polarity bits can uniquely determine modulation constellation points.
  • the sender can convert the M-QAM complex constellation modulation into two real-number modulation
  • the target modulation order can be Based on the target signal-to-noise ratio SNR and the target modulation order
  • the process of determining the target amplitude probability distribution may include:
  • the ASK modulation constellation point obeys the MB (Maxwell-Boltzmann) distribution and the binary label is BRGC.
  • the constellation point is decomposed into 1 polarity bit S and (m-1) amplitude bits A,
  • the probability distribution of magnitude A is
  • the polarity distribution of the constellation points is ASK constellation point probability is
  • the target amplitude probability distribution can be determined.
  • the transmitter can input the bits to be shaped as the syndrome of the channel code into the shaper to obtain the shaped amplitude bits.
  • the shaping amplitude bits can be close to the target amplitude probability distribution, the probability shaping can be realized, and the smaller rate loss and lower shaping complexity can be realized.
  • the probability shaping mapping method provided by the embodiment of the present disclosure can decode according to the target amplitude probability distribution through the first decoder dedicated to the channel code, and then can obtain the shaping amplitude bits, so that the shaping amplitude bits can approach the target amplitude probability distribution , can realize probabilistic shaping, and can achieve small rate loss and low shaping complexity. Under high signal-to-noise ratio and high spectral efficiency, it can effectively reduce shaping loss and improve communication system performance.
  • Fig. 7 is one of the flow diagrams of the probabilistic solution modeling receiving processing method provided by the embodiment of the present disclosure. As shown in Fig. 7, the embodiment of the present disclosure provides a probabilistic solution forming receiving processing method, and the execution subject may be the receiving end .
  • the method includes:
  • Step 701 decomposing the received signal
  • the shaped amplitude bits corresponding to the received signal are acquired by the first decoder dedicated to the channel code based on the target amplitude probability distribution and the bits to be shaped.
  • the receiving end can decompose the received signal based on the received signal, and can obtain the target transmission bit corresponding to the received signal, wherein the shaped amplitude bit corresponding to the received signal can be the first decoder dedicated to the channel code based on the target Amplitude probability distributions and bit acquisition to be shaped.
  • the sending end may include a shaper
  • the shaper may include a first decoder of the channel code
  • the input of the shaper may include bits to be shaped
  • the bits to be shaped may be used as a syndrome of the channel code
  • the target The amplitude probability distribution may be a target probability distribution of the shaping amplitude
  • the bits to be shaped may be determined based on the target sending bits.
  • the receiving end may be a terminal, such as a mobile phone.
  • the receiving end may be a network side device, such as a base station.
  • the receiving end may be implemented based on the post-decomposition PAS architecture, and the receiving end may obtain the target transmission bit corresponding to the received signal based on the received signal.
  • the receiving end may be implemented based on the pre-decomposed PAS architecture, and the receiving end may obtain the target transmission bit corresponding to the received signal based on the received signal.
  • the shaping amplitude bits corresponding to the received signal can be constructed through the channel code, and the probability shaping code can be realized by obtaining the target transmission bit corresponding to the received signal based on the received signal.
  • the PAS architecture can effectively reduce the forming loss and improve the performance of the communication system under the condition of high signal-to-noise ratio and high spectral efficiency.
  • the decomposing the received signal includes:
  • the receiving end inputs the received signal to the demodulator to obtain demodulation information, and then inputs the demodulation information to the forward error correction decoder to obtain the shaping amplitude bit and the first polarity bit, and then the shaping
  • the amplitude bits are input to the deshaper, and the bits to be shaped can be obtained, and then based on the bits to be shaped and the first polarity bit, the target transmission bit can be determined.
  • the receiving end can be implemented based on the post-decomposition PAS architecture, and the receiving end can obtain the target transmission bit corresponding to the received signal based on the received signal, and the shaped amplitude bit corresponding to the received signal is the shaper based on the target amplitude probability distribution acquisition, the input of the shaper includes the bits to be shaped, which are used as syndromes of the channel code, the target amplitude probability distribution is the target probability distribution of the shaped amplitude, and the bits to be shaped are determined based on the target transmission bits.
  • the receiving end can be implemented based on the post-decomposition PAS architecture, the shaping amplitude bits corresponding to the received signal can be constructed through the channel code, and the receiving end can obtain the target transmission bit corresponding to the received signal based on the received signal, which can realize the For the deshaping of probabilistic shaping codes, the PAS architecture can effectively reduce the shaping loss and improve the performance of the communication system under the condition of high signal-to-noise ratio and high spectral efficiency.
  • the inputting the shaping amplitude bits to the de-shaping device to obtain the bits to be shaped includes:
  • the shaping amplitude bit is a hard value bit
  • the shaping amplitude bit is input to the de-shaping device to obtain the bit to be shaped, and the bit to be shaped is the channel
  • the receiving end inputs the received signal to the demodulator to obtain demodulation information, and then inputs the demodulation information to the forward error correction decoder to obtain the shaping amplitude bit and the first polarity bit;
  • the shaped amplitude bits can be input to the de-shaper to obtain the bits to be shaped, and the bits to be shaped can be The hard-value bits corresponding to the syndrome of the channel code, and further based on the bits to be shaped and the first polarity bits, can determine the target transmission bits.
  • the deformer at the receiving end can calculate the hard-value bit input and obtain the hard-value bit output based on the verification constraint relationship, and does not need to participate in Turbo iteration.
  • the receiving end can be implemented based on the post-decomposition PAS architecture, the shaping amplitude bits corresponding to the received signal can be constructed through the channel code, and the receiving end can obtain the target transmission bit corresponding to the received signal based on the received signal, which can realize the For the deshaping of probabilistic shaping codes, the PAS architecture can effectively reduce the shaping loss and improve the performance of the communication system under the condition of high signal-to-noise ratio and high spectral efficiency.
  • the inputting the shaping amplitude bits to the de-shaping device to obtain the bits to be shaped includes:
  • the de-shaping device inputting the shaping amplitude bits to the de-shaping device to obtain bits to be shaped, the de-shaping device includes a second decoder of the channel code,
  • the bits to be shaped are soft-value bits corresponding to the syndrome of the channel code.
  • the receiving end inputs the received signal to the demodulator to obtain demodulation information, and then inputs the demodulation information to the forward error correction decoder to obtain the shaping amplitude bit and the first polarity bit;
  • the shaped amplitude bits can be input to the de-shaper, and the bits to be shaped can be obtained, and the de-shaper can include the second channel code
  • the bit to be shaped may be a soft value bit corresponding to the syndrome of the channel code, and then based on the bit to be shaped and the first polarity bit, the target transmission bit may be determined.
  • the deformer at the receiving end can calculate the soft-value bit input based on the decoder of the channel code, obtain the soft-value bit output, and participate in Turbo iteration.
  • the receiving end can be implemented based on the post-decomposition PAS architecture, the shaping amplitude bits corresponding to the received signal can be constructed through the channel code, and the receiving end can obtain the target transmission bit corresponding to the received signal based on the received signal, which can realize the For the deshaping of probabilistic shaping codes, the PAS architecture can effectively reduce the shaping loss and improve the performance of the communication system under the condition of high signal-to-noise ratio and high spectral efficiency.
  • the decomposing the received signal includes:
  • the receiving end may demodulate and demodulate the received signal to obtain the second encoded codeword, and then may input the second encoded codeword to the forward error correction decoder to obtain the target transmission bit.
  • the receiving end can be implemented based on the pre-decomposed PAS architecture, and the receiving end can obtain the target transmission bit corresponding to the received signal based on the received signal, and the shaped amplitude bit corresponding to the received signal is based on the target amplitude probability of the shaper distribution acquisition, the input of the shaper includes the bits to be shaped, which are used as syndromes of the channel code, the target amplitude probability distribution is the target probability distribution of the shaped amplitude, and the bits to be shaped are determined based on the target transmission bits.
  • the receiving end performs decoding first, and then performs forward error correction decoding.
  • the receiver can perform demodulation and then demodulation, or joint demodulation and demodulation, and then output soft bits to the forward error correction decoder to recover the target transmission bits.
  • the joint demodulation and shaping process may include: calculating the posterior probability according to the received signal and the shaping verification constraint relationship, and outputting the soft bits to the forward error correction decoder.
  • the process of performing demodulation first and then deshaping may include: the demodulator outputs demodulation information (which may be a probability value) according to the received signal, and then the demodulator can perform probabilistic calculation based on the demodulation information and the shaping verification constraint relationship. Correction, output soft bits to forward error correction decoder.
  • demodulation information which may be a probability value
  • the shaping codes based on CCDM and ESS cannot support soft-input and soft-output detection, and are not suitable for the PAS architecture with pre-decoding and better performance Turbo receivers, while the shaping codes based on channel codes can support soft-input and soft-output detection. Input soft output detection can be applied to pre-decomposed PAS architecture and Turbo receiver with better performance.
  • the receiving end can be implemented based on the pre-decomposed PAS architecture, the shaping amplitude bits corresponding to the received signal can be constructed through the channel code, and the receiving end can obtain the target transmission bit corresponding to the received signal based on the received signal, which can realize the For the deshaping of probabilistic shaping codes, the PAS architecture can effectively reduce the shaping loss and improve the performance of the communication system under the condition of high signal-to-noise ratio and high spectral efficiency.
  • the demodulating and demodulating the received signal to obtain a second codeword includes:
  • the demodulation information is a soft-value bit
  • the demodulation information is input to the demodulator to obtain the second encoded codeword, and the demodulator includes the second code word of the channel code.
  • a decoder wherein the second encoded codeword is a soft value bit corresponding to a syndrome of the channel code.
  • the receiving end can input the received signal to the demodulator to obtain demodulation information
  • the demodulation information can be input to the demodulator to obtain the second encoded codeword, and the demodulation unit can include the first code word of the channel code
  • the second encoded codeword may be a soft value bit corresponding to the syndrome of the channel code, and then the second encoded codeword may be input to the forward error correction decoder to obtain the target transmission bit.
  • the decoder at the receiving end can calculate the soft-value bit input based on the channel code decoder, obtain the soft-value bit output, and participate in Turbo iteration.
  • the receiving end can be implemented based on the pre-decomposed PAS architecture, the shaping amplitude bits corresponding to the received signal can be constructed through the channel code, and the receiving end can obtain the target transmission bit corresponding to the received signal based on the received signal, which can realize the For the deshaping of probabilistic shaping codes, the PAS architecture can effectively reduce the shaping loss and improve the performance of the communication system under the condition of high signal-to-noise ratio and high spectral efficiency.
  • the demodulating and demodulating the received signal to obtain a second codeword includes:
  • the demodulation information is a soft-valued bit
  • the demodulation information is input to the demodulator to obtain the second encoded codeword
  • the demodulator includes a third code word of the channel code.
  • a decoder wherein the second encoded codeword is a hard value bit corresponding to a syndrome of the channel code.
  • the receiving end can input the received signal to the demodulator to obtain demodulation information
  • the demodulation information can be input to the demodulator to obtain the second encoded codeword, and the demodulation unit can include the first code word of the channel code
  • the second encoded codeword may be a hard value bit corresponding to the syndrome of the channel code, and then the second encoded codeword may be input to the forward error correction decoder to obtain the target transmission bit.
  • the decoder at the receiving end can calculate the soft-value bit input based on the channel code decoder, and obtain the hard-value bit output without participating in Turbo iteration.
  • the receiving end can be implemented based on the pre-decomposed PAS architecture, the shaping amplitude bits corresponding to the received signal can be constructed through the channel code, and the receiving end can obtain the target transmission bit corresponding to the received signal based on the received signal, which can realize the For the deshaping of probabilistic shaping codes, the PAS architecture can effectively reduce the shaping loss and improve the performance of the communication system under the condition of high signal-to-noise ratio and high spectral efficiency.
  • the decomposing the received signal includes:
  • the target transmission bit corresponding to the received signal is obtained.
  • a Turbo iterative receiver demodulation, deshaping, and interactive iteration between decoders
  • a non-Turbo iterative serial receiver can also be used
  • only hard-output de-shapers can use non-Turbo iterative serial receivers.
  • the receiving end can be implemented based on the post-deformation PAS architecture, and the receiving end can obtain the target transmission bit corresponding to the received signal based on the Turbo iterative process between the demodulator, the de-shaping device, and the forward error correction decoder. .
  • the receiving end can be implemented based on the pre-deformation PAS architecture, and the receiving end can obtain the target transmission bit corresponding to the received signal based on the Turbo iterative process between the demodulator, the de-shaping device and the forward error correction decoder .
  • FIG. 8 is the second schematic flow diagram of the probabilistic solution-based receiving processing method provided by the embodiment of the present disclosure.
  • FIG. 8 is an optional example of the present disclosure, but it is not a limitation of the present disclosure; as shown in FIG. 8 Show:
  • the shaping code constructed by the channel code can support soft-input and soft-output deshaping (for example, based on LDPC code), so the post-decoding PAS architecture can also support the Turbo receiver.
  • the receiving end can be based on The optimal probability distribution P ⁇ of the modulation and the demodulation of the received signal calculate the soft bit value, and then send it to the SFEC decoder for decoding to obtain the first polarity bit Us and the shaping amplitude bit A, and the soft value of A is sent to the deshaper Obtain the bit Ua to be formed.
  • the soft value of A of the de-shaper is input to the SFEC decoder to participate in Turbo iteration, which can obtain additional performance gains.
  • the receiving end can use a Turbo iterative receiver with higher complexity to perform interactive iterations among demodulation, deshaping and forward error correction decoding.
  • the shaping amplitude bits corresponding to the received signal can be constructed through the channel code, and the probability shaping code can be realized by obtaining the target transmission bit corresponding to the received signal based on the received signal.
  • the PAS architecture can effectively reduce the forming loss and improve the performance of the communication system under the condition of high signal-to-noise ratio and high spectral efficiency.
  • the bit layer can also be called the amplitude bit layer.
  • the frozen index set F and the information index set F c of the polar code can determine a code rate R according to the Sequence or density evolution in the 5G table.
  • a 1 A 2 ...A i-1 )+ ⁇ , ⁇ 0.08.
  • SFEC can be an LDPC code.
  • the receiving end can calculate the posterior probability according to the received signal y and the prior probability in Table 1 to obtain the soft bit input of SFEC decoding, and then decode to obtain Us and A.
  • the channel code of the shaper at the sending end can use a 32-ary Polar code
  • SFEC adopts LDPC code, and the de-shaper at the receiving end is based on Polar's BP belief propagation decoder, which implements iterative decoding and participates in LDPC iterative decoding in the Turbo receiver.
  • Fig. 9 is a schematic diagram of a belief propagation decoder based on a Tanner graph provided by an embodiment of the present disclosure.
  • LDPC code is used for channel coding
  • Turbo receiver can be used at the receiving end to perform interactive iterations among demodulation, deshaping and forward error correction decoding.
  • Every 4 bits of information bits to be transmitted (target transmission bits) are mapped to multi-ary symbols on GF(16), and loaded onto the syndrome symbols of LDPC codes, through BP decoding of multi-ary LDPC codes
  • the code algorithm obtains the code word symbol, and then converts it into a binary bit stream to obtain the shaping amplitude bit.
  • LDPC codes can be used for channel coding
  • Turbo receivers can be used at the receiving end to perform interactive iterations among demodulation, deshaping and forward error correction decoding.
  • the probability shaping mapping method provided by the embodiment of the present disclosure can decode according to the target amplitude probability distribution through the first decoder dedicated to the channel code, and then can obtain the shaping amplitude bits, so that the shaping amplitude bits can approach the target amplitude probability distribution , can realize probabilistic shaping, and can achieve small rate loss and low shaping complexity. Under high signal-to-noise ratio and high spectral efficiency, it can effectively reduce shaping loss and improve communication system performance.
  • the sending end may be a network side device, and the receiving end may be a terminal device.
  • Fig. 10 is one of the schematic structural diagrams of the network-side device provided by the embodiment of the present disclosure.
  • the network-side device includes a memory 1020, a transceiver 1000, and a processor 1010, wherein:
  • the memory 1020 is used to store computer programs; the transceiver 1000 is used to send and receive data under the control of the processor 1010; the processor 1010 is used to read the computer programs in the memory 1020 and perform the following operations:
  • the shaped amplitude bits are obtained through a first decoder dedicated to the channel code;
  • the shaped amplitude bits are mapped to modulation constellation points.
  • the transceiver 1000 is configured to receive and send data under the control of the processor 1010 .
  • the bus architecture may include any number of interconnected buses and bridges, specifically one or more processors represented by the processor 1010 and various circuits of the memory represented by the memory 1020 are linked together.
  • the bus architecture can also link together various other circuits such as peripherals, voltage regulators, and power management circuits, etc., which are well known in the art and therefore will not be further described herein.
  • the bus interface provides the interface.
  • Transceiver 1000 may be a plurality of elements, including a transmitter and a receiver, providing a unit for communicating with various other devices over transmission media, including wireless channels, wired channels, optical cables, and other transmission media.
  • the processor 1010 is responsible for managing the bus architecture and general processing, and the memory 1020 can store data used by the processor 1010 when performing operations.
  • the processor 1010 can be a central processing unit (Central Processing Unit, CPU), an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), a field programmable gate array (Field-Programmable Gate Array, FPGA) or a complex programmable logic device (Complex Programmable Logic Device, CPLD), the processor can also adopt a multi-core architecture.
  • CPU Central Processing Unit
  • ASIC Application Specific Integrated Circuit
  • FPGA Field-Programmable Gate Array
  • CPLD Complex Programmable Logic Device
  • the acquisition of the shaped amplitude bits through a first decoder dedicated to the channel code based on the target amplitude probability distribution and the bits to be shaped includes:
  • each bit layer corresponds to one of the first decoders
  • the decoding codewords corresponding to the multiple bit layers are obtained;
  • the shaped amplitude bits are obtained based on the decoded codewords respectively corresponding to the multiple bit layers.
  • the decoded codewords corresponding to the multiple bit layers are respectively obtained through the first decoders respectively corresponding to the multiple bit layers ,include:
  • decoding codewords respectively corresponding to the multiple bit layers are obtained.
  • the decoding codes corresponding to the multiple bit layers are respectively obtained. words, including:
  • the first decoding codeword includes decoding codewords respectively corresponding to all bit layers before the target bit layer, and the target bit layer is other bit layers except the first bit layer.
  • the determining the code rates respectively corresponding to the multiple bit layers based on the target amplitude probability distribution includes:
  • the acquisition of the shaped amplitude bits through a first decoder dedicated to the channel code based on the target amplitude probability distribution and the bits to be shaped includes:
  • the determining the code rate of the multi-ary channel code based on the target amplitude probability distribution includes:
  • the code rate of the multi-ary channel code is determined.
  • the first decoder includes any of the following:
  • a decoder that supports soft input and soft output
  • a decoder that supports soft input and hard output
  • Decoder based on neural network training.
  • mapping the shaped amplitude bits to modulation constellation points includes:
  • the shaping amplitude bits and target polarity bits are mapped to the modulation constellation points.
  • the operation before mapping the shaped amplitude bits to modulation constellation points, the operation further includes:
  • the target polarity bit is determined based on the first polarity bit and the shaped magnitude bit.
  • the determining the target polarity bit based on the first polarity bit and the shaping amplitude bit includes:
  • the operation before obtaining the shaped amplitude bits through the first decoder dedicated to the channel code based on the target amplitude probability distribution and the bits to be shaped, the operation further includes:
  • the operation before obtaining the shaped amplitude bits through the first decoder dedicated to the channel code based on the target amplitude probability distribution and the bits to be shaped, the operation further includes:
  • the target amplitude probability distribution is determined based on a target signal-to-noise ratio SNR and a target modulation order.
  • the above-mentioned network-side device provided by the embodiments of the present disclosure can implement all the method steps implemented in the above-mentioned method embodiment in which the execution subject is the network-side device in the downlink scenario, and can achieve the same technical effect. Parts and beneficial effects in this embodiment that are the same as those in the method embodiment will not be described in detail here.
  • Fig. 11 is one of the schematic structural diagrams of a terminal provided by an embodiment of the present disclosure. As shown in Fig. 11 , the terminal includes a memory 1120, a transceiver 1100, and a processor 1110, wherein:
  • the memory 1120 is used to store computer programs; the transceiver 1100 is used to send and receive data under the control of the processor 1110; the processor 1110 is used to read the computer programs in the memory 1120 and perform the following operations:
  • the shaped amplitude bits corresponding to the received signal are acquired by the first decoder dedicated to the channel code based on the target amplitude probability distribution and the bits to be shaped.
  • the transceiver 1100 is configured to receive and send data under the control of the processor 1110 .
  • the bus architecture may include any number of interconnected buses and bridges, specifically one or more processors represented by the processor 1110 and various circuits of the memory represented by the memory 1120 are linked together.
  • the bus architecture can also link together various other circuits such as peripherals, voltage regulators, and power management circuits, etc., which are well known in the art and therefore will not be further described herein.
  • the bus interface provides the interface.
  • the transceiver 1100 may be a plurality of elements, including a transmitter and a receiver, providing a unit for communicating with various other devices over transmission media, including wireless channels, wired channels, optical cables, and other transmission media.
  • the user interface 1130 may also be an interface capable of connecting externally and internally to required equipment, and the connected equipment includes but not limited to a keypad, a display, a speaker, a microphone, a joystick, and the like.
  • the processor 1110 is responsible for managing the bus architecture and general processing, and the memory 1120 can store data used by the processor 1110 when performing operations.
  • the processor 1110 may be a central processing unit (Central Processing Unit, CPU), an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), a field programmable gate array (Field-Programmable Gate Array, FPGA) or a complex programmable Logic device (Complex Programmable Logic Device, CPLD), the processor can also adopt a multi-core architecture.
  • CPU Central Processing Unit
  • ASIC Application Specific Integrated Circuit
  • FPGA Field-Programmable Gate Array
  • CPLD Complex Programmable Logic Device
  • the processor is used to execute any one of the methods provided by the embodiments of the present disclosure according to the obtained executable instructions by calling the computer program stored in the memory.
  • the processor and memory may also be physically separated.
  • the decomposing the received signal includes:
  • the target transmit bit is determined based on the bit to be shaped and the first polarity bit.
  • the inputting the shaping amplitude bits to the de-shaping device to obtain the bits to be shaped includes:
  • the shaping amplitude bit is a hard value bit
  • the shaping amplitude bit is input to the de-shaping device to obtain the bit to be shaped, and the bit to be shaped is the channel
  • the inputting the shaping amplitude bits to the de-shaping device to obtain the bits to be shaped includes:
  • the de-shaping device inputting the shaping amplitude bits to the de-shaping device to obtain bits to be shaped, the de-shaping device includes a second decoder of the channel code,
  • the bits to be shaped are soft-value bits corresponding to the syndrome of the channel code.
  • the decomposing the received signal includes:
  • the demodulating and demodulating the received signal to obtain a second codeword includes:
  • the demodulation information is a soft-value bit
  • the demodulation information is input to the demodulator to obtain the second encoded codeword, and the demodulator includes the second code word of the channel code.
  • a decoder wherein the second encoded codeword is a soft value bit corresponding to a syndrome of the channel code.
  • the demodulating and demodulating the received signal to obtain a second codeword includes:
  • the demodulation information is a soft-valued bit
  • the demodulation information is input to the demodulator to obtain the second encoded codeword
  • the demodulator includes a third code word of the channel code.
  • a decoder wherein the second encoded codeword is a hard value bit corresponding to a syndrome of the channel code.
  • the decomposing the received signal includes:
  • the target transmission bit corresponding to the received signal is obtained.
  • the above-mentioned terminal provided by the embodiment of the present invention can implement all the method steps implemented by the above-mentioned method embodiment in which the execution subject is the terminal in the downlink scenario, and can achieve the same technical effect, which will not be repeated here. Parts and beneficial effects in this embodiment that are the same as those in the method embodiment are specifically described in detail.
  • the receiving end may be a network side device, and the sending end may be a terminal device.
  • Fig. 12 is the second schematic structural diagram of the network-side device provided by the embodiment of the present disclosure.
  • the network-side device includes a memory 1220, a transceiver 1200, and a processor 1210, where:
  • the memory 1220 is used to store computer programs; the transceiver 1200 is used to send and receive data under the control of the processor 1210; the processor 1210 is used to read the computer programs in the memory 1220 and perform the following operations:
  • the shaped amplitude bits corresponding to the received signal are acquired by the first decoder dedicated to the channel code based on the target amplitude probability distribution and the bits to be shaped.
  • the transceiver 1200 is configured to receive and send data under the control of the processor 1210 .
  • the bus architecture may include any number of interconnected buses and bridges, specifically one or more processors represented by the processor 1210 and various circuits of the memory represented by the memory 1220 are linked together.
  • the bus architecture can also link together various other circuits such as peripherals, voltage regulators, and power management circuits, etc., which are well known in the art and therefore will not be further described herein.
  • the bus interface provides the interface.
  • the transceiver 1200 may be a plurality of elements, including a transmitter and a receiver, providing a unit for communicating with various other devices over transmission media, including wireless channels, wired channels, optical cables, and other transmission media.
  • the processor 1210 is responsible for managing the bus architecture and general processing, and the memory 1220 can store data used by the processor 1210 when performing operations.
  • the processor 1210 can be a central processing unit (Central Processing Unit, CPU), an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), a field programmable gate array (Field-Programmable Gate Array, FPGA) or a complex programmable logic device (Complex Programmable Logic Device, CPLD), the processor can also adopt a multi-core architecture.
  • CPU Central Processing Unit
  • ASIC Application Specific Integrated Circuit
  • FPGA Field-Programmable Gate Array
  • CPLD Complex Programmable Logic Device
  • the decomposing the received signal includes:
  • the target transmit bit is determined based on the bit to be shaped and the first polarity bit.
  • the inputting the shaping amplitude bits to the de-shaping device to obtain the bits to be shaped includes:
  • the shaping amplitude bit is a hard value bit
  • the shaping amplitude bit is input to the de-shaping device to obtain the bit to be shaped, and the bit to be shaped is the channel
  • the inputting the shaping amplitude bits to the de-shaping device to obtain the bits to be shaped includes:
  • the de-shaping device inputting the shaping amplitude bits to the de-shaping device to obtain bits to be shaped, the de-shaping device includes a second decoder of the channel code,
  • the bits to be shaped are soft-value bits corresponding to the syndrome of the channel code.
  • the decomposing the received signal includes:
  • the demodulating and demodulating the received signal to obtain a second codeword includes:
  • the demodulation information is a soft-value bit
  • the demodulation information is input to the demodulator to obtain the second encoded codeword, and the demodulator includes the second code word of the channel code.
  • a decoder wherein the second encoded codeword is a soft value bit corresponding to a syndrome of the channel code.
  • the demodulating and demodulating the received signal to obtain a second codeword includes:
  • the demodulation information is a soft-valued bit
  • the demodulation information is input to the demodulator to obtain the second encoded codeword
  • the demodulator includes a third code word of the channel code.
  • a decoder wherein the second encoded codeword is a hard value bit corresponding to a syndrome of the channel code.
  • the decomposing the received signal includes:
  • the target transmission bit corresponding to the received signal is obtained.
  • the above-mentioned network-side device provided by the embodiments of the present disclosure can implement all the method steps implemented in the above-mentioned method embodiment in which the execution subject is the network-side device in the uplink scenario, and can achieve the same technical effect.
  • the parts and beneficial effects in this embodiment that are the same as those in the method embodiment will not be described in detail here.
  • FIG. 13 is the second schematic structural diagram of a terminal provided by an embodiment of the present disclosure. As shown in FIG. 13 , the terminal includes a memory 1320, a transceiver 1300, and a processor 1310, where:
  • the memory 1320 is used to store computer programs; the transceiver 1300 is used to send and receive data under the control of the processor 1310; the processor 1310 is used to read the computer programs in the memory 1320 and perform the following operations:
  • the shaped amplitude bits are obtained through a first decoder dedicated to the channel code;
  • the shaped amplitude bits are mapped to modulation constellation points.
  • the transceiver 1300 is configured to receive and send data under the control of the processor 1310 .
  • the bus architecture may include any number of interconnected buses and bridges, specifically one or more processors represented by the processor 1310 and various circuits of the memory represented by the memory 1320 are linked together.
  • the bus architecture can also link together various other circuits such as peripherals, voltage regulators, and power management circuits, etc., which are well known in the art and therefore will not be further described herein.
  • the bus interface provides the interface.
  • the transceiver 1300 may be a plurality of elements, including a transmitter and a receiver, providing a unit for communicating with various other devices over transmission media, including wireless channels, wired channels, optical cables, and other transmission media.
  • the user interface 1330 may also be an interface capable of connecting externally and internally to required devices, and the connected devices include but not limited to keypads, displays, speakers, microphones, joysticks, and the like.
  • the processor 1310 is responsible for managing the bus architecture and general processing, and the memory 1320 can store data used by the processor 1310 when performing operations.
  • the processor 1310 may be a central processing unit (Central Processing Unit, CPU), an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), a field programmable gate array (Field-Programmable Gate Array, FPGA) or a complex programmable Logic device (Complex Programmable Logic Device, CPLD), the processor can also adopt a multi-core architecture.
  • CPU Central Processing Unit
  • ASIC Application Specific Integrated Circuit
  • FPGA Field-Programmable Gate Array
  • CPLD Complex Programmable Logic Device
  • the processor is used to execute any one of the methods provided by the embodiments of the present disclosure according to the obtained executable instructions by calling the computer program stored in the memory.
  • the processor and memory may also be physically separated.
  • the acquisition of the shaped amplitude bits through a first decoder dedicated to the channel code based on the target amplitude probability distribution and the bits to be shaped includes:
  • each bit layer corresponds to one of the first decoders
  • the decoding codewords respectively corresponding to the multiple bit layers are obtained;
  • the shaped amplitude bits are obtained based on the decoded codewords respectively corresponding to the multiple bit layers.
  • the decoded codewords corresponding to the multiple bit layers are respectively obtained through the first decoders respectively corresponding to the multiple bit layers ,include:
  • decoding codewords respectively corresponding to the multiple bit layers are obtained.
  • the decoding codes corresponding to the multiple bit layers are respectively obtained. words, including:
  • the first decoding codeword includes decoding codewords respectively corresponding to all bit layers before the target bit layer, and the target bit layer is other bit layers except the first bit layer.
  • the determining the code rates respectively corresponding to the multiple bit layers based on the target amplitude probability distribution includes:
  • the code rates respectively corresponding to the multiple bit layers are determined.
  • the channel code is a multi-ary channel code
  • the based on the target amplitude probability distribution and the bit to be shaped obtains the shaped amplitude bit through a first decoder dedicated to the channel code, including:
  • the determining the code rate of the multi-ary channel code based on the target amplitude probability distribution includes:
  • the code rate of the multi-ary channel code is determined.
  • the first decoder includes any of the following:
  • a decoder that supports soft input and soft output
  • a decoder that supports soft input and hard output
  • Decoder based on neural network training.
  • mapping the shaped amplitude bits to modulation constellation points includes:
  • the shaping amplitude bits and target polarity bits are mapped to the modulation constellation points.
  • the operation before mapping the shaped amplitude bits to modulation constellation points, the operation further includes:
  • the target polarity bit is determined based on the first polarity bit and the shaped magnitude bit.
  • the determining the target polarity bit based on the first polarity bit and the shaping amplitude bit includes:
  • the operation before obtaining the shaped amplitude bits through the first decoder dedicated to the channel code based on the target amplitude probability distribution and the bits to be shaped, the operation further includes:
  • the operation before obtaining the shaped amplitude bits through the first decoder dedicated to the channel code based on the target amplitude probability distribution and the bits to be shaped, the operation further includes:
  • the target amplitude probability distribution is determined based on a target signal-to-noise ratio SNR and a target modulation order.
  • the above-mentioned terminal provided by the embodiment of the present invention can implement all the method steps implemented by the above-mentioned embodiment of the method in which the execution subject is the terminal in the uplink scenario, and can achieve the same technical effect. Parts and beneficial effects in the embodiment that are the same as those in the method embodiment are described in detail.
  • FIG. 14 is a schematic structural diagram of a probabilistic shaping mapping device provided by an embodiment of the present disclosure. As shown in FIG. 14 , the device 1400 is applied to the sending end, including: a first acquisition unit 1401 and a second acquisition unit 1402, wherein:
  • the first obtaining unit 1401 is configured to obtain the shaped amplitude bits through the first decoder dedicated to the channel code based on the target amplitude probability distribution and the bits to be shaped;
  • the second acquiring unit 1402 is configured to map the shaped amplitude bits into modulation constellation points.
  • the first obtaining unit is specifically configured to:
  • each bit layer corresponds to one of the first decoders
  • the decoding codewords corresponding to the multiple bit layers are obtained;
  • the shaped amplitude bits are obtained based on the decoded codewords respectively corresponding to the multiple bit layers.
  • the first acquiring unit is specifically configured to:
  • the shaped amplitude bits are obtained based on the decoded codewords respectively corresponding to the multiple bit layers.
  • the first acquiring unit is specifically configured to:
  • the first decoding codeword includes decoding codewords respectively corresponding to all bit layers before the target bit layer, and the target bit layer is other bit layers except the first bit layer.
  • the first acquiring unit is specifically configured to:
  • the first acquiring unit is specifically configured to:
  • the first acquiring unit is specifically configured to:
  • the code rate of the multi-ary channel code is determined.
  • the first decoder includes any of the following:
  • a decoder that supports soft input and soft output
  • a decoder that supports soft input and hard output
  • Decoder based on neural network training.
  • the second acquiring unit is specifically configured to:
  • the shaping amplitude bits and target polarity bits are mapped to the modulation constellation points.
  • the apparatus further includes a third acquisition unit, before mapping the shaped amplitude bits into modulation constellation points, the third acquisition unit is configured to:
  • the target polarity bit is determined based on the first polarity bit and the shaped magnitude bit.
  • the third acquiring unit is specifically configured to:
  • the device further includes a fourth acquisition unit, before acquiring the shaped amplitude bits through the first decoder dedicated to the channel code based on the target amplitude probability distribution and the bits to be shaped, the fourth acquisition unit Used for:
  • the device further includes a determining unit, before acquiring the shaped amplitude bits through the first decoder dedicated to the channel code based on the target amplitude probability distribution and the bits to be shaped, the determining unit is configured to:
  • the target amplitude probability distribution is determined based on a target signal-to-noise ratio SNR and a target modulation order.
  • Fig. 15 is a schematic structural diagram of a probabilistic solution-based receiving and processing device provided by an embodiment of the present disclosure. As shown in Fig. 15, the device 1500 is applied to the receiving end, including: a fifth acquisition unit 1501, wherein:
  • the fifth acquiring unit 1501 is configured to decompose the received signal
  • the shaped amplitude bits corresponding to the received signal are acquired by the first decoder dedicated to the channel code based on the target amplitude probability distribution and the bits to be shaped.
  • the fifth acquiring unit is specifically configured to:
  • the target transmit bit is determined based on the bit to be shaped and the first polarity bit.
  • the fifth acquiring unit is specifically configured to:
  • the shaping amplitude bit is a hard value bit
  • the shaping amplitude bit is input to the de-shaping device to obtain the bit to be shaped, and the bit to be shaped is the channel
  • the fifth acquiring unit is specifically configured to:
  • the de-shaping device inputting the shaping amplitude bits to the de-shaping device to obtain bits to be shaped, the de-shaping device includes a second decoder of the channel code,
  • the bits to be shaped are soft-value bits corresponding to the syndrome of the channel code.
  • the fifth acquiring unit is specifically configured to:
  • the fifth acquiring unit is specifically configured to:
  • the demodulation information is a soft-value bit
  • the demodulation information is input to the demodulator to obtain the second encoded codeword, and the demodulator includes the second code word of the channel code.
  • a decoder wherein the second encoded codeword is a soft value bit corresponding to a syndrome of the channel code.
  • the fifth acquiring unit is specifically configured to:
  • the demodulation information is a soft-valued bit
  • the demodulation information is input to the demodulator to obtain the second encoded codeword
  • the demodulator includes a third code word of the channel code.
  • a decoder wherein the second encoded codeword is a hard value bit corresponding to a syndrome of the channel code.
  • the fifth acquiring unit is specifically configured to:
  • the target transmission bit corresponding to the received signal is obtained.
  • each functional unit in each embodiment of the present disclosure may be integrated into one processing unit, each unit may exist separately physically, or two or more units may be integrated into one unit.
  • the above-mentioned integrated units can be implemented in the form of hardware or in the form of software functional units.
  • the integrated unit is realized in the form of a software function unit and sold or used as an independent product, it can be stored in a processor-readable storage medium.
  • the technical solution of the present disclosure is essentially or part of the contribution to the prior art, or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium , including several instructions to make a computer device (which may be a personal computer, a server, or a network device, etc.) or a processor (processor) execute all or part of the steps of the methods described in various embodiments of the present disclosure.
  • the aforementioned storage media include: U disk, mobile hard disk, read-only memory (Read-Only Memory, ROM), random access memory (Random Access Memory, RAM), magnetic disk or optical disc and other media that can store program codes. .
  • the embodiments of the present disclosure also provide a processor-readable storage medium, where the processor-readable storage medium stores a computer program, and the computer program is used to enable the processor to execute the information provided by the above-mentioned embodiments.
  • methods including, for example:
  • the shaped amplitude bits are obtained through a first decoder dedicated to the channel code;
  • the shaped amplitude bits are mapped to modulation constellation points.
  • Examples include:
  • the shaped amplitude bits corresponding to the received signal are acquired by the first decoder dedicated to the channel code based on the target amplitude probability distribution and the bits to be shaped.
  • the processor-readable storage medium can be any available medium or data storage device that can be accessed by a processor, including but not limited to magnetic storage (e.g., floppy disk, hard disk, magnetic tape, magneto-optical disk (MO), etc.), optical storage (e.g., CD, DVD, BD, HVD, etc.), and semiconductor memory (such as ROM, EPROM, EEPROM, non-volatile memory (NAND FLASH), solid-state drive (SSD)), etc.
  • magnetic storage e.g., floppy disk, hard disk, magnetic tape, magneto-optical disk (MO), etc.
  • optical storage e.g., CD, DVD, BD, HVD, etc.
  • semiconductor memory such as ROM, EPROM, EEPROM, non-volatile memory (NAND FLASH), solid-state drive (SSD)
  • the embodiments of the present disclosure may be provided as methods, systems, or computer program products. Accordingly, the present disclosure can take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present disclosure may take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, optical storage, etc.) having computer-usable program code embodied therein.
  • processor-executable instructions may also be stored in a processor-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, such that the instructions stored in the processor-readable memory produce a manufacturing product, the instruction device realizes the functions specified in one or more procedures of the flow chart and/or one or more blocks of the block diagram.
  • processor-executable instructions can also be loaded onto a computer or other programmable data processing device, causing a series of operational steps to be performed on the computer or other programmable device to produce a computer-implemented
  • the executed instructions provide steps for implementing the functions specified in the procedure or procedures of the flowchart and/or the block or blocks of the block diagrams.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Error Detection And Correction (AREA)

Abstract

本公开实施例提供一种概率成型的映射方法及概率解成型的接收处理方法,所述方法包括:基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特;将所述成型幅度比特映射为调制星座点。本公开实施例通过专用于信道码的第一译码器可以根据目标幅度概率分布进行译码,进而获取成型幅度比特,使得成型幅度比特可以接近目标幅度概率分布,可以实现较小的速率损失和较低的成型复杂度。

Description

概率成型的映射方法及概率解成型的接收处理方法
相关申请的交叉引用
本申请要求于2022年02月28日提交的申请号为202210190613.0,发明名称为“概率成型的映射方法及概率解成型的接收处理方法”的中国专利申请的优先权,其通过引用方式全部并入本文。
技术领域
本公开涉及无线通信技术领域,尤其涉及一种概率成型的映射方法及概率解成型的接收处理方法。
背景技术
随着新频段、超大规模和分布式天线、以及智能反射面等新技术的出现,未来通信系统中接收信噪比有望进一步提高,需要设计更高调制阶数的星座图以实现比特速率增强。然而,在高信噪比和高谱效下,基于等概率的矩形正交幅度调制(Quadrature Amplitude Modulation,QAM)星座调制存在较大成型损失,需要引入星座成型技术以避免这部分损失。
当星座成型的成型码码块较短时,基于恒定组合分布匹配(constant composition distribution matching,CCDM)的星座概率成型方案存在较大的速率损失问题,而基于枚举球成型(enumerative sphere shaping,ESS)的星座概率成型方案存储复杂度较高。
发明内容
本公开实施例提供一种概率成型的映射方法及概率解成型的接收处理方法,用以解决现有技术中星座概率成型存在较大的速率损失或存储复杂度较高的缺陷,实现较小的速率损失和较低的成型复杂度。
第一方面,本公开实施例提供一种概率成型的映射方法,应用于发送端,包括:
基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特;
将所述成型幅度比特映射为调制星座点。
可选地,根据本公开一个实施例的概率成型的映射方法,在所述信道码为二进制信道码的情况下,所述基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特,包括:
确定多个比特层,每一个比特层分别对应一个所述第一译码器;
基于所述目标幅度概率分布以及所述待成型比特,通过所述多个比特层分别对应的第一译码器,获取所述多个比特层分别对应的译码码字;
基于所述多个比特层分别对应的译码码字,获取所述成型幅度比特。
可选地,根据本公开一个实施例的概率成型的映射方法,所述基于所述目标幅度概率分布以及所述待成型比特,通过所述多个比特层分别对应的第一译码器,获取所述多个比特层分别对应的译码码字,包括:
基于目标幅度概率分布,确定多个比特层分别对应的码率;
基于所述待成型比特和所述多个比特层分别对应的码率,确定所述多个比特层分别对应的校验子;
基于所述多个比特层分别对应的所述第一译码器和所述多个比特层分别对应的校验子,获取所述多个比特层分别对应的译码码字。
可选地,根据本公开一个实施例的概率成型的映射方法,所述基于所述多个比特层分别对应的所述第一译码器和所述多个比特层分别对应的校验子,获取所述多个比特层分别对应的译码码字,包括:
将所述多个比特层中的第一个比特层对应的校验子输入所述第一个比特层对应的第一译码器,获取第一个比特层对应的译码码字;
对于多个比特层中的每一个目标比特层,将所述目标比特层对应的校验子和第一译码码字输入所述目标比特层对应的第一译码器,获取所述目标比特层对应的译码码字;
其中,所述第一译码码字包括所述目标比特层之前的全部比特层分别对应的译码码字,所述目标比特层为除所述第一个比特层之外的其他比特 层。
可选地,根据本公开一个实施例的概率成型的映射方法,所述基于目标幅度概率分布,确定所述多个比特层分别对应的码率,包括:
基于目标幅度概率分布,确定所述多个比特层中每一层的幅度比特分别对应的熵;
基于所述多个比特层分别对应的熵,确定所述多个比特层分别对应的码率。
可选地,根据本公开一个实施例的概率成型的映射方法,在所述信道码为多进制信道码的情况下,所述基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特,包括:
基于所述目标幅度概率分布确定多进制信道码的码率;
基于所述待成型比特和所述多进制信道码的码率,获取所述待成型比特对应的多进制待成型比特,所述多进制待成型比特用于作为所述第一译码器的校验子;
基于所述多进制待成型比特和所述目标幅度概率分布,通过所述第一译码器,获取所述多进制待成型比特对应的多进制译码码字;
将所述多进制译码码字转为二进制,获取所述成型幅度比特。
可选地,根据本公开一个实施例的概率成型的映射方法,所述基于所述目标幅度概率分布确定多进制信道码的码率,包括:
基于目标幅度概率分布,确定所有幅度比特对应的熵;
基于所述所有幅度比特对应的熵,确定所述多进制信道码的码率。
可选地,根据本公开一个实施例的概率成型的映射方法,所述第一译码器包括以下任一项:
支持软输入软输出的译码器;或
支持软输入硬输出的译码器;或
基于神经网络训练获得的译码器。
可选地,根据本公开一个实施例的概率成型的映射方法,所述将所述成型幅度比特映射为调制星座点,包括:
将所述成型幅度比特和目标极性比特映射为所述调制星座点。
可选地,根据本公开一个实施例的概率成型的映射方法,在所述将所述成型幅度比特映射为调制星座点之前,所述方法还包括:
获取目标发送比特;
对所述目标发送比特进行串并转换,获取所述待成型比特和第一极性比特;
基于所述第一极性比特和所述成型幅度比特,确定所述目标极性比特。
可选地,根据本公开一个实施例的概率成型的映射方法,所述基于所述第一极性比特和所述成型幅度比特,确定所述目标极性比特,包括:
对所述第一极性比特和所述成型幅度比特进行前向纠错编码,获取第一校验比特;
对所述第一校验比特和所述第一极性比特进行串并转换,获取所述目标极性比特。
可选地,根据本公开一个实施例的概率成型的映射方法,在所述基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特之前,所述方法还包括:
获取目标发送比特;
对所述目标发送比特进行前向纠错编码,获取第一编码码字;
对所述第一编码码字进行串并转换,获取所述待成型比特和所述目标极性比特。
第二方面,本公开实施例还提供一种概率解成型的接收处理方法,应用于接收端,包括:
对接收信号进行解成型;
其中,接收到的所述信号对应的成型幅度比特是专用于信道码的第一译码器基于目标幅度概率分布和待成型比特获取的。
可选地,根据本公开一个实施例的概率解成型的接收处理方法,所述对接收信号进行解成型,包括:
将所述接收信号输入到解调器,获取解调信息;
将所述解调信息输入到前向纠错译码器,获取所述成型幅度比特和第一极性比特;
将所述成型幅度比特输入到解成型器,获取待成型比特。
可选地,根据本公开一个实施例的概率解成型的接收处理方法,所述将所述成型幅度比特输入到解成型器,获取待成型比特,包括:
在所述成型幅度比特为硬值比特的情况下,基于校验约束关系,将所述成型幅度比特输入到所述解成型器,获取所述待成型比特,所述待成型比特为所述信道码的校验子对应的硬值比特。
可选地,根据本公开一个实施例的概率解成型的接收处理方法,所述将所述成型幅度比特输入到解成型器,获取待成型比特,包括:
在所述成型幅度比特为软值比特的情况下,将所述成型幅度比特输入到所述解成型器,获取待成型比特,所述解成型器包括所述信道码的第二译码器,所述待成型比特为所述信道码的校验子对应的软值比特。
可选地,根据本公开一个实施例的概率解成型的接收处理方法,所述对接收信号进行解成型,包括:
对所述接收信号进行解调解成型,获取第二编码码字;
将所述第二编码码字输入到前向纠错译码器,获取所述目标发送比特。
可选地,根据本公开一个实施例的概率解成型的接收处理方法,所述对所述接收信号进行解调解成型,获取第二编码码字,包括:
将所述接收信号输入到解调器,获取解调信息;
在所述解调信息为软值比特的情况下,将所述解调信息输入到所述解成型器,获取所述第二编码码字,所述解成型器包括所述信道码的第二译码器,所述第二编码码字为所述信道码的校验子对应的软值比特。
可选地,根据本公开一个实施例的概率解成型的接收处理方法,所述对所述接收信号进行解调解成型,获取第二编码码字,包括:
将所述接收信号输入到解调器,获取解调信息;
在所述解调信息为软值比特的情况下,将所述解调信息输入到所述解成型器,获取所述第二编码码字,所述解成型器包括所述信道码的第三译 码器,所述第二编码码字为所述信道码的校验子对应的硬值比特。
可选地,根据本公开一个实施例的概率解成型的接收处理方法,所述对接收信号进行解成型,包括:
基于所述解调器、所述解成型器和所述前向纠错译码器之间的Turbo迭代过程,获取所述接收信号对应的目标发送比特。
第三方面,本公开实施例还提供一种发送端,包括存储器,收发机,处理器:
存储器,用于存储计算机程序;收发机,用于在所述处理器的控制下收发数据;处理器,用于读取所述存储器中的计算机程序并执行以下操作:
基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特;
将所述成型幅度比特映射为调制星座点。
可选地,根据本公开一个实施例的发送端,在所述信道码为二进制信道码的情况下,所述基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特,包括:
确定多个比特层,每一个比特层分别对应一个所述第一译码器;
基于所述目标幅度概率分布以及所述待成型比特,通过所述多个比特层分别对应的第一译码器,获取所述多个比特层分别对应的译码码字;
基于所述多个比特层分别对应的译码码字,获取所述成型幅度比特。
可选地,根据本公开一个实施例的发送端,所述基于所述目标幅度概率分布以及所述待成型比特,通过所述多个比特层分别对应的第一译码器,获取所述多个比特层分别对应的译码码字,包括:
基于目标幅度概率分布,确定多个比特层分别对应的码率;
基于所述待成型比特和所述多个比特层分别对应的码率,确定所述多个比特层分别对应的校验子;
基于所述多个比特层分别对应的所述第一译码器和所述多个比特层分别对应的校验子,获取所述多个比特层分别对应的译码码字。
可选地,根据本公开一个实施例的发送端,所述基于所述多个比特层 分别对应的所述第一译码器和所述多个比特层分别对应的校验子,获取所述多个比特层分别对应的译码码字,包括:
将所述多个比特层中的第一个比特层对应的校验子输入所述第一个比特层对应的第一译码器,获取第一个比特层对应的译码码字;
对于多个比特层中的每一个目标比特层,将所述目标比特层对应的校验子和第一译码码字输入所述目标比特层对应的第一译码器,获取所述目标比特层对应的译码码字;
其中,所述第一译码码字包括所述目标比特层之前的全部比特层分别对应的译码码字,所述目标比特层为除所述第一个比特层之外的其他比特层。
可选地,根据本公开一个实施例的发送端,所述基于目标幅度概率分布,确定所述多个比特层分别对应的码率,包括:
基于目标幅度概率分布,确定所述多个比特层中每一层的幅度比特分别对应的熵;
基于所述多个比特层分别对应的熵,确定所述多个比特层分别对应的码率。
可选地,根据本公开一个实施例的发送端,在所述信道码为多进制信道码的情况下,所述基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特,包括:
基于所述目标幅度概率分布确定多进制信道码的码率;
基于所述待成型比特和所述多进制信道码的码率,获取所述待成型比特对应的多进制待成型比特,所述多进制待成型比特用于作为所述第一译码器的校验子;
基于所述多进制待成型比特和所述目标幅度概率分布,通过所述第一译码器,获取所述多进制待成型比特对应的多进制译码码字;
将所述多进制译码码字转为二进制,获取所述成型幅度比特。
可选地,根据本公开一个实施例的发送端,所述基于所述目标幅度概率分布确定多进制信道码的码率,包括:
基于目标幅度概率分布,确定所有幅度比特对应的熵;
基于所述所有幅度比特对应的熵,确定所述多进制信道码的码率。
可选地,根据本公开一个实施例的发送端,所述第一译码器包括以下任一项:
支持软输入软输出的译码器;或
支持软输入硬输出的译码器;或
基于神经网络训练获得的译码器。
可选地,根据本公开一个实施例的发送端,所述将所述成型幅度比特映射为调制星座点,包括:
将所述成型幅度比特和目标极性比特映射为所述调制星座点。
可选地,根据本公开一个实施例的发送端,在所述将所述成型幅度比特映射为调制星座点之前,所述操作还包括:
获取目标发送比特;
对所述目标发送比特进行串并转换,获取所述待成型比特和第一极性比特;
基于所述第一极性比特和所述成型幅度比特,确定所述目标极性比特。
可选地,根据本公开一个实施例的发送端,所述基于所述第一极性比特和所述成型幅度比特,确定所述目标极性比特,包括:
对所述第一极性比特和所述成型幅度比特进行前向纠错编码,获取第一校验比特;
对所述第一校验比特和所述第一极性比特进行串并转换,获取所述目标极性比特。
可选地,根据本公开一个实施例的发送端,在所述基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特之前,所述操作还包括:
获取目标发送比特;
对所述目标发送比特进行前向纠错编码,获取第一编码码字;
对所述第一编码码字进行串并转换,获取所述待成型比特和所述目标 极性比特。
第四方面,本公开实施例还提供一种接收端,包括存储器,收发机,处理器:
存储器,用于存储计算机程序;收发机,用于在所述处理器的控制下收发数据;处理器,用于读取所述存储器中的计算机程序并执行以下操作:
对接收信号进行解成型;
其中,接收到的所述信号对应的成型幅度比特是专用于信道码的第一译码器基于目标幅度概率分布和待成型比特获取的。
可选地,根据本公开一个实施例的接收端,所述对接收信号进行解成型,包括:
将所述接收信号输入到解调器,获取解调信息;
将所述解调信息输入到前向纠错译码器,获取所述成型幅度比特和第一极性比特;
将所述成型幅度比特输入到解成型器,获取待成型比特。
可选地,根据本公开一个实施例的接收端,所述将所述成型幅度比特输入到解成型器,获取待成型比特,包括:
在所述成型幅度比特为硬值比特的情况下,基于校验约束关系,将所述成型幅度比特输入到所述解成型器,获取所述待成型比特,所述待成型比特为所述信道码的校验子对应的硬值比特。
可选地,根据本公开一个实施例的接收端,所述将所述成型幅度比特输入到解成型器,获取待成型比特,包括:
在所述成型幅度比特为软值比特的情况下,将所述成型幅度比特输入到所述解成型器,获取待成型比特,所述解成型器包括所述信道码的第二译码器,所述待成型比特为所述信道码的校验子对应的软值比特。
可选地,根据本公开一个实施例的接收端,所述对接收信号进行解成型,包括:
对所述接收信号进行解调解成型,获取第二编码码字;
将所述第二编码码字输入到前向纠错译码器,获取所述目标发送比特。
可选地,根据本公开一个实施例的概率解成型的接收处理方法,所述对所述接收信号进行解调解成型,获取第二编码码字,包括:
将所述接收信号输入到解调器,获取解调信息;
在所述解调信息为软值比特的情况下,将所述解调信息输入到所述解成型器,获取所述第二编码码字,所述解成型器包括所述信道码的第二译码器,所述第二编码码字为所述信道码的校验子对应的软值比特。
可选地,根据本公开一个实施例的接收端,所述对所述接收信号进行解调解成型,获取第二编码码字,包括:
将所述接收信号输入到解调器,获取解调信息;
在所述解调信息为软值比特的情况下,将所述解调信息输入到所述解成型器,获取所述第二编码码字,所述解成型器包括所述信道码的第三译码器,所述第二编码码字为所述信道码的校验子对应的硬值比特。
可选地,根据本公开一个实施例的接收端,所述对接收信号进行解成型,包括:
基于所述解调器、所述解成型器和所述前向纠错译码器之间的Turbo迭代过程,获取所述接收信号对应的目标发送比特。
第五方面,本公开实施例还提供一种概率成型的映射装置,应用于发送端,包括:
第一获取单元,用于基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特;
第二获取单元,用于将所述成型幅度比特映射为调制星座点。
可选地,在所述信道码为二进制信道码的情况下,所述第一获取单元具体用于:
确定多个比特层,每一个比特层分别对应一个所述第一译码器;
基于所述目标幅度概率分布以及所述待成型比特,通过所述多个比特层分别对应的第一译码器,获取所述多个比特层分别对应的译码码字;
基于所述多个比特层分别对应的译码码字,获取所述成型幅度比特。
可选地,所述第一获取单元具体用于:
基于目标幅度概率分布,确定所述多个比特层分别对应的码率;
基于所述待成型比特和所述多个比特层分别对应的码率,确定所述多个比特层分别对应的校验子;
基于所述多个比特层分别对应的所述第一译码器和所述多个比特层分别对应的校验子,获取所述多个比特层分别对应的译码码字;
基于所述多个比特层分别对应的译码码字,获取所述成型幅度比特。
可选地,所述第一获取单元具体用于:
将所述多个比特层中的第一个比特层对应的校验子输入所述第一个比特层对应的第一译码器,获取第一个比特层对应的译码码字;
对于多个比特层中的每一个目标比特层,将所述目标比特层对应的校验子和第一译码码字输入所述目标比特层对应的第一译码器,获取所述目标比特层对应的译码码字;
其中,所述第一译码码字包括所述目标比特层之前的全部比特层分别对应的译码码字,所述目标比特层为除所述第一个比特层之外的其他比特层。
可选地,所述第一获取单元具体用于:
基于目标幅度概率分布,确定所述多个比特层中每一层的幅度比特分别对应的熵;
基于所述多个比特层分别对应的熵,确定所述多个比特层分别对应的码率。
可选地,在所述信道码为多进制信道码的情况下,所述第一获取单元具体用于:
基于所述目标幅度概率分布确定多进制信道码的码率;
基于所述待成型比特和所述多进制信道码的码率,获取所述待成型比特对应的多进制待成型比特,所述多进制待成型比特用于作为所述第一译码器的校验子;
基于所述多进制待成型比特和所述目标幅度概率分布,通过所述第一译码器,获取所述多进制待成型比特对应的多进制译码码字;
将所述多进制译码码字转为二进制,获取所述成型幅度比特。
可选地,所述第一获取单元具体用于:
基于目标幅度概率分布,确定所有幅度比特对应的熵;
基于所述所有幅度比特对应的熵,确定所述多进制信道码的码率。
可选地,所述第一译码器包括以下任一项:
支持软输入软输出的译码器;或
支持软输入硬输出的译码器;或
基于神经网络训练获得的译码器。
可选地,所述第二获取单元具体用于:
将所述成型幅度比特和目标极性比特映射为所述调制星座点。
可选地,所述装置还包括第三获取单元,在所述将所述成型幅度比特映射为调制星座点之前,所述第三获取单元用于:
获取目标发送比特;
对所述目标发送比特进行串并转换,获取所述待成型比特和第一极性比特;
基于所述第一极性比特和所述成型幅度比特,确定所述目标极性比特。
可选地,所述第三获取单元具体用于:
对所述第一极性比特和所述成型幅度比特进行前向纠错编码,获取第一校验比特;
对所述第一校验比特和所述第一极性比特进行串并转换,获取所述目标极性比特。
可选地,所述装置还包括第四获取单元,在所述基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特之前,所述第四获取单元用于:
获取目标发送比特;
对所述目标发送比特进行前向纠错编码,获取第一编码码字;
对所述第一编码码字进行串并转换,获取所述待成型比特和所述目标极性比特。
可选地,所述装置还包括确定单元,在所述基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特之前,所述确定单元用于:
基于目标信噪比SNR和目标调制阶数,确定所述目标幅度概率分布。
第六方面,本公开实施例还提供一种概率解成型的接收处理装置,应用于接收端,包括:
第五获取单元,用于对接收信号进行解成型;
其中,接收到的所述信号对应的成型幅度比特是专用于信道码的第一译码器基于目标幅度概率分布和待成型比特获取的,所述成型器包括第一译码器,所述第一译码器对应的信道码的校验子是基于所述待成型比特确定的。
可选地,所述第五获取单元具体用于:
将所述接收信号输入到解调器,获取解调信息;
将所述解调信息输入到前向纠错译码器,获取所述成型幅度比特和第一极性比特;
将所述成型幅度比特输入到解成型器,获取待成型比特;
基于所述待成型比特和所述第一极性比特,确定所述目标发送比特。
可选地,所述第五获取单元具体用于:
在所述成型幅度比特为硬值比特的情况下,基于校验约束关系,将所述成型幅度比特输入到所述解成型器,获取所述待成型比特,所述待成型比特为所述信道码的校验子对应的硬值比特。
可选地,所述第五获取单元具体用于:
在所述成型幅度比特为软值比特的情况下,将所述成型幅度比特输入到所述解成型器,获取待成型比特,所述解成型器包括所述信道码的第二译码器,所述待成型比特为所述信道码的校验子对应的软值比特。
可选地,所述第五获取单元具体用于:
对所述接收信号进行解调解成型,获取第二编码码字;
将所述第二编码码字输入到前向纠错译码器,获取所述目标发送比特。
可选地,所述第五获取单元具体用于:
将所述接收信号输入到解调器,获取解调信息;
在所述解调信息为软值比特的情况下,将所述解调信息输入到所述解成型器,获取所述第二编码码字,所述解成型器包括所述信道码的第二译码器,所述第二编码码字为所述信道码的校验子对应的软值比特。
可选地,所述第五获取单元具体用于:
将所述接收信号输入到解调器,获取解调信息;
在所述解调信息为软值比特的情况下,将所述解调信息输入到所述解成型器,获取所述第二编码码字,所述解成型器包括所述信道码的第三译码器,所述第二编码码字为所述信道码的校验子对应的硬值比特。
可选地,所述第五获取单元具体用于:
基于所述解调器、所述解成型器和所述前向纠错译码器之间的Turbo迭代过程,获取所述接收信号对应的目标发送比特。
第七方面,本公开实施例还提供一种处理器可读存储介质,所述处理器可读存储介质存储有计算机程序,所述计算机程序用于使所述处理器执行如上所述第一方面所述的概率成型的映射方法的步骤,或执行如上所述第二方面所述的概率解成型的接收处理方法的步骤。
本公开实施例提供的概率成型的映射方法及概率解成型的接收处理方法,通过专用于信道码的第一译码器可以根据目标幅度概率分布进行译码,进而可以获取成型幅度比特,使得成型幅度比特可以接近目标幅度概率分布,可以实现概率成型,且可以实现较小的速率损失和较低的成型复杂度,在高信噪比和高谱效下,可有效降低成型损失,可以提高通信系统性能。
附图说明
为了更清楚地说明本公开实施例或现有技术中的技术方案,下面将对实施例或现有技术描述中所需要使用的附图作一简单地介绍,显而易见地,下面描述中的附图是本公开的一些实施例,对于本领域普通技术人员来讲, 在不付出创造性劳动的前提下,还可以根据这些附图获得其他的附图。
图1是相关技术提供的后置解成型PAS架构的示意图;
图2是相关技术提供的8-ASK二进制索引标号的示意图;
图3是本公开实施例提供的概率成型的映射方法的流程示意图之一;
图4是本公开实施例提供的概率成型的映射方法的流程示意图之二;
图5是本公开实施例提供的概率成型的映射方法的流程示意图之三;
图6是本公开实施例提供的前置解成型PAS架构的示意图;
图7是本公开实施例提供的概率解成型的接收处理方法的流程示意图之一;
图8是本公开实施例提供的概率解成型的接收处理方法的流程示意图之二;
图9是本公开实施例提供的基于Tanner图的置信传播译码器的示意图;
图10是本公开实施例提供的网络侧设备的结构示意图之一;
图11是本公开实施例提供的终端的结构示意图之一;
图12是本公开实施例提供的网络侧设备的结构示意图之二;
图13是本公开实施例提供的终端的结构示意图之二;
图14是本公开实施例提供的概率成型的映射装置的结构示意图;
图15是本公开实施例提供的概率解成型的接收处理装置的结构示意图。
具体实施方式
为了便于更加清晰地理解本公开各实施例,首先对一些相关的背景知识进行如下介绍。
在带宽受限的高阶调制系统中,相较于等概率的矩形QAM调制,系统的总增益可以通过编码增益和成型增益两部分获得。编码增益主要由信道编码的距离谱特性决定,成型增益取决于调制星座图的设计。通过设计最优的星座图,通信系统在高谱效、高信噪比下,可以获得大约1.53dB渐进增益。
星座成型技术是一种通过调节星座点距离或出现概率使得信号逼近信道最佳输入分布的技术。基于星座成型技术,带宽受限的高阶调制系统可以获得成型增益。信号星座成形基本上可以划分为:
(1)几何成型(Geometry Shaping,GS);
几何成型认为每个星座点等概率使用,通过寻找最佳星座点的位置,或者设计星座点之间的不等间隔距离,使得信号星座的几何形状类似于超球体;
(2)概率成型(Probability Shaping,PS);
概率成型(Probability Shaping,PS)认为每个星座点间等距离,通过采用信号叠加以及成型器(Shaper)来改变这些矩形QAM等距离的星座点使用概率,从而实现发送信号与信道最佳输入分布逼近。
按照维度划分,GS成型和PS成型可以进一步划分为一维成型和多维成型:
(1)一维成型;
一维成型仅考虑一个资源块(Resource Element,RE)上的星座点,所以仅需调节一个复数平面上星座点的坐标距离,或者一个复数平面上矩形QAM星座点的使用概率;
(2)多维成型;
多维成型把多个RE上星座点看作一个复向量/序列,联合调节复向量/序列星座点在高维空间中的几何形状,或者高维空间中的矩形QAM星座点使用概率。
图1是相关技术提供的后置解成型PAS架构的示意图,如图1所示,解成型器位于信道译码器后面。在后置解成型概率幅度成型(Probability Amplitude Shaping,PAS)架构的方案中,通过把复数QAM星座看作两路实数的ASK(Amplitude Shift Keying,ASK)调制,并且把ASK星座点的正负极性与幅度解耦合,只需要调节ASK幅度出现的概率,而正负极性独立等概率不需要调节。
以64QAM调制为例,星座调制被分解为两路8-ASK,8-ASK的二进 制索引(Binary Reflected Gray Code,BRGC)采用三比特进行标号。
图2是相关技术提供的8-ASK二进制索引标号的示意图,如图2所示,从二进制标号可以看出,最高位比特表示正负极性,低两位表示幅度并且左右对称。
在PAS成型方案中,发送端将待传输的二进制比特流经过串并转换后,划分为Ua和Us两部分,其中Ua通过成型器获得成型幅度比特A,Us和A作为系统前向纠错码(Systematic Forward Error-correction Code,SFEC)的系统位输入,编码得到SFEC纠错码的校验比特P,Us与P合并为极性比特S。最终,A和S唯一确定ASK星座点。特殊地,当Us为空集时,校验比特P直接由幅度比特A经过SFEC编码获得。
接收端根据接收信号先经过解调获得解调信息,然后经SFEC译码以及解成型获得发送比特。该方案采用后置解成型模块,因此不要求成型码支持软检测。在整个PAS系统中,SFEC可以基于任意的系统信道纠错码设计,成型器是整个系统设计的关键,通常基于CCDM或ESS成型码实现。下面介绍基于CCDM的成型器和基于ESS的成型器:
(1)基于CCDM的成型器;
给定目标幅度概率分布P A,基于CCDM的成型器将二进制比特流映射为一个长度为n的序列C=C 1C 2…C n,例如基于算术编码。序列C的经验分布为
Figure PCTCN2022134093-appb-000001
其中n x(c)表示序列C中x出现的次数,
Figure PCTCN2022134093-appb-000002
Figure PCTCN2022134093-appb-000003
或者
Figure PCTCN2022134093-appb-000004
具体上下取整方式可以通过求解最小化差熵D(P c||P A)来确定。例如,
Figure PCTCN2022134093-appb-000005
Figure PCTCN2022134093-appb-000006
n=4,那么
Figure PCTCN2022134093-appb-000007
Figure PCTCN2022134093-appb-000008
满足分布的序列C总共有
Figure PCTCN2022134093-appb-000009
种(C=a 3a 3a 1a 2,C=a 3a 3a 2a 1,C=a 1a 3a 3a 2,C=a 2a 3a 3a 1…),序列C可以加载
Figure PCTCN2022134093-appb-000010
比特信息,此时速率损失为
Figure PCTCN2022134093-appb-000011
H(.)表示计算信息熵。当n比较小时,满足经验分布的序列C数量远小于n·H(A),因此基于CCDM的成型器会导致速率损失R Loss值较大。
(2)基于ESS的成型器;
基于ESS的成型器将二进制比特流映射为一个长度为n的序列C=C 1C 2…C n,序列满足能量约束条件
Figure PCTCN2022134093-appb-000012
即可。满足ESS约束条件的序列C远多于满足CCDM约束条件的序列C,并且更接近n·H(A)种,因此基于ESS的成型器速率损失值R Loss较小。对于所有满足能量约束的序列C(高维球体内点),可以通过查表(Look Up Table,LUT)或者能量受限格(Bounded Energy Trellis,BET)来描述索引号,从而实现概率成型。基于ESS的Shaper具体成型过程为:
确定E max和n,建立LUT或者BET;
根据输入的二进制比特流计算索引值i;
通过LUT查表或者BET路径回溯,查找索引值为i的序列C获得成型输出。
该算法的空间/存储复杂度为O(L(n+1)nR),
Figure PCTCN2022134093-appb-000013
计算复杂度为O(|A|nR)。可以看到,基于ESS的成型器计算复杂度关于n线性增长复杂度较低,但是存储复杂度关于n二次方增长,当n较大时,复杂度较高。
需要注意的是,基于CCDM或ESS的成型器通常不支持软输入软输出,因此需要结合后置解成型PAS架构。
当成型码码块较短时,传统基于CCDM的成型器存在较大的速率损失,而基于ESS的成型器虽然克服了速率损失缺点,但是成型码码块较大时,其存储复杂度较高,不利于通信系统实际部署。
为了克服上述缺陷,本公开各实施例提供一种概率成型的映射方法及概率解成型的接收处理方法,通过专用于信道码的第一译码器可以根据目标幅度概率分布进行译码,可以实现概率成型,且可以实现较小的速率损失和较低的成型复杂度。
本公开实施例中术语“和/或”,描述关联对象的关联关系,表示可以存在三种关系,例如,A和/或B,可以表示:单独存在A,同时存在A和B,单独存在B这三种情况。字符“/”一般表示前后关联对象是一种“或”的关系。
本公开实施例中术语“多个”是指两个或两个以上,其它量词与之类似。
下面将结合本公开实施例中的附图,对本公开实施例中的技术方案进行清楚、完整地描述,显然,所描述的实施例仅仅是本公开一部分实施例,并不是全部的实施例。基于本公开中的实施例,本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其他实施例,都属于本公开保护的范围。
本公开实施例提供的技术方案可以适用于多种系统,尤其是5G系统。例如适用的系统可以是全球移动通讯(global system of mobile communication,GSM)系统、码分多址(code division multiple access,CDMA)系统、宽带码分多址(Wideband Code Division Multiple Access,WCDMA)通用分组无线业务(general packet radio service,GPRS)系统、长期演进(long term evolution,LTE)系统、LTE频分双工(frequency division duplex,FDD)系统、LTE时分双工(time division duplex,TDD)系统、高级长期演进(long term evolution advanced,LTE-A)系统、通用移动系统(universal mobile telecommunication system,UMTS)、全球互联微波接入(worldwide interoperability for microwave access,WiMAX)系统、5G新空口(New Radio,NR)系统等。这多种系统中均包括终端设备和网络设备。系统中还可以包括核心网部分,例如演进的分组系统(Evloved Packet System,EPS)、5G系统(5GS)等。
本公开实施例涉及的终端设备,可以是指向用户提供语音和/或数据连通性的设备,具有无线连接功能的手持式设备、或连接到无线调制解调器的其他处理设备等。在不同的系统中,终端设备的名称可能也不相同,例如在5G系统中,终端设备可以称为用户设备(User Equipment,UE)。无线终端设备可以经无线接入网(Radio Access Network,RAN)与一个或多个核心网(Core Network,CN)进行通信,无线终端设备可以是移动终端设备,如移动电话(或称为“蜂窝”电话)和具有移动终端设备的计算机,例如,可以是便携式、袖珍式、手持式、计算机内置的或者车载的 移动装置,它们与无线接入网交换语言和/或数据。例如,个人通信业务(Personal Communication Service,PCS)电话、无绳电话、会话发起协议(Session Initiated Protocol,SIP)话机、无线本地环路(Wireless Local Loop,WLL)站、个人数字助理(Personal Digital Assistant,PDA)等设备。无线终端设备也可以称为系统、订户单元(subscriber unit)、订户站(subscriber station),移动站(mobile station)、移动台(mobile)、远程站(remote station)、接入点(access point)、远程终端设备(remote terminal)、接入终端设备(access terminal)、用户终端设备(user terminal)、用户代理(user agent)、用户装置(user device),本公开实施例中并不限定。
本公开实施例涉及的网络设备,可以是基站,该基站可以包括多个为终端提供服务的小区。根据具体应用场合不同,基站又可以称为接入点,或者可以是接入网中在空中接口上通过一个或多个扇区与无线终端设备通信的设备,或者其它名称。网络设备可用于将收到的空中帧与网际协议(Internet Protocol,IP)分组进行相互更换,作为无线终端设备与接入网的其余部分之间的路由器,其中接入网的其余部分可包括网际协议(IP)通信网络。网络设备还可协调对空中接口的属性管理。例如,本公开实施例涉及的网络设备可以是全球移动通信系统(Global System for Mobile communications,GSM)或码分多址接入(Code Division Multiple Access,CDMA)中的网络设备(Base Transceiver Station,BTS),也可以是带宽码分多址接入(Wide-band Code Division Multiple Access,WCDMA)中的网络设备(NodeB),还可以是长期演进(long term evolution,LTE)系统中的演进型网络设备(evolutional Node B,eNB或e-NodeB)、5G网络架构(next generation system)中的5G基站(gNB),也可以是家庭演进基站(Home evolved Node B,HeNB)、中继节点(relay node)、家庭基站(femto)、微微基站(pico)等,本公开实施例中并不限定。在一些网络结构中,网络设备可以包括集中单元(centralized unit,CU)节点和分布单元(distributed unit,DU)节点,集中单元和分布单元也可以地理上分开布置。
网络设备与终端设备之间可以各自使用一或多根天线进行多输入多输出(Multi Input Multi Output,MIMO)传输,MIMO传输可以是单用户MIMO(Single User MIMO,SU-MIMO)或多用户MIMO(Multiple User MIMO,MU-MIMO)。根据根天线组合的形态和数量,MIMO传输可以是2D-MIMO、3D-MIMO、FD-MIMO或massive-MIMO,也可以是分集传输或预编码传输或波束赋形传输等。
图3是本公开实施例提供的概率成型的映射方法的流程示意图之一,如图3所示,本公开实施例提供一种概率成型的映射方法,其执行主体可以为发送端。该方法包括:
步骤301,基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特;
具体地,发送端可以获取目标发送比特,进而基于目标发送比特可以确定待成型比特,进而可以通过信道码的第一译码器对待成型比特进行概率成型,获取待成型比特对应的成型幅度比特。
可以理解的是,目标发送比特可以是待进行星座调制的信息,经过星座调制后,可以获取目标发送比特对应的调制星座点。
步骤302,将所述成型幅度比特映射为调制星座点。
具体地,在获取到目标发送比特之后,发送端基于目标发送比特可以确定目标极性比特,进而基于目标极性比特和成型幅度比特,可以进行映射,唯一确定调制星座点。
可选地,在下行场景中,发送端可以是网络侧设备,例如基站,相应地,接收端可以是终端。
可选地,在上行场景中,发送端可以是终端,例如手机相应地,接收端可以是网络侧设备。
可选地,发送端可以包括成型器,成型器可以包括信道码的第一译码器,第一译码器可以将与第一译码器对应的校验子作为输入,进行译码计算,可以获取译码码字,基于译码码字可以获取成型幅度比特。
例如,信道码可以是二进制极化码,成型器可以包括二进制极化码的 第一译码器。
例如,信道码可以是多进制极化码,成型器可以包括多进制极化码的第一译码器。
例如,信道码可以是二进制低密度奇偶校验(Low Density Parity Check,简称为LDPC)码,成型器可以包括二进制LDPC码的第一译码器。
例如,信道码可以是多进制LDPC码,成型器可以包括多进制LDPC码的第一译码器。
例如,发送端可以是基于后置解成型PAS架构实现的,发送端可以基于目标幅度概率分布,将待成型比特作为信道码的校验子输入成型器,获取成型幅度比特,进而可以基于成型幅度比特和目标极性比特,获取调制星座点。
需要说明的是,以上例子仅作为对本公开实施例的举例说明,不作为对本公开实施例的限定。
为了克服成型器不支持软输入软输出导致只能结合后置解成型PAS架构的缺陷,本公开实施例通过信道码构造的成型码可以支持软输入软输出解成型,适用于多种解成型PAS架构。
本公开实施例提供的概率成型的映射方法,通过专用于信道码的第一译码器可以根据目标幅度概率分布进行译码,进而可以获取成型幅度比特,使得成型幅度比特可以接近目标幅度概率分布,可以实现概率成型,且可以实现较小的速率损失和较低的成型复杂度,在高信噪比和高谱效下,可有效降低成型损失,可以提高通信系统性能。
可选地,在所述信道码为二进制信道码的情况下,所述基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特,包括:
确定多个比特层,每一个比特层分别对应一个所述第一译码器;
基于所述目标幅度概率分布以及所述待成型比特,通过所述多个比特层分别对应的第一译码器,获取所述多个比特层分别对应的译码码字;
基于所述多个比特层分别对应的译码码字,获取所述成型幅度比特。
具体地,信道码可以是二进制信道码,发送端的成型器可以包括多个比特层,每一个比特层可以对应一个第一译码器。
具体地,发送端可以基于目标发送比特确定待成型比特,进而可以将待成型比特输入到成型器,进而基于目标幅度概率分布和待成型比特,通过多个比特层分别对应的第一译码器,可以获取多个比特层分别对应的译码码字,进而基于多个比特层分别对应的译码码字,可以获取成型幅度比特,进而基于成型幅度比特和目标极性比特,可以唯一确定调制星座点。
可选地,可以基于星座调制符号的二进制标号确定多个比特层。
例如,64QAM调制可以先分为2路8-ASK调制,每一个8-ASK调制符号都可以有一个3比特序列A1A2A3相对应,这3个比特中可以有一个是目标极性比特(例如可以是A1),进而多个比特层可以是A2比特层,A3比特层。
因此,信道码可以是二进制信道码,发送端的成型器可以包括多个比特层,每一个比特层可以对应一个第一译码器,可以通过成型器中的第一译码器根据目标幅度概率分布进行译码,进而可以获取成型幅度比特,使得成型幅度比特可以接近目标幅度概率分布,可以实现概率成型,且可以实现较小的速率损失和较低的成型复杂度,在高信噪比和高谱效下,可有效降低成型损失,可以提高通信系统性能。
可选地,所述基于所述目标幅度概率分布以及所述待成型比特,通过所述多个比特层分别对应的第一译码器,获取所述多个比特层分别对应的译码码字,包括:
基于目标幅度概率分布,确定所述多个比特层分别对应的码率;
基于所述待成型比特和所述多个比特层分别对应的码率,确定所述多个比特层分别对应的校验子;
基于所述多个比特层分别对应的所述第一译码器和所述多个比特层分别对应的校验子,获取所述多个比特层分别对应的译码码字。
具体地,信道码可以是二进制信道码,发送端的成型器可以包括多个比特层,每一个比特层可以对应一个第一译码器。
具体地,发送端可以基于目标发送比特确定待成型比特,进而可以将待成型比特输入到成型器,进而基于目标幅度概率分布,可以确定多个比特层分别对应的码率,进而基于待成型比特和多个比特层分别对应的码率,可以确定多个比特层分别对应的校验子,进而基于多个比特层分别对应的第一译码器和多个比特层分别对应的校验子,可以获取多个比特层分别对应的译码码字,进而基于多个比特层分别对应的译码码字,可以获取成型幅度比特,进而基于成型幅度比特和目标极性比特,可以唯一确定调制星座点。
例如,信道码可以是二进制极化码,发送端的成型器可以包括多个比特层,每一个比特层可以对应一个二进制极化码的第一译码器。
例如,信道码可以是二进制LDPC码,发送端的成型器可以包括多个比特层,每一个比特层可以对应一个二进制LDPC码的第一译码器。
需要说明的是,以上例子仅作为对本公开实施例的举例说明,不作为对本公开实施例的限定。
可以理解的是,通过调节每个比特层的码率可以降低成型速率损失,且发送端的成型器可以采用支持低译码复杂度的信道码(例如,极化码,LDPC码)时,进而可以降低成型复杂度。因此,信道码可以是二进制信道码,发送端的成型器可以包括多个比特层,每一个比特层可以对应一个第一译码器,通过专用于信道码的第一译码器可以根据目标幅度概率分布进行译码,进而可以获取成型幅度比特,使得成型幅度比特可以接近目标幅度概率分布,可以实现概率成型,且可以实现较小的速率损失和较低的成型复杂度,在高信噪比和高谱效下,可有效降低成型损失,可以提高通信系统性能。
可选地,所述基于所述多个比特层分别对应的所述第一译码器和所述多个比特层分别对应的校验子,获取所述多个比特层分别对应的译码码字,包括:
将所述多个比特层中的第一个比特层对应的校验子输入所述第一个比特层对应的第一译码器,获取第一个比特层对应的译码码字;
对于多个比特层中的每一个目标比特层,将所述目标比特层对应的校验子和第一译码码字输入所述目标比特层对应的第一译码器,获取所述目标比特层对应的译码码字;
其中,所述第一译码码字包括所述目标比特层之前的全部比特层分别对应的译码码字,所述目标比特层为除所述第一个比特层之外的其他比特层。
具体地,发送端可以基于目标发送比特确定待成型比特,进而可以将待成型比特输入到成型器,进而基于目标幅度概率分布,可以确定多个比特层分别对应的码率;进而基于待成型比特和多个比特层分别对应的码率,可以确定多个比特层分别对应的校验子;
具体地,在确定多个比特层分别对应的校验子之后,发送端可以将多个比特层中的第一个比特层对应的校验子输入第一个比特层对应的第一译码器,进而可以获取第一个比特层对应的译码码字,进而对于多个比特层中的每一个目标比特层,可以将目标比特层对应的校验子和第一译码码字输入目标比特层对应的第一译码器,可以获取目标比特层对应的译码码字;
具体地,在获取多个比特层分别对应的译码码字之后,可以基于多个比特层分别对应的译码码字,可以获取成型幅度比特,进而基于成型幅度比特和目标极性比特,可以唯一确定调制星座点。
可选地,图4是本公开实施例提供的概率成型的映射方法的流程示意图之二,图4为本公开的一个可选的示例,但不作为对本公开的限定;如图4所示:
在信道码为二进制信道码的情况下,成型器可以将成型幅度比特A按照二进制比特划分为A=A 1A 2…A m-1,基于某种准则(比如,信息熵)为每个比特层划分一个码率R i,每个比特层都分配一个码率为R i的信道码和相应的译码器。
成型器输入比特Ua按照每个比特层所能承载的比特数进行层映射,被划分为Ua1、Ua2以及Ua3,以此类推。对于第i个比特层,Uai作为校 验子,输入层i的信道码译码器,并且层i译码器的软比特根据目标幅度条件概率分布
Figure PCTCN2022134093-appb-000014
计算,其中A 1A 2…A i-1是前i-1层译码结果。成型器采取逐层译码的方式获得每一层译码码字,例如层1的译码码字可以是
Figure PCTCN2022134093-appb-000015
层2的译码码字可以是
Figure PCTCN2022134093-appb-000016
层3的译码码字可以是
Figure PCTCN2022134093-appb-000017
以此类推,最后把所有比特层码字并串转换作为成型幅度比特A输出。
可以理解的是,在成型器的成型过程中,信息比特被加载到信道码的校验子上,由于译码器的软比特根据目标幅度概率分布P A逐层计算,最终每次获得的码字都会接近目标幅度条件概率分布
Figure PCTCN2022134093-appb-000018
成型幅度比特A也会接近目标幅度概率分布P A
因此,信道码可以是二进制信道码,发送端的成型器可以包括多个比特层,每一个比特层可以对应第一译码器,通过专用于信道码的第一译码器可以根据目标幅度概率分布进行译码,进而可以获取成型幅度比特,使得成型幅度比特可以接近目标幅度概率分布,可以实现概率成型,且可以实现较小的速率损失和较低的成型复杂度,在高信噪比和高谱效下,可有效降低成型损失,可以提高通信系统性能。
可选地,所述基于目标幅度概率分布,确定所述多个比特层分别对应的码率,包括:
基于目标幅度概率分布,确定所述多个比特层中每一层的幅度比特分别对应的熵;
基于所述多个比特层分别对应的熵,确定所述多个比特层分别对应的码率。
具体地,基于目标幅度概率分布可以确定每一个比特层的幅度比特对应的熵,进而可以基于多个比特层分别对应的熵,确定多个比特层分别对应的码率,进而基于待成型比特和多个比特层分别对应的码率,可以确定多个比特层分别对应的校验子,进而基于多个比特层分别对应的第一译码器和多个比特层分别对应的校验子,可以获取多个比特层分别对应的译码码字,进而基于多个比特层分别对应的译码码字,可以获取成型幅度比特,进而基于成型幅度比特和目标极性比特,可以唯一确定调制星座点。
因此,发送端的成型器可以基于多个比特层分别对应的熵,确定多个比特层分别对应的码率,进而可以确定多个比特层分别对应的校验子,进而可以通过成型器中的第一译码器根据目标幅度概率分布和校验子进行译码,进而可以获取成型幅度比特,使得成型幅度比特可以接近目标幅度概率分布,可以实现概率成型,且可以实现较小的速率损失和较低的成型复杂度,在高信噪比和高谱效下,可有效降低成型损失,可以提高通信系统性能。
可选地,在所述信道码为多进制信道码的情况下,所述基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特,包括:
基于所述目标幅度概率分布确定多进制信道码的码率;
基于所述待成型比特和所述多进制信道码的码率,获取所述待成型比特对应的多进制待成型比特,所述多进制待成型比特用于作为所述第一译码器的校验子;
基于所述多进制待成型比特和所述目标幅度概率分布,通过所述第一译码器,获取所述多进制待成型比特对应的多进制译码码字;
将所述多进制译码码字转为二进制,获取所述成型幅度比特。
具体地,信道码可以是多进制信道码,发送端的成型器可以包括多进制信道码的第一译码器。
具体地,发送端可以基于目标发送比特确定待成型比特,进而基于目标幅度概率分布,可以确定多进制信道码的码率,进而基于待成型比特和多进制信道码的码率,可以获取待成型比特对应的多进制待成型比特,进而基于多进制待成型比特和目标幅度概率分布,可以获取多进制待成型比特对应的多进制译码码字,进而将多进制译码码字转为二进制,可以获取成型幅度比特,进而基于成型幅度比特和目标极性比特,可以唯一确定调制星座点。
例如,信道码可以是多进制极化码,发送端的成型器可以包括多进制极化码的第一译码器。
例如,信道码可以是多进制LDPC码,发送端的成型器可以包括多进制LDPC码的第一译码器。
需要说明的是,以上例子仅作为对本公开实施例的举例说明,不作为对本公开实施例的限定。
可选地,图5是本公开实施例提供的概率成型的映射方法的流程示意图之三,图5为本公开的一个可选的示例,但不作为对本公开的限定;如图5所示:
在信道码为多进制信道码的情况下,多进制信道码的码率R可以根据某种准则确定(例如,信息熵),根据码率R可以进一步确定能够加载的信息符号数和信息比特数。该成型器不再需要进行层映射,而是将二进制比特流转换为多进制符号V a加载到多进制校验子上,译码器在多进制上译码获得多进制的译码码字V。译码器的软比特输出,可以根据目标幅度概率分布P A计算,最终的译码码字通过多进制转二进制操作,获得成型幅度比特A。
可以理解的是,由软比特输入根据P A计算,译码获得的码字符号也会接近P A分布,从而可以实现概率成型。基于多进制码的成型器不需要逐层串行译码,成型时延更低,适用于未来高吞吐业务场景。
可以理解的是,通过调节多进制信道码的码率可以降低成型速率损失,且发送端的成型器可以采用支持低译码复杂度的信道码(例如,极化码,LDPC码)时,进而可以降低成型复杂度。
因此,信道码可以是多进制信道码,发送端的成型器可以包括多进制信道码的第一译码器,通过专用于信道码的第一译码器可以根据目标幅度概率分布进行译码,进而可以获取成型幅度比特,使得成型幅度比特可以接近目标幅度概率分布,可以实现概率成型,且可以实现较小的速率损失和较低的成型复杂度,基于多进制码的成型器不需要逐层串行译码,成型时延更低,适用于未来高吞吐业务场景。
可选地,所述基于所述目标幅度概率分布确定多进制信道码的码率,包括:
基于目标幅度概率分布,确定所有幅度比特对应的熵;
基于所述所有幅度比特对应的熵,确定所述多进制信道码的码率。
具体地,基于目标幅度概率分布可以确定所有幅度比特对应的熵,进而可以基于所有幅度比特对应的熵,确定多进制信道码的码率,进而基于待成型比特和多进制信道码的码率,可以获取待成型比特对应的多进制待成型比特,进而基于多进制待成型比特和目标幅度概率分布,可以获取多进制待成型比特对应的多进制译码码字,进而将多进制译码码字转为二进制,可以获取成型幅度比特,进而基于成型幅度比特和目标极性比特,可以唯一确定调制星座点。
因此,发送端的成型器可以基于所有幅度比特对应的熵,确定多进制信道码的码率,进而可以确定多进制待成型比特,进而可以通过成型器中的第一译码器根据目标幅度概率分布和多进制待成型比特进行译码,进而可以获取成型幅度比特,使得成型幅度比特可以接近目标幅度概率分布,可以实现概率成型,且可以实现较小的速率损失和较低的成型复杂度,基于多进制码的成型器不需要逐层串行译码,成型时延更低,适用于未来高吞吐业务场景。
可选地,所述第一译码器包括以下任一项:
支持软输入软输出的译码器;或
支持软输入硬输出的译码器;或
基于神经网络训练获得的译码器。
可选地,在第一译码器可以是支持软输入软输出的译码器。
例如,第一译码器可以是BP置信传播译码器,BP置信传播译码器可以将与BP置信传播译码器对应的校验子作为输入,进行译码计算,可以获取译码码字,基于译码码字可以获取成型幅度比特。
可选地,在第一译码器可以是支持软输入硬输出的译码器。
例如,第一译码器可以是列表译码器,列表译码器可以将与列表译码器对应的校验子作为输入,进行译码计算,可以获取译码码字,基于译码码字可以获取成型幅度比特。
可选地,在第一译码器可以是基于神经网络训练获得的译码器。
例如,第一译码器可以是,基于深度神经网络(Deep Neural Networks,DNN)训练获得的BP译码器,也即DNN-BP译码器,DNN-BP译码器可以将与DNN-BP译码器对应的校验子作为输入,进行译码计算,可以获取译码码字,基于译码码字可以获取成型幅度比特。
需要说明的是,以上例子仅作为对本公开实施例的举例说明,不作为对本公开实施例的限定。
因此,第一译码器可以是多种类型的译码器中的任一项,第一译码器可以将与第一译码器对应的校验子作为输入,进行译码计算,可以获取译码码字,基于译码码字可以获取成型幅度比特,使得成型幅度比特可以接近目标幅度概率分布,可以实现概率成型,且可以实现较小的速率损失和较低的成型复杂度,在高信噪比和高谱效下,可有效降低成型损失,可以提高通信系统性能。
可选地,所述将所述成型幅度比特映射为调制星座点,包括:
将所述成型幅度比特和目标极性比特映射为所述调制星座点。
具体地,在接收到目标发送比特之后,发送端基于目标发送比特可以确定目标极性比特,进而基于目标极性比特和成型幅度比特,可以进行映射,唯一确定调制星座点。
因此,通过成型幅度比特和目标极性比特可以唯一确定调制星座点,由于成型幅度比特是通过成型器中的第一译码器根据目标幅度概率分布进行译码获取的,使得成型幅度比特可以接近目标幅度概率分布,可以实现概率成型,且可以实现较小的速率损失和较低的成型复杂度,在高信噪比和高谱效下,可有效降低成型损失,可以提高通信系统性能。
可选地,在所述将所述成型幅度比特映射为调制星座点之前,所述方法还包括:
获取目标发送比特;
对所述目标发送比特进行串并转换,获取所述待成型比特和第一极性比特;
基于所述第一极性比特和所述成型幅度比特,确定所述目标极性比特。
具体地,发送端对目标发送比特进行串并转换,可以获取待成型比特和第一极性比特;
具体地,发送端可以基于目标发送比特确定待成型比特,进而可以基于目标幅度概率分布,将待成型比特作为信道码的校验子输入到发送端的成型器,可以获取成型幅度比特;
具体地,在获取到第一极性比特和成型幅度比特之后,发送端可以基于第一极性比特和成型幅度比特,确定目标极性比特,进而基于成型幅度比特和目标极性比特,可以唯一确定调制星座点。
可选地,发送端可以是基于后置解成型PAS架构实现的,发送端可以基于目标幅度概率分布,将待成型比特作为信道码的校验子输入成型器,获取成型幅度比特,进而可以基于成型幅度比特和目标极性比特,获取调制星座点。
可选地,在后置解成型PAS架构下,发送端可以将M-QAM复数星座调制转换为两路实数的
Figure PCTCN2022134093-appb-000019
调制,根据信噪比(Signal-to-Noise Ratio,SNR)计算
Figure PCTCN2022134093-appb-000020
调制的目标概率分布P Ω
Figure PCTCN2022134093-appb-000021
Figure PCTCN2022134093-appb-000022
P Ω可以是
Figure PCTCN2022134093-appb-000023
调制的最优概率分布,
Figure PCTCN2022134093-appb-000024
可以采用BRGC二进制标号,概率分布P Ω可以进一步解耦为目标幅度概率分布P A和目标极性概率分布P S
Figure PCTCN2022134093-appb-000025
因此,发送端可以是基于后置解成型PAS架构实现的,发送端可以基于目标幅度概率分布,将待成型比特作为信道码的校验子输入成型器,获取成型幅度比特,使得成型幅度比特可以接近目标幅度概率分布,可以实现概率成型,且可以实现较小的速率损失和较低的成型复杂度,在高信噪比和高谱效下,可有效降低成型损失,可以提高通信系统性能。
可选地,所述基于所述第一极性比特和所述成型幅度比特,确定所述目标极性比特,包括:
对所述第一极性比特和所述成型幅度比特进行前向纠错编码,获取第一校验比特;
对所述第一校验比特和所述第一极性比特进行串并转换,获取所述目标极性比特。
具体地,发送端对目标发送比特进行串并转换,可以获取待成型比特和第一极性比特;
具体地,发送端可以基于目标发送比特确定待成型比特,进而可以基于目标幅度概率分布,将待成型比特作为信道码的校验子输入到发送端的成型器,可以获取成型幅度比特;
具体地,在获取到第一极性比特和成型幅度比特之后,发送端可以对第一极性比特和成型幅度比特进行前向纠错编码,获取第一校验比特,进而对第一校验比特和第一极性比特进行串并转换,可以获取目标极性比特,进而基于成型幅度比特和目标极性比特,可以唯一确定调制星座点。
因此,发送端可以是基于后置解成型PAS架构实现的,发送端可以基于目标幅度概率分布,将待成型比特作为信道码的校验子输入成型器,获取成型幅度比特,使得成型幅度比特可以接近目标幅度概率分布,可以实现概率成型,且可以实现较小的速率损失和较低的成型复杂度,在高信噪比和高谱效下,可有效降低成型损失,可以提高通信系统性能。
可选地,在所述基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特之前,所述方法还包括:
获取目标发送比特;
对所述目标发送比特进行前向纠错编码,获取第一编码码字;
对所述第一编码码字进行串并转换,获取所述待成型比特和所述目标极性比特。
具体地,发送端可以对目标发送比特进行前向纠错编码,可以获取第一编码码字,进而对第一编码码字进行串并转换,可以获取待成型比特和目标极性比特;
具体地,在获取到待成型比特之后,发送端可以基于目标幅度概率分布,将待成型比特作为信道码的校验子输入到发送端的成型器,可以获取成型幅度比特,进而基于成型幅度比特和目标极性比特,可以唯一确定调 制星座点。
可选地,图6是本公开实施例提供的前置解成型PAS架构的示意图,图6为本公开的一个可选的示例,但不作为对本公开的限定;如图6所示,发送端可以是基于前置解成型PAS架构实现的,发送端可以基于目标幅度概率分布,将待成型比特作为信道码的校验子输入成型器,获取成型幅度比特,进而可以基于成型幅度比特和目标极性比特,获取调制星座点。
可以理解的是,在前置解成型PAS架构下,发送端先做前向纠错编码,然后对纠错码的码字进行概率成型。
可选地,在前置解成型PAS架构下,发送端可以先对目标发送比特做前向纠错编码,然后将纠错编码的码字划分为Ua和Us=S两部分,进而成型器可以对Ua成型获得成型幅度比特A并与目标极性比特S合并唯一确定ASK调制星座点。
可选地,在前置解成型PAS架构下,发送端可以将M-QAM复数星座调制转换为两路实数的
Figure PCTCN2022134093-appb-000026
调制,根据信噪比(Signal-to-Noise Ratio,SNR)计算
Figure PCTCN2022134093-appb-000027
调制的目标概率分布P Ω
Figure PCTCN2022134093-appb-000028
Figure PCTCN2022134093-appb-000029
P Ω可以是
Figure PCTCN2022134093-appb-000030
调制的最优概率分布,
Figure PCTCN2022134093-appb-000031
可以采用BRGC二进制标号,概率分布P Ω可以进一步解耦为目标幅度概率分布P A和目标极性概率分布P S
Figure PCTCN2022134093-appb-000032
因此,发送端可以是基于前置解成型PAS架构实现的,发送端可以基于目标幅度概率分布,将待成型比特作为信道码的校验子输入成型器,获取成型幅度比特,使得成型幅度比特可以接近目标幅度概率分布,可以实现概率成型,且可以实现较小的速率损失和较低的成型复杂度,在高信噪比和高谱效下,可有效降低成型损失,可以提高通信系统性能。
可选地,在所述基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特之前,所述方法还包括:
基于目标信噪比SNR和目标调制阶数,确定所述目标幅度概率分布。
具体地,发送端可以基于目标发送比特确定待成型比特,基于目标信噪比SNR和目标调制阶数,可以确定目标幅度概率分布;
具体地,在确定待成型比特和目标幅度概率分布之后,发送端可以基于目标幅度概率分布,将待成型比特作为信道码的校验子输入到发送端的成型器,可以获取成型幅度比特,进而基于成型幅度比特和目标极性比特,可以唯一确定调制星座点。
可选地,发送端可以将M-QAM复数星座调制转换为两路实数的
Figure PCTCN2022134093-appb-000033
调制,目标调制阶数可以是
Figure PCTCN2022134093-appb-000034
基于目标信噪比SNR和目标调制阶数,确定目标幅度概率分布的过程可以包括:
ASK调制星座点服从MB(Maxwell-Boltzmann)分布且二进制标号为BRGC,星座点在加性高斯白噪声(Additive White Gaussian Noise,AWGN)信道传输模型为Y=Δ·X+N,其中,Y可以是发送星座X的有噪版本,Δ为ASK的功率缩放系数,N为加性高斯白噪声;
Figure PCTCN2022134093-appb-000035
星座点分解为1个极性比特S和(m-1)个幅度比特A,
Figure PCTCN2022134093-appb-000036
幅度A的概率分布为
Figure PCTCN2022134093-appb-000037
星座点极性分布为
Figure PCTCN2022134093-appb-000038
ASK星座点概率为
Figure PCTCN2022134093-appb-000039
Figure PCTCN2022134093-appb-000040
遍历Δ=Δ 1,Δ 2,…,对每一个Δ i取值通过二分法寻找使得熵H(X)最大且发送功率不大于1的λ i并计算对应的SNR下
Figure PCTCN2022134093-appb-000041
信道容量C i,确定最大容量索引i max=arg max C i,获得
Figure PCTCN2022134093-appb-000042
和最优分布(目标幅度概率分布)
Figure PCTCN2022134093-appb-000043
因此,基于目标信噪比SNR和目标调制阶数,可以确定目标幅度概率分布,发送端可以基于目标幅度概率分布,将待成型比特作为信道码的校验子输入成型器,获取成型幅度比特,使得成型幅度比特可以接近目标幅度概率分布,可以实现概率成型,且可以实现较小的速率损失和较低的成型复杂度。
本公开实施例提供的概率成型的映射方法,通过专用于信道码的第一译码器可以根据目标幅度概率分布进行译码,进而可以获取成型幅度比特,使得成型幅度比特可以接近目标幅度概率分布,可以实现概率成型,且可 以实现较小的速率损失和较低的成型复杂度,在高信噪比和高谱效下,可有效降低成型损失,可以提高通信系统性能。
图7是本公开实施例提供的概率解成型的接收处理方法的流程示意图之一,如图7所示,本公开实施例提供一种概率解成型的接收处理方法,其执行主体可以为接收端。该方法包括:
步骤701,对接收信号进行解成型;
其中,接收到的所述信号对应的成型幅度比特是专用于信道码的第一译码器基于目标幅度概率分布和待成型比特获取的。
具体地,接收端可以基于接收信号,对接收信号进行解成型,可以获取接收信号对应的目标发送比特,其中,接收信号对应的成型幅度比特可以是专用于信道码的第一译码器基于目标幅度概率分布和待成型比特获取的。
可以理解的是,发送端可以包括成型器,成型器可以包括信道码的第一译码器,成型器的输入可以包括待成型比特,待成型比特可以用于作为信道码的校验子,目标幅度概率分布可以为成型幅度的目标概率分布,待成型比特可以是基于目标发送比特确定的。
可选地,在下行场景中,接收端可以是终端,例如手机。
可选地,在上行场景中,接收端可以是网络侧设备,例如基站。
例如,接收端可以是基于后置解成型PAS架构实现的,接收端可以基于接收信号,获取接收信号对应的目标发送比特。
例如,接收端可以是基于前置解成型PAS架构实现的,接收端可以基于接收信号,获取接收信号对应的目标发送比特。
需要说明的是,以上例子仅作为对本公开实施例的举例说明,不作为对本公开实施例的限定。
本公开实施例提供的概率解成型的接收处理方法,接收信号对应的成型幅度比特可以是通过信道码构造的,通过基于接收信号,获取接收信号对应的目标发送比特,可以实现对概率成型码的解成型,PAS架构在高信噪比和高谱效下,可有效降低成型损失,可以提高通信系统性能。
可选地,所述对接收信号进行解成型,包括:
将所述接收信号输入到解调器,获取解调信息;
将所述解调信息输入到前向纠错译码器,获取所述成型幅度比特和第一极性比特;
将所述成型幅度比特输入到解成型器,获取待成型比特。
具体地,接收端将接收信号输入到解调器,可以获取解调信息,进而将解调信息输入到前向纠错译码器,可以获取成型幅度比特和第一极性比特,进而将成型幅度比特输入到解成型器,可以获取待成型比特,进而基于待成型比特和第一极性比特,可以确定目标发送比特。
可选地,接收端可以是基于后置解成型PAS架构实现的,接收端可以基于接收信号,获取所述接收信号对应的目标发送比特,接收信号对应的成型幅度比特是成型器基于目标幅度概率分布获取的,成型器的输入包括待成型比特,待成型比特用于作为信道码的校验子,目标幅度概率分布为成型幅度的目标概率分布,待成型比特是基于目标发送比特确定的。
因此,接收端可以是基于后置解成型PAS架构实现的,接收信号对应的成型幅度比特可以是通过信道码构造的,接收端可以基于接收信号,获取接收信号对应的目标发送比特,可以实现对概率成型码的解成型,PAS架构在高信噪比和高谱效下,可有效降低成型损失,可以提高通信系统性能。
可选地,所述将所述成型幅度比特输入到解成型器,获取待成型比特,包括:
在所述成型幅度比特为硬值比特的情况下,基于校验约束关系,将所述成型幅度比特输入到所述解成型器,获取所述待成型比特,所述待成型比特为所述信道码的校验子对应的硬值比特。
具体地,接收端将接收信号输入到解调器,可以获取解调信息,进而将解调信息输入到前向纠错译码器,可以获取成型幅度比特和第一极性比特;
具体地,在获取到成型幅度比特之后,在成型幅度比特为硬值比特的 情况下,基于校验约束关系,可以将成型幅度比特输入到解成型器,获取待成型比特,待成型比特可以为信道码的校验子对应的硬值比特,进而基于待成型比特和第一极性比特,可以确定目标发送比特。
例如,在后置解成型PAS架构下,接收端的解成型器可以基于校验约束关系,对硬值比特输入进行计算,获取硬值比特输出,可以不参与Turbo迭代。
需要说明的是,以上例子仅作为对本公开实施例的举例说明,不作为对本公开实施例的限定。
因此,接收端可以是基于后置解成型PAS架构实现的,接收信号对应的成型幅度比特可以是通过信道码构造的,接收端可以基于接收信号,获取接收信号对应的目标发送比特,可以实现对概率成型码的解成型,PAS架构在高信噪比和高谱效下,可有效降低成型损失,可以提高通信系统性能。
可选地,所述将所述成型幅度比特输入到解成型器,获取待成型比特,包括:
在所述成型幅度比特为软值比特的情况下,将所述成型幅度比特输入到所述解成型器,获取待成型比特,所述解成型器包括所述信道码的第二译码器,所述待成型比特为所述信道码的校验子对应的软值比特。
具体地,接收端将接收信号输入到解调器,可以获取解调信息,进而将解调信息输入到前向纠错译码器,可以获取成型幅度比特和第一极性比特;
具体地,在获取到成型幅度比特之后,在成型幅度比特为软值比特的情况下,可以将成型幅度比特输入到解成型器,可以获取待成型比特,解成型器可以包括信道码的第二译码器,待成型比特可以为信道码的校验子对应的软值比特,进而基于待成型比特和第一极性比特,可以确定目标发送比特。
例如,在后置解成型PAS架构下,接收端的解成型器可以基于信道码的译码器对软值比特输入进行计算,获取软值比特输出,可以参与Turbo 迭代。
需要说明的是,以上例子仅作为对本公开实施例的举例说明,不作为对本公开实施例的限定。
因此,接收端可以是基于后置解成型PAS架构实现的,接收信号对应的成型幅度比特可以是通过信道码构造的,接收端可以基于接收信号,获取接收信号对应的目标发送比特,可以实现对概率成型码的解成型,PAS架构在高信噪比和高谱效下,可有效降低成型损失,可以提高通信系统性能。
可选地,所述对接收信号进行解成型,包括:
对所述接收信号进行解调解成型,获取第二编码码字;
将所述第二编码码字输入到前向纠错译码器,获取所述目标发送比特。
具体地,接收端对接收信号可以进行解调解成型,获取第二编码码字,进而可以将第二编码码字输入到前向纠错译码器,获取目标发送比特。
可选地,接收端可以是基于前置解成型PAS架构实现的,接收端可以基于接收信号,获取所述接收信号对应的目标发送比特,接收信号对应的成型幅度比特是成型器基于目标幅度概率分布获取的,成型器的输入包括待成型比特,待成型比特用于作为信道码的校验子,目标幅度概率分布为成型幅度的目标概率分布,待成型比特是基于目标发送比特确定的。
可以理解的是,在前置解成型PAS架构下,接收端先做解成型,然后再进行前向纠错译码。
可选地,在前置解成型PAS架构下,接收端可以先进行解调然后解成型,或者联合解调解成型,然后输出软比特给前向纠错译码器,恢复出目标发送比特。
可选地,联合解调解成型过程可以包括:根据接收信号和成型校验约束关系计算后验概率,输出软比特到前向纠错译码器。
可选地,先进行解调然后解成型过程可以包括:解调器根据接收信号输出解调信息(可以为一个概率值),进而解成型器可以基于解调信息和成型校验约束关系进行概率修正,输出软比特到前向纠错译码器。
可以理解的是,基于CCDM和ESS的成型码无法支持软输入软输出检测,不适用于前置解成型的PAS架构和性能更优的Turbo接收机,而基于信道码构造的成型码可以支持软输入软输出检测,可以适用于前置解成型的PAS架构和性能更优的Turbo接收机。
因此,接收端可以是基于前置解成型PAS架构实现的,接收信号对应的成型幅度比特可以是通过信道码构造的,接收端可以基于接收信号,获取接收信号对应的目标发送比特,可以实现对概率成型码的解成型,PAS架构在高信噪比和高谱效下,可有效降低成型损失,可以提高通信系统性能。
可选地,所述对所述接收信号进行解调解成型,获取第二编码码字,包括:
将所述接收信号输入到解调器,获取解调信息;
在所述解调信息为软值比特的情况下,将所述解调信息输入到所述解成型器,获取所述第二编码码字,所述解成型器包括所述信道码的第二译码器,所述第二编码码字为所述信道码的校验子对应的软值比特。
具体地,接收端可以将接收信号输入到解调器,获取解调信息;
具体地,在获取到解调信息之后,在解调信息为软值比特的情况下,可以将解调信息输入到解成型器,获取第二编码码字,解成型器可以包括信道码的第二译码器,第二编码码字可以为信道码的校验子对应的软值比特,进而可以将第二编码码字输入到前向纠错译码器,获取目标发送比特。
例如,在前置解成型PAS架构下,接收端的解成型器可以基于信道码的译码器对软值比特输入进行计算,获取软值比特输出,可以参与Turbo迭代。
需要说明的是,以上例子仅作为对本公开实施例的举例说明,不作为对本公开实施例的限定。
因此,接收端可以是基于前置解成型PAS架构实现的,接收信号对应的成型幅度比特可以是通过信道码构造的,接收端可以基于接收信号,获取接收信号对应的目标发送比特,可以实现对概率成型码的解成型,PAS 架构在高信噪比和高谱效下,可有效降低成型损失,可以提高通信系统性能。
可选地,所述对所述接收信号进行解调解成型,获取第二编码码字,包括:
将所述接收信号输入到解调器,获取解调信息;
在所述解调信息为软值比特的情况下,将所述解调信息输入到所述解成型器,获取所述第二编码码字,所述解成型器包括所述信道码的第三译码器,所述第二编码码字为所述信道码的校验子对应的硬值比特。
具体地,接收端可以将接收信号输入到解调器,获取解调信息;
具体地,在获取到解调信息之后,在解调信息为软值比特的情况下,可以将解调信息输入到解成型器,获取第二编码码字,解成型器可以包括信道码的第三译码器,第二编码码字可以为信道码的校验子对应的硬值比特,进而可以将第二编码码字输入到前向纠错译码器,获取目标发送比特。
例如,在前置解成型PAS架构下,接收端的解成型器可以基于信道码的译码器对软值比特输入进行计算,获取硬值比特输出,可以不参与Turbo迭代。
需要说明的是,以上例子仅作为对本公开实施例的举例说明,不作为对本公开实施例的限定。
因此,接收端可以是基于前置解成型PAS架构实现的,接收信号对应的成型幅度比特可以是通过信道码构造的,接收端可以基于接收信号,获取接收信号对应的目标发送比特,可以实现对概率成型码的解成型,PAS架构在高信噪比和高谱效下,可有效降低成型损失,可以提高通信系统性能。
可选地,所述对接收信号进行解成型,包括:
基于所述解调器、所述解成型器和所述前向纠错译码器之间的Turbo迭代过程,获取所述接收信号对应的目标发送比特。
可选地,对于支持软输入软输出的解成型器,可以采用Turbo迭代接收机(解调、解成型、以及译码器之间的交互迭代),也可以采用非Turbo 迭代的串行接收机;而仅支持硬输出的解成型器可以采用非Turbo迭代的串行接收机。
例如,接收端可以是基于后置解成型PAS架构实现的,接收端可以基于解调器、解成型器和前向纠错译码器之间的Turbo迭代过程,获取接收信号对应的目标发送比特。
例如,接收端可以是基于前置解成型PAS架构实现的,接收端可以基于解调器、解成型器和前向纠错译码器之间的Turbo迭代过程,获取接收信号对应的目标发送比特。
需要说明的是,以上例子仅作为对本公开实施例的举例说明,不作为对本公开实施例的限定。
可选地,图8是本公开实施例提供的概率解成型的接收处理方法的流程示意图之二,图8为本公开的一个可选的示例,但不作为对本公开的限定;如图8所示:
通过信道码构造的成型码可以支持软输入软输出解成型(例如,基于LDPC码),因此采用后置解成型PAS架构也可以支持Turbo接收机。接收端可以根据
Figure PCTCN2022134093-appb-000044
调制的最优概率分布P Ω和接收信号解调计算软比特值,进而送入SFEC译码器译码获得第一极性比特Us和成型幅度比特A,A的软值被送入解成型器获得待成型比特Ua。解成型器关于A的软值输入给SFEC译码器参与Turbo迭代,可以获得额外性能增益。
因此,为了获得更好的性能,接收端可以采用复杂度更高的Turbo迭代接收机进行解调、解成型和前向纠错译码之间的交互迭代。
本公开实施例提供的概率解成型的接收处理方法,接收信号对应的成型幅度比特可以是通过信道码构造的,通过基于接收信号,获取接收信号对应的目标发送比特,可以实现对概率成型码的解成型,PAS架构在高信噪比和高谱效下,可有效降低成型损失,可以提高通信系统性能。
可选地,在后置解成型PAS架构(比如图1所示的架构)下,发送端的成型器的信道码可以采用二进制极化码,极化码的极化核为
Figure PCTCN2022134093-appb-000045
码长n=128,1024-QAM调制转换为2个独立的32-ASK调制,工作在 SNR=25dB下,计算目标幅度概率分布
Figure PCTCN2022134093-appb-000046
其中,λ=0.0033,功率缩放系数Δ=0.0842,二进制标号和概率分布的示例可以如表1所示。
其中,比特层还可以称为幅度比特层,对于每一个幅度比特层,极化码的封冻索引集F和信息索引集F c,可以根据5G表中的Sequence或者密度演进确定一个码率为R i、码长为n=128的极化码,根据表1中概率分布计算PAS每一层概率幅度比特的条件熵得到R i=1-H(A i|A 1A 2…A i-1)+∈,∈=0.08。每一层加载k i=128·(1-R i)个信息比特到极化码的校验子上(也即封冻索引集F),通过串行抵消(Successive Cancellation,SC)译码得到码字作为第i层幅度比特。
SFEC可以是一个LDPC码,接受端可以根据接收信号y,表1中的先验概率计算后验概率得到SFEC译码的软比特输入,然后译码获取Us和A。加载到校验子上的信息比特通过计算Ua=T=G(F,:)·A得到,其中
Figure PCTCN2022134093-appb-000047
是极化(Polar)码的生成矩阵,Ua可以是待成型比特,T可以是校验子。
表1 32-ASK调制的二进制标号与概率分布
Figure PCTCN2022134093-appb-000048
可选地,在后置解成型PAS架构(如图1所示的架构)下,发送端的成型器的信道码可以采用32进制Polar码,极化核为
Figure PCTCN2022134093-appb-000049
α=2是GF(32)域中本原元,码长n=128,1024-QAM调制转换为2个独立的32-ASK调制,工作在SNR=25dB下,根据表1中的概率分布计算32进制Polar码的码率R=1-H(A 1A 2…A 5)+∈,∈=0.08,通过密度演进或蒙特卡罗仿真进确定Polar码的封冻符号F,信息符号F c。待传输的信息比特(目 标发送比特)每5比特为一组映射为GF(32)上的多进制符号,并加载到封冻符号F上,通过多进制的SC译码得到多进制码字,再映射成二进制比特流。
SFEC采用LDPC码,接收端的解成型器基于Polar的BP置信传播译码器,进行迭代译码实现,并参与Turbo接收机中LDPC迭代译码。
可选地,在前置解成型PAS架构(如图6所示的架构)下,发送端的成型器的信道码可以采用二进制LDPC码,码长n=128,256-QAM调制转换为2个独立的16-ASK调制,工作在SNR=17dB下,计算λ=0.0132,ASK的功率缩放系数Δ=0.1685,16-ASK概率分布和二进制标号如表2所示。根据表2中概率分布计算PAS每一层概率幅度比特的条件熵,从而确定每一层的LDPC码的码率R i=1-H(A i|A 1A 2…A i-1)+∈,∈=0.08。对于每个幅度比特层,加载k i=128·(1-R i)个传输比特到该层LDPC码的校验子上。
图9是本公开实施例提供的基于Tanner图的置信传播译码器的示意图,如图9所示,LDPC Tanner图可以包括变量节点C,校验节点和校验子节点,校验子满足T=HC T,T表示校验子,H表示校验矩阵,通过BP译码可以得到满足分布的码字作为概率成型的幅度比特。
信道编码采用LDPC码,接收端可以采用Turbo接收机,进行解调、解成型和前向纠错译码之间的交互迭代。
表2 16-ASK调制的二进制标号与概率分布
Ω -15 -13 -11 -9 -7 -5 -3 -1
A 1 1111 1110 1100 1101 1001 1000 1010 1011
P Ω 0.0046 0.01 0.022 0.04 0.066 0.096 0.122 0.1377
Ω +1 +3 +5 +7 +9 +11 +13 +15
A 1 0011 0010 0000 0001 0101 0100 0110 0111
P Ω 0.1377 0.122 0.0956 0.0664 0.041 0.022 0.01 0.0046
可选地,在前置解成型PAS架构(如图6所示的架构)下,发送端的成型器的信道码可以采用16进制LDPC码,256-QAM调制转换为2个独立的16-ASK调制,工作在SNR=17dB下,计算λ=0.0132,ASK的功率缩放系数Δ=0.1685,16-ASK概率分布和二进制标号如表2所示。根据 表2中的概率分布计算16进制LDPC码的码率R=1-H(A 1A 2A 3A 4)+∈,∈=0.08。待传输的信息比特(目标发送比特)每4比特为一组映射为GF(16)上的多进制符号,并加载到LDPC码的校验子符号上,通过多进制LDPC码的BP译码算法得到码字符号,再转换为二进制比特流获得成型幅度比特。
信道编码可以采用LDPC码,接收端可以采用Turbo接收机,进行解调、解成型和前向纠错译码之间的交互迭代。
本公开实施例提供的概率成型的映射方法,通过专用于信道码的第一译码器可以根据目标幅度概率分布进行译码,进而可以获取成型幅度比特,使得成型幅度比特可以接近目标幅度概率分布,可以实现概率成型,且可以实现较小的速率损失和较低的成型复杂度,在高信噪比和高谱效下,可有效降低成型损失,可以提高通信系统性能。
可选地,在下行场景中,发送端可以是网络侧设备,接收端可以是终端设备。
图10是本公开实施例提供的网络侧设备的结构示意图之一,如图10所示,所述网络侧设备包括存储器1020,收发机1000,处理器1010,其中:
存储器1020,用于存储计算机程序;收发机1000,用于在所述处理器1010的控制下收发数据;处理器1010,用于读取所述存储器1020中的计算机程序并执行以下操作:
基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特;
将所述成型幅度比特映射为调制星座点。
具体地,收发机1000,用于在处理器1010的控制下接收和发送数据。
其中,在图10中,总线架构可以包括任意数量的互联的总线和桥,具体由处理器1010代表的一个或多个处理器和存储器1020代表的存储器的各种电路链接在一起。总线架构还可以将诸如外围设备、稳压器和功率管理电路等之类的各种其他电路链接在一起,这些都是本领域所公知的, 因此,本文不再对其进行进一步描述。总线接口提供接口。收发机1000可以是多个元件,即包括发送机和接收机,提供用于在传输介质上与各种其他装置通信的单元,这些传输介质包括无线信道、有线信道、光缆等传输介质。处理器1010负责管理总线架构和通常的处理,存储器1020可以存储处理器1010在执行操作时所使用的数据。
处理器1010可以是中央处理器(Central Processing Unit,CPU)、专用集成电路(Application Specific Integrated Circuit,ASIC)、现场可编程门阵列(Field-Programmable Gate Array,FPGA)或复杂可编程逻辑器件(Complex Programmable Logic Device,CPLD),处理器也可以采用多核架构。
可选地,在所述信道码为二进制信道码的情况下,所述基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特,包括:
确定多个比特层,每一个比特层分别对应一个所述第一译码器;
基于所述目标幅度概率分布以及所述待成型比特,通过所述多个比特层分别对应的第一译码器,获取所述多个比特层分别对应的译码码字;
基于所述多个比特层分别对应的译码码字,获取所述成型幅度比特。
可选地,所述基于所述目标幅度概率分布以及所述待成型比特,通过所述多个比特层分别对应的第一译码器,获取所述多个比特层分别对应的译码码字,包括:
基于目标幅度概率分布,确定所述多个比特层分别对应的码率;
基于所述待成型比特和所述多个比特层分别对应的码率,确定所述多个比特层分别对应的校验子;
基于所述多个比特层分别对应的所述第一译码器和所述多个比特层分别对应的校验子,获取所述多个比特层分别对应的译码码字。
可选地,所述基于所述多个比特层分别对应的所述第一译码器和所述多个比特层分别对应的校验子,获取所述多个比特层分别对应的译码码字,包括:
将所述多个比特层中的第一个比特层对应的校验子输入所述第一个比特层对应的第一译码器,获取第一个比特层对应的译码码字;
对于多个比特层中的每一个目标比特层,将所述目标比特层对应的校验子和第一译码码字输入所述目标比特层对应的第一译码器,获取所述目标比特层对应的译码码字;
其中,所述第一译码码字包括所述目标比特层之前的全部比特层分别对应的译码码字,所述目标比特层为除所述第一个比特层之外的其他比特层。
可选地,所述基于目标幅度概率分布,确定所述多个比特层分别对应的码率,包括:
基于目标幅度概率分布,确定所述多个比特层中每一层的幅度比特分别对应的熵;
基于所述多个比特层分别对应的熵,确定所述多个比特层分别对应的码率。
可选地,在所述信道码为多进制信道码的情况下,所述基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特,包括:
基于所述目标幅度概率分布确定多进制信道码的码率;
基于所述待成型比特和所述多进制信道码的码率,获取所述待成型比特对应的多进制待成型比特,所述多进制待成型比特用于作为所述第一译码器的校验子;
基于所述多进制待成型比特和所述目标幅度概率分布,通过所述第一译码器,获取所述多进制待成型比特对应的多进制译码码字;
将所述多进制译码码字转为二进制,获取所述成型幅度比特。
可选地,所述基于所述目标幅度概率分布确定多进制信道码的码率,包括:
基于目标幅度概率分布,确定所有幅度比特对应的熵;
基于所述所有幅度比特对应的熵,确定所述多进制信道码的码率。
可选地,所述第一译码器包括以下任一项:
支持软输入软输出的译码器;或
支持软输入硬输出的译码器;或
基于神经网络训练获得的译码器。
可选地,所述将所述成型幅度比特映射为调制星座点,包括:
将所述成型幅度比特和目标极性比特映射为所述调制星座点。
可选地,在所述将所述成型幅度比特映射为调制星座点之前,所述操作还包括:
获取目标发送比特;
对所述目标发送比特进行串并转换,获取所述待成型比特和第一极性比特;
基于所述第一极性比特和所述成型幅度比特,确定所述目标极性比特。
可选地,所述基于所述第一极性比特和所述成型幅度比特,确定所述目标极性比特,包括:
对所述第一极性比特和所述成型幅度比特进行前向纠错编码,获取第一校验比特;
对所述第一校验比特和所述第一极性比特进行串并转换,获取所述目标极性比特。
可选地,在所述基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特之前,所述操作还包括:
获取目标发送比特;
对所述目标发送比特进行前向纠错编码,获取第一编码码字;
对所述第一编码码字进行串并转换,获取所述待成型比特和所述目标极性比特。
可选地,在所述基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特之前,所述操作还包括:
基于目标信噪比SNR和目标调制阶数,确定所述目标幅度概率分布。
在此需要说明的是,本公开实施例提供的上述网络侧设备,能够实现 在下行场景中上述执行主体为网络侧设备的方法实施例所实现的所有方法步骤,且能够达到相同的技术效果,在此不再对本实施例中与方法实施例相同的部分及有益效果进行具体赘述。
图11是本公开实施例提供的终端的结构示意图之一,如图11所示,所述终端包括存储器1120,收发机1100,处理器1110,其中:
存储器1120,用于存储计算机程序;收发机1100,用于在所述处理器1110的控制下收发数据;处理器1110,用于读取所述存储器1120中的计算机程序并执行以下操作:
对接收信号进行解成型;
其中,接收到的所述信号对应的成型幅度比特是专用于信道码的第一译码器基于目标幅度概率分布和待成型比特获取的。
具体地,收发机1100,用于在处理器1110的控制下接收和发送数据。
其中,在图11中,总线架构可以包括任意数量的互联的总线和桥,具体由处理器1110代表的一个或多个处理器和存储器1120代表的存储器的各种电路链接在一起。总线架构还可以将诸如外围设备、稳压器和功率管理电路等之类的各种其他电路链接在一起,这些都是本领域所公知的,因此,本文不再对其进行进一步描述。总线接口提供接口。收发机1100可以是多个元件,即包括发送机和接收机,提供用于在传输介质上与各种其他装置通信的单元,这些传输介质包括无线信道、有线信道、光缆等传输介质。针对不同的用户设备,用户接口1130还可以是能够外接内接需要设备的接口,连接的设备包括但不限于小键盘、显示器、扬声器、麦克风、操纵杆等。
处理器1110负责管理总线架构和通常的处理,存储器1120可以存储处理器1110在执行操作时所使用的数据。
可选地,处理器1110可以是中央处理器(Central Processing Unit,CPU)、专用集成电路(Application Specific Integrated Circuit,ASIC)、现场可编程门阵列(Field-Programmable Gate Array,FPGA)或复杂可编程逻辑器件(Complex Programmable Logic Device,CPLD),处理器也可 以采用多核架构。
处理器通过调用存储器存储的计算机程序,用于按照获得的可执行指令执行本公开实施例提供的任一所述方法。处理器与存储器也可以物理上分开布置。
可选地,所述对接收信号进行解成型,包括:
将所述接收信号输入到解调器,获取解调信息;
将所述解调信息输入到前向纠错译码器,获取所述成型幅度比特和第一极性比特;
将所述成型幅度比特输入到解成型器,获取待成型比特;
基于所述待成型比特和所述第一极性比特,确定所述目标发送比特。
可选地,所述将所述成型幅度比特输入到解成型器,获取待成型比特,包括:
在所述成型幅度比特为硬值比特的情况下,基于校验约束关系,将所述成型幅度比特输入到所述解成型器,获取所述待成型比特,所述待成型比特为所述信道码的校验子对应的硬值比特。
可选地,所述将所述成型幅度比特输入到解成型器,获取待成型比特,包括:
在所述成型幅度比特为软值比特的情况下,将所述成型幅度比特输入到所述解成型器,获取待成型比特,所述解成型器包括所述信道码的第二译码器,所述待成型比特为所述信道码的校验子对应的软值比特。
可选地,所述对接收信号进行解成型,包括:
对所述接收信号进行解调解成型,获取第二编码码字;
将所述第二编码码字输入到前向纠错译码器,获取所述目标发送比特。
可选地,所述对所述接收信号进行解调解成型,获取第二编码码字,包括:
将所述接收信号输入到解调器,获取解调信息;
在所述解调信息为软值比特的情况下,将所述解调信息输入到所述解成型器,获取所述第二编码码字,所述解成型器包括所述信道码的第二译 码器,所述第二编码码字为所述信道码的校验子对应的软值比特。
可选地,所述对所述接收信号进行解调解成型,获取第二编码码字,包括:
将所述接收信号输入到解调器,获取解调信息;
在所述解调信息为软值比特的情况下,将所述解调信息输入到所述解成型器,获取所述第二编码码字,所述解成型器包括所述信道码的第三译码器,所述第二编码码字为所述信道码的校验子对应的硬值比特。
可选地,所述对接收信号进行解成型,包括:
基于所述解调器、所述解成型器和所述前向纠错译码器之间的Turbo迭代过程,获取所述接收信号对应的目标发送比特。
在此需要说明的是,本发明实施例提供的上述终端,能够实现在下行场景中上述执行主体为终端的方法实施例所实现的所有方法步骤,且能够达到相同的技术效果,在此不再对本实施例中与方法实施例相同的部分及有益效果进行具体赘述。
可选地,在上行场景中,接收端可以是网络侧设备,发送端可以是终端设备。
图12是本公开实施例提供的网络侧设备的结构示意图之二,如图12所示,所述网络侧设备包括存储器1220,收发机1200,处理器1210,其中:
存储器1220,用于存储计算机程序;收发机1200,用于在所述处理器1210的控制下收发数据;处理器1210,用于读取所述存储器1220中的计算机程序并执行以下操作:
对接收信号进行解成型;
其中,接收到的所述信号对应的成型幅度比特是专用于信道码的第一译码器基于目标幅度概率分布和待成型比特获取的。
具体地,收发机1200,用于在处理器1210的控制下接收和发送数据。
其中,在图12中,总线架构可以包括任意数量的互联的总线和桥,具体由处理器1210代表的一个或多个处理器和存储器1220代表的存储器 的各种电路链接在一起。总线架构还可以将诸如外围设备、稳压器和功率管理电路等之类的各种其他电路链接在一起,这些都是本领域所公知的,因此,本文不再对其进行进一步描述。总线接口提供接口。收发机1200可以是多个元件,即包括发送机和接收机,提供用于在传输介质上与各种其他装置通信的单元,这些传输介质包括无线信道、有线信道、光缆等传输介质。处理器1210负责管理总线架构和通常的处理,存储器1220可以存储处理器1210在执行操作时所使用的数据。
处理器1210可以是中央处理器(Central Processing Unit,CPU)、专用集成电路(Application Specific Integrated Circuit,ASIC)、现场可编程门阵列(Field-Programmable Gate Array,FPGA)或复杂可编程逻辑器件(Complex Programmable Logic Device,CPLD),处理器也可以采用多核架构。
可选地,所述对接收信号进行解成型,包括:
将所述接收信号输入到解调器,获取解调信息;
将所述解调信息输入到前向纠错译码器,获取所述成型幅度比特和第一极性比特;
将所述成型幅度比特输入到解成型器,获取待成型比特;
基于所述待成型比特和所述第一极性比特,确定所述目标发送比特。
可选地,所述将所述成型幅度比特输入到解成型器,获取待成型比特,包括:
在所述成型幅度比特为硬值比特的情况下,基于校验约束关系,将所述成型幅度比特输入到所述解成型器,获取所述待成型比特,所述待成型比特为所述信道码的校验子对应的硬值比特。
可选地,所述将所述成型幅度比特输入到解成型器,获取待成型比特,包括:
在所述成型幅度比特为软值比特的情况下,将所述成型幅度比特输入到所述解成型器,获取待成型比特,所述解成型器包括所述信道码的第二译码器,所述待成型比特为所述信道码的校验子对应的软值比特。
可选地,所述对接收信号进行解成型,包括:
对所述接收信号进行解调解成型,获取第二编码码字;
将所述第二编码码字输入到前向纠错译码器,获取所述目标发送比特。
可选地,所述对所述接收信号进行解调解成型,获取第二编码码字,包括:
将所述接收信号输入到解调器,获取解调信息;
在所述解调信息为软值比特的情况下,将所述解调信息输入到所述解成型器,获取所述第二编码码字,所述解成型器包括所述信道码的第二译码器,所述第二编码码字为所述信道码的校验子对应的软值比特。
可选地,所述对所述接收信号进行解调解成型,获取第二编码码字,包括:
将所述接收信号输入到解调器,获取解调信息;
在所述解调信息为软值比特的情况下,将所述解调信息输入到所述解成型器,获取所述第二编码码字,所述解成型器包括所述信道码的第三译码器,所述第二编码码字为所述信道码的校验子对应的硬值比特。
可选地,所述对接收信号进行解成型,包括:
基于所述解调器、所述解成型器和所述前向纠错译码器之间的Turbo迭代过程,获取所述接收信号对应的目标发送比特。
在此需要说明的是,本公开实施例提供的上述网络侧设备,能够实现上行场景中上述执行主体为网络侧设备的方法实施例所实现的所有方法步骤,且能够达到相同的技术效果,在此不再对本实施例中与方法实施例相同的部分及有益效果进行具体赘述。
图13是本公开实施例提供的终端的结构示意图之二,如图13所示,所述终端包括存储器1320,收发机1300,处理器1310,其中:
存储器1320,用于存储计算机程序;收发机1300,用于在所述处理器1310的控制下收发数据;处理器1310,用于读取所述存储器1320中的计算机程序并执行以下操作:
基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译 码器获取成型幅度比特;
将所述成型幅度比特映射为调制星座点。
具体地,收发机1300,用于在处理器1310的控制下接收和发送数据。
其中,在图13中,总线架构可以包括任意数量的互联的总线和桥,具体由处理器1310代表的一个或多个处理器和存储器1320代表的存储器的各种电路链接在一起。总线架构还可以将诸如外围设备、稳压器和功率管理电路等之类的各种其他电路链接在一起,这些都是本领域所公知的,因此,本文不再对其进行进一步描述。总线接口提供接口。收发机1300可以是多个元件,即包括发送机和接收机,提供用于在传输介质上与各种其他装置通信的单元,这些传输介质包括无线信道、有线信道、光缆等传输介质。针对不同的用户设备,用户接口1330还可以是能够外接内接需要设备的接口,连接的设备包括但不限于小键盘、显示器、扬声器、麦克风、操纵杆等。
处理器1310负责管理总线架构和通常的处理,存储器1320可以存储处理器1310在执行操作时所使用的数据。
可选地,处理器1310可以是中央处理器(Central Processing Unit,CPU)、专用集成电路(Application Specific Integrated Circuit,ASIC)、现场可编程门阵列(Field-Programmable Gate Array,FPGA)或复杂可编程逻辑器件(Complex Programmable Logic Device,CPLD),处理器也可以采用多核架构。
处理器通过调用存储器存储的计算机程序,用于按照获得的可执行指令执行本公开实施例提供的任一所述方法。处理器与存储器也可以物理上分开布置。
可选地,在所述信道码为二进制信道码的情况下,所述基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特,包括:
确定多个比特层,每一个比特层分别对应一个所述第一译码器;
基于所述目标幅度概率分布以及所述待成型比特,通过所述多个比特 层分别对应的第一译码器,获取所述多个比特层分别对应的译码码字;
基于所述多个比特层分别对应的译码码字,获取所述成型幅度比特。
可选地,所述基于所述目标幅度概率分布以及所述待成型比特,通过所述多个比特层分别对应的第一译码器,获取所述多个比特层分别对应的译码码字,包括:
基于目标幅度概率分布,确定所述多个比特层分别对应的码率;
基于所述待成型比特和所述多个比特层分别对应的码率,确定所述多个比特层分别对应的校验子;
基于所述多个比特层分别对应的所述第一译码器和所述多个比特层分别对应的校验子,获取所述多个比特层分别对应的译码码字。
可选地,所述基于所述多个比特层分别对应的所述第一译码器和所述多个比特层分别对应的校验子,获取所述多个比特层分别对应的译码码字,包括:
将所述多个比特层中的第一个比特层对应的校验子输入所述第一个比特层对应的第一译码器,获取第一个比特层对应的译码码字;
对于多个比特层中的每一个目标比特层,将所述目标比特层对应的校验子和第一译码码字输入所述目标比特层对应的第一译码器,获取所述目标比特层对应的译码码字;
其中,所述第一译码码字包括所述目标比特层之前的全部比特层分别对应的译码码字,所述目标比特层为除所述第一个比特层之外的其他比特层。
可选地,所述基于目标幅度概率分布,确定所述多个比特层分别对应的码率,包括:
基于目标幅度概率分布,确定所述多个比特层中每一层的幅度比特分别对应的熵;
基于所述多个比特层分别对应的熵,确定所述多个比特层分别对应的码率。
可选地,在所述信道码为多进制信道码的情况下,所述基于目标幅度 概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特,包括:
基于所述目标幅度概率分布确定多进制信道码的码率;
基于所述待成型比特和所述多进制信道码的码率,获取所述待成型比特对应的多进制待成型比特,所述多进制待成型比特用于作为所述第一译码器的校验子;
基于所述多进制待成型比特和所述目标幅度概率分布,通过所述第一译码器,获取所述多进制待成型比特对应的多进制译码码字;
将所述多进制译码码字转为二进制,获取所述成型幅度比特。
可选地,所述基于所述目标幅度概率分布确定多进制信道码的码率,包括:
基于目标幅度概率分布,确定所有幅度比特对应的熵;
基于所述所有幅度比特对应的熵,确定所述多进制信道码的码率。
可选地,所述第一译码器包括以下任一项:
支持软输入软输出的译码器;或
支持软输入硬输出的译码器;或
基于神经网络训练获得的译码器。
可选地,所述将所述成型幅度比特映射为调制星座点,包括:
将所述成型幅度比特和目标极性比特映射为所述调制星座点。
可选地,在所述将所述成型幅度比特映射为调制星座点之前,所述操作还包括:
获取目标发送比特;
对所述目标发送比特进行串并转换,获取所述待成型比特和第一极性比特;
基于所述第一极性比特和所述成型幅度比特,确定所述目标极性比特。
可选地,所述基于所述第一极性比特和所述成型幅度比特,确定所述目标极性比特,包括:
对所述第一极性比特和所述成型幅度比特进行前向纠错编码,获取第 一校验比特;
对所述第一校验比特和所述第一极性比特进行串并转换,获取所述目标极性比特。
可选地,在所述基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特之前,所述操作还包括:
获取目标发送比特;
对所述目标发送比特进行前向纠错编码,获取第一编码码字;
对所述第一编码码字进行串并转换,获取所述待成型比特和所述目标极性比特。
可选地,在所述基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特之前,所述操作还包括:
基于目标信噪比SNR和目标调制阶数,确定所述目标幅度概率分布。
在此需要说明的是,本发明实施例提供的上述终端,能够实现上行场景中上述执行主体为终端的方法实施例所实现的所有方法步骤,且能够达到相同的技术效果,在此不再对本实施例中与方法实施例相同的部分及有益效果进行具体赘述。
图14是本公开实施例提供的概率成型的映射装置的结构示意图,如图14所示,所述装置1400应用于发送端,包括:第一获取单元1401和第二获取单元1402,其中:
第一获取单元1401,用于基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特;
第二获取单元1402,用于将所述成型幅度比特映射为调制星座点。
可选地,在所述信道码为二进制信道码的情况下,所述第一获取单元具体用于:
确定多个比特层,每一个比特层分别对应一个所述第一译码器;
基于所述目标幅度概率分布以及所述待成型比特,通过所述多个比特层分别对应的第一译码器,获取所述多个比特层分别对应的译码码字;
基于所述多个比特层分别对应的译码码字,获取所述成型幅度比特。
可选地,所述第一获取单元具体用于:
基于目标幅度概率分布,确定所述多个比特层分别对应的码率;
基于所述待成型比特和所述多个比特层分别对应的码率,确定所述多个比特层分别对应的校验子;
基于所述多个比特层分别对应的所述第一译码器和所述多个比特层分别对应的校验子,获取所述多个比特层分别对应的译码码字;
基于所述多个比特层分别对应的译码码字,获取所述成型幅度比特。
可选地,所述第一获取单元具体用于:
将所述多个比特层中的第一个比特层对应的校验子输入所述第一个比特层对应的第一译码器,获取第一个比特层对应的译码码字;
对于多个比特层中的每一个目标比特层,将所述目标比特层对应的校验子和第一译码码字输入所述目标比特层对应的第一译码器,获取所述目标比特层对应的译码码字;
其中,所述第一译码码字包括所述目标比特层之前的全部比特层分别对应的译码码字,所述目标比特层为除所述第一个比特层之外的其他比特层。
可选地,所述第一获取单元具体用于:
基于目标幅度概率分布,确定所述多个比特层中每一层的幅度比特分别对应的熵;
基于所述多个比特层分别对应的熵,确定所述多个比特层分别对应的码率。
可选地,在所述信道码为多进制信道码的情况下,所述第一获取单元具体用于:
基于所述目标幅度概率分布确定多进制信道码的码率;
基于所述待成型比特和所述多进制信道码的码率,获取所述待成型比特对应的多进制待成型比特,所述多进制待成型比特用于作为所述第一译码器的校验子;
基于所述多进制待成型比特和所述目标幅度概率分布,通过所述第一 译码器,获取所述多进制待成型比特对应的多进制译码码字;
将所述多进制译码码字转为二进制,获取所述成型幅度比特。
可选地,所述第一获取单元具体用于:
基于目标幅度概率分布,确定所有幅度比特对应的熵;
基于所述所有幅度比特对应的熵,确定所述多进制信道码的码率。
可选地,所述第一译码器包括以下任一项:
支持软输入软输出的译码器;或
支持软输入硬输出的译码器;或
基于神经网络训练获得的译码器。
可选地,所述第二获取单元具体用于:
将所述成型幅度比特和目标极性比特映射为所述调制星座点。
可选地,所述装置还包括第三获取单元,在所述将所述成型幅度比特映射为调制星座点之前,所述第三获取单元用于:
获取目标发送比特;
对所述目标发送比特进行串并转换,获取所述待成型比特和第一极性比特;
基于所述第一极性比特和所述成型幅度比特,确定所述目标极性比特。
可选地,所述第三获取单元具体用于:
对所述第一极性比特和所述成型幅度比特进行前向纠错编码,获取第一校验比特;
对所述第一校验比特和所述第一极性比特进行串并转换,获取所述目标极性比特。
可选地,所述装置还包括第四获取单元,在所述基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特之前,所述第四获取单元用于:
获取目标发送比特;
对所述目标发送比特进行前向纠错编码,获取第一编码码字;
对所述第一编码码字进行串并转换,获取所述待成型比特和所述目标 极性比特。
可选地,所述装置还包括确定单元,在所述基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特之前,所述确定单元用于:
基于目标信噪比SNR和目标调制阶数,确定所述目标幅度概率分布。
图15是本公开实施例提供的概率解成型的接收处理装置的结构示意图,如图15所示,所述装置1500应用于接收端,包括:第五获取单元1501,其中:
第五获取单元1501,用于对接收信号进行解成型;
其中,接收到的所述信号对应的成型幅度比特是专用于信道码的第一译码器基于目标幅度概率分布和待成型比特获取的。
可选地,所述第五获取单元具体用于:
将所述接收信号输入到解调器,获取解调信息;
将所述解调信息输入到前向纠错译码器,获取所述成型幅度比特和第一极性比特;
将所述成型幅度比特输入到解成型器,获取待成型比特;
基于所述待成型比特和所述第一极性比特,确定所述目标发送比特。
可选地,所述第五获取单元具体用于:
在所述成型幅度比特为硬值比特的情况下,基于校验约束关系,将所述成型幅度比特输入到所述解成型器,获取所述待成型比特,所述待成型比特为所述信道码的校验子对应的硬值比特。
可选地,所述第五获取单元具体用于:
在所述成型幅度比特为软值比特的情况下,将所述成型幅度比特输入到所述解成型器,获取待成型比特,所述解成型器包括所述信道码的第二译码器,所述待成型比特为所述信道码的校验子对应的软值比特。
可选地,所述第五获取单元具体用于:
对所述接收信号进行解调解成型,获取第二编码码字;
将所述第二编码码字输入到前向纠错译码器,获取所述目标发送比特。
可选地,所述第五获取单元具体用于:
将所述接收信号输入到解调器,获取解调信息;
在所述解调信息为软值比特的情况下,将所述解调信息输入到所述解成型器,获取所述第二编码码字,所述解成型器包括所述信道码的第二译码器,所述第二编码码字为所述信道码的校验子对应的软值比特。
可选地,所述第五获取单元具体用于:
将所述接收信号输入到解调器,获取解调信息;
在所述解调信息为软值比特的情况下,将所述解调信息输入到所述解成型器,获取所述第二编码码字,所述解成型器包括所述信道码的第三译码器,所述第二编码码字为所述信道码的校验子对应的硬值比特。
可选地,所述第五获取单元具体用于:
基于所述解调器、所述解成型器和所述前向纠错译码器之间的Turbo迭代过程,获取所述接收信号对应的目标发送比特。
需要说明的是,本公开实施例中对单元的划分是示意性的,仅仅为一种逻辑功能划分,实际实现时可以有另外的划分方式。另外,在本公开各个实施例中的各功能单元可以集成在一个处理单元中,也可以是各个单元单独物理存在,也可以两个或两个以上单元集成在一个单元中。上述集成的单元既可以采用硬件的形式实现,也可以采用软件功能单元的形式实现。
所述集成的单元如果以软件功能单元的形式实现并作为独立的产品销售或使用时,可以存储在一个处理器可读取存储介质中。基于这样的理解,本公开的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的全部或部分可以以软件产品的形式体现出来,该计算机软件产品存储在一个存储介质中,包括若干指令用以使得一台计算机设备(可以是个人计算机,服务器,或者网络设备等)或处理器(processor)执行本公开各个实施例所述方法的全部或部分步骤。而前述的存储介质包括:U盘、移动硬盘、只读存储器(Read-Only Memory,ROM)、随机存取存储器(Random Access Memory,RAM)、磁碟或者光盘等各种可以存储程序代码的介质。
在此需要说明的是,本发明实施例提供的上述装置,能够实现上述方法实施例所实现的所有方法步骤,且能够达到相同的技术效果,在此不再对本实施例中与方法实施例相同的部分及有益效果进行具体赘述。
另一方面,本公开实施例还提供一种处理器可读存储介质,所述处理器可读存储介质存储有计算机程序,所述计算机程序用于使所述处理器执行上述各实施例提供的方法,例如包括:
基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特;
将所述成型幅度比特映射为调制星座点。
例如包括:
对接收信号进行解成型;
其中,接收到的所述信号对应的成型幅度比特是专用于信道码的第一译码器基于目标幅度概率分布和待成型比特获取的。
所述处理器可读存储介质可以是处理器能够存取的任何可用介质或数据存储设备,包括但不限于磁性存储器(例如软盘、硬盘、磁带、磁光盘(MO)等)、光学存储器(例如CD、DVD、BD、HVD等)、以及半导体存储器(例如ROM、EPROM、EEPROM、非易失性存储器(NAND FLASH)、固态硬盘(SSD))等。
本领域内的技术人员应明白,本公开的实施例可提供为方法、系统、或计算机程序产品。因此,本公开可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。而且,本公开可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器和光学存储器等)上实施的计算机程序产品的形式。
本公开是参照根据本公开实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机可执行指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机可执行指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产 生一个机器,使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。
这些处理器可执行指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的处理器可读存储器中,使得存储在该处理器可读存储器中的指令产生包括指令装置的制造品,该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。
这些处理器可执行指令也可装载到计算机或其他可编程数据处理设备上,使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理,从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。
显然,本领域的技术人员可以对本公开进行各种改动和变型而不脱离本公开的精神和范围。这样,倘若本公开的这些修改和变型属于本公开权利要求及其等同技术的范围之内,则本公开也意图包含这些改动和变型在内。

Claims (61)

  1. 一种概率成型的映射方法,其特征在于,应用于发送端,包括:
    基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特;
    将所述成型幅度比特映射为调制星座点。
  2. 根据权利要求1所述的概率成型的映射方法,其特征在于,在所述信道码为二进制信道码的情况下,所述基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特,包括:
    确定多个比特层,每一个比特层分别对应一个所述第一译码器;
    基于所述目标幅度概率分布以及所述待成型比特,通过所述多个比特层分别对应的第一译码器,获取所述多个比特层分别对应的译码码字;
    基于所述多个比特层分别对应的译码码字,获取所述成型幅度比特。
  3. 根据权利要求2所述的概率成型的映射方法,其特征在于,所述基于所述目标幅度概率分布以及所述待成型比特,通过所述多个比特层分别对应的第一译码器,获取所述多个比特层分别对应的译码码字,包括:
    基于目标幅度概率分布,确定所述多个比特层分别对应的码率;
    基于所述待成型比特和所述多个比特层分别对应的码率,确定所述多个比特层分别对应的校验子;
    基于所述多个比特层分别对应的所述第一译码器和所述多个比特层分别对应的校验子,获取所述多个比特层分别对应的译码码字。
  4. 根据权利要求3所述的概率成型的映射方法,其特征在于,所述基于所述多个比特层分别对应的所述第一译码器和所述多个比特层分别对应的校验子,获取所述多个比特层分别对应的译码码字,包括:
    将所述多个比特层中的第一个比特层对应的校验子输入所述第一个比特层对应的第一译码器,获取第一个比特层对应的译码码字;
    对于多个比特层中的每一个目标比特层,将所述目标比特层对应的校验子和第一译码码字输入所述目标比特层对应的第一译码器,获取所述目标比特层对应的译码码字;
    其中,所述第一译码码字包括所述目标比特层之前的全部比特层分别对应的译码码字,所述目标比特层为除所述第一个比特层之外的其他比特层。
  5. 根据权利要求3所述的概率成型的映射方法,其特征在于,所述基于目标幅度概率分布,确定所述多个比特层分别对应的码率,包括:
    基于目标幅度概率分布,确定所述多个比特层中每一层的幅度比特分别对应的熵;
    基于所述多个比特层分别对应的熵,确定所述多个比特层分别对应的码率。
  6. 根据权利要求1所述的概率成型的映射方法,其特征在于,在所述信道码为多进制信道码的情况下,所述基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特,包括:
    基于所述目标幅度概率分布确定多进制信道码的码率;
    基于所述待成型比特和所述多进制信道码的码率,获取所述待成型比特对应的多进制待成型比特,所述多进制待成型比特用于作为所述第一译码器的校验子;
    基于所述多进制待成型比特和所述目标幅度概率分布,通过所述第一译码器,获取所述多进制待成型比特对应的多进制译码码字;
    将所述多进制译码码字转为二进制,获取所述成型幅度比特。
  7. 根据权利要求6所述的概率成型的映射方法,其特征在于,所述基于所述目标幅度概率分布确定多进制信道码的码率,包括:
    基于目标幅度概率分布,确定所有幅度比特对应的熵;
    基于所述所有幅度比特对应的熵,确定所述多进制信道码的码率。
  8. 根据权利要求1-7任一项所述的概率成型的映射方法,其特征在于,所述第一译码器包括以下任一项:
    支持软输入软输出的译码器;或
    支持软输入硬输出的译码器;或
    基于神经网络训练获得的译码器。
  9. 根据权利要求1-7任一项所述的概率成型的映射方法,其特征在于,所述将所述成型幅度比特映射为调制星座点,包括:
    将所述成型幅度比特和目标极性比特映射为所述调制星座点。
  10. 根据权利要求9所述的概率成型的映射方法,其特征在于,在所述将所述成型幅度比特映射为调制星座点之前,所述方法还包括:
    获取目标发送比特;
    对所述目标发送比特进行串并转换,获取所述待成型比特和第一极性比特;
    基于所述第一极性比特和所述成型幅度比特,确定所述目标极性比特。
  11. 根据权利要求10所述的概率成型的映射方法,其特征在于,所述基于所述第一极性比特和所述成型幅度比特,确定所述目标极性比特,包括:
    对所述第一极性比特和所述成型幅度比特进行前向纠错编码,获取第一校验比特;
    对所述第一校验比特和所述第一极性比特进行串并转换,获取所述目标极性比特。
  12. 根据权利要求9所述的概率成型的映射方法,其特征在于,在所述基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特之前,所述方法还包括:
    获取目标发送比特;
    对所述目标发送比特进行前向纠错编码,获取第一编码码字;
    对所述第一编码码字进行串并转换,获取所述待成型比特和所述目标极性比特。
  13. 一种概率解成型的接收处理方法,其特征在于,应用于接收端,包括:
    对接收信号进行解成型;
    其中,接收到的所述信号对应的成型幅度比特是专用于信道码的第一译码器基于目标幅度概率分布和待成型比特获取的。
  14. 根据权利要求13所述的概率解成型的接收处理方法,其特征在于,所述对接收信号进行解成型,包括:
    将所述接收信号输入到解调器,获取解调信息;
    将所述解调信息输入到前向纠错译码器,获取所述成型幅度比特和第一极性比特;
    将所述成型幅度比特输入到解成型器,获取待成型比特。
  15. 根据权利要求14所述的概率解成型的接收处理方法,其特征在于,所述将所述成型幅度比特输入到解成型器,获取待成型比特,包括:
    在所述成型幅度比特为硬值比特的情况下,基于校验约束关系,将所述成型幅度比特输入到所述解成型器,获取所述待成型比特,所述待成型比特为所述信道码的校验子对应的硬值比特。
  16. 根据权利要求14所述的概率解成型的接收处理方法,其特征在于,所述将所述成型幅度比特输入到解成型器,获取待成型比特,包括:
    在所述成型幅度比特为软值比特的情况下,将所述成型幅度比特输入到所述解成型器,获取待成型比特,所述解成型器包括所述信道码的第二译码器,所述待成型比特为所述信道码的校验子对应的软值比特。
  17. 根据权利要求13所述的概率解成型的接收处理方法,其特征在于,所述对接收信号进行解成型,包括:
    对所述接收信号进行解调解成型,获取第二编码码字;
    将所述第二编码码字输入到前向纠错译码器,获取目标发送比特。
  18. 根据权利要求17所述的概率解成型的接收处理方法,其特征在于,所述对所述接收信号进行解调解成型,获取第二编码码字,包括:
    将所述接收信号输入到解调器,获取解调信息;
    在所述解调信息为软值比特的情况下,将所述解调信息输入到所述解成型器,获取所述第二编码码字,所述解成型器包括所述信道码的第二译码器,所述第二编码码字为所述信道码的校验子对应的软值比特。
  19. 根据权利要求17所述的概率解成型的接收处理方法,其特征在于,所述对所述接收信号进行解调解成型,获取第二编码码字,包括:
    将所述接收信号输入到解调器,获取解调信息;
    在所述解调信息为软值比特的情况下,将所述解调信息输入到所述解成型器,获取所述第二编码码字,所述解成型器包括所述信道码的第三译码器,所述第二编码码字为所述信道码的校验子对应的硬值比特。
  20. 根据权利要求16或18所述的概率解成型的接收处理方法,其特征在于,所述对接收信号进行解成型,包括:
    基于所述解调器、所述解成型器和所述前向纠错译码器之间的Turbo迭代过程,获取所述接收信号对应的目标发送比特。
  21. 一种发送端,其特征在于,包括存储器,收发机,处理器:
    存储器,用于存储计算机程序;收发机,用于在所述处理器的控制下收发数据;处理器,用于读取所述存储器中的计算机程序并执行以下操作:
    基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特;
    将所述成型幅度比特映射为调制星座点。
  22. 根据权利要求21所述的发送端,其特征在于,在所述信道码为二进制信道码的情况下,所述基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特,包括:
    确定多个比特层,每一个比特层分别对应一个所述第一译码器;
    基于所述目标幅度概率分布以及所述待成型比特,通过所述多个比特层分别对应的第一译码器,获取所述多个比特层分别对应的译码码字;
    基于所述多个比特层分别对应的译码码字,获取所述成型幅度比特。
  23. 根据权利要求22所述的发送端,其特征在于,所述基于所述目标幅度概率分布以及所述待成型比特,通过所述多个比特层分别对应的第一译码器,获取所述多个比特层分别对应的译码码字,包括:
    基于目标幅度概率分布,确定所述多个比特层分别对应的码率;
    基于所述待成型比特和所述多个比特层分别对应的码率,确定所述多个比特层分别对应的校验子;
    基于所述多个比特层分别对应的所述第一译码器和所述多个比特层 分别对应的校验子,获取所述多个比特层分别对应的译码码字。
  24. 根据权利要求23所述发送端,其特征在于,所述基于所述多个比特层分别对应的所述第一译码器和所述多个比特层分别对应的校验子,获取所述多个比特层分别对应的译码码字,包括:
    将所述多个比特层中的第一个比特层对应的校验子输入所述第一个比特层对应的第一译码器,获取第一个比特层对应的译码码字;
    对于多个比特层中的每一个目标比特层,将所述目标比特层对应的校验子和第一译码码字输入所述目标比特层对应的第一译码器,获取所述目标比特层对应的译码码字;
    其中,所述第一译码码字包括所述目标比特层之前的全部比特层分别对应的译码码字,所述目标比特层为除所述第一个比特层之外的其他比特层。
  25. 根据权利要求23所述的发送端,其特征在于,所述基于目标幅度概率分布,确定所述多个比特层分别对应的码率,包括:
    基于目标幅度概率分布,确定所述多个比特层中每一层的幅度比特分别对应的熵;
    基于所述多个比特层分别对应的熵,确定所述多个比特层分别对应的码率。
  26. 根据权利要求21所述的发送端,其特征在于,在所述信道码为多进制信道码的情况下,所述基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特,包括:
    基于所述目标幅度概率分布确定多进制信道码的码率;
    基于所述待成型比特和所述多进制信道码的码率,获取所述待成型比特对应的多进制待成型比特,所述多进制待成型比特用于作为所述第一译码器的校验子;
    基于所述多进制待成型比特和所述目标幅度概率分布,通过所述第一译码器,获取所述多进制待成型比特对应的多进制译码码字;
    将所述多进制译码码字转为二进制,获取所述成型幅度比特。
  27. 根据权利要求26所述的发送端,其特征在于,所述基于所述目标幅度概率分布确定多进制信道码的码率,包括:
    基于目标幅度概率分布,确定所有幅度比特对应的熵;
    基于所述所有幅度比特对应的熵,确定所述多进制信道码的码率。
  28. 根据权利要求21-27任一项所述的发送端,其特征在于,所述第一译码器包括以下任一项:
    支持软输入软输出的译码器;或
    支持软输入硬输出的译码器;或
    基于神经网络训练获得的译码器。
  29. 根据权利要求21-27任一项所述的发送端,其特征在于,所述将所述成型幅度比特映射为调制星座点,包括:
    将所述成型幅度比特和目标极性比特映射为所述调制星座点。
  30. 根据权利要求29任一项所述的发送端,其特征在于,在所述将所述成型幅度比特映射为调制星座点之前,所述操作还包括:
    获取目标发送比特;
    对所述目标发送比特进行串并转换,获取所述待成型比特和第一极性比特;
    基于所述第一极性比特和所述成型幅度比特,确定所述目标极性比特。
  31. 根据权利要求30所述的发送端,其特征在于,所述基于所述第一极性比特和所述成型幅度比特,确定所述目标极性比特,包括:
    对所述第一极性比特和所述成型幅度比特进行前向纠错编码,获取第一校验比特;
    对所述第一校验比特和所述第一极性比特进行串并转换,获取所述目标极性比特。
  32. 根据权利要求29所述的发送端,其特征在于,在所述基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特之前,所述操作还包括:
    获取目标发送比特;
    对所述目标发送比特进行前向纠错编码,获取第一编码码字;
    对所述第一编码码字进行串并转换,获取所述待成型比特和所述目标极性比特。
  33. 一种接收端,其特征在于,包括存储器,收发机,处理器:
    存储器,用于存储计算机程序;收发机,用于在所述处理器的控制下收发数据;处理器,用于读取所述存储器中的计算机程序并执行以下操作:
    对接收信号进行解成型;
    其中,接收到的所述信号对应的成型幅度比特是专用于信道码的第一译码器基于目标幅度概率分布和待成型比特获取的。
  34. 根据权利要求33所述的接收端,其特征在于,所述对接收信号进行解成型,包括:
    将所述接收信号输入到解调器,获取解调信息;
    将所述解调信息输入到前向纠错译码器,获取所述成型幅度比特和第一极性比特;
    将所述成型幅度比特输入到解成型器,获取待成型比特。
  35. 根据权利要求34所述的接收端,其特征在于,所述将所述成型幅度比特输入到解成型器,获取待成型比特,包括:
    在所述成型幅度比特为硬值比特的情况下,基于校验约束关系,将所述成型幅度比特输入到所述解成型器,获取所述待成型比特,所述待成型比特为所述信道码的校验子对应的硬值比特。
  36. 根据权利要求34所述的接收端,其特征在于,所述将所述成型幅度比特输入到解成型器,获取待成型比特,包括:
    在所述成型幅度比特为软值比特的情况下,将所述成型幅度比特输入到所述解成型器,获取待成型比特,所述解成型器包括所述信道码的第二译码器,所述待成型比特为所述信道码的校验子对应的软值比特。
  37. 根据权利要求33所述的接收端,其特征在于,所述对接收信号进行解成型,包括:
    对所述接收信号进行解调解成型,获取第二编码码字;
    将所述第二编码码字输入到前向纠错译码器,获取目标发送比特。
  38. 根据权利要求37所述的接收端,其特征在于,所述对所述接收信号进行解调解成型,获取第二编码码字,包括:
    将所述接收信号输入到解调器,获取解调信息;
    在所述解调信息为软值比特的情况下,将所述解调信息输入到所述解成型器,获取所述第二编码码字,所述解成型器包括所述信道码的第二译码器,所述第二编码码字为所述信道码的校验子对应的软值比特。
  39. 根据权利要求37所述的接收端,其特征在于,所述对所述接收信号进行解调解成型,获取第二编码码字,包括:
    将所述接收信号输入到解调器,获取解调信息;
    在所述解调信息为软值比特的情况下,将所述解调信息输入到所述解成型器,获取所述第二编码码字,所述解成型器包括所述信道码的第三译码器,所述第二编码码字为所述信道码的校验子对应的硬值比特。
  40. 根据权利要求36或38所述的接收端,其特征在于,所述对接收信号进行解成型,包括:
    基于所述解调器、所述解成型器和所述前向纠错译码器之间的Turbo迭代过程,获取所述接收信号对应的目标发送比特。
  41. 一种概率成型的映射装置,其特征在于,应用于发送端,包括:
    第一获取单元,用于基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特;
    第二获取单元,用于将所述成型幅度比特映射为调制星座点。
  42. 根据权利要求41所述的概率成型的映射装置,其特征在于,在所述信道码为二进制信道码的情况下,所述第一获取单元具体用于:
    确定多个比特层,每一个比特层分别对应一个所述第一译码器;
    基于所述目标幅度概率分布以及所述待成型比特,通过所述多个比特层分别对应的第一译码器,获取所述多个比特层分别对应的译码码字;
    基于所述多个比特层分别对应的译码码字,获取所述成型幅度比特。
  43. 根据权利要求42所述的概率成型的映射装置,其特征在于,所 述第一获取单元具体用于:
    基于目标幅度概率分布,确定所述多个比特层分别对应的码率;
    基于所述待成型比特和所述多个比特层分别对应的码率,确定所述多个比特层分别对应的校验子;
    基于所述多个比特层分别对应的所述第一译码器和所述多个比特层分别对应的校验子,获取所述多个比特层分别对应的译码码字;
    基于所述多个比特层分别对应的译码码字,获取所述成型幅度比特。
  44. 根据权利要求43所述的概率成型的映射装置,其特征在于,所述第一获取单元具体用于:
    将所述多个比特层中的第一个比特层对应的校验子输入所述第一个比特层对应的第一译码器,获取第一个比特层对应的译码码字;
    对于多个比特层中的每一个目标比特层,将所述目标比特层对应的校验子和第一译码码字输入所述目标比特层对应的第一译码器,获取所述目标比特层对应的译码码字;
    其中,所述第一译码码字包括所述目标比特层之前的全部比特层分别对应的译码码字,所述目标比特层为除所述第一个比特层之外的其他比特层。
  45. 根据权利要求43所述的概率成型的映射装置,其特征在于,所述第一获取单元具体用于:
    基于目标幅度概率分布,确定所述多个比特层中每一层的幅度比特分别对应的熵;
    基于所述多个比特层分别对应的熵,确定所述多个比特层分别对应的码率。
  46. 根据权利要求41所述的概率成型的映射装置,其特征在于,在所述信道码为多进制信道码的情况下,所述第一获取单元具体用于:
    基于所述目标幅度概率分布确定多进制信道码的码率;
    基于所述待成型比特和所述多进制信道码的码率,获取所述待成型比特对应的多进制待成型比特,所述多进制待成型比特用于作为所述第一译 码器的校验子;
    基于所述多进制待成型比特和所述目标幅度概率分布,通过所述第一译码器,获取所述多进制待成型比特对应的多进制译码码字;
    将所述多进制译码码字转为二进制,获取所述成型幅度比特。
  47. 根据权利要求46所述的概率成型的映射装置,其特征在于,所述第一获取单元具体用于:
    基于目标幅度概率分布,确定所有幅度比特对应的熵;
    基于所述所有幅度比特对应的熵,确定所述多进制信道码的码率。
  48. 根据权利要求41-47任一项所述的概率成型的映射装置,其特征在于,所述第一译码器包括以下任一项:
    支持软输入软输出的译码器;或
    支持软输入硬输出的译码器;或
    基于神经网络训练获得的译码器。
  49. 根据权利要求41-47任一项所述的概率成型的映射装置,其特征在于,所述第二获取单元具体用于:
    将所述成型幅度比特和目标极性比特映射为所述调制星座点。
  50. 根据权利要求49所述的概率成型的映射装置,其特征在于,所述装置还包括第三获取单元,在所述将所述成型幅度比特映射为调制星座点之前,所述第三获取单元用于:
    获取目标发送比特;
    对所述目标发送比特进行串并转换,获取所述待成型比特和第一极性比特;
    基于所述第一极性比特和所述成型幅度比特,确定所述目标极性比特。
  51. 根据权利要求50所述的概率成型的映射装置,其特征在于,所述第三获取单元具体用于:
    对所述第一极性比特和所述成型幅度比特进行前向纠错编码,获取第一校验比特;
    对所述第一校验比特和所述第一极性比特进行串并转换,获取所述目 标极性比特。
  52. 根据权利要求49所述的概率成型的映射装置,其特征在于,所述装置还包括第四获取单元,在所述基于目标幅度概率分布以及待成型比特,通过专用于信道码的第一译码器获取成型幅度比特之前,所述第四获取单元用于:
    获取目标发送比特;
    对所述目标发送比特进行前向纠错编码,获取第一编码码字;
    对所述第一编码码字进行串并转换,获取所述待成型比特和所述目标极性比特。
  53. 一种概率解成型的接收处理装置,其特征在于,应用于接收端,包括:
    第五获取单元,用于对接收信号进行解成型;
    其中,接收到的所述信号对应的成型幅度比特是专用于信道码的第一译码器基于目标幅度概率分布和待成型比特获取的。
  54. 根据权利要求53所述的概率解成型的接收处理装置,其特征在于,所述第五获取单元具体用于:
    将所述接收信号输入到解调器,获取解调信息;
    将所述解调信息输入到前向纠错译码器,获取所述成型幅度比特和第一极性比特;
    将所述成型幅度比特输入到解成型器,获取待成型比特。
  55. 根据权利要求54所述的概率解成型的接收处理装置,其特征在于,所述第五获取单元具体用于:
    在所述成型幅度比特为硬值比特的情况下,基于校验约束关系,将所述成型幅度比特输入到所述解成型器,获取所述待成型比特,所述待成型比特为所述信道码的校验子对应的硬值比特。
  56. 根据权利要求54所述的概率解成型的接收处理装置,其特征在于,所述第五获取单元具体用于:
    在所述成型幅度比特为软值比特的情况下,将所述成型幅度比特输入 到所述解成型器,获取待成型比特,所述解成型器包括所述信道码的第二译码器,所述待成型比特为所述信道码的校验子对应的软值比特。
  57. 根据权利要求53所述的概率解成型的接收处理装置,其特征在于,所述第五获取单元具体用于:
    对所述接收信号进行解调解成型,获取第二编码码字;
    将所述第二编码码字输入到前向纠错译码器,获取目标发送比特。
  58. 根据权利要求57所述的概率解成型的接收处理装置,其特征在于,所述第五获取单元具体用于:
    将所述接收信号输入到解调器,获取解调信息;
    在所述解调信息为软值比特的情况下,将所述解调信息输入到所述解成型器,获取所述第二编码码字,所述解成型器包括所述信道码的第二译码器,所述第二编码码字为所述信道码的校验子对应的软值比特。
  59. 根据权利要求57所述的概率解成型的接收处理装置,其特征在于,所述第五获取单元具体用于:
    将所述接收信号输入到解调器,获取解调信息;
    在所述解调信息为软值比特的情况下,将所述解调信息输入到所述解成型器,获取所述第二编码码字,所述解成型器包括所述信道码的第三译码器,所述第二编码码字为所述信道码的校验子对应的硬值比特。
  60. 根据权利要求56或58所述的概率解成型的接收处理装置,其特征在于,所述第五获取单元具体用于:
    基于所述解调器、所述解成型器和所述前向纠错译码器之间的Turbo迭代过程,获取所述接收信号对应的目标发送比特。
  61. 一种处理器可读存储介质,其特征在于,所述处理器可读存储介质存储有计算机程序,所述计算机程序用于使所述处理器执行权利要求1至12任一项所述的方法或执行权利要求13至20任一项所述的方法。
PCT/CN2022/134093 2022-02-28 2022-11-24 概率成型的映射方法及概率解成型的接收处理方法 WO2023160053A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202210190613.0 2022-02-28
CN202210190613.0A CN116708114A (zh) 2022-02-28 2022-02-28 概率成型的映射方法及概率解成型的接收处理方法

Publications (1)

Publication Number Publication Date
WO2023160053A1 true WO2023160053A1 (zh) 2023-08-31

Family

ID=87764652

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2022/134093 WO2023160053A1 (zh) 2022-02-28 2022-11-24 概率成型的映射方法及概率解成型的接收处理方法

Country Status (2)

Country Link
CN (1) CN116708114A (zh)
WO (1) WO2023160053A1 (zh)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10091046B1 (en) * 2017-11-20 2018-10-02 Nokia Technologies Oy Joint use of probabilistic signal shaping and forward error correction
CN108809375A (zh) * 2018-04-27 2018-11-13 上海交通大学 基于概率整型的低精度大规模天线系统及其编码调制方法
US20190280809A1 (en) * 2018-03-09 2019-09-12 Nokia Solutions And Networks Oy Methods and apparatus for joint use of probabilistic signal shaping and forward error correction
CN112600568A (zh) * 2020-12-04 2021-04-02 天津大学 结合非标准6阶调制与ldpc码的编码调制传输方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10091046B1 (en) * 2017-11-20 2018-10-02 Nokia Technologies Oy Joint use of probabilistic signal shaping and forward error correction
US20190280809A1 (en) * 2018-03-09 2019-09-12 Nokia Solutions And Networks Oy Methods and apparatus for joint use of probabilistic signal shaping and forward error correction
CN108809375A (zh) * 2018-04-27 2018-11-13 上海交通大学 基于概率整型的低精度大规模天线系统及其编码调制方法
CN112600568A (zh) * 2020-12-04 2021-04-02 天津大学 结合非标准6阶调制与ldpc码的编码调制传输方法

Also Published As

Publication number Publication date
CN116708114A (zh) 2023-09-05

Similar Documents

Publication Publication Date Title
RU2663708C1 (ru) Способ и устройство для передачи данных
US9509379B2 (en) System and method for designing and using multidimensional constellations
EP3245745B1 (en) System and method for a message passing algorithm
CN109314600B (zh) 用于在使用通用极化码时进行速率匹配的系统和方法
US9362956B2 (en) Method and system for encoding and decoding data using concatenated polar codes
JP6803932B2 (ja) ポーラー符号を使用する場合のピース・ワイズ・レート・マッチングのためのシステムおよび方法
CN109417392B (zh) Ldpc码的编解码方法及系统
CN110213193B (zh) 不等概高阶星座点设计方法与解映射方法
US11671115B2 (en) High-rate long LDPC codes
CN106100795B (zh) 一种基于Plotkin构造和信息位重休眠的Polar码编码协作方法
WO2022161201A1 (zh) 编码调制与解调解码方法及装置
Meng et al. Multi-user detection for spatial modulation via structured approximate message passing
CN108352918B (zh) 接收器、多个发射器、从多个发射器接收用户数据的方法以及发送用户数据的方法
Yang et al. Clipping noise-aided message passing algorithm for SCMA-OFDM system
JP4939607B2 (ja) 無線通信システム、その無線通信システムの構成方法および受信機
US20240039777A1 (en) Modulation method, demodulation method, and communication apparatus
WO2023160053A1 (zh) 概率成型的映射方法及概率解成型的接收处理方法
JP2022541691A (ja) マルチレベルポーラ符号化変調送信及び受信のための方法及びデバイス
WO2016172937A1 (zh) 一种利用多元极化码进行数据传输的方法、装置
ES2448576T3 (es) Recepción descentralizada y cooperativa de datos a través de estaciones base
WO2014070074A1 (en) Wireless communication device and method for storing soft symbols
CN116134735A (zh) 使用符号软值的编码和解码方案
US10110346B1 (en) Method and apparatus for soft bit computation in MIMO decoders
CN106797567A (zh) 数据传输方法和相关设备
Pikus et al. Applying bit-level probabilistically shaped coded modulation for high-throughput communications

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 22928313

Country of ref document: EP

Kind code of ref document: A1