WO2018141271A1 - 数据处理的方法和装置 - Google Patents

数据处理的方法和装置 Download PDF

Info

Publication number
WO2018141271A1
WO2018141271A1 PCT/CN2018/075129 CN2018075129W WO2018141271A1 WO 2018141271 A1 WO2018141271 A1 WO 2018141271A1 CN 2018075129 W CN2018075129 W CN 2018075129W WO 2018141271 A1 WO2018141271 A1 WO 2018141271A1
Authority
WO
WIPO (PCT)
Prior art keywords
decoding
polar
length
encoding
information block
Prior art date
Application number
PCT/CN2018/075129
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 BR112019016100A priority Critical patent/BR112019016100A2/pt
Priority to EP18748162.7A priority patent/EP3567767A4/en
Publication of WO2018141271A1 publication Critical patent/WO2018141271A1/zh
Priority to US16/529,821 priority patent/US11044046B2/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/09—Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
    • 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
    • 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
    • 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
    • H03M13/1125—Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms using different domains for check node and bit node processing, wherein the different domains include probabilities, likelihood ratios, likelihood differences, log-likelihood ratios or log-likelihood difference pairs
    • 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/35—Unequal or adaptive error protection, e.g. by providing a different level of protection according to significance of source information or by adapting the coding according to the change of transmission channel characteristics
    • H03M13/353—Adaptation to the channel
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0041—Arrangements at the transmitter end
    • 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

Definitions

  • Embodiments of the present invention relate to the field of electronics and communication technologies, and, more particularly, to methods and apparatus for data processing.
  • Polar codes algorithm is the first procoding algorithm that theoretically proves that it can achieve Shannon capacity and has low coding and decoding (compilation code complexity is O(NlogN)) complexity.
  • Polar code encoding methods such as: CA-Polar and PC-Polar, how to choose the appropriate encoding and / or decoding method is currently an urgent problem to be solved.
  • Embodiments of the present invention provide a data processing method and apparatus, which improve the overall effect of encoding and/or decoding by selecting an appropriate Polar code encoding and/or decoding method.
  • an embodiment of the present invention provides a first data processing method, where the method includes:
  • the encoding end receives the information block to be encoded
  • the coding end encodes the information block according to the PC-Polar coding mode when the channel coding code parameter is in a range of values, and/or the coding end is in the case that the channel coding code parameter is in another value range. Encoding the information block according to a CA-Polar coding manner;
  • the encoding end outputs a result of encoding the information block.
  • the first data processing method provided by the embodiment of the present invention selects different coding modes according to different ranges of channel coding code parameters, so that the characteristics of each coding mode can be utilized in combination with the characteristics of multiple coding modes. To improve the overall effect of the code, for example: to obtain the system throughput gain.
  • the coding end encodes the information block according to a PC-Polar coding manner, where the channel coding code parameter is in a range of values, including:
  • the coding end encodes the information block according to the coding mode of the PC-Polar, where M represents the code length and K represents the information block. The length of the information bit in the middle.
  • the coding end is in the CA-Polar coding mode if the channel coding code parameter is in another value range.
  • Encoding the information block including:
  • the coding end encodes the information block according to the CA-Polar coding mode, where M represents the code length and K represents the information block. The length of the information bit in the middle.
  • an embodiment of the present invention provides a second data processing method, where the method includes:
  • the encoding end receives the information block to be encoded
  • the coding end encodes the information block according to the indication of the first indication signaling according to the PC-Polar coding manner, where the first indication signaling indicates that the information block is encoded according to a PC-Polar coding manner;
  • the encoding end outputs a result of encoding the information block.
  • the first indication signaling is carried by a physical channel such as a broadcast channel or a control channel.
  • an embodiment of the present invention provides a third data processing method, where the method includes:
  • the encoding end receives the information block to be encoded
  • the coding end encodes the information block according to the CA-Polar coding mode according to the indication of the second indication signaling, where the second indication signaling indicates that the information block is encoded according to the CA-Polar coding mode;
  • the encoding end outputs a result of encoding the information block.
  • the second indication signaling is carried by a physical channel such as a broadcast channel or a control channel.
  • the embodiment of the present invention provides a fourth data processing method, where the method includes:
  • the decoding end receives the data block to be decoded
  • the decoding end decodes the data block according to the PC-Polar decoding mode when the channel coding code parameter is in a range of values, and/or the decoding end is located at another value of the channel coding code parameter. In the case of a range, the data block is decoded according to a CA-Polar decoding method;
  • the decoding end outputs a result of decoding the data block.
  • different decoding modes are selected according to the range of channel coding code parameters, so that the advantages of each decoding mode can be exploited by combining the characteristics of multiple decoding modes. Improve the overall effect of decoding, for example: to obtain system throughput gain.
  • the decoding end decodes the data block according to a PC-Polar decoding manner, where the channel coding code parameter is in a range of values, including:
  • the data block is decoded according to the decoding mode of the PC-Polar, where M indicates when the data block is encoded.
  • the code length, K represents the length of the information bits that the data block had before being encoded.
  • the decoding end is in accordance with CA- in the case that the channel coding code parameter is in another value range.
  • the decoding of the data block by the decoding method includes: in the case of the channel coding code parameter K/M>1/12 or K ⁇ 120, the data block is translated according to the CA-Polar decoding mode.
  • a code where M represents the length of the code when encoding the data block, and K represents the length of the information bits that the data block had before being encoded.
  • an embodiment of the present invention provides a fifth data processing method, where the method includes:
  • the decoding end receives the data block to be decoded
  • the decoding end decodes the data block according to the PC-Polar decoding mode according to the indication of the third indication signaling, where the third indication signaling indicates that the data block is processed according to the PC-Polar decoding mode.
  • the decoding end outputs a result of decoding the data block.
  • the third indication signaling may be carried by a physical channel such as a broadcast channel or a control channel.
  • an embodiment of the present invention provides a sixth data processing method, where the method includes:
  • the decoding end receives the data block to be decoded
  • the decoding end decodes the data block according to the CA-Polar decoding mode according to the indication of the fourth indication signaling, where the fourth indication signaling indicates that the data block is processed according to the CA-Polar decoding mode.
  • the decoding end outputs a result of decoding the data block.
  • the fourth indication signaling may be carried by a physical channel such as a broadcast channel or a control channel.
  • the embodiment of the present invention provides a seventh data processing method, where the method includes:
  • the encoding end encodes the information block according to the PC-Polar encoding method
  • the decoding end decodes the result of encoding the information block transmitted through the channel according to the CA-Polar decoding manner.
  • the characteristics of each decoding mode can be combined with the characteristics of multiple decoding modes, and the comprehensive effect of decoding can be improved, for example, : Get system throughput gain.
  • an embodiment of the present invention provides an eighth data processing method, where the method includes:
  • the encoding end encodes the information block according to the CA-Polar encoding method
  • the decoding end decodes the result of encoding the information block transmitted through the channel according to a PC-Polar decoding manner.
  • the advantages of each decoding mode can be combined with the characteristics of multiple decoding modes, and the comprehensive effect of decoding can be improved, for example, : Get system throughput gain.
  • the encoding of the information block according to the CA-Polar encoding manner includes:
  • the encoding the information block according to the coding manner of the PC-Polar includes: generating a parity bit of length X2 based on the information block of length K2 and the check equation; and distributing the parity bit of length X2 to And within the information block; mapping the information block and the K2+X2 bits formed by the check bit of length X2 to the information bit, and placing the coding end and the decoding end at the position of the static fixed bit
  • the fixed value is further subjected to Arikan Polar coding, wherein the check equation characterizes a constraint relationship between the information block and the check bit of length X2, the information block having a length of K2.
  • the decoding end decoding according to the CA-Polar decoding manner includes:
  • the information block in the candidate result is the result of the decoding, or in the case where the verification of the plurality of candidate results fails, the information block in the candidate result of the path with the smallest PM (Path-metric) is the decoding. the result of.
  • the verifying the plurality of candidate results by using the check equation may specifically include: starting from a candidate result of the path with the smallest PM value, and using the check equation for the plurality of candidate results according to the PM value from small to large. Check it out.
  • the decoding end according to the PC-Polar decoding manner includes: selecting a decoding path in the decoding process by using a check bit and a check equation.
  • the value of the parity bit matches the LLR (Log likelihood ratio)
  • the information block of the selected decoding path is used as a decoding result.
  • the information block in the path with the smallest PM-Path value is used as the result of the decoding.
  • the channel coding code parameter refers to a parameter related to channel coding and/or channel coding.
  • the channel coding code parameter may specifically include at least one of the following parameters: N, M, K, L, and by N, M, Derived parameters determined by at least one of K and L.
  • N represents the length of the mother code of the Polar code
  • M represents the code length
  • K represents the length of the information block
  • L represents the search width in the decoding process.
  • the value of the K/M is located at K/M ⁇ 1/6. Any value within the range.
  • K/M ⁇ 1/12 may be specifically selected within the range of K/M ⁇ 1/6.
  • the value of the K/M is in the range of K/M>1/12 in the range of K/M>1/12. Any value within.
  • K/M>1/6 may also be specifically selected within the range of K/M>1/12.
  • the value of the K is located at any value within a range of K>48.
  • K>64 may also be specifically selected within the range of K>48.
  • K>80 may also be specifically selected within the range of K>64.
  • K>120 may also be specifically selected within the range of K>80.
  • the value of the K is located at any value within a range of K ⁇ 120.
  • K ⁇ 80 may also be specifically selected within the range of K ⁇ 120.
  • K ⁇ 64 may also be specifically selected within the range of K ⁇ 80.
  • K ⁇ 48 may also be specifically selected within the range of K ⁇ 64.
  • the embodiment of the present invention provides a ninth data processing method, where the method includes:
  • the coding end encodes the information block according to the CA-Polar and PC-Polar hybrid coding manner
  • the decoding end decodes the result of encoding the information block transmitted through the channel according to a CA-Polar and PC-Polar mixed decoding manner.
  • the ninth data processing method provided by the embodiment of the present invention, by combining the advantages of CA-Polar and PC-Polar, the coding and decoding methods of combining the two are adopted, thereby improving the comprehensive effect of coding and decoding. For example: Get system throughput gain.
  • the coding block is encoded according to a CA-Polar and PC-Polar hybrid coding manner.
  • An implementation manner including: generating a check bit of length X based on a block of length K and a first check equation, and distributing the check bit of length X into the information block;
  • the information block and the K+X bits consisting of the check bits of length X and the second check equation generate a check bit of length Y, and the check bit of length Y and the K+X Cascading bits, and mapping the information block, the check bit of length X and the check bit of length Y into K+X+Y bits, and placing the information bits in the position of static fixed bits A fixed value agreed upon by the encoding end and the decoding end, and then Arikan Polar encoding.
  • the first check equation is used to characterize a constraint relationship between information bits in the information block and parity bits of length X.
  • the second check equation is used to characterize a constraint relationship between the K+X bits and the parity bit of length Y, the length of the information block being K.
  • the decoding end decoding according to the CA-Polar and PC-Polar hybrid decoding manner includes: Selecting a decoding path by using a Y parity bit and a second parity equation to obtain a plurality of candidate results, wherein the candidate result includes the information block and the X schools Detecting bits, verifying the plurality of candidate results by using a first check equation, using the information block in the candidate result of the check as a result of decoding, or verifying the plurality of candidate results In the case of failure, the information block in the candidate result of the path with the smallest PM-Path is the result of the decoding.
  • the verifying the plurality of candidate results by using the check equation may specifically include: starting from the candidate result of the path with the smallest PM value, using the first school for the plurality of candidate results according to the PM value from small to large Check the equation for verification.
  • the encoding end before the coding end encodes the information block in the manner of CA-Polar and PC-Polar hybrid coding, : The encoding end receives the value of X and/or Y.
  • the encoding end receives an index of X and/or Y.
  • the index of X is used by the encoding end to obtain the value of the X according to the index of the X.
  • the index of Y is used by the encoding end to obtain the value of the Y according to the index of the Y.
  • the method further includes: the decoding end receiving the value of X and/or Y.
  • the method before decoding the encoded result of the information block of the channel transmission, the method further includes: the decoding end receiving an index of X and/or Y.
  • the index of X is used by the decoding end to obtain the value of the X according to the index of the X.
  • the index of Y is used by the decoding end to obtain the value of the Y according to the index of the Y.
  • Y is greater than or equal to 0, and Y is less than or equal to the code length.
  • X is greater than or equal to 0, and X is less than or equal to 24.
  • the embodiment of the present invention provides a first data processing apparatus, where the apparatus includes:
  • An interface module configured to receive information blocks to be encoded
  • a first encoding module configured to encode the information block according to a PC-Polar encoding manner when the channel coding code parameter is in a range of values, and/or, where the channel coding code parameter is located in another value range
  • the information block is encoded according to the CA-Polar coding method
  • the interface module is further configured to output a result of encoding the information block.
  • an embodiment of the present invention provides a second data processing apparatus, where the apparatus includes:
  • transceiver module configured to receive a data block to be decoded
  • a second decoding module configured to decode the data block according to a PC-Polar decoding mode when the channel coding code parameter is in a range of values, and/or, where the channel coding code parameter is located in another In the case of a value range, the data block is decoded according to a CA-Polar decoding method;
  • the transceiver module is further configured to output a result of decoding the data block.
  • the embodiment of the present invention provides a third data processing apparatus, where the apparatus includes:
  • a third encoding module configured to encode the information block according to a CA-Polar encoding manner
  • a third decoding module configured to decode, after the PC-Polar decoding, the result of encoding the information block that is transmitted through the channel.
  • the embodiment of the present invention provides a fourth data processing apparatus, where the apparatus includes:
  • a fourth encoding module configured to encode the information block according to a PC-Polar encoding manner
  • a fourth decoding module configured to decode, after the CA-Polar decoding, the result of encoding the information block that is transmitted through the channel.
  • the embodiment of the present invention provides a fifth data processing apparatus, where the apparatus includes:
  • a fifth encoding module configured to encode the information block according to a CA-Polar and PC-Polar hybrid coding manner
  • a fifth decoding module configured to decode the encoded result of the information block after channel transmission according to a CA-Polar and PC-Polar hybrid decoding manner.
  • an embodiment of the present invention provides a communication device, where the communication device includes: a processor, and a memory interconnected with the processor, when the communication device is running, the processor reads and Execution of the instructions in the memory or running its own hardware logic to cause the communication device to perform various embodiments of any one of the data processing methods described in the first to ninth aspects .
  • the memory is used to store the instruction, and the memory may be independent of the processor or integrated in the processor.
  • the communications apparatus may further include a transceiver for receiving and/or transmitting data.
  • Yet another aspect of an embodiment of the present application also provides a computer readable storage medium having stored therein instructions that, when run on a computer, cause the computer to perform the methods described in the above aspects .
  • Yet another aspect of an embodiment of the present application also provides a computer program product comprising instructions that, when executed on a computer, cause the computer to perform the methods described in the various aspects above.
  • FIG. 1 is a schematic diagram of an SCL decoding process used in an embodiment of the present invention.
  • 2(a) and 2(b) are schematic diagrams showing the two cases in the PM calculation process in the SCL decoding process in the embodiment of the present invention.
  • FIG. 3 is a schematic diagram of a coding process of a CRC concatenated Polar code in an embodiment of the present invention
  • FIG. 4 is a schematic diagram of a process of CRC encoding output in an embodiment of the present invention.
  • FIG. 5 is a schematic diagram of a check relationship in a PC-Polar encoding method according to an embodiment of the present invention
  • FIG. 6 is a schematic diagram of a decoding process of a PC-SCL in an embodiment of the present invention.
  • FIG. 7 is a schematic diagram of a first data processing method according to an embodiment of the present invention.
  • FIG. 8 is a schematic diagram of a second data processing method according to an embodiment of the present invention.
  • FIG. 9 is a schematic diagram of a third data processing method according to an embodiment of the present invention.
  • FIG. 10 is a schematic diagram of a fourth data processing method according to an embodiment of the present invention.
  • FIG. 11 is a schematic diagram of a fifth data processing method according to an embodiment of the present invention.
  • FIG. 12 is a schematic diagram of a first data processing apparatus according to an embodiment of the present invention.
  • FIG. 13 is a schematic diagram of a second data processing apparatus according to an embodiment of the present invention.
  • FIG. 14 is a schematic diagram of a third data processing apparatus according to an embodiment of the present invention.
  • FIG. 15 is a schematic diagram of a fourth data processing apparatus according to an embodiment of the present invention.
  • FIG. 16 is a schematic diagram of a fifth data processing apparatus according to an embodiment of the present invention.
  • Figure 17 is a schematic diagram of a communication device in accordance with an embodiment of the present invention.
  • Figure 18 is a schematic diagram of a wireless communication system in an embodiment of the present invention.
  • GSM Global System of Mobile communication
  • CDMA Code Division Multiple Access
  • WCDMA Wideband Code Division Multiple Access
  • GPRS General Packet Radio Service
  • LTE Long Term Evolution
  • FDD Frequency Division Duplex
  • TDD Time Division Duplex
  • UMTS Universal Mobile Telecommunication System
  • the base station may be a device for communicating with the terminal device, for example, may be a base station (Base Transceiver Station, BTS) in the GSM system or CDMA, or a base station (NodeB, NB) in the WCDMA system, or It is an evolved base station (Evolutional Node B, eNB or eNodeB) in the LTE system, or the base station can be a relay station, an access point, an in-vehicle device, a wearable device, and a network side device in a future 5G network.
  • BTS Base Transceiver Station
  • NodeB NodeB
  • NB evolved base station
  • the base station can be a relay station, an access point, an in-vehicle device, a wearable device, and a network side device in a future 5G network.
  • the terminal may be a communication with one or more core networks via a radio access network (RAN), and the terminal may refer to a user equipment (User Equipment, UE), an access terminal, a subscriber unit, a subscriber station, a mobile station, Mobile station, remote station, remote terminal, mobile device, user terminal, wireless communication device, user agent or user device.
  • the access terminal may be a cellular phone, a cordless phone, a Session Initiation Protocol (SIP) phone, a Wireless Local Loop (WLL) station, a Personal Digital Assistant (PDA), with wireless communication.
  • FIG. 18 illustrates a wireless communication system 100 in accordance with various embodiments described herein.
  • System 100 includes a base station 102 that can include multiple antenna groups.
  • one antenna group may include antennas 104 and 106
  • another antenna group may include antennas 108 and 110
  • additional groups may include antennas 112 and 114.
  • Two antennas are shown for each antenna group, however 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 various components associated with signal transmission and reception, such as processors, modulators, multiplexers, demodulation , demultiplexer or antenna.
  • 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 substantially any number of access terminals similar to access terminals 116 and 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 different frequency bands than those used by the reverse link 120, and the forward link 124 can be utilized and reversed. Different frequency bands used by link 126.
  • TDD Time Division Duplex
  • 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 be used together. 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 antennas of base station 102 may utilize beamforming to improve the signal to noise ratio for forward links 118 and 124 of access terminals 116 and 122.
  • the base station 102 transmits to the randomly dispersed access terminals 116 and 122 in the relevant coverage area by the base station as compared to all of the access terminals transmitted by the base station, the mobile devices in the adjacent cells are subject to Less interference.
  • base station 102, access terminal 116, and/or access terminal 122 may be transmitting wireless communication devices and/or receiving wireless communication devices.
  • the transmitting wireless communication device can encode the data for transmission.
  • the transmitting wireless communication device can have, for example, generate, obtain, store in memory, etc., a certain number of information bits to be transmitted over the channel to the receiving wireless communication device.
  • Such information bits may be included in a transport block or a plurality of transport blocks of data, which may be segmented to produce a plurality of code blocks.
  • the transmitting wireless communication device can encode each code block using a polar code encoder to improve the reliability of data transmission, thereby ensuring communication quality.
  • Polar codes proposed by Arikan are the first good code to theoretically prove that Shannon capacity can be achieved with low coding complexity.
  • the Polar code is a linear block code whose generating matrix is G N and its encoding process is among them Is a binary line vector of length N (ie code length); G N is an N ⁇ N matrix, and Here Defined as the Kronecker product of log 2 N matrices F 2 .
  • the addition and multiplication operations mentioned above are addition and multiplication operations on a binary Galois field.
  • the encoded output of the Polar code can be simplified to:
  • indicates the number of elements in the collection, and K is the size of the information block.
  • the construction process of the Polar code is a collection
  • the selection process determines the performance of the Polar code.
  • Common construction methods, ie, methods for calculating the reliability of polarized channels are density evolution (DE), Gaussian approximation (GA), and linear fitting.
  • the Polar code is based on a Successive Cancellation (SC) decoding algorithm, that is, sequential decoding starting from the first bit.
  • SC Successive Cancellation
  • the SC List (SCL) decoding algorithm is an improvement to the SC decoding algorithm, which retains multiple candidate decoding results per bit.
  • SCL regards the decoding process as a path search process, that is, the path is extended with the first bit as the root node, and each path maintains a metric value; each time (decoding the next bit) is extended, the current layer is retained. L paths with optimal path metrics; finally, the path with the best metric value is output as the decoding result.
  • SCL can achieve maximum likelihood decoding performance.
  • LLR(i) is the log likelihood ratio of the current bit.
  • the meaning of the above formula is: if the LLR is consistent with the decision result, the PM is unchanged; otherwise, the PM increases the positive penalty value
  • the SCL decoding process if the current bit is an information bit, each path is expanded into two paths (there are a total of 2L paths extended), the decision results are 0 and 1, respectively, and the PM of each path is calculated according to the above formula.
  • the extended path is sorted according to the PM, the L paths with the smallest PM are reserved, and the remaining L paths are deleted, that is, the pruning. If the current bit is a frozen bit (including a dynamic freeze bit), each path is not extended, and the corresponding (dynamic) fixed value is directly determined, and the PM of each path is calculated according to the above formula.
  • ; If the known fixed value is 1, consistent with LLR, PM(i) PM(i-1).
  • CA-Polar the encoding method of the Polar code cascading Cyclic Redundancy Check bit is referred to as CA-Polar.
  • CRC check Cyclic Redundancy Check
  • CA-SCL CRC-Aided Successive Cancellation List
  • the construction process of the CA-Polar code includes a process of determining the position of the information bits. Assuming that the information block size is Kinfo, the CRC length is Kcrc, and the encoded mother code length is N, only Kinfo+Kcrc with the highest reliability is selected as the information bits from the N polarized channels, and the rest are used as static freeze bits. .
  • the information block is first CRC-encoded, then the CRC-encoded bits are mapped to the information bits, the static freeze bits are placed at the fixed values agreed upon at both ends, and finally Arikan Polar coding is performed.
  • CA-Polar coding block The CRC bits may be concatenated at the front end or the back end of the information block or distributed inside the information block.
  • the information block and CRC bits are unknown, and are decoded according to normal SCL.
  • L path-expanded width
  • candidate decoding results are obtained, the candidate decoding results including information blocks and CRC bits.
  • a CRC check is performed on each candidate decoding result, and if the check passes, the information block of the path is output as a decoding. Otherwise, the information block of the candidate decoding result of the path with the smallest PM is used as the decoding output, or the decoding failure is directly indicated.
  • CA-Polar can achieve a lower Block Error Rate (BLER) than SCL.
  • the CRC bits are treated as information bits and are used to select the path only at the end of SCL decoding.
  • the Polar code cascading check (Parity-check) bit referred to as PC-Polar
  • PC-Polar is another cascading code method for improving the performance of the Polar code.
  • the main idea of PC-Polar is to select some parity bits (Parity-check-frozen), also known as Dynamic Frozen bits, which are distributed into the information block, and the value of the check bit is based on the information bits in front of it. The calibration equation is determined.
  • PC-Polar mainly enhances the performance of Polar code by increasing the minimum code distance of the Polar code by PC coding the information block.
  • the structure of PC-Polar mainly includes two points, one is the position of the check bit, usually needs to be located in a highly reliable polarized channel; the other is the check equation, that is, which check bits are determined by the preceding information bits.
  • the encoding process of the PC-Polar code is similar to that of CA-Polar, including PC encoding and Arikan encoding.
  • the PC encoding determines the value of the check bit according to the check equation and the value of the information block, and the static freeze bit is still placed. The value known at both ends of the transceiver.
  • the decoding algorithm of PC-Polar is based on the SCL decoding algorithm.
  • the processing of information bits and static freeze bits is the same as that of the SCL decoding algorithm.
  • the difference is the processing of dynamic freeze bits. Since the dynamic freeze bit is not an unknown information bit but is determined by its preceding information bits, its processing is similar to a static freeze bit, except that the value of the frozen bit is calculated from the previously decoded information bits.
  • the dynamic freeze bit actually assists in the verification of the information bit decoding result due to the correlation with the previous information bits.
  • the PC-SCL decodes the path that ultimately outputs the smallest PM.
  • the arrow between the dynamic freeze bit and the information bit indicates the check relationship between the dynamic freeze bit and the information bit.
  • the value of the decoded information bit is calculated according to the check relationship to obtain the value of the dynamic freeze bit, and is used for decoding.
  • the location of the dynamic freeze bits in PC-Polar plays an important role in performance and needs to be carefully selected during construction.
  • FIG. 7 is a schematic flowchart diagram of a data processing method according to an embodiment of the present invention, where the data processing method includes:
  • the encoder receives the information block to be encoded.
  • the encoding end encodes the information block according to a PC-Polar encoding manner when the channel coding code parameter is in a value range, and/or, the coding end is located in another value range of the channel coding code parameter.
  • the information block is encoded according to a CA-Polar coding manner;
  • the encoder outputs a result of encoding the information block.
  • the data processing method shown in FIG. 7 selects different coding modes according to different ranges of channel coding code parameters, so that the advantages of each coding mode can be combined and the coding synthesis can be improved by combining the characteristics of multiple coding modes.
  • the effect for example: to get the system throughput gain.
  • the encoding end may be any device having wireless communication capabilities, such as an access point, a site, a user equipment, a base station, and the like.
  • the encoding end encodes the information block according to the PC-Polar coding mode, and the coding end is located in another channel coding code parameter, where the coding end code is located in a range of values.
  • the information block is encoded according to the CA-Polar coding mode, and can be specifically classified into the following two cases:
  • the information block is encoded according to the coding mode of PC-Polar, where M represents the code length and K represents the The length of the information bits in the information block; K/M ⁇ 1/6 means that K/M is less than 1/6.
  • the data processing method shown in FIG. 7 may further include: after the step S103:
  • the decoding end decodes the encoded result transmitted through the channel according to a PC-Polar decoding manner.
  • the second case in the case of the channel coding code parameter K/M>1/12 or K ⁇ 120, the information block is encoded according to the CA-Polar coding mode, where M represents the code length and K represents the The length of the information bits in the information block; K/M>1/12 means that K/M is greater than 1/12.
  • the data processing method shown in FIG. 7 may further include: after the step S103:
  • the decoding end decodes the encoded result that is transmitted through the channel according to a CA-Polar decoding manner.
  • the coding end can follow the PC.
  • -Polar coding mode encodes the information block, and correspondingly, the decoding end may decode the encoded result transmitted through the channel according to PC-Polar decoding.
  • the coding can also be in accordance with the CA-Polar coding method.
  • the information block is encoded, and accordingly, the decoding end may decode the encoded result transmitted through the channel according to a CA-Polar decoding manner.
  • the step S102 may be replaced by: the encoding end encodes the information block according to the indication of the first indication signaling according to the PC-Polar encoding manner.
  • the first indication signaling indicates that the information block is encoded according to a PC-Polar coding manner.
  • the first indication signaling may be carried by a physical channel such as a broadcast channel or a control channel.
  • the step S102 may be further replaced by: the encoding end encodes the information block according to the CA-Polar encoding manner according to the indication of the second indication signaling.
  • the second indication signaling indicates that the information block is encoded according to a CA-Polar coding manner.
  • the second indication signaling may be carried by a physical channel such as a broadcast channel or a control channel.
  • FIG. 8 is a schematic flowchart of another data processing method according to an embodiment of the present invention.
  • the data processing method in FIG. 8 includes:
  • the decoding end receives the data block to be decoded.
  • the decoding end decodes the data block according to a PC-Polar decoding manner when the channel coding code parameter is in a value range, and/or, the decoding end is located in another channel coding code parameter. In the case of a value range, the data block is decoded according to a CA-Polar decoding method;
  • the decoding end outputs a result of decoding the data block.
  • the data processing method shown in FIG. 8 provided by the embodiment of the present invention selects different decoding modes according to the range of channel coding code parameters, so that various decoding modes can be combined to play each decoding mode.
  • the advantage is to improve the overall effect of decoding, for example, to obtain system throughput gain.
  • the decoding end may be any device having a wireless communication function, such as an access point, a station, a user equipment, a base station, and the like.
  • the decoding end decodes the data block according to the PC-Polar decoding mode, and/or the decoding end is in the case that the channel coding code parameter is in a range of values.
  • the data block is decoded according to the CA-Polar decoding mode, which may be specifically classified into the following two cases:
  • the first case in the case of the channel coding code parameter K/M ⁇ 1/6 or K>48, the data block is decoded according to the decoding mode of the PC-Polar, where M indicates The code length at the time of data block coding, K represents the length of the information bits that the data block has before being encoded; K/M ⁇ 1/6 means that K/M is less than 1/6.
  • the data processing method shown in FIG. 8 may further include:
  • the coding end encodes the information block according to a coding manner of the PC-Polar, and the data block is obtained after the encoded information block is transmitted through a channel.
  • the second case in the case of the channel coding code parameter K/M>1/12 or K ⁇ 120, the data block is decoded according to the CA-Polar decoding mode, where M indicates The code length at the time of data block coding, K represents the length of the information bits that the data block has before being encoded; K/M>1/12 means that K/M is greater than 1/12.
  • the data processing method shown in FIG. 8 may further include: before the step S201:
  • S2002 The coding end encodes the information block according to the coding manner of the CA-Polar, and the data block is obtained after the encoded information block is transmitted through the channel.
  • the encoding end may encode the information block according to a PC-Polar encoding manner. Accordingly, the decoding end may decode the encoded result transmitted through the channel according to a PC-Polar decoding manner.
  • the coding end can also be coded according to CA-Polar. The method encodes the information block, and correspondingly, the decoding end may decode the encoded result transmitted through the channel according to a CA-Polar decoding manner.
  • the step S202 may be replaced by: the decoding end translating the data block according to the indication of the third indication signaling according to the PC-Polar decoding mode. And a code, wherein the third indication signaling indicates that the data block is decoded according to a PC-Polar decoding manner.
  • the third indication signaling may be carried by a physical channel such as a broadcast channel or a control channel.
  • the step S202 may be further replaced by: the decoding end performs the data block according to the CA-Polar decoding mode according to the indication of the fourth indication signaling.
  • Decoding wherein the fourth indication signaling indicates that the data block is decoded according to a CA-Polar decoding manner.
  • the fourth indication signaling may be carried by a physical channel such as a broadcast channel or a control channel.
  • the length of the information block is K1
  • the encoding the information block according to the coding manner of the CA-Polar includes: The information block of length K1 and the check equation generate a check bit of length X1; the check bit of length X1 is concatenated with the information block or the check bit of length X1 is distributed in the In the information block; mapping the information block and the K1+X1 bits formed by the check bit of length X1 to the information bit, and placing the fixed end of the coding end and the decoding end at the position of the static fixed bit Value; then Arikan Polar encoding.
  • the check equation is used to characterize a constraint relationship between the information block and the check bit of length X1.
  • the length of the information block is K2
  • the encoding the information block according to the coding manner of the PC-Polar includes: The information block of length K2 and the check equation generate check bits of length X2; the check bits of length X2 are distributed in the information block; and the information block and the length are X2
  • the K2+X2 bits composed of the parity bits are mapped to the information bits, and the fixed values agreed by the encoding end and the decoding end are placed at the position of the static fixed bits, and then Arikan Polar encoding is performed.
  • the check equation characterizes a constraint relationship between the information block and the check bit of length X2.
  • the decoding end is decoded according to the CA-Polar decoding manner, including: performing tandem cancellation decoding and extended decoding.
  • the method deciphers a plurality of candidate results, where the candidate result includes an information block and a check bit, and the plurality of candidate results are verified by using a check equation, and the information block in the candidate result of the check is a decoded result.
  • the verification of the plurality of candidate results fails, the information block in the candidate result of the path with the smallest PM (Path-metric) is the result of the decoding.
  • the verifying the plurality of candidate results by using the check equation may specifically include: starting from a candidate result of the path with the smallest PM value, and using the check equation for the plurality of candidate results according to the PM value from small to large. Check it out.
  • the decoding end according to the PC-Polar decoding manner includes: selecting and translating in the decoding process by using the check bit and the check equation.
  • the code path when the value of the check bit matches the decision result of the corresponding LLR (Log likelihood ratio), the PM does not change; otherwise, the PM increases the positive penalty value
  • the information block in the path with the smallest PM (Path-metric) value is taken as the result of the decoding.
  • the CA-Polar coding mode may be any one of the CA-Polar coding modes specified in the 3GPP (3rd Generation Partnership Project) standard.
  • the PC-Polar coding mode may be any PC-Polar coding mode specified in the 3GPP standard.
  • the CA-Polar decoding mode may be any one of the CA-Polar decoding modes specified in the 3GPP standard.
  • the PC-Polar decoding mode may be any PC-Polar decoding mode specified in the 3GPP standard.
  • the channel coding code parameters refer to parameters related to channel coding and/or channel coding.
  • the channel coding code parameter may specifically include at least one of the following parameters: N, M, K, L and derived parameters determined by at least one of N, M, K, and L.
  • N represents the length of the mother code of the Polar code
  • M represents the code length
  • K represents the length of the information block
  • L represents the search width in the decoding process.
  • the value of the K/M is located at K/M ⁇ 1. Any value within the range of /6. Further, in the range of K/M ⁇ 1/6, K/M ⁇ 1/12 can also be specifically selected.
  • the value of the K/M is located at K/M>1/12. Any value within the range. Further, in the range of K/M > 1/12, K/M > 1/6 may be specifically selected.
  • the value of K is located at any value within the range of K>48.
  • K>64 may be specifically selected within the range of K>48.
  • K>80 can also be specifically selected.
  • K>120 can also be specifically selected.
  • the value of the K is located at any value within the range of K ⁇ 120.
  • K ⁇ 80 may be specifically selected.
  • K ⁇ 64 can also be specifically selected.
  • K ⁇ 48 can also be specifically selected.
  • FIG. 9 is another data processing method according to an embodiment of the present invention.
  • the data processing method shown in FIG. 9 includes:
  • the encoding end encodes the information block according to any CA-Polar encoding manner as described in the foregoing embodiment of the data processing method shown in FIG. 7 and FIG. 8;
  • the decoding end encodes the information block after channel transmission according to any PC-Polar decoding manner as described in the foregoing embodiment of the data processing method shown in FIG. 7 and FIG. Perform decoding.
  • the data processing method shown in FIG. 9 provided by the embodiment of the present invention can combine the advantages of various decoding modes by selecting different decoding modes, thereby improving the advantages of each decoding mode and improving the comprehensive effect of decoding. For example: Get system throughput gain.
  • the value of the channel coding code parameter may be the same as the data processing method shown in FIG. 7 and FIG. 8, the coding end adopts the CA-Polar coding mode, and the decoding end In the case of the PC-Polar decoding method, the values of the channel coding code parameters are the same.
  • FIG. 10 is a schematic flowchart diagram of another data processing method according to an embodiment of the present invention.
  • the data processing method shown in FIG. 10 includes:
  • the encoding end encodes the information block according to any PC-Polar encoding manner as described in the foregoing data processing method embodiment shown in FIG. 7 and FIG. 8;
  • the decoding end encodes the information block after channel transmission according to any CA-Polar decoding manner as described in the foregoing data processing method embodiment shown in FIG. 7 and FIG. Perform decoding.
  • the data processing method shown in FIG. 10 provided by the embodiment of the present invention can combine the advantages of various decoding modes by selecting different decoding modes, thereby improving the advantages of each decoding mode and improving the comprehensive effect of decoding. For example: Get system throughput gain.
  • the value of the channel coding code parameter may be compared with the data processing method shown in FIG. 7 and FIG. 8 , and the coding end adopts a PC-Polar coding manner, and When the decoding end adopts the CA-Polar decoding mode, the channel coding code parameters have the same value.
  • FIG. 11 is a schematic flowchart diagram of another data processing method according to an embodiment of the present invention.
  • the data processing method shown in FIG. 11 includes:
  • the encoding end encodes the information block according to a CA-Polar and PC-Polar hybrid coding manner.
  • the decoding end decodes the result of encoding the information block that is transmitted through the channel according to a CA-Polar and PC-Polar hybrid decoding manner.
  • the data processing method shown in FIG. 11 provided by the embodiment of the present invention combines the coding and decoding methods of combining the two by combining the advantages of CA-Polar and PC-Polar, thereby improving the integration of coding and decoding.
  • the effect for example: to get the system throughput gain.
  • the information block has a length of K
  • the information block is encoded according to a CA-Polar and PC-Polar mixed coding manner.
  • An implementation manner including: generating a check bit of length X based on a block of length K and a first check equation, and cascading the check bit of length X with the information block; An information block and K+X bits consisting of the check bits of length X, and a second check equation generating a check bit of length Y, the check bit of length Y and the K+ X bits are arranged together (eg, the check bits of length Y are concatenated to the head or tail of the K+X bits, or the parity bit level of length Y is inserted Within K + X bits, it constitutes K + X + Y bits).
  • the first check equation is used to characterize a constraint relationship between information bits in the information block and parity bits of length X.
  • the second check equation is used to characterize a constraint relationship between the K+X bits and the parity bit of length Y.
  • the information block has a length of K
  • the information block is encoded according to a CA-Polar and PC-Polar mixed coding manner.
  • Another implementation manner includes: generating a check bit of length X based on the information block of length K and the first check equation, and distributing the check bit of length X into the information block;
  • the K+X bits and the second check equation of the information block and the check bit of length X generate a check bit of length Y, and the check bit of length Y and the K+ X bits are concatenated, and K+X+Y bits consisting of the information block, the check bit of length X and the check bit of length Y are mapped to information bits, at the position of static fixed bits Place the fixed value agreed at the encoding end and the decoding end, and then perform Arikan Polar encoding.
  • the first check equation is used to characterize a constraint relationship between information bits in the information block and parity bits of length X.
  • the second check equation is used to
  • the decoding end decodes according to the CA-Polar and PC-Polar mixed decoding manners, including: selecting a translation according to the PC-Polar decoding mode.
  • the decoding path is selected by using the Y parity bits and the second parity equation to obtain a plurality of candidate results, where the candidate result includes the information block and the X parity bits, and the multiple candidates are The result is verified by using the first check equation, and the information block in the candidate result of the check is the result of the decoding, or in the case that the verification of the plurality of candidate results fails, PM (Path- The information block in the candidate result of the path with the smallest metric value is the result of the decoding.
  • the verifying the plurality of candidate results by using the check equation may specifically include: starting from the candidate result of the path with the smallest PM value, using the first school for the plurality of candidate results according to the PM value from small to large Check the equation for verification.
  • generating the check bit of length Y based on the K+X bits and the second check equation composed of the information block and the check bit of length X specifically includes:
  • the second check equation calculates the value of the dynamic freeze bit; the static freeze bit places the fixed bit of the convention, wherein: the second check equation is constructed based on the polynomial, the polynomial may be a polynomial such as CRC, or may be a simple mass-based shift
  • U18 degenerates into a static freeze bit. Due to the feature of the SC code sequential decoding of the Polar code, the dynamic freeze bit can only verify the information bits preceding it. Therefore, the frozen bits before the first information bit have no information bits to be verified, all degenerate into static freeze bits, which are still referred to herein as dynamic freeze bits.
  • the prime shift register is convenient for hardware implementation. Arikan Polar encoding is performed on information bits, dynamic freeze bits, and static freeze bits to obtain a Polar code block.
  • the decoding end when decoding, performs SCL decoding according to PC-Polar, that is, the dynamic freeze bit is processed as a frozen bit, and the value is determined by the previously decoded information bit according to the second check equation to obtain a candidate path; SCL After the decoding is completed, the path through which the CRC check is passed is selected from the candidate paths by the CRC as a decoding result.
  • the CA-Polar and PC-Polar hybrid coding mode may be any one of the CA-types specified in the 3GPP (3rd Generation Partnership Project) standard. Polar and PC-Polar mixed encoding.
  • the CA-Polar and PC-Polar hybrid decoding modes may be any CA-Polar and PC-Polar mixed decoding modes specified in the 3GPP standard.
  • the method further includes: the encoding end receiving the value of X and/or Y.
  • the value of X and/or Y may be carried by a physical channel such as a broadcast channel or a control channel.
  • the method further includes: the encoding end receiving an index of X and/or Y.
  • the index of X is used by the encoding end to obtain the value of the X according to the index of the X.
  • the index of Y is used by the encoding end to obtain the value of the Y according to the index of the Y.
  • the index of X and/or Y may be carried by a physical channel such as a broadcast channel or a control channel.
  • the method further includes: the decoding end receiving the value of X and/or Y.
  • the value of X and/or Y may be carried by a physical channel such as a broadcast channel or a control channel.
  • the method further includes: the decoding end receiving an index of X and/or Y.
  • the index of X is used by the decoding end to obtain the value of the X according to the index of the X.
  • the index of Y is used by the decoding end to obtain the value of the Y according to the index of the Y.
  • the index of X and/or Y may be carried by a physical channel such as a broadcast channel or a control channel.
  • Y is greater than or equal to 0, and Y is less than or equal to the code length (eg, 2048).
  • X is greater than or equal to 0, and X is less than or equal to 24.
  • FIG. 12 is a schematic structural diagram of a data processing apparatus according to an embodiment of the present disclosure, where the data processing apparatus includes:
  • An interface module configured to receive information blocks to be encoded
  • a first encoding module configured to encode the information block according to a PC-Polar encoding manner when the channel coding code parameter is in a range of values, and/or, where the channel coding code parameter is located in another value range
  • the information block is encoded according to the CA-Polar coding method
  • the interface module is further configured to output a result of encoding the information block.
  • the data processing apparatus shown in FIG. 12 provided by the embodiment of the present invention can be used to perform various embodiments of the data processing method shown in FIG. 7.
  • the implementation principle and technical effects are similar, and details are not described herein again.
  • various specific implementation manners of S101 and S103 in the data processing method shown in FIG. 7 can also be used as various specific functions of the interface module of the data processing apparatus shown in FIG. 12 .
  • Various specific implementations of S102 in the data processing method shown in FIG. 7 can also be used as various embodied implementations of the functions of the first encoding module of the data processing apparatus shown in FIG. .
  • first decoding module 12 may further include a first decoding module (not shown), and various specific implementation manners of S104 in the data processing method shown in FIG. 7 may also be correspondingly Various embodied implementations of the functions of the first decoding module of the data processing apparatus shown in FIG.
  • FIG. 13 is a schematic structural diagram of another data processing apparatus according to an embodiment of the present invention.
  • the data processing apparatus shown in FIG. 13 includes: a transceiver module for receiving a data block to be decoded; and a second decoding module, For decoding the data block according to the PC-Polar decoding mode if the channel coding code parameter is in a range of values, and/or, if the channel coding code parameter is in another value range Decoding the data block according to a CA-Polar decoding manner; the transceiver module is further configured to output a result of decoding the data block.
  • the data processing apparatus shown in FIG. 13 provided by the embodiment of the present invention can be used to perform various embodiments of the data processing method shown in FIG. 8.
  • the implementation principle and technical effects are similar, and details are not described herein again.
  • various specific implementation manners of S201 and S203 in the data processing method shown in FIG. 8 can also be used as various specific functions of the transceiver module of the data processing device shown in FIG. 13 .
  • Various specific implementations of S202 in the data processing method shown in FIG. 8 can also be implemented as various implementations of the functions of the second decoding module of the data processing apparatus shown in FIG. the way.
  • 13 may further include a second encoding module (not shown), and various specific implementation manners of the S2001 or S2002 in the data processing method shown in FIG. It can be implemented as various embodiments of the functions of the second encoding module of the data processing apparatus shown in FIG.
  • FIG. 14 is a schematic structural diagram of another data processing apparatus according to an embodiment of the present invention.
  • the data processing apparatus shown in FIG. 14 includes:
  • a third encoding module configured to encode the information block according to any one of the CA-Polar encoding methods described in the data processing method embodiment shown in FIG. 7 and FIG. 8;
  • a third decoding module configured to encode the information block after channel transmission according to any PC-Polar decoding manner as described in the data processing method embodiment shown in FIG. 7 and FIG. The result is decoded.
  • the data processing apparatus shown in FIG. 14 provided by the embodiment of the present invention can be used to perform various embodiments of the data processing method shown in FIG. 9 , and the implementation principle and technical effects thereof are similar, and details are not described herein again.
  • various specific implementation manners of the S301 in the data processing method shown in FIG. 9 can also be used as various specific functions of the third encoding module of the data processing apparatus shown in FIG. The way to achieve.
  • Various specific implementations of S302 in the data processing method shown in FIG. 9 can also be implemented as various implementations of the functions of the third decoding module of the data processing apparatus shown in FIG. the way.
  • FIG. 15 is a schematic structural diagram of another data processing apparatus according to an embodiment of the present invention.
  • the fourth data processing apparatus shown in FIG. 15 includes:
  • a fourth encoding module configured to encode the information block according to any one of the PC-Polar encoding methods described in the foregoing embodiment of the data processing method shown in FIG. 7 and FIG. 8;
  • a fourth decoding module configured to encode the information block by channel transmission according to any CA-Polar decoding manner as described in the foregoing embodiment of the data processing method shown in FIG. 7 and FIG. The result is decoded.
  • the data processing apparatus shown in FIG. 15 may be used to perform various embodiments of the data processing method shown in FIG. 10, and the implementation principle and technical effects thereof are similar, and details are not described herein again.
  • various specific implementation manners of S401 in the data processing method shown in FIG. 10 can also be used as various specific functions of the fourth encoding module of the data processing apparatus shown in FIG. The way to achieve.
  • Various specific implementations of S402 in the data processing method shown in FIG. 10 can also be used as various specific functions of the fourth decoding module of the fourth data processing apparatus shown in FIG. The way to achieve.
  • FIG. 16 is a schematic structural diagram of another data processing apparatus according to an embodiment of the present invention.
  • the data processing apparatus shown in FIG. 16 includes:
  • a fifth encoding module configured to encode the information block according to a CA-Polar and PC-Polar hybrid coding manner
  • a fifth decoding module configured to decode the encoded result of the information block after channel transmission according to a CA-Polar and PC-Polar hybrid decoding manner.
  • the fifth data processing apparatus shown in FIG. 16 provided by the embodiment of the present invention can be used to execute various embodiments of the data processing method shown in FIG. 11 , and the implementation principle and technical effects are similar. Let me repeat. Specifically, various specific implementation manners of S501 in the data processing method shown in FIG. 11 can also be used as various specific functions of the fifth encoding module of the data processing apparatus shown in FIG. 16 . The way to achieve. Various specific implementations of S502 in the data processing method shown in FIG. 11 can also be implemented as various implementations of the functions of the fifth decoding module of the data processing apparatus shown in FIG. the way.
  • FIG. 17 is a schematic structural diagram of a communication apparatus according to an embodiment of the present invention.
  • the communication apparatus includes: a processor, and a memory interconnected with the processor, when the communication apparatus is running, the processor reads and Execution of instructions in the memory or execution of its own hardware logic circuitry to cause the communication device to perform various embodiments of any one of the data processing methods illustrated in Figures 7-11.
  • the memory is for storing the instructions, and the memory may be independent of the processor or integrated into the processor.
  • the communication device may further include a transceiver (not shown) for receiving and/or transmitting data.
  • the communication device of the embodiment of the present application may be any device having a wireless communication function, such as an access point, a site, a user equipment, a base station, and the like.
  • the communication device may also have a dual function of encoding and decoding, performing an encoding operation when acting as an encoding end, and performing a decoding operation when acting as a decoding terminal.
  • the communication device includes a baseband chip, the baseband chip includes an encoder and a decoder, and the encoder can be used to implement the same function as the aforementioned encoding end, and the decoder can implement the same function as the aforementioned decoding end.
  • the processor may be an integrated circuit that operates in accordance with a non-curing instruction or an integrated circuit that operates in accordance with a curing instruction.
  • the processor operating according to the non-curing instruction realizes various embodiments in any one of the data processing methods shown in FIGS. 7 to 11 by reading and executing instructions in the memory, or Various embodiments of any of the data processing devices shown in Figures 12 through 16 are implemented.
  • the processor operating according to the curing instruction realizes various embodiments in any one of the data processing methods shown in FIG. 7 to FIG. 11 by running its own hardware logic circuit, or 12 to various embodiments of any one of the data processing devices shown in FIG.
  • the memory is a random access memory (ROM), a flash memory, a read only memory (RAM), a programmable read only memory, an electrically erasable programmable memory, a cache (CACHE) or a register.
  • ROM random access memory
  • RAM read only memory
  • CACHE electrically erasable programmable memory
  • a storage medium that is convenient for the processor to read.
  • the processor may be a central processing unit (CPU), a graphics processing unit (GPU), or a digital signal processor (DSP). ), Application Specific Integrated Circuit (ASIC), Field Programmable Gate Array (FPGA), Network Processor (NP), other programmable logic devices, discrete gate transistors Logic devices, or discrete hardware components, and so on.
  • CPU central processing unit
  • GPU graphics processing unit
  • DSP digital signal processor
  • ASIC Application Specific Integrated Circuit
  • FPGA Field Programmable Gate Array
  • NP Network Processor
  • other programmable logic devices discrete gate transistors Logic devices, or discrete hardware components, and so on.
  • the various embodiments described above may be implemented in whole or in part by software, hardware, firmware, or any combination thereof.
  • software When implemented in software, it may be implemented in whole or in part in the form of a computer program product.
  • the computer program product includes one or more computer instructions.
  • the computer program instructions When the computer program instructions are loaded and executed on a computer, the processes or functions described in accordance with embodiments of the present invention are generated in whole or in part.
  • the computer can be a general purpose computer, a special purpose computer, a computer network, or other programmable device.
  • the computer instructions can be stored in a computer readable storage medium or transferred from one computer readable storage medium to another computer readable storage medium, for example, the computer instructions can be from a website site, computer, server or data center Transfer to another website site, computer, server, or data center by wire (eg, coaxial cable, fiber optic, digital subscriber line (DSL), or wireless (eg, infrared, wireless, microwave, etc.).
  • the computer readable storage medium can be any available media that can be accessed by a computer or a data storage device such as a server, data center, or the like that includes one or more available media.
  • the usable medium may be a magnetic medium (eg, a floppy disk, a hard disk, a magnetic tape), an optical medium (eg, a DVD), or a semiconductor medium (such as a solid state disk (SSD)).

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Error Detection And Correction (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

本发明实施例公开了一种数据处理方法，所述方法包括:编码端接收待编码的信息块；编码端在信道编译码参数位于一个取值范围的情况下，按照PC-Polar编码方式对所述信息块进行编码，和/或，编码端在信道编译码参数位于另一个取值范围的情况下，按照CA-Polar编码方式对所述信息块进行编码；编码端输出对所述信息块进行编码后的结果。

Description

数据处理的方法和装置 技术领域
本发明实施例涉及电子及通信技术领域，并且更具体地，涉及数据处理的方法和装置。
背景技术
通信系统中通常采用编码技术提高数据传输的可靠性，保证通信的质量。极化码(Polar codes)算法是第一个理论上证明可以取得香农容量且具有低编译码(编译码复杂度均为O(NlogN))复杂度的编译码算法。
目前，有多种Polar码编码方式,例如:CA-Polar和PC-Polar,如何选择适当的编码和/或译码方式,是目前亟待解决的问题。
发明内容
本发明实施例提供一种数据处理的方法和装置，通过选择合适的Polar码编码和/或译码方式,从而提高了编码和/或译码的综合效果。
第一方面，本发明实施例提供第一种数据处理方法,所述方法包括:
编码端接收待编码的信息块；
编码端在信道编译码参数位于一个取值范围的情况下，按照PC-Polar编码方式对所述信息块进行编码，和/或，编码端在信道编译码参数位于另一个取值范围的情况下，按照CA-Polar编码方式对所述信息块进行编码；
编码端输出对所述信息块进行编码后的结果。
本发明实施例所提供的所述第一种数据处理方法,通过按照信道编译码参数的范围的不同,选择不同的编码方式,从而可以结合多种编码方式的特点,发挥每种编码方式的优点,提高编码的综合效果,例如:获得系统吞吐增益。
在第一方面的第一种可能的实现方式中，所述编码端在信道编译码参数位于一个取值范围的情况下，按照PC-Polar编码方式对所述信息块进行编码，包括:
在信道编译码参数K/M<1/6或者K>48的情况下，编码端按照PC-Polar的编码方式对所述信息块进行编码,其中,M表示编码长度，K表示所述信息块中信息比特的长度。
结合第一方面或第一方面前述的各种可能的实现方式,在第二种可能的实现方式中，编码端在信道编译码参数位于另一个取值范围的情况下，按照CA-Polar编码方 式对所述信息块进行编码，包括:
在信道编译码参数K/M>1/12或者K<120的情况下，编码端按照CA-Polar的编码方式对所述信息块进行编码,其中,M表示编码长度，K表示所述信息块中信息比特的长度。
第二方面，本发明实施例提供第二种数据处理方法,所述方法包括:
编码端接收待编码的信息块；
编码端按照第一指示信令的指示，按照PC-Polar编码方式对所述信息块进行编码，其中，所述第一指示信令指示按照PC-Polar编码方式对所述信息块进行编码；
编码端输出对所述信息块进行编码后的结果。
在第二方面的第一种可能的实现方式中，所述第一指示信令由广播信道、或控制信道等物理信道承载。
第三方面，本发明实施例提供第三种数据处理方法,所述方法包括:
编码端接收待编码的信息块；
编码端按照第二指示信令的指示，按照CA-Polar编码方式对所述信息块进行编码，其中，所述第二指示信令指示按照CA-Polar编码方式对所述信息块进行编码；
编码端输出对所述信息块进行编码后的结果。
在第三方面的第一种可能的实现方式中，所述第二指示信令由广播信道、或控制信道等物理信道承载。
第四方面，本发明实施例提供第四种数据处理方法,所述方法包括:
译码端接收待译码的数据块；
译码端在信道编译码参数位于一个取值范围的情况下，按照PC-Polar译码方式对所述数据块进行译码，和/或，译码端在信道编译码参数位于另一个取值范围的情况下，按照CA-Polar译码方式对所述数据块进行译码；
译码端输出对所述数据块进行译码后的结果。
本发明实施例所提供的第四种数据处理方法,通过按照信道编译码参数的范围,选择不同的译码方式,从而可以结合多种译码方式的特点,发挥每种译码方式的优点,提高译码的综合效果,例如:获得系统吞吐增益。
在第四方面的第一种可能的实现方式中，译码端在信道编译码参数位于一个取值范围的情况下，按照PC-Polar译码方式对所述数据块进行译码，包括:
在信道编译码参数K/M<1/6或者K>48的情况下，按照PC-Polar的译码方式对所述数据块进行译码,其中,M表示在对所述数据块编码时的编码长度，K表示所述数据块在被编码之前所具有的信息比特的长度。
结合第四方面或第四方面前述的各种可能的实现方式,在第二种可能的实现方式中，所述译码端在信道编译码参数位于另一个取值范围的情况下，按照CA-Polar译码方式对所述数据块进行译码，包括：在信道编译码参数K/M>1/12或者K<120的情况下，按照CA-Polar的译码方式对所述数据块进行译码,其中,M表示在对所述数据块编码时的编码长度，K表示所述数据块在被编码之前所具有的信息比特的长度。
第五方面，本发明实施例提供第五种数据处理方法,所述方法包括:
译码端接收待译码的数据块；
译码端按照第三指示信令的指示，按照PC-Polar译码方式对所述数据块进行译码，其中，所述第三指示信令指示按照PC-Polar译码方式对所述数据块进行译码；
译码端输出对所述数据块进行译码后的结果。
在第五方面的第一种可能的实现方式中，所述第三指示信令可以由广播信道、或控制信道等物理信道承载。
第六方面，本发明实施例提供第六种数据处理方法,所述方法包括:
译码端接收待译码的数据块；
译码端按照第四指示信令的指示，按照CA-Polar译码方式对所述数据块进行译码，其中，所述第四指示信令指示按照CA-Polar译码方式对所述数据块进行译码；
译码端输出对所述数据块进行译码后的结果。
在第六方面的第一种可能的实现方式中，所述第四指示信令可以由广播信道、或控制信道等物理信道承载。
第七方面，本发明实施例提供第七种数据处理方法,所述方法包括:
编码端按照PC-Polar编码的方式对信息块进行编码；
译码端按照CA-Polar译码的方式，对经过信道传输的对所述信息块编码后的结果进行译码。
本发明实施例所提供的第七种数据处理方法,通过选择不同的译码方式,从而可以结合多种译码方式的特点,发挥每种译码方式的优点,提高译码的综合效果,例如:获得系统吞吐增益。
第八方面，本发明实施例提供第八种数据处理方法,所述方法包括:
编码端按照CA-Polar编码的方式对信息块进行编码；
译码端按照PC-Polar译码的方式，对经过信道传输的对所述信息块编码后的结果进行译码。
本发明实施例所提供的第八种数据处理方法,通过选择不同的译码方式,从而可以结合多种译码方式的特点,发挥每种译码方式的优点,提高译码的综合效果,例如:获得系统吞吐增益。
结合前面各方面所述的方法及各种实现方式，作为一种实现方式，所述按照CA-Polar的编码方式对所述信息块进行编码包括：
基于长度为K1的信息块及校验方程生成长度为X1的校验比特；将所述长度为X1的校验比特与所述信息块级联或者将所述长度为X1的校验比特分布于所述信息块内；并将所述信息块和所述长度为X1的校验比特一起组成的K1+X1个比特映射到信息比特，在静态固定比特的位置放置编码端和译码端约定的固定值；再进行Arikan Polar编码，其中，所述校验方程用于表征所述信息块和所述长度为X1的校验比特之间的约束关系，所述信息块的长度为K1。
结合前面各方面所述的方法及各种实现方式，作为一种实现方式，
所述按照PC-Polar的编码方式对所述信息块进行编码包括：基于长度为K2的信息块及校验方程生成长度为X2的校验比特；将所述长度为X2的校验比特分布于所述信息块内；并将所述信息块和所述长度为X2的校验比特一起组成的K2+X2个比特映射到信息比特，在静态固定比特的位置放置编码端和译码端约定的固定值，再进行Arikan Polar编码，其中，所述校验方程表征了所述信息块和所述长度为X2的校验比特之间的约束关系，所述信息块的长度为K2。
结合前面各方面所述的方法及各种实现方式，作为一种实现方式，所述译码端按照CA-Polar译码的方式译码包括：
按照串列抵消译码及其扩展译码方式译出多个候选结果，所述候选结果包括信息块和校验比特，对所述多个候选结果利用校验方程进行校验，通过校验的候选结果中的信息块为译码的结果，或者，在对所述多个候选结果的校验都失败的情况下，PM(Path-metric)最小的路径的候选结果中的信息块为译码的结果。
对所述多个候选结果利用校验方程进行校验可以具体包括：从PM值最小的路径的候选结果开始，按照PM值由小至大的顺序，对所述多个候选结果利用校验方程进行校验。
结合前面各方面所述的方法及各种实现方式，作为一种实现方式，译码端按照PC-Polar译码的方式包括：利用校验比特及校验方程在译码过程中选择译码路径，当校验比特的值与LLR(Log likelihood ratio,对数似然比)相符时，将所述选择的译 码路径的信息块作为译码的结果。
当校验比特的值与LLR(Log likelihood ratio对数似然比)不相符时，将PM(Path-metric)值最小的路径中的信息块作为译码的结果。
结合前面各方面所述的方法及各种实现方式，作为一种实现方式，所述信道编译码参数是指与信道编码和/或信道译码相关的参数。
结合前面各方面所述的方法及各种实现方式，作为一种实现方式，所述信道编译码参数可以具体包括以下参数中的至少一种：N，M，K,L以及由N，M，K以及L中至少一个确定的衍生参数。其中,N表示Polar编码的母码长度，M表示编码长度，K表示所述信息块的长度，L表示译码过程中的搜索宽度。
结合前面各方面所述的方法及各种实现方式，作为一种实现方式，在所述K/M<1/6的范围内,所述K/M的取值位于K/M<1/6的范围内的任意一个值。
结合前面各方面所述的方法及各种实现方式，作为一种实现方式，在所述K/M<1/6的范围内,可以具体选择K/M<1/12。
结合前面各方面所述的方法及各种实现方式，作为一种实现方式，在K/M>1/12的范围内，所述K/M的取值位于K/M>1/12的范围内的任意一个值。
结合前面各方面所述的方法及各种实现方式，作为一种实现方式，在所述K/M>1/12的范围内,也可以具体选择K/M>1/6。
结合前面各方面所述的方法及各种实现方式，作为一种实现方式，在所述K>48的范围内,所述K的取值位于K>48的范围内的任意一个值。
结合前面各方面所述的方法及各种实现方式，作为一种实现方式，在所述K>48的范围内,也可以具体选择K>64。
结合前面各方面所述的方法及各种实现方式，作为一种实现方式，在所述K>64的范围内,也可以具体选择K>80。
结合前面各方面所述的方法及各种实现方式，作为一种实现方式，在所述K>80的范围内,也可以具体选择K>120。
结合前面各方面所述的方法及各种实现方式，作为一种实现方式，在所述K<120的范围内,所述K的取值位于K<120的范围内的任意一个值。
结合前面各方面所述的方法及各种实现方式，作为一种实现方式，在所述K<120的范围内,也可以具体选择K<80。
结合前面各方面所述的方法及各种实现方式，作为一种实现方式，在所述K<80的范围内,也可以具体选择K<64。
结合前面各方面所述的方法及各种实现方式，作为一种实现方式，在所述K<64的范围内,也可以具体选择K<48。
第九方面，本发明实施例提供第九种数据处理方法,所述方法包括:
编码端按照CA-Polar和PC-Polar混合编码的方式对信息块进行编码；
译码端按照CA-Polar和PC-Polar混合的译码的方式，对经过信道传输的对所述信息块编码后的结果进行译码。
本发明实施例所提供的第九种数据处理方法,通过结合CA-Polar和PC-Polar的优点，采用将二者融合的编码和译码的方式,从而可以提高编码和译码的综合效果,例如:获得系统吞吐增益。
在第九方面的第一种可能的实现方式中，所述按照CA-Polar和PC-Polar混合的编码方式对所述信息块进行编码的一种实现方式，包括：基于长度为K的信息块及第一校验方程生成长度为X的校验比特，将所述长度为X的校验比特与所述信息块级联；基于所述信息块和所述长度为X的校验比特组成的K+X个比特，以及第二校验方程生成长度为Y的校验比特，将所述长度为Y的校验比特与所述K+X个比特排列在一起，并将所述信息块，所述长度为X的校验比特以及长度为Y的校验比特组成的K+X+Y个比特映射到信息比特，在静态固定比特的位置放置编码端和译码端约定的固定值，再进行Arikan Polar编码，得到Polar的编码块，其中，所述第一校验方程用于表征所述信息块中的信息比特和所述长度为X的校验比特之间的约束关系，所述第二校验方程用于表征所述K+X个比特和所述长度为Y的校验比特之间的约束关系，所述信息块的长度为K。
结合第九方面或第九方面前述的各种可能的实现方式,在第二种可能的实现方式中，所述按照CA-Polar和PC-Polar混合的编码方式对所述信息块进行编码的另一种实现方式，包括：基于长度为K的信息块及第一校验方程生成长度为X的校验比特，将所述长度为X的校验比特分布于所述信息块内；基于所述信息块和所述长度为X的校验比特组成的K+X个比特及第二校验方程生成长度为Y的校验比特，将所述长度为Y的校验比特与所述K+X个比特级联，并将所述信息块，所述长度为X的校验比特以及长度为Y的校验比特组成的K+X+Y个比特映射到信息比特，在静态固定比特的位置放置编码端和译码端约定的固定值，再进行Arikan Polar编码。所述第一校验方程用于表征所述信息块中的信息比特和所述长度为X的校验比特之间的约束关系。所述第二校验方程用于表征所述K+X个比特和所述长度为Y的校验比特之间的约束关系，所述信息块的长度为K。
结合第九方面或第九方面前述的各种可能的实现方式,在第三种可能的实现方式中，所述译码端按照CA-Polar和PC-Polar混合的译码的方式译码包括：按照PC-Polar译码方式中选择译码路径的方式，利用Y校验比特及第二校验方程选择译码路径，得到多个候选结果，所述候选结果包括信息块和所述X个校验比特，对所述多个候选结果利用第一校验方程进行校验，通过校验的候选结果中的信息块为译码的结果，或者，在对所述多个候选结果的校验都失败的情况下，PM(Path-metric)最小的路径的候选结果中的信息块为译码的结果。
对所述多个候选结果利用校验方程进行校验可以具体包括：从PM值最小的路径的候选结果开始，按照PM值由小至大的顺序，对所述多个候选结果利用第一校验方程进行校验。
结合第九方面或第九方面前述的各种可能的实现方式,在第四种可能的实现方式中，在编码端按照CA-Polar和PC-Polar混合编码的方式对信息块进行编码之前还包括：所述编码端接收X和/或Y的值。
结合第九方面或第九方面前述的各种可能的实现方式,在第五种可能的实现方式中，在编码端按照CA-Polar和PC-Polar混合编码的方式对信息块进行编码之前还包括：所述编码端接收X和/或Y的索引(index)。所述X的索引用于由编码端根据所述X的索引得到所述X的值。所述Y的索引用于由编码端根据所述Y的索引得到所述Y的值。
结合第九方面或第九方面前述的各种可能的实现方式,在第六种可能的实现方式中，在所述译码端按照CA-Polar和PC-Polar混合的译码的方式，对经过信道传输的对所述信息块编码后的结果进行译码之前还包括：所述译码端接收X和/或Y的值。
结合第九方面或第九方面前述的各种可能的实现方式,在第七种可能的实现方式中，在所述译码端按照CA-Polar和PC-Polar混合的译码的方式，对经过信道传输的对所述信息块编码后的结果进行译码之前还包括：所述译码端接收X和/或Y的索引(index)。所述X的索引用于由译码端根据所述X的索引得到所述X的值。所述Y的索引用于由译码端根据所述Y的索引得到所述Y的值。
结合第九方面或第九方面前述的各种可能的实现方式,在第八种可能的实现方式中，Y大于或等于0，并且Y小于或等于编码长度。
结合第九方面或第九方面前述的各种可能的实现方式,在第九种可能的实现方式中，X大于或等于0，并且X小于或等于24。
第十方面，本发明实施例提供第一种数据处理装置，所述装置包括：
接口模块，用于接收待编码的信息块；
第一编码模块，用于在信道编译码参数位于一个取值范围的情况下，按照PC-Polar编码方式对所述信息块进行编码，和/或，在信道编译码参数位于另一个取值范围的情况下，按照CA-Polar编码方式对所述信息块进行编码；
所述接口模块进一步用于输出对所述信息块进行编码后的结果。
第十一方面，本发明实施例提供第二种数据处理装置，所述装置包括：
收发模块，用于接收待译码的数据块；
第二译码模块，用于在信道编译码参数位于一个取值范围的情况下，按照PC-Polar译码方式对所述数据块进行译码，和/或，在信道编译码参数位于另一个取 值范围的情况下，按照CA-Polar译码方式对所述数据块进行译码；
所述收发模块还用于输出对所述数据块进行译码后的结果。
第十二方面，本发明实施例提供第三种数据处理装置，所述装置包括：
第三编码模块，用于按照CA-Polar编码的方式对信息块进行编码；
第三译码模块，用于按照PC-Polar译码的方式，对经过信道传输的对所述信息块编码后的结果进行译码。
第十三方面，本发明实施例提供第四种数据处理装置，所述装置包括：
第四编码模块，用于按照PC-Polar编码的方式对信息块进行编码；
第四译码模块，用于按照CA-Polar译码的方式，对经过信道传输的对所述信息块编码后的结果进行译码。
第十四方面，本发明实施例提供第五种数据处理装置，所述装置包括：
第五编码模块，用于按照CA-Polar和PC-Polar混合编码的方式对信息块进行编码；
第五译码模块，用于按照CA-Polar和PC-Polar混合的译码的方式，对经过信道传输的对所述信息块编码后的结果进行译码。
第十五方面，本发明实施例提供一种通信装置，所述通信装置包括：处理器、以及与所述处理器信号互联的存储器，当所述通信装置运行时，所述处理器读取并执行所述存储器中的指令或者运行自身的硬件逻辑电路，以使所述通信装置执行所述第一至第九方面中所述的数据处理方法中的任意一种数据处理方法的各种实施例。
在第十五方面的第一种可能的实现方式中，所述存储器用于存储所述指令,所述存储器可以独立于所述处理器之外，也可以集成在所述处理器之中。
结合第十五方面或第十五方面前述的各种可能的实现方式,在第二种可能的实现方式中，所述通信装置还可以进一步包括收发器，用于接收和/或发送数据。
本申请的实施例的又一方面还提供了一种计算机可读存储介质，所述计算机可读存储介质中存储有指令，当其在计算机上运行时，使得计算机执行上述各方面所述的方法。
本申请的实施例的又一方面还提供了一种包含指令的计算机程序产品，当其在计算机上运行时，使得计算机执行上述各方面所述的方法。
附图说明
图1是本发明实施例中所采用的SCL译码过程的示意图；
图2(a)和图2(b)是本发明实施例中的SCL译码过程中的PM计算过程中两种情况下的示意图；
图3是本发明实施例中的CRC级联Polar码的编码过程的示意图；
图4是本发明实施例中的CRC编码输出的过程示意图；
图5是本发明实施例中的PC-Polar编码方法中的校验关系的示意图；
图6是本发明实施例中的PC-SCL的译码过程的示意图；
图7是本发明实施例第一种数据处理方法的示意图；
图8是本发明实施例第二种数据处理方法的示意图；
图9是本发明实施例第三种数据处理方法的示意图；
图10是本发明实施例第四种数据处理方法的示意图；
图11是本发明实施例第五种数据处理方法的示意图；
图12是本发明实施例第一种数据处理装置的示意图；
图13是本发明实施例第二种数据处理装置的示意图；
图14是本发明实施例第三种数据处理装置的示意图；
图15是本发明实施例第四种数据处理装置的示意图；
图16是本发明实施例第五种数据处理装置的示意图；
图17是本发明实施例通信装置的示意图；以及
图18本发明实施例中的无线通信系统的示意图。
具体实施方式
本发明实施例可应用于各种通信系统，因此，下面的描述不限制于特定通信系统。全球移动通讯(Global System of Mobile communication，简称“GSM”)系统、码分多址(Code Division Multiple Access，简称“CDMA”)系统、宽带码分多址(Wideband Code Division Multiple Access，简称“WCDMA”)系统、通用分组无线业务(General Packet Radio Service，简称“GPRS”)、长期演进(Long Term Evolution，简称“LTE”)系统、LTE频分双工(Frequency Division Duplex，简称“FDD”)系统、LTE时分双工(Time Division Duplex，简称“TDD”)、通用移动通信系统(Universal Mobile Telecommunication System，简称“UMTS”)等。在上述的系统中的基站或者终端使用传统Turbo码、LDPC码编码处理的信息或者数据都可以使用本实施例中的Polar码编码。
其中，基站可以是用于与终端设备进行通信的设备，例如，可以是GSM系统或CDMA中的基站(Base Transceiver Station，BTS)，也可以是WCDMA系统中的基站(NodeB，NB)，还可以是LTE系统中的演进型基站(Evolutional Node B，eNB或eNodeB)，或者该基站可以为中继站、接入点、车载设备、可穿戴设备以及未来5G网络中的网络侧设备等。
终端可以是经无线接入网(Radio Access Network，RAN)与一个或多个核心网进行通 信，终端可以指用户设备(User Equipment，UE)、接入终端、用户单元、用户站、移动站、移动台、远方站、远程终端、移动设备、用户终端、无线通信设备、用户代理或用户装置。接入终端可以是蜂窝电话、无绳电话、会话启动协议(Session Initiation Protocol，SIP)电话、无线本地环路(Wireless Local Loop，WLL)站、个人数字处理(Personal Digital Assistant，PDA)、具有无线通信功能的手持设备、计算设备或连接到无线调制解调器的其它处理设备、车载设备、可穿戴设备，未来5G网络中的终端设备等。
图18示出了根据本文所述的各个实施例的无线通信系统100。系统100包括基站102，后者可包括多个天线组。例如，一个天线组可包括天线104和106，另一个天线组可包括天线108和110，附加组可包括天线112和114。对于每个天线组示出了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接收信息。在频分双工(Frequency Division Duplex，简称为“FDD”)系统中，例如，前向链路118可利用与反向链路120所使用的不同频带，前向链路124可利用与反向链路126所使用的不同频带。此外，在时分双工(Time Division Duplex，简称为“TDD”)系统中，前向链路118和反向链路120可使用共同频带，前向链路124和反向链路126可使用共同频带。
被设计用于通信的每组天线和/或区域称为基站102的扇区。例如，可将天线组设计为与基站102覆盖区域的扇区中的接入终端通信。在通过前向链路118和124的通信中，基站102的发射天线可利用波束成形来改善针对接入终端116和122的前向链路118和124的信噪比。此外，与基站通过单个天线向它所有的接入终端发送相比，在基站102利用波束成形向相关覆盖区域中随机分散的接入终端116和122发送时，相邻小区中的移动设备会受到较少的干扰。
在给定时间，基站102、接入终端116和/或接入终端122可以是发送无线通信装置和/或接收无线通信装置。当发送数据时，发送无线通信装置可对数据进行编码以用于传输。具体地，发送无线通信装置可具有，例如生成、获得、在存储器中保存等，要通过信道发送至接收无线通信装置的一定数目的信息比特。这种信息比特可包含在数据的传输块或多 个传输块中，其可被分段以产生多个码块。此外，发送无线通信装置可使用极性码编码器来对每个码块编码，以提高数据传输的可靠性，进而保证通信质量。
通信系统通常采用信道编码提高数据传输的可靠性，保证通信的质量。Arikan提出的Polar码(Polar Codes)是第一个理论上证明可以取得香农容量且具有低编译码复杂度的好码。Polar码是一种线性块码,其生成矩阵为G N,其编码过程为
Figure PCTCN2018075129-appb-000001
其中
Figure PCTCN2018075129-appb-000002
是一个二进制的行矢量，长度为N(即码长)；G N是一个N×N的矩阵，且
Figure PCTCN2018075129-appb-000003
这里
Figure PCTCN2018075129-appb-000004
定义为log 2 N个矩阵F 2的克罗内克(Kronecker)乘积。以上涉及的加法、乘法操作均为二进制伽罗华域(Galois Field)上的加法、乘法操作。
传统Polar码(原始的Arikan Polar码)的编码过程中，
Figure PCTCN2018075129-appb-000005
中的一部分比特用来携带信息，称为信息比特，这些比特的索引的集合记作
Figure PCTCN2018075129-appb-000006
另外的一部分比特置为收发端预先约定的固定值(称之为固定比特)，其索引的集合用
Figure PCTCN2018075129-appb-000007
的补集
Figure PCTCN2018075129-appb-000008
表示。这些固定比特通常被设为0，只需要收发端预先约定，固定比特序列可以被任意设置。从而，Polar码的编码输出可简化为：
Figure PCTCN2018075129-appb-000009
这里
Figure PCTCN2018075129-appb-000010
为
Figure PCTCN2018075129-appb-000011
中的信息比特集合，
Figure PCTCN2018075129-appb-000012
为长度K的行矢量，即
Figure PCTCN2018075129-appb-000013
|·|表示集合中元素的个数，K为信息块大小，
Figure PCTCN2018075129-appb-000014
是矩阵G N中由集合
Figure PCTCN2018075129-appb-000015
中的索引对应的那些行得到的子矩阵，
Figure PCTCN2018075129-appb-000016
是一个K×N的矩阵。Polar码的构造过程即集合
Figure PCTCN2018075129-appb-000017
的选取过程，决定了Polar码的性能。常见的构造方法，即计算极化信道可靠度的方法有密度进化(density evolution,DE)、高斯近似(Gaussian approximation,GA)和线性拟合。
Polar码基于串行抵消(Successive Cancellation,SC)译码算法，即从第1个比特开始顺序译码。串行抵消列表(SC List,SCL)译码算法是对SC译码算法的改进，在每个比特保留多个候选译码结果。图1是SCL译码算法List＝2的示例。SCL把译码过程看成一个路径搜索过程，即以第1个比特作为根结点的路径扩展，每个路径维持一个度量值；每一次(译码下一个比特)扩展时，保留当前层中具有最优路径度量的L条路径；最后输出度量值最优的路径作为译码结果。SCL可以获得最大似然译码性能。
第l条路径值PM(Path-metric)在译码到第i个比特时的计算如下所示：
Figure PCTCN2018075129-appb-000018
其中，LLR(i)是当前比特的对数似然比。上式的含义是：如果LLR与判决结果一致，PM不变；否则，PM增加正的惩罚值|LLR(i)|。因此，PM越小，表示该路径对应的码字与接收信号越近，因此最后输出PM最小的那条路径作为译码结果。在SCL译码过程，如果当前比特是信息比特，每条路径会扩展成2条路径(则总共扩展出2L条路径)，判决结果分别为0和1，并根据上式计算各路径的PM，然后对扩展后的路径根据PM进行排序，保留PM最小的L条路径，删除其余L条路径，即剪枝。如果当前比特是冻结比特(包括动态冻结比特)，各条路径不进行扩展，直接判决为相应的(动态)固定值，并根据上式计算各路径的PM。
如图2(a)所示，若当前译码比特的LLR(i)大于0(对应结果为0)，在路径扩展过程中，若当前比特是信息比特，则需要扩展两条路径。若判决为0，判决结果与LLR一致(图2(a)和图2(b)中以“√”表示)，则PM(i)＝PM(i-1)；若判决为1，判决与LLR不一致(图2(a)和图2(b)中以“x”表示)，PM(i)＝PM(i-1)+|LLR(i)|。若当前比特是冻结比特，不进行扩展，按照已知的固定值计算PM，若已知的固定值是0，与LLR一致，PM(i)＝PM(i-1)；若已知的固定值是1，与与LLR不一致，PM(i)＝PM(i-1)+|LLR(i)|。如图2(b)所示，若当前译码比特的LLR(i)小于0(对应结果为1)，在路径扩展过程中，若当前比特是信息比特，则需要扩展两条路径，若判决为0，与LLR不一致，PM(i)＝PM(i-1)+|LLR(i)|；若判决为1，与LLR一致，PM(i)＝PM(i-1)。若当前比特是冻结比特，不进行扩展，按照已知的固定值计算PM，若已知的固定值是0，与LLR不一致，PM(i)＝PM(i-1)+|LLR(i)|；若已知的固定值是1，与与LLR一致，PM(i)＝PM(i-1)。
如图3及图4所示，对Polar码级联循环冗余校验(Cyclic Redundancy Check)比特的编码方式，简称CA-Polar。在译码过程中，通过CRC校验(Cyclic Redundancy Check，循环冗余校验)，在SCL译码输出的候选路径中选择CRC通过的路径作为译码输出，这种译码算法称为CA-SCL(CRC-Aided Successive Cancellation List)译码算法，CA-SCL译码算法能显著提高Polar码的性能。
CA-Polar码的构造过程包括确定信息比特位置的过程。假设信息块大小为Kinfo，CRC长度为Kcrc，编码的母码码长为N，则只需要从N个极化信道中选择Kinfo+Kcrc个可靠度最高的作为信息比特，其余的作为静态冻结比特。在CA-Polar码的构造过程中，先对信息块 进行CRC编码，然后将CRC编码后的比特映射到信息比特，在静态冻结比特放置收发两端约定的固定值，最后进行Arikan Polar编码，得到CA-Polar的编码块。所述CRC比特可以级联在所述信息块的前端或后端，或者分布在所述信息块的内部。
译码时，信息块和CRC比特均未知，按照正常的SCL译码。在SCL译码结束后，得到L(路径扩展的宽度)个候选译码结果，所述候选译码结果包括信息块和CRC比特。从PM最小的路径的候选译码结果开始，对每个候选译码结果进行CRC校验，如果校验通过，则将该路径的信息块作为译码输出。否则，将PM最小的路径的候选译码结果的信息块作为译码输出，或者直接指示译码失败。CA-Polar可以取得比SCL更低的误块率(Block Error Rate，BLER)。
在SCL译码过程中，CRC比特均作为信息比特处理，只在SCL译码结束时用于选择路径。
如图5所示，对Polar码级联校验(Parity-check)比特，简称为PC-Polar，是另一种提升Polar码性能的级联码方法。PC-Polar的主要思想是选择一些校验比特(Parity-check-frozen)，也称为动态冻结(Dynamic Frozen)比特，分布到信息块中，并且校验比特的值由其前面的信息比特根据校验方程确定。
PC-Polar主要是通过对信息块进行PC编码提升Polar码的最小码距，从而提升Polar码的性能。PC-Polar的构造主要包括两点，一是校验比特的位置，通常需要位于可靠度较高的极化信道；二是校验方程，即各校验比特由其前面的哪些信息比特确定。一旦构造完成，PC-Polar码的编码过程与CA-Polar类似，包括PC编码和Arikan编码两步，PC编码即根据校验方程和信息块的值确定校验比特的值，静态冻结比特仍然放置收发两端已知的值。PC-Polar的译码算法基于SCL译码算法，信息比特和静态冻结比特的处理与SCL译码算法的处理一样，不同是动态冻结比特的处理。由于动态冻结比特并不是未知的信息比特，而是由其前面的信息比特确定，其处理与静态冻结比特类似，不同的是冻结比特的值由前面译码的信息比特计算获得。动态冻结比特由于与前面的信息比特相关，实际上辅助了信息比特译码结果的校验。具体来说，如果前面译码的信息比特有错，计算得到动态冻结比特的值与其LLR(Log likelihood ratio对数似然比)不符的可能性更大，相应的路径PM会加惩罚值，从而在排序时会更可能把该错误路径删除。PC-SCL译码最终输出PM最小的路径。
图6是一个PC-Polar的SCL译码示例，动态冻结比特与信息比特之间的箭头表示的是动态冻结比特与信息比特之间的校验关系。在译码到动态冻结比特时，在各译码路径，根据校验关系将译码得到的信息比特的值计算得到该动态冻结比特的值，并用于译码。PC-Polar中动态冻结比特的位置对性能起到重要作用，构造时需要仔细挑选。
上述介绍的各种概念或实施方式适用于下述的任意一个实施例中。
图7是本发明实施例提供的数据处理方法的流程示意图,所述数据处理方法包括:
S101、编码端接收待编码的信息块；
S102、编码端在信道编译码参数位于一个取值范围的情况下，按照PC-Polar编码方式对所述信息块进行编码，和/或，编码端在信道编译码参数位于另一个取值范围的情况下，按照CA-Polar编码方式对所述信息块进行编码；
S103、编码端输出对所述信息块进行编码后的结果。
图7中的所示的数据处理方法,通过按照信道编译码参数的范围的不同,选择不同的编码方式,从而可以结合多种编码方式的特点,发挥每种编码方式的优点,提高编码的综合效果,例如:获得系统吞吐增益。
在图7所示的实施例中，编码端可以是任何具有无线通信功能的设备，例如接入点、站点、用户设备、基站等。
所述步骤S102在具体实现中,编码端在信道编译码参数位于一个取值范围的情况下，按照PC-Polar编码方式对所述信息块进行编码，以及编码端在信道编译码参数位于另一个取值范围的情况下，按照CA-Polar编码方式对所述信息块进行编码，具体可以分为以下两种情况:
第一种情况:在信道编译码参数K/M<1/6或者K>48的情况下，按照PC-Polar的编码方式对所述信息块进行编码,其中,M表示编码长度，K表示所述信息块中信息比特的长度；K/M<1/6是指K/M小于1/6。
在所述第一种情况下,所述图7所示的数据处理方法在所述步骤S103之后还可以包括:
S104、译码端按照PC-Polar译码的方式，对经过信道传输的所述编码后的结果进行译码。
第二种情况:在信道编译码参数K/M>1/12或者K<120的情况下，按照CA-Polar的编码方式对所述信息块进行编码,其中,M表示编码长度，K表示所述信息块中信息比特的长度；K/M>1/12是指K/M大于1/12。
在所述第二种情况下,所述图7所示的数据处理方法在所述步骤S103之后还可以包括:
S105、译码端按照CA-Polar译码的方式，对经过信道传输的所述编码后的结果进行译码。
需要说明的是，在信道编译码参数K/M＝1/6或者K/M＝1/12或者K＝48或者K＝64或者K＝80或者K＝120的情况下，编码端可以按照PC-Polar的编码方式对所述信息块进行编码,相应地，译码端可以按照PC-Polar译码的方式，对经过信道传输的所述编码后的结果进行译码。在信道编译码参数K/M＝1/6或者K/M＝1/12或者K＝48或者K＝64或者K＝80或者K＝120的情况下，编码也可以按照CA-Polar的编码方式对所述信息块进行编码,相应地，译码端可以按照CA-Polar译码的方式，对经过信道传输的所述编码后的结果进行译码。
在上述图7所示的数据处理方法的实施例中，所述S102步骤，也可以替换为：编码端按照第一指示信令的指示，按照PC-Polar编码方式对所述信息块进行编码，其中，所述第一指示信令指示按照PC-Polar编码方式对所述信息块进行编码。具体来 讲，所述第一指示信令可以由广播信道、或控制信道等物理信道承载。
在上述图7所示的数据处理方法的实施例中，所述S102步骤，还可以替换为：编码端按照第二指示信令的指示，按照CA-Polar编码方式对所述信息块进行编码，其中，所述第二指示信令指示按照CA-Polar编码方式对所述信息块进行编码。具体来讲，所述第二指示信令可以由广播信道、或控制信道等物理信道承载。
图8是本发明实施例提供的另一种数据处理方法的流程示意图,图8中的数据处理方法包括:
S201、译码端接收待译码的数据块；
S202、译码端在信道编译码参数位于一个取值范围的情况下，按照PC-Polar译码方式对所述数据块进行译码，和/或，译码端在信道编译码参数位于另一个取值范围的情况下，按照CA-Polar译码方式对所述数据块进行译码；
S203、译码端输出对所述数据块进行译码后的结果。
本发明实施例所提供的图8所示的数据处理方法,通过按照信道编译码参数的范围,选择不同的译码方式,从而可以结合多种译码方式的特点,发挥每种译码方式的优点,提高译码的综合效果,例如:获得系统吞吐增益。
在图8所示的实施例中，译码端可以是任何具有无线通信功能的设备，例如接入点、站点、用户设备、基站等。
所述步骤S202在具体实现中,译码端在信道编译码参数位于一个取值范围的情况下，按照PC-Polar译码方式对所述数据块进行译码，和/或，译码端在信道编译码参数位于另一个取值范围的情况下，按照CA-Polar译码方式对所述数据块进行译码，具体可以分为以下两种情况:
第一种情况:在信道编译码参数K/M<1/6或者K>48的情况下，按照PC-Polar的译码方式对所述数据块进行译码,其中,M表示在对所述数据块编码时的编码长度，K表示所述数据块在被编码之前所具有的信息比特的长度；K/M<1/6是指K/M小于1/6。
在所述第一种情况下,图8所示的所述数据处理方法在所述步骤S201之前还可以包括:
S2001、编码端按照PC-Polar的编码方式对信息块进行编码，所述数据块是经过编码后的所述信息块经过信道传输后得到的。
第二种情况:在信道编译码参数K/M>1/12或者K<120的情况下，按照CA-Polar的译码方式对所述数据块进行译码,其中,M表示在对所述数据块编码时的编码长度，K表示所述数据块在被编码之前所具有的信息比特的长度；K/M>1/12是指K/M大于1/12。
在所述第二种情况下,图8所示的所述数据处理方法在所述步骤S201之前还可以 包括:
S2002、编码端按照CA-Polar的编码方式对信息块进行编码，所述数据块是经过编码后的所述信息块经过信道传输后得到的。
需要说明的是，在上述实施例中，在信道编译码参数K/M＝1/6或者K/M＝1/12或者K＝48或者K＝64或者K＝80或者K＝120的情况下，编码端可以按照PC-Polar的编码方式对所述信息块进行编码,相应地，译码端可以按照PC-Polar译码的方式，对经过信道传输的所述编码后的结果进行译码。在信道编译码参数K/M＝1/6或者K/M＝1/12或者K＝48或者K＝64或者K＝80或者K＝120的情况下，编码端也可以按照CA-Polar的编码方式对所述信息块进行编码,相应地，译码端可以按照CA-Polar译码的方式，对经过信道传输的所述编码后的结果进行译码。
在图8所示的上述数据处理方法的实施例中，所述S202步骤，可以替换为：译码端按照第三指示信令的指示，按照PC-Polar译码方式对所述数据块进行译码，其中，所述第三指示信令指示按照PC-Polar译码方式对所述数据块进行译码。具体来讲，所述第三指示信令可以由广播信道、或控制信道等物理信道承载。
在图8所示的上述数据处理方法的实施例中，所述S202步骤，还可以替换为：译码端按照第四指示信令的指示，按照CA-Polar译码方式对所述数据块进行译码，其中，所述第四指示信令指示按照CA-Polar译码方式对所述数据块进行译码。具体来讲，所述第四指示信令可以由广播信道、或控制信道等物理信道承载。
在上述图7和图8所示的数据处理方法的实施例中，具体来讲,所述信息块的长度为K1，所述按照CA-Polar的编码方式对所述信息块进行编码包括：基于长度为K1的信息块及校验方程生成长度为X1的校验比特；将所述长度为X1的校验比特与所述信息块级联或者将所述长度为X1的校验比特分布于所述信息块内；并将所述信息块和所述长度为X1的校验比特一起组成的K1+X1个比特映射到信息比特，在静态固定比特的位置放置编码端和译码端约定的固定值；再进行Arikan Polar编码。其中，所述校验方程用于表征所述信息块和所述长度为X1的校验比特之间的约束关系。
在上述图7和图8所示的数据处理方法的实施例中，具体来讲,所述信息块的长度为K2，所述按照PC-Polar的编码方式对所述信息块进行编码包括：基于长度为K2的信息块及校验方程生成长度为X2的校验比特；将所述长度为X2的校验比特分布于所述信息块内；并将所述信息块和所述长度为X2的校验比特一起组成的K2+X2个比特映射到信息比特，在静态固定比特的位置放置编码端和译码端约定的固定值，再进行Arikan Polar编码。其中，所述校验方程表征了所述信息块和所述长度为X2的校验比特之间的约束关系。
在上述图7和图8所示的数据处理方法的实施例中，具体来讲,所述译码端按照 CA-Polar译码的方式译码包括：按照串列抵消译码及其扩展译码方式译出多个候选结果，所述候选结果包括信息块和校验比特，对所述多个候选结果利用校验方程进行校验，通过校验的候选结果中的信息块为译码的结果，或者，在对所述多个候选结果的校验都失败的情况下，PM(Path-metric)最小的路径的候选结果中的信息块为译码的结果。
对所述多个候选结果利用校验方程进行校验可以具体包括：从PM值最小的路径的候选结果开始，按照PM值由小至大的顺序，对所述多个候选结果利用校验方程进行校验。
在上述图7和图8所示的数据处理方法的实施例中，具体来讲,译码端按照PC-Polar译码的方式包括：利用校验比特及校验方程在译码过程中选择译码路径，当校验比特的值与相应LLR(Log likelihood ratio,对数似然比)的判决结果相符时，PM不变；否则，PM增加正的惩罚值|LLR|。将PM(Path-metric)值最小的路径中的信息块作为译码的结果。
在上述图7和图8所示的数据处理方法的实施例中，具体来讲,所述CA-Polar编码方式可以为3GPP(3rd Generation Partnership Project)标准中规定的任意一种CA-Polar编码方式。所述PC-Polar编码方式可以为3GPP标准中规定的任意一种PC-Polar编码方式。所述CA-Polar译码方式可以为3GPP标准中规定的任意一种CA-Polar译码方式。所述PC-Polar译码方式可以为3GPP标准中规定的任意一种PC-Polar译码方式。
在上述图7和图8所示的数据处理方法的实施例中，所述信道编译码参数是指与信道编码和/或信道译码相关的参数。所述信道编译码参数可以具体包括以下参数中的至少一种：N，M，K,L以及由N，M，K以及L中至少一个确定的衍生参数。其中,N表示Polar编码的母码长度，M表示编码长度，K表示所述信息块的长度，L表示译码过程中的搜索宽度。
在上述图7和图8所示的数据处理方法的实施例中，具体来讲,在所述K/M<1/6的范围内,所述K/M的取值位于K/M<1/6的范围内的任意一个值。另外,在所述K/M<1/6的范围内,也可以具体选择K/M<1/12。
在上述图7和图8所示的数据处理方法的实施例中，具体来讲,在K/M>1/12的范围内，所述K/M的取值位于K/M>1/12的范围内的任意一个值。另外,在所述K/M>1/12的范围内,也可以具体选择K/M>1/6。
在上述图7和图8所示的数据处理方法的实施例中，具体来讲,在所述K>48的范围内,所述K的取值位于K>48的范围内的任意一个值。另外,在所述K>48的范围内,也可以具体选择K>64。在所述K>64的范围内,也可以具体选择K>80。在所述K>80的范围内,也可以具体选择K>120。
在上述图7和图8所示的数据处理方法的实施例中，具体来讲,在所述K<120的范围内,所述K的取值位于K<120的范围内的任意一个值。另外,在所述K<120的范围内,也可以具体选择K<80。在所述K<80的范围内,也可以具体选择K<64。在所述K<64的范围内,也可以具体选择K<48。
图9是本发明实施例提供的另一种数据处理方法,图9所示的数据处理方法包括:
S301、编码端按照如上述图7和图8所示的数据处理方法实施例中所述的任意一种CA-Polar编码的方式对信息块进行编码；
S302、译码端按照如上述图7和图8所示的数据处理方法实施例中所述的任意一种PC-Polar译码的方式，对经过信道传输的对所述信息块编码后的结果进行译码。
本发明实施例所提供的图9所示的数据处理方法,通过选择不同的译码方式,从而可以结合多种译码方式的特点,发挥每种译码方式的优点,提高译码的综合效果,例如:获得系统吞吐增益。
在图9所示的数据处理方法的实施例中，信道编译码参数的取值可以与图7和图8所示的数据处理方法中，编码端采用CA-Polar编码的方式，且译码端采用PC-Polar译码的方式的情况下的信道编译码参数的取值相同。
图10是本发明实施例提供的另一种数据处理方法的流程示意图,图10中所示的数据处理方法包括:
S401、编码端按照如上述图7和图8所示的数据处理方法实施例中所述的任意一种PC-Polar编码的方式对信息块进行编码；
S402、译码端按照如上述图7和图8所示的数据处理方法实施例中所述的任意一种CA-Polar译码的方式，对经过信道传输的对所述信息块编码后的结果进行译码。
本发明实施例所提供的图10所示的数据处理方法,通过选择不同的译码方式,从而可以结合多种译码方式的特点,发挥每种译码方式的优点,提高译码的综合效果,例如:获得系统吞吐增益。
在图10中所示的所述数据处理方法的实施例中，信道编译码参数的取值可以与图7和图8所示的数据处理方法中，编码端采用PC-Polar编码的方式，且译码端采用CA-Polar译码的方式的情况下的信道编译码参数的取值相同。
图11是本发明实施例提供的另一种数据处理方法的流程示意图,图11所示的数据处理方法包括:
S501、编码端按照CA-Polar和PC-Polar混合编码的方式对信息块进行编码；
S502、译码端按照CA-Polar和PC-Polar混合的译码的方式，对经过信道传输的对所述信息块编码后的结果进行译码。
本发明实施例所提供的图11所示的数据处理方法,通过结合CA-Polar和PC-Polar的优点，采用将二者融合的编码和译码的方式,从而可以提高编码和译码的综合效果,例如:获得系统吞吐增益。
在图11所示的上述数据处理方法的实施例中，具体来讲,所述信息块的长度为K，所述按照CA-Polar和PC-Polar混合的编码方式对所述信息块进行编码的一种实现方式，包括：基于长度为K的信息块及第一校验方程生成长度为X的校验比特，将所述长度为X的校验比特与所述信息块级联；基于所述信息块和所述长度为X的校验比特组成的K+X个比特，以及第二校验方程生成长度为Y的校验比特，将所述长度为Y的校验比特与所述K+X个比特排列在一起(例如：将所述长度为Y的校验比特级联于所述K+X个比特的头部或尾部，或者，将所述长度为Y的校验比特级插入所述K+X个比特内，组成K+X+Y个比特)。并将所述信息块，所述长度为X的校验比特以及长度为Y的校验比特组成的K+X+Y个比特映射到信息比特，在静态固定比特的位置放置编码端和译码端约定的固定值，再进行Arikan Polar编码，得到Polar的编码块。所述第一校验方程用于表征所述信息块中的信息比特和所述长度为X的校验比特之间的约束关系。所述第二校验方程用于表征所述K+X个比特和所述长度为Y的校验比特之间的约束关系。
在图11所示的上述数据处理方法的实施例中，具体来讲,所述信息块的长度为K，所述按照CA-Polar和PC-Polar混合的编码方式对所述信息块进行编码的另一种实现方式，包括：基于长度为K的信息块及第一校验方程生成长度为X的校验比特，将所述长度为X的校验比特分布于所述信息块内；基于所述信息块和所述长度为X的校验比特组成的K+X个比特及第二校验方程生成长度为Y的校验比特，将所述长度为Y的校验比特与所述K+X个比特级联，并将所述信息块，所述长度为X的校验比特以及长度为Y的校验比特组成的K+X+Y个比特映射到信息比特，在静态固定比特的位置放置编码端和译码端约定的固定值，再进行Arikan Polar编码。所述第一校验方程用于表征所述信息块中的信息比特和所述长度为X的校验比特之间的约束关系。所述第二校验方程用于表征所述K+X个比特和所述长度为Y的校验比特之间的约束关系。
在图11所示的上述数据处理方法的实施例中，具体来讲,译码端按照CA-Polar和PC-Polar混合的译码的方式译码包括：按照PC-Polar译码方式中选择译码路径的方式，利用Y个校验比特及第二校验方程选择译码路径，得到多个候选结果，所述候选结果包括信息块和所述X个校验比特，对所述多个候选结果利用第一校验方程进行校验，通过校验的候选结果中的信息块为译码的结果，或者，在对所述多个候选结 果的校验都失败的情况下，PM(Path-metric)值最小的路径的候选结果中的信息块为译码的结果。
对所述多个候选结果利用校验方程进行校验可以具体包括：从PM值最小的路径的候选结果开始，按照PM值由小至大的顺序，对所述多个候选结果利用第一校验方程进行校验。
在上述实施例中，基于所述信息块和所述长度为X的校验比特组成的K+X个比特及第二校验方程生成长度为Y的校验比特具体包括：
在除所述K+X个比特所处的K+X个极化信道以外的N-K-X个剩余极化信道中确定Y动态冻结比特，并构造第二校验方程，根据所述K+X比特的值和第二校验方程计算动态冻结比特的值；静态冻结比特放置约定的固定比特，其中：基于多项式构造第二校验方程，多项式可以是CRC等的多项式，也可以是简单的基于质数移位寄存器校验方程，如基于一个约定的质数Q，选择该动态冻结比特之前、与动态冻结比特序号模Q相同的序号的信息比特，作为参与该动态冻结比特校验的信息比特。如Q＝5，极化信道U18确定为一个动态冻结比特，则处于极化信道U13、U8、U3的信息比特(如果是)作为参与U18的信息比特，即
U18＝U3+U8+U13
如果U3不是信息比特，则不参与校验，校验方程变为
U18＝U8+U13
如果U13、U8、U3都不是信息比特，则校验方程变为
U18＝0
即U18退化为一个静态冻结比特。由于Polar码SC顺序译码的特点，动态冻结比特只能校验其前面的信息比特。因此，在第一个信息比特之前的冻结比特没有信息比特可以校验，全部退化为静态冻结比特，这里仍暂称为动态冻结比特。基于质数移位寄存器便于硬件实现。对信息比特、动态冻结比特和静态冻结比特进行Arikan Polar编码，得到Polar编码块。
相应地，译码端在译码时，根据PC-Polar进行SCL译码，即动态冻结比特作为冻结比特处理、值由前面译码的信息比特根据第二校验方程确定，获得候选路径；SCL译码结束后，用CRC从候选路径中选择CRC校验通过的路径作为译码结果。
在图11所示的上述数据处理方法的实施例中，具体来讲,所述CA-Polar和PC-Polar混合的编码方式可以为3GPP(3rd Generation Partnership Project)标准中规定的任意一种CA-Polar和PC-Polar混合的编码方式。所述CA-Polar和PC-Polar混合的译码方式可以为3GPP标准中规定的任意一种CA-Polar和PC-Polar混合的译码方式。
在图11所示的上述数据处理方法的实施例中，在所述步骤S501之前还包括：所述编码端接收X和/或Y的值。具体来讲，所述X和/或Y的值可以由广播信道、或控制信道等物理信道承载。
在图11所示的上述数据处理方法的实施例中，在所述步骤S501之前还包括：所述编码端接收X和/或Y的索引(index)。所述X的索引用于由编码端根据所述X的索引得到所述X的值。所述Y的索引用于由编码端根据所述Y的索引得到所述Y的值。具体来讲，所述X和/或Y的索引可以由广播信道、或控制信道等物理信道承载。
在图11所示的上述数据处理方法的实施例中，在所述步骤S502之前还包括：所述译码端接收X和/或Y的值。具体来讲，所述X和/或Y的值可以由广播信道、或控制信道等物理信道承载。
在图11所示的上述数据处理方法的实施例中，在所述步骤S502之前还包括：所述译码端接收X和/或Y的索引(index)。所述X的索引用于由译码端根据所述X的索引得到所述X的值。所述Y的索引用于由译码端根据所述Y的索引得到所述Y的值。具体来讲，所述X和/或Y的索引可以由广播信道、或控制信道等物理信道承载。
在图11所示的上述数据处理方法的实施例中，Y大于或等于0，并且Y小于或等于编码长度(例如：2048)。
在图11所示的上述数据处理方法的实施例中，X大于或等于0，并且X小于或等于24。
图12为本发明实施例提供的数据处理装置的结构示意图，所述数据处理装置包括：
接口模块，用于接收待编码的信息块；
第一编码模块，用于在信道编译码参数位于一个取值范围的情况下，按照PC-Polar编码方式对所述信息块进行编码，和/或，在信道编译码参数位于另一个取值范围的情况下，按照CA-Polar编码方式对所述信息块进行编码；
所述接口模块进一步用于输出对所述信息块进行编码后的结果。
本发明实施例所提供的图12所示的所述数据处理装置可用于执行图7所示的所述数据处理方法的各种实施例，其实现原理和技术效果类似，此处不再赘述。具体来讲,图7所示的所述数据处理方法中关于S101和S103的各种具体实现方式,也相应地可以作为图12所示的所述数据处理装置的接口模块的功能的各种具体化的实现方式。图7所示的所述数据处理方法中关于S102的各种具体实现方式,也相应地可以作为图12所示的所述数据处理装置的第一编码模块的功能的各种具体化的实现方式。图12所示的所述数据处理装置还可以包括第一译码模块(图中未示出)，图7所示的所述数据处理方法中关于S104的各种具体实现方式,也相应地可以作为图12所示的所述数据处理装置的第一译码模块的功能的各种具体化的实现方式。
图13是本发明实施例提供的另一种数据处理装置的结构示意图，图13所示的所述数据处理装置包括：收发模块，用于接收待译码的数据块；第二译码模块，用于在信道编译码参数位于一个取值范围的情况下，按照PC-Polar译码方式对所述数据块进行译码，和/或，在信道编译码参数位于另一个取值范围的情况下，按照CA-Polar译码方式对所述数据块进行译码；所述收发模块还用于输出对所述数据块进行译码后的结果。
本发明实施例所提供的图13所示的所述数据处理装置可用于执行图8所示的所述数据处理方法的各种实施例，其实现原理和技术效果类似，此处不再赘述。具体来讲,所述图8所示的数据处理方法中关于S201和S203的各种具体实现方式,也相应地可以作为图13所示的所述数据处理装置的收发模块的功能的各种具体化的实现方式。图8所示的所述数据处理方法中关于S202的各种具体实现方式,也相应地可以作为图13所示的所述数据处理装置的第二译码模块的功能的各种具体化的实现方式。图13所示的所述数据处理装置还可以包括第二编码模块(图中未示出)，图8所示的所述数据处理方法中关于S2001或S2002的各种具体实现方式,也相应地可以作为图13所示的所述数据处理装置的第二编码模块的功能的各种具体化的实现方式。
图14是本发明实施例提供的另一种数据处理装置的结构示意图，图14中所示的数据处理装置包括：
第三编码模块，用于按照如图7和图8所示的数据处理方法实施例中所述的任意一种CA-Polar编码的方式对信息块进行编码；
第三译码模块，用于按照如图7和图8所示的数据处理方法实施例中所述的任意一种PC-Polar译码的方式，对经过信道传输的对所述信息块编码后的结果进行译码。
本发明实施例所提供的图14所示的所述数据处理装置可用于执行图9所示的所述数据处理方法的各种实施例，其实现原理和技术效果类似，此处不再赘述。具体来讲,图9所示的所述数据处理方法中关于S301的各种具体实现方式,也相应地可以作为图14所示的所述数据处理装置的第三编码模块的功能的各种具体化的实现方式。图9所示的所述数据处理方法中关于S302的各种具体实现方式,也相应地可以作为图14所示的所述数据处理装置的第三译码模块的功能的各种具体化的实现方式。
图15是本发明实施例提供的另一种数据处理装置的结构示意图，图15所示的所述第四种数据处理装置包括：
第四编码模块，用于按照如上述图7和图8所示的数据处理方法实施例中所述的任意一种PC-Polar编码的方式对信息块进行编码；
第四译码模块，用于按照如上述图7和图8所示的数据处理方法实施例中所述的任意一种CA-Polar译码的方式，对经过信道传输的对所述信息块编码后的结果进行译码。
本发明实施例所提供的图15所示的所述数据处理装置可用于执行图10所示的所述数据处理方法的各种实施例，其实现原理和技术效果类似，此处不再赘述。具体来讲,图10所示的所述数据处理方法中关于S401的各种具体实现方式,也相应地可以作为图15所示的所述数据处理装置的第四编码模块的功能的各种具体化的实现方式。图10所示的所述数据处理方法中关于S402的各种具体实现方式,也相应地可以作为图15所示的所述第四种数据处理装置的第四译码模块的功能的各种具体化的实现方式。
图16是本发明实施例提供的另一种数据处理装置的结构示意图，图16所示的所述数据处理装置包括：
第五编码模块，用于按照CA-Polar和PC-Polar混合编码的方式对信息块进行编码；
第五译码模块，用于按照CA-Polar和PC-Polar混合的译码的方式，对经过信道传输的对所述信息块编码后的结果进行译码。
本发明实施例所提供的图16所示的所述第五种数据处理装置可用于执行图11所示的所述数据处理方法的各种实施例，其实现原理和技术效果类似，此处不再赘述。具体来讲,图11所示的所述数据处理方法中关于S501的各种具体实现方式,也相应地可以作为图16所示的所述数据处理装置的第五编码模块的功能的各种具体化的实现方式。图11所示的所述数据处理方法中关于S502的各种具体实现方式,也相应地可以作为图16所示的所述数据处理装置的第五译码模块的功能的各种具体化的实现方式。
图17为本发明实施例提供的通信装置的结构示意图，所述通信装置包括：处理器、以及与所述处理器信号互联的存储器，当所述通信装置运行时，所述处理器读取并执行所述存储器中的指令或者运行自身的硬件逻辑电路，以使所述通信装置执行如图7至图11所示的数据处理方法中的任意一种数据处理方法的各种实施例。
在所述通信装置的实施例中,所述存储器用于存储所述指令,所述存储器可以独立于所述处理器之外，也可以集成在所述处理器之中。
所述通信装置还可以进一步包括收发器(图中未示出)，用于接收和/或发送数据。本申请实施例的通信装置可以是任何具有无线通信功能的设备，例如接入点、站点、用户设备、基站等。
另外，所述通信装置还可以具有编译码的双重功能，当作为编码端的时候执行编码的操作，当作为译码端的时候，执行译码的操作。该通信装置中包含有基带芯片，该基带芯片含有编码器和译码器，编码器可以用于实现与前述的编码端相同的功能，译码器可以实现与前述译码端相同的功能。
在上述的各种实施例中，所述处理器可以是一种根据非固化指令工作的集成电路或根据固化指令工作的集成电路。根据非固化指令工作的处理器通过读取并执行存储器中的指令来实现如图7至图11所示的所述数据处理方法中的任一种数据处理方法中的各种实施例，或者，实现所述如图12至图16中所示的数据处理装置中的任意一种数据处理装置中的各种实施例。根据固化指令工作的处理器通过运行自身的硬件逻辑电路来实现如图7至图11所示的所述数据处理方法中的任一种数据处理方法中的各种实施例，或者，实现如图12至图16中所示的所述数据处理装置中的任意一种数据处理装置中的各种实施例。根据固化指令工作的处理器在运行自身的硬件逻辑电路 的过程中往往也需要从存储器中读取一些数据，或者将运行结果输出到存储器。所述存储器为随机存储器(Random Access Memory，简称ROM)，闪存，只读存储器(Read Only Memory，简称RAM)，可编程只读存储器，电可擦写可编程存储器，高速缓存(CACHE)或者寄存器等便于处理器读取的存储介质。
在上述的各种实施例中，所述处理器可以是中央处理器(Central Processing Unit，简称CPU)、图形处理器(Graphics Processing Unit，简称GPU)、数字信号处理器(Digital Signal Processor，简称DSP)、专用集成电路(Application Specific Integrated Circuit，简称ASIC)、现成可编程门阵列(Field Programmable Gate Array，简称FPGA)、网络处理器(Network Processor，简称NP)、其他可编程逻辑器件、分立门晶体管逻辑器件、或者分立硬件组件等等。
上述的各种实施例可以全部或部分地通过软件、硬件、固件或者其任意组合来实现。当使用软件实现时，可以全部或部分地以计算机程序产品的形式实现。所述计算机程序产品包括一个或多个计算机指令。在计算机上加载和执行所述计算机程序指令时，全部或部分地产生按照本发明实施例所述的流程或功能。所述计算机可以是通用计算机、专用计算机、计算机网络、或者其他可编程装置。所述计算机指令可以存储在计算机可读存储介质中，或者从一个计算机可读存储介质向另一个计算机可读存储介质传输，例如，所述计算机指令可以从一个网站站点、计算机、服务器或数据中心通过有线(例如同轴电缆、光纤、数字用户线(DSL))或无线(例如红外、无线、微波等)方式向另一个网站站点、计算机、服务器或数据中心进行传输。所述计算机可读存储介质可以是计算机能够存取的任何可用介质或者是包含一个或多个可用介质集成的服务器、数据中心等数据存储设备。所述可用介质可以是磁性介质，(例如，软盘、硬盘、磁带)、光介质(例如，DVD)、或者半导体介质(例如固态硬盘Solid State Disk(SSD))等。
另外，本文中术语“和/或”，仅仅是一种描述关联对象的关联关系，表示可以存在三种关系，例如，A和/或B，可以表示：单独存在A，同时存在A和B，单独存在B这三种情况。另外，本文中字符“/”，一般表示前后关联对象是一种“或”的关系。

Claims (38)

  1. 一种数据处理方法,所述方法包括:
    编码端接收待编码的信息块；
    编码端在信道编译码参数位于一个取值范围的情况下，按照PC-Polar编码方式对所述信息块进行编码，和/或，编码端在信道编译码参数位于另一个取值范围的情况下，按照CA-Polar编码方式对所述信息块进行编码；
    编码端输出对所述信息块进行编码后的结果。
  2. 如权利要求1所述的方法，其特征在于，所述编码端在信道编译码参数位于一个取值范围的情况下，按照PC-Polar编码方式对所述信息块进行编码，包括:
    在信道编译码参数K/M<1/6的情况下，编码端按照PC-Polar的编码方式对所述信息块进行编码,其中,M表示编码长度，K表示所述信息块中信息比特的长度。
  3. 如权利要求2所述的方法，其特征在于，所述K/M<1/12。
  4. 如权利要求1所述的方法，其特征在于，所述编码端在信道编译码参数位于一个取值范围的情况下，按照PC-Polar编码方式对所述信息块进行编码，包括:
    在信道编译码参数K>48的情况下，编码端按照PC-Polar的编码方式对所述信息块进行编码。
  5. 如权利要求4所述的方法，其特征在于，所述K>64。
  6. 如权利要求5所述的方法，其特征在于，所述K>80。
  7. 如权利要求6所述的方法，其特征在于，所述K>120。
  8. 如权利要求1所述的方法，其特征在于，所述编码端在信道编译码参数位于另一个取值范围的情况下，按照CA-Polar编码方式对所述信息块进行编码，包括:
    在信道编译码参数K/M>1/12的情况下，编码端按照CA-Polar的编码方式对所述信息块进行编码,其中,M表示编码长度，K表示所述信息块中信息比特的长度。
  9. 如权利要求8所述的方法，其特征在于，所述K/M>1/6。
  10. 如权利要求1所述的方法，其特征在于，所述编码端在信道编译码参数位于另一个取值范围的情况下，按照CA-Polar编码方式对所述信息块进行编码，包括:
    在信道编译码参数K<120的情况下，编码端按照CA-Polar的编码方式对所述信息块进行编码,其中,K表示所述信息块中信息比特的长度。
  11. 如权利要求10所述的方法，其特征在于，所述K<80。
  12. 如权利要求11所述的方法，其特征在于，所述K<64。
  13. 如权利要求12所述的方法，其特征在于，所述K<48。
  14. 如权利要求1至13中任意一项中所述的方法，其特征在于，所述信道编译码参数具体包括以下参数中的至少一种：N，M，K,L以及由N，M，K以及L中至少一个确定的衍生参数。其中,N表示Polar编码的母码长度，M表示编码长度，K表示所述信息块的长度，L表示译码过程中的搜索宽度。
  15. 一种数据处理方法,其特征在于，所述方法包括:
    译码端接收待译码的数据块；
    译码端在信道编译码参数位于一个取值范围的情况下，按照PC-Polar译码方式对所述数据块进行译码，和/或，译码端在信道编译码参数位于另一个取值范围的情况下，按照CA-Polar译码方式对所述数据块进行译码；
    译码端输出对所述数据块进行译码后的结果。
  16. 如权利要求15所述的方法，其特征在于，所述译码端在信道编译码参数位于一个取值范围的情况下，按照PC-Polar译码方式对所述数据块进行译码，包括:
    在信道编译码参数K/M<1/6的情况下，按照PC-Polar的译码方式对所述数据块进行译码,其中,M表示在对所述数据块编码时的编码长度，K表示所述数据块在被编码之前所具有的信息比特的长度。
  17. 如权利要求16所述的方法，其特征在于，所述K/M<1/12。
  18. 如权利要求15所述的方法，其特征在于，所述译码端在信道编译码参数位于一个取值范围的情况下，按照PC-Polar译码方式对所述数据块进行译码，包括:
    在信道编译码参数K>48的情况下，按照PC-Polar的译码方式对所述数据块进行译码,其中,K表示所述数据块在被编码之前所具有的信息比特的长度。
  19. 如权利要求18所述的方法，其特征在于，所述K>64。
  20. 如权利要求19所述的方法，其特征在于，所述K>80。
  21. 如权利要求20所述的方法，其特征在于，所述K>120。
  22. 如权利要求15所述的方法，其特征在于，所述译码端在信道编译码参数位于另一个取值范围的情况下，按照CA-Polar译码方式对所述数据块进行译码，包括：在信道编译码参数K/M>1/12的情况下，按照CA-Polar的译码方式对所述数据块进行译码,其中,M表示在对所述数据块编码时的编码长度，K表示所述数据块在被编码之前所具有的信息比特的长度。
  23. 如权利要求22所述的方法，其特征在于，所述K/M>1/6。
  24. 如权利要求15所述的方法，其特征在于，所述译码端在信道编译码参数位于另一个取值范围的情况下，按照CA-Polar译码方式对所述数据块进行译码，包括：在信道编译码参数K<120的情况下，按照CA-Polar的译码方式对所述数据块进行译码,其中,K表示所述数据块在被编码之前所具有的信息比特的长度。
  25. 如权利要求24所述的方法，其特征在于，所述K<80。
  26. 如权利要求25所述的方法，其特征在于，所述K<64。
  27. 如权利要求26所述的方法，其特征在于，所述K<48。
  28. 如权利要求15至27中任意一项中所述的方法，其特征在于，所述信道编译码参数具体包括以下参数中的至少一种：N，M，K,L以及由N，M，K以及L中至少一个确定的衍生参数。其中,N表示Polar编码的母码长度，M表示编码长度，K表示所述信息块的长度，L表示译码过程中的搜索宽度。
  29. 一种数据处理装置，其特征在于，所述装置包括：
    接口模块，用于接收待编码的信息块；
    第一编码模块，用于在信道编译码参数位于一个取值范围的情况下，按照PC-Polar编码方式对所述信息块进行编码，和/或，在信道编译码参数位于另一个取值范围的 情况下，按照CA-Polar编码方式对所述信息块进行编码；
    所述接口模块进一步用于输出对所述信息块进行编码后的结果。
  30. 如权利要求29所述的装置，其特征在于，所述第一编码模块进一步用于在信道编译码参数K/M<1/6的情况下，编码端按照PC-Polar的编码方式对所述信息块进行编码,其中,M表示编码长度，K表示所述信息块中信息比特的长度。
  31. 如权利要求29所述的装置，其特征在于，所述第一编码模块进一步用于在信道编译码参数K>48的情况下，编码端按照PC-Polar的编码方式对所述信息块进行编码,其中,K表示所述信息块中信息比特的长度。
  32. 如权利要求29所述的装置，其特征在于，所述第一编码模块进一步用于在信道编译码参数K/M>1/12的情况下，编码端按照CA-Polar的编码方式对所述信息块进行编码,其中,M表示编码长度，K表示所述信息块中信息比特的长度。
  33. 如权利要求29所述的装置，其特征在于，所述第一编码模块进一步用于在信道编译码参数K<120的情况下，编码端按照CA-Polar的编码方式对所述信息块进行编码,其中,K表示所述信息块中信息比特的长度。
  34. 一种数据处理装置，其特征在于，所述装置包括：
    收发模块，用于接收待译码的数据块；
    第二译码模块，用于在信道编译码参数位于一个取值范围的情况下，按照PC-Po l ar译码方式对所述数据块进行译码，和/或，在信道编译码参数位于另一个取值范围的情况下，按照CA-Polar译码方式对所述数据块进行译码；
    所述收发模块还用于输出对所述数据块进行译码后的结果。
  35. 如权利要求34所述的装置，其特征在于，第二译码模块进一步用于在信道编译码参数K/M<1/6的情况下，按照PC-Polar的译码方式对所述数据块进行译码,其中,M表示在对所述数据块编码时的编码长度，K表示所述数据块在被编码之前所具有的信息比特的长度。
  36. 如权利要求34所述的装置，其特征在于，第二译码模块进一步用于在信道编译码参数K>48的情况下，按照PC-Polar的译码方式对所述数据块进行译码,其中,K表示所述数据块在被编码之前所具有的信息比特的长度。
  37. 如权利要求34所述的装置，其特征在于，第二译码模块进一步用于在信道编译码参数K/M>1/12的情况下，按照CA-Polar的译码方式对所述数据块进行译码,其中,M表示在对所述数据块编码时的编码长度，K表示所述数据块在被编码之前所具有的信息比特的长度。
  38. 如权利要求34所述的装置，其特征在于，第二译码模块进一步用于在信道编译码参数K<120的情况下，按照CA-Polar的译码方式对所述数据块进行译码,其中,K表示所述数据块在被编码之前所具有的信息比特的长度。
PCT/CN2018/075129 2017-02-03 2018-02-02 数据处理的方法和装置 WO2018141271A1 (zh)

Priority Applications (3)

Application Number Priority Date Filing Date Title
BR112019016100A BR112019016100A2 (pt) 2017-02-03 2018-02-02 método e aparelho de processamento de dados
EP18748162.7A EP3567767A4 (en) 2017-02-03 2018-02-02 DATA PROCESSING METHOD AND DEVICE
US16/529,821 US11044046B2 (en) 2017-02-03 2019-08-02 Data processing method and apparatus

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710063715.5A CN108390739B (zh) 2017-02-03 2017-02-03 数据处理的方法和装置
CN201710063715.5 2017-02-03

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/529,821 Continuation US11044046B2 (en) 2017-02-03 2019-08-02 Data processing method and apparatus

Publications (1)

Publication Number Publication Date
WO2018141271A1 true WO2018141271A1 (zh) 2018-08-09

Family

ID=63039304

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/075129 WO2018141271A1 (zh) 2017-02-03 2018-02-02 数据处理的方法和装置

Country Status (5)

Country Link
US (1) US11044046B2 (zh)
EP (1) EP3567767A4 (zh)
CN (2) CN108390739B (zh)
BR (1) BR112019016100A2 (zh)
WO (1) WO2018141271A1 (zh)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110431749B (zh) * 2017-03-23 2023-02-03 高通股份有限公司 针对极性编码的奇偶校验比特信道指派
CN109818627B (zh) * 2019-01-21 2020-08-07 中国地质大学（武汉） 一种Polar码SCL译码算法的单门限剪枝方法与系统

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104038234A (zh) * 2013-03-07 2014-09-10 华为技术有限公司 极性码的译码方法和译码器
CN104124979A (zh) * 2013-04-27 2014-10-29 华为技术有限公司 极性码的译码方法和译码装置

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102164025B (zh) * 2011-04-15 2013-06-05 北京邮电大学 基于重复编码和信道极化的编码器及其编译码方法
US9176927B2 (en) * 2011-11-08 2015-11-03 The Royal Institution For The Advancement Of Learning/Mcgill University Methods and systems for decoding polar codes
CN103220001B (zh) 2012-01-20 2016-09-07 华为技术有限公司 与循环冗余校验级联的极性码的译码方法和译码装置
CN103516476B (zh) 2012-06-29 2016-12-21 华为技术有限公司 编码方法和设备
CN106416083B (zh) 2014-05-30 2020-01-21 华为技术有限公司 一种打孔的极化码的构造方法和装置
US10193578B2 (en) * 2014-07-10 2019-01-29 The Royal Institution For The Advancement Of Learning / Mcgill University Flexible polar encoders and decoders
US9628114B2 (en) * 2015-03-31 2017-04-18 Macronix International Co., Ltd. Length-compatible extended polar codes
US9917675B2 (en) * 2016-06-01 2018-03-13 Qualcomm Incorporated Enhanced polar code constructions by strategic placement of CRC bits
EP3494641A1 (en) * 2017-01-10 2019-06-12 Telefonaktiebolaget LM Ericsson (PUBL) Coding and decoding of a polar code concatenated with interleaving with an outer systematic code

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104038234A (zh) * 2013-03-07 2014-09-10 华为技术有限公司 极性码的译码方法和译码器
CN104124979A (zh) * 2013-04-27 2014-10-29 华为技术有限公司 极性码的译码方法和译码装置

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
SAMSUNG: "Discussion on CA -Polar and PC-Polar Codes", 3GPP TSG RAN WG1 AD-HOC, R1-1700979, 20 January 2017 (2017-01-20), XP051203271 *
See also references of EP3567767A4 *

Also Published As

Publication number Publication date
US11044046B2 (en) 2021-06-22
CN108390739B (zh) 2021-01-29
CN108390739A (zh) 2018-08-10
EP3567767A4 (en) 2020-01-08
CN112910471A (zh) 2021-06-04
US20190363826A1 (en) 2019-11-28
BR112019016100A2 (pt) 2020-04-14
EP3567767A1 (en) 2019-11-13

Similar Documents

Publication Publication Date Title
CN107078748B (zh) 极性码的编码方法和编码装置
US11025278B2 (en) Polar coding encoding/decoding method and apparatus
CN107005690B (zh) 极化码的速率匹配的方法、装置和无线通信设备
CN108365848B (zh) 一种极性码的译码方法和装置
CN107204779B (zh) 极性码的编码方法和编码装置
CN110166167B (zh) 编码的方法、译码的方法、编码设备和译码设备
WO2017101631A1 (zh) 用于处理极化码的方法和通信设备
WO2017143870A1 (zh) 极化码的编码方法、译码方法、编码设备和译码设备
WO2019062145A1 (zh) Ploar编码方法和编码装置、译码方法和译码装置
WO2016119105A1 (zh) 极化Polar码的生成方法和设备
CN108631916B (zh) 极化Polar码的速率匹配方法和装置、通信装置
WO2017124844A1 (zh) 确定极化码传输块大小的方法和通信设备
WO2016172940A1 (zh) 极性码的译码方法和译码装置
WO2018137518A1 (zh) 数据的传输方法和装置
CN108365850B (zh) 编码方法、编码装置和通信装置
RU2682017C1 (ru) Способ и устройство связи для передачи информации
WO2020048537A1 (zh) 级联编码的方法和装置
WO2018141271A1 (zh) 数据处理的方法和装置
US10581464B2 (en) Encoder device, decoder device, and methods thereof
WO2018228592A1 (zh) 一种极化Polar码的交织处理方法及装置
WO2019037782A1 (zh) 极化码的译码方法和译码器
CN114079530A (zh) 编码方法及装置
US20230224082A1 (en) Retransmission method and apparatus
WO2020147527A1 (zh) 一种极化编译码方法及装置
WO2018184493A1 (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: 18748162

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

REG Reference to national code

Ref country code: BR

Ref legal event code: B01A

Ref document number: 112019016100

Country of ref document: BR

ENP Entry into the national phase

Ref document number: 2018748162

Country of ref document: EP

Effective date: 20190809

ENP Entry into the national phase

Ref document number: 112019016100

Country of ref document: BR

Kind code of ref document: A2

Effective date: 20190802