WO2020098461A1 - Polar码编码方法及装置 - Google Patents

Polar码编码方法及装置 Download PDF

Info

Publication number
WO2020098461A1
WO2020098461A1 PCT/CN2019/112714 CN2019112714W WO2020098461A1 WO 2020098461 A1 WO2020098461 A1 WO 2020098461A1 CN 2019112714 W CN2019112714 W CN 2019112714W WO 2020098461 A1 WO2020098461 A1 WO 2020098461A1
Authority
WO
WIPO (PCT)
Prior art keywords
sequence
polar code
bits
polarized channels
encoded
Prior art date
Application number
PCT/CN2019/112714
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 华为技术有限公司
Priority to EP19884185.0A priority Critical patent/EP3873010A4/en
Publication of WO2020098461A1 publication Critical patent/WO2020098461A1/zh
Priority to US17/322,529 priority patent/US11502704B2/en
Priority to US17/956,399 priority patent/US11750217B2/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
    • H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
    • H03M13/1105—Decoding
    • H03M13/1111—Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0041—Arrangements at the transmitter end
    • H04L1/0043—Realisations of complexity reduction techniques, e.g. use of look-up tables
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/13—Linear codes
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/61—Aspects and characteristics of methods and arrangements for error correction or error detection, not provided for otherwise
    • H03M13/611—Specific encoding aspects, e.g. encoding by means of decoding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0057—Block codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0061—Error detection codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0061—Error detection codes
    • H04L1/0063—Single parity check

Definitions

  • Embodiments of the present application relate to the field of communication technologies, and in particular, to a Polar code encoding method and device.
  • Turbo codes As the most basic wireless access technology, channel coding plays a vital role in ensuring the reliable transmission of data.
  • Turbo codes, low density parity check codes (LDPC) and polarization codes are generally used for channel coding.
  • Turbo codes cannot support information transmission at too low or too high code rates.
  • Turbo codes and LDPC codes are also difficult to achieve ideal performance under the limited code length due to their own coding and decoding characteristics.
  • Turbo codes and LDPC codes have high computational complexity in the process of coding and decoding.
  • Polar code is a good code that theoretically proves that it can obtain Shannon capacity and has relatively simple complexity of coding and decoding, and thus has been more and more widely used.
  • 5G 5th generation
  • eMBB enhanced mobile Internet
  • mMTC massive machine connection communication
  • URLLC high reliability and low latency communication
  • Embodiments of the present application provide a Polar code encoding method and device, which are used to reduce the operation delay of acquiring the first sequence used for Polar encoding.
  • a Polar code encoding method obtains a first sequence from a Polar code construction sequence table according to an encoding parameter.
  • the Polar code construction sequence table includes at least one encoding parameter and the at least one encoding parameter Corresponding to at least one sequence, the at least one coding parameter and the at least one sequence are one-to-one mapping, the first sequence is one of the at least one sequence, the first sequence is composed of a polarization channel number and The reliability of the polarization channel corresponding to the polarization channel number is arranged from small to large or from large to small.
  • the coding parameters include at least one of the length of the mother code, the number of information bits to be coded, and the number of bits after rate matching A; place the bits to be coded according to the sequence numbers of the K polarized channels determined by the first sequence, and perform Polar code coding on the bits to be coded to obtain an encoded bit sequence, which is determined by the first sequence
  • the number of K polarized channels is determined according to the rate matching scheme and / or reliability.
  • the length of the first sequence of the Polar code used for the PBCH channel is 56, the first sequence is arranged according to reliability from small to large, and the polarization channel number corresponding to the first sequence starts from 0 stored as [441,469,247,367,253,375,444,470,483,415,485,473,474,254,379,431,489,486,476,439,490,463,381,497,492,443,382,498,445,471,500,446,475,487,504,255,477,491,478,383,493,499,502,494,501,447,505,506,479,508,495,503,507,509,510,511] It should be noted that the above sequences may be the natural order according to storage stored as [247,253,254,255,367,375,379,381,382,383,415,431, 439,441,443,444,445,446,447,463,
  • the first sequence is all or a subsequence of the second sequence
  • the second sequence includes sequence numbers of N max polarized channels.
  • the sequence numbers of the N max polarized channels are in all
  • the second sequence is arranged according to the reliability of the N max polarized channels from small to large or from large to small, N max is a positive integer, the N max is greater than or equal to N, and the first sequence
  • the reliability ranking of the serial numbers of the polarized channels in is consistent with the reliability ranking of the serial numbers of the polarized channels in the second sequence that are less than N.
  • the first sequence may be part or all of any sequence shown in the sequence Q1-sequence Q6 in the specification, and the sequence numbers of the N polarized channels in the first sequence are according to the N
  • the reliability of the polarized channels is arranged from small to large, and the minimum number of the polarized channels is 0.
  • the first sequence is part or all of any sequence shown in Table Q1-Table Q6 of the specification, and the sequence numbers of the N polarized channels in the first sequence are according to the N
  • the reliability of the polarized channels is arranged from small to large, and the minimum number of the polarized channels is 0.
  • a decoding device obtains bits to be decoded.
  • the decoding device obtains a first sequence from a Polar code structure sequence table according to decoding parameters.
  • the Polar code structure includes at least one decoding parameter and at least one sequence corresponding to the at least one decoding parameter, the at least one decoding parameter and the at least one sequence are one-to-one mapping, and the first sequence is the One of at least one sequence, the first sequence is composed of polarized channel numbers and is arranged according to the polarized channel reliability corresponding to the polarized channel numbers from small to large or from large to small, and the decoding parameters include At least one of the length of the mother code, the number of information bits to be decoded, and the number of bits after rate matching; according to the sequence number of the K information bits to be decoded determined by the first sequence, Polar decode the bits to be decoded To obtain K information bits to be decoded, wherein the sequence numbers of the K polarized
  • the second sequence includes sequence numbers of N polarization channels, and the sequence numbers of the N polarization channels are in accordance with the reliability of the N polarization channels in the second sequence Arranged from small to large or from large to small;
  • the first sequence is part or all of any sequence shown in sequence Q1-sequence Q6 of the specification, and the sequence numbers of the N polarized channels in the first sequence are according to the N
  • the reliability of the polarized channels is arranged from small to large, and the minimum number of the polarized channels is 0.
  • the first sequence is part or all of any sequence shown in Table Q1-Table Q6 of the specification, and the sequence numbers of the N polarized channels in the first sequence are according to the N
  • the reliability of the polarized channels is arranged from small to large, and the minimum number of the polarized channels is 0.
  • the first sequence and / or the second sequence are pre-stored.
  • the first sequence is used for Polar coding of the PBCH channel, and is stored in a natural order as [247, 253, 254, 255, 367, 375, 379, 381, 382, 383, 415, 431, 439,441,443,444,445,446,447,463,469,470,471,473,474,475,476,477,478,479,483,485,486,487,489,490,491, 492,493,494,495,497,498,499,500,501,502,503,504,505,506,507,508,509,510,511], wherein the polarization channel corresponding to the first sequence The serial number starts from 0.
  • serial numbers in the first sequence are [446,478,487,490,491,492,493,494,495,497,498,499,500,501,502,503,504,505 , 506, 507, 508, 509, 510, and 511] are used to place cyclic redundancy check bits.
  • the sequence numbers of the N polarized channels are 0 ⁇ (N-1) or 1 ⁇ N.
  • the K bits to be encoded include cyclic redundancy check bits.
  • the K bits to be encoded include parity bits.
  • a Polar code encoding device which has the function of implementing the method described in the first aspect and any possible design of the first aspect.
  • the function can be realized by hardware, or can also be realized by hardware executing corresponding software.
  • the hardware or software includes one or more modules corresponding to the above functions.
  • the Polar code encoding device when part or all of the functions are implemented by hardware, includes: an input interface circuit for acquiring bits to be encoded; a logic circuit for performing the first aspect and The behavior described in any possible design of the first aspect; an output interface circuit for outputting the encoded bit sequence.
  • the Polar code encoding device when part or all of the functions are implemented by software, includes: a memory for storing programs; a processor for executing the programs stored in the memory, When the program is executed, the Polar code encoding device may implement the method described in the first aspect and any possible design of the first aspect.
  • the above memory may be a physically independent unit, or may be integrated with the processor.
  • the Polar code encoding device when part or all of the functions are implemented by software, includes a processor.
  • the memory for storing the program is located outside the encoding device, and the processor is connected to the memory through a circuit / wire to read and execute the program stored in the memory.
  • a Polar code decoding device having the function of implementing the method described in the second aspect and any possible design of the second aspect.
  • the function can be realized by hardware, or can also be realized by hardware executing corresponding software.
  • the hardware or software includes one or more modules corresponding to the above functions.
  • the Polar code decoding device when part or all of the functions are implemented by hardware, includes: an input interface circuit for acquiring bits to be decoded; and a logic circuit for performing the above second The behavior described in any possible design of the aspect and the second aspect; an output interface circuit for outputting the decoded K information bit sequence.
  • the Polar code decoding device when part or all of the functions are implemented by software, includes: a memory for storing a program; a processor for executing the program stored in the memory When the program is executed, the Polar code decoding device may implement the method described in the second aspect and any possible design of the second aspect.
  • the above memory may be a physically independent unit, or may be integrated with the processor.
  • the Polar code decoding device when part or all of the functions are implemented by software, includes a processor.
  • the memory for storing the program is located outside the decoding device, and the processor is connected to the memory through a circuit / wire to read and execute the program stored in the memory.
  • a communication system includes a network device and a terminal, and the network device or terminal may perform the method described in the first aspect and its possible design.
  • a communication system includes a network device and a terminal, and the network device or terminal may perform the method described in the second aspect and its possible design.
  • a computer storage medium storing a computer program, the computer program including instructions for performing the method described in any one of the third aspect and any possible design of the third aspect.
  • a computer storage medium storing a computer program, the computer program including instructions for performing the method described in any one of the fourth aspect and any possible design of the fourth aspect.
  • an embodiment of the present application provides a computer program product containing instructions, which, when run on a computer, causes the computer to perform the methods described in the above aspects.
  • a wireless device including an encoding device, a modulator, and a transceiver for implementing the first aspect and any possible design of the first aspect,
  • the modulator is used to modulate the encoded bit sequence to obtain the modulated sequence
  • the transceiver is used to transmit the modulated sequence.
  • the wireless device is a terminal or a network device.
  • a wireless device including a decoding device, a demodulator, and a transceiver for implementing the second aspect and any possible design of the second aspect,
  • the demodulator is used to demodulate the modulated sequence to obtain the sequence to be decoded;
  • the transceiver is used to receive the modulated sequence.
  • the wireless device is a terminal or a network device.
  • FIG. 1 is a schematic diagram of an architecture of a communication system applied in an embodiment of this application;
  • FIG. 2 is a schematic flowchart of a Polar code encoding method in an embodiment of this application
  • FIG. 3 is a first structural schematic diagram of a Polar code encoding device in an embodiment of this application.
  • FIG. 4 is a second structural diagram of a Polar code encoding device in an embodiment of the present application.
  • FIG. 5 is a third structural schematic diagram of a Polar code encoding device in an embodiment of the present application.
  • FIG. 6 is a fourth structural diagram of a Polar code encoding device in an embodiment of the present application.
  • FIG. 7 is a schematic flowchart of a Polar code decoding method in an embodiment of this application.
  • FIG. 8 is a schematic structural diagram of a Polar code decoding device in an embodiment of the present application.
  • FIG. 9 is a second structural diagram of a Polar code decoding device in an embodiment of the present application.
  • FIG. 10 is a third schematic structural diagram of a Polar code decoding device according to an embodiment of this application.
  • FIG. 11 is a fourth structural diagram of a Polar code decoding device in an embodiment of the present application.
  • Polarized channel reliability ranking plays an important role in the coding and decoding performance of Polar codes.
  • the construction sequence of the target code length is read out, this step will bring additional operation overhead, and a new technical solution can be designed to reduce the operation delay.
  • An embodiment of the present application provides a Polar code encoding method and device, which obtains a reliability ranking according to the reliability of a polarization channel, selects the sequence number of the polarization channel used to transmit information bits according to the reliability ranking, and selects the information bits according to the selected information bits
  • the serial number is encoded in the Polar code.
  • the embodiment of the present application can calculate the reliability of each sub-channel of the Polar code more accurately.
  • Polar code is also a linear block code
  • the encoding matrix is G N
  • the encoding process is among them Is a binary row vector with a length of N (that is, code length);
  • G N is an N ⁇ N matrix, and Defined as the Kronecker product of log 2 N matrices F 2 .
  • NK Cyclic Redundancy Check
  • PC Parity Check
  • Bits are also included in the set of information bits; for The fixed set of bits in (NK) is a known bit. These fixed bits are usually set to 0, but as long as the receiving end and the sending end agree in advance, the fixed bits can be set arbitrarily. Therefore, the encoding output of the Polar code can be simplified to:
  • the construction process of Polar codes is a collection The selection process determines the performance of Polar codes.
  • the construction process of the Polar code is usually to determine that there are N polarization channels according to the code length N of the mother code, corresponding to the N rows of the coding matrix, calculate the reliability of the polarization channel, and polarize the first K polarizations with higher reliability Channel index as a set Element, the index corresponding to the remaining (NK) polarized channels is used as a fixed bit index set Elements.
  • set Determines the position of the information bits, the set Determines the location of fixed bits.
  • the serial number of the polarized channel is the position index of the information bit or fixed bit, that is, the The position index in.
  • the solution provided by the embodiment of the present application relates to how to determine the reliability of the polarization channel.
  • the basic inventive idea of the embodiments of the present application is that the reliability of a polarized channel can be characterized by the reliability, and the construction sequence characterizing the reliability can be quickly obtained by means of table lookup. Thereby reducing the operation delay.
  • FIG. 1 is a schematic structural diagram of a wireless communication network according to an embodiment of the present invention.
  • FIG. 1 is only an example, and other wireless networks that can use the encoding method or apparatus of the embodiments of the present invention are also within the protection scope of the present invention.
  • the wireless communication network 100 includes a network device 110 and a terminal 112.
  • the network device 110 may also be connected to the core network 102.
  • the network device 110 may also communicate with the IP network 104, for example, the Internet, a private IP network, or other data networks.
  • the network equipment provides services for the terminals within the coverage.
  • the network device 110 provides wireless access to one or more terminals 112 within the coverage of the network device 110.
  • the network devices may also communicate with each other.
  • the network device 110 may communicate with the network device 120.
  • the above network device may be a device for communicating with a terminal device.
  • a terminal device can be a base station (Base Transceiver Station, BTS) in a GSM system or a CDMA system, a base station (NodeB, NB) in a WCDMA system, or an evolved base station (Evolved Node B, eNB) in an LTE system Or eNodeB) or future network side equipment in 5G networks, etc.
  • BTS Base Transceiver Station
  • NodeB, NB base station
  • Evolved Node B, eNB evolved Node B
  • the network device may also be a relay station, an access point, an in-vehicle device, and so on.
  • the network device may also be a terminal functioning as a base station.
  • the above terminal may refer to user equipment (User Equipment, UE), access terminal, user unit, mobile station, remote station, remote terminal, mobile device, user terminal, wireless communication device, user agent, or user device.
  • Access terminals can be cellular phones, cordless phones, Session Initiation Protocol (SIP) phones, wireless local loop (Wireless Local Loop, WLL) stations, personal digital assistants (Personal Digital Assistant (PDA), wireless communication Functional handheld devices, computing devices or other processing devices connected to wireless modems, in-vehicle devices, wearable devices, terminal devices in future 5G networks, etc.
  • SIP Session Initiation Protocol
  • WLL Wireless Local Loop
  • PDA Personal Digital Assistant
  • the execution subject of the Polar code encoding method may be the above-mentioned network device or terminal, which can be adopted when the network device or terminal as the sending end sends data or information Polar code encoding method.
  • the network device or terminal as the receiving end receives data or information, it is also necessary to first confirm the sub-channel sequence according to the method of the present invention.
  • the Polar code encoding method provided in the embodiment of the present application will be described in detail below.
  • Step 201 Acquire a first sequence for encoding K bits to be encoded.
  • Step 202 According to the rate matching scheme and / or reliability ranking, select the sequence numbers of the K polarized channels from the first sequence.
  • the sequence numbers of the K polarized channels selected from the first sequence according to the rate matching scheme and the reliability order refer to the sequence number corresponding to the removal of the puncturing bits from the first sequence
  • the number of the polarized channels refers to the number of the K polarized channels with the highest reliability except the polarized channel corresponding to the shortened bit number from the first sequence. In practice, there may be other polarization channels that need to be frozen in advance. In this case, when selecting polarization channels corresponding to K information bits, it is not necessary to consider these pre-frozen polarization channels.
  • Step 203 Place the bits to be coded according to the sequence numbers of the selected K polarized channels, and perform Polar code coding on the bits to be coded.
  • the first sequence is all or a subsequence of the second sequence
  • the second sequence includes sequence numbers of N max polarization channels
  • the sequence numbers of the N max polarization channels are in accordance with the second sequence
  • the reliability of the N max polarized channels is arranged from small to large or from large to small, N max is a positive integer, the N max is greater than or equal to N, the sequence number of the polarized channels in the first sequence
  • the reliability ranking of is consistent with the reliability ranking of the serial numbers of the polarized channels in the second sequence that are less than N. Therefore, only the second sequence corresponding to N max may be stored in advance, or a plurality of possible first sequences may be stored in advance.
  • the encoding method provided in this embodiment determines the number of bits to be encoded K according to the target code length N of the Polar code after receiving the input information bits, regardless of the online calculation or the way of pre-calculation and storage.
  • the first sequence can be obtained from the second sequence.
  • the second sequence is the first sequence.
  • the second sequence contains the reliability order of the maximum code length N max polarized channels supported by the communication system.
  • the first sequence can be obtained from the pre-stored second sequence, and then the information bits are determined according to the first sequence, and finally the K bits to be encoded are subjected to Polar encoding to obtain the Polar encoded bit sequence.
  • the following is a detailed introduction to the sequence of the polarization channel sequence numbers obtained by sorting according to the reliability of the i-th polarization channel among the N (or N max ) polarization channels.
  • the number of the N polarized channels may be 0 ⁇ (N-1) or 1 ⁇ N.
  • the value of i when determining the reliability of the i-th polarization channel of the N polarization channels, the value of i may be 1, 2, ..., N, or may be 0, 1, ..., N- 1.
  • the first sequence can be part or all of any sequence shown in sequence Q1-sequence Q6. These sequences can also be represented by the corresponding tables Q1 to Q6. "Or reliability number” is the natural order of reliability from low to high, and the polarization channel number is the polarization channel number in the corresponding sequence. The "part” here has 3 different meanings:
  • the length N of the first sequence is not a positive integer power of 2, and the code length in the example given is a positive integer power of 2, so it can only be part of any sequence shown in sequence Q1-sequence Q6 ;or
  • the N-coding device supported by the encoding device is smaller than the N-protocol specified in the protocol , so it is only necessary to take the N- coding device in any sequence shown in the sequence Q1-sequence Q6;
  • Sequence Q1 sequence length is 1024:
  • sequence length is 512:
  • Sequence Q3 sequence length is 256:
  • Sequence Q5 sequence length is 64:
  • Sequence Q6 the sequence length is 32:
  • the positions of a few elements in the sequence are interchanged.
  • the position of the serial number can be adjusted within the set range. For example, if the set range is 5, the position of the element with the serial number of 10 can be adjusted in the left and right 5 positions;
  • the sequence contains N elements from 0 to the end of N-1, and the N elements from 0 to the end of N-1 represent the sequence numbers of N polarized channels.
  • the sequence numbers of the N polarized channels can also start from 1 to end at N, and all the sequence numbers in the above sequence can be incremented by 1, which is also the sequence number form in the above calculation methods.
  • the serial number or identification of the above-mentioned polarized channel may also be expressed in other ways, and this specific expression does not affect the specific position of the polarized channel represented in the sequence.
  • the sequence numbers of the N polarized channels in the above sequence are arranged according to the reliability of the N polarized channels from small to large. At this time, K polarized channels are selected according to the rate matching scheme and according to the reliability from high to low. It means that when the rate matching scheme is puncturing, the polarized channels corresponding to the last K serial numbers other than the polarized channel corresponding to the punctured bit serial number and the pre-frozen polarized channel are selected; when the rate matching scheme is shortened , Select the polarization channel corresponding to the last K numbers except the polarization channel corresponding to the shortened bit number.
  • sequence numbers of the N polarized channels can also be arranged according to the reliability of the N polarized channels from large to small, and the elements in the above sequence can be arranged in reverse order or reverse order.
  • Selecting K polarized channels from high to low specifically means that when the rate matching scheme is puncturing, the first K serial numbers except the polarized channel corresponding to the punctured bit number and the pre-frozen polarized channel are selected.
  • the above sequence can also be characterized by the normalized reliability or equivalent reliability sequence of each channel. For example, if the sorting position of the channel x in the above sequence is n (the leftmost record is 1), the reliability of the channel can be expressed as n or normalized n / N, where N is the length of the sequence.
  • sequence numbers of the N polarized channels in the stored sequence or table are arranged according to the reliability of the N polarized channels from small to large or from large to small, which includes N starting from 0 to ending at N-1 Elements, N elements starting from 0 to ending N-1 represent the number of N polarized channels. In fact, the sequence numbers of the N polarized channels can also start from 1 and end at N.
  • the specific fields / fields in the PBCH are arranged in the manner specified in the protocol or in any other agreed manner between the sending end and the receiving end.
  • the stored first sequence will also change accordingly.
  • an embodiment of the present application also provides a Polar code encoding device 300, which is used to perform the method shown in FIG. 2 Polar code encoding method.
  • Part or all of the Polar code encoding method shown in FIG. 2 may be implemented by hardware or software.
  • the Polar code encoding device 300 includes: an input interface circuit 301 for acquiring bits to be encoded
  • the logic circuit 302 is used to execute the Polar code encoding method shown in FIG. 2 above.
  • the output interface circuit 303 is used to output the encoded bit sequence.
  • the encoded bit sequence output by the encoding device 300 is modulated by the modulator 310 and output to the transceiver 320, and the transceiver 320 performs corresponding processing on the modulated sequence (including but not limited to digital-to-analog conversion and / or frequency conversion, etc.) Process) and send it out through the antenna 330.
  • the Polar code encoding device 300 may be a chip or an integrated circuit when specifically implemented.
  • the Polar code encoding device 300 includes: at least one memory 401 for storing programs; at least one process The device 402 is used to execute the program stored in the memory 401, and when the program is executed, the Polar code encoding device 300 can implement the Polar code encoding method provided in the embodiment of FIG. 2 described above.
  • the above-mentioned memory 401 may be a physically independent unit, or as shown in FIG. 5, the memory 501 and the processor 502 are integrated together.
  • the Polar code encoding apparatus 300 may also include only the processor 402.
  • the memory 401 for storing the program is located outside the Polar code encoding device 300, and the processor 402 is connected to the memory 401 through a circuit / wire to read and execute the program stored in the memory 401.
  • the processor 402 may be a central processing unit (CPU), a network processor (NP), or a combination of CPU and NP.
  • CPU central processing unit
  • NP network processor
  • the processor 402 may further include a hardware chip.
  • the hardware chip may be an application-specific integrated circuit (ASIC), a programmable logic device (PLD) or a combination thereof.
  • the PLD may be a complex programmable logic device (complex programmable logic device (CPLD), field programmable gate array (FPGA), general array logic (GAL) or any combination thereof.
  • the memory in the above embodiments may include volatile memory (volatile memory), such as random-access memory (RAM); the memory may also include non-volatile memory (non-volatile memory), such as flash Memory (flash memory), hard disk (HDD) or solid-state drive (SSD); the memory may also include a combination of the above types of memory.
  • volatile memory such as random-access memory (RAM)
  • non-volatile memory such as flash Memory (flash memory), hard disk (HDD) or solid-state drive (SSD)
  • flash memory flash Memory
  • HDD hard disk
  • SSD solid-state drive
  • the memory may also include a combination of the above types of memory.
  • Polar code encoding device 300 Based on the Polar code encoding method shown in FIG. 2, as shown in FIG. 6, an embodiment of the present application further provides a Polar code encoding device 300, which is used to perform the Polar code encoding method shown in FIG. 2, Polar code encoding device 300 includes:
  • the determining unit 602 is configured to rank the K polarized channels from the first sequence according to the rate matching scheme and / or reliability ranking;
  • the coding unit 603 is configured to place the bits to be coded according to the sequence numbers of the selected K polarized channels, and perform Polar code coding on the bits to be coded.
  • the first sequence may be any one of the above-mentioned exemplary sequences, or a sequence number with a sequence number less than N may be taken from the second sequence with a length of Nmax (the sequence number starts from 0).
  • the reliability of the ith polarized channel among the N polarized channels can also be determined by any of the above-mentioned exemplary formulas.
  • An embodiment of the present application further provides a computer storage medium that stores a computer program, and the computer program includes a method for performing the Polar code encoding shown in FIG. 2.
  • Embodiments of the present application also provide a computer program product containing instructions, which when run on a computer, causes the computer to execute the Polar code encoding method shown in FIG. 2.
  • the embodiment of the present application further provides a Polar code decoding method.
  • the specific process is as follows.
  • Step 701 Acquire a first sequence for determining the sequence numbers of K information bits to be decoded.
  • Step 702 Select the sequence numbers of the K polarized channels from the first sequence according to the rate matching scheme and / or reliability ranking.
  • the sequence numbers of the K polarized channels selected from the first sequence according to the rate matching scheme and the reliability order refer to the sequence number corresponding to the removal of the puncturing bits from the first sequence
  • the number of the polarized channels refers to the number of the K polarized channels with the highest reliability except the polarized channel corresponding to the shortened bit number from the first sequence.
  • Step 703 Perform Polar code decoding on the bits to be decoded according to the sequence numbers of the selected K polarized channels.
  • the first sequence is all or a subsequence of the second sequence
  • the second sequence includes sequence numbers of N max polarization channels
  • the sequence numbers of the N max polarization channels are in accordance with the second sequence
  • the reliability of the N max polarized channels is arranged from small to large or from large to small, N max is a positive integer, the N max is greater than or equal to N, the sequence number of the polarized channels in the first sequence
  • the reliability ranking of is consistent with the reliability ranking of the serial numbers of the polarized channels in the second sequence that are less than N. Therefore, only the second sequence corresponding to N max may be stored in advance, or a plurality of possible first sequences may be stored in advance.
  • the specific sequence, including the sequence storing the serial number of the PBCH subchannel can refer to the aforementioned sequence example on the coding side, which will not be repeated here.
  • the number K of information bits to be decoded is determined according to the target code length N of the Polar code, whether it is calculated online or pre-calculated and stored, If the second sequence is known, the first sequence can be obtained from the second sequence.
  • N max N
  • the second sequence is the first sequence.
  • the second sequence contains the reliability order of the maximum code length N max polarized channels supported by the communication system.
  • the first sequence can be obtained from the pre-stored second sequence, and then the sequence number of the information bit to be decoded is determined according to the first sequence, and finally the Polar to be decoded is decoded to obtain K information bits to be decoded sequence.
  • a Polar code decoding device 800 is also provided in the embodiments of the present application.
  • the Polar code encoding device 800 is used to execute the method shown in FIG. 7 Polar code decoding method shown. Part or all of the Polar code decoding method shown in FIG. 7 may be implemented by hardware or software.
  • the Polar code decoding device 800 includes: an input interface circuit 803 for acquiring Decoding bits; logic circuit 802, used to perform the Polar code decoding method shown in FIG. 7 above, for details, please refer to the description in the previous method embodiments, and no more details will be given here; output interface circuit 801 is used for output decoding After the bit sequence.
  • the antenna 830 receives the signal, inputs it to the demodulator 810 via the transceiver 820 for corresponding processing (including but not limited to digital-analog conversion and / or frequency conversion, etc.), and then inputs it to the decoding device 800 for decoding.
  • processing including but not limited to digital-analog conversion and / or frequency conversion, etc.
  • the Polar code decoding device 800 may be a chip or an integrated circuit when specifically implemented.
  • the Polar code encoding device 800 includes: at least one memory 901 for storing programs; at least one The processor 902 is configured to execute a program stored in the memory 901, and when the program is executed, the Polar code decoding apparatus 800 can implement the Polar code decoding method provided in the embodiment of FIG. 7 described above.
  • the above memory 901 may be a physically independent unit, or as shown in FIG. 10, the memory 1001 and the processor 1002 are integrated together.
  • the Polar code decoding device 800 may also include only the processor 902.
  • the memory 901 for storing the program is located outside the Polar code decoding device 800, and the processor 902 is connected to the memory 901 through a circuit / wire to read and execute the program stored in the memory 901.
  • the processor 902 may be a central processing unit (CPU), a network processor (NP), or a combination of CPU and NP.
  • CPU central processing unit
  • NP network processor
  • the processor 902 may further include a hardware chip.
  • the hardware chip may be an application-specific integrated circuit (ASIC), a programmable logic device (PLD) or a combination thereof.
  • the PLD may be a complex programmable logic device (complex programmable logic device (CPLD), field programmable gate array (FPGA), general array logic (GAL) or any combination thereof.
  • the memory in the above embodiments may include volatile memory (volatile memory), such as random-access memory (RAM); the memory may also include non-volatile memory (non-volatile memory), such as flash Memory (flash memory), hard disk (HDD) or solid-state drive (SSD); the memory may also include a combination of the above types of memory.
  • volatile memory such as random-access memory (RAM)
  • non-volatile memory such as flash Memory (flash memory), hard disk (HDD) or solid-state drive (SSD)
  • flash memory flash Memory
  • HDD hard disk
  • SSD solid-state drive
  • the memory may also include a combination of the above types of memory.
  • Polar code decoding device 800 Based on the Polar code decoding method shown in FIG. 7, as shown in FIG. 11, an embodiment of the present application further provides a Polar code decoding device 800, which is used to perform the Polar code translation shown in FIG. 7. Coding method, Polar code encoding device 800 includes:
  • the obtaining unit 1101 is used to obtain a first sequence for determining K information bits to be decoded.
  • the determining unit 1102 is configured to rank the K polarized channels from the first sequence according to the rate matching scheme and / or reliability ranking;
  • the coding unit 1103 is configured to perform Polar code decoding according to the sequence numbers of the selected K polarized channels.
  • the first sequence may be any one of the above-mentioned exemplary sequences, or a sequence number with a sequence number less than N may be taken from the second sequence with a length of Nmax (the sequence number starts from 0).
  • the reliability of the ith polarized channel among the N polarized channels can also be determined by any of the above-mentioned exemplary formulas.
  • An embodiment of the present application also provides a computer storage medium that stores a computer program, and the computer program includes a method for decoding the Polar code shown in FIG. 7.
  • Embodiments of the present application also provide a computer program product containing instructions, which when run on a computer, causes the computer to execute the Polar code decoding method shown in FIG. 7.
  • the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware. Moreover, the present application may take the form of a computer program product implemented on one or more computer usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer usable program code.
  • computer usable storage media including but not limited to disk storage, CD-ROM, optical storage, etc.
  • These computer program instructions can be provided to the processor of a general-purpose computer, special-purpose computer, embedded processing machine, or other programmable data processing device to produce a machine that enables the generation of instructions executed by the processor of the computer or other programmable data processing device
  • These computer program instructions may also be stored in a computer-readable memory that can guide a computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture including an instruction device, the instructions The device implements the functions specified in one block or multiple blocks of the flowchart one flow or multiple flows and / or block diagrams.
  • These computer program instructions can also be loaded onto a computer or other programmable data processing device, so that a series of operating steps are performed on the computer or other programmable device to produce computer-implemented processing, which is executed on the computer or other programmable device
  • the instructions provide steps for implementing the functions specified in one block or multiple blocks of the flowchart one flow or multiple flows and / or block diagrams.

Abstract

本申请涉及通信技术领域，公开了一种Polar码编译码方法及装置，用以提升序列查找效率。该方法为：根据编码参数从Polar码构造序列表中获取第一序列，Polar码构造序列表中包括至少一个编码参数以及与所述至少一个编码参数对应的至少一个序列，编码参数与序列一一映射，第一序列为所述至少一个序列中的一个，第一序列由极化信道序号组成并按所述极化信道序号对应的极化信道可靠度由小到大或者由大到小排列，编码参数包括母码长度、待编码信息比特数量、速率匹配后的比特数量中至少一个；根据速率匹配方案和/或可靠度排序从第一序列中选择K个极化信道的序号，按照所选择的K个极化信道的序号放置待编码比特，并进行Polar码编码，得到编码后的比特序列。

Description

Polar码编码方法及装置 技术领域
本申请实施例涉及通信技术领域，尤其涉及一种Polar码编码方法及装置。
背景技术
信道编码作为最基本的无线接入技术，在保证数据的可靠性传输方面起到至关重要的作用。在现有的无线通信系统中，一般采用Turbo码、低密度奇偶校验码(low density parity check，LDPC)和极化(Polar)码进行信道编码。Turbo码不能够支持过低或过高码率的信息传输。而对于中短包传输，Turbo码和LDPC码也由于自身编译码的特点，在有限码长下很难达到理想的性能。在实现方面，Turbo码和LDPC码在编译码实现过程中具有较高的计算复杂度。Polar码是理论上证明可以取得香农容量，且具有相对简单的编译码复杂度的好码，因而得到了越来越广泛的应用。
但是，随着无线通信系统的快速演进，第五代(5th generation，5G)通信系统等未来的通信系统将会出现一些新的特点。例如，最典型的三个通信场景包括增强型移动互联网(enhance mobile broadband，eMBB)、海量机器连接通信(massive machine type communication，mMTC)和高可靠低延迟通信(ultra reliable low latency communication，URLLC)。这些通信场景对于Polar码的编译码性能提出了更高的要求。
发明内容
本申请实施例提供一种Polar码编码方法及装置，用以降低获取用于Polar编码的第一序列的操作时延。
本申请实施例提供的具体技术方案如下：
第一方面，提供一种Polar码编码方法，编码装置根据编码参数从Polar码构造序列表中获取第一序列，所述Polar码构造序列表中包括至少一个编码参数以及与所述至少一个编码参数对应的至少一个序列，所述至少一个编码参数与所述至少一个序列为一一映射，所述第一序列为所述至少一个序列中的一个，所述第一序列由极化信道序号组成并按所述极化信道序号对应的极化信道可靠度由小到大或者由大到小排列，所述编码参数包括母码长度、待编码信息比特的数量、速率匹配后的比特的数量中至少一个；按照由第一序列确定的K个极化信道的序号放置所述待编码比特，并对所述待编码比特进行Polar码编码，得到编码后的比特序列，其中由所述第一序列确定K个极化信道的序号是根据速率匹配方案和/或可靠度确定的。相对于现有方案，本发明提供了一种在预存的序列中直接选取第一序列的方案，省去了从系统存储的最大母码序列中嵌套读取的操作，降低了操作时延。
在一个可能的设计中，所述第一序列中包含L个极化信道序号，L为正整数，L等于K或者N，其中，N为Polar码的母码长度，N＝2 n，n为正整数，K为待编码比特的数量，K小于N或者K等于N；或者，所述第一序列中包含K个极化信道的序号，K为正整数。
在一个可能的设计中，用于PBCH信道的Polar编码的第一序列长度为56，所述第一 序列按照可靠度从小到大排列，且所述第一序列对应的极化信道序号从0开始，存储为[441,469,247,367,253,375,444,470,483,415,485,473,474,254,379,431,489,486,476,439,490,463,381,497,492,443,382,498,445,471,500,446,475,487,504,255,477,491,478,383,493,499,502,494,501,447,505,506,479,508,495,503,507,509,510,511]，需要说明的是，上述序列也可以按照自然顺序的方式存储，存储为[247，253，254，255，367，375，379，381，382，383，415，431，439，441，443，444，445，446，447，463，469，470，471，473，474，475，476，477，478，479，483，485，486，487，489，490，491，492，493，494，495，497，498，499，500，501，502，503，504，505，506，507，508，509，510，511]，其中序号为[446，478，487，490，491，492，493，494 495，497，498，499，500，501，502，503，504，505，506，507，508，509，510，511]的极化信道用于放置CRC比特。
在一个可能的设计中，所述第一序列为第二序列的全部或者子序列，所述第二序列中包含N max个极化信道的序号，所述N max个极化信道的序号在所述第二序列中是按照所述N max个极化信道的可靠度由小到大或者由大到小排列的，N max为正整数，所述N max大于或等于N，所述第一序列中的极化信道的序号的可靠度排序与所述第二序列中的极化信道的序号小于N的序号的可靠度排序一致。
在一个可能的设计中，所述第一序列可以为说明书序列Q1-序列Q6所示的任意一个序列的部分或全部，所述第一序列中的N个极化信道的序号是按所述N个极化信道的可靠度从小到大排列的，且所述极化信道的序号最小值为0。
在一个可能的设计中，所述第一序列为说明书表Q1-表Q6所示的任意一个序列的部分或全部，所述第一序列中的N个极化信道的序号是按所述N个极化信道的可靠度从小到大排列的，且所述极化信道的序号最小值为0。
第二方面，提供一种极化Polar码译码方法，译码装置获取待译码比特，所述译码装置根据译码参数从Polar码构造序列表中获取第一序列，所述Polar码构造序列表中包括至少一个译码参数以及与所述至少一个译码参数对应的至少一个序列，所述至少一个译码参数与所述至少一个序列为一一映射，所述第一序列为所述至少一个序列中的一个，所述第一序列由极化信道序号组成并按所述极化信道序号对应的极化信道可靠度由小到大或者由大到小排列，所述译码参数包括母码长度、待译码信息比特的数量、速率匹配后的比特的数量中至少一个；按照由所述第一序列确定的K个待译码信息比特的序号，对待译码比特进行Polar译码，得到K个待译码信息比特，其中所述第一序列确定的K个极化信道的序号是根据速率匹配方案和/或可靠度排序确定的；
在一种可能设计中，所述第一序列中包含L个极化信道序号，L为正整数，L等于K或者N，其中，N为Polar码的母码长度，N＝2 n，n为正整数，K为待译码信息比特的数量，K小于N或者K等于N；
在一种可能设计中，所述第二序列中包含N个极化信道的序号，所述N个极化信道的序号在所述第二序列中是按照所述N个极化信道的可靠度由小到大或者由大到小排列的；
在一种可能设计中，所述第一序列为说明书序列Q1-序列Q6所示的任意一个序列的部分或全部，所述第一序列中的N个极化信道的序号是按所述N个极化信道的可靠度从小到大排列的，且所述极化信道的序号最小值为0。
在一种可能设计中，所述第一序列为说明书表Q1-表Q6所示的任意一个序列的部分或全部，所述第一序列中的N个极化信道的序号是按所述N个极化信道的可靠度从小到大排列的，且所述极化信道的序号最小值为0。
在一种可能设计中，所述第一序列和/或第二序列是预先存储的。
在一种可能设计中，所述第一序列用于PBCH信道的Polar编码，按照自然顺序存储为[247，253，254，255，367，375，379，381，382，383，415，431，439，441，443，444，445，446，447，463，469，470，471，473，474，475，476，477，478，479，483，485，486，487，489，490，491，492，493，494，495，497，498，499，500，501，502，503，504，505，506，507，508，509，510，511]，其中所述第一序列对应的极化信道序号从0开始。
在一种可能设计中，所述第一序列中序号为[446，478，487，490，491，492，493，494 495，497，498，499，500，501，502，503，504，505，506，507，508，509，510，511]的极化信道用于放置循环冗余校验比特。
在一种可能设计中，所述N个极化信道的序号为0～(N-1)或1～N。
在一种可能设计中，所述K个待编码比特中包括循环冗余校验比特。
在一种可能设计中，所述K个待编码比特中包括奇偶校验比特。
第三方面，提供一种Polar码编码装置，该装置具有实现上述第一方面和第一方面的任一种可能的设计中所述的方法的功能。所述功能可以通过硬件实现，也可以通过硬件执行相应的软件实现。所述硬件或软件包括一个或多个与上述功能相对应的模块。
在一个可能的设计中，当所述功能的部分或全部通过硬件实现时，所述Polar码编码装置包括：输入接口电路，用于获取待编码比特；逻辑电路，用于执行上述第一方面和第一方面的任一种可能的设计中所述的行为；输出接口电路，用于输出编码后的比特序列。
在一个可能的设计中，当所述功能的部分或全部通过软件实现时，所述Polar码编码装置包括：存储器，用于存储程序；处理器，用于执行所述存储器存储的所述程序，当所述程序被执行时，所述Polar码编码装置可以实现如上述第一方面和第一方面的任一种可能的设计中所述的方法。
可选的，上述存储器可以是物理上独立的单元，也可以与处理器集成在一起。
在一个可能的设计中，当所述功能的部分或全部通过软件实现时，所述Polar码编码装置包括处理器。用于存储程序的存储器位于所述编码装置之外，处理器通过电路/电线与存储器连接，用于读取并执行所述存储器中存储的程序。
第四方面，提供一种Polar码译码装置，该装置具有实现上述第二方面和第二方面的任一种可能的设计中所述的方法的功能。所述功能可以通过硬件实现，也可以通过硬件执行相应的软件实现。所述硬件或软件包括一个或多个与上述功能相对应的模块。
在一个可能的设计中，当所述功能的部分或全部通过硬件实现时，所述Polar码译码装置包括：输入接口电路，用于获取待译码比特；逻辑电路，用于执行上述第二方面和第二方面的任一种可能的设计中所述的行为；输出接口电路，用于输出译码后的K个信息比特序列。
在一个可能的设计中，当所述功能的部分或全部通过软件实现时，所述Polar码译码装置包括：存储器，用于存储程序；处理器，用于执行所述存储器存储的所述程序，当所述 程序被执行时，所述Polar码译码装置可以实现如上述第二方面和第二方面的任一种可能的设计中所述的方法。
可选的，上述存储器可以是物理上独立的单元，也可以与处理器集成在一起。
在一个可能的设计中，当所述功能的部分或全部通过软件实现时，所述Polar码译码装置包括处理器。用于存储程序的存储器位于所述译码装置之外，处理器通过电路/电线与存储器连接，用于读取并执行所述存储器中存储的程序。
第五方面，提供了一种通信系统，该通信系统包网络设备和终端，所述网络设备或终端可以执行如上述第一方面及其可能的设计所述的方法。
第六方面，提供了一种通信系统，该通信系统包网络设备和终端，所述网络设备或终端可以执行如上述第二方面及其可能的设计所述的方法。
第七方面，提供了一种计算机存储介质，存储有计算机程序，该计算机程序包括用于执行第三方面和第三方面的任一可能设计中任一种所述的方法的指令。
第八方面，提供了一种计算机存储介质，存储有计算机程序，该计算机程序包括用于执行第四方面和第四方面的任一可能设计中任一种所述的方法的指令。
第九方面，本申请实施例提供了一种包含指令的计算机程序产品，当其在计算机上运行时，使得计算机执行上述各方面所述的方法。
第十方面，提供了一种无线设备，包括用于实施第一方面和第一方面的任一可能设计的编码装置，调制器和收发器，
所述调制器用于调制编码后的比特序列得到调制后的序列；
所述收发器用于发送所述调制后的序列。
在一个可能的设计中，所述无线设备为终端或者网络设备。
第十一方面，提供了一种无线设备，包括用于实施第二方面和第二方面的任一可能设计的译码装置，解调器和收发器，
所述解调器用于解调调制后的序列得到待译码的序列；
所述收发器用于接收所述调制后的序列。
在一个可能的设计中，所述无线设备为终端或者网络设备。
附图说明
图1为本申请实施例中应用的通信系统架构示意图；
图2为本申请实施例中Polar码编码方法的流程示意图；
图3为本申请实施例中Polar码编码装置结构示意图之一；
图4为本申请实施例中Polar码编码装置结构示意图之二；
图5为本申请实施例中Polar码编码装置结构示意图之三；
图6为本申请实施例中Polar码编码装置结构示意图之四。
图7为本申请实施例中Polar码译码方法的流程示意图；
图8为本申请实施例中Polar码译码装置结构示意图之一；
图9为本申请实施例中Polar码译码装置结构示意图之二；
图10为本申请实施例中Polar码译码装置结构示意图之三；
图11为本申请实施例中Polar码译码装置结构示意图之四。
具体实施方式
极化信道的可靠度排序对Polar码的编译码性能起到重要作用，现有技术方案中，获取用于Polar编码的构造序列时，需要从预先存储的最长母码序列根据嵌套特性才能读取出目标码长的构造序列，这一步骤会带来额外的操作开销，可以设计新的技术方案，降低操作时延。
下面将结合附图，对本申请实施例进行详细描述。
本申请实施例提供一种Polar码编码方法及装置，根据极化信道的可靠度，获得可靠度排序，按照可靠度排序选择用于发送信息比特的极化信道的序号，按照所选择的信息比特序号进行Polar码编码，本申请实施例可以更确切的计算得到Polar码各子信道的可靠度。下面结合附图详细说明本发明实施例提供的编码方法和装置。
为方便对本申请实施例的理解，下面对Polar码作简单介绍。
Polar码的编码策略利用无噪信道传输用户有用的信息，全噪信道传输约定的信息或者不传信息。Polar码也是一种线性块码，其编码矩阵为G N，编码过程为
Figure PCTCN2019112714-appb-000001
其中
Figure PCTCN2019112714-appb-000002
是一个二进制的行矢量，长度为N(即码长)；G N是一个N×N的矩阵，且
Figure PCTCN2019112714-appb-000003
定义为log 2N个矩阵F 2的克罗内克(Kronecker)乘积。上述矩阵
Figure PCTCN2019112714-appb-000004
Polar码的编码过程中，
Figure PCTCN2019112714-appb-000005
中的一部分比特用来携带信息，称为信息比特集合，这些比特的索引的集合记作
Figure PCTCN2019112714-appb-000006
另外的一部分比特设置为接收端和发送端预先约定的固定值，称之为固定比特集合或冻结比特集合(frozen bits)，其索引的集合用
Figure PCTCN2019112714-appb-000007
的补集
Figure PCTCN2019112714-appb-000008
表示。Polar码的编码过程相当于：
Figure PCTCN2019112714-appb-000009
这里，G N(A)是G N中由集合
Figure PCTCN2019112714-appb-000010
中的索引对应的那些行得到的子矩阵，G N(A C)是G N中由集合
Figure PCTCN2019112714-appb-000011
中的索引对应的那些行得到的子矩阵。
Figure PCTCN2019112714-appb-000012
为
Figure PCTCN2019112714-appb-000013
中的信息比特集合，数量为K，一般地，包括但不限于循环冗余校验(Cyclic Redundancy Check，简称CRC)比特和奇偶校验(Parity Check，简称PC)比特在内的各类校验比特也都包括在信息比特集合中；
Figure PCTCN2019112714-appb-000014
为
Figure PCTCN2019112714-appb-000015
中的固定比特集合，其数量为(N-K)，是已知比特。这些固定比特通常被设置为0，但是只要接收端和发送端预先约定，固定比特可以被任意设置。从而，Polar码的编码输出可简化为：
Figure PCTCN2019112714-appb-000016
这里
Figure PCTCN2019112714-appb-000017
为
Figure PCTCN2019112714-appb-000018
中的信息比特集合，
Figure PCTCN2019112714-appb-000019
为长度K的行矢量，即
Figure PCTCN2019112714-appb-000020
|·|表示集合中元素的个数，K为信息块大小，
Figure PCTCN2019112714-appb-000021
是矩阵G N中由集合
Figure PCTCN2019112714-appb-000022
中的索引对应的那些行得到的子矩阵，
Figure PCTCN2019112714-appb-000023
是一个K×N的矩阵。
Polar码的构造过程即集合
Figure PCTCN2019112714-appb-000024
的选取过程，决定了Polar码的性能。Polar码的构造过程通常是，根据母码码长N确定共存在N个极化信道，分别对应编码矩阵的N个行，计算极化信道可靠度，将可靠度较高的前K个极化信道的索引作为集合
Figure PCTCN2019112714-appb-000025
的元素，剩余(N-K)个极化信道对应的索引作为固定比特的索引集合
Figure PCTCN2019112714-appb-000026
的元素。集合
Figure PCTCN2019112714-appb-000027
决定了信息比特的位置，集合
Figure PCTCN2019112714-appb-000028
决定了固定比特的位置。极化信道的序号即为信息比特或者固定比特的位置索引， 也即在
Figure PCTCN2019112714-appb-000029
中的位置索引。
本申请实施例提供的方案涉及如何确定极化信道可靠度。本申请实施例的基本发明思路是：极化信道可靠度可以通过可靠度来表征，可以通过查表的方式快速的获取表征可靠度的构造序列。从而降低操作时延。
图1为本发明实施例无线通信网络的结构示意图。图1只是一种示例，其它能用到本发明实施例的编码方法或装置的无线网络也都在本发明的保护范围内。
如图1所示，无线通信网络100包括网设备110，和终端112。当无线通信网络100包括核心网102时，该网络设备110还可以与核心网102相连。网络设备110还可以与IP网络104进行通信，例如，因特网(internet)，私有的IP网，或其它数据网等。网络设备为覆盖范围内的终端提供服务。例如，参见图1所示，网络设备110为网络设备110覆盖范围内的一个或多个终端112提供无线接入。除此之外，网络设备之间的覆盖范围可以存在重叠的区域，例如网络设备110和120。网络设备之间还可以可以互相通信，例如，网络设备110可以与网络设备120之间进行通信。
上述网络设备可以是用于与终端设备进行通信的设备。例如，可以是GSM系统或CDMA系统中的基站(Base Transceiver Station，BTS)，也可以是WCDMA系统中的基站(NodeB，NB)，还可以是LTE系统中的演进型基站(Evolved Node B，eNB或eNodeB)或未来5G网络中的网络侧设备等。或者该网络设备还可以是中继站、接入点、车载设备等。在终端对终端(Device to Device，D2D)通信系统中，该网络设备还可以是担任基站功能的终端。
上述终端可以指用户设备(User Equipment，UE)、接入终端、用户单元、移动站、远方站、远程终端、移动设备、用户终端、无线通信设备、用户代理或用户装置。接入终端可以是蜂窝电话、无绳电话、会话启动协议(Session Initiation Protocol，SIP)电话、无线本地环路(Wireless Local Loop，WLL)站、个人数字助理(Personal Digital Assistant，PDA)、具有无线通信功能的手持设备、计算设备或连接到无线调制解调器的其它处理设备、车载设备、可穿戴设备，未来5G网络中的终端设备等。基于图1所示的通信系统架构，本申请实施例中，执行Polar码编码方法的执行主体可以为上述网络设备或终端，当网络设备或终端作为发送端发送数据或信息时，均可以采用此Polar码编码方法。相应的，当网络设备或终端作为接收端接收数据或信息时，也需要根据本发明所述的方法先确认子信道序列。下面将对本申请实施例提供的Polar码编码方法做详细介绍。
基于图1所示的通信系统架构，如图2所示，本申请实施例提供的Polar码编码方法具体流程如下所述。
步骤201、获取用于对K个待编码比特进行编码的第一序列。
其中，第一序列中包含L个极化信道的序号，L为正整数，L等于K或者N，其中，N为Polar码的母码长度，N＝2 n，n为正整数，K为待编码比特的数量，K小于N或者K等于N。
步骤202、根据速率匹配方案和/或可靠度排序，从第一序列中选择K个极化信道的序号。其中，当速率匹配方案为打孔时，所述根据速率匹配方案和可靠度排序从第一序列中选择K个极化信道的序号，是指从第一序列中选择除去打孔比特序号所对应的极化信道和预冻结极化信道以外可靠度最高的K个极化信道的序号；当所述速率匹配方案为缩短时， 所述根据速率匹配方案和可靠度排序从第一序列中选择K个极化信道的序号，是指从第一序列中选择除去缩短比特序号所对应的极化信道以外可靠度最高的K个极化信道的序号。实践中，还可能有另外一些需要预先冻结的极化信道，这样的话，在选取K个信息比特对应的极化信道时，就无需考虑这些预先冻结的极化信道了。
步骤203、按照所选择的K个极化信道的序号放置所述待编码比特，并对待编码比特进行Polar码编码。
可选的，第一序列为第二序列的全部或者子序列，第二序列中包含N max个极化信道的序号，所述N max个极化信道的序号在所述第二序列中是按照所述N max个极化信道的可靠度由小到大或者由大到小排列的，N max为正整数，所述N max大于或等于N，所述第一序列中的极化信道的序号的可靠度排序与所述第二序列中的极化信道的序号小于N的序号的可靠度排序一致。因此，既可以预先只存储N max对应的第二序列，也可以预先存储多个可能的第一序列。
可选的，根据目标码长对Polar码编码后的序列进行速率匹配。
本实施例提供的编码方法，通过接收到输入的信息比特后，根据Polar码的目标码长N确定待编码比特的个数K，无论在线计算还是预先计算并存储的方式，若已知第二序列，则可以从第二序列中获取第一序列，当N max＝N时，第二序列即为第一序列。其中，第二序列中包含通信系统所支持的最大码长N max个极化信道的可靠度排序。可选的，可以从预先存储的第二序列中获取第一序列，接着根据第一序列确定出信息比特，最后对K个待编码比特进行Polar编码，获得Polar编码后的比特序列。还可以直接预先存储多个可能的第一序列，从而根据N或K直接选定相应的第一序列即可，这样可以更快的确定第一序列，不需要根据N max对应的序列嵌套读取N对应的序列，提高了效率。
下面具体介绍一下根据N(或者N max)个极化信道中第i个极化信道的可靠度进行排序得到的极化信道序号的序列。N个极化信道的序号可以为0～(N-1)，也可以为1～N。本申请实施例中，在确定N个极化信道的第i个极化信道的可靠度时，i的取值可以为1、2、…、N，也可以为0、1、…、N-1。
可以理解的是，本申请实施例中涉及的公式只是一种举例，本领域技术人员可以在对公式进行简单的变形而不影响公式的性能的基础上获得的方案，均属于本申请实施例保护的范围。
具体的序列例子可以参见如下序列，第一序列可以是序列Q1-序列Q6所示的任意一个序列的部分或全部，这些序列也可以用相应的表格Q1至表格Q6来表示，其中的“可靠度或可靠度序号”即为可靠度由低到高的自然顺序，而极化信道序号则为对应序列中的极化信道序号，这里的‘部分’有3个不同的含义：
1)第一序列的长度N不是2的正整数次幂，而所给的例子中的码长都是2的正整数次幂，所以只能是序列Q1-序列Q6所示任一序列的部分；或者
2)编码设备支持的N 编码设备小于协议规定的N 协议，则也只需取序列Q1-序列Q6所示的任意一个序列中的N 编码设备即可；
或者3)实际采用的长度为N的序列其中一部分与序列Q1-序列Q6所示的任意一个序列的一部分完全一致。
序列Q1，序列长度为1024：
[0,1,2,4,8,16,32,3,5,64,9,6,17,10,18,128,12,33,65,20,256,34,24,36,7,129,66,512,11,40,68,130,19,13,48,14,72,257,21,132,35,258,26,513,80,37,25,22,136,260,264,38,514,96,67,41,144,28,69,42,516,49,74,272,160,520,288,528,192,544,70,44,131,81,50,73,15,320,133,52,23,134,384,76,137,82,56,27,97,39,259,84,138,145,261,29,43,98,515,88,140,30,146,71,262,265,161,576,45,100,640,51,148,46,75,266,273,517,104,162,53,193,152,77,164,768,268,274,518,54,83,57,521,112,135,78,289,194,85,276,522,58,168,139,99,86,60,280,89,290,529,524,196,141,101,147,176,142,530,321,31,200,90,545,292,322,532,263,149,102,105,304,296,163,92,47,267,385,546,324,208,386,150,153,165,106,55,328,536,577,548,113,154,79,269,108,578,224,166,519,552,195,270,641,523,275,580,291,59,169,560,114,277,156,87,197,116,170,61,531,525,642,281,278,526,177,293,388,91,584,769,198,172,120,201,336,62,282,143,103,178,294,93,644,202,592,323,392,297,770,107,180,151,209,284,648,94,204,298,400,608,352,325,533,155,210,305,547,300,109,184,534,537,115,167,225,326,306,772,157,656,329,110,117,212,171,776,330,226,549,538,387,308,216,416,271,279,158,337,550,672,118,332,579,540,389,173,121,553,199,784,179,228,338,312,704,390,174,554,581,393,283,122,448,353,561,203,63,340,394,527,582,556,181,295,285,232,124,205,182,643,562,286,585,299,354,211,401,185,396,344,586,645,593,535,240,206,95,327,564,800,402,356,307,301,417,213,568,832,588,186,646,404,227,896,594,418,302,649,771,360,539,111,331,214,309,188,449,217,408,609,596,551,650,229,159,420,310,541,773,610,657,333,119,600,339,218,368,652,230,391,313,450,542,334,233,555,774,175,123,658,612,341,777,220,314,424,395,673,583,355,287,183,234,125,557,660,616,342,316,241,778,563,345,452,397,403,207,674,558,785,432,357,187,236,664,624,587,780,705,126,242,565,398,346,456,358,405,303,569,244,595,189,566,676,361,706,589,215,786,647,348,419,406,464,680,801,362,590,409,570,788,597,572,219,311,708,598,601,651,421,792,802,611,602,410,231,688,653,248,369,190,364,654,659,335,480,315,221,370,613,422,425,451,614,543,235,412,343,372,775,317,222,426,453,237,559,833,804,712,834,661,808,779,617,604,433,720,816,836,347,897,243,662,454,318,675,618,898,781,376,428,665,736,567,840,625,238,359,457,399,787,591,678,434,677,349,245,458,666,620,363,127,191,782,407,436,626,571,465,681,246,707,350,599,668,790,460,249,682,573,411,803,789,709,365,440,628,689,374,423,466,793,250,371,481,574,413,603,366,468,655,900,805,615,684,710,429,794,252,373,605,848,690,713,632,482,806,427,904,414,223,663,692,835,619,472,455,796,809,714,721,837,716,864,810,606,912,722,696,377,435,817,319,621,812,484,430,838,667,488,239,378,459,622,627,437,380,818,461,496,669,679,724,841,629,351,467,438,737,251,462,442,441,469,247,683,842,738,899,670,783,849,820,728,928,791,367,901,630,685,844,633,711,253,691,824,902,686,740,850,375,444,470,483,415,485,905,795,473,634,744,852,960,865,693,797,906,715,807,474,636,694,254,717,575,913,798,811,379,697,431,607,489,866,723,486,908,718,813,476,856,839,725,698,914,752,868,819,814,439,929,490,623,671,739,916,463,843,381,497,930,821,726,961,872,492,631,729,700,443,741,845,920,382,822,851,730,498,880,742,445,471,635,932,687,903,825,500,846,745,826,732,446,962,936,475,853,867,637,907,487,695,746,828,753,854,857,504,799,255,964,909,719,477,915,638,748,944,869,491,699,754,858,478,968,383,910,815,976,870,917,727,493,873,701,931,756,860,499,731,823,922,874,918,502,933,743,760,881,494,702,921,501,876,847,992,447,733,827,934,882,937,963,747,505,855,924,734,829,965,938,884,506,749,945,966,755,859,940,830,911,871,639,888,479,946,750,969,508,861,757,970,919,875,862,758,948,977,923,972,761,877,952,495,703,935,978,883,762,503,925,878,735,993,885,939,994,980,926,764,941,967,886,831,947,507,889,984,751,942,996,971,890,509,949,973,1000,892,950,863,759,1008,510,979,953,763,974,954,879,981,982,927,995,765,956,887,985,997,986,943,891,998,766,511,988,1001,951,1002,893,975,894,1009,955,1004,1010,957,983,958,987,1012,999,1016,767,989,1003,990,1005,959,1011,1013,895,1006,1014,1017,1018,991,1020,1007,1015,1019,1021,1022,1023]
表Q1，序列长度为1024：
Figure PCTCN2019112714-appb-000030
Figure PCTCN2019112714-appb-000031
Figure PCTCN2019112714-appb-000032
Figure PCTCN2019112714-appb-000033
序列Q2，序列长度为512：
[0,1,2,4,8,16,32,3,5,64,9,6,17,10,18,128,12,33,65,20,256,34,24,36,7,129,66,11,40,68,130,19,13,48,14,72,257,21,132,35,258,26,80,37,25,22,136,260,264,38,96,67,41,144,28,69,42,49,74,272,160,288,192,70,44,131,81,50,73,15,320,133,52,23,134,384,76,137,82,56,27,97,39,259,84,138,145,261,29,43,98,88,140,30,146,71,262,265,161,45,100,51,148,46,75,266,273,104,162,53,193,152,77,164,268,274,54,83,57,112,135,78,289,194,85,276,58,168,139,99,86,60,280,89,290,196,141,101,147,176,142,321,31,200,90,292,322,263,149,102,105,304,296,163,92,47,267,385,324,208,386,150,153,165,106,55,328,113,154,79,269,108,224,166,195,270,275,291,59,169,114,277,156,87,197,116,170,61,281,278,177,293,388,91,198,172,120,201,336,62,282,143,103,178,294,93,202,323,392,297,107,180,151,209,284,94,204,298,400,352,325,155,210,305,300,109,184,115,167,225,326,306,157,329,110,117,212,171,330,226,387,308,216,416,271,279,158,337,118,332,389,173,121,199,179,228,338,312,390,174,393,283,122,448,353,203,63,340,394,181,295,285,232,124,205,182,286,299,354,211,401,185,396,344,240,206,95,327,402,356,307,301,417,213,186,404,227,418,302,360,111,331,214,309,188,449,217,408,229,159,420,310,333,119,339,218,368,230,391,313,450,334,233,175,123,341,220,314,424,395,355,287,183,234,125,342,316,241,345,452,397,403,207,432,357,187,236,126,242,398,346,456,358,405,303,244,189,361,215,348,419,406,464,362,409,219,311,421,410,231,248,369,190,364,335,480,315,221,370,422,425,451,235,412,343,372,317,222,426,453,237,433,347,243,454,318,376,428,238,359,457,399,434,349,245,458,363,127,191,407,436,465,246,350,460,249,411,365,440,374,423,466,250,371,481,413,366,468,429,252,373,482,427,414,223,472,455,377,435,319,484,430,488,239,378,459,437,380,461,496,351,467,438,251,462,442,441,469,247,367,253,375,444,470,483,415,485,473,474,254,379,431,489,486,476,439,490,463,381,497,492,443,382,498,445,471,500,446,475,487,504,255,477,491,478,383,493,499,502,494,501,447,505,506,479,508,495,503,507,509,510,511]
表Q2，序列长度为512：
Figure PCTCN2019112714-appb-000034
Figure PCTCN2019112714-appb-000035
Figure PCTCN2019112714-appb-000036
序列Q3，序列长度为256：
[0,1,2,4,8,16,32,3,5,64,9,6,17,10,18,128,12,33,65,20,34,24,36,7,129,66,11,40,68,130,19,13,48,14,72,21,132,35,26,80,37,25,22,136,38,96,67,41,144,28,69,42,49,74,160,192,70,44,131,81,50,73,15,133,52,23,134,76,137,82,56,27,97,39,84,138,145,29,43,98,88,140,30,146,71,161,45,100,51,148,46,75,104,162,53,193,152,77,164,54,83,57,112,135,78,194,85,58,168,139,99,86,60,89,196,141,101,147,176,142,31,200,90,149,102,105,163,92,47,208,150,153,165,106,55,113,154,79,108,224,166,195,59,169,114,156,87,197,116,170,61,177,91,198,172,120,201,62,143,103,178,93,202,107,180,151,209,94,204,155,210,109,184,115,167,225,157,110,117,212,171,226,216,158,118,173,121,199,179,228,174,122,203,63,181,232,124,205,182,211,185,240,206,95,213,186,227,111,214,188,217,229,159,119,218,230,233,175,123,220,183,234,125,241,207,187,236,126,242,244,189,215,219,231,248,190,221,235,222,237,243,238,245,127,191,246,249,250,252,223,239,251,247,253,254,255]
表Q3，序列长度为256：
Figure PCTCN2019112714-appb-000037
Figure PCTCN2019112714-appb-000038
序列Q4，序列长度为128：
[0,1,2,4,8,16,32,3,5,64,9,6,17,10,18,12,33,65,20,34,24,36,7,66,11,40,68,19,13,48,14,72,21,35,26,80,37,25,22,38,96,67,41,28,69,42,49,74,70,44,81,50,73,15,52,23,76,82,56,27,97,39,84,29,43,98,88,30,71,45,100,51,46,75,104,53,77,54,83,57,112,78,85,58,99,86,60,89,101,31,90,102,105,92,47,106,55,113,79,108,59,114,87,116,61,91,120,62,103,93,107,94,109,115,110,117,118,121,122,63,124,95,111,119,123,125,126,127]
表Q4，序列长度为128：
Figure PCTCN2019112714-appb-000039
序列Q5，序列长度为64：
[0,1,2,4,8,16,32,3,5,9,6,17,10,18,12,33,20,34,24,36,7,11,40,19,13,48,14,21,35,26,37,25,22,38,41,28,42,49,44,50,15,52,23,56,27,39,29,43,30,45,51,46,53,54,57,58,60,31,47,55,59,61,62,63]
表Q5，序列长度为64：
Figure PCTCN2019112714-appb-000040
Figure PCTCN2019112714-appb-000041
序列Q6，序列长度为32：
[0,1,2,4,8,16,3,5,9,6,17,10,18,12,20,24,7,11,19,13,14,21,26,25,22,28,15,23,27,29,30,31]
表Q6，序列长度为32：
Figure PCTCN2019112714-appb-000042
需要说明的是，上述一些序列只是一些举例，其应用到Polar编码过程中会有助于提高Poalr码编译码性能。任一种举例的序列中，在不影响其整体效果的前提下，可以做包括但不限于如下几方面的调整或者等同替换：
1、序列中少数元素之间的位置互换。例如，序号位置可以在设定幅度内调整，例如，设定幅度为5，将序号为10的元素位置在左右5个位置内调整均可；
2、序列中的部分元素进行调整，但是根据该序列选择出用于传输T比特信息的信道集合是一致或相似的。
3、序列中包含从0开始到N-1结束的N个元素，从0开始到N-1结束的N个元素代表N个极化信道的序号。实际上，N个极化信道的序号也可以从1开始到N结束，将上述序列中各序号均加1即可，这也是上述各计算方式中的序号形式。当然，也可以采取其他方式表示上述极化信道的序号或者标识，该具体表达方式不影响序列中所表示的极化信道的具体位置。
4、上述序列中的N个极化信道的序号是按照N个极化信道可靠度从小到大排列的，这时根据速率匹配方案并按可靠度从高到低选取K个极化信道，具体是指当速率匹配方案为打孔时，选择除去打孔比特序号所对应的极化信道和预冻结极化信道以外的最后K个序号对应的极化信道；当所述速率匹配方案为缩短时，选择除去缩短比特序号所对应的极化信道以外的最后K个序号对应的极化信道。实际上，N个极化信道的序号也可以按照N个极化信道可靠度从大到小排列，将上述序列中的元素逆序排列或者反序排列即可，这时根据速率匹配方案并按可靠度从高到低选取K个极化信道具体是指当速率匹配方案为打孔时，选择除去打孔比特序号所对应的极化信道和预冻结极化信道以外的最开始K个序号对应的极化信道；当所述速率匹配方案为缩短时，选择除去缩短比特序号所对应的极化信道以外的最开始K个序号对应的极化信道。
5、上述序列还可以利用各个信道的归一化可靠度或等效可靠度序列进行表征。例如：信道x在上述序列的排序位置为n(最左面的记为1)则该信道的可靠度可以表示为n或者归一化的n/N，其中N为序列的长度。
在实际应用中，可以只根据Nmax存储Nmax对应的序列或表，即L＝Nmax，也可以根据所支持的所有不同的N取值存储多个N对应的序列或表，即，L＝N，进一步的，也可以根据所支持的所有不同的N取值存储多个N对应的序列或表的一部分，即L<N。其中，存储的序列或表格中的N个极化信道的序号是按所述N个极化信道的可靠度从小到大或者从大到小排列，其包含从0开始到N-1结束的N个元素，从0开始到N-1结束的N个元素代表N个极化信道的序号。实际上，N个极化信道的序号也可以从1开始到N结束。
进一步地，用于物理广播信道(Physical Broadcast Channel，PBCH)的Polar编码的待编码信息比特的数数目为56，由于这个值基本保持不变，且对应的码率也保持不变，因此对应的母码长度、速率匹配方式等都基本不变，所以可以只存储与这56个待编码信息比特对应的极化信道的序号，即第一序列长度L＝K，取为56，则将所述第一序列按照可靠度从小到大排列且对应的极化信道序号从0开始时，存储的第一序列为[441,469,247,367,253,375,444,470,483,415,485,473,474,254,379,431,489,486,476,439,490,463,381,497,492,443,382,498,445,471,500,446,475,487,504,255,477,491,478,383,493,499,502,494,501,447,505,506,479,508,495,503,507,509,510,511]，需要说明的是，上述序列也可以按照自然顺序的方式存储，因此可以存储为[247，253，254，255，367，375，379，381，382，383，415，431，439，441，443，444，445，446，447，463，469，470，471，473，474，475，476，477，478，479，483，485，486，487，489，490，491，492，493，494，495，497，498，499，500，501，502，503，504，505，506，507，508，509，510，511]，其中序号为[446，478，487，490，491，492，493，494 495，497，498，499，500，501，502，503，504，505，506，507，508，509，510，511]的极化信道用于放置CRC比特。所述PBCH中具体各个字段/域按协议规定的方式或其他任一发送端与接收端的约定方式进行排列。当然，随着无线通信标准的发展，如果PBCH包括的待编码信息比特数目发生变化，那么所存储的第一序列也会相应变化。
基于图2所示的Polar码编码方法的同一发明构思，如图3所示，本申请实施例中还提供一种Polar码编码装置300，该Polar码编码装置300用于执行图2所示的Polar码编码方法。图2所示的Polar码编码方法中的部分或全部可以通过硬件来实现也可以通过软件来实现，当通过硬件实现时，Polar码编码装置300包括：输入接口电路301，用于获取待编码比特；逻辑电路302，用于执行上述图2所示的Polar码编码方法，具体请见前面方法实施例中的描述，此处不再赘述；输出接口电路303，用于输出编码后的比特序列。
进一步地，该编码装置300输出的编码后的比特序列经过调制器310调制后输出给收发器320，收发器320对调制后的序列进行相应处理(包括但不限于数模变换和/或变频等处理)后通过天线330发送出去。
可选的，Polar码编码装置300在具体实现时可以是芯片或者集成电路。
可选的，当上述实施例的Polar码编码方法中的部分或全部通过软件来实现时，如图4所示，Polar码编码装置300包括：至少一个存储器401，用于存储程序；至少一个处理器402，用于执行存储器401存储的程序，当程序被执行时，使得Polar码编码装置300可以 实现上述图2实施例提供的Polar码编码方法。
可选的，上述存储器401可以是物理上独立的单元，也可以如图5所示，存储器501与处理器502集成在一起。
可选的，当上述图2实施例的编码方法中的部分或全部通过软件实现时，Polar码编码装置300也可以只包括处理器402。用于存储程序的存储器401位于Polar码编码装置300之外，处理器402通过电路/电线与存储器401连接，用于读取并执行存储器401中存储的程序。
处理器402可以是中央处理器(central processing unit，CPU)，网络处理器(network processor，NP)或者CPU和NP的组合。
处理器402还可以进一步包括硬件芯片。上述硬件芯片可以是专用集成电路(application-specific integrated circuit，ASIC)，可编程逻辑器件(programmable logic device，PLD)或其组合。上述PLD可以是复杂可编程逻辑器件(complex programmable logic device，CPLD)，现场可编程逻辑门阵列(field-programmable gate array，FPGA)，通用阵列逻辑(generic array logic,GAL)或其任意组合。
上述实施例中的存储器可以包括易失性存储器(volatile memory)，例如随机存取存储器(random-access memory，RAM)；存储器也可以包括非易失性存储器(non-volatile memory)，例如快闪存储器(flash memory)，硬盘(hard disk drive，HDD)或固态硬盘(solid-state drive，SSD)；存储器还可以包括上述种类的存储器的组合。
基于图2所示的Polar码编码方法，如图6所示，本申请实施例还提供了一种Polar码编码装置300，Polar码编码装置300用于执行图2所示的Polar码编码方法，Polar码编码装置300包括：
获取单元601，用于获取用于对K个待编码比特进行编码的第一序列，第一序列中包含L个极化信道的序号，L为正整数，L等于K或者N，其中，N为Polar码的母码长度，N＝2 n，n为正整数，K为待编码比特的数量，K小于N或者K等于N；
确定单元602，用于根据速率匹配方案和/或可靠度排序，从第一序列中确定K个极化信道的序号；
编码单元603，用于按照所选择的K个极化信道的序号放置待编码比特，并对待编码比特进行Polar码编码。
其中，第一序列可以为上述任一种举例的序列，也可以是从长度为Nmax的第二序列中取出序号小于N的序号(序号从0开始)。N个极化信道中第i个极化信道的可靠度也可以通过上述任一种举例的公式来确定。
本申请实施例还提供了一种计算机存储介质，存储有计算机程序，该计算机程序包括用于执行图2所示的Polar码编码方法。
本申请实施例还提供了一种包含指令的计算机程序产品，当其在计算机上运行时，使得计算机执行图2所示的Polar码编码方法。
基于图1所示的通信系统架构，如图7所示，本申请实施例还提供了Polar码译码方法，具体流程如下所述。
步骤701、获取用于确定K个待译码信息比特序号的第一序列。
其中，第一序列中包含L个极化信道的序号，L为正整数，L等于K或者N，其中，N为Polar码的母码长度，N＝2 n，n为正整数，K为待译码信息比特的数量，K小于N或者K等于N。
步骤702、根据速率匹配方案和/或可靠度排序，从第一序列中选择K个极化信道的序号。其中，当速率匹配方案为打孔时，所述根据速率匹配方案和可靠度排序从第一序列中选择K个极化信道的序号，是指从第一序列中选择除去打孔比特序号所对应的极化信道和预冻结极化信道以外可靠度最高的K个极化信道的序号；当所述速率匹配方案为缩短时，所述根据速率匹配方案和可靠度排序从第一序列中选择K个极化信道的序号，是指从第一序列中选择除去缩短比特序号所对应的极化信道以外可靠度最高的K个极化信道的序号。实践中，还可能有另外一些需要预先冻结的极化信道，这样的话，在选取K个信息比特对应的极化信道时，就无需考虑这些预先冻结的极化信道了。具体选取方式与编码侧类似。
步骤703、按照所选择的K个极化信道的序号对待译码比特进行Polar码译码。
可选的，第一序列为第二序列的全部或者子序列，第二序列中包含N max个极化信道的序号，所述N max个极化信道的序号在所述第二序列中是按照所述N max个极化信道的可靠度由小到大或者由大到小排列的，N max为正整数，所述N max大于或等于N，所述第一序列中的极化信道的序号的可靠度排序与所述第二序列中的极化信道的序号小于N的序号的可靠度排序一致。因此，既可以预先只存储N max对应的第二序列，也可以预先存储多个可能的第一序列。具体的序列，包括存储PBCH子信道序号的序列，可以参见前述编码侧的序列例子，这里不再赘述。
可选的，根据目标码长对待译码比特序列进行解速率匹配。
本实施例提供的译码方法，通过接收到输入的待译码比特后，根据Polar码的目标码长N确定待译码信息比特的个数K，无论在线计算还是预先计算并存储的方式，若已知第二序列，则可以从第二序列中获取第一序列，当N max＝N时，第二序列即为第一序列。其中，第二序列中包含通信系统所支持的最大码长N max个极化信道的可靠度排序。可选的，可以从预先存储的第二序列中获取第一序列，接着根据第一序列确定出待译码信息比特序号，最后对待译码比特进行Polar译码，获得K个待译码信息比特序列。
基于图7所示的Polar码译码方法的同一发明构思，如图8所示，本申请实施例中还提供一种Polar码译码装置800，该Polar码编码装置800用于执行图7所示的Polar码译码方法。图7所示的Polar码译码方法中的部分或全部可以通过硬件来实现也可以通过软件来实现，当通过硬件实现时，Polar码译码装置800包括：输入接口电路803，用于获取待译码比特；逻辑电路802，用于执行上述图7所示的Polar码译码方法，具体请见前面方法实施例中的描述，此处不再赘述；输出接口电路801，用于输出译码后的比特序列。
进一步地，天线830接收信号，经收发器820输入给解调器810进行相应的处理(包括但不限于数模变换和/或变频等处理)后，输入给该译码装置800进行译码。
可选的，Polar码译码装置800在具体实现时可以是芯片或者集成电路。
可选的，当上述实施例的Polar码译码方法中的部分或全部通过软件来实现时，如图9所示，Polar码编码装置800包括：至少一个存储器901，用于存储程序；至少一个处理器902，用于执行存储器901存储的程序，当程序被执行时，使得Polar码译码装置800可以实现上述图7实施例提供的Polar码译码方法。
可选的，上述存储器901可以是物理上独立的单元，也可以如图10所示，存储器1001与处理器1002集成在一起。
可选的，当上述图7实施例的译码方法中的部分或全部通过软件实现时，Polar码译码装置800也可以只包括处理器902。用于存储程序的存储器901位于Polar码译码装置800之外，处理器902通过电路/电线与存储器901连接，用于读取并执行存储器901中存储的程序。
处理器902可以是中央处理器(central processing unit，CPU)，网络处理器(network processor，NP)或者CPU和NP的组合。
处理器902还可以进一步包括硬件芯片。上述硬件芯片可以是专用集成电路(application-specific integrated circuit，ASIC)，可编程逻辑器件(programmable logic device，PLD)或其组合。上述PLD可以是复杂可编程逻辑器件(complex programmable logic device，CPLD)，现场可编程逻辑门阵列(field-programmable gate array，FPGA)，通用阵列逻辑(generic array logic,GAL)或其任意组合。
上述实施例中的存储器可以包括易失性存储器(volatile memory)，例如随机存取存储器(random-access memory，RAM)；存储器也可以包括非易失性存储器(non-volatile memory)，例如快闪存储器(flash memory)，硬盘(hard disk drive，HDD)或固态硬盘(solid-state drive，SSD)；存储器还可以包括上述种类的存储器的组合。
基于图7所示的Polar码译码方法，如图11所示，本申请实施例还提供了一种Polar码译码装置800，Polar码编码装置800用于执行图7所示的Polar码译码方法，Polar码编码装置800包括：
获取单元1101，用于获取用于确定K个待译码信息比特的第一序列，第一序列中包含L个极化信道的序号，L为正整数，L等于K或者N，其中，N为Polar码的母码长度，N＝2 n，n为正整数，K为待译码信息比特的数量，K小于N或者K等于N；
确定单元1102，用于根据速率匹配方案和/或可靠度排序，从第一序列中确定K个极化信道的序号；
编码单元1103，用于按照所选择的K个极化信道的序号进行Polar码译码。
其中，第一序列可以为上述任一种举例的序列，也可以是从长度为Nmax的第二序列中取出序号小于N的序号(序号从0开始)。N个极化信道中第i个极化信道的可靠度也可以通过上述任一种举例的公式来确定。
本申请实施例还提供了一种计算机存储介质，存储有计算机程序，该计算机程序包括用于执行图7所示的Polar码译码方法。
本申请实施例还提供了一种包含指令的计算机程序产品，当其在计算机上运行时，使得计算机执行图7所示的Polar码译码方法。
本领域内的技术人员应明白，本申请的实施例可提供为方法、系统、或计算机程序产品。因此，本申请可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。而且，本申请可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。
本申请是参照根据本申请实施例的方法、设备(系统)、和计算机程序产品的流程图和 /或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器，使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中，使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品，该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上，使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。
尽管已描述了本申请的优选实施例，但本领域内的技术人员一旦得知了基本创造性概念，则可对这些实施例作出另外的变更和修改。所以，所附权利要求意欲解释为包括优选实施例以及落入本申请范围的所有变更和修改。
显然，本领域的技术人员可以对本申请实施例进行各种改动和变型而不脱离本申请实施例的精神和范围。这样，倘若本申请实施例的这些修改和变型属于本申请权利要求及其等同技术的范围之内，则本申请也意图包含这些改动和变型在内。

Claims (32)

  1. 一种极化Polar码编码方法，其特征在于，包括：
    编码装置获取待编码比特；
    根据编码参数从Polar码构造序列表中获取第一序列，所述Polar码构造序列表中包括至少一个编码参数以及与所述至少一个编码参数对应的至少一个序列，所述至少一个编码参数与所述至少一个序列为一一映射，所述第一序列为所述至少一个序列中的一个，所述第一序列由极化信道序号组成并按所述极化信道序号对应的极化信道可靠度由小到大或者由大到小排列，所述编码参数包括母码长度、待编码信息比特的数量、速率匹配后的比特的数量中至少一个；
    按照由所述第一序列确定的K个极化信道的序号放置所述待编码比特，并对所述待编码比特进行Polar码编码，得到编码后的比特序列；
    输出所述编码后的码字。
  2. 如权利要求1所述的方法，其特征在于，由所述第一序列确定的K个极化信道的序号是根据速率匹配方案和/或可靠度排序确定的；
  3. 如权利要求1所述的方法，其特征在于，所述第一序列中包含L个极化信道序号，L为正整数，L等于K或者N，其中，N为Polar码的母码长度，N＝2 n，n为正整数，K为待编码比特的数量，K小于N或者K等于N。
  4. 如权利要求3所述的方法，其特征在于，所述第一序列为第二序列的全部或者子序列，其中，
    所述第二序列中包含N max个极化信道的序号，所述N max个极化信道的序号在所述第二序列中是按照所述N max个极化信道的可靠度由小到大或者由大到小排列的，N max为正整数，所述N max大于或等于N，所述第一序列中的极化信道的序号的可靠度排序与所述第二序列中的极化信道的序号小于N的序号的可靠度排序一致；
  5. 根据权利要求1-4中任一权利要求所述的方法，其特征在于，所述第一序列为说明书序列Q1-序列Q6所示的任意一个序列的部分或全部，所述第一序列中的N个极化信道的序号是按所述N个极化信道的可靠度从小到大排列的，且所述极化信道的序号最小值为0。
  6. 根据权利要求1-4中任一权利要求所述的方法，其特征在于，所述第一序列为说明书表Q1-表Q6所示的任意一个序列的部分或全部，所述第一序列中的N个极化信道的序号是按所述N个极化信道的可靠度从小到大排列的，且所述极化信道的序号最小值为0。
  7. 根据权利要求1-6中任一权利要求所述的方法，其特征在于，所述第一序列和/或第二序列是预先存储的。
  8. 根据权利要求1-7中任一权利要求所述的方法，其特征在于，所述第一序列用于PBCH信道的Polar编码，按照自然顺序存储为[247，253，254，255，367，375，379，381，382，383，415，431，439，441，443，444，445，446，447，463，469，470，471，473，474，475，476，477，478，479，483，485，486，487，489，490，491，492，493，494，495，497，498，499，500，501，502，503，504，505，506，507，508，509，510，511]，其中所述第一序列对应的极化信道序号从0开始。
  9. 根据权利要求8所述的方法，其特征在于，所述第一序列中序号为[446，478，487，490，491，492，493，494 495，497，498，499，500，501，502，503，504，505，506， 507，508，509，510，511]的极化信道用于放置循环冗余校验比特。
  10. 根据权利要求3-9中任一权利要求所述的方法，其特征在于，所述N个极化信道的序号为0～(N-1)或1～N。
  11. 根据权利要求1至10中任一权利要求所述的方法，所述K个待编码比特中包括循环冗余校验比特。
  12. 根据权利要求1至11中任一权利要求所述的方法，所述K个待编码比特中包括奇偶校验比特。
  13. 根据权利要求1至12中任一权利要求所述的方法，所述对所述待编码比特进行Polar码编码后，编码装置根据目标码长对Polar码编码后的序列进行所述速率匹配。
  14. 一种极化Polar码编码装置，其特征在于，包括：
    获取单元，用于根据编码参数从Polar码构造序列表中获取第一序列，所述Polar码构造序列表中包括至少一个编码参数以及与所述至少一个编码参数对应的至少一个序列，所述至少一个编码参数与所述至少一个序列为一一映射，所述第一序列为所述至少一个序列中的一个，所述第一序列由极化信道序号组成并按所述极化信道序号对应的极化信道可靠度由小到大或者由大到小排列，所述编码参数包括母码长度、待编码信息比特的数量、速率匹配后的比特的数量中至少一个；
    确定单元，用于根据速率匹配方案和/或可靠度排序从所述第一序列中确定K个极化信道的序号；
    编码单元，用于按照所选择的K个极化信道的序号放置所述待编码比特，并对所述待编码比特进行Polar码编码，得到编码后的比特序列。
  15. 如权利要求14所述的装置，其特征在于，所述第一序列中包含L个极化信道序号，L为正整数，L等于K或者N，其中，N为Polar码的母码长度，N＝2 n，n为正整数，K为待编码比特的数量，K小于N或者K等于N。
  16. 根据权利要求15所述的装置，其特征在于，所述第一序列为第二序列的全部或者子序列，其中，
    所述第二序列中包含N max个极化信道的序号，所述N max个极化信道的序号在所述第二序列中是按照所述N max个极化信道的可靠度由小到大或者由大到小排列的，N max为正整数，所述N max大于或等于N，所述第一序列中的极化信道的序号的可靠度排序与所述第二序列中的极化信道的序号小于N的序号的可靠度排序一致。
  17. 根据权利要求14-16中任一权利要求所述的装置，其特征在于，所述第一序列为说明书序列Q1-序列Q6所示的任意一个序列的部分或全部，所述第一序列中的N个极化信道的序号是按所述N个极化信道的可靠度从小到大排列的，且所述极化信道的序号最小值为0。
  18. 根据权利要求14-16中任一权利要求所述的装置，其特征在于，所述第一序列为说明书表Q1-表Q6所示的任意一个序列的部分或全部，所述第一序列中的N个极化信道的序号是按所述N个极化信道的可靠度从小到大排列的，且所述极化信道的序号最小值为0。
  19. 根据权利要求14-18中任一权利要求所述的装置，其特征在于，所述第一序列和/或第二序列是预先存储的。
  20. 根据权利要求14-19中任一权利要求所述的方法，其特征在于，所述第一序列用于 PBCH信道的Polar编码，按照自然顺序存储为[247，253，254，255，367，375，379，381，382，383，415，431，439，441，443，444，445，446，447，463，469，470，471，473，474，475，476，477，478，479，483，485，486，487，489，490，491，492，493，494，495，497，498，499，500，501，502，503，504，505，506，507，508，509，510，511]，其中所述第一序列对应的极化信道序号从0开始。
  21. 根据权利要求20所述的方法，其特征在于，所述第一序列中序号为[446，478，487，490，491，492，493，494 495，497，498，499，500，501，502，503，504，505，506，507，508，509，510，511]的极化信道用于放置循环冗余校验比特。
  22. 根据权利要求15-21中任一权利要求所述的装置，其特征在于，所述N个极化信道的序号为0～(N-1)或1～N。
  23. 根据权利要求14至22中任一权利要求所述的装置，所述K个待编码比特中包括循环冗余校验比特。
  24. 根据权利要求14至23中任一权利要求所述的装置，所述K个待编码比特中包括奇偶校验比特。
  25. 根据权利要求14至24中任一权利要求所述的装置，所述对所述待编码比特进行Polar码编码后，编码装置根据目标码长对Polar码编码后的序列进行速率匹配。
  26. 一种极化Polar码编码装置，其特征在于，包括：
    存储器，用于存储程序；
    处理器，用于执行所述存储器存储的所述程序，当所述程序被执行时，所述处理器用于执行如权利要求1～13任一项所述的方法。
  27. 如权利要求26所述的装置，其特征在于，所述Polar码编码装置为芯片或集成电路。
  28. 一种Polar码编码装置，其特征在于，包括：
    输入接口电路，用于获取待编码比特；
    逻辑电路，用于基于获取的待编码比特执行所述权利要求1～13任一项所述的方法，得到Polar码编码后的比特序列；
    输出接口电路，用于输出所述Polar码编码后的比特序列。
  29. 一种无线设备，其特征在于，包括如权利要求14-25所述的编码装置、调制器、收发器：
    所述调制器用于调制编码后的比特序列得到调制后的序列；
    所述收发器用于发送所述调制后的序列。
  30. 如权利要求29所述的设备，其特征在于，所述无线设备为终端或者网络设备。
  31. 一种计算机可读存储介质，其特征在于，所述介质用于存储程序指令，所述程序指令由通信装置执行时，使得通信装置执行所述权利要求1～13任一项所述的方法。
  32. 一种计算机程序，其特征在于，所述计算机程序包括程序指令，所述程序指令由通信装置执行时，使得通信装置执行所述权利要求1～13任一项所述的方法。
PCT/CN2019/112714 2018-11-16 2019-10-23 Polar码编码方法及装置 WO2020098461A1 (zh)

Priority Applications (3)

Application Number Priority Date Filing Date Title
EP19884185.0A EP3873010A4 (en) 2018-11-16 2019-10-23 Polar code encoding method and device
US17/322,529 US11502704B2 (en) 2018-11-16 2021-05-17 Polar coding method and apparatus
US17/956,399 US11750217B2 (en) 2018-11-16 2022-09-29 Polar coding method and apparatus

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201811363673.8 2018-11-16
CN201811363673.8A CN111200476B (zh) 2018-11-16 2018-11-16 Polar码编码方法及装置

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US17/322,529 Continuation US11502704B2 (en) 2018-11-16 2021-05-17 Polar coding method and apparatus

Publications (1)

Publication Number Publication Date
WO2020098461A1 true WO2020098461A1 (zh) 2020-05-22

Family

ID=70731259

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/112714 WO2020098461A1 (zh) 2018-11-16 2019-10-23 Polar码编码方法及装置

Country Status (4)

Country Link
US (2) US11502704B2 (zh)
EP (1) EP3873010A4 (zh)
CN (2) CN111200476B (zh)
WO (1) WO2020098461A1 (zh)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113810059A (zh) * 2020-06-12 2021-12-17 华为技术有限公司 一种用于卫星通信的极化编码译码方法及装置
CN113810155B (zh) * 2020-06-17 2022-11-18 华为技术有限公司 信道编译码方法和通信装置
CN113810060A (zh) * 2020-06-17 2021-12-17 华为技术有限公司 一种Polar码速率匹配方法及装置

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160013810A1 (en) * 2014-07-10 2016-01-14 The Royal Institution For The Advancement Of Learning / Mcgill University Flexible polar encoders and decoders
CN108111252A (zh) * 2017-08-04 2018-06-01 中兴通讯股份有限公司 序列生成、数据解码方法及装置
CN108282260A (zh) * 2017-01-06 2018-07-13 株式会社Ntt都科摩 编码方法和编码器
CN108540259A (zh) * 2017-03-01 2018-09-14 电信科学技术研究院 一种极化码编译码方法及装置
CN108809486A (zh) * 2017-05-03 2018-11-13 华为技术有限公司 Polar码编译码方法及装置

Family Cites Families (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9454552B2 (en) * 2012-07-31 2016-09-27 Empire Technology Development Llc Entropy coding and decoding using polar codes
KR101951663B1 (ko) * 2012-12-14 2019-02-25 삼성전자주식회사 Crc 부호와 극 부호에 의한 부호화 방법 및 장치
US20150333775A1 (en) * 2014-05-15 2015-11-19 Broadcom Corporation Frozen-Bit Selection for a Polar Code Decoder
US9479291B2 (en) * 2015-02-13 2016-10-25 Samsung Electronics Co., Ltd. Apparatus and method of constructing polar code
US10432234B2 (en) * 2016-07-19 2019-10-01 Mediatek Inc. Low complexity rate matching for polar codes
US10637607B2 (en) * 2016-09-15 2020-04-28 Huawei Technologies Co., Ltd. Method and apparatus for encoding data using a polar code
CN108599891B (zh) * 2017-03-17 2020-05-08 华为技术有限公司 编码方法、编码装置和通信装置
CN107342774B (zh) * 2017-04-25 2024-04-12 华为技术有限公司 编码方法、译码方法、装置和设备
CN107332570B (zh) * 2017-06-06 2020-12-04 北京理工大学 分段级联Hash序列的极化码编码方法
CN114095123A (zh) * 2017-08-02 2022-02-25 华为技术有限公司 一种Polar码编码方法及装置
CN109327226B (zh) * 2017-08-04 2023-10-20 华为技术有限公司 极化码的编译码方法、装置及设备
WO2020049348A1 (en) * 2018-09-07 2020-03-12 Telefonaktiebolaget Lm Ericsson (Publ) Efficient polar code construction in 5g
US11206045B1 (en) * 2020-07-23 2021-12-21 Xilinx, Inc. Efficient determination of parity bit location for polar codes

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160013810A1 (en) * 2014-07-10 2016-01-14 The Royal Institution For The Advancement Of Learning / Mcgill University Flexible polar encoders and decoders
CN108282260A (zh) * 2017-01-06 2018-07-13 株式会社Ntt都科摩 编码方法和编码器
CN108540259A (zh) * 2017-03-01 2018-09-14 电信科学技术研究院 一种极化码编译码方法及装置
CN108809486A (zh) * 2017-05-03 2018-11-13 华为技术有限公司 Polar码编译码方法及装置
CN108111252A (zh) * 2017-08-04 2018-06-01 中兴通讯股份有限公司 序列生成、数据解码方法及装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
CHRISTOPHER SCHNELLING ET AL.: "Construction of Polar Codes Exploiting Channel Transformation Structure", IEEE COMMUNICATIONS LETTERS, vol. 19, no. 12, 31 December 2015 (2015-12-31), pages 2058 - 2061, XP011593053, DOI: 20200109150702A *

Also Published As

Publication number Publication date
CN114172617A (zh) 2022-03-11
CN111200476B (zh) 2021-12-14
EP3873010A4 (en) 2021-12-29
US20210328599A1 (en) 2021-10-21
EP3873010A1 (en) 2021-09-01
US20230098837A1 (en) 2023-03-30
US11502704B2 (en) 2022-11-15
US11750217B2 (en) 2023-09-05
CN111200476A (zh) 2020-05-26

Similar Documents

Publication Publication Date Title
US11811528B2 (en) Polar code encoding method and apparatus in wireless communications
JP6859444B2 (ja) 符号化及び復号化方法、無線デバイス並びにコンピュータ読み取り可能記憶媒体
WO2018177227A1 (zh) 一种编码方法、译码方法、装置和设备
WO2019158031A1 (zh) 编码的方法、译码的方法、编码设备和译码设备
US11750217B2 (en) Polar coding method and apparatus
CN109391343B (zh) 一种Polar码编码方法及装置
US11558068B2 (en) Method and apparatus for encoding polar code concatenated with CRC code
AU2018328362A1 (en) Encoding method and apparatus
US11165535B2 (en) Polar code encoding method and apparatus in wireless communications
WO2019052583A1 (zh) 极化码的速率匹配的方法和装置
EP3605902B1 (en) Polar code encoding method and device
WO2020147527A1 (zh) 一种极化编译码方法及装置
WO2022268130A1 (zh) 一种网络编码方法及装置
TWI707566B (zh) 一種通道編碼方法及設備
WO2022007621A1 (zh) 一种Polar码编解码方法及装置
WO2021254291A1 (zh) 一种Polar码速率匹配方法及装置
US20240146455A1 (en) Polar code encoding method and apparatus in wireless communications
WO2020220920A1 (zh) 一种编码方法及通信设备
WO2020063315A1 (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: 19884185

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2019884185

Country of ref document: EP

Effective date: 20210527