WO2017097098A1 - 极化码处理的方法及通信设备 - Google Patents

极化码处理的方法及通信设备 Download PDF

Info

Publication number
WO2017097098A1
WO2017097098A1 PCT/CN2016/106174 CN2016106174W WO2017097098A1 WO 2017097098 A1 WO2017097098 A1 WO 2017097098A1 CN 2016106174 W CN2016106174 W CN 2016106174W WO 2017097098 A1 WO2017097098 A1 WO 2017097098A1
Authority
WO
WIPO (PCT)
Prior art keywords
bits
coded
sequence
bit
transmission
Prior art date
Application number
PCT/CN2016/106174
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 WO2017097098A1 publication Critical patent/WO2017097098A1/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
    • 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/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0009—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the channel coding
    • H04L1/0013—Rate matching, e.g. puncturing or repetition of code symbols
    • 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/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0015—Systems modifying transmission characteristics according to link quality, e.g. power backoff characterised by the adaptation strategy
    • H04L1/0016—Systems modifying transmission characteristics according to link quality, e.g. power backoff characterised by the adaptation strategy involving special memory structures, e.g. look-up tables

Definitions

  • Embodiments of the present invention relate to the field of communications, and more particularly, to a method and a communication device for processing a polarized Polar code.
  • the Polar code is an encoding method that can achieve Shannon capacity and has low coding and decoding complexity.
  • B N is an N ⁇ N transposed matrix, such as a bit reversal matrix. Is the Kronecker power of F 2 , defined as
  • Some of the bits are used to carry information, called information bits.
  • the set of sequence numbers of these information bits is denoted as A; the other part of the bits is set to a fixed value pre-agreed by the transceiver, which is called a fixed bit, and the sequence number is used.
  • a complementary set a represents C.
  • these fixed bits are usually set to zero. In fact, only the transceiver terminal needs to be pre-agreed, and the fixed bit sequence can be arbitrarily set.
  • the encoded bit sequence of the Polar code can be obtained by the following method:
  • u A is In the information bit set, u A is the row vector of length K, ie
  • K,
  • the selection of set A determines the performance of the Polar code.
  • the most basic decoding of the Polar code is SC decoding.
  • the SC decoding algorithm utilizes a sequence of signals received from the channel One by one Decoding each bit in the middle Estimated sequence
  • Ni represents the Cartesian product of Ni sets ⁇ 0,1 ⁇ .
  • the information bit number set A is selected according to the following method: firstly, according to the channel transition probability function, a density evolution or a Gaussian approximation method can be used to obtain a polarization channel corresponding to the bit of the sequence number i when the bit 0 is transmitted, and the signal pair is received.
  • the probability density distribution function p i (l) of the number likelihood ratio LLR i ln(W (i) (y
  • the code length of the Polar code is not necessarily a power of 2, so the determination of the information bit number actually involves the determination of the mother code length and the rate adaptation scheme.
  • Gaussian approximation or density evolution, or other construction methods such as Tal and Vardy require a large number of high-precision floating-point calculations, even integrals, etc., therefore, in practical systems, this method cannot be used. Calculated in real time.
  • the transmitting end determines the code length and code rate of the channel coding according to the channel state information fed back by the receiving end, combining the length of the sequence of the message to be transmitted and the available physical channel resources.
  • the encoder at the transmitting end encodes the sequence of messages to be transmitted according to the code length and the code rate. Since different code lengths and code rates correspond to different codebooks, it is necessary for the encoder to store information of all codebooks. Similarly, in order for the decoder to be able to decode the received channel, it is also necessary to store all of the codebooks.
  • the codebook of the Polar code depends on the mother code length M and the information bit number set A.
  • the existing Polar code scheme cannot be calculated by a simple method whether it is a set of information bit numbers or a bit selection order of rate adaptation. Therefore, for all possible code lengths, code rates, the Polar code encoder and decoder need to store a corresponding set of information bit numbers and a rate adaptation table. These information bit sequence numbers and rate adaptations are based on actual system requirements and working signal-to-noise ratio intervals.
  • a set of parameters is selected by a certain principle to be constructed in advance by density approximation in an offline form.
  • Embodiments of the present invention provide a method for processing a polarization code, which can be used for encoding and decoding a polarization code.
  • a method for processing a polarization code comprising: determining, by a communication device, a number K of information bits of a code block to be encoded, a number N of transmission bits of the code block to be encoded transmitted in an actual channel, and the a rate adaptation rule of the code block to be coded, wherein the code block to be coded includes M uncoded bits, and a rate adaptation rule of the code block to be coded is used to represent the M coded bits.
  • the communication device determines, according to the reliability of each of the M coded bits, the M unmatched before the M coded bits are encoded Encoding the reliability of each bit in the bit, and determining K bits from the M uncoded bits as information bits according to the reliability of each of the M uncoded bits, where M, N, K is a positive integer.
  • the method of the present embodiment can determine the number of information bits K of the code block to be encoded, the number N of transmission bits to be transmitted in the actual channel, and the rate adaptation rule of the code block to be encoded.
  • the reliability of each of the N transmission bits determines the reliability of each of the M uncoded bits in the code block to be encoded, thereby determining K information bits from the M uncoded bits, the information bits
  • the set A formed by the sequence number will be used for the decoding or result process of the Polar code. Therefore, embodiments of the present invention can provide a method for performing a Polar code encoding or decoding on a communication device.
  • the mapping between the M coded bits and the N transmit bits includes one of: the N transmit bits and the first bit sequence are included One-to-one correspondence of N bits, the first bit sequence is composed of the M coded bits and the first NM coded bits of the M coded bits; the N transmit bits and the second bit sequence are included The N bits are in one-to-one correspondence, and the second bit sequence is composed of the M coded bits and the last NM coded bits of the M coded bits.
  • a rate adaptation rule of the code block to be coded can be determined, thereby enabling N
  • the reliability of each bit in the transmitted bits yields the reliability of each of the M coded bits.
  • the communications device determines a number of information bits K of the code block to be encoded, the to-be-coded
  • the number N of transmission bits of the code block transmitted in the actual channel includes: the number of information bits and the number of transmission bits corresponding to the current channel state information, the number of bits included in the sequence of messages to be transmitted, and the maximum number of bits currently allowed to be transmitted.
  • the number of information bits K and the number N of transmission bits are respectively determined.
  • the determining, by the communications device, the information bit number K of the code block to be encoded, and the number N of transmission bits of the to-be-encoded code block to be transmitted in the actual channel includes: determining, in the first lookup table, current channel state information, a matching entry that matches the number of bits included in the sequence of messages to be transmitted and the maximum number of bits currently allowed to be transmitted, the entries of the first lookup table include channel state information, the number of bits included in the message sequence, and the maximum allowed transmission a number of bits, a number of information bits, and a number of transmission bits; information corresponding to the current channel state information, the number of bits included in the to-be-sent message sequence, and the maximum number of bits currently allowed to be transmitted in the matching entry
  • the number of bits and the number of transmission bits are determined as the number K of information bits and the number N of transmission bits, respectively.
  • the number of information bits K of the code block to be encoded and the number N of transmission bits of the code block to be encoded transmitted in the actual channel are respectively determined.
  • the physical channel resource information includes: Channel Sate Information (CSI) and the number of bits of the bit sequence to be transmitted, and the maximum number of bits currently allowed to be transmitted in the communication system, where the number of bits of the message sequence to be transmitted is also to be transmitted.
  • CSI Channel Sate Information
  • the total length of the code block, the maximum number of bits currently allowed to be transmitted, also refers to the number of physical channels currently available.
  • the method before the determining the reliability of each of the M coded bits, the method further includes one of: following the current channel state information, The number of bits included in the sequence of to-be-sent messages and the number of coded bits corresponding to the maximum number of bits currently allowed to be transmitted are determined as the number M of coded bits; the number of information bits K to be coded with the code block to be encoded, the transmission bits the number of coded bits corresponding to the determined number N is the number of encoded bits M; based on the maximum transmission rate R max set in advance, the maximum allowable code length of M max, allowing shortest code length M min, said to be determined by the following formula
  • the number of coded bits encoded by the coded block is M:
  • R max , M max and M min are positive integers.
  • the method further includes one of: determining, in the second lookup table, the current channel state information, the message sequence to be sent, The number of bits and the matching list of the maximum number of bits currently allowed to be transmitted, the entries of the second lookup table include channel state information, the number of bits included in the message sequence, the maximum number of bits allowed to be transmitted, and the number of encoded bits And determining, in the matching entry, the number of coded bits corresponding to the current channel state information, the number of bits included in the to-be-sent message sequence, and the maximum number of bits currently allowed to be transmitted as the number of coded bits M Determining, in the third lookup table, a matching entry that matches the number of information bits K of the code block to be encoded, the number N of transmission bits, the number of information bits included in the entry of the third lookup table, and the transmission bit Number and number of coded bits; corresponding to the number of information bits K of the code block to be encoded and the number N of
  • the network device determines the number M of coded bits, and further determines a correspondence between the M coded bits and the N transmit bits according to the rate adaptation rule.
  • the communication device can finally determine each of the M coded bits according to the reliability of each of the N transmission bits and the correspondence between the M coded bits and the N transmission bits.
  • the reliability of bits can finally determine each of the M coded bits according to the reliability of each of the N transmission bits and the correspondence between the M coded bits and the N transmission bits. The reliability of bits.
  • the communications device determines, according to the reliability of each of the M coded bits, the M The reliability of each bit of the corresponding M uncoded bits before encoding, including: the second metric sequence Performing bit reverse order reordering to obtain a third metric sequence
  • bit interval ⁇ bit interval 1 ⁇ i 1 ⁇ log 2 M, i 1 , i 2, i 3 is a positive integer
  • i 1 p, 1 ⁇ i 2 ⁇ M / (2 ⁇ (p)), wherein, 1 ⁇ p ⁇ log 2 M
  • i 2 q, 1 ⁇ i 3 ⁇ (q)
  • ⁇ k is obtained
  • G(x 1 , x 2 ) x 1 +x 2
  • F(x 1 ,x 2 ) a(x 1 ,x 2 )x 1 +b(x 1 ,x 2 )x 2 +c( x 1 , x 2 )
  • a, b, and c are constants.
  • the communication device can determine the reliability of each of the M uncoded bits corresponding to the M coded bits before encoding according to the reliability of each of the M coded bits.
  • the determining K bits from the M uncoded bits as the information bits includes: using the metric sequence The bit corresponding to the K element with the largest median value is used as the information bit.
  • the determining K bits from the M uncoded bits as information bits that is, determining a sequence number set of K information bits.
  • the embodiment of the invention can determine the method for determining the information bits in the polarization code ratio encoding process, reduce the storage overhead of the polarization code codebook information, and avoid large-scale storage overhead.
  • a communication device for polarization code processing for performing the method of any of the above first aspect or any of the possible implementations of the first aspect.
  • the apparatus comprises means for performing the method of any of the above-described first aspect or any of the possible implementations of the first aspect.
  • a communication device for polarization code processing comprising a memory and a processor storing instructions, wherein the processor executes the instructions to perform the method as described in the first aspect and the above implementations.
  • the method of the present embodiment can determine the number of information bits K of the code block to be encoded, the number N of transmission bits to be transmitted in the actual channel, and the rate adaptation rule of the code block to be encoded.
  • the reliability of each of the N transmission bits determines the reliability of each of the M uncoded bits in the code block to be encoded, thereby determining K information bits from the M uncoded bits, the information bits
  • the set A formed by the sequence number will be used for the decoding or result process of the Polar code. Therefore, embodiments of the present invention can provide a method for performing a Polar code encoding or decoding on a communication device.
  • FIG. 1 is a diagram of a wireless communication system in accordance with various embodiments described herein.
  • FIG. 2 is a schematic block diagram of a communication device embodying the present invention.
  • FIG. 3 is a schematic block diagram of a prior art method of polarization code processing.
  • FIG. 4 is a schematic flow chart of a method of polarization code processing according to an embodiment of the present invention.
  • FIG. 5 is a schematic block diagram of a method of polarization code processing according to another embodiment of the present invention.
  • FIG. 6 is a schematic diagram showing the performance of a polarization code processing method according to an embodiment of the present invention.
  • FIG. 7 is a schematic block diagram of an apparatus for processing a polarization code according to an embodiment of the present invention.
  • FIG. 8 is a schematic diagram of a network device according to another embodiment of the present invention.
  • a component can be, but is not limited to, a process running on a processor, a processor, an object, an executable file, Execute threads, programs, and/or computers.
  • an application running on a computing device and a computing device can be a component.
  • One or more components can reside within a process and/or execution thread, and the components can be located on one computer and/or distributed between two or more computers. Moreover, these components can execute from various computer readable media having various data structures stored thereon.
  • a component may, for example, be based on signals having one or more data packets (eg, data from two components interacting with another component between the local system, the distributed system, and/or the network, such as the Internet interacting with other systems) Communicate through local and/or remote processes.
  • data packets eg, data from two components interacting with another component between the local system, the distributed system, and/or the network, such as the Internet interacting with other systems
  • An access terminal may also be called a system, a subscriber unit, a subscriber station, a mobile station, a mobile station, a remote station, a remote terminal, a mobile device, a user terminal, a terminal, a wireless communication device, a user agent, a user device, or a UE (User Equipment, User equipment).
  • the access terminal may be a cellular phone, a cordless phone, a SIP (Session Initiation Protocol) phone, a WLL (Wireless Local Loop) station, a PDA (Personal Digital Assistant), and a wireless communication.
  • the base station can be used for communication with a mobile device, and the base station can be a BTS (Base Transceiver Station) in GSM (Global System of Mobile communication) or CDMA (Code Division Multiple Access), or
  • the NB (NodeB, base station) in the WCDMA (Wideband Code Division Multiple Access) may be an eNB or an eNodeB (Evolved Node B) in LTE (Long Term Evolution).
  • the term "article of manufacture” as used in this application encompasses a computer program accessible from any computer-readable device, carrier, or media.
  • the computer readable medium may include, but is not limited to, a magnetic storage device (for example, a hard disk, a floppy disk, or a magnetic tape), and an optical disk (for example, a CD (Compact Disk), a DVD (Digital Versatile Disk). Etc.), smart cards and flash memory devices (eg, EPROM (Erasable Programmable Read-Only Memory), cards, sticks or key drivers, etc.).
  • various storage media described herein can represent one or more devices and/or other machine-readable media for storing information.
  • the term "machine-readable medium” may include, but is not limited to, a wireless channel and various other mediums capable of storing, containing, and/or carrying instructions and/or data.
  • the wireless communication system 100 includes a base station 102 that can include multiple antenna groups.
  • Each antenna group may include one or more antennas, for example, one antenna group may include antennas 104 and 106, another antenna group may include antennas 108 and 110, and an additional group may include antennas 112 and 114.
  • Two antennas are shown in Figure 1 for each antenna group, although more or fewer antennas may be used for each group.
  • Base station 102 can additionally include a transmitter chain and a receiver chain, as will be understood by those of ordinary skill in the art, which can include multiple components associated with signal transmission and reception (e.g., processor, modulator, multiplexer, demodulation) , demultiplexer or antenna, etc.).
  • a transmitter chain and a receiver chain can include multiple components associated with signal transmission and reception (e.g., processor, modulator, multiplexer, demodulation) , demultiplexer or antenna, etc.).
  • Base station 102 can communicate with one or more access terminals, such as access terminal 116 and access terminal 122. However, it will be appreciated that base station 102 can communicate with any number of access terminals similar to access terminal 116 or 122. Access terminals 116 and 122 can be, for example, cellular telephones, smart phones, portable computers, handheld communication devices, handheld computing devices, satellite radios, global positioning systems, PDAs, and/or any other for communicating over wireless communication system 100. Suitable for equipment. As shown, access terminal 116 is in communication with antennas 112 and 114, with antennas 112 and 114 transmitting information to access terminal 116 over forward link 118 and receiving information from access terminal 116 over reverse link 120.
  • access terminal 116 is in communication with antennas 112 and 114, with antennas 112 and 114 transmitting information to access terminal 116 over forward link 118 and receiving information from access terminal 116 over reverse link 120.
  • access terminal 122 is in communication with antennas 104 and 106, wherein antennas 104 and 106 transmit information to access terminal 122 over forward link 124 and receive information from access terminal 122 over reverse link 126.
  • FDD Frequency Division Duplex
  • the forward link 118 can utilize a different frequency band than that used by the reverse link 120, and the forward link 124 can utilize the reverse link 126. Different frequency bands used.
  • the forward link 118 and the reverse link 120 can use a common frequency band, and the forward link 124 and the reverse link 126 can use a common frequency band.
  • Each set of antennas and/or regions designed for communication is referred to as a sector of base station 102.
  • the antenna group can be designed to communicate with access terminals in sectors of the coverage area of base station 102.
  • the transmit antenna of base station 102 may utilize beamforming to improve the signal to noise ratio of forward links 118 and 124.
  • the base station 102 uses beamforming to transmit signals to the randomly dispersed access terminals 116 and 122 in the relevant coverage area, the base station 102 uses a single antenna to transmit signals to all of its access terminals. Mobile devices are subject to less interference.
  • base station 102, access terminal 116 or access terminal 122 may be a wireless communication transmitting device and/or a wireless communication receiving device.
  • the wireless communication transmitting device can log It is encoded for transmission.
  • the wireless communication transmitting device may acquire (eg, generate, receive from other communication devices, or store in memory, etc.) a certain number of data bits to be transmitted over the channel to the wireless communication receiving device.
  • Such data bits may be included in a transport block (or multiple transport blocks) of data that may be segmented to produce multiple code blocks.
  • System 200 includes a wireless communication device 202 that is shown to transmit data via a channel. Although shown as transmitting data, the wireless communication device 202 can also receive data via a channel (eg, the wireless communication device 202 can transmit and receive data simultaneously, the wireless communication device 202 can transmit and receive data at different times, or a combination thereof, etc.) .
  • the wireless communication device 202 can be, for example, a base station (e.g., base station 102 of FIG. 1), an access terminal (e.g., access terminal 116 of FIG. 1, access terminal 122 of FIG. 1, etc.), and the like.
  • the wireless communication device 202 can include an encoder 204, a rate matching device 205, and a transmitter 206. Alternatively, when the wireless communication device 202 receives data via a channel, the wireless communication device 202 may also include a receiver that may be present separately or integrated with the transmitter 206 to form a transceiver.
  • the encoder 204 is configured to encode the data to be transmitted from the wireless communication device 202 (specifically, block coding, followed by a detailed description of the process) to obtain a target block codeword.
  • the rate matching device 205 is configured to perform interleaving, rate matching, and the like on the target block codeword to generate interleaved output bits.
  • transmitter 206 can then transmit the rate matched output bits processed by rate matching device 205 over the channel.
  • transmitter 206 can transmit relevant data to other different wireless communication devices (not shown).
  • FIG. 3 is a schematic block diagram of a prior art method of polarization code processing.
  • the lookup table 3 which K bits are selected as information bits, that is, a set A of sequence numbers of K information bits is determined.
  • the input parameters of the lookup table 3 are: the number of uncoded bits is M (the number of polarized channels), the number of transmitted bits N (the actual number of physical channels), and the number of information bits K.
  • the output parameters of the lookup table 3 are: K pieces of information A sequence of bits.
  • the rate adaptation is also required to obtain the correspondence between the N transmission bits and the M coded bits.
  • the possible values of the number K of information bits are 188, ranging from 40 to 6144.
  • the mother code length ranges from 132 to 18444, and the possible code lengths after rate adaptation are more than 3,000. If this scheme is adopted, in order to support the same number of code lengths and code rate configurations, it is necessary to store more than 3,000 lookup tables having a length of about tens of thousands to hundreds of thousands, so such storage overhead is extremely large.
  • FIG. 4 is a schematic flowchart of a method for processing a polarization code according to an embodiment of the present invention.
  • the method 400 shown in FIG. 4 may be performed by a communication device, which may be a transmitting end or a receiving end. That is, the communication device may be a base station or a user equipment. Similarly, the receiving end may be a base station or a user equipment, and the present invention is not particularly limited.
  • the method 400 includes:
  • the communication device determines the number of information bits K of the code block to be coded, the number N of transmission bits to be transmitted in the actual channel, and the rate adaptation rule of the code block to be coded, where the code block to be coded includes M
  • the rate adaptation rule of the code block to be coded is used to indicate the correspondence between the M coded bits and the N transmit bits obtained after the code block to be coded.
  • the communication device determines the reliability of each of the M coded bits according to the reliability of each of the N transmission bits and the correspondence between the M coded bits and the N transmission bits.
  • the communication device determines, according to the reliability of each of the M coded bits, the reliability of each of the M uncoded bits corresponding to the M coded bits before encoding, and according to the M uncoded bits. For each bit reliability, K bits are determined from the M uncoded bits as information bits, where M, N, and K are positive integers.
  • the reliability of each of the N transmission bits is used to measure the reliability of the actual physical channel corresponding to each bit, that is, the correctness of the bit under the maximum likelihood decision criterion after the channel is transmitted through the channel. Probability. Correspondence between the M coded bits and the N transmit bits means that the rate is appropriate because the number of M coded bits obtained after the actual code decoding by the Polar code and the number of N transmission bits (the actual number of physical channels) are inconsistent. With the M coded bits, N actually transmitted transmission bits are constructed, so there is a correspondence between M coded bits and N transmission bits.
  • the reliability of each of the M uncoded bits is used to measure each The reliability of the polarized channel corresponding to the bits, that is, the correct probability of the bit under the maximum likelihood decision criterion after channel transmission.
  • K uncoded bits can be determined from the M uncoded bits as information bits in the Polar code encoding or decoding process, that is, K uncoded is determined.
  • the polarized channel corresponding to the bit serves as the channel for actually transmitting information, and the remaining MK bits are set as fixed bits, which may also be referred to as frozen bits or padding bits.
  • the set of K information bit numbers is the information bit number set A, and the selection of the set A will affect the performance of the Polar code decoding.
  • N is a power of 2.
  • the method of the present embodiment can determine the number of information bits K of the code block to be encoded, the number N of transmission bits to be transmitted in the actual channel, and the rate adaptation rule of the code block to be encoded.
  • the reliability of each of the N transmission bits determines the reliability of each of the M uncoded bits in the code block to be encoded, thereby determining K information bits from the M uncoded bits, the information bits
  • the set A formed by the sequence number will be used for the decoding or result process of the Polar code. Therefore, embodiments of the present invention can provide a method for performing a Polar code encoding or decoding on a communication device.
  • the correspondence between the M coded bits and the N transmit bits includes any one of the following: the N transmit bits are in one-to-one correspondence with the N bits included in the first bit sequence, and the first bit The sequence consists of M coded bits and the first NM coded bits of the M coded bits are arranged in order;
  • Each of the N transmission bits is in one-to-one correspondence with the N bits included in the second bit sequence, and the second bit sequence is composed of M coded bits and the following N-M coded bits of the M coded bits;
  • Each of the N transmission bits is in one-to-one correspondence with the N bits included in the third bit sequence, and the third bit sequence is composed of M coded bits arranged in reverse order and M coded bits arranged in reverse order
  • the first NM coded bits are arranged in order;
  • Each of the N transmission bits is in one-to-one correspondence with the N bits included in the fourth bit sequence, and the fourth bit sequence is composed of M coded bits arranged in reverse order and M coded bits arranged in reverse order The latter NM coded bits are arranged in order.
  • the M coded bit sequences may be cyclically transmitted (or reversed), or the sequence of the M coded bits may be sequentially arranged in a bit reverse order and then sequentially (or reversed).
  • M and N are merely exemplary, and the correspondence between the above M coded bits and N transmission bits is only enumerated in several possible cases.
  • M coded bits and N may be used.
  • the correspondence between the transmission bits is stored in the lookup table, and the correspondence between M and N is obtained from the lookup table according to actual needs.
  • Those skilled in the art can also infer other possible correspondences, and the present invention is not limited thereto, and therefore, other possibilities are possible.
  • the corresponding rule of M coded bits and N transmission bits also falls within the scope of the present invention.
  • the communications device determines the number of information bits K of the code block to be encoded, and the number N of transmission bits for the code block to be encoded to be transmitted in the actual channel, including: The number of bits included in the transmission message sequence and the number of information bits corresponding to the maximum number of bits currently allowed to be transmitted and the number of transmission bits are determined as the number of information bits K and the number of transmission bits N, respectively.
  • the communications device determines the number of information bits K of the code block to be encoded, and the number N of transmission bits of the code block to be encoded transmitted in the actual channel, including: determining the current lookup table and the current The channel state information, the number of bits included in the sequence to be sent, and the matching number of the maximum number of bits currently allowed to be transmitted, the entries of the first lookup table include the letter Channel status information, the number of bits included in the message sequence, the maximum number of bits allowed to be transmitted, the number of information bits, and the number of transmission bits; the current channel state information in the matching entry, the number of bits included in the message sequence to be transmitted, and the current allowable
  • the number of information bits and the number of transmission bits corresponding to the maximum number of bits transmitted are determined as the number of information bits K and the number of transmission bits N, respectively.
  • the channel state information (Channel Sate Information, shorthand CSI) and the number of bits of the bit sequence to be transmitted, and the maximum number of bits currently allowed to be transmitted, wherein the number of bits of the message sequence to be transmitted is the total length of the code block to be transmitted. That is to say, the size of the number of information bits K; the maximum number of bits currently allowed to be transmitted is determined by the physical channel resources allocated by the current system and the modulation order.
  • K and N are respectively determined according to the preset correspondence in the first lookup table.
  • the first lookup table may be in the form of Table 3 below:
  • the method before determining the reliability of each of the M coded bits, the method further includes one of the following: the current channel state information, the bit included in the message sequence to be sent
  • the number of coded bits corresponding to the number and the maximum number of bits currently allowed to be transmitted is determined as the number of coded bits M;
  • the number of coded bits corresponding to the number of information bits K of the code block to be encoded, the number N of transmission bits is determined as the number of coded bits M
  • the highest transmission code rate R max , the maximum allowable code length M max , and the shortest allowable code length M min the number of coded bits after encoding the code block to be encoded is determined by the following formula:
  • R max , M max and M min are positive integers.
  • the method further includes determining, according to at least one of the following manners, the number M of coded bits after encoding the code block to be encoded:
  • the number of bits included in the message sequence, the maximum number of bits allowed to be transmitted, and the number of coded bits; the code corresponding to the current channel state information, the number of bits included in the sequence of messages to be transmitted, and the maximum number of bits currently allowed to be transmitted in the matching entry The number of bits is determined as the number M of coded bits.
  • the second lookup table can be in the form of Table 4 below:
  • a matching entry in the third lookup table that matches the number of information bits K and the number of transmission bits N of the code block to be encoded is determined, and the entries of the third lookup table include the number of information bits, the number of transmission bits, and the number of coding bits.
  • the number of coded bits corresponding to the number of information bits K and the number of transmission bits N of the code block to be encoded in the entry is determined as the number M of coded bits;
  • the third lookup table can be in the form of Table 5 below:
  • the communications device determines, according to the reliability of each bit of the N transmission bits and the correspondence between the M coding bits and the N transmission bits, determining the reliability of each of the M coding bits.
  • the method further includes: determining, according to the correspondence between the M coded bits and the N transmit bits obtained by encoding the code block to be coded, determining the coded bit sequence number set t j represents the number of the coded bits corresponding to the jth transmission bit of the N transmission bits in the M coded bits, 1 ⁇ j ⁇ N; according to the current channel state information, the length of the sequence to be transmitted, and the currently allowed transmission
  • the average reliability metric parameter ⁇ 0 of the N transmission bits is used to characterize the reliability of the N actual physical channels.
  • ⁇ 0 can calculate the average reliability of the N actual physical channels by using the channel transition probability function. It should be understood that there may be other methods for calculating the average reliability of the N actual physical channels, and the present invention is not limited thereto.
  • the fifth lookup table may also include a correspondence relationship between the number N of transmission bits, the number K of information bits, and ⁇ 0.
  • the fifth lookup table can be in the form of Table 6 below:
  • the first metric parameter sequence ⁇ 1 N is initialized, if the transmission coding sequence corresponding to the code block is known, 2 q- ary modulation is performed, and each modulation symbol corresponds to a continuous bit sequence (s 1 s 2... s q ).
  • the initial parameters of the algorithm are determined by looking up the table, a total of q values are formed. These q values are then assigned to ⁇ 1 N in terms of bit-to-symbol mapping.
  • the transmission coding sequence corresponding to the code block is 16QAM, that is, 2 4- ary modulation, and each modulation symbol corresponds to a continuous bit sequence (I 1 I 2 Q 1 Q 2 ), where I 1 (Q 1 ) is The first (Q) way data high order bit, I 2 (Q 2 ) is the first (Q) way data low order bit.
  • I 1 I 2 Q 1 Q 2 is The first (Q) way data high order bit
  • I 2 (Q 2 ) is the first (Q) way data low order bit.
  • each modulation symbol corresponding to the consecutive bit sequences (I 1 I 2 I 3 Q 1 Q 2 Q 3), wherein I 1 (Q 1 ) is the highest bit of the I (Q) way data, and I 3 (Q 3 ) is the lowest bit of the I (Q) way data.
  • the bits I 1 , I 2 , I 3 , Q 1 , Q 2 , and Q 3 respectively correspond to 6 values. versus It is then assigned to ⁇ 1 N according to the bit mapping relationship.
  • each of the transmission bits corresponds to two different values when the initial parameters of the algorithm are determined by looking up the table. Then assign a value to ⁇ 1 N according to the bit-to-symbol mapping. In this way, when the high-order modulation is performed, the mapping relationship is assigned, and the accuracy of the calculation of the reliability of the transmission bits can be improved.
  • the communications device determines, according to the reliability of each of the M coded bits, the reliability of each of the M uncoded bits corresponding to the M coded bits before encoding, including : Will the second metric sequence Performing bit reverse order reordering to obtain a third metric sequence
  • G(x 1 , x 2 ) x 1 +x 2
  • F(x 1 ,x 2 ) a(x 1 ,x 2 )x 1 +b(x 1 ,x 2 )x 2 +c( x 1 , x 2 )
  • a, b, and c are constants.
  • a, b, and c are obtained according to a correspondence between a, b, c and (x 1 , x 2 ) preset in the fourth lookup table.
  • the fourth lookup table may be in the form shown in Table 7 below:
  • the function F(x 1 , x 2 ) when calculating the metric sequence, may be defined as follows:
  • the function F(x 1 , x 2 ) when calculating the metric sequence, may also be defined as follows:
  • the function F(x 1 , x 2 ) when calculating the metric sequence, may also be defined as follows:
  • the metric sequence The bit corresponding to the K elements with the largest metric is found as the information bit.
  • the sequence number constitutes the set A, that is, for any i, j ⁇ 1, 2,..., M ⁇ , i ⁇ A, Both have ⁇ i ⁇ ⁇ j .
  • the method of the present embodiment can determine the number of information bits K of the code block to be encoded, the number N of transmission bits to be transmitted in the actual channel, and the rate adaptation rule of the code block to be encoded.
  • the reliability of each of the N transmission bits determines the reliability of each of the M uncoded bits in the code block to be encoded, thereby determining K information bits from the M uncoded bits, the information bits
  • the set A formed by the sequence number will be used for the decoding or result process of the Polar code. Therefore, embodiments of the present invention can provide a method for performing a Polar code encoding or decoding on a communication device.
  • FIG. 5 is a schematic block diagram of polarization code processing according to another embodiment of the present invention.
  • the information processing unit determines the number of transmission bits N, the number of information bits K, and the average reliability metric parameter ⁇ 0 according to the channel information lookup table by using the signaling of the network system, for example, the channel information includes the bits included in the sequence of the message to be transmitted.
  • the information processing unit calculates the number of coded bits M by the following formula according to the preset highest transmission code rate R max , the maximum allowable code length M max , and the shortest allowable code length M min :
  • the rate adaptation unit cyclically transmits the coded bit sequence in reverse order of bits, and can obtain a coded bit number set. That is, the correspondence between the M coded bits and the N transmit bits can be obtained, and the coded bit sequence set is sent to the processing unit that generates the information bit sequence, where
  • the operation of the function ⁇ m (i) is:
  • the information bit number generation unit determines the set of the Polar code information bit number:
  • the information bit number set A of size K is calculated, which specifically includes the following steps:
  • y a(x 1 ,x 2 )x 1 +b(x 1 ,x 2 )x 2 +c(x 1 ,x 2 )
  • Polar code encoding is performed based on the determined K information bit number set A.
  • the method of the present embodiment can determine the number of information bits K of the code block to be encoded, the number N of transmission bits to be transmitted in the actual channel, and the rate adaptation rule of the code block to be encoded.
  • the reliability of each of the N transmission bits determines the reliability of each of the M uncoded bits in the code block to be encoded, thereby determining K information bits from the M uncoded bits, the information bits
  • the set A formed by the sequence number will be used for the decoding or result process of the Polar code. Therefore, embodiments of the present invention can provide a method for performing a Polar code encoding or decoding on a communication device.
  • FIG. 6 is a schematic diagram showing the performance of a polarization code processing method according to an embodiment of the present invention.
  • FIG. 6 a method for performing approximate calculation on determining a signal-to-noise ratio (Eb/N0) and a frame error rate (FER) of an information bit according to an embodiment of the present invention is shown, wherein The abscissa is the signal to noise ratio and the ordinate is the frame error rate.
  • the figure shows the transmission bit N bit 2018, the information bit K is 1024, the transmission bit N bit 512, the information bit K is 256, the transmission bit N bit 1024, the information bit K is 512, the embodiment of the present invention
  • the comparison between the approximate calculation method and the performance of the Polar code coding using the accurate calculation method is shown in the figure.
  • the comparison results of the nine points are shown in the figure. It can also be seen that the calculation result of the embodiment of the present invention is basically consistent with the accurate calculation result.
  • FIG. 7 is a schematic block diagram of a device for processing a polarization code according to an embodiment of the present invention. As shown in FIG. 7, the device 700 includes:
  • the obtaining unit 710 is configured to determine the number K of information bits of the code block to be encoded, the number N of transmission bits to be transmitted in the actual channel, and the rate adaptation rule of the code block to be encoded, where the coding is to be encoded.
  • the code block includes M uncoded bits, and the rate adaptation rule of the code block to be coded is used to represent the correspondence between the M coded bits obtained by encoding the M uncoded bits and the N transmission bits.
  • the determining unit 720 is configured to determine the reliability of each of the M coded bits according to the reliability of each of the N transmission bits and the correspondence between the M coded bits and the N transmission bits.
  • the determining unit 720 is further configured to determine, according to the reliability of each of the M coded bits, the reliability of each of the M uncoded bits corresponding to the M coded bits before encoding, and according to the M uncoded
  • the reliability of each bit in the bit, K bits are determined from the M uncoded bits as information bits, where M, N, K are positive integers.
  • the method of the present embodiment can determine the number of information bits K of the code block to be encoded, the number N of transmission bits to be transmitted in the actual channel, and the rate adaptation rule of the code block to be encoded.
  • the reliability of each of the N transmission bits determines the reliability of each of the M uncoded bits in the code block to be encoded, thereby determining K information bits from the M uncoded bits, the information bits
  • the set A formed by the sequence number will be used for the decoding or result process of the Polar code. Therefore, embodiments of the present invention can provide a method for performing a Polar code encoding or decoding on a communication device.
  • the correspondence between the M coding bits and the N transmission bits includes one of the following: the N transmission bits are in one-to-one correspondence with the N bits included in the first bit sequence, A bit sequence consists of M coded bits and the first NM coded bits of the M coded bits; N transmit bits are in one-to-one correspondence with N bits included in the second bit sequence, and the second bit sequence is composed of M coded bits And consisting of the last NM coded bits of the M coded bits.
  • the acquiring unit 710 is configured to: the number of information bits and the transmission bit corresponding to the current channel state information, the number of bits included in the message sequence to be transmitted, and the maximum number of bits currently allowed to be transmitted.
  • the number is determined as the number of information bits K and the number N of transmission bits, respectively.
  • the determining unit 720 is configured to: determine, as the coding, the number of coding bits corresponding to the current channel state information, the number of bits included in the to-be-sent message sequence, and the maximum number of bits currently allowed to be transmitted. Number of bits M;
  • the number of coded bits after encoding the code block to be encoded is determined by:
  • R max , M max and M min are positive integers.
  • the determining unit 720 is configured to: determine, according to a correspondence between the M coded bits obtained by encoding the code block to be encoded and the N transmit bits, the coded bit sequence number set.
  • the determining unit 720 is configured to: use the second metric sequence Performing bit reverse order reordering to obtain a third metric sequence
  • bit interval ⁇ bit interval 1 ⁇ i 1 ⁇ log 2 M, i 1 , i 2, i 3 is a positive integer
  • bit interval 1 ⁇ i 1 ⁇ log 2 M, i 1 , i 2, i 3 is a positive integer
  • i 1 p, 1 ⁇ i 2 ⁇ M / (2 ⁇ (p)), wherein, 1 ⁇ p ⁇ log 2 M
  • i 2 q, 1 ⁇ i 3 ⁇ (q)
  • ⁇ k is obtained by the following equation, where 1 ⁇ k ⁇ M:
  • G(x 1 , x 2 ) x 1 +x 2
  • F(x 1 ,x 2 ) a(x 1 ,x 2 )x 1 +b(x 1 ,x 2 )x 2 +c( x 1 , x 2 )
  • a, b, and c are constants.
  • the determining unit 720 is configured to: find, in the fourth metric sequence ⁇ 1 M , a bit corresponding to the K elements having the largest value as the information bits.
  • the device 700 can be used to perform various processes and/or steps corresponding to the network device in the foregoing method embodiments. To avoid repetition, details are not described herein again.
  • the method communication device of this embodiment determines the number of information bits K of the code block to be encoded, the number N of transmission bits to be transmitted in the actual channel, and the rate adaptation rule of the code block to be encoded. Can be determined by the reliability of each of the N transmission bits The reliability of each of the M uncoded bits in the code block to be encoded, thereby determining K information bits from the M uncoded bits, the set A of the sequence number of the information bits will be used for translation of the Polar code Code or result process. Therefore, embodiments of the present invention can provide a method for performing a Polar code encoding or decoding on a communication device.
  • FIG. 8 is a schematic diagram of a network device according to another embodiment of the present invention.
  • an embodiment of the present invention further provides a network device 800, where the network device 800 includes a processor 801 and a memory 802.
  • the memory 802 is used to store instructions, and the processor 801 is configured to execute instructions stored in the memory 802.
  • the processor 801 is configured to: the number of information bits K of the code block to be encoded, the number N of transmission bits to be transmitted in the actual channel, and the rate adaptation rule of the code block to be encoded, where the code to be coded
  • the rate adaptation rule of the block is used to determine the correspondence between the M coded bits and the N transmit bits obtained by encoding the code block to be coded.
  • the processor 801 is further configured to: determine the reliability of each bit according to the N transmit bits. And a correspondence between the M coded bits and the N transmit bits, determining the reliability of each of the M coded bits; determining, according to the reliability of each of the M coded bits, the M coded bits before encoding The reliability of each bit of the M uncoded bits, and determining K bits from the M uncoded bits as information bits according to the reliability of each of the M uncoded bits, wherein the code block to be coded includes M uncoded bits, M, N, K are positive integers.
  • the method of the present embodiment can determine the number of information bits K of the code block to be encoded, the number N of transmission bits to be transmitted in the actual channel, and the rate adaptation rule of the code block to be encoded.
  • the reliability of each of the N transmission bits determines the reliability of each of the M uncoded bits in the code block to be encoded, thereby determining K information bits from the M uncoded bits, the information bits
  • the set A formed by the sequence number will be used for the decoding or result process of the Polar code. Therefore, embodiments of the present invention can provide a method for performing a Polar code encoding or decoding on a communication device.
  • the processor 801 may be a central processing unit (“CPU"), and the processor 801 may also be other general-purpose processors, digital signal processors (DSPs). , an application specific integrated circuit (ASIC), an off-the-shelf programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic device, discrete hardware component, and the like.
  • the general purpose processor may be a microprocessor or the processor or any conventional processor or the like.
  • the memory 802 can include read only memory and random access memory and provides instructions and data to the processor 801. A portion of the memory 802 may also include a non-volatile random access memory. For example, the memory 802 can also store information of the device type.
  • each step of the foregoing method may be completed by an integrated logic circuit of hardware in the processor 801 or an instruction in a form of software.
  • the steps of the method disclosed in the embodiments of the present invention may be directly implemented as a hardware processor, or may be performed by a combination of hardware and software modules in the processor.
  • the software module can be located in a conventional storage medium such as random access memory, flash memory, read only memory, programmable read only memory or electrically erasable programmable memory, registers, and the like.
  • the storage medium is located in memory 802, and processor 801 reads the information in memory 802 and, in conjunction with its hardware, performs the steps of the above method. To avoid repetition, it will not be described in detail here.
  • the mapping relationship between the M coding bits and the N transmission bits includes any one of the following: the N transmission bits are in one-to-one correspondence with the N bits included in the first bit sequence, and the first The bit sequence is composed of M coded bits and the first NM coded bits of the M coded bits; the N transmit bits are in one-to-one correspondence with the N bits included in the second bit sequence, and the second bit sequence is composed of M coded bits and The last NM coded bits of the M coded bits are composed.
  • the processor 801 is specifically configured to: determine, in the first lookup table, the current channel state information, the number of bits included in the to-be-sent message sequence, and the maximum number of bits currently allowed to be transmitted. Matching the entry, the entry of the first lookup table includes channel state information, the number of bits included in the message sequence, the maximum number of bits allowed to be transmitted, the number of information bits, and the number of transmission bits; and the current channel state in the matching entry.
  • the information, the number of bits included in the sequence of messages to be transmitted, and the number of information bits and the number of transmission bits corresponding to the maximum number of bits currently allowed to be transmitted are respectively determined as the number of information bits K and the number N of transmission bits.
  • the processor 801 is specifically configured to: determine, in the second lookup table, the current channel state information, the number of bits included in the to-be-sent message sequence, and the maximum number of bits currently allowed to be transmitted. Matching the entry, the entry of the second lookup table includes channel state information, the number of bits included in the message sequence, the maximum number of bits allowed to be transmitted, and the number of coded bits; the current channel state information in the matching entry and the to-be-sent The number of bits included in the message sequence and the number of coded bits corresponding to the maximum number of bits currently allowed to be transmitted are determined as the number of coded bits M;
  • the entries of the third lookup table include the number of information bits, the number of transmission bits, and the number of coding bits;
  • the number of coding bits corresponding to the number of information bits K and the number of transmission bits N of the code block to be coded is determined as the number of coded bits M;
  • the number of coded bits after encoding the code block to be encoded is determined by:
  • R max , M max and M min are positive integers.
  • the processor 801 is specifically configured to: determine a coded bit sequence number set according to a correspondence between the M coded bits obtained by encoding the code block to be coded and the N transmit bits.
  • t j represents the number of the coded bits corresponding to the jth transmission bit of the N transmission bits in the M coded bits, 1 ⁇ j ⁇ N;
  • the processor 801 is specifically configured to: use the second metric sequence Performing bit reverse order reordering to obtain a third metric sequence
  • bit interval ⁇ bit interval 1 ⁇ i 1 ⁇ log 2 M, i 1 , i 2, i 3 is a positive integer
  • i 1 p, 1 ⁇ i 2 ⁇ M / (2 ⁇ (p)), wherein, 1 ⁇ p ⁇ log 2 M
  • i 2 q, 1 ⁇ i 3 ⁇ (q), where 1 ⁇ q ⁇ M/(2 ⁇ (p))
  • generating a fourth metric sequence ⁇ k is used to characterize the reliability of the kth bit of the M uncoded bits, and ⁇ k is obtained by the following equation, where 1 ⁇ k ⁇ M:
  • G(x 1 , x 2 ) x 1 +x 2
  • F(x 1 ,x 2 ) a(x 1 ,x 2 )x 1 +b(x 1 ,x 2 )x 2 +c( x 1 , x 2 )
  • a, b, and c are constants.
  • the processor 801 is specifically configured to: from the fourth metric sequence The bit corresponding to the K elements with the largest metric is found as the information bit.
  • the network device 800 can be used to perform various processes and/or steps corresponding to the network device in the foregoing method embodiments. To avoid repetition, details are not described herein again.
  • the communication device determines the number of information bits K of the code block to be encoded, and the code block to be encoded is in the actual letter.
  • the number of transmission bits N transmitted in the channel and the rate adaptation rule of the code block to be encoded can determine the bit of each of the M uncoded bits in the code block to be coded by the reliability of each of the N transmission bits. Reliability, whereby K information bits are determined from the M uncoded bits, and the set A of the sequence numbers of the information bits will be used for the decoding or result process of the Polar code. Therefore, embodiments of the present invention can provide a method for performing a Polar code encoding or decoding on a communication device.
  • RAM random access memory
  • ROM read only memory
  • EEPROM electrically programmable ROM
  • EEPly erasable programmable ROM registers
  • hard disk removable disk
  • CD-ROM computer-readable media

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Quality & Reliability (AREA)
  • Error Detection And Correction (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

本实施例的方法通过确定待编码码块的信息比特数目K、待编码码块在实际信道中进行传输的传输比特数目N和待编码码块的速率适配规则，能够由N个传输比特中每个比特的可靠性，确定出待编码码块中M个未编码比特中每个比特的可靠性，从而从这M个未编码比特中确定K个信息比特，该信息比特的序号所构成的集合A将用于Polar码的译码或结果过程。因此，本发明实施例能够提供一种通信设备在线进行Polar码编码或译码的方法。

Description

极化码处理的方法及通信设备
本申请要求于2015年12月10日提交中国专利局、申请号为201510915896.0、发明名称为“极化码处理的方法及通信设备”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本发明实施例涉及通信领域，并且更具体地，涉及极化Polar码的处理方法及通信设备。
背景技术
通信系统通常采用信道编码提高数据传输的可靠性，保证通信的质量。Polar码是可以取得香农容量且具有低编译码复杂度的编码方式。Polar码是一种线性块码。其生成矩阵为GN.，其编码过程为
Figure PCTCN2016106174-appb-000001
其中，
Figure PCTCN2016106174-appb-000002
是一个二进制的行矢量，
Figure PCTCN2016106174-appb-000003
码长N＝2n，n≥0。
Figure PCTCN2016106174-appb-000004
BN是一个N×N转置矩阵，例如比特反转(bit reversal)矩阵。
Figure PCTCN2016106174-appb-000005
是F2的克罗内克幂(Kronecker power)，定义为
Figure PCTCN2016106174-appb-000006
Polar码的编码过程中，
Figure PCTCN2016106174-appb-000007
中的一部分比特用来携带信息，称为信息比特，这些信息比特的序号的集合记作A；另外的一部分比特置为收发端预先约定的固定值，称之为固定比特，其序号的集合用A的补集Ac表示。不失一般性，这些固定比特通常被设为0。实际上，只需要收发端预先约定，固定比特序列可以被任意设置。从而，Polar码的编码比特序列可通过如下方法得到：
Figure PCTCN2016106174-appb-000008
这里uA为
Figure PCTCN2016106174-appb-000009
中的信息比特集合，uA为长度K的行矢量，即|A|＝K，|·|表示集合中元素的个数，即K表示集合A中元素的个数，也表示待编码信息比特的数目，也GN(A)是矩阵GN中由集合A中的索引对应的那些行得到的子矩阵，GN(A)是一个K×N的矩阵。集合A的选取决定了Polar码的性能。
Polar码最基本的译码是SC译码。SC译码算法利用从信道中接收到的信号序列
Figure PCTCN2016106174-appb-000010
逐个对
Figure PCTCN2016106174-appb-000011
中的各个比特进行译码、得到
Figure PCTCN2016106174-appb-000012
的估计序列
Figure PCTCN2016106174-appb-000013
对序号i从1到N，逐个进行以下译码判决
Figure PCTCN2016106174-appb-000014
其中，
Figure PCTCN2016106174-appb-000015
上式中，
Figure PCTCN2016106174-appb-000016
为比特ui所对应的极化信道的信道转移概率函数。极化信道的转移概率函数
Figure PCTCN2016106174-appb-000017
根据用以传输编码比特的原始信道的转移概率函数W(y|x)按下式得到：
Figure PCTCN2016106174-appb-000018
其中，如前所述，
Figure PCTCN2016106174-appb-000019
和
Figure PCTCN2016106174-appb-000020
的对应关系
Figure PCTCN2016106174-appb-000021
{0,1}N-i表示N-i个集合{0,1}的笛卡尔(Cartesian)乘积。
在现有技术中，信息比特序号集合A按以下方法选取：首先根据信道转移概率函数利用密度进化或者高斯近似等方法可以得到序号i的比特对应的极化信道在发送比特0时，接收信号对数似然比LLRi＝ln(W(i)(y|0)/W(i)(y|1))的的概率密度分布函数pi(l)，并据此计算该极化信道的传输错误概率
Figure PCTCN2016106174-appb-000022
选择
Figure PCTCN2016106174-appb-000023
值最小的K个序号，构成集合A。
然而，在实际通信系统中，信号发送端和接收端难以同时准确地对信道转移函数进行实时准确地估计。更进一步地，在实际系统中Polar码的码长不一定为2的幂次，因此实际上信息比特序号的确定还涉及母码码长的确定以及速率适配方案。最后，无论是高斯近似还是密度进化，或是其它的如Tal、Vardy提出的构造方法都需要做大量的高精度浮点计算，甚至是积分等，因此，在实际系统中，无法通过该方法进行实时地计算。
在现有的通信系统中，发送端根据接收端反馈的信道状态信息，结合待发送消息序列的长度以及可使用的物理信道资源等信息，确定信道编码的码长、码率。位于发送端的编码器根据码长、码率对待传输的消息序列进行编码。由于不同的码长、码率对应了不同的编码码本，因此需要编码器存有所有码本的信息。同样地，译码器为了能够对接收到的信道进行译码，也需要存储所有的码本。
Polar码的码本取决于母码码长M和信息比特序号集合A。已有的Polar码方案无论是信息比特序号集合还是速率适配时的比特选择顺序都不能通过简单的方法计算得到。因此，对所有可能的码长、码率，Polar码编码器和译码器均需要存储一个对应的信息比特序号集合和一个速率适配表。这些信息比特序号集合和速率适配表示按实际系统需求以及工作信噪比区间，通过一定的原则选取一组参数以离线的形式预先通过密度近似进行构造。
为了支持系统要求的所有码长、码率的组合，需要为Polar码编译码以及速率适配存储的查找表数目巨大。这样的存储开销，对于硬件系统实现是不可容忍的。
发明内容
本发明实施例提供一种极化码的处理方法，能够用于对极化码的编码和译码。
第一方面，提供了一种极化码处理的方法，包括：通信设备确定待编码码块的信息比特数目K、所述待编码码块在实际信道中进行传输的传输比特数目N和所述待编码码块的速率适配规则，其中，所述待编码码块包括M个未编码比特，所述待编码码块的速率适配规则用于表示所述M个未编码比特编码后得到的M个编码比特与所述N个传输比特的对应关系；所述通信设备根据所述N个传输比特中每个比特的可靠性和所述M个编码比特与所述N个传输比特的对应关系，确定所述M个编码比特中每个比特的可靠性；所述通信设备根据所述M个编码比特中每个比特的可靠性，确定所述M个编码比特进行编码前对应的M个未编码比特中每个比特的可靠性，并根据所述M个未编码比特中每个比特的可靠性，从所述M个未编码比特中确定K个比特作为信息比特，其中，M、N、K为正整数。
基于上述技术方案，本实施例的方法通过确定待编码码块的信息比特数目K、待编码码块在实际信道中进行传输的传输比特数目N和待编码码块的速率适配规则，能够由N个传输比特中每个比特的可靠性，确定出待编码码块中M个未编码比特中每个比特的可靠性，从而从这M个未编码比特中确定K个信息比特，该信息比特的序号所构成的集合A将用于Polar码的译码或结果过程。因此，本发明实施例能够提供一种通信设备在线进行Polar码编码或译码的方法。
在第一方面的第一种可能的实现方式中，所述M个编码比特与所述N个传输比特的对应关系包括下列中的一种：所述N个传输比特与第一比特序列所包括的N个比特一一对应，所述第一比特序列由所述M个编码比特和所述M个编码比特中的前N-M个编码比特组成；所述N个传输比特与第二比特序列所包括的N个比特一一对应，所述第二比特序列由所述M个编码比特和所述M个编码比特中的后N-M个编码比特组成。
也就是说，通过确定所述待编码码块编码后得到的M个编码比特与所述N个传输比特的对应关系，能够确定所述待编码码块的速率适配规则，从而能够由N个传输比特中每个比特的可靠性获得M个编码比特中每个比特的可靠性。
结合第一方面或第一方面的第一种可能的实现方式，在第一方面的第二种可能的实现方式中，所述通信设备确定待编码码块的信息比特数目K、所述待编码码块在实际信道中进行传输的传输比特数目N，包括：将与当前信道状态信息、待发送消息序列所包括的比特数目以及当前允许传输的最大比特数目相对应的信息比特数目和传输比特数目分别确定为所述信息比特数目K和所述传输比特数目N。
具体地，所述通信设备确定待编码码块的信息比特数目K、所述待编码码块在实际信道中进行传输的传输比特数目N，包括：确定第一查找表中与当前信道状态信息、待发送消息序列所包括的比特数目以及当前允许传输的最大比特数目相匹配的匹配表项，所述第一查找表的表项包括信道状态信息、消息序列所包括的比特数目、允许传输的最大比特数目、信息比特数目和传输比特数目；将所述匹配表项中与所述当前信道状态信息、所述待发送消息序列所包括的比特数目和所述当前允许传输的最大比特数目对应的信息比特数目和传输比特数目分别确定为所述信息比特数目K和所述传输比特数目N。
也就是说，通过获取物理信道资源信息，分别确定所述待编码码块的信息比特数目K和所述待编码码块在实际信道中进行传输的传输比特数目N。
物理信道资源信息包括：信道状态信息(Channel Sate Information，简写CSI)以及待发送比特消息序列比特数目，以及通信系统中当前允许传输的最大比特数目，其中，待发送消息序列比特数目也就是待发送码块的总长，当前允许传输的最大比特数目也指当前可使用的物理信道数目。
结合第一方面的第二种可能的实现方式，在所述确定所述M个编码比特中每个比特的可靠性之前，所述方法还包括下列中的一种：将与当前信道状态信息、待发送消息序列所包括的比特数目以及当前允许传输的最大比特数目相对应的编码比特数目确定为所述编码比特数目M；将与所述待编码码块的信息比特数目K、所述传输比特数目N相对应的编码比特数目确定为所述编码比特数目M；根据预先设定的最高传输码率Rmax、最大允许码长Mmax、最短允许码长Mmin，利用下式确定所述待编码码块编码后的编码比特数目M：
Figure PCTCN2016106174-appb-000024
其中，Rmax、Mmax、Mmin为正整数。
具体地，所述确定所述M个编码比特中每个比特的可靠性之前，所述方法还包括下列中的一种：确定第二查找表中与当前信道状态信息、待发送消息序列所包括的比特数目以及当前允许传输的最大比特数目相匹配的匹配表项，所述第二查找表的表项包括信道状态信息、消息序列所包括的比特数目、允许传输的最大比特数目和编码比特数目；将所述匹配表项中与所述当前信道状态信息、所述待发送消息序列所包括的比特数目和所述当前允许传输的最大比特数目对应的编码比特数目确定为所述编码比特数目M；确定第三查找表中与所述待编码码块的信息比特数目K、所述传输比特数目N相匹配的匹配表项，所述第三查找表的表项所包括信息比特数目、传输比特数目和编码比特数目；将所述表项中与所述待编码码块的信息比特数目K、所述传输比特数目N所对应的编码比特数目确定为所述编码比特数目M。
因此，网络设备确定编码比特的数目M，进一步可以根据速率适配规则确定M个编码比特与N个传输比特的对应关系。
结合第一方面的第三种可能的实现方式，在第一方面的第四种可能的实现方式中，所述通信设备根据所述N个传输比特中每个比特的可靠性和所述M个编码比特与所述N个传输比特的对应关系，确定所述M个编码比特中每个比特的可靠性，所述方法还包括：根据所述待编码码块编码后得到的M个编码比特与所述N个传输比特的对应关系，确定编码比特序列号集合
Figure PCTCN2016106174-appb-000025
tj表示所述N个传输比特中的第j个传输比特对应的编码比特在所述M个编码比特中的编号，1≤j≤N；根据所述信道状态信息、所述待发送消息序列所包括的比特数目和所述当前允许传输的最大比特数目，确定所述N个传输比特的平均可靠性度量参数λ0；确定第一度量序列λ1 N＝[λ1,λN]，其中，λi＝λ0，1≤i≤N，并且λi用于表征所述N个传输比特中第i个传输比 特的可靠性；根据所述第一度量序列，确定第二度量序列
Figure PCTCN2016106174-appb-000026
其中，mj用于表征所述M个编码比特中第j个编码比特的可靠性，
Figure PCTCN2016106174-appb-000027
这样，所述通信设备能够根据所述N个传输比特中每个比特的可靠性和所述M个编码比特与所述N个传输比特的对应关系，能够最终确定所述M个编码比特中每个比特的可靠性。
结合第一方面的第四种可能的实现方式，在第一方面的第五种可能的实现方式中，所述通信设备根据所述M个编码比特中每个比特的可靠性，确定所述M个编码比特进行编码前对应的M个未编码比特中每个比特的可靠性，包括：将所述第二度量序列
Figure PCTCN2016106174-appb-000028
进行比特反序重排列，得到第三度量序列
Figure PCTCN2016106174-appb-000029
分别构建以下参数：比特间隔Δ、序号i1、序号i2和序号i3，其中，比特间隔
Figure PCTCN2016106174-appb-000030
1≤i1≤log2M，i1、i2、i3为正整数；当i1＝p时，1≤i2≤M/(2Δ(p))，其中，1≤p≤log2M；当i2＝q时，1≤i3≤Δ(q)，其中，1≤q≤M/(2Δ(p))，生成第四度量序列
Figure PCTCN2016106174-appb-000031
μk用于表征所述M个未编码比特中第k比特的可靠性，μk通过下式得到其中，1≤k≤M：
Figure PCTCN2016106174-appb-000032
其中，G(x1,x2)＝x1+x2，F(x1,x2)＝a(x1,x2)x1+b(x1,x2)x2+c(x1,x2)，a，b，c为常数。
这样，所述通信设备能够根据所述M个编码比特中每个比特的可靠性，确定所述M个编码比特进行编码前对应的M个未编码比特中每个比特的可靠性。
结合第一方面的第六种可能的实现方式，所述从所述M个未编码比特中确定K个比特作为信息比特，包括：将所述度量序列
Figure PCTCN2016106174-appb-000033
中值最大的K个元素对应的比特作为信息比特。
所述从所述M个未编码比特中确定K个比特作为信息比特，也就是确定K个信息比特的序号集合。
本发明实施例能够确定极化码比编码过程中信息比特的确定方法，降低极化码码本信息的存储开销，避免了大规模的存储开销。
第二方面，提供一种极化码处理的通信设备，用于执行上述第一方面或第一方面的任意可能的实现方式中的方法。具体地，该装置包括用于执行上述第一方面或第一方面的任意可能的实现方式中的方法的单元。
第三方面，提出一种极化码处理的通信装置，包括存储指令的存储器和处理器，其中，所述处理器执行所述指令进行如第一方面及其上述实现方式所述的方法。
基于上述技术方案，本实施例的方法通过确定待编码码块的信息比特数目K、待编码码块在实际信道中进行传输的传输比特数目N和待编码码块的速率适配规则，能够由N个传输比特中每个比特的可靠性，确定出待编码码块中M个未编码比特中每个比特的可靠性，从而从这M个未编码比特中确定K个信息比特，该信息比特的序号所构成的集合A将用于Polar码的译码或结果过程。因此，本发明实施例能够提供一种通信设备在线进行Polar码编码或译码的方法。
附图说明
图1是根据本文所述的各个实施例的无线通信系统的示图。
图2是本发明实施的通信设备的示意性框图。
图3是现有技术的极化码处理的方法的示意性框图。
图4是本发明一个实施例的极化码处理的方法的示意性流程图。
图5是本发明另一实施例的极化码处理的方法的示意性框图。
图6是本发明实施例的极化码处理方法的性能示意图。
图7是本发明实施例的一种极化码处理的设备的示意性框图。
图8是本发明另一实施例的网络设备的示意性装置图。
具体实施方式
下面将结合附图，对本发明实施例中的技术方案进行描述。
现在参照附图描述多个实施例，其中用相同的附图标记指示本文中的相同元件。在下面的描述中，为便于解释，给出了大量具体细节，以便提供对一个或多个实施例的全面理解。然而，很明显，也可以不用这些具体细节来实现所述实施例。在其它例子中，以方框图形式示出公知结构和设备，以便于描述一个或多个实施例。
在本说明书中使用的术语"部件"、"模块"、"系统"等用于表示计算机相关的实体、硬件、固件、硬件和软件的组合、软件、或执行中的软件。例如，部件可以是但不限于，在处理器上运行的进程、处理器、对象、可执行文件、 执行线程、程序和/或计算机。通过图示，在计算设备上运行的应用和计算设备都可以是部件。一个或多个部件可驻留在进程和/或执行线程中，部件可位于一个计算机上和/或分布在2个或更多个计算机之间。此外，这些部件可从在上面存储有各种数据结构的各种计算机可读介质执行。部件可例如根据具有一个或多个数据分组(例如来自与本地系统、分布式系统和/或网络间的另一部件交互的二个部件的数据，例如通过信号与其它系统交互的互联网)的信号通过本地和/或远程进程来通信。
此外，结合接入终端描述了各个实施例。接入终端也可以称为系统、用户单元、用户站、移动站、移动台、远方站、远程终端、移动设备、用户终端、终端、无线通信设备、用户代理、用户装置或UE(User Equipment，用户设备)。接入终端可以是蜂窝电话、无绳电话、SIP(Session Initiation Protocol，会话启动协议)电话、WLL(Wireless Local Loop，无线本地环路)站、PDA(Personal Digital Assistant，个人数字处理)、具有无线通信功能的手持设备、计算设备或连接到无线调制解调器的其它处理设备。此外，结合基站描述了各个实施例。基站可用于与移动设备通信，基站可以是GSM(Global System of Mobile communication，全球移动通讯)或CDMA(Code Division Multiple Access，码分多址)中的BTS(Base Transceiver Station，基站)，也可以是WCDMA(Wideband Code Division Multiple Access，宽带码分多址)中的NB(NodeB，基站)，还可以是LTE(Long Term Evolution，长期演进)中的eNB或eNodeB(Evolutional Node B，演进型基站)，或者中继站或接入点，或者未来5G网络中的基站设备等。
此外，本发明的各个方面或特征可以实现成方法、装置或使用标准编程和/或工程技术的制品。本申请中使用的术语"制品"涵盖可从任何计算机可读器件、载体或介质访问的计算机程序。例如，计算机可读介质可以包括，但不限于:磁存储器件(例如，硬盘、软盘或磁带等)，光盘(例如，CD(Compact Disk，压缩盘)、DVD(Digital Versatile Disk，数字通用盘)等)，智能卡和闪存器件(例如，EPROM(Erasable Programmable Read-Only Memory，可擦写可编程只读存储器)、卡、棒或钥匙驱动器等)。另外，本文描述的各种存储介质可代表用于存储信息的一个或多个设备和/或其它机器可读介质。术语"机器可读介质"可包括但不限于，无线信道和能够存储、包含和/或承载指令和/或数据的各种其它介质。
现在，参照图1，示出根据本文所述的各个实施例的无线通信系统100。无线通信系统100包括基站102，基站102可包括多个天线组。每个天线组可以包括一个或多个天线，例如，一个天线组可包括天线104和106，另一个天线组可包括天线108和110，附加组可包括天线112和114。图1中对于每个天线组示出了2个天线，然而可对于每个组使用更多或更少的天线。基站102可附加地包括发射机链和接收机链，本领域普通技术人员可以理解，它们均可包括与信号发送和接收相关的多个部件(例如处理器、调制器、复用器、解调器、解复用器或天线等)。
基站102可以与一个或多个接入终端(例如接入终端116和接入终端122)通信。然而，可以理解，基站102可以与类似于接入终端116或122的任意数目的接入终端通信。接入终端116和122可以是例如蜂窝电话、智能电话、便携式电脑、手持通信设备、手持计算设备、卫星无线电装置、全球定位系统、PDA和/或用于在无线通信系统100上通信的任意其它适合设备。如图所示，接入终端116与天线112和114通信，其中天线112和114通过前向链路118向接入终端116发送信息，并通过反向链路120从接入终端116接收信息。此外，接入终端122与天线104和106通信，其中天线104和106通过前向链路124向接入终端122发送信息，并通过反向链路126从接入终端122接收信息。在FDD(Frequency Division Duplex，频分双工)系统中，例如，前向链路118可利用与反向链路120所使用的不同频带，前向链路124可利用与反向链路126所使用的不同频带。此外，在TDD(Time Division Duplex，时分双工)系统中，前向链路118和反向链路120可使用共同频带，前向链路124和反向链路126可使用共同频带。
被设计用于通信的每组天线和/或区域称为基站102的扇区。例如，可将天线组设计为与基站102覆盖区域的扇区中的接入终端通信。在基站102通过前向链路118和124分别与接入终端116和122进行通信的过程中，基站102的发射天线可利用波束成形来改善前向链路118和124的信噪比。此外，与基站通过单个天线向它所有的接入终端发送信号的方式相比，在基站102利用波束成形向相关覆盖区域中随机分散的接入终端116和122发送信号时，相邻小区中的移动设备会受到较少的干扰。
在给定时间，基站102、接入终端116或接入终端122可以是无线通信发送装置和/或无线通信接收装置。当发送数据时，无线通信发送装置可对数 据进行编码以用于传输。具体地，无线通信发送装置可获取(例如生成、从其它通信装置接收、或在存储器中保存等)要通过信道发送至无线通信接收装置的一定数目的数据比特。这种数据比特可包含在数据的传输块(或多个传输块)中，传输块可被分段以产生多个码块。
图2示出了在无线通信环境中适用本发明的传输数据的方法的系统200的示意性框图。系统200包括无线通信设备202，该无线通信设备202被显示为经由信道发送数据。尽管示出为发送数据，但无线通信设备202还可经由信道接收数据(例如，无线通信设备202可同时发送和接收数据，无线通信设备202可以在不同时刻发送和接收数据，或其组合等)。无线通信设备202例如可以是基站(例如图1的基站102等)、接入终端(例如图1的接入终端116、图1的接入终端122等)等。
无线通信设备202可包括编码器204，速率匹配装置205，发射机206。可选地，当无线通信设备202经由信道接收数据时，该无线通信设备202还可以包括一个接收机，该接收机可以单独存在，也可以与发射机206集成在一起形成一个收发机。
其中，编码器204用于对要从无线通信装置202传送的数据进行编码(具体地说是分组编码，随后对该过程进行详细说明)得到目标分组码字。
速率匹配装置205，用于对该目标分组码字进行交织和速率匹配等，以生成交织的输出比特。
此外，发射机206可随后在信道上传送经过速率匹配装置205处理后的经过速率匹配的输出比特。例如，发射机206可以将相关数据发送到其它不同的无线通信装置(未示出)。
图3是现有技术的极化码处理的方法的示意性框图。
如图3所示，在进行Polar编码时，首先，通过查找表3确定选择哪K个比特作为信息比特，也即确定K个信息比特的序列号构成的集合A。查找表3的输入参数为：未编码比特的数目为M(极化信道数目)、传输比特的数目N(实际物理信道数目)和信息比特数目K，查找表3的输出参数为：K个信息比特的序列集合。
第二步，对M个未编码比特进行Polar码编码得到M个编码比特之后，还需要速率适配获得N个传输比特与M个编码比特的对应关系。这时需要查找表4，通过输入参数：信息比特数目K，传输比特数目N和编码比特数 目M，获得编码比特的发送顺序，也即N个传输比特和M个编码比特的对应关系。
以LTE协议规定的编码块长度(即输入编码器的信息比特数目)与速率适配后可能的长度为例：信息比特数目K的可能的取值共有188种，取值范围从40到6144，母码码长取值范围在132到18444，而速率适配后可能的编码长度有3000余种。如采用本方案，为支持同样数目的码长和码率配置，需要存储3000余个长度约为几万到十几万的查找表，因此这样的存储开销极大。
图4是本发明一个实施例的极化码处理的方法的示意性流程图，图4所示的方法400可以由通信设备执行，该通信设备既可以为发送端，也可以为接收端，也即该通信设备可以是基站也可以是用户设备，同样，接收端可以是基站或用户设备，本发明并未特别限定。
该方法400包括：
S410，通信设备确定待编码码块的信息比特数目K、待编码码块在实际信道中进行传输的传输比特数目N和待编码码块的速率适配规则，其中，待编码码块包括M个未编码比特，待编码码块的速率适配规则用于表示待编码码块编码后得到的M个编码比特与N个传输比特的对应关系。
S420，通信设备根据N个传输比特中每个比特的可靠性和M个编码比特与N个传输比特的对应关系，确定M个编码比特中每个比特的可靠性。
S430，通信设备根据所述M个编码比特中每个比特的可靠性，确定M个编码比特进行编码前对应的M个未编码比特中每个比特的可靠性，并根据M个未编码比特中每个比特的可靠性，从M个未编码比特中确定K个比特作为信息比特，其中，M、N、K为正整数。
具体地，在S420中，N个传输比特中每个比特的可靠性用于衡量每个比特对应的实际物理信道的可靠性，也即指比特经过信道传输后在最大似然判决准则下的正确概率。M个编码比特与N个传输比特的对应关系是指：由于实际经过Polar码译码之后得到的M个编码比特的数目和N个传输比特数目(实际物理信道数目)不一致时，需要经过速率适配，利用M个编码比特构造出N个实际传输的传输比特，因此就会存在M个编码比特与N个传输比特之间的对应关系。
具体地，在S430中，M个未编码比特中每个比特的可靠性用于衡量每 个比特对应的极化信道的可靠性，也即指比特经过信道传输后在最大似然判决准则下的正确概率。通过M个未编码比特中每个比特的可靠性值，可以从该M个未编码比特中确定K个未编码比特作为Polar码编码或译码过程中的信息比特，也就是确定K个未编码比特对应的极化信道作为实际传输信息的信道，而剩余的M-K个比特则设置为固定比特，也可以称之为冻结比特或填充比特。K个信息比特的序号所构成的集合即为信息比特序号集合A，该集合A的选择将影响Polar码译码的性能。
其中，N、K、M分别为正整数，N为2的幂次。
基于上述技术方案，本实施例的方法通过确定待编码码块的信息比特数目K、待编码码块在实际信道中进行传输的传输比特数目N和待编码码块的速率适配规则，能够由N个传输比特中每个比特的可靠性，确定出待编码码块中M个未编码比特中每个比特的可靠性，从而从这M个未编码比特中确定K个信息比特，该信息比特的序号所构成的集合A将用于Polar码的译码或结果过程。因此，本发明实施例能够提供一种通信设备在线进行Polar码编码或译码的方法。
可选地，作为本发明一个实施例，M个编码比特与N个传输比特的对应关系包括以下任意一种：N个传输比特与第一比特序列包括的N个比特一一对应，第一比特序列由M个编码比特和M个编码比特中的前N-M个编码比特按序排列组成；
N个传输比特中的每个比特与第二比特序列所包括的N个比特一一对应，第二比特序列由M个编码比特和M个编码比特中的后N-M个编码比特按序排列组成；
N个传输比特中的每个比特与第三比特序列所包括的N个比特一一对应，第三比特序列由反序排列后的M个编码比特和反序排列后的M个编码比特中的前N-M个编码比特按序排列组成；
N个传输比特中的每个比特与第四比特序列所包括的N个比特一一对应，第四比特序列由反序排列后的M个编码比特和反序排列后的M个编码比特中的后N-M个编码比特按序排列组成。
具体地，例如，M个编码比特包括编号为t1、t2、t3、t4、t5、t6、t7、t8的这样8个比特集合[t1、t2、t3、t4、t5、t6、t7、t8]，传输比特N＝10，那么第一比特序列可以为N1＝[t1、t2、t3、t4、t5、t6、t7、t8、t1、t2]，该第一比特序 列由8个编码比特和该8个编码比特中的前两个构成。又例如，第二比特序列可以为N2＝[t1、t2、t3、t4、t5、t6、t7、t8、t7、t8]，即该第二比特序列由8个编码比特和该8个编码比中的后两个构成。又例如，第三比特序列可以为反序排列后的M个编码比特和反序排列后的M个编码比特中的前N-M个编码比特组成，M个编码比特反序后的比特集合为[t1、t5、t3、t7、t2、t6、t4、t8]，那么第三比特序列可以为N3＝[t1、t5、t3、t7、t2、t6、t4、t8、t1、t5]。又例如，第四比特序列可以为反序排列后的M个编码比特和反序排列后的M个编码比特中的后N-M个编码比特组成，M个编码比特反序后的比特集合为[t1、t5、t3、t7、t2、t6、t4、t8]，那么第三比特序列可以为N3＝[t8、t4、t6、t2、t7、t3、t5、t1、t8、t4]。
也就是说，可以将这个M个编码比特顺序(或逆序)循环发送，也可以将这M个编码比特构成的序列进行比特反序排列后顺序(或逆序)循环发送。
应理解，若启用混合自动重传请求(HARQ)机制，则需要按照速率适配规则确定已发送的N0个以及本次发送的N个，共计N0+N个发送编码比特序号
Figure PCTCN2016106174-appb-000034
应理解，上述M和N的取值仅仅是示例性的，上述M个编码比特与N个传输比特的对应关系也仅仅是列举了几种可能的情况，例如，可以将M个编码比特与N个传输比特的对应关系存储在查找表中，根据实际需要从查找表中获取M与N的对应关系，本领域技术人员还可以推知其它可能的对应关系，本发明不限于此，因此，其它可能的M个编码比特与N个传输比特的对应法则也落入本发明的保护范围。
可选地，作为本发明一个实施例，通信设备确定待编码码块的信息比特数目K、待编码码块在实际信道中进行传输的传输比特数目N，包括：将与当前信道状态信息、待发送消息序列包括的比特数目以及当前允许传输的最大比特数目相对应的信息比特数目和传输比特数目分别确定为信息比特数目K和传输比特数目N。
可选地，作为本发明一个实施例，通信设备确定待编码码块的信息比特数目K、待编码码块在实际信道中进行传输的传输比特数目N，包括：确定第一查找表中与当前信道状态信息、待发送消息序列所包括的比特数目以及当前允许传输的最大比特数目相匹配的匹配表项，第一查找表的表项包括信 道状态信息、消息序列所包括的比特数目、允许传输的最大比特数目、信息比特数目和传输比特数目；将匹配表项中与当前信道状态信息、待发送消息序列所包括的比特数目和当前允许传输的最大比特数目对应的信息比特数目和传输比特数目分别确定为信息比特数目K和传输比特数目N。
具体地，获取信道状态信息(Channel Sate Information，简写CSI)以及待发送比特消息序列比特数目，以及当前允许传输的最大比特数目，其中，待发送消息序列比特数目也就是待发送码块的总长，也就是说信息比特数目K的大小；当前允许传输的最大比特数目，是由当前系统分配的物理信道资源以及调制阶数决定的。本发明不限于此，其它可以推知信道状态信息、待发送消息比特数据或允许传输的最大比特数目的物理信道参数也落入本发明的范围。进一步的，按照第一查找表中预设的对应关系，分别确定K和N，例如，第一查找表可以为以下表3形式：
表3
Figure PCTCN2016106174-appb-000035
应理解，上述表3中的数值仅仅是示例性的，本发明不限于此。
可选地，作为本发明一个实施例，确定M个编码比特中每个比特的可靠性之前，上述方法还包括下列中的一种：将与当前信道状态信息、待发送消息序列所包括的比特数目以及当前允许传输的最大比特数目相对应的编码比特数目确定为编码比特数目M；将与待编码码块的信息比特数目K、传输比特数目N相对应的编码比特数目确定为编码比特数目M；根据最高传输码率Rmax、最大允许码长Mmax、最短允许码长Mmin，利用下式确定待编码码块编码后的编码比特数目M：
Figure PCTCN2016106174-appb-000036
其中，Rmax、Mmax、Mmin为正整数。
可选地，作为本发明一个实施例，方法还包括，根据以下至少一种方式，确定待编码码块编码后的编码比特数目M：
(1)、根据信道状态信息、待发送消息序列比特数目以及允许传输的最大比特数目，按照第二查找表中预设的对应关系，确定待编码码块编码后的编码比特数目M；
也就是，确定第二查找表中与当前信道状态信息、待发送消息序列所包括的比特数目以及当前允许传输的最大比特数目相匹配的匹配表项，第二查找表的表项包括信道状态信息、消息序列包括的比特数目、允许传输的最大比特数目和编码比特数目；将匹配表项中与当前信道状态信息、待发送消息序列所包括的比特数目和当前允许传输的最大比特数目对应的编码比特数目确定为所述编码比特数目M。
例如，第二查找表可以为以下表4形式：
表4
Figure PCTCN2016106174-appb-000037
应理解，上述表4中的数值仅仅是示例性的，本发明不限于此。
(2)、根据待编码码块的信息比特数目K、待编码码块在实际信道中进行传输的传输比特数目N，按照第三查找表中预设对应关系，确定待编码码块编码后的编码比特数目M；
也就是，确定第三查找表中与待编码码块的信息比特数目K、传输比特数目N相匹配的匹配表项，第三查找表的表项包括信息比特数目、传输比特数目和编码比特数目；将表项中与所述待编码码块的信息比特数目K、传输比特数目N所对应的编码比特数目确定为编码比特数目M；
例如，第三查找表可以为以下表5形式：
表5
Figure PCTCN2016106174-appb-000038
应理解，上述表5中的数值仅仅是示例性的，本发明不限于此。
(3)、根据预先设定的系统的最高传输码率Rmax、最大允许码长Mmax、最短允许码长Mmin，利用下式确定待编码码块编码后的编码比特数目M：
Figure PCTCN2016106174-appb-000039
可选地，作为本发明一个实施例，通信设备根据N个传输比特中每个比特的可靠性和M个编码比特与N个传输比特的对应关系，确定M个编码比特中每个比特的可靠性，方法还包括：根据待编码码块编码后得到的M个编码比特与N个传输比特的对应关系，确定编码比特序列号集合
Figure PCTCN2016106174-appb-000040
tj表示N个传输比特中的第j个传输比特对应的编码比特在M个编码比特中的编号，1≤j≤N；根据当前信道状态信息、待发送消息序列包括的长度和当前允许传输的最大比特数目，确定N个传输比特的平均可靠性度量参数λ0；确定第一度量序列λ1 N＝[λ1,λN]，其中，λi＝λ0，1≤i≤N，并且λi用于表征N个传输比特中第i个传输比特的可靠性；根据第一度量序列，确定第二度量序列
Figure PCTCN2016106174-appb-000041
其中，mj用于表征M个编码比特中第j个编码比特的可靠性，
Figure PCTCN2016106174-appb-000042
具体地，N个传输比特的平均可靠性度量参数λ0用于表征N个实际物理信道的可靠性，一般来说λ0可以通过信道转移概率函数计算得到N个实际物理信道的平均可靠性，应理解，还可以有其它的方法计算得到N个实际物理信道的平均可靠性，本发明不限于此。
具体地，确定第一度量序列λ1 N＝[λ1,λN]初值可以通过预先存储的第四查找表，根据信道状态信息、待发送消息序列所包括的比特数目以及允许发送的最大比特数目，查找第五查找表，确定N个传输比特的平均可靠性度量参数λ0，并为序列λ1 N的每个元素赋值，使得λi＝λ0。该第五查找表也可以包括传输比特数目N、信息比特数目K和λ0的对应关系，通过传输比特数目N、 信息比特数目K确定第一度量序列λ1 N＝[λ1，λN]
例如，第五查找表可以如下表6形式：
表6
信道状态 发送比特数 最大比特数 λ0
0 128 768 5
0 136 768 6
… … … …
7 16384 32768 19
… … … …
应理解，上述表6中的数值仅仅是示例性的，本发明不限于此。
可选地，在初始化第一度量参数序列λ1 N时，若已知该码块对应的发送编码序列之后会进行2q进制调制，每一个调制符号对应连续的比特序列(s1s2…sq)。在查表确定算法初始参数时，共构成q个值
Figure PCTCN2016106174-appb-000043
然后按照比特到符号的映射关系将这q个值赋给λ1 N。
例如，已知该码块对应的发送编码序列为16QAM，即24进制调制，每一个调制符号对应连续的比特序列(I1I2Q1Q2)，其中I1(Q1)为第I(Q)路数据高位比特，I2(Q2)为第I(Q)路数据低位比特。在查表确定算法初始参数时，I、Q两路的高位比特对应为两个值
Figure PCTCN2016106174-appb-000044
低位比特分别对应为两个值
Figure PCTCN2016106174-appb-000045
与
Figure PCTCN2016106174-appb-000046
然后按照比特映射关系赋值给λ1 N。
又如，若已知该码块对应的编码序列为64QAM，即26进制调制，每一个调制符号对应连续的比特序列(I1I2I3Q1Q2Q3)，其中I1(Q1)为I(Q)路数据最高位比特，I3(Q3)为I(Q)路数据最低位比特。在查表确定算法初始参数时，比特I1、I2、I3、Q1、Q2、Q3分别对应为6个值
Figure PCTCN2016106174-appb-000047
Figure PCTCN2016106174-appb-000048
与
Figure PCTCN2016106174-appb-000049
然后按照比特映射关系赋值给λ1 N。
当进行2q调制时，在查表确定算法初始参数时，每个传输比特分别对应为两个不同的值
Figure PCTCN2016106174-appb-000050
然后按照比特到符号的映射关系赋值给λ1 N。这样在进行高阶调制时按照映射关系赋值，能够提高进行传输比特可靠性计算的精确度。
可选地，作为本发明一个实施例，通信设备根据M个编码比特中每个比特的可靠性，确定M个编码比特进行编码前对应的M个未编码比特中每 个比特的可靠性，包括：将第二度量序列
Figure PCTCN2016106174-appb-000051
进行比特反序重排列，得到第三度量序列
Figure PCTCN2016106174-appb-000052
分别构建以下参数：比特间隔Δ、序号i1、序号i2和序号i3，其中，比特间隔
Figure PCTCN2016106174-appb-000053
1≤i1≤log2M，i1、i2、i3为正整数；当i1＝p时，1≤i2≤M/(2Δ(p))，其中，1≤p≤log2M；当i2＝q时，1≤i3≤Δ(q)，其中，1≤q≤M/(2Δ(p))，生成第四度量序列
Figure PCTCN2016106174-appb-000054
μk用于表征M个未编码比特中第k比特的可靠性，μk通过下式得到其中，1≤k≤M：
Figure PCTCN2016106174-appb-000055
其中，G(x1,x2)＝x1+x2，F(x1,x2)＝a(x1,x2)x1+b(x1,x2)x2+c(x1,x2)，a，b，c为常数。
可选地，a，b，c按照第四查找表中预设的a，b，c与(x1,x2)的对应关系得到。
具体地，函数F(x1,x2)＝a(x1,x2)x1+b(x1,x2)x2+c(x1,x2)是二维平面函数，其中a，b，c按照第四查找表中预设的a，b，c与(x1,x2)的对应关系得到，例如，第四查找表可以如下表7所示的形式：
表7
x1 x2 a b c
0 1 0 2 1
0 2 0 4 2
… … … … …
2 0 4 0 2
2 1 4 2 3
2 2 4 4 1
… … … … …
可选地，作为本发明一个实施例，在计算度量序列时，函数F(x1,x2)可以按以下方法定义：
(1)确定参数x1、x2的取值区间分割方案，各区间的分隔点为(f1,f2,…,fQ)，其中，fQ的取值根据参数x1(或等价地，x2)的取值范围确定，一般取fQ以99.9％的概率大于x1(x2)，其余分割点f1,f2,...,fQ-1按等比(或等分、或黄金分割)关系将区间[0,fQ]分成Q个取值区间。如此共得到(f0＝0,f1]、 (f1,f2]、(f2,f3]、…、(fQ-1,fQ]共Q个取值区间；
(2)分别确定x1和x2的取值区间索引i、j，使得fi-1＜x1≤fi，fj-1＜x2≤fj，若x1(或x2)的值大于fQ则置i＝Q(或j＝Q)；
(3)根据i、j查找第四查找表确定参数ai,j、bi,j、ci,j，其中表{ai,j}{bi,j}{ci,j}为Q×Q的对称矩阵；
(4)从而F(x1,x2)＝ai,jx1+bi,jx2+ci,j。
可选地，作为本发明一个实施例，在计算度量序列时，函数F(x1,x2)还可以按以下方法定义：
(1)确定参数x1、x2的取值区间分割方案，各区间的分隔点为(f1,f2,…,fQ)，如此共得到(f0＝0,f1]、(f1,f2]、(f2,f3]、…、(fQ-1,fQ]共Q个取值区间；
(2)令z1＝min(x1,x2)，z2＝max(x1,x2)；
(3)分别确定z1和z2的取值区间索引i、j，使得fi-1＜z1≤fi，fj-1＜z2≤fj，若z1(或z2)的值大于fQ则置i＝Q(或j＝Q)；
(4)根据i、j查找第四查找表确定参数ai,j、bi,j、ci,j，其中表{ai,j}{bi,j}{ci,j}为Q×Q的上三角矩阵；
(5)从而F(x1,x2)＝ai,jx1+bi,jx2+ci,j。
可选地，作为本发明一个实施例，在计算度量序列时，函数F(x1,x2)还可以按以下方法定义：
(1)确定参数x1、x2的取值区间分割方案，各区间的分隔点为(f1,f2,…,fQ)，如此共得到(f0＝0,f1]、(f1,f2]、(f2,f3]、…、(fQ-1,fQ]共Q个取值区间；
(2)令z1＝max(x1,x2)，z2＝min(x1,x2)；
(3)分别确定z1和z2的取值区间索引i、j，使得fi-1＜z1≤fi，fj-1＜z2≤fj，若z1(或z2)的值大于fQ则置i＝Q(或j＝Q)；
(4)根据i、j查找第四查找表确定参数ai,j、bi,j、ci,j，其中表{ai,j}{bi,j}{ci,j}为Q×Q的下三角矩阵；
(5)从而F(x1,x2)＝ai,jx1+bi,jx2+ci,j。
可选地，作为本发明一个实施例，从度量序列
Figure PCTCN2016106174-appb-000056
中找出度量值最大的K个元素对应的比特作为信息比特。
具体地，从度量序列
Figure PCTCN2016106174-appb-000057
中找出值最大的K个元素，其序号构成集合A， 即对任意i,j∈{1,2,…,M},i∈A,
Figure PCTCN2016106174-appb-000058
均有μi≥μj。
应理解，以上过程中所述的各查找表与计算规则均同时存储于信号发送端和接收端。
基于上述技术方案，本实施例的方法通过确定待编码码块的信息比特数目K、待编码码块在实际信道中进行传输的传输比特数目N和待编码码块的速率适配规则，能够由N个传输比特中每个比特的可靠性，确定出待编码码块中M个未编码比特中每个比特的可靠性，从而从这M个未编码比特中确定K个信息比特，该信息比特的序号所构成的集合A将用于Polar码的译码或结果过程。因此，本发明实施例能够提供一种通信设备在线进行Polar码编码或译码的方法。
图5是本发明另一实施例的极化码处理的示意性框图。
下面通过具体例子具体地，如图5所示，进行Polar编码时，需要输入K个信息比特，在Polar编码单元中进行Polar码编码，得到M个编码比特，这个M个编码比特通过速率适配单元进行速率适配得到N个传输比特。
而我们获得K个信息比特的具体方式如下：
(1)信息处理单元利用网络系统的信令，根据信道信息查表确定传输比特数目N、信息比特数目K和平均可靠性度量参数λ0，例如，信道信息包括待发送消息序列所包括的比特数目、当前允许传输的最大比特数量和调制编码集索引IMCS、物理资源块数目INPRB，其中，IMCS和INPRB共同决定了当前允许传输的最大比特数。
(2)信息处理单元根据预先设定的最高传输码率Rmax、最大允许码长Mmax、最短允许码长Mmin，利用下述公式计算得到编码比特数目M：
Figure PCTCN2016106174-appb-000059
(3)速率适配单元将编码比特序列按照比特反序排列后按顺序循环发送，能够得到编码比特序号集合
Figure PCTCN2016106174-appb-000060
也即能够得到M个编码比特和N个传输比特的对应关系，发送该编码比特序号集合至生成信息比特序号的处理单元，其中，
Figure PCTCN2016106174-appb-000061
函数πm(i)的操作为：
将参数i展开为m比特二进制序列i＝(b1b2…bm)2，b1为最高有效位(Most Significant Bit，MSB)；将该二进制序列反序后以bm为最高位并转为十进制系数j＝πm(i)＝(bmbm-1…b1)2。
(4)信息比特序号生成单元确定Polar码信息比特序号的集合：
根据N、K、M、
Figure PCTCN2016106174-appb-000062
以及λ0，计算得到大小为K的信息比特序号集合A，具体包括以下步骤：
(4.1)生成第一度量序列
Figure PCTCN2016106174-appb-000063
其中对所有i∈{1,2,…,N}，λi＝λ0；
(4.2)生成第二度量序列
Figure PCTCN2016106174-appb-000064
其中，各元素取值为：
Figure PCTCN2016106174-appb-000065
其中，j∈{1,2,…,M}；将序列
Figure PCTCN2016106174-appb-000066
进行比特反序重排得到第三度量序列
Figure PCTCN2016106174-appb-000067
(4.3)令序号i从1到log2M取值，循环执行以下操作：
(4.3.1)令比特间隔
Figure PCTCN2016106174-appb-000068
并利用(4.3.2)的方式构造第四量序列
Figure PCTCN2016106174-appb-000069
(4.3.2)令序号j从1到N/(2Δ)取值，顺序执行(4.3.2.1)的操作：
(4.3.2.1)令序号k从1到Δ取值，顺序执行以下操作：
Figure PCTCN2016106174-appb-000070
函数y＝G(x1,x2)定义为y＝x1+x2；函数y＝F(x1,x2)定义为一组二维平面函数：
y＝a(x1,x2)x1+b(x1,x2)x2+c(x1,x2)
系数a(x1,x2)、b(x1,x2)、c(x1,x2)的值与(x1,x2)的关系，通过预先设计的查找表得到。
(4.3.3)用
Figure PCTCN2016106174-appb-000071
的值更新
Figure PCTCN2016106174-appb-000072
即对所有i∈{1,2,…,N}，令νi＝μi。
(4.4)从度量序列
Figure PCTCN2016106174-appb-000073
中找出值最大的K个元素，其序号构成集合A， 即对任意i,j∈{1,2,…,M},i∈A,
Figure PCTCN2016106174-appb-000074
均有μi≥μj。
应理解，以上过程中所述的各查找表与计算规则均同时存储于信号发送端和接收端。
在发端时，(5)根据确定的K个信息比特序号集合A，进行Polar码编码。
在接收端时，(5)根据确定的K个信息比特序号集合A，进行Polar码译码。
基于上述技术方案，本实施例的方法通过确定待编码码块的信息比特数目K、待编码码块在实际信道中进行传输的传输比特数目N和待编码码块的速率适配规则，能够由N个传输比特中每个比特的可靠性，确定出待编码码块中M个未编码比特中每个比特的可靠性，从而从这M个未编码比特中确定K个信息比特，该信息比特的序号所构成的集合A将用于Polar码的译码或结果过程。因此，本发明实施例能够提供一种通信设备在线进行Polar码编码或译码的方法。
图6是本发明实施例的极化码处理方法的性能示意图。
如图6所示，示出了本发明实施例的方法进行近似计算确定信息比特的得到的信噪比(Eb/N0)和误帧率(Frame Error Rate，FER)之间的关系图，其中横坐标为信噪比，纵坐标为误帧率。图中分别列出了传输比特N位2018，信息比特K为1024时，传输比特N位512，信息比特K为256时，传输比特N位1024，信息比特K为512时，本发明实施例的近似计算方法和采用精确计算方法进行Polar码编码的性能进行比较的示意图，图中给出了9个点的比较结果，也可以看到本发明实施例的计算结果与精确计算结果基本一致。
图7是本发明实施例的一种极化码处理的设备的示意性框图，如图7所示，该设备700包括：
获取单元710，获取单元710用于确定待编码码块的信息比特数目K、待编码码块在实际信道中进行传输的传输比特数目N和待编码码块的速率适配规则，其中，待编码码块包括M个未编码比特，待编码码块的速率适配规则用于表示M个未编码比特编编码后得到的M个编码比特与N个传输比特的对应关系。
确定单元720，确定单元720用于根据N个传输比特中每个比特的可靠性和M个编码比特与N个传输比特的对应关系，确定M个编码比特中每个比特的可靠性。
所述确定单元720还用于根据M个编码比特中每个比特的可靠性，确定M个编码比特进行编码前对应的M个未编码比特中每个比特的可靠性，并根据M个未编码比特中每个比特的可靠性，从M个未编码比特中确定K个比特作为信息比特，其中，M、N、K为正整数。
基于上述技术方案，本实施例的方法通过确定待编码码块的信息比特数目K、待编码码块在实际信道中进行传输的传输比特数目N和待编码码块的速率适配规则，能够由N个传输比特中每个比特的可靠性，确定出待编码码块中M个未编码比特中每个比特的可靠性，从而从这M个未编码比特中确定K个信息比特，该信息比特的序号所构成的集合A将用于Polar码的译码或结果过程。因此，本发明实施例能够提供一种通信设备在线进行Polar码编码或译码的方法。
可选地，作为本发明一个实施例，M个编码比特与N个传输比特的对应关系包括下列中的一种：N个传输比特与第一比特序列所包括的N个比特一一对应，第一比特序列由M个编码比特和M个编码比特中的前N-M个编码比特组成；N个传输比特与第二比特序列所包括的N个比特一一对应，第二比特序列由M个编码比特和M个编码比特中的后N-M个编码比特组成。
可选地，作为本发明一个实施例，获取单元710用于：将与当前信道状态信息、待发送消息序列所包括的比特数目以及当前允许传输的最大比特数目相对应的信息比特数目和传输比特数目分别确定为所述信息比特数目K和所述传输比特数目N。
可选地，作为本发明一个实施例，确定单元720用于：将与当前信道状态信息、待发送消息序列所包括的比特数目以及当前允许传输的最大比特数目相对应的编码比特数目确定为编码比特数目M；
将与待编码码块的信息比特数目K、传输比特数目N相对应的编码比特数目确定为编码比特数目M；
根据预先设定的最高传输码率Rmax、最大允许码长Mmax、最短允许码长Mmin，利用下式确定所述待编码码块编码后的编码比特数目M：
Figure PCTCN2016106174-appb-000075
其中，Rmax、Mmax、Mmin为正整数。
可选地，作为本发明一个实施例，确定单元720用于：根据待编码码块编码后得到的M个编码比特与所述N个传输比特的对应关系，确定编码比特序列号集合
Figure PCTCN2016106174-appb-000076
tj表示N个传输比特中的第j个传输比特对应的编码比特在M个编码比特中的编号，1≤j≤N；构造第一度量序列λ1 N＝[λ1,λN]，其中，所述第一度量序列λ1 N中任意一个元素为λi，1≤i≤N；根据信道状态信息、待发送消息序列所包括的长度和当前允许传输的最大比特数目，确定N个传输比特的平均可靠性度量参数λ0；确定第一度量序列λ1 N＝[λ1,λN]，其中，λi＝λ0，1≤i≤N，并且λi用于表征所述N个传输比特中第i个传输比特的可靠性；根据所述第一度量序列，确定第二度量序列
Figure PCTCN2016106174-appb-000077
其中，mj用于表征所述M个编码比特中第j个编码比特的可靠性，
Figure PCTCN2016106174-appb-000078
可选地，作为本发明一个实施例，确定单元720用于：将第二度量序列
Figure PCTCN2016106174-appb-000079
进行比特反序重排列得到第三度量序列
Figure PCTCN2016106174-appb-000080
分别构建以下参数：比特间隔Δ、序号i1、序号i2和序号i3，其中，比特间隔
Figure PCTCN2016106174-appb-000081
1≤i1≤log2M，i1、i2、i3为正整数；当i1＝p时，1≤i2≤M/(2Δ(p))，其中，1≤p≤log2M；当i2＝q时，1≤i3≤Δ(q)，其中，1≤q≤M/(2Δ(p))，生成第四度量序列
Figure PCTCN2016106174-appb-000082
μk用于表征M个未编码比特中第k比特的可靠性，μk通过下式得到其中，1≤k≤M：
Figure PCTCN2016106174-appb-000083
其中，G(x1,x2)＝x1+x2，F(x1,x2)＝a(x1,x2)x1+b(x1,x2)x2+c(x1,x2)，a，b，c为常数。
可选地，作为本发明一个实施例，确定单元720用于：第四度量序列μ1 M中找出值最大的K个元素对应的比特作为信息比特。
设备700可以用于执行上述方法实施例中与网络设备对应的各个流程和/或步骤，为避免重复，在此不再赘述。
基于上述技术方案，本实施例的方法通信设备通过确定待编码码块的信息比特数目K、待编码码块在实际信道中进行传输的传输比特数目N和待编码码块的速率适配规则，能够由N个传输比特中每个比特的可靠性，确定出 待编码码块中M个未编码比特中每个比特的可靠性，从而从这M个未编码比特中确定K个信息比特，该信息比特的序号所构成的集合A将用于Polar码的译码或结果过程。因此，本发明实施例能够提供一种通信设备在线进行Polar码编码或译码的方法。
图8是本发明另一实施例的网络设备的示意性装置图。如图8所示，本发明实施例还提供了一种网络设备800，该网络设备800包括处理器801、存储器802。其中，该存储器802用于存储指令，该处理器801用于执行该存储器802存储的指令。其中，该处理器801用于：待编码码块的信息比特数目K、待编码码块在实际信道中进行传输的传输比特数目N和待编码码块的速率适配规则，其中，待编码码块的速率适配规则用于确定待编码码块编码后得到的M个编码比特与N个传输比特的对应关系；该处理器801还用于：根据N个传输比特中每个比特的可靠性和M个编码比特与N个传输比特的对应关系，确定M个编码比特中每个比特的可靠性；根据M个编码比特中每个比特的可靠性，确定M个编码比特进行编码前对应的M个未编码比特中每个比特的可靠性，并根据M个未编码比特中每个比特的可靠性，从M个未编码比特中确定K个比特作为信息比特，其中，待编码码块包括M个未编码比特，M、N、K为正整数。
基于上述技术方案，本实施例的方法通过确定待编码码块的信息比特数目K、待编码码块在实际信道中进行传输的传输比特数目N和待编码码块的速率适配规则，能够由N个传输比特中每个比特的可靠性，确定出待编码码块中M个未编码比特中每个比特的可靠性，从而从这M个未编码比特中确定K个信息比特，该信息比特的序号所构成的集合A将用于Polar码的译码或结果过程。因此，本发明实施例能够提供一种通信设备在线进行Polar码编码或译码的方法。
应理解，在本发明实施例中，该处理器801可以是中央处理单元(Central Processing Unit，简称为“CPU”)，该处理器801还可以是其他通用处理器、数字信号处理器(DSP)、专用集成电路(ASIC)、现成可编程门阵列(FPGA)或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件等。通用处理器可以是微处理器或者该处理器也可以是任何常规的处理器等。
该存储器802可以包括只读存储器和随机存取存储器，并向处理器801提供指令和数据。存储器802的一部分还可以包括非易失性随机存取存储器。 例如，存储器802还可以存储设备类型的信息。
在实现过程中，上述方法的各步骤可以通过处理器801中的硬件的集成逻辑电路或者软件形式的指令完成。结合本发明实施例所公开的方法的步骤可以直接体现为硬件处理器执行完成，或者用处理器中的硬件及软件模块组合执行完成。软件模块可以位于随机存储器，闪存、只读存储器，可编程只读存储器或者电可擦写可编程存储器、寄存器等本领域成熟的存储介质中。该存储介质位于存储器802，处理器801读取存储器802中的信息，结合其硬件完成上述方法的步骤。为避免重复，这里不再详细描述。
可选地，作为本发明一个实施例，M个编码比特与N个传输比特的对应关系包括以下任意一种：N个传输比特与第一比特序列所包括的N个比特一一对应，第一比特序列由M个编码比特和M个编码比特中的前N-M个编码比特组成；N个传输比特与第二比特序列所包括的N个比特一一对应，第二比特序列由M个编码比特和M个编码比特中的后N-M个编码比特组成。
可选地，作为本发明一个实施例，处理器801具体用于：确定第一查找表中与当前信道状态信息、待发送消息序列所包括的比特数目以及当前允许传输的最大比特数目相匹配的匹配表项，第一查找表的表项包括信道状态信息、消息序列所包括的比特数目、允许传输的最大比特数目、信息比特数目和传输比特数目；将匹配表项中与所述当前信道状态信息、待发送消息序列所包括的比特数目和当前允许传输的最大比特数目对应的信息比特数目和传输比特数目分别确定为所述信息比特数目K和所述传输比特数目N。
可选地，作为本发明一个实施例，处理器801具体用于：确定第二查找表中与当前信道状态信息、待发送消息序列所包括的比特数目以及当前允许传输的最大比特数目相匹配的匹配表项，第二查找表的表项包括信道状态信息、消息序列所包括的比特数目、允许传输的最大比特数目和编码比特数目；将匹配表项中与所述当前信道状态信息、待发送消息序列所包括的比特数目和当前允许传输的最大比特数目对应的编码比特数目确定为编码比特数目M；
确定第三查找表中与待编码码块的信息比特数目K、传输比特数目N相匹配的匹配表项，第三查找表的表项包括信息比特数目、传输比特数目和编码比特数目；将表项中与所述待编码码块的信息比特数目K、传输比特数目N所对应的编码比特数目确定为编码比特数目M；
根据预先设定的最高传输码率Rmax、最大允许码长Mmax、最短允许码长Mmin，利用下式确定所述待编码码块编码后的编码比特数目M：
Figure PCTCN2016106174-appb-000084
其中，Rmax、Mmax、Mmin为正整数。
可选地，作为本发明一个实施例，处理器801具体用于：根据待编码码块编码后得到的M个编码比特与所述N个传输比特的对应关系，确定编码比特序列号集合
Figure PCTCN2016106174-appb-000085
tj表示N个传输比特中的第j个传输比特对应的编码比特在M个编码比特中的编号，1≤j≤N；构
造第一度量序列λ1 N＝[λ1,λN]，其中，所述第一度量序列λ1 N中任意一个元素为λi，1≤i≤N；根据信道状态信息、待发送消息序列所包括的长度和当前允许传输的最大比特数目，确定N个传输比特的平均可靠性度量参数λ0；确定第一度量序列λ1 N＝[λ1,λN]，其中，λi＝λ0，1≤i≤N，并且λi用于表征所述N个传输比特中第i个传输比特的可靠性；根据所述第一度量序列，确定第二度量序列
Figure PCTCN2016106174-appb-000086
其中，mj用于表征所述M个编码比特中第j个编码比特的可靠性，
Figure PCTCN2016106174-appb-000087
可选地，作为本发明一个实施例，处理器801具体用于：将第二度量序列
Figure PCTCN2016106174-appb-000088
进行比特反序重排列得到第三度量序列
Figure PCTCN2016106174-appb-000089
分别构建以下参数：比特间隔Δ、序号i1、序号i2和序号i3，其中，比特间隔
Figure PCTCN2016106174-appb-000090
1≤i1≤log2M，i1、i2、i3为正整数；当i1＝p时，1≤i2≤M/(2Δ(p))，其中，1≤p≤log2M；当i2＝q时，1≤i3≤Δ(q)，其中，1≤q≤M/(2Δ(p))，生成第四度量序列
Figure PCTCN2016106174-appb-000091
μk用于表征M个未编码比特中第k比特的可靠性，μk通过下式得到其中，1≤k≤M：
Figure PCTCN2016106174-appb-000092
其中，G(x1,x2)＝x1+x2，F(x1,x2)＝a(x1,x2)x1+b(x1,x2)x2+c(x1,x2)，a，b，c为常数。
可选地，作为本发明一个实施例，处理器801具体用于：从第四度量序列
Figure PCTCN2016106174-appb-000093
中找出度量值最大的K个元素对应的比特作为信息比特。
网络设备800可以用于执行上述方法实施例中与网络设备对应的各个流程和/或步骤，为避免重复，在此不再赘述。
通信设备通过确定待编码码块的信息比特数目K、待编码码块在实际信 道中进行传输的传输比特数目N和待编码码块的速率适配规则，能够由N个传输比特中每个比特的可靠性，确定出待编码码块中M个未编码比特中每个比特的可靠性，从而从这M个未编码比特中确定K个信息比特，该信息比特的序号所构成的集合A将用于Polar码的译码或结果过程。因此，本发明实施例能够提供一种通信设备在线进行Polar码编码或译码的方法。
本领域普通技术人员可以意识到，结合本文中所公开的实施例中描述的各方法步骤和单元，能够以电子硬件、计算机软件或者二者的结合来实现，为了清楚地说明硬件和软件的可互换性，在上述说明中已经按照功能一般性地描述了各实施例的步骤及组成。这些功能究竟以硬件还是软件方式来执行，取决于技术方案的特定应用和设计约束条件。本领域普通技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能，但是这种实现不应认为超出本发明的范围。
结合本文中所公开的实施例描述的方法或步骤可以用硬件、处理器执行的软件程序，或者二者的结合来实施。软件程序可以置于随机存储器(RAM)、内存、只读存储器(ROM)、电可编程ROM、电可擦除可编程ROM、寄存器、硬盘、可移动磁盘、CD-ROM、或技术领域内所公知的任意其它形式的存储介质中。
尽管通过参考附图并结合优选实施例的方式对本发明进行了详细描述，但本发明并不限于此。在不脱离本发明的精神和实质的前提下，本领域普通技术人员可以对本发明的实施例进行各种等效的修改或替换，而这些修改或替换都应在本发明的涵盖范围内。

Claims (15)

  1. 一种极化码处理的方法，其特征在于，包括：
    通信设备确定待编码码块的信息比特数目K、所述待编码码块在实际信道中进行传输的传输比特数目N和所述待编码码块的速率适配规则，其中，所述待编码码块包括M个未编码比特，所述待编码码块的速率适配规则用于表示所述M个未编码比特编码后得到的M个编码比特与所述N个传输比特的对应关系；
    所述通信设备根据所述N个传输比特中每个比特的可靠性和所述M个编码比特与所述N个传输比特的对应关系，确定所述M个编码比特中每个比特的可靠性；
    所述通信设备根据所述M个编码比特中每个比特的可靠性，确定所述M个未编码比特中每个比特的可靠性，并根据所述M个未编码比特中每个比特的可靠性，从所述M个未编码比特中确定K个比特作为信息比特，M、N、K为正整数。
  2. 根据权利要求1所述的方法，其特征在于，所述M个编码比特与所述N个传输比特的对应关系包括下列中的一种：
    所述N个传输比特与第一比特序列所包括的N个比特一一对应，所述第一比特序列由所述M个编码比特和所述M个编码比特中的前N-M个编码比特组成；
    所述N个传输比特与第二比特序列包括的N个比特一一对应，所述第二比特序列由所述M个编码比特和所述M个编码比特中的后N-M个编码比特组成。
  3. 根据权利要求1或2所述的方法，其特征在于，所述通信设备确定待编码码块的信息比特数目K、所述待编码码块在实际信道中进行传输的传输比特数目N，包括：
    将与当前信道状态信息、待发送消息序列包括的比特数目以及当前允许传输的最大比特数目相对应的信息比特数目和传输比特数目分别确定为所述信息比特数目K和所述传输比特数目N。
  4. 根据权利要求1至3中任一项所述的方法，其特征在于，在所述确定所述M个编码比特中每个比特的可靠性之前，所述方法还包括下列中的一种：
    将与当前信道状态信息、待发送消息序列所包括的比特数目以及当前允许传输的最大比特数目相对应的编码比特数目确定为所述编码比特数目M；
    将与所述待编码码块的信息比特数目K、所述传输比特数目N相对应的编码比特数目确定为所述编码比特数目M；
    根据最高传输码率Rmax、最大允许码长Mmax、最短允许码长Mmin，利用下式确定所述待编码码块编码后的编码比特数目M：
    Figure PCTCN2016106174-appb-100001
    其中，Rmax、Mmax、Mmin为正整数。
  5. 根据权利要求4所述的方法，其特征在于，所述通信设备根据所述N个传输比特中每个比特的可靠性和所述M个编码比特与所述N个传输比特的对应关系，确定所述M个编码比特中每个比特的可靠性，包括：
    根据所述待编码码块编码后得到的M个编码比特与所述N个传输比特的对应关系，确定编码比特序列号集合
    Figure PCTCN2016106174-appb-100002
    tj表示所述N个传输比特中的第j个传输比特对应的编码比特在所述M个编码比特中的编号，1≤j≤N；
    根据所述当前信道状态信息、所述待发送消息序列所包括的长度和所述当前允许传输的最大比特数目，确定所述N个传输比特的平均可靠性度量参数λ0；
    确定第一度量序列
    Figure PCTCN2016106174-appb-100003
    其中，λi＝λ0，1≤i≤N N，并且λi用于表征所述N个传输比特中第i个传输比特的可靠性；
    根据所述第一度量序列，确定第二度量序列
    Figure PCTCN2016106174-appb-100004
    其中，mj用于表征所述M个编码比特中第j个编码比特的可靠性，
    Figure PCTCN2016106174-appb-100005
  6. 根据权利要求5所述的方法，其特征在于，所述通信设备根据所述M个编码比特中每个比特的可靠性，确定所述M个未编码比特中每个比特的可靠性，包括：
    将所述第二度量序列
    Figure PCTCN2016106174-appb-100006
    进行比特反序重排列，得到第三度量序列
    Figure PCTCN2016106174-appb-100007
    分别构建以下参数：比特间隔Δ、序号i1、序号i2和序号i3，其中，比特间隔
    Figure PCTCN2016106174-appb-100008
    1≤i1≤log2M，i1、i2、i3为正整数；
    当i1＝p时，1≤i2≤M/(2Δ(p))，其中，1≤p≤log2M；
    当i2＝q时，1≤i3≤Δ(q)，其中，1≤q≤M/(2Δ(p))，生成第四度量序列
    Figure PCTCN2016106174-appb-100009
    μk用于表征所述M个未编码比特中第k比特的可靠性，μk通过下式得到，其中，1≤k≤M：
    Figure PCTCN2016106174-appb-100010
    其中，G(x1,x2)＝x1+x2，F(x1,x2)＝a(x1,x2)x1+b(x1,x2)x2+c(x1,x2)，a，b，c为常数。
  7. 根据权利要求6所述的方法，其特征在于，所述从所述M个未编码比特中确定K个比特作为信息比特，包括：
    将所述第四度量序列
    Figure PCTCN2016106174-appb-100011
    中数值最大的K个元素对应的比特作为信息比特。
  8. 一种极化码处理的通信设备，其特征在于，包括：
    获取单元，所述获取确定单元用于获取待编码码块的信息比特数目K、所述待编码码块在实际信道中进行传输的传输比特数目N和所述待编码码块的速率适配规则，其中，所述待编码码块所包括M个未编码比特，所述待编码码块的速率适配规则用于表示所述M个未编码比特编码后得到的M个编码比特与所述N个传输比特的对应关系；
    确定单元，所述确定单元用于根据所述N个传输比特中每个比特的可靠性和所述M个编码比特与所述N个传输比特的对应关系，确定所述M个编码比特中每个比特的可靠性；
    所述确定单元还用于根据所述M个编码比特中每个比特的可靠性，确定所述M个编码比特进行编码前对应的M个未编码比特中每个比特的可靠性，并根据所述M个未编码比特中每个比特的可靠性，从所述M个未编码比特中确定K个比特作为信息比特，其中，M、N、K为正整数。
  9. 根据权利要求8所述的通信设备，其特征在于，所述M个编码比特与所述N个传输比特的对应关系包括下列中的一种：
    所述N个传输比特与第一比特序列所包括的N个比特一一对应，所述第一比特序列由所述M个编码比特和所述M个编码比特中的前N-M个编码比特组成；
    所述N个传输比特与第二比特序列所包括的N个比特一一对应，所述第二比特序列由所述M个编码比特和所述M个编码比特中的后N-M个编码 比特组成。
  10. 根据权利要求8或9所述的通信设备，其特征在于，所述获取单元具体用于：
    将与当前信道状态信息、待发送消息序列所包括的比特数目以及当前允许传输的最大比特数目相对应的信息比特数目和传输比特数目分别确定为所述信息比特数目K和所述传输比特数目N。
  11. 根据权利要求8至10中任一项所述的通信设备，其特征在于，所述获取单元具体还用于：
    将与当前信道状态信息、待发送消息序列所包括的比特数目以及当前允许传输的最大比特数目相对应的编码比特数目确定为所述编码比特数目M；
    将与所述待编码码块的信息比特数目K、所述传输比特数目N相对应的编码比特数目确定为所述编码比特数目M；
    根据预先设定的最高传输码率Rmax、最大允许码长Mmax、最短允许码长Mmin，利用下式确定所述待编码码块编码后的编码比特数目M：
    Figure PCTCN2016106174-appb-100012
    其中，Rmax、Mmax、Mmin为正整数。
  12. 根据权利要求11所述的通信设备，其特征在于，所述确定单元具体用于：
    根据所述待编码码块编码后得到的M个编码比特与所述N个传输比特的对应关系，确定编码比特序列号集合
    Figure PCTCN2016106174-appb-100013
    tj表示所述N个传输比特中的第j个传输比特对应的编码比特在所述M个编码比特中的编号，1≤j≤N；构造第一度量序列
    Figure PCTCN2016106174-appb-100014
    其中，所述第一度量序列
    Figure PCTCN2016106174-appb-100015
    中任意一个元素为λi，1≤i≤N；
    根据所述信道状态信息、所述待发送消息序列所包括的比特数目和所述当前允许传输的最大比特数目，确定所述N个传输比特的平均可靠性度量参数λ0；
    确定第一度量序列
    Figure PCTCN2016106174-appb-100016
    其中，λi＝λ0，1≤i≤N，并且λi用于表征所述N个传输比特中第i个传输比特的可靠性；
    根据所述第一度量序列，确定第二度量序列
    Figure PCTCN2016106174-appb-100017
    其中，mj用于表征所述M个编码比特中第j个编码比特的可靠性，
    Figure PCTCN2016106174-appb-100018
  13. 根据权利要求12所述的通信设备，其特征在于，所述确定单元具体用于：
    将所述第二度量序列
    Figure PCTCN2016106174-appb-100019
    进行比特反序重排列得到第三度量序列
    Figure PCTCN2016106174-appb-100020
    分别构建以下参数：比特间隔Δ、序号i1、序号i2和序号i3，其中，比特间隔
    Figure PCTCN2016106174-appb-100021
    1≤i1≤log2M，i1、i2、i3为正整数；
    当i1＝p时，1≤i2≤M/(2Δ(p))，其中，1≤p≤log2M；
    当i2＝q时，1≤i3≤Δ(q)，其中，1≤q≤M/(2Δ(p))，生成第四度量序列
    Figure PCTCN2016106174-appb-100022
    μk用于表征所述M个未编码比特中第k比特的可靠性，μk通过下式得到其中，1≤k≤M：
    Figure PCTCN2016106174-appb-100023
    其中，G(x1,x2)＝x1+x2，F(x1,x2)＝a(x1,x2)x1+b(x1,x2)x2+c(x1,x2)，a，b，c为常数。
  14. 根据权利要求12所述的通信设备，其特征在于，所述确定单元还用于：将所述第四度量序列
    Figure PCTCN2016106174-appb-100024
    中数值最大的K个元素对应的比特作为信息比特。
  15. 一种极化码处理的通信装置，其特征在于，包括存储指令的存储器和处理器，其中，所述处理器执行所述指令进行如权利要求1至7任一所述的方法。
PCT/CN2016/106174 2015-12-10 2016-11-17 极化码处理的方法及通信设备 WO2017097098A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201510915896.0A CN106877973B (zh) 2015-12-10 2015-12-10 极化码处理的方法及通信设备
CN201510915896.0 2015-12-10

Publications (1)

Publication Number Publication Date
WO2017097098A1 true WO2017097098A1 (zh) 2017-06-15

Family

ID=59012679

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/106174 WO2017097098A1 (zh) 2015-12-10 2016-11-17 极化码处理的方法及通信设备

Country Status (2)

Country Link
CN (1) CN106877973B (zh)
WO (1) WO2017097098A1 (zh)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2018228589A1 (zh) * 2017-06-16 2018-12-20 华为技术有限公司 一种编码方法、无线设备和芯片
CN109257140A (zh) * 2017-07-14 2019-01-22 华为技术有限公司 一种极化信道可靠度排序的方法、极化码编码方法及装置
CN109286404A (zh) * 2017-07-21 2019-01-29 华为技术有限公司 一种Polar码编码方法及装置
CN109525360A (zh) * 2017-09-18 2019-03-26 华为技术有限公司 极化码的速率匹配的方法和装置
WO2019095270A1 (en) * 2017-11-17 2019-05-23 Qualcomm Incorporated Uplink control information segmentation for polar codes
CN114095122A (zh) * 2017-08-02 2022-02-25 华为技术有限公司 一种Polar码编码方法及装置

Families Citing this family (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108809333B (zh) * 2017-05-05 2021-05-04 华为技术有限公司 极化码编译码的方法、发送设备和接收设备
CN109150384B (zh) * 2017-06-27 2020-11-17 华为技术有限公司 极化码编码的方法和装置
CN109039544B (zh) * 2017-06-27 2019-11-19 华为技术有限公司 一种编码方法、无线设备和芯片
CN109286402B (zh) 2017-07-21 2022-01-14 华为技术有限公司 一种Polar码编码方法及装置
CN109309503B (zh) 2017-07-28 2022-05-10 华为技术有限公司 一种Polar码编码方法及装置
CN109327280B (zh) * 2017-08-01 2021-01-15 华为技术有限公司 分段编码方法及装置
US10659194B2 (en) 2017-08-02 2020-05-19 Huawei Technologies Co., Ltd. Polar code encoding method and apparatus in wireless communications
CN109391343B (zh) 2017-08-02 2021-09-03 华为技术有限公司 一种Polar码编码方法及装置
CN109391345B (zh) 2017-08-04 2022-10-11 华为技术有限公司 一种Polar码编码方法及装置
US10536305B2 (en) * 2017-08-11 2020-01-14 Coherent Logix, Incorporated Scrambling sequence design for multi-mode block discrimination on DCI blind detection
CN109391353B (zh) 2017-08-11 2021-09-14 华为技术有限公司 一种速率匹配的方法和装置
WO2019041067A1 (zh) * 2017-08-26 2019-03-07 华为技术有限公司 极化译码的方法与装置
CN109495210B (zh) * 2017-09-13 2020-07-31 上海诺基亚贝尔股份有限公司 用于在无线通信系统中交织数据的方法、设备和计算机可读存储介质
CN109728877B (zh) * 2017-10-27 2021-07-27 上海朗帛通信技术有限公司 一种用于无线通信的用户设备、基站中的方法和装置
CN107659318B (zh) * 2017-11-07 2021-05-18 东南大学 一种自适应的极化码译码方法
CN114244470B (zh) 2017-11-17 2023-11-21 中兴通讯股份有限公司 信道状态信息csi编码方法及装置、存储介质和处理器
CN108173628B (zh) * 2018-01-09 2020-04-24 北京航空航天大学 一种基于高阶调制不等错误保护特性的极化码混合自动重传请求方法

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102122966A (zh) * 2011-04-15 2011-07-13 北京邮电大学 基于信道极化的交错结构重复码的编码器及其编译码方法
CN102164025A (zh) * 2011-04-15 2011-08-24 北京邮电大学 基于重复编码和信道极化的编码器及其编译码方法
CN103684477A (zh) * 2012-09-24 2014-03-26 华为技术有限公司 混合极性码的生成方法和生成装置
WO2015026148A1 (ko) * 2013-08-20 2015-02-26 엘지전자 주식회사 무선 접속 시스템에서 폴라 코딩을 이용한 데이터 송신방법

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102122966A (zh) * 2011-04-15 2011-07-13 北京邮电大学 基于信道极化的交错结构重复码的编码器及其编译码方法
CN102164025A (zh) * 2011-04-15 2011-08-24 北京邮电大学 基于重复编码和信道极化的编码器及其编译码方法
CN103684477A (zh) * 2012-09-24 2014-03-26 华为技术有限公司 混合极性码的生成方法和生成装置
WO2015026148A1 (ko) * 2013-08-20 2015-02-26 엘지전자 주식회사 무선 접속 시스템에서 폴라 코딩을 이용한 데이터 송신방법

Cited By (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2018228589A1 (zh) * 2017-06-16 2018-12-20 华为技术有限公司 一种编码方法、无线设备和芯片
US11190213B2 (en) 2017-06-16 2021-11-30 Huawei Technologies Co., Ltd. Coding method, wireless device, and chip
CN109257140A (zh) * 2017-07-14 2019-01-22 华为技术有限公司 一种极化信道可靠度排序的方法、极化码编码方法及装置
CN109286404A (zh) * 2017-07-21 2019-01-29 华为技术有限公司 一种Polar码编码方法及装置
US11316538B2 (en) 2017-07-21 2022-04-26 Huawei Technologies Co., Ltd. Polar code encoding method and apparatus
US10965322B2 (en) 2017-07-21 2021-03-30 Huawei Technologies Co., Ltd. Polar code encoding method and apparatus
CN114095122A (zh) * 2017-08-02 2022-02-25 华为技术有限公司 一种Polar码编码方法及装置
US11811528B2 (en) 2017-08-02 2023-11-07 Huawei Technologies Co., Ltd. Polar code encoding method and apparatus in wireless communications
CN114095122B (zh) * 2017-08-02 2023-07-07 华为技术有限公司 一种Polar码编码方法及装置
CN109525360A (zh) * 2017-09-18 2019-03-26 华为技术有限公司 极化码的速率匹配的方法和装置
US10958374B2 (en) 2017-09-18 2021-03-23 Huawei Technologies Co., Ltd. Polar code rate matching method and apparatus
US11362760B2 (en) 2017-09-18 2022-06-14 Huawei Technologies Co., Ltd. Polar code rate matching method and apparatus
CN109525360B (zh) * 2017-09-18 2020-10-16 华为技术有限公司 极化码的速率匹配的方法和装置
US11515889B2 (en) 2017-11-17 2022-11-29 Qualcomm Incorporated Uplink control information segmentation for polar codes
WO2019095270A1 (en) * 2017-11-17 2019-05-23 Qualcomm Incorporated Uplink control information segmentation for polar codes

Also Published As

Publication number Publication date
CN106877973B (zh) 2020-04-14
CN106877973A (zh) 2017-06-20

Similar Documents

Publication Publication Date Title
WO2017097098A1 (zh) 极化码处理的方法及通信设备
US10523368B2 (en) Polar code processing method and communications device
CN111954982B (zh) 无线通信系统和广播系统中使用极性码进行编码和解码的装置和方法
EP3245745B1 (en) System and method for a message passing algorithm
WO2016082142A1 (zh) 极化码的速率匹配的方法、装置和无线通信设备
WO2016101089A1 (zh) 极性码的编码方法和编码装置
CN110166167B (zh) 编码的方法、译码的方法、编码设备和译码设备
CN106982172B (zh) 确定极化码传输块大小的方法和通信设备
JP2018508134A (ja) データ伝送の方法及びデバイス
US20220052709A1 (en) Crc interleaving pattern for polar codes
US11936402B2 (en) Puncturing of polar codes with complementary sequences
CN107800510B (zh) 极化Polar码编码的方法及装置
WO2019001447A1 (zh) 一种编码方法、无线设备和芯片
CN108365850A (zh) 编码方法、编码装置和通信装置
JP2020511051A (ja) データ処理方法およびデバイス
CN110890894A (zh) 级联编码的方法和装置
CN115023900A (zh) 用于在通信和广播系统中解码极化码的方法和装置
US10581464B2 (en) Encoder device, decoder device, and methods thereof
WO2018141271A1 (zh) 数据处理的方法和装置
US20240223219A1 (en) Puncturing of polar codes with complementary sequences
US20240048430A1 (en) Constellation shaping-related coding selection
WO2017206055A1 (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: 16872290

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

Country of ref document: EP

Kind code of ref document: A1