WO2020135616A1 - 极化编码调制的方法和装置 - Google Patents

极化编码调制的方法和装置 Download PDF

Info

Publication number
WO2020135616A1
WO2020135616A1 PCT/CN2019/128804 CN2019128804W WO2020135616A1 WO 2020135616 A1 WO2020135616 A1 WO 2020135616A1 CN 2019128804 W CN2019128804 W CN 2019128804W WO 2020135616 A1 WO2020135616 A1 WO 2020135616A1
Authority
WO
WIPO (PCT)
Prior art keywords
polarization
modulation
sub
weight
channels
Prior art date
Application number
PCT/CN2019/128804
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 WO2020135616A1 publication Critical patent/WO2020135616A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0057—Block codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0041—Arrangements at the transmitter end
    • H04L1/0043—Realisations of complexity reduction techniques, e.g. use of look-up tables

Definitions

  • the present application relates to the field of channel coding, and more specifically, to a method and device for polarization coding modulation.
  • Polarization codes are a kind of structured channel coding method which has been strictly proved to be able to reach the channel capacity in theory, and it has been greatly developed in recent years. In actual communication systems, in order to improve spectrum utilization, high-order modulation is usually used. Therefore, the combination of polarization codes and higher-order modulation has also received more and more attention in order to achieve joint optimization of code modulation.
  • the polarization coding modulation mainly uses the bit interleaved polarization coding modulation (bit interleaver polar coded modulation, BIPCM) framework.
  • BIPCM bit interleaver polar coded modulation
  • the transmitting end eliminates the correlation between bits by adding a bit-level interleaver between the encoder and the modulator.
  • the receiving end performs parallel demodulation on the received signal to obtain soft information of the bit sequence transmitted by the sending end, and then performs polarization decoding.
  • an M-ary modulated input channel can be decomposed into m parallel modulated sub-channels, M ⁇ 1, m ⁇ 1, and M and m are both integers.
  • M ⁇ 1, m ⁇ 1, and M and m are both integers.
  • AWGN binary additive white Gaussian noise
  • the present application provides a method and device for polarization coding modulation, which can reduce the complexity of calculating the reliability of polarization subchannels.
  • the present application provides a method of polarization coding modulation, which includes: determining the polarization weights of the N polarization sub-channels of the polarization code with a code length of N according to the modulation polarization parameter set, and modulating the polarization
  • the polarization parameter set includes one or more modulation polarization parameters, and the one or more modulation polarization parameters are used to determine that polarization coding is performed under high-order modulation so that the N polarization sub-channels are polarized to generate
  • the transmitting end can determine the polarization weight of the polarization sub-channel without using Gaussian approximate iterative calculation, thereby determining the order of reliability of the polarization sub-channel, and performing polarization coding in a high-order modulation scenario. Because the complex and cumbersome Gaussian approximate iterative calculation is avoided, the complexity of calculating the reliability of the polarization sub-channel can be reduced.
  • determining the polarization weight of each of the N polarizer channels of the polarization code with a code length of N according to the modulation polarization parameter set includes:
  • the first part of the polarization weight is the polarization weight produced by polarization coding under high-order modulation so that the sub-channel is polarized.
  • the second part of the polarization weight is only the polarization weight generated by the polarization coding so that the sub-channel is polarized.
  • the method before determining the reliability of the polarization sub-channel corresponding to the serial number i according to the formula, the method further includes: traversing the modulation polarization parameter set For the value of, select a set of values that minimizes the upper limit of the error rate.
  • the upper limit of the error rate is the sum of the error probabilities of the N polarized subchannels; the polarization code with a code length of N is determined according to the modulation polarization parameter set
  • the polarization weights of the N polarization sub-channels include: determining the polarization weights of the N polarization sub-channels according to a set of values of the modulation polarization parameter set that minimizes the upper limit of the error rate.
  • the present application provides an apparatus for polarization coding modulation, which has a function of implementing the method in the above-mentioned first aspect and any possible implementation manner thereof.
  • the function can be realized by hardware, or can also be realized by hardware executing corresponding software.
  • the hardware or software includes one or more units corresponding to the above functions.
  • the device when part or all of the functions are implemented by hardware, the device includes: an input interface circuit for acquiring a bit sequence to be encoded; a logic circuit for; an output interface circuit for Output.
  • the device may be a chip or an integrated circuit.
  • the device when part or all of the functions are implemented by software, the device includes: a memory for storing a computer program; a processor for executing the computer program stored in the memory when the computer When the program is executed, the device may implement the polarization coding modulation method as described in the first aspect or any possible design of the first aspect.
  • the memory may be a physically independent unit, or it may be integrated with the processor.
  • the device when part or all of the functions are implemented by software, the device includes only a processor.
  • the memory for storing the computer program is located outside the device, and the processor is connected to the memory through a circuit/wire to read and run the computer program stored in the memory to perform the first aspect or any possibility of the first aspect
  • the realization of the polarization coding modulation method when part or all of the functions are implemented by software, the device includes only a processor.
  • the memory for storing the computer program is located outside the device, and the processor is connected to the memory through a circuit/wire to read and run the computer program stored in the memory to perform the first aspect or any possibility of the first aspect.
  • the present application provides a network device, including a processor and a memory.
  • the memory is used to store a computer program
  • the processor is used to call and run the computer program stored in the memory, so that the network device executes the method in the first aspect or any possible implementation manner of the first aspect.
  • the network device as a transmitter of information and/or data, performs the above-mentioned first aspect or the method of polarization coding modulation in any possible implementation manner of the first aspect.
  • the present application provides a terminal device, including a processor and a memory.
  • the memory is used to store a computer program
  • the processor is used to call and run the computer program stored in the memory, so that the terminal device executes the method in the first aspect or any possible implementation manner of the first aspect.
  • the terminal device In uplink transmission, the terminal device, as a transmitter of information and/or data, executes the above-mentioned first aspect or the method of polarization coding modulation in any possible implementation manner of the first aspect.
  • the present application provides a computer-readable storage medium that stores computer instructions, and when the computer instructions run on a computer, causes the computer to perform the first aspect or any of the first aspect Possible implementation methods.
  • the present application provides a computer program product, the computer program product includes computer program code, and when the computer program code runs on a computer, causes the computer to perform the first aspect and any possible implementation thereof The way in the way.
  • the present application provides a chip, including a processor.
  • the processor is used to read and execute the computer program stored in the memory to execute the method in the first aspect or any possible implementation manner of the first aspect.
  • the chip further includes a memory, and the memory and the processor are connected to the memory through circuits or wires.
  • the chip further includes a communication interface, and the processor is connected to the communication interface.
  • the communication interface is used to receive the bit sequence to be coded.
  • the processor obtains the bit sequence to be coded from the communication interface, and uses the polarization coding modulation method described in the first aspect to perform polarization coding and modulation on the bit sequence to be coded to obtain Modulation symbol sequence; the communication interface is also used to output the modulation symbol sequence.
  • the communication interface may include an input interface and an output interface.
  • the present application provides a communication device, including a processor and an interface circuit, where the interface circuit is used to receive computer code or instructions and transmit it to the processor, where the processor is used to run the computer code or Instructions to perform the method of the first aspect or any possible implementation thereof.
  • the transmitting end can calculate the polarization weight of the polarization sub-channel without using Gaussian approximate iterative calculation, thereby determining the order of reliability of the polarization sub-channel and performing polarization coding. Because the complex and cumbersome Gaussian approximate iterative calculation is avoided, the complexity of calculating the reliability of the polarization sub-channel can be reduced.
  • FIG. 1 is an architectural diagram of a wireless communication system suitable for this application.
  • Figure 3 is a schematic diagram of the BIPCM framework.
  • FIG. 4 show schematic diagrams of one-level polarization and multi-level polarization processes, respectively.
  • FIG. 5 is a flowchart of a polarization coding modulation method provided by this application.
  • Fig. 6 is an equivalent flow of the processing flow at the sending end under the BIPCM framework.
  • FIG. 8 is a 16QAM modulation scenario to determine the value of ⁇ according to the curve of the upper bound of the error rate.
  • FIG. 11 is a schematic block diagram of a device 500 for bit interleaved polarization coding modulation provided by the present application.
  • FIG. 12 is a schematic structural diagram of a communication device 600 provided by this application.
  • FIG. 13 is a schematic diagram of the internal structure of the processing device 601.
  • FIG. 14 is a schematic structural diagram of a network device 3000 provided by this application.
  • 15 is a schematic structural diagram of a terminal device 7000 provided by this application.
  • the technical solution of this application can be applied to wireless communication systems, including but not limited to: narrow-band Internet of Things (narrow-band-Internet of things, NB-IoT), global mobile communication system (global system for mobile communications, GSM), enhanced Data rate GSM evolution system (enhanced data for GSM evolution, EDGE), wideband code division multiple access system (wideband code division multiple access (WCDMA), code division multiple access 2000 system (code division multiple access (CDMA2000), time division synchronization code
  • TD-SCDMA time division-synchronization code
  • LTE long-term evolution system
  • 5G mobile communication system namely enhanced mobile bandwidth (enhance mobile broadband) , EMBB), high reliability and low latency communication (ultra reliable low communication (URLLC)) and enhanced mass machine connection communication (massive machine type communication (eMTC).
  • FIG. 1 is an architectural diagram of a wireless communication system applicable to the present application.
  • a wireless communication system is usually composed of cells, and each cell includes a base station (BS), which provides communication services to multiple mobile stations (MS).
  • MS mobile stations
  • the base station is connected to the core network equipment.
  • a base station is a device deployed in a wireless access network to provide wireless communication functions for MSs.
  • the base station may include various forms of macro base stations, micro base stations (also called small stations), relay stations, access points, and so on.
  • the names of devices with base station functions may be different.
  • the base station in the LTE system, the base station is called evolved Node B (evolved NodeB, eNB or eNodeB), and in the third generation (3rd Generation, 3G) system, the base station is called Node B (Node B) and so on.
  • the base station may include a baseband unit (BBU) and a remote radio unit (RRU). BBU and RRU can be placed in different places.
  • BBU baseband unit
  • RRU remote radio unit
  • RRU is far away, placed in areas with high traffic volume, and BBU is placed in the central computer room.
  • BBU and RRU can also be placed in the same computer room.
  • BBU and RRU can also be different components under one rack.
  • the above devices that provide wireless communication functions for the MS are collectively referred to as network equipment or base stations or BSs.
  • the MS referred to in this application may include various handheld devices with wireless communication functions, vehicle mounted devices, wearable devices, computing devices, or other processing devices connected to a wireless modem.
  • the MS may also be called a terminal, a subscriber unit, a cellular phone, a smart phone, a wireless data card, a personal digital assistant (PDA) computer, a tablet Computer, wireless modem (modem), handheld device (handset), laptop computer (laptop computer), machine type communication (machine type communication (MTC) terminal, etc.
  • PDA personal digital assistant
  • modem modem
  • handset handheld device
  • laptop computer laptop computer
  • MTC machine type communication
  • FIG. 2 is a basic flowchart of wireless communication.
  • the source is sent through source coding, channel coding and modulation mapping in sequence.
  • the sink is output in turn through demodulation mapping, channel decoding and source decoding.
  • channel coding and channel decoding can use polar codes (also called polar codes).
  • Polar code is a constructable channel coding method that can reach the capacity of binary input discrete memoryless channels. By using channel combining and splitting operations, the resulting sub-channels are all noise-free or full-noise channels. Based on the polarization phenomenon of the sub-channel, a noise-free channel can be used to transmit information bits, and a full-noise channel can be used to transmit frozen bits known to the receiving end.
  • Polar code is a linear block code, and its coding matrix (also called generator matrix) is G N.
  • G N also called generator matrix
  • the coding process can be expressed by the following formula (1):
  • G N is an N ⁇ N matrix, Defined as the Kronecker product of log2 N matrices F 2 , The addition and multiplication operations involved in the above formulas are all addition and multiplication operations on the binary Galois field.
  • bit interleaved polarization code modulation bit interleaver polar coded modulation
  • FIG. 3 is a schematic diagram of the BIPCM framework.
  • the code length of the polarization code is N
  • the length of the information bit is K
  • the modulation order is m
  • Each bit stream is input to the interleaver separately for random interleaving.
  • Each interleaver outputs the interleaved bit sequence. Where the bit sequence output by the i-th interleaver is recorded as
  • the transmitter will modulate the symbol sequence Enter the M-ary AWGN channel for transmission, M ⁇ 1 and an integer.
  • the signal received by the receiving end is shown in formula (2).
  • n j is independent and identically distributed Gaussian noise, the mean is 0, and the variance is
  • the received modulation symbol sequence The input demodulator performs parallel demodulation to calculate the soft information of the bit sequence transmitted by the sending end. Then the soft information is sent to the decoder for decode after deinterleaving and parallel-serial conversion.
  • the input channel of 2 m system Decompose into m binary channels ⁇ 1 , ⁇ 2 ,..., ⁇ m ⁇ , that is, the m parallel modulation sub-channels mentioned above.
  • the channel ⁇ i corresponding to the i-th bit can be expressed as ⁇ i : ⁇ 0,1 ⁇ y.
  • the channel transition probability of channel ⁇ i can be obtained by equation (3):
  • I the set of constellation points corresponding to the i-th bit of the corresponding bit sequence equal to c.
  • the modulation symbol sequence received by the receiving end is subjected to parallel demodulation, and the calculated soft information of the bit sequence transmitted by the sending end is specifically N log likelihood ratios.
  • N log-likelihood ratios are sent to the decoder for continuous cancellation (SC) decoding or cyclic redundancy check aided CRC aided successive cancellation list (CA-SCL) decoding to obtain the estimated sequence of the bit sequence sent by the sending end Complete decoding.
  • SC continuous cancellation
  • CA-SCL cyclic redundancy check aided CRC aided successive cancellation list
  • the reliability of the polarization sub-channel needs to be determined by Gaussian approximate iterative calculation before the construction of the polarization code can be carried out.
  • the complexity of Gaussian approximate iterative calculation is very high, and it is very difficult to be practical.
  • the present application proposes a method of polarization coding modulation, which can determine the reliability of the polarization sub-channel without using Gaussian approximate iterative calculation.
  • the simulation results show that the decoding performance of the polarization code constructed according to the reliability of the polarization sub-channel determined by the method provided in this application is basically the same as the decoding performance of the polarization code constructed using Gaussian approximate iterative calculation.
  • the reliability of the polarization sub-channel is determined, the calculation complexity is reduced, and it is easy to use.
  • the calculation of the reliability of polarized subchannels depends on the signal-to-noise ratio. Therefore, under different signal-to-noise ratio conditions, the calculation of the reliability of polarized subchannels is not universal.
  • the technical solution provided by the present application no longer depends on the signal-to-noise ratio when determining the reliability of the polarized sub-channel. Therefore, the calculation of the reliability of polarized sub-channels is common under different signal-to-noise ratio conditions.
  • the present application provides a general scheme for constructing polarization codes based on the BIPCM framework.
  • the inventor of the present application found that if the polar code is regarded as a generalized concatenated code, then according to the reliability relationship between the polarization subchannels of the inner code and the outer code of the concatenated code, the polar code can be determined Reliability ranking of polarized sub-channels.
  • FIG. 4 shows schematic diagrams of the first-level polarization and multi-level polarization processes, respectively.
  • a first-level polarized core assuming that the two input channels at the right end of the polarized core have the same capacity (as shown in (a) of FIG. 4, both are W), then pass
  • the capacity of the left-hand polarized sub-channel is W- and W+, where the reliability of the polarized sub-channel corresponding to W- is less than the reliability of the polarized sub-channel corresponding to W+.
  • this application proposes to introduce modulation polarization parameters, combined with the traditional polarization weight (PW) formula used to determine the reliability of the polarized sub-channel, to determine the reliability of the N polarized sub-channels.
  • PW polarization weight
  • FIG. 5 is a flowchart of a method 200 for polarization coding modulation provided by the present application.
  • the method 200 may be executed by the sending end.
  • the terminal device In uplink transmission, it is performed by the terminal device.
  • a network device for example, a base station.
  • the polar code is regarded as a generalized concatenated code.
  • the bit-level interleaver does not affect the reliability distribution of the polarized sub-channel. Therefore, the processing flow at the transmitting end in the BIPCM frame shown in FIG. 3 can be equivalent to that shown in FIG. 6.
  • the polarization code with a code length of N is regarded as a concatenated code
  • the inner code of the concatenated code is N 0 polarization codes with a code length of N t
  • the outer code is N t code lengths It is the polarization code of N 0 .
  • N 0 ⁇ N t N
  • N 0 and N t are both positive integers.
  • N t m
  • N 0 N/m.
  • m is the modulation order of high-order modulation.
  • G N/m corresponds to the outer code encoder
  • G m corresponds to the inner code encoder
  • the method 200 will be described below.
  • the method 200 may include steps 210-240.
  • the reliability of the polarization sub-channel is calculated according to the PW formula.
  • the PW formula is shown in equation (4) below.
  • n is the number of bits of the polarized sub-channel expanded into a binary representation
  • a i is the ith bit in the binary representation of the number of the polarized sub-channel.
  • the PW formula is used to calculate the polarization weight of the polarizer channel, and the polarization weight can be used to characterize the reliability of the polarizer channel. Generally, the larger the polarization weight of a polarizer channel, the higher the reliability of the polarizer channel.
  • the polarization weight includes the first part polarization weight and the second part polarization weight.
  • the first part of the polarization weight is determined according to the modulation polarization parameter set, and the second part of the polarization weight can continue to be determined using the PW formula.
  • the polarization weight in this application introduces the modulation polarization part on the basis of the traditional PW formula used to calculate the polarization weight. Therefore, the modulation polarization parameter is used to determine the polarization weight generated by polarizing the N polarized sub-channels of the polar code with a code length of N under the high-order modulation scenario.
  • the first part of the polarization weight is the polarization weight generated by polarization coding under high-order modulation so that the sub-channel is polarized.
  • the second part of the polarization weight is only the polarization weight generated by the polarization coding so that the sub-channel is polarized.
  • the transmitting end determines the polarization weights of the N polarization sub-channels according to the modulation polarization parameter set, which may specifically include the following process:
  • the modulation polarization parameter set and the binary representation i of the sequence number i (i 1 , i 2 , ..., i n )
  • the polarization weight of the channel includes the first part polarization weight and the second part polarization weight
  • the first part polarization weight is expressed according to the modulation polarization parameter set and the binary representation of the serial number i Partially determined
  • the second part of the polarization weight is based on the binary representation of the serial number i Partially determined
  • m is determined according to the modulation order
  • n is the number of bits in the binary representation of the number i of the polarized subchannel.
  • m may be equal to the modulation order.
  • m is equal to the modulation order of 2.
  • the polarization sub-channel corresponding to the serial number i refers to any one of the N polarization sub-channels.
  • the number i of the polarized sub-channel can also be referred to as the index i of the polarized sub-channel.
  • the reliability is measured according to the polarization weight, and the calculation of the polarization weight includes two parts.
  • the first part of the polarization weight is determined according to the modulation polarization parameter set, and the second part of the polarization weight is determined according to the traditional PW formula. From this, it can also be said that the present application rewrites the existing PW formula, and introduces a modulation polarization part in the PW formula, which is used to calculate the sub-channel polarization caused by encoding in a high-order modulation scenario.
  • Polarized weight The rewritten PW formula can be called extended polarization weight (EPW) formula.
  • EPW extended polarization weight
  • the first part of the polarization weight is the polarization weight generated by encoding in a high-order modulation scenario so that the sub-channel is polarized
  • the second part of the polarization weight is the polarization weight generated by encoding so that the sub-channel is polarized.
  • the first part of the polarization weight is determined according to the modulation polarization parameter in the modulation polarization parameter set and the binary representation of the serial number i from the first bit to the log 2 mth bit.
  • the second part of the polarization weight is determined according to the log 2 m+1 bit to the n th bit of the binary representation of the PW formula and the serial number i.
  • log 2 m+1 means (log 2 m)+1.
  • the sequence number of the polarized sub-channel is expanded into a 3-bit binary bit sequence.
  • the serial number 2 of the polarized sub-channel is represented as binary (0,1,0)
  • the serial number 3 is represented as binary (0,1,1).
  • the polarization weights of the polarization sub-channels corresponding to the serial numbers 2 and 3 respectively depend on the polarization weight of the second part.
  • the second part of the polarization weight needs to be based on with to make sure. Specifically, it is determined according to the second and third bits of the binary expansion of serial numbers 2 and 3.
  • sequence numbers 6 and 9 are the same (both are 0). Therefore, sequence numbers 6 and 9 belong to the same outer code encoder.
  • the polarization weight of the first part of the polarization sub-channel corresponding to the serial numbers 6 and 9 respectively Equal, so the magnitude of its reliability depends on the polarization weight of the second part
  • the relationship between the reliability of the polarization subchannels corresponding to sequence numbers 1 and 9 can be determined by the inner code G
  • the relationship between the reliability of the polarized subchannels corresponding to (i 1 , i 2 ) and (j 1 , j 2 ) output by m is determined. Since 0(0,0) ⁇ 2(1,0), 1(0,0,0,1) ⁇ 9(1,0,0,1).
  • the number 3 and number 15 of the polarized sub-channel are expanded into binary numbers 3 (0, 0, 1, 1) and 15 (1, 1, 1, 1), respectively.
  • the third and fourth bits of the binary expansion of sequence numbers 3 and 15 are the same (both are 11), then the relationship between the reliability of the polarization sub-channels corresponding to sequence numbers 3 and 15 can be output by the inner code G m (I 1 , i 2 ) and (j 1 , j 2 ) correspond to the magnitude relationship of the reliability of the polarization sub-channel to determine. Since 0(0,0) ⁇ 3(1,1), 3(0,0,1,1) ⁇ 15(1,1,1,1).
  • the outer code is 2 polar codes with a length of 4, as shown by the dotted boxes in numbers 1 and 2 in FIG. 7.
  • the inner code is 4 polar codes with a code length of 2, as shown by the dotted frame part numbered 3 shown in FIG. 7.
  • the reliability ranking of the sub-channels within this outer code encoder can be calculated by the PW formula determine.
  • the order of the polarized subchannels in the outer code encoder corresponding to the dotted frame shown by number 1 is (000) ⁇ (001) ⁇ (010) ⁇ (011).
  • the input channel capacity of the inner code encoder is unequal, so the magnitude relationship of the reliability between the polarization sub-channels of the two outer code encoders cannot be known.
  • the two sub-channels are allocated to the right end of an inner code encoder.
  • the sub-channel of node 1 is W1
  • the sub-channel of node 2 is W2.
  • the sub-channel of node 3 is obtained
  • the sub-channel of node 4 is W4. According to the law of first-level polarization introduced above, W3 ⁇ W4 can be determined.
  • nodes 5, 6, 7, and 8 also constitute an inner code encoder.
  • the channel of node 5 is W1
  • the channel of node 6 is W2
  • the channel of node 7 is W3, and the channel of node 8 is W4.
  • the four inner code encoders shown in FIG. 7. Since the input channels at the right end of the four inner code encoders have the same capacity, that is, node 1, node 5, node 9, and node 13 are W1, and node 2, node 6, node 10, and node 14 are W2. Therefore, the four inner code encoders are identical, so the capacity of the sub-channels after polarization is also equal. That is, node 3, node 7, node 11, and node 15 are W3, and node 4, node 8, node 12, and node 16 are W4. This is consistent with the analysis above that the input channel capacity of the outer code encoder is equal, that is, the input channel capacity of the outer code encoder is equal.
  • the sub-channel corresponding to 000 is the first sub-channel obtained from the four W3 polarizations
  • the sub-channel corresponding to 100 is the The first subchannels obtained by the four W4 polarizations have the same position in the outer code, which corresponds to the partial ordering corresponding to the above branch (2). Since the polarization sub-channels corresponding to 000 and 100 are the two sub-channels obtained by W3 and W4 through the same subsequent polarization process respectively, the reliability of the polarization sub-channels corresponding to 000 and 001 is determined by the relationship between W3 and W4 . Since W3 ⁇ W4, (000) ⁇ (100). Similarly, we can see that (001) ⁇ (101), (010) ⁇ (110), (011) ⁇ (111).
  • the polarization of the traditional polar code refers to the polarization phenomenon that occurs when the output channel capacity on the right side of the encoder is equal.
  • the polarization in the present application refers to the polarization phenomenon generated by encoding in a high-order modulation scenario (that is, the input channel capacity on the right side of the encoder is unequal).
  • step 210 is a detailed description of ranking the reliability of polarized sub-channels proposed in this application. It can be seen that the ordering of the reliability of polarized sub-channels no longer depends on the signal-to-noise ratio, and complex Gaussian approximate iterative calculations are avoided.
  • the modulation polarization parameter set needs to be determined The value of each modulation polarization parameter ⁇ i in, i ⁇ ⁇ 1,2,...,log 2 m ⁇ .
  • the transmitting end determines the error probability of each polarization sub-channel by Gaussian approximation, and selects a value from the closed interval [0,1] for each modulation polarization parameter ⁇ i according to the given code rate to determine Modulation polarization parameter set A set of values. Further, according to the value of each modulation polarization parameter ⁇ i in the modulation polarization parameter set, the polarization weight of each polarization sub-channel is calculated, thereby determining the order of reliability of the N polarization sub-channels. According to the order of reliability of the N polarized sub-channels, the information bit set is selected.
  • each selected information bit corresponds to a polarized sub-channel, and the error probability of this polarized sub-channel has been calculated by Gaussian approximation.
  • the error probabilities of all information bits are summed to obtain the upper bound of the error rate.
  • Traverse the set of modulation polarization parameters To find the set of values of the modulation polarization parameter set that minimizes the upper bound of the error rate. In this way, the value of each ⁇ i in the modulation polarization parameter set is also determined.
  • the polarization weight of each polarization sub-channel can be determined.
  • the order of reliability of the N polarized sub-channels is determined, so that a set of information bits, that is, a set of serial numbers of polarized sub-channels used to place information bits can be determined.
  • a set of information bits that is, a set of serial numbers of polarized sub-channels used to place information bits.
  • step 220 according to the reliability of the polarized sub-channel, the bit sequence to be encoded is polar-encoded, and after the code word is obtained, the bit streams output from the same position of different inner code encoders can be interleaved to improve translation. Code performance. Alternatively, the bit interleaving process may not be performed.
  • steps 230 and 240 refer to the processing flow of the sending end under the BIPCM framework described in FIG. 3 above, and details are not described here.
  • the receiving end After receiving the signal sent by the sending end, the receiving end performs decoding according to the processing flow of the receiving end in the BIPCM framework introduced in FIG. 3.
  • the performance of the polarization code constructed by the EPW formula provided in this application is not much different from the polarization code constructed by Gaussian approximation, but the calculation complexity is reduced.
  • the following is a performance simulation diagram using the polarization coding modulation method of the present application.
  • the EPW metric construction has a larger performance gain relative to the construction sequence used in 5G.
  • the EPW metric structure provided by the present application has little difference from the simulation result of the Gaussian approximation algorithm at each code length and code rate.
  • the method provided by the present application can reduce the computational complexity when constructing the polarization code.
  • FIG. 11 is a schematic block diagram of a device 500 for bit interleaved polarization coding modulation provided by the present application.
  • the device 500 includes a processing unit 510 and a transceiver unit 520.
  • the processing unit 510 is configured to determine respective polarization weights of the N polarization sub-channels of the polarization code with a code length of N according to the modulation polarization parameter set, and the modulation polarization parameter set includes one or more modulation polarization parameters,
  • the one or more modulation polarization parameters are used to determine the polarization weight generated by polarization coding under high-order modulation so that the N polarization sub-channels are polarized, N ⁇ 1 and an integer; according to this
  • the respective polarization weights of the N polarized sub-channels determine the order of reliability of the N polarized sub-channels, and according to the sorted reliability of the N polarized sub-channels, perform polarization coding on the bit sequence to be encoded, Obtain the codeword sequence; and, used to perform high-order modulation on the codeword sequence to obtain the modulation symbol sequence;
  • the transceiver unit 520 is used to transmit the modulation symbol sequence.
  • processing unit 510 is specifically used to:
  • the modulation polarization parameter set and the binary representation i of the sequence number i (i 1 , i 2 , ..., i n )
  • the polarization weight of the channel includes the first part polarization weight and the second part polarization weight
  • the first part polarization weight is expressed according to the modulation polarization parameter set and the binary representation of the serial number i Partially determined
  • the second part of the polarization weight is based on the binary representation of the serial number i Partially determined, where m is determined according to the modulation order, and n is the number of bits in the binary representation of sequence number i.
  • the processing unit 510 is specifically configured to determine the polarization weight of the polarization sub-channel corresponding to the sequence number i according to the following formula:
  • processing unit 510 is also used to:
  • the polarization weight of the N polarization sub-channels is determined according to a set of values of the modulation polarization parameter set that minimizes the upper bound of the error rate.
  • FIG. 12 is a schematic structural diagram of a communication device 600 provided by the present application.
  • the communication device 600 is used to realize the function of bit interleaved polarization coding modulation.
  • the communication device 600 includes:
  • the processing device 601 is configured to determine the respective polarization weights of the N polarization sub-channels of the polarization code with a code length of N according to the modulation polarization parameter set, and the modulation polarization parameter set includes one or more modulation polarization parameters,
  • the one or more modulation polarization parameters are used to determine a polarization weight generated by polarization coding under high-order modulation such that the N polarization sub-channels are polarized, N ⁇ 1 and an integer; and, Determine the order of reliability of the N polarized sub-channels according to the polarization weight of the N polarized sub-channels, and according to the order of the reliability of the N polarized sub-channels, perform polarization coding on the bit sequence to be encoded to obtain a code Word sequence; and, the code word sequence is subjected to high-order modulation to obtain a modulation symbol sequence.
  • the communication device 600 may further include an output interface 602 for outputting the modulation symbol sequence.
  • the output interface may be an output circuit or a transceiver.
  • the transceiver may be connected to the antenna.
  • the communication device 600 may be a network device that communicates with a terminal device, or may be a terminal device.
  • the processing device 601 may be a processor, chip, or integrated circuit.
  • the present application also provides a processing device 601 for implementing the method 200 of polarization coding modulation of the foregoing method embodiment. Part or all of the process in the method 200 may be implemented by hardware.
  • the processing device 601 is a processor.
  • the processing device 601 may also be as shown in FIG. 13.
  • FIG. 13 is a schematic diagram of the internal structure of the processing device 601.
  • the processing device 601 includes:
  • Input interface circuit 6011 used to obtain the bit sequence to be encoded
  • the logic circuit 6012 determines the respective polarization weights of the N polarization sub-channels of the polarization code with a code length of N according to the modulation polarization parameter set.
  • the modulation polarization parameter set includes one or more modulation polarization parameters.
  • One or more modulation polarization parameters are used to determine the polarization weight generated by polarization coding under high-order modulation so that the N polarization sub-channels are polarized, N ⁇ 1 and an integer; according to each polarization
  • the polarization weight of the sub-channel determines the order of the reliability of the N polarized sub-channels, and according to the order of the reliability of the N polarized sub-channels, the bit sequence to be encoded is polar-coded to obtain a codeword sequence; and, Perform high-order modulation on the codeword sequence to obtain a modulation symbol sequence;
  • the output interface circuit 6013 is used to output a modulation symbol sequence.
  • the processing device 601 may include a processor and a memory.
  • the memory is used to store a computer program, and the processor is used to execute the computer program stored in the memory to perform the polarization coding modulation method in the method embodiment of the present application.
  • the memory may be a physically independent unit.
  • the memory may also be integrated with the processor, which is not limited in this application.
  • the processing device 601 may only include a processor, and the memory storing the computer program is located outside the processing device.
  • the processor is connected to the memory through a circuit/wire to read and execute the computer program stored in the memory to perform any method embodiment.
  • the method 200 of polarization coding modulation provided by the present application is executed by the sending end.
  • the base station when the base station transmits a signal, the base station is the transmitting end.
  • MS1 or MS2 sends a signal, MS1 or MS2 is the sending end. Therefore, the present application also provides a network device and a terminal device.
  • the network device and the terminal device have the function of implementing the above-mentioned polarization coding modulation method.
  • FIG. 14 is a schematic structural diagram of a network device 3000 provided by the present application.
  • the network device 3000 may be applied to the wireless communication system shown in FIG. 1 described above, and has a function of performing the polarization coding modulation method provided by the present application.
  • the network device 3000 may be, for example, the base station shown in FIG.
  • the network device 3000 may include one or more radio frequency units, such as a remote radio unit (RRU) 3100 and one or more baseband units (BBU).
  • the baseband unit may also be called a digital unit (DU) 3200.
  • the RRU 3100 may be referred to as a transceiver unit, which corresponds to the transceiver unit 520 in FIG. 11.
  • the transceiver unit 3100 may also be called a transceiver, a transceiver circuit, or a transceiver, etc., which may include at least one antenna 3101 and a radio frequency unit 3102.
  • the transceiving unit 3100 may include a receiving unit and a transmitting unit.
  • the receiving unit may correspond to a receiver (or receiver, receiving circuit), and the transmitting unit may correspond to a transmitter (or transmitter, transmitting circuit).
  • RRU 3100 is mainly used for the transmission and reception of radio frequency signals and the conversion of radio frequency signals and baseband signals.
  • the BBU 3200 part is mainly used for baseband processing and control of base stations.
  • RRU 3100 and BBU 3200 can be physically installed together, or can be physically separated, namely distributed base stations.
  • the BBU 3200 is the control center of the network device 3000, and may also be called a processing unit, for example, corresponding to the processing unit 510 in FIG. 11, mainly used to complete baseband processing functions, for example, determining the reliability of polarization sub-channels and polarization coding , Rate matching (optional step), bit interleaving (optional step), modulation, etc.
  • the BBU 3200 may be composed of one or more boards, and multiple boards may jointly support a wireless access network of a single access standard (for example, an LTE network), and may also support wireless access of different access standards.
  • Access network for example, LTE network, 5G network or other network.
  • BBU 3200 also includes memory 3201 and processor 3202.
  • the memory 3201 is used to store necessary instructions and data.
  • the processor 3202 is used to control the network device 3000 to perform necessary actions, for example, to control the network device 3000 to execute the foregoing method embodiment.
  • the memory 3201 and the processor 3202 may serve one or more single boards. In other words, the memory and processor can be set separately on each board. It is also possible that multiple boards share the same memory and processor. In addition, each board can also be equipped with necessary circuits.
  • the network device 3000 shown in FIG. 14 can implement the polarization coding modulation method.
  • the operations and/or functions of each unit in the network device 3000 are for implementing the polarization coding modulation method 200 or the corresponding flow in each embodiment. To avoid repetition, detailed description is omitted here as appropriate.
  • the BBU 3200 can be used to perform the actions described in the previous method embodiments implemented internally by the sender, for example, calculating the polarization weight of the polarization sub-channel according to the modulation polarization parameter set, and then determining the reliability of the N polarization sub-channels Sort.
  • the bit sequence to be encoded is subjected to polarization encoding, modulation, and the like.
  • the RRU 3100 can be used to perform the sending or receiving actions performed by the sending end described in the foregoing method embodiments. For example, a sequence of modulation symbols is sent.
  • MS1 or MS2 When performing uplink transmission in the wireless communication system shown in FIG. 1, MS1 or MS2 is the sending end.
  • the terminal device provided by the present application will be described below.
  • FIG. 15 is a schematic structural diagram of a terminal device 7000 provided by this application.
  • the terminal device 7000 includes a processor 7001.
  • the terminal device 7000 further includes a memory 7003 and a transceiver 7002.
  • the processor 7001, the transceiver 7002 and the memory 7003 can communicate with each other through an internal connection channel to transfer control and/or data signals.
  • the memory 7003 is used to store a computer program
  • the processor 7001 is used to call and run the computer program from the memory 7003 to control the transceiver 7002 to send and receive signals.
  • the terminal device 7000 may further include an antenna 7004 for sending information or data output by the transceiver 7002 through a wireless signal.
  • the processor 7001 and the memory 7003 may be combined into one processing device.
  • the processor 7001 is configured to execute the program code stored in the memory 7003 to implement the above functions.
  • the memory 7003 may also be integrated in the processor 7001 or independent of the processor 7001.
  • the processor 7001 may be used to perform the actions internally implemented by the sending end described in the foregoing method embodiments, for example, calculating the polarization weight of the polarization sub-channel, determining the order of reliability of the polarization sub-channel, polarization coding, and modulation Wait.
  • the transceiver 7002 may be used to perform the receiving or sending actions performed by the sending end described in the foregoing method embodiments, for example, sending a modulation symbol sequence.
  • the transceiver 7002 may also be an output interface or an input interface, integrated on the processor 7001.
  • the terminal device 7000 may further include a power supply 7005 for providing power to various devices or circuits in the terminal device.
  • the terminal device 7000 may further include one or more of an input unit 7006, a display unit 7007, an audio circuit 7008, a camera 7009, a sensor 610, and the like.
  • the audio circuit may further include a speaker 70082, a microphone 70084, and the like.
  • the terminal device 7000 may be MS1 or MS2 in the wireless communication system shown in FIG. 1.
  • the present application provides a computer-readable storage medium that stores computer instructions, and when the computer instructions run on a computer, the computer is caused to perform the method 200 of polarization encoding modulation of the embodiment of the present application Corresponding operations and/or processes.
  • the present application also provides a computer program product, the computer program product includes computer program code, and when the computer program code runs on a computer, the computer is caused to perform the corresponding operation of the method 200 of polarization encoding modulation of the embodiment of the present application and/or Or process.
  • the present application also provides a chip including one or more processors.
  • the one or more processors are used to read and execute the computer program stored in the memory to perform the corresponding operations and/or procedures of the method 200 of polarization coding modulation provided by the present application.
  • the chip further includes one or more memories, and the one or more memories and the one or more processors are connected to the memories through circuits or wires.
  • the chip further includes a communication interface, and the one or more processors are connected to the communication interface.
  • the communication interface may include an input interface and an output interface.
  • the input interface is used to receive the bit sequence to be encoded, and the processor obtains the bit sequence to be encoded from the input interface, and uses the method 200 of polarization encoding modulation of the embodiment of the present application to perform the bit sequence to be encoded Polarization coding and modulation; the output interface is also used to output the modulation symbol sequence after polarization coding modulation.
  • the communication interface may be an interface circuit.
  • the input interface may be an input interface circuit
  • the output interface may be an output interface circuit.
  • the chip described in the embodiments of the present application may be a field-programmable gate array (field-programmable gate array, FPGA), a dedicated integrated chip (application specific integrated circuit, ASIC), a system chip (system on chip, SoC), or a central
  • the processor central processor
  • CPU central processor
  • NP network processor
  • DSP digital signal processing circuit
  • microcontroller micro controller
  • MCU microcontroller
  • PLD programmable logic device
  • the processor in the embodiment of the present application may be an integrated circuit chip, which has a signal processing capability.
  • each step of the foregoing method embodiment may be completed by an integrated logic circuit of hardware in a processor or instructions in the form of software.
  • the processor may be a general-purpose processor, DSP, ASIC, FPGA, or other programmable logic device, discrete gate or transistor logic device, or discrete hardware component.
  • the general-purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
  • the steps of the method disclosed in the embodiments of the present application may be directly embodied and completed by a hardware encoding processor, or may be performed and completed by using a combination of hardware and software modules in the encoding processor.
  • the software module may be located in a mature storage medium in the art, such as random access memory, flash memory, read-only memory, programmable read-only memory, or electrically erasable programmable memory, and registers.
  • the storage medium is located in the memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware.
  • the memory in the embodiments of the present application may be volatile memory or non-volatile memory, or may include both volatile and non-volatile memory.
  • the non-volatile memory can be read-only memory (read-only memory, ROM), programmable read-only memory (programmable ROM, PROM), erasable programmable read-only memory (erasable PROM, EPROM), electronically Erase programmable EPROM (EEPROM) or flash memory.
  • the volatile memory may be a random access memory (random access memory, RAM), which is used as an external cache.
  • RAM random access memory
  • SRAM static random access memory
  • DRAM dynamic random access memory
  • synchronous RAM synchronous dynamic random access memory
  • SDRAM double data rate synchronous dynamic random access memory
  • double SDRAM double SDRAM
  • DDR SDRAM enhanced synchronous dynamic random access memory
  • ESDRAM synchronous connection dynamic random access memory
  • direct RAMbus RAM direct RAMbus RAM
  • the above functions are implemented in the form of software and sold or used as an independent product, they can be stored in a computer-readable storage medium.
  • the technical solution of the present application essentially or part of the contribution to the existing technology or part of the technical solution can be embodied in the form of a software product, the computer software product is stored in a storage medium,
  • Several instructions are included to enable a computer device (which may be a personal computer, server, or network device, etc.) to perform all or part of the steps of the methods described in the embodiments of the present application.
  • the foregoing storage media include various media that can store program codes, such as a U disk, a mobile hard disk, a ROM, a RAM, a magnetic disk, or an optical disk.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Optical Communication System (AREA)
  • Error Detection And Correction (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

本申请提供了一种极化编码调制的方法，能够降低构造极化码的复杂度。该方法包括：根据调制极化参数集合，确定码长为N的极化码的N个极化子信道各自的极化重量，调制极化参数集合中包括一个或多个调制极化参数，该一个或多个调制极化参数用于确定在高阶调制下进行极化编码使得该N个极化子信道发生极化而产生的极化重量，N≥1且为整数；根据N个极化子信道的极化重量确定N个极化子信道的可靠度的排序，并根据可靠度的排序对待编码的比特序列进行极化编码，得到码字序列；对码字序列进行高阶调制，得到调制符号序列；发送调制符号序列。

Description

极化编码调制的方法和装置
本申请要求于2018年12月27日提交国家知识产权局、申请号为201811613411.2、申请名称为“极化编码调制的方法和装置”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及信道编码领域，更具体地，涉及一种极化编码调制的方法和装置。
背景技术
极化码(polar codes)是一种理论上被严格证明可以达到信道容量的结构化的信道编码方法，近年来已经得到了长足的发展。在实际的通信系统中，为了提高频谱利用率，通常会采用高阶调制。因此，极化码与高阶调制的结合也得到越来越多的关注，以期达到编码调制的联合优化。目前，极化编码调制主要是采用比特交织极化编码调制(bit interleaver polar coded modulation,BIPCM)框架。在BIPCM框架中，发送端通过在编码器和调制器之间加入了比特级的交织器来消除比特之间的相关性。接收端对接收到的信号进行并行解调，得到发送端传输的比特序列的软信息，之后进行极化译码。
在BIPCM框架中，M进制调制的输入信道可以分解为m个并行的调制子信道，M≥1，m≥1，且M和m均为整数。根据信道容量等效准则，可以得到与该m个调制子信道的容量相等的二进制加性白高斯噪声(additive white Gaussian noise,AWGN)的噪声方差。最后，采用高斯近似迭代计算各个极化子信道的可靠度，并进行极化码构造。
但是，高斯近似迭代计算的复杂度非常高，在实际的通信系统中实用化困难。
发明内容
本申请提供一种极化编码调制的方法和装置，能够降低计算极化子信道可靠度的复杂度。
第一方面，本申请提供一种极化编码调制的方法，该方法包括：根据调制极化参数集合确定码长为N的极化码的N个极化子信道各自的极化重量，调制极化参数集合中包括一个或多个调制极化参数，所述一个或多个调制极化参数用于确定在高阶调制下进行极化编码使得所述N个极化子信道发生极化而产生的极化重量，N≥1且为整数；根据N个极化子信道的极化重量，确定N个极化子信道的可靠度的排序，并根据N个极化子信道的可靠度的排序，对待编码的比特序列进行极化编码，得到码字序列；对码字序列进行高阶调制，得到调制符号序列；发送调制符号序列。
本申请提供的技术方案，发送端不采用高斯近似迭代计算也可以确定极化子信道的极化重量，进而确定极化子信道的可靠度的排序，在高阶调制场景下进行极化编码。由于避免了复杂而繁琐的高斯近似迭代计算，因而可以降低计算极化子信道的可靠度的复杂度。
结合第一方面，在第一方面的某些实现方式中，根据调制极化参数集合确定码长为N的极化码的N个极化子信道各自的极化重量，包括：将极化子信道的序号i表示为二进制i＝(i 1,i 2,…,i n)，0≤i≤N-1,i为整数；根据调制极化参数集合和序号i的二进制表示i＝(i 1,i 2,…,i n)，确定序号i对应的极化子信道的极化重量，其中，序号i对应的极化子信道的极化重量包括第一部分极化重量和第二部分极化重量，第一部分极化重量是根据调制极化参数集合和序号i的二进制表示的
Figure PCTCN2019128804-appb-000001
部分确定的，第二部分极化重量是根据序号i的二进制表示的
Figure PCTCN2019128804-appb-000002
部分确定的，其中，m是根据调制阶数确定的，n为序号i的二进制表示的比特个数。
换句话说，第一部分极化重量是在高阶调制下进行极化编码使得子信道发生极化而产生的极化重量。第二部分极化重量仅是极化编码使得子信道发生极化而产生的极化重量。
结合第一方面，在第一方面的某些实现方式中，根据所述调制参数集合和序号i的二进制表示，确定序号i对应的极化子信道的极化重量，包括：根据如下公式确定序号i对应的极化子信道的极化重量：
Figure PCTCN2019128804-appb-000003
其中，
Figure PCTCN2019128804-appb-000004
用于确定第一部分极化重量，
Figure PCTCN2019128804-appb-000005
用于确定第二部分极化重量，
Figure PCTCN2019128804-appb-000006
为调制极化参数集合，β＝0.25，a i为序号i的二进制表示的第i个比特的取值，a i∈{0,1}。
结合第一方面，在第一方面的某些实现方式中，根据公式确定序号i对应的极化子信道的可靠度之前，该方法还包括：遍历调制极化参数集合
Figure PCTCN2019128804-appb-000007
的取值，选择使得错误率上界最小的一组取值，错误率上界是N个极化子信道的错误概率之和；根据调制极化参数集合确定码长为N的极化码的N个极化子信道的极化重量，包括：根据使得错误率上界最小的调制极化参数集合的一组取值，确定N个极化子信道的极化重量。
第二方面，本申请提供一种极化编码调制的装置，该装置具有实现上述第一方面及其任意可能的实现方式中的方法的功能。所述功能可以通过硬件实现，也可以通过硬件执行相应的软件实现。所述硬件或软件包括一个或多个与上述功能相对应的单元。
在一种可能的设计中，当所述功能的部分或全部通过硬件实现时，该装置包括：输入接口电路，用于获取待编码的比特序列；逻辑电路，用于；输出接口电路，用于输出。
在具体实现时，该装置可以是芯片或者集成电路。
在一种可能的设计中，当所述功能的部分或全部通过软件实现时，该装置包括：存储器，用于存储计算机程序；处理器，用于执行存储器中存储的计算机程序，当所述计算机程序被执行时，该装置可以实现如上述第一方面或第一方面的任一种可能的设计中所述的极化编码调制的方法。
可选的，存储器可以是物理上独立的单元，也可以与处理器集成在一起。
在一种可能的设计中，当所述功能的部分或全部通过软件实现时，该装置包括仅包括处理器。其中，用于存储计算机程序的存储器位于装置之外，处理器通过电路/电线与存储器连接，用于读取并运行存储器中存储的计算机程序，以执行上述第一方面或第一方面的任意可能的实现方式中的极化编码调制的方法。
第三方面，本申请提供一种网络设备，包括处理器和存储器。存储器用于存储计算机程序，处理器用于调用并运行存储器中存储的计算机程序，使得网络设备执行第一方面或第一方面任意可能的实现方式中的方法。
应理解，在下行传输中，网络设备作为信息和/或数据的发射端，执行上述第一方面或第一方面的任意可能的实现方式中的极化编码调制的方法。
第四方面，本申请提供一种终端设备，包括处理器和存储器。存储器用于存储计算机程序，处理器用于调用并运行存储器中存储的计算机程序，使得终端设备执行上述第一方面或第一方面任意可能的实现方式中的方法。
在上行传输中，终端设备作为信息和/或数据的发射端，执行上述第一方面或第一方面的任意可能的实现方式中的极化编码调制的方法。
第五方面，本申请提供一种计算机可读存储介质，该计算机可读存储介质中存储有计算机指令，当所述计算机指令在计算机上运行时，使得计算机执行第一方面或第一方面的任意可能的实现方式中的方法。
第六方面，本申请提供一种计算机程序产品，所述计算机程序产品包括计算机程序代码，当所述计算机程序代码在计算机上运行时，使得计算机执行上述第一方面及其任意一种可能的实现方式中的方法。
第七方面，本申请提供一种芯片，包括处理器。处理器用于读取并执行存储器中存储的计算机程序，以执行上述第一方面或第一方面任意可能的实现方式中的方法。
可选地，所述芯片还包括存储器，存储器与处理器通过电路或电线与存储器连接。
进一步可选地，所述芯片还包括通信接口，处理器与通信接口连接。通信接口用于接收待编码的比特序列，处理器从通信接口获取待编码的比特序列，并采用第一方面描述的极化编码调制的方法，对待编码的比特序列进行极化编码和调制，得到调制符号序列；通信接口还用于输出调制符号序列。具体地，通信接口可以包括输入接口和输出接口。
第八方面，本申请提供一种通信装置，包括处理器和接口电路，所述接口电路用于接收计算机代码或指令，并传输至所述处理器，所述处理器用于运行所述计算机代码或指令，以执行第一方面或其任意可能的实现方式中的方法。
本申请提供的技术方案，发送端不采用高斯近似迭代计算也可以计算极化子信道的极化重量，进而确定极化子信道的可靠度的排序，进行极化编码。由于避免了复杂而繁琐的高斯近似迭代计算，因而可以降低计算极化子信道的可靠度的复杂度。
附图说明
图1是适用于本申请的无线通信系统的架构图。
图2是无线通信的基本流程图。
图3是BIPCM框架的示意图。
图4的(a)和(b)分别示出了一级极化和多级极化过程的示意图。
图5是本申请提供的极化编码调制的方法的流程图。
图6是BIPCM框架下发送端的处理流程的等效流程。
图7是码长N＝8，调制阶数m＝2的极化码的示例。
图8是16QAM的调制场景下根据错误率上界的曲线确定α的取值。
图9是本申请的提供的方法与高斯近似算法在码长N＝1024的各信噪比条件下的性能对比图。
图10是本申请的提供的方法与高斯近似算法在码长N＝512的各信噪比条件下的性能对比图。
图11是本申请提供的比特交织极化编码调制的装置500的示意性框图。
图12为本申请提供的通信设备600的示意性结构图。
图13为处理装置601的内部结构示意图。
图14是本申请提供的网络设备3000的示意性结构图。
图15是本申请提供的终端设备7000的示意性结构图。
具体实施方式
下面将结合附图，对本申请中的技术方案进行描述。
本申请的技术方案可以应用于无线通信系统，包括但不限于：窄带物联网系统(narrow band-Internet of things，NB-IoT)、全球移动通信系统(global system for mobile communications,GSM)、增强型数据速率GSM演进系统(enhanced data rate for GSM evolution,EDGE)、宽带码分多址系统(wideband code division multiple access,WCDMA)、码分多址2000系统(code division multiple access,CDMA2000)、时分同步码分多址系统(time division-synchronization code division multiple access,TD-SCDMA)，长期演进系统(long term evolution,LTE)以及下一代5G移动通信系统的三大应用场景,即增强移动带宽(enhance mobile broadband，eMBB)，高可靠性低延迟通信(ultra reliable low latency communication，URLLC)和增强海量机器连接通信(massive machine type communication，eMTC)。
参见图1，图1是适用于本申请的无线通信系统的架构图。如图1所示，无线通信系统通常由小区组成，每个小区包含一个基站(base station,BS)，基站向多个移动台(mobile station,MS)提供通信服务。例如，图1中所示的MS1和MS2。基站连接到核心网设备。
基站是一种部署在无线接入网中为MS提供无线通信功能的装置。基站可以包括各种形式的宏基站，微基站(也称为小站)，中继站，接入点等。在采用不同的无线接入技术的系统中，具备基站功能的设备的名称可能会有所不同。例如，在LTE系统中，基站称为演进的节点B(evolved NodeB，eNB或者eNodeB),在第三代(3rd Generation,3G)系统中，基站称为节点B(Node B)等。为方便描述，基站可以包含基带单元(baseband unit,BBU)和远端射频单元(remote radio unit,RRU)。BBU和RRU可以放置在不同的地方。例如：RRU拉远，放置于高话务量的区域，BBU放置于中心机房。BBU和RRU也可以放置在同一机房。BBU和RRU也可以为一个机架下的不同部件。本申请所有实施例中，上述为MS提供无线通信功能的装置统称为网络设备或基站或BS。
本申请中涉及到的MS可以包括各种具有无线通信功能的手持设备、车载设备、可穿戴设备、计算设备或连接到无线调制解调器的其它处理设备。所述MS也可以称为终端(terminal)，用户单元(subscriber unit)、蜂窝电话(cellular phone)、智能手机(smart phone)、无线数据卡、个人数字助理(personal digital assistant,PDA)电脑、平板型电脑、无线调制解调器(modem)、手持设备(handset)、膝上型电脑(laptop computer)、机 器类型通信(machine type communication,MTC)终端等。
参见图2，图2是无线通信的基本流程图。在发射端，信源依次经过信源编码、信道编码和调制映射后发送。在接收端，依次经过解调制映射、信道译码和信源译码输出信宿。其中，信道编码和信道译码可以采用极化码(也称polar码)。
polar码是一种可达二进制输入离散无记忆信道容量的可构造性信道编码方式。通过采用信道合并和分割操作，所得子信道均为无噪或者全噪信道。基于子信道的极化现象，无噪信道可以用来传输信息比特，全噪信道用来传输接收端已知的冻结比特。Polar码是一种线性分组码，其编码矩阵(也称为生成矩阵)为G N，编码过程可以由下式(1)表示：
Figure PCTCN2019128804-appb-000008
其中，
Figure PCTCN2019128804-appb-000009
是一个二进制的行矢量(也即，待编码的比特序列)，长度为N，且N＝2 n，n为正整数。G N是一个N×N的矩阵，
Figure PCTCN2019128804-appb-000010
定义为log2 N个矩阵F 2的克罗内克(Kronecker)乘积，
Figure PCTCN2019128804-appb-000011
以上各式中涉及的加法、乘法操作均为二进制伽罗华域上的加法、乘法操作。
在实际的通信系统中，为了提高频谱利用率，通常会采用高阶调制。极化码与高阶调制的结合目前主要采用比特交织极化编码调制(bit interleaver polar coded modulation,BIPCM)框架。
为了便于理解，下面对BIPCM框架作简单介绍。
参见图3，图3是BIPCM框架的示意图。在图3中，极化码的码长为N，信息位的长度为K，码率为R＝K/N，调制阶数为m，m≥1且为整数。
下面对BIPCM框架下，发送端和接收端的处理流程分别进行说明。
(1)发送端。
对待编码的比特序列u 1:N进行极化编码，得到码字序列b 1:N，即b 1:N＝u 1:N·G N。
将码字序列b 1:N分割为m个长度均为
Figure PCTCN2019128804-appb-000012
的比特流，如图3中所示的
Figure PCTCN2019128804-appb-000013
m，m≥2且为整数。
将每个比特流分别输入交织器进行随机交织。每个交织器输出交织后的比特序列。其中，将第i个交织器输出的比特序列记作
Figure PCTCN2019128804-appb-000014
上述m个交织后的比特序列中序号为j的比特组成二进制比特序列
Figure PCTCN2019128804-appb-000015
其中，j＝1,2,…,N/m。
对比特序列c 1:m进行调制，得到调制符号序列
Figure PCTCN2019128804-appb-000016
调制符号序列
Figure PCTCN2019128804-appb-000017
中的元素x∈χ。
最后，发送端将调制符号序列
Figure PCTCN2019128804-appb-000018
输入M进制AWGN信道中进行传输，M≥1且为整数。
接收端接收到的信号如公式(2)所示。
y j＝x j+n j       (2)
式(2)中，n j为独立同分布高斯噪声，均值为0，方差为
Figure PCTCN2019128804-appb-000019
传输符号的平均功率为E S＝E[||x j|| 2]，平均接收比特信噪比
Figure PCTCN2019128804-appb-000020
其中，E b为比特平均功率，R为极化编码的码率。
(2)接收端。
将接收到的调制符号序列
Figure PCTCN2019128804-appb-000021
输入解调器进行并行解调，计算出发送端传输的比特序列的软信息。再将该软信息经过解交织和并串变换之后送到译码器进行译码。
接收端的详细操作如下描述。
①将2 m进制的输入信道
Figure PCTCN2019128804-appb-000022
分解为m个二进制信道{α 1,α 2,...,α m}，也即上文所述的m个并行调制子信道。第i个比特所对应的信道α i可以表示为α i:{0,1}→y。根据映射方式，信道α i的信道转移概率可以由式(3)得到：
Figure PCTCN2019128804-appb-000023
式(3)中，
Figure PCTCN2019128804-appb-000024
为对应比特序列的第i个比特等于c的星座点集合。
应理解，接收端接收到的调制符号序列经过并行解调，计算得到的发送端传输的比特序列的软信息具体为N个对数似然比。
②通过解交织和并串变换，N个对数似然比被送入到译码器进行连续删除(successive cancellation,SC)译码或者循环冗余校验辅助序列连续删除(cyclic redundancy check aided CRC aided successive cancellation list,CA-SCL)译码，得到发送端发送的比特序列的估计序列
Figure PCTCN2019128804-appb-000025
完成译码。
以上是BIPCM框架下发送端和接收端的处理流程。
但是，发送端在进行极化编码之前，首先需要通过高斯近似迭代计算确定极化子信道的可靠度，才能进行极化码的构造。而高斯近似迭代计算的复杂度非常高，实用化非常困难。
为此，本申请提出一种极化编码调制的方法，可以不使用高斯近似迭代计算来确定极化子信道的可靠度。仿真结果表明，根据本申请提供的方法确定的极化子信道的可靠度构造的极化码，译码性能与采用高斯近似迭代计算构造的极化码的译码性能基本持平。但是，根据本申请提供的方法确定极化子信道的可靠度，计算复杂度降低，易于实用。
另外，现有的BIPCM框架下，极化子信道的可靠度的计算依赖于信噪比。因此，在不同的信噪比条件下，极化子信道的可靠度的计算不具有通用性。而本申请提供的技术方案在确定极化子信道的可靠度时不再依赖于信噪比。因此，极化子信道的可靠度的计算在不同的信噪比条件下是通用的。换句话说，本申请提供了一种基于BIPCM框架的通用构造极化码的方案。
下面对本申请提出的极化编码调制的方法进行说明。
本申请的发明人根据极化过程发现，如果将polar码看作广义的级联码，然后根据级联码的内码和外码的极化子信道的可靠度关系，可以确定出polar码的极化子信道的可靠 度的排序。
参见图4，图4的(a)和(b)分别示出了一级极化和多级极化过程的示意图。如图4的(a)所示，对于一个一级的极化核，假设极化核右端的两个输入信道的容量相等(如图4的(a)所示，均为W)，则经过一级极化，左端极化子信道的容量为W-和W+，其中，W-对应的极化子信道的可靠度小于W+对应的极化子信道的可靠度。而实际上，无论右端的两个输入信道的可靠度的大小关系如何，经过一级极化之后，W-对应的极化子信道的可靠度始终小于W+对应的极化子信道的可靠度。如图4的(b)所示，对于一个多级极化过程，最右端的输入信道的容量相同，均为W。这是由于对于普通的极化编码而言，其所有的输入信道的容量都是相等的。而图4的(b)的最右端实际上就是级联码的外码编码器的输入信道，在将polar码看作广义级联码的情况下，外码编码器的输入即是极化码的输入。因此，这个外码编码器内部的极化子信道的可靠度的排序可以根据图4的(a)中所述的容量的极化规律确定出来。
但是，对于两个外码编码器之间的极化子信道的可靠度的排序是不得而知的。这是因为极化码中引入高阶调制之后，导致内码编码器的输入子信道的容量不等。
由此，本申请提出引入调制极化参数，和传统的用于确定极化子信道的可靠度的极化重量(polarization weight,PW)公式结合，可以确定N个极化子信道的可靠度的大小关系，进而再根据极化子信道的可靠度的大小关系来构造极化码。
下面对本申请的极化编码调制的方法200进行说明。
参见图5，图5是本申请提供的极化编码调制的方法200的流程图。方法200可以由发送端执行。例如，在图1所示的通信系统中，在上行传输中，由终端设备执行。在下行传输中，由网络设备(例如，基站)执行。
根据本申请提供的极化编码调制的方法200，在BIPCM框架不变的前提下，将polar码看作为广义的级联码。由于在BIPCM框架中，比特级的交织器并不会影响极化子信道的可靠度的分布，由此，图3中所示的BIPCM框架中发送端的处理流程可以等效为图6所示。
参见图6，图6是BIPCM框架下发送端的处理流程的等效流程。如图6所示，将码长为N的极化码看作级联码，则级联码的内码为N 0个码长为N t的极化码，外码为N t个码长为N 0的极化码。其中，N 0·N t＝N，N 0和N t均为正整数。N t＝m，N 0＝N/m。其中，m为高阶调制的调制阶数。
应理解，在图6中，G N/m对应外码编码器，G m对应内码编码器。
下面对方法200进行说明。方法200可以包括步骤210-240。
210、根据调制极化参数集合确定码长为N的极化码的N个极化子信道各自的极化重量，N≥1且为整数。
在传统的构造极化码的方案中，极化子信道的可靠度是根据PW公式来计算的。PW公式如下式(4)所示。
Figure PCTCN2019128804-appb-000026
在式(4)中，n为极化子信道的序号展开为二进制表示的比特位数，a i是极化信子信道的序号的二进制表示中的第i个比特。例如，以极化子信道的序号等于2为例，序号2 展开为二进制表示可以为2(010)，则n＝3，a 1＝0，a 2＝1，a 3＝0。
另外，式(4)中的β＝0.25。
应理解，PW公式用来计算极化子信道的极化重量，极化重量可以用来表征极化子信道的可靠度。通常，一个极化子信道的极化重量越大，表明该极化子信道的可靠度越高。
而在本申请的技术方案中，考虑到高阶调制的因素，极化重量包括第一部分极化重量和第二部分极化重量。其中，第一部分极化重量是根据调制极化参数集合确定的，第二部分极化重量可以继续采用PW公式来确定。换句话说，本申请中的极化重量，在传统的用来计算极化重量的PW公式的基础上，引入了调制极化部分。因此，调制极化参数用于确定在高阶调制的场景下进行极化编码使得码长为N的polar码的N个极化子信道发生极化而产生的极化重量。也即，第一部分极化重量是在高阶调制下进行极化编码使得子信道发生极化而产生的极化重量。第二部分极化重量仅是极化编码使得子信道发生极化而产生的极化重量。
发送端根据调制极化参数集合确定N个极化子信道各自的极化重量，具体可以包括如下过程：
将极化子信道的序号i表示为二进制i＝(i 1,i 2,…,i n)，0≤i≤N-1；
根据调制极化参数集合和序号i的二进制表示i＝(i 1,i 2,…,i n)，确定序号i对应的极化子信道的极化重量，其中，序号i对应的极化子信道的极化重量包括第一部分极化重量和第二部分极化重量，第一部分极化重量是根据调制极化参数集合和序号i的二进制表示的
Figure PCTCN2019128804-appb-000027
部分确定的，第二部分极化重量是根据序号i的二进制表示的
Figure PCTCN2019128804-appb-000028
部分确定的，m是根据调制阶数确定的，n为极化子信道的序号i的二进制表示的比特个数。
这里，在一些情况下，m可以与调制阶数相等。例如，对于4PAM调制，m等于调制阶数2。而在一些情况下，m是根据调制映射的星座图的星座点之间实际包括多少个容量不等的比特而确定的。例如，对于16QAM的格雷映射，由于星座图上一个象限内的星座点实际上只有2个容量不等的比特，因此，m＝2。
需要说明的是，序号i对应的极化子信道是指N个极化子信道中的任意一个。极化子信道的序号i也可以称为极化子信道的索引i。
因此，在本申请中，对于每个极化子信道来说，其可靠度是根据极化重量衡量的，而极化重量的计算包括两部分。第一部分极化重量是根据调制极化参数集合确定的，第二部分极化重量是根据传统的PW公式确定的。由此，也可以说，本申请对现有的PW公式进行了改写，在PW公式中引入了调制极化部分，用于计算在高阶调制场景下进行编码使得子信道发生极化而产生的极化重量。改写后的PW公式可以称为扩展极化重量(extended polarization weight,EPW)公式。EPW公式可以如下公式(5)所示。
Figure PCTCN2019128804-appb-000029
从公式(5)可以看到，极化子信道的序号i展开为二进制表示i＝(i 1,i 2,…,i n)，其中，调制极化参数集合
Figure PCTCN2019128804-appb-000030
用于确定第一部分极化重量，PW公式用于确定第二部分极化重量。其中，第一部分极化重量是在高阶调制场景下进行编码使得子信道发生极化 而产生的极化重量，第二部分极化重量是编码使得子信道发生极化而产生的极化重量。
具体地，第一部分极化重量是根据调制极化参数集合中的调制极化参数和序号i的二进制表示第1个比特至第log 2m个比特确定的。第二部分极化重量是根据PW公式和序号i的二进制表示的第log 2m+1个比特至第n个比特确定的。
这里，log 2m+1表示(log 2m)+1。
对于极化子信道的序号i和j，i和j的二进制展开分别为i＝(i 1,i 2,…,i n)，j＝(j 1,j 2,…,j n)。
(1)如果
Figure PCTCN2019128804-appb-000031
表明序号i和序号j属于同一个外码编码器。如果
Figure PCTCN2019128804-appb-000032
根据公式(5)可知，第一部分极化重量
Figure PCTCN2019128804-appb-000033
相等。此时，序号i和序号j各自对应的极化子信道的可靠度的大小关系可以根据
Figure PCTCN2019128804-appb-000034
和
Figure PCTCN2019128804-appb-000035
来确定。也即，根据公式(5)的第二部分极化重量
Figure PCTCN2019128804-appb-000036
来确定。
例如，对于4PAM调制，假设N＝8，极化子信道的序号展开为3bit的二进制比特序列。或者说，3个比特就可以表示N＝8的polar码的全部极化子信道的序号。例如，极化子信道的序号2表示为二进制(0,1,0)，序号3表示为二进制(0,1,1)。采用4PAM调制时，m＝2。log 2m＝log 22＝1，而序号2和序号3的二进制展开的第1位相等(均为0)，因此，序号2和序号3属于同一个外码编码器，第一部分极化重量相等。此时，序号2和序号3各自对应的极化子信道的极化重量取决于第二部分极化重量。第二部分极化重量需要根据
Figure PCTCN2019128804-appb-000037
和
Figure PCTCN2019128804-appb-000038
来确定。具体地，是根据序号2和序号3的二进制展开的第2位和第3位来确定。对于序号2，第二部分极化重量＝a 2·2 β(3-2)+a 3·2 β(3-3)＝1·2 β(3-2)+0·2 β(3-3)＝2 0.25。对于序号3，第二部分极化重量＝a 2·2 β(3-2)+a 3·2 β(3-3)＝1·2 β(3-2)+1·2 β(3-3)＝2 0.25+1。因此，2(0,1,0)<3(0,1,1)，也即序号为2对应的极化子信道的极化重量小于序号3对应的极化子信道的极化重量。因此，序号2对应的极化子信道的可靠度小于序号3对应的极化子信道的可靠度。
又例如，对于4PAM调制，假设N＝32，则极化子信道的序号展开为5bit的二进制比特序列。例如，极化子信道的序号i＝6展开为二进制为(0,0,1,1,0)，序号j＝9展开为二进制为(0,1,1,0,0)。同样地，序号6和序号9的二进制展开的第1相同(均为0)，因此，序号6和序号9属于同一个外码编码器。此时，序号6和序号9各自对应的极化子信道的第一部分极化重量
Figure PCTCN2019128804-appb-000039
相等，因此其可靠度的大小关系取决于第二部分极化重量
Figure PCTCN2019128804-appb-000040
通过将序号i＝6和序号j＝9各自的二进制表示的a i和β＝0.25带入
Figure PCTCN2019128804-appb-000041
进行计算，可以确定6(0,0,1,1,0)<9(0,1,1,0,0)。因此，序号6对应的极 化子信道的可靠度小于序号9对应的极化子信道的可靠度。
(2)如果
Figure PCTCN2019128804-appb-000042
表明序号i和序号j不属于同一个外码编码器。此时，序号i和序号j各自对应的极化子信道的可靠度的大小关系依赖于内码G m(参见图4所示)输出的序号为
Figure PCTCN2019128804-appb-000043
和
Figure PCTCN2019128804-appb-000044
的极化子信道的可靠度的大小关系。
例如，对于16PAM，若0(0,0)<2(1,0)<3(1,1)，N＝16，则极化子信道的序号展开为4bit的二进制比特序列。例如，序号1展开为二进制(0,0,0,1)，序号9展开为二进制(1,0,0,1)。采用16PAM，则m＝4。由于序号1和序号9的二进制展开的第3位和第4为相同(均为0,1)，则序号1和序号9各自对应的极化子信道的可靠度的大小关系可以通过内码G m输出的(i 1,i 2)和(j 1,j 2)对应的极化子信道的可靠度的大小关系来确定。由于0(0,0)<2(1,0)，因此，1(0,0,0,1)<9(1,0,0,1)。
又例如，对于16PAM，极化子信道的序号3和序号15分别展开为二进制为3(0,0,1,1)和15(1,1,1,1)。序号3和序号15的二进制展开的第3位和第4位相同(均为11)，则序号3和序号15各自对应的极化子信道的可靠度的大小关系，可以通过内码G m输出的(i 1,i 2)和(j 1,j 2)对应的极化子信道的可靠度的大小关系来确定。由于0(0,0)<3(1,1)，因此，3(0,0,1,1)<15(1,1,1,1)。
下文图7的说明，可以用来帮助理解上述(1)和(2)对应的结论。
图7是码长N＝8，调制阶数m＝2的极化码的示例。将polar码看作级联码。则外码是2个长度为4的polar码，如图7中编号①和②所示的虚线框。内码是4个码长为2的polar码，如图7中所示编号③所示的虚线框部分。其中，对于一个外码编码器来说，由于其右端的输入信道的容量相等，相当于一个N＝4的polar码，因此这个外码编码器内部的子信道的可靠度排序可以通过PW公式计算确定。编号①所示的虚线框对应的外码编码器内部的极化子信道的排序为(000)<(001)<(010)<(011)。同理，编号②所示的虚线框对应的外码编码器内部的极化子信道的排序为(100)<(101)<(110)<(111)。由于每个外码编码器的极化子信道的序号的二进制展开的第1个比特(m＝2)是相同的，因此，每个外码编码器内部的极化子信道的可靠度排序是由二进制表示的后面2个比特决定的。
但是，由于引入高阶调制，导致内码编码器的输入信道的容量不等，因此两个外码编码器的极化子信道之间的可靠度的大小关系无法得知。
如果调制阶数m＝2，则一个4PAM符号中有两个容量不等的子信道，以下分别记作W1，W2。将这两个子信道分别分配到一个内码编码器的右端。对于编号③所示的内码编码器(图7中粗线示出)来说，节点1的子信道是W1，节点2的子信道是W2，经过一级极化，得到节点3的子信道为W3，节点4的子信道是W4。根据上文介绍的一级极化的规律，可以确定W3<W4。相同的，节点5、6、7、8也构成一个内码编码器，节点5的信道为W1，节点6的信道为W2，节点7的信道为W3，节点8的信道为W4。由此，图7所示共有4个内码编码器。由于这4个内码编码器右端相应位置的输入信道的容量相等，即节点1、节点5、节点9和节点13为W1，节点2、节点6、节点10和节点14为W2。因此这4个内码编码器是完全相同的，因此各自极化后的子信道的容量也是相等的。 也即，节点3、节点7、节点11、节点15为W3，节点4、节点8、节点12和节点16为W4。这与上文中分析外码编码器的输入信道的容量相等是一致的，也即外码编码器的输入信道的容量相等。
由于节点3的子信道的容量小于节点4的子信道的容量(W3<W4)，而000对应的子信道是由4个W3极化得到的第一个子信道，100对应的子信道是由4个W4极化得到的第一个子信道，它们在外码中的位置相同，这对应了上述分支(2)对应的部分排序。由于000和100各自对应的极化子信道分别是W3和W4经过相同的后续极化过程得到的两个子信道，因此000和001对应的极化子信道的可靠度由W3和W4的大小关系决定。由于W3<W4，因此(000)<(100)。同理可知(001)<(101)，(010)<(110)，(011)<(111)。
由此可以理解的是，传统的polar码的极化是指编码器右侧的输出信道容量相等时产生的极化现象。本申请中的极化是指在高阶调制场景下(也即编码器右侧输入信道容量不等)进行编码产生的极化现象。
以上步骤210是本申请提出的对极化子信道的可靠度进行排序的详细说明。可见，极化子信道的可靠度的排序不再依赖于信噪比，并且避免了复杂的高斯近似迭代计算。
可选地，在根据公式(5)计算极化子信道的可靠度之前，需要确定调制极化参数集合
Figure PCTCN2019128804-appb-000045
中的每个调制极化参数α i的取值，i∈{1,2,…,log 2m}。
首先，发送端通过高斯近似确定出各个极化子信道的错误概率，并根据给定的码率对每个调制极化参数α i从闭区间[0,1]中选择一个取值，从而确定调制极化参数集合
Figure PCTCN2019128804-appb-000046
的一组取值。进一步地，根据调制极化参数集合中每个调制极化参数α i的取值，计算每个极化子信道的极化重量，从而确定出N个极化子信道的可靠度的排序。根据N个极化子信道的可靠度的排序，选择信息比特集合。可以理解的是，选择出的每个信息位对应着一个极化子信道，而这个极化子信道的错误概率已通过高斯近似计算得到。所有信息位的错误概率求和，得到错误率上界。遍历调制极化参数集合
Figure PCTCN2019128804-appb-000047
的多组取值，寻找使得错误率上界最小的调制极化参数集合的一组取值。这样，调制极化参数集合中每个α i的取值也就确定了。
根据步骤210，可以确定出每个极化子信道的极化重量。
220、根据所述N个极化子信道的极化重量，确定所述N个极化子信道的可靠度的排序，并根据可靠度的排序对待编码的比特序列进行极化编码，得到码字序列。
确定了N个极化子信道的可靠度的排序，从而可以确定信息比特集合，即，用来放置信息比特的极化子信道的序号的集合。发送端对待编码的比特序列进行极化编码的过程可以参考现有技术，这里不再赘述。
可选地，在步骤220，根据极化子信道的可靠度对待编码的比特序列进行极化编码，得到码字之后，可以对不同内码编码器相同位置输出的比特流进行交织，以提高译码性能。或者，也可以不作比特交织处理。
230、对码字序列进行高阶调制，得到调制符号序列。
240、发送调制符号序列。
步骤230和步骤240参见上文图3中介绍的BIPCM框架下的发送端的处理流程，这里不再赘述。接收端接收到发送端发送的信号之后，根据图3中介绍的BIPCM框架中的接收端的处理流程进行译码。
本申请提供的EPW公式构造的极化码与采用高斯近似构造的极化码的性能差异不大，但是计算复杂度降低。
除此之外，根据高斯近似构造极化码依赖于信噪比，因此，在不同的信噪比条件下，需要重新计算来构造极化码。而本申请的方法不依赖于信噪比，因此对不同的信噪比条件都是通用的，可以简化计算。
下面给出采用本申请的极化编码调制的方法的性能仿真图。
参见图8，图8是16QAM的调制场景下根据错误率上界的曲线确定α的取值。由于16QAM格雷映射的实部和虚部可以看作相互独立的两个4PAM信号，因此16QAM格雷映射实际上只有2个容量不等的比特级。因此，可以将16QAM格雷映射的实部和虚部分开构造(即4PAM构造)，相当于m＝2，以简化构造，此时只需要优化一个参数即可。从图8中可以看出，当α＝0.25时性能最优。
使用相同的参数优化方法，在16PAM调制中得到的最优取值为{α 1,α 2}＝{0.25,0.35}。
参见图9和图10，图9是本申请的提供的方法与高斯近似算法在码长N＝1024的各信噪比条件下的性能对比图。图10是本申请的提供的方法与高斯近似算法在码长N＝512的各信噪比条件下的性能对比图。
从图9中可以看出，相对于使用5G中的构造序列，EPW度量构造有较大的性能增益。在图9和图10中，可以发现本申请提供的EPW度量构造在各码长各码率与高斯近似算法的仿真结果差异不大。但是，本申请提供的方法可以降低构造极化码时的计算复杂度。
以上，对本申请提供的极化编码调制的方法进行了详细说明。下面介绍本申请提供的极化编码调制的装置。
参见图11，图11是本申请提供的比特交织极化编码调制的装置500的示意性框图。如图11所示，装置500包括处理单元510和收发单元520。
处理单元510，用于根据调制极化参数集合确定码长为N的极化码的N个极化子信道各自的极化重量，调制极化参数集合中包括一个或多个调制极化参数，所述一个或多个调制极化参数用于确定在高阶调制下进行极化编码使得所述N个极化子信道发生极化而产生的极化重量，N≥1且为整数；根据该N个极化子信道各自的极化重量确定该N个极化子信道的可靠度的排序，并根据该N个极化子信道的可靠度的排序，对待编码的比特序列进行极化编码，得到码字序列；以及，用于对码字序列进行高阶调制，得到调制符号序列；
收发单元520，用于发送调制符号序列。
可选地，处理单元510具体用于：
将极化子信道的序号i表示为二进制i＝(i 1,i 2,…,i n)，0≤i≤N-1,i为整数；
根据调制极化参数集合和序号i的二进制表示i＝(i 1,i 2,…,i n)，确定序号i对应的极化子信道的极化重量，其中，序号i对应的极化子信道的极化重量包括第一部分极化重量和第二部分极化重量，第一部分极化重量是根据调制极化参数集合和序号i的二进制表示的
Figure PCTCN2019128804-appb-000048
部分确定的，第二部分极化重量是根据序号i的二进制表示的
Figure PCTCN2019128804-appb-000049
部分确定的，其中，m是根据调制阶数确定的，n为序号i的二进制表示的比特个数。
可选地，处理单元510具体用于根据如下公式确定所述序号i对应的极化子信道的极化重量：
Figure PCTCN2019128804-appb-000050
其中，
Figure PCTCN2019128804-appb-000051
用于确定第一部分极化重量，
Figure PCTCN2019128804-appb-000052
用于确定第二部分极化重量，
Figure PCTCN2019128804-appb-000053
为调制极化参数集合，β＝0.25，a i为极化子信道的序号i的二进制表示的第i个比特的取值，a i∈{0,1}。
可选地，处理单元510还用于：
遍历调制极化参数集合
Figure PCTCN2019128804-appb-000054
的取值，选择使得错误率上界最小的一组取值，错误率上界是N个极化子信道的错误概率之和；
根据使得错误率上界最小的调制极化参数集合的一组取值，确定该N个极化子信道的极化重量。
参见图12，图12为本申请提供的通信设备600的示意性结构图。通信设备600用于实现比特交织极化编码调制的功能。通信设备600包括：
处理装置601，用于根据调制极化参数集合确定码长为N的极化码的N个极化子信道各自的极化重量，调制极化参数集合中包括一个或多个调制极化参数，所述一个或多个调制极化参数用于确定在高阶调制下进行极化编码使得所述N个极化子信道发生极化而产生的极化重量，N≥1且为整数；以及，根据N个极化子信道的极化重量确定N个极化子信道的可靠度的排序，并根据N个极化子信道的可靠度的排序，对待编码的比特序列进行极化编码，得到码字序列；以及，对码字序列进行高阶调制，得到调制符号序列。
所述通信设备600还可以包括输出接口602，用于输出所述调制符号序列。
所述输出接口可以为输出电路，也可以为收发器。
可选地，收发器可以与天线相连接。
这里，通信设备600可以是与终端设备通信的网络设备，也可以是一个终端设备。
在具体实现时，处理装置601可以处理器、芯片或者集成电路。
本申请还提供了一种处理装置601，用于实现上述方法实施例的极化编码调制的方法200。方法200中的部分或全部流程可以通过硬件来实现。当通过硬件实现时，作为一种可能的设计，处理装置601为处理器。可选地，作为另一种可能的设计，处理装置601还可以如图13所示。
参见图13，图13为处理装置601的内部结构示意图。处理装置601包括：
输入接口电路6011，用于获取待编码的比特序列；
逻辑电路6012，根据调制极化参数集合确定码长为N的极化码的N个极化子信道各自的极化重量，调制极化参数集合中包括一个或多个调制极化参数，所述一个或多个调制极化参数用于确定在高阶调制下进行极化编码使得所述N个极化子信道发生极化而产生 的极化重量，N≥1且为整数；根据各个极化子信道的极化重量确定N个极化子信道的可靠度的排序，并根据N个极化子信道的可靠度的排序，对待编码的比特序列进行极化编码，得到码字序列；以及，对码字序列进行高阶调制，得到调制符号序列；
输出接口电路6013，用于输出调制符号序列。
可选地，本申请提供的极化编码调制的方法200的部分或全部流程也可以通过软件来实现。此种情况下，处理装置601可以包括处理器和存储器。存储器用于存储计算机程序，处理器用于执行存储器中存储的计算机程序，以执行本申请方法实施例的极化编码调制的方法。
这里，存储器可以是物理上独立的单元。或者，存储器也可以与处理器集成在一起，本申请不作限定。
在另一种可选的实施例中，处理装置601可以只包括处理器，存储计算机程序的存储器位于处理装置之外。处理器通过电路/电线与存储器连接，用于读取并执行存储器中存储的计算机程序，以执行任一方法实施例。
应理解，本申请提供的极化编码调制的方法200由发送端执行。例如，图1所示的无线通信系统，当基站发送信号时，基站为发送端。当MS1或MS2发送信号时，MS1或MS2为发送端。由此，本申请还提供一种网络设备和终端设备，网络设备和终端设备具有实现上述极化编码调制的方法的功能。
参见图14，图14是本申请提供的网络设备3000的示意性结构图。如图14所示，网络设备3000可以应用于上述图1所示的无线通信系统中，具有执行本申请提供的极化编码调制的方法的功能。网络设备3000例如可以是图1中所示的基站。
网络设备3000可以包括一个或多个射频单元，例如远端射频单元(remote radio unit，RRU)3100和一个或多个基带单元(baseband unit，BBU)。基带单元也可以称为数字单元(digital unit，DU)3200。所述RRU 3100可以称为收发单元，与图11中的收发单元520对应。可选地，收发单元3100还可以称为收发机、收发电路、或者收发器等等，其可以包括至少一个天线3101和射频单元3102。可选地，收发单元3100可以包括接收单元和发送单元，接收单元可以对应于接收器(或称接收机、接收电路)，发送单元可以对应于发射器(或称发射机、发射电路)。RRU 3100主要用于射频信号的收发以及射频信号与基带信号的转换。BBU 3200部分主要用于进行基带处理，对基站进行控制等。RRU 3100与BBU 3200可以是物理上设置在一起，也可以物理上分离设置的，即分布式基站。
BBU 3200为网络设备3000的控制中心，也可以称为处理单元，例如与图11中的处理单元510对应，主要用于完成基带处理功能，例如，确定极化子信道的可靠度，极化编码，速率匹配(可选步骤)、比特交织(可选步骤)、调制等。
在一个示例中，BBU 3200可以由一个或多个单板构成，多个单板可以共同支持单一接入制式的无线接入网(例如，LTE网)，也可以分别支持不同接入制式的无线接入网(例如，LTE网、5G网或其它网)。BBU 3200还包括存储器3201和处理器3202。存储器3201用以存储必要的指令和数据。处理器3202用于控制网络设备3000进行必要的动作，例如，用于控制网络设备3000执行上述方法实施例。存储器3201和处理器3202可以服务于一个或多个单板。也就是说，可以每个单板上单独设置存储器和处理器。也可以是多个单板共用相同的存储器和处理器。此外每个单板上还可以设置有必要的电路。
应理解，图14所示的网络设备3000能够实现极化编码调制的方法。网络设备3000中的各个单元的操作和/或功能，分别为了实现极化编码调制的方法200或其各实施例中的相应流程。为避免重复，此处适当省略详述描述。
BBU 3200可以用于执行前面方法实施例中描述的由发送端内部实现的动作，例如，根据调制极化参数集合计算极化子信道的极化重量，进而确定N个极化子信道的可靠度的排序。又例如，对待编码的比特序列进行极化编码、调制等。而RRU 3100可以用于执行前面方法实施例中描述的由发送端执行的发送或接收的动作。例如，发送调制符号序列。
在图1所示的无线通信系统中进行上行传输时，MS1或MS2为发送端。下面对本申请提供的终端设备进行说明。
参见图15，图15是本申请提供的终端设备7000的示意性结构图。如图15所示，终端设备7000包括处理器7001。可选地，终端设备7000还包括存储器7003以及收发器7002。其中，处理器7001、收发器7002和存储器7003之间可以通过内部连接通路互相通信，以传递控制和/或数据信号。存储器7003用于存储计算机程序，处理器7001用于从存储器7003中调用并运行计算机程序，以控制收发器7002收发信号。
可选地，终端设备7000还可以包括天线7004，用于将收发器7002输出的信息或数据通过无线信号发送出去。
处理器7001和存储器7003可以合成一个处理装置，处理器7001用于执行存储器7003中存储的程序代码来实现上述功能。具体实现时，存储器7003也可以集成在处理器7001中，或者独立于处理器7001。
处理器7001可以用于执行前面方法实施例中描述的由发送端内部实现的动作，例如，计算极化子信道的极化重量，确定极化子信道的可靠度的排序，极化编码以及调制等。而收发器7002可以用于执行前面方法实施例中描述的由发送端执行的接收或发送的动作，例如，发送调制符号序列。收发器7002也可以为输出接口或者输入接口，集成在处理器7001上。
可选地，终端设备7000还可以包括电源7005，用于给终端设备中的各种器件或电路提供电源。
除此之外，为了使得终端设备的功能更加完善，终端设备7000还可以包括输入单元7006、显示单元7007、音频电路7008、摄像头7009和传感器610等中的一个或多个。音频电路还可以包括扬声器70082、麦克风70084等。
例如，终端设备7000可以是图1所示的无线通信系统中的MS1或MS2。
此外，本申请提供一种计算机可读存储介质，该计算机可读存储介质中存储有计算机指令，当该计算机指令在计算机上运行时，使得计算机执行本申请实施例的极化编码调制的方法200的相应操作和/或流程。
本申请还提供一种计算机程序产品，该计算机程序产品包括计算机程序代码，当该计算机程序代码在计算机上运行时，使得计算机执行本申请实施例的极化编码调制的方法200的相应操作和/或流程。
本申请还提供一种芯片，包括一个或多个处理器。所述一个或多个处理器用于读取并执行存储器中存储的计算机程序，以执行本申请提供的极化编码调制的方法200的相应操作和/或流程。
可选地，该芯片还包括一个或多个存储器，所述一个或多个存储器与所述一个或多个处理器通过电路或电线与存储器连接。进一步可选地，芯片还包括通信接口，所述一个或多个处理器与所述通信接口连接。可选地，所述通信接口可以包括输入接口和输出接口。其中，所述输入接口用于接收待编码的比特序列，处理器从所述输入接口获取待编码的比特序列，并采用本申请实施例的极化编码调制的方法200，对待编码的比特序列进行极化编码和调制；所述输出接口还用于输出极化编码调制后的调制符号序列。可选地，所述通信接口可以为接口电路。具体地，输入接口可以为输入接口电路，输出接口可以为输出接口电路。
本申请实施例中所述的芯片，可以是现场可编程门阵列(field-programmable gate array，FPGA)、专用集成芯片(application specific integrated circuit，ASIC)、系统芯片(system on chip，SoC)、中央处理器(central processor unit，CPU)、网络处理器(Network Processor，NP)、数字信号处理电路(digital signal processor，DSP)，还可以是微控制器(micro controller unit，MCU、可编程控制器(programmable logic device，PLD)或其它集成芯片。
本申请实施例中的处理器可以是一种集成电路芯片，具有信号的处理能力。在实现过程中，上述方法实施例的各步骤可以通过处理器中的硬件的集成逻辑电路或者软件形式的指令完成。处理器可以是通用处理器、DSP、ASIC、FPGA或其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件。通用处理器可以是微处理器或者该处理器也可以是任何常规的处理器等。本申请实施例公开的方法的步骤可以直接体现为硬件编码处理器执行完成，或者用编码处理器中的硬件及软件模块组合执行完成。软件模块可以位于随机存储器，闪存、只读存储器，可编程只读存储器或者电可擦写可编程存储器、寄存器等本领域成熟的存储介质中。该存储介质位于存储器，处理器读取存储器中的信息，结合其硬件完成上述方法的步骤。
本申请实施例中的存储器可以是易失性存储器或非易失性存储器，或可包括易失性和非易失性存储器两者。其中，非易失性存储器可以是只读存储器(read-only memory，ROM)、可编程只读存储器(programmable ROM，PROM)、可擦除可编程只读存储器(erasable PROM，EPROM)、电可擦除可编程只读存储器(electrically EPROM，EEPROM)或闪存。易失性存储器可以是随机存取存储器(random access memory，RAM)，其用作外部高速缓存。通过示例性但不是限制性说明，许多形式的RAM可用，例如静态随机存取存储器(static RAM，SRAM)、动态随机存取存储器(dynamic RAM，DRAM)、同步动态随机存取存储器(synchronous DRAM，SDRAM)、双倍数据速率同步动态随机存取存储器(double data rate SDRAM，DDR SDRAM)、增强型同步动态随机存取存储器(enhanced SDRAM，ESDRAM)、同步连接动态随机存取存储器(synchlink DRAM，SLDRAM)和直接内存总线随机存取存储器(direct rambus RAM，DR RAM)。应注意，本文描述的系统和方法的存储器旨在包括但不限于这些和任意其它适合类型的存储器。
结合前面的描述，本领域的技术人员可以意识到，本文实施例的方法，可以通过硬件(例如，逻辑电路)，或者软件，或者硬件与软件的结合来实现。这些方法究竟以硬件还是软件方式来执行，取决于技术方案的特定应用和设计约束条件。专业技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能，但是这种实现不应认为超出本申请的范围。
当上述功能通过软件的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。在这种情况下，本申请的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本申请各个实施例所述方法的全部或部分步骤。而前述的存储介质包括：U盘、移动硬盘、ROM、RAM、磁碟或者光盘等各种可以存储程序代码的介质。
以上所述，仅为本申请的具体实施方式，但本申请的保护范围并不局限于此，任何熟悉本技术领域的技术人员在本申请揭露的技术范围内，可轻易想到变化或替换，都应涵盖在本申请的保护范围之内。因此，本申请的保护范围应以所述权利要求的保护范围为准。

Claims (15)

  1. 一种极化编码调制的方法，其特征在于，包括：
    根据调制极化参数集合确定码长为N的极化码的N个极化子信道各自的极化重量，所述调制极化参数集合中包括一个或多个调制极化参数，所述一个或多个调制极化参数用于确定在高阶调制下进行极化编码使得所述N个极化子信道发生极化而产生的极化重量，N≥1且为整数；
    根据所述极化重量确定所述N个极化子信道的可靠度的排序，并根据所述N个极化子信道的可靠度的排序，对待编码的比特序列进行极化编码，得到码字序列；
    对所述码字序列进行高阶调制，得到调制符号序列；
    发送所述调制符号序列。
  2. 根据权利要求1所述的方法，其特征在于，所述根据调制极化参数集合确定码长为N的极化码的N个极化子信道各自的极化重量，包括：
    将极化子信道的序号i表示为二进制i＝(i 1,i 2,…,i n)，0≤i≤N-1,i为整数；
    根据所述调制极化参数集合和所述序号i的二进制表示i＝(i 1,i 2,…,i n)，确定所述序号i对应的极化子信道的极化重量，其中，所述序号i对应的极化子信道的极化重量包括第一部分极化重量和第二部分极化重量，所述第一部分极化重量是根据所述调制极化参数集合和所述序号i的二进制表示的
    Figure PCTCN2019128804-appb-100001
    部分确定的，所述第二部分极化重量是根据所述序号i的二进制表示的
    Figure PCTCN2019128804-appb-100002
    部分确定的，其中，m是根据调制阶数确定的，n为序号i的二进制表示的比特个数。
  3. 根据权利要求2所述的方法，其特征在于，所述根据所述调制参数集合和所述序号i的二进制表示，确定所述序号i对应的极化子信道的极化重量，包括：
    根据如下公式确定所述序号i对应的极化子信道的极化重量：
    Figure PCTCN2019128804-appb-100003
    其中，
    Figure PCTCN2019128804-appb-100004
    用于确定所述第一部分极化重量，
    Figure PCTCN2019128804-appb-100005
    用于确定所述第二部分极化重量，
    Figure PCTCN2019128804-appb-100006
    为所述调制极化参数集合，β＝0.25，a i为所述序号i的二进制表示的第i个比特的取值，a i∈{0,1}。
  4. 根据权利要求3所述的方法，其特征在于，所述根据所述公式确定所述序号i对应的极化子信道的可靠度之前，所述方法还包括：
    遍历所述调制极化参数集合
    Figure PCTCN2019128804-appb-100007
    的取值，选择使得错误率上界最小的一组取值，所述错误率上界是所述N个极化子信道的错误概率之和；
    所述根据调制极化参数集合确定码长为N的极化码的N个极化子信道的极化重量，包括：
    根据使得所述错误率上界最小的调制极化参数集合的一组取值，确定所述N个极化子 信道的极化重量。
  5. 一种极化编码调制的装置，其特征在于，包括：
    处理单元，用于根据调制极化参数集合确定码长为N的极化码的N个极化子信道各自的极化重量，所述调制极化参数集合中包括一个或多个调制极化参数，所述一个或多个调制极化参数用于确定在高阶调制下进行极化编码使得所述N个极化子信道发生极化而产生的极化重量，N≥1且为整数；
    所述处理单元，还用于根据所述极化重量确定所述N个极化子信道的可靠度的排序，并根据所述N个极化子信道的可靠度的排序，对待编码的比特序列进行极化编码，得到码字序列；
    所述处理单元，还用于对所述码字序列进行高阶调制，得到调制符号序列；
    收发单元，用于发送所述调制符号序列。
  6. 根据权利要求5所述的装置，其特征在于，所述处理单元具体用于：
    将极化子信道的序号i表示为二进制i＝(i 1,i 2,…,i n)，0≤i≤N-1,i为整数；
    根据所述调制极化参数集合和所述序号i的二进制表示i＝(i 1,i 2,…,i n)，确定所述序号i对应的极化子信道的极化重量，其中，所述序号i对应的极化子信道的极化重量包括第一部分极化重量和第二部分极化重量，所述第一部分极化重量是根据所述调制极化参数集合和所述序号i的二进制表示的
    Figure PCTCN2019128804-appb-100008
    部分确定的，所述第二部分极化重量是根据所述序号i的二进制表示的
    Figure PCTCN2019128804-appb-100009
    部分确定的，其中，m是根据调制阶数确定的，n为序号i的二进制表示的比特个数。
  7. 根据权利要求6所述的装置，其特征在于，所述处理单元具体用于根据如下公式确定所述序号i对应的极化子信道的极化重量：
    Figure PCTCN2019128804-appb-100010
    其中，
    Figure PCTCN2019128804-appb-100011
    用于确定所述第一部分极化重量，
    Figure PCTCN2019128804-appb-100012
    用于确定所述第二部分极化重量，
    Figure PCTCN2019128804-appb-100013
    为所述调制极化参数集合，β＝0.25，a i为所述序号i的二进制表示的第i个比特的取值，a i∈{0,1}。
  8. 根据权利要求7所述的装置，其特征在于，所述处理单元还用于：
    遍历所述调制极化参数集合
    Figure PCTCN2019128804-appb-100014
    的取值，选择使得错误率上界最小的一组取值，所述错误率上界是所述N个极化子信道的错误概率之和；
    根据使得所述错误率上界最小的调制极化参数集合的一组取值，确定所述N个极化子信道的极化重量。
  9. 一种通信设备，其特征在于，包括：
    处理器，用于根据调制极化参数集合确定码长为N的极化码的N个极化子信道各自的极化重量，所述调制极化参数集合中包括一个或多个调制极化参数，所述一个或多个调制极化参数用于确定在高阶调制下进行极化编码使得所述N个极化子信道发生极化而产 生的极化重量，N≥1且为整数；
    所述处理器，还用于根据所述极化重量确定所述N个极化子信道的可靠度的排序，并根据所述N个极化子信道的可靠度的排序，对待编码的比特序列进行极化编码，得到码字序列；
    所述处理器，还用于对所述码字序列进行高阶调制，得到调制符号序列；
    输出接口，用于输出所述调制符号序列。
  10. 根据权利要求9所述的通信设备，其特征在于，所述处理器具体用于：
    将极化子信道的序号i表示为二进制i＝(i 1,i 2,…,i n)，0≤i≤N-1,i为整数；
    根据所述调制极化参数集合和所述序号i的二进制表示i＝(i 1,i 2,…,i n)，确定所述序号i对应的极化子信道的极化重量，其中，所述序号i对应的极化子信道的极化重量包括第一部分极化重量和第二部分极化重量，所述第一部分极化重量是根据所述调制极化参数集合和所述序号i的二进制表示的
    Figure PCTCN2019128804-appb-100015
    部分确定的，所述第二部分极化重量是根据所述序号i的二进制表示的
    Figure PCTCN2019128804-appb-100016
    部分确定的，其中，m是根据调制阶数确定的，n为序号i的二进制表示的比特个数。
  11. 根据权利要求10所述的通信设备，其特征在于，所述处理器具体用于：
    根据如下公式确定所述序号i对应的极化子信道的极化重量：
    Figure PCTCN2019128804-appb-100017
    其中，
    Figure PCTCN2019128804-appb-100018
    用于确定所述第一部分极化重量，
    Figure PCTCN2019128804-appb-100019
    用于确定所述第二部分极化重量，
    Figure PCTCN2019128804-appb-100020
    为所述调制极化参数集合，β＝0.25，a i为所述序号i的二进制表示的第i个比特的取值，a i∈{0,1}。
  12. 根据权利要求11所述的通信设备，其特征在于，所述处理器还用于遍历所述调制极化参数集合
    Figure PCTCN2019128804-appb-100021
    的取值，选择使得错误率上界最小的一组取值，所述错误率上界是所述N个极化子信道的错误概率之和；
    以及，所述处理器用于根据使得所述错误率上界最小的调制极化参数集合的一组取值，确定所述N个极化子信道的极化重量。
  13. 一种计算机可读存储介质，其特征在于，所述计算机可读存储介质存储有计算机指令，当所述计算机指令在计算机上运行时，使得所述计算机执行如权利要求1-4中任一项所述的方法。
  14. 一种芯片，其特征在于，包括存储器和处理器，所述存储器用于存储计算机程序，所述处理器用于从读取并执行所述存储器中存储的所述计算机程序，以执行如权利要求1-4中任一项所述的方法。
  15. 一种通信装置，其特征在于，包括处理器和接口电路，所述接口电路用于接收计算机代码或指令，并传输至所述处理器，所述处理器用于运行所述计算机代码或指令，以执行如权利要求1-4中任一项所述的方法。
PCT/CN2019/128804 2018-12-27 2019-12-26 极化编码调制的方法和装置 WO2020135616A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201811613411.2 2018-12-27
CN201811613411.2A CN111385059B (zh) 2018-12-27 2018-12-27 极化编码调制的方法和装置

Publications (1)

Publication Number Publication Date
WO2020135616A1 true WO2020135616A1 (zh) 2020-07-02

Family

ID=71125733

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/128804 WO2020135616A1 (zh) 2018-12-27 2019-12-26 极化编码调制的方法和装置

Country Status (2)

Country Link
CN (1) CN111385059B (zh)
WO (1) WO2020135616A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP4344105A4 (en) * 2021-07-02 2024-10-09 Huawei Tech Co Ltd ENCODING METHOD AND DEVICE AS WELL AS DECODING METHOD AND DEVICE

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112737735A (zh) * 2021-01-29 2021-04-30 中山大学 基于极化权重的可见光通信信道的极化编码方法和系统
CN114915298A (zh) * 2021-02-10 2022-08-16 中国移动通信有限公司研究院 极化编码调制的信息位确定方法、映射生成方法及设备
CN115085857A (zh) * 2021-03-10 2022-09-20 华为技术有限公司 极化编码调制、解调译码的方法和装置
CN115412198A (zh) * 2021-05-27 2022-11-29 中国移动通信有限公司研究院 Bipcm的映射关系生成方法、信息位集合确定方法及设备

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105099622A (zh) * 2015-07-01 2015-11-25 北京邮电大学 极化编码调制中信道可靠度的确定方法及装置
CN107222293A (zh) * 2017-05-16 2017-09-29 北京邮电大学 一种信息传输方法、装置、电子设备和存储介质
CN108809333A (zh) * 2017-05-05 2018-11-13 华为技术有限公司 极化码编译码的方法、发送设备和接收设备
WO2018212558A1 (en) * 2017-05-15 2018-11-22 Samsung Electronics Co., Ltd. Method and apparatus for coding/decoding in a communication or broadcasting system using high-order modulation

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10637607B2 (en) * 2016-09-15 2020-04-28 Huawei Technologies Co., Ltd. Method and apparatus for encoding data using a polar code
CN108347301B (zh) * 2017-01-25 2020-06-02 华为技术有限公司 数据的传输方法和装置
CN115173991B (zh) * 2017-03-25 2024-04-09 华为技术有限公司 一种速率匹配的方法和装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105099622A (zh) * 2015-07-01 2015-11-25 北京邮电大学 极化编码调制中信道可靠度的确定方法及装置
CN108809333A (zh) * 2017-05-05 2018-11-13 华为技术有限公司 极化码编译码的方法、发送设备和接收设备
WO2018212558A1 (en) * 2017-05-15 2018-11-22 Samsung Electronics Co., Ltd. Method and apparatus for coding/decoding in a communication or broadcasting system using high-order modulation
CN107222293A (zh) * 2017-05-16 2017-09-29 北京邮电大学 一种信息传输方法、装置、电子设备和存储介质

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP4344105A4 (en) * 2021-07-02 2024-10-09 Huawei Tech Co Ltd ENCODING METHOD AND DEVICE AS WELL AS DECODING METHOD AND DEVICE

Also Published As

Publication number Publication date
CN111385059A (zh) 2020-07-07
CN111385059B (zh) 2021-08-31

Similar Documents

Publication Publication Date Title
WO2020135616A1 (zh) 极化编码调制的方法和装置
WO2017092543A1 (zh) 用于极化码的速率匹配的方法和装置
WO2018049951A1 (zh) 信息传输的方法、发送端设备和接收端设备
WO2019158031A1 (zh) 编码的方法、译码的方法、编码设备和译码设备
JP2020527297A (ja) インタリーブを伴う連接ポーラ符号
WO2019062861A1 (zh) 通信系统中冗余版本的设计方案
WO2022161201A1 (zh) 编码调制与解调解码方法及装置
WO2020147526A1 (zh) 一种级联crc码的极化码编码方法及装置
US11936402B2 (en) Puncturing of polar codes with complementary sequences
WO2022188752A1 (zh) 一种编译码方法及装置
US20240039777A1 (en) Modulation method, demodulation method, and communication apparatus
WO2021254422A1 (zh) Polar码编码方法、Polar码译码方法及其装置
BR112019022474A2 (pt) Método e aparelho de correspondência de taxa de código polar
WO2020048537A1 (zh) 级联编码的方法和装置
US11152959B2 (en) Enhanced information sequences for polar codes
WO2021196942A1 (zh) 编码方法及装置
WO2018201983A1 (zh) 极化码信道编码方法、设备以及通信系统
WO2022188710A1 (zh) 极化编码调制、解调译码的方法和装置
WO2023273995A1 (zh) 数据处理方法及装置
WO2022022516A1 (zh) 无线通信的方法和装置
US20220060295A1 (en) Method And Apparatus For Sequentially Detecting And Decoding Sparse Code Multiple Access Signal For Multiple Users
WO2023155651A1 (zh) 基于极化码的编码方法和编码装置
WO2023155650A1 (zh) 基于系统极化码的编码方法和编码装置
EP4422079A1 (en) Information processing method, and device
WO2023109733A1 (zh) 一种速率匹配的方法及装置

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: 19905995

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 19905995

Country of ref document: EP

Kind code of ref document: A1