WO2018171682A1 - 一种编码方法、译码方法、装置和设备 - Google Patents

一种编码方法、译码方法、装置和设备 Download PDF

Info

Publication number
WO2018171682A1
WO2018171682A1 PCT/CN2018/080072 CN2018080072W WO2018171682A1 WO 2018171682 A1 WO2018171682 A1 WO 2018171682A1 CN 2018080072 W CN2018080072 W CN 2018080072W WO 2018171682 A1 WO2018171682 A1 WO 2018171682A1
Authority
WO
WIPO (PCT)
Prior art keywords
bits
puncturing
sequence
puncturing sequence
rate matching
Prior art date
Application number
PCT/CN2018/080072
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 EP18770411.9A priority Critical patent/EP3595207A4/en
Publication of WO2018171682A1 publication Critical patent/WO2018171682A1/zh
Priority to US16/579,334 priority patent/US10938422B2/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0067—Rate matching
    • H04L1/0068—Rate matching by puncturing
    • H04L1/0069—Puncturing patterns
    • 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/63—Joint error correction and other techniques
    • H03M13/635—Error control coding in combination with rate matching
    • H03M13/6362—Error control coding in combination with rate matching by puncturing
    • H03M13/6368—Error control coding in combination with rate matching by puncturing using rate compatible puncturing or complementary puncturing
    • 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/63—Joint error correction and other techniques
    • H03M13/635—Error control coding in combination with rate matching
    • H03M13/6362—Error control coding in combination with rate matching by puncturing
    • 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

Definitions

  • the embodiments of the present application relate to the field of communications, and more specifically, to a rate matching method and apparatus for a polar code, and a communication apparatus.
  • Polar codes proposed by Turkish professor 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 coding matrix is G N , for example, the encoding process is
  • G N is an N ⁇ N matrix, and Defined as the Kronecker product of log 2 N matrices F 2 .
  • G N. (A) is a sub-matrix obtained from those rows corresponding to the index in the set A in G N.
  • G N (A C ) is obtained from the rows corresponding to the indexes in the set A C in G N . Submatrix.
  • the construction process of the Polar code is a collection
  • the selection process determines the performance of the Polar code.
  • the construction process of the Polar code is generally: determining that there are N polarized channels in total according to the length N of the mother code, respectively corresponding to N rows of the coding matrix, calculating the reliability of the polarized channel, and the first K polarizations with higher reliability.
  • the index of the channel is the element of set A, and the index corresponding to the remaining (NK) polarized channels is used as the index set of fixed bits.
  • Set A determines the position of the information bits, the set The position of the fixed bit is determined.
  • the original Polar code (parent code) has a code length of 2, which is generally required to achieve a long code length of Polar code by rate matching.
  • puncture can be used. The way to achieve rate matching.
  • conventional random punching can be used, that is, randomly generated for the position where punching is required.
  • the mother code length of the Polar code is 16, and the required number of punches is 6, in these 16 positions. Choose 6 punch positions at random. The use of random puncturing to achieve rate matching reduces the performance of the Polar code.
  • the embodiment of the present application provides a rate matching method and device for a Polar code, and a communication device, which can improve the performance of a Polar code.
  • a rate matching method for a Polar code including:
  • N bits to be encoded wherein the N bits to be encoded include N1 information bits, N1 and N are positive integers; encoding the N bits to be encoded to obtain N coded bits; according to the information bit length N1
  • the number of coded bits N and the number of punctured bits Q obtain a first puncturing sequence; the N coded bits are punctured according to the first puncturing sequence to achieve rate matching.
  • determining the N to be encoded bits includes:
  • M is the target code length of the Polar code output
  • M is not equal to the positive integer power of 2
  • M is a positive integer
  • Q is NM.
  • obtaining the first puncturing sequence according to the information bit length N1, the number of encoded bits N, and the number of puncturing holes Q includes:
  • the length of the second puncturing sequence is (N/2)-1; according to the number of puncturing holes Q, from the second puncturing sequence Determine the first puncturing sequence.
  • acquiring the second puncturing sequence corresponding to the information bit length N1 and the encoding bit number N includes:
  • a second puncturing sequence is obtained from the puncturing sequence in Appendix Table 1 or the equivalent replacement sequence of the puncturing sequence in Table 1.
  • determining the first puncturing sequence from the second puncturing sequence according to the number of puncturings Q includes:
  • a sequence consisting of the first Q punctured bits in the second puncturing sequence is determined as the first puncturing sequence.
  • obtaining the first puncturing sequence according to the information bit length N1, the number of encoded bits N, and the number of puncturing holes Q includes:
  • the first puncturing sequence is determined from the third puncturing sequence according to the number of encoded bits N and the number of punctured bits Q.
  • obtaining the third puncturing sequence corresponding to the information bit length N1 and the maximum mother code length includes:
  • a third puncturing sequence is obtained from the puncturing sequence in Appendix Table 2 or the equivalent replacement sequence of the puncturing sequence in Table 2.
  • determining the first puncturing sequence from the third puncturing sequence according to the number N of encoding bits and the number of puncturing bits Q includes:
  • the puncturing bits not larger than N are sequentially read out; when the number of punctured bits read reaches the number of puncturing bits Q, the read Q is determined.
  • the sequence consisting of punctured bits is the first puncturing sequence.
  • obtaining the first puncturing sequence according to the information bit length N1, the number of encoded bits N, and the number of puncturing holes Q includes:
  • the ith punctured bits are determined among (N-i+1) coded bits other than the punctured bits, 2 ⁇ i ⁇ Q; the sequence of the determined Q punctured bits is taken as the first A perforated sequence.
  • determining, by the N1 information bits, the first punctured bits in the N coded bits includes:
  • each of the N-bit coded bits is used as a puncturing bit, respectively calculating an error probability of the polarized channel corresponding to the N1 information bits; determining a minimum error probability among the calculated N error probability, The coded bit corresponding to the minimum error probability is determined as the first punctured bit.
  • the (i-th+1) coded bits other than the determined (i-1) punctured bits are removed from the N coded bits to determine the ith hit.
  • Hole bits include:
  • the error probability of the polarized channel corresponding to the N1 information bits is respectively calculated; in the calculated (N-i+ The minimum error probability is determined among 1) error probabilities, and the coded bits corresponding to the minimum error probability are determined as the i-th puncture bit.
  • calculating an error probability of the polarized channel corresponding to the N1 information bits includes:
  • the error probability of the polarized channel corresponding to each of the N1 information bits is summed to obtain an error probability of the polarized channel corresponding to the N1 information bits.
  • a rate matching apparatus for a Polar code including:
  • a determining module configured to determine N bits to be encoded, where the N bits to be encoded include N1 information bits, N1 and N are positive integers; and an encoding module, configured to encode the N bits to be encoded to obtain N a first puncturing sequence acquisition module, configured to acquire a first puncturing sequence according to the information bit length N1, the number of encoding bits N, and the number of puncturing holes Q; the puncturing module is configured to perform the first puncturing sequence according to the first puncturing sequence
  • the N coded bits are punctured to achieve rate matching.
  • the determining module is specifically configured to:
  • M is the target code length of the Polar code output
  • M is not equal to the positive power of 2
  • M is a positive integer
  • Q is the number of punches
  • the first puncturing sequence acquiring module includes:
  • a second puncturing sequence acquiring module configured to acquire a second puncturing sequence corresponding to the information bit length N1 and the number of encoding bits N, wherein the length of the second puncturing sequence is (N/2)-1;
  • the hole sequence determining module is configured to determine the first punching sequence from the second punching sequence according to the number of punching holes Q.
  • the second puncturing sequence acquiring module is specifically configured to:
  • a second puncturing sequence is obtained from the puncturing sequence in Appendix Table 1 or the equivalent replacement sequence of the puncturing sequence in Table 1.
  • the first puncturing sequence determining module is specifically configured to:
  • a sequence consisting of the first Q punctured bits in the second puncturing sequence is determined as the first puncturing sequence.
  • the first puncturing sequence acquiring module includes:
  • a third puncturing sequence obtaining module configured to acquire a third puncturing sequence corresponding to the information bit length N1 and the maximum mother code length, where the maximum mother code length is the maximum target supported by the communication system to which the Polar code is applied The code length of the mother code corresponding to the code length; the first puncturing sequence determining module is configured to determine the first puncturing sequence from the third puncturing sequence according to the number N of coding bits and the number Q of puncturing bits.
  • the third puncturing sequence acquiring module is specifically configured to:
  • a third puncturing sequence is obtained from the puncturing sequence in Appendix Table 2 or the equivalent replacement sequence of the puncturing sequence in Table 2.
  • the first puncturing sequence determining module is specifically configured to:
  • the puncturing bits not larger than N are sequentially read out; when the number of punctured bits read reaches the number of puncturing bits Q, the read Q is determined.
  • the sequence consisting of punctured bits is the first puncturing sequence.
  • the first puncturing sequence acquiring module is specifically configured to:
  • the ith punctured bits are determined among (N-i+1) coded bits other than the punctured bits, 2 ⁇ i ⁇ Q; the sequence of the determined Q punctured bits is taken as the first A perforated sequence.
  • a communication device including:
  • a processor for executing the program stored by the memory the processor being operative to perform any one of the possible implementations of the first aspect or the first aspect described above when the program is executed.
  • Yet another aspect of the present application is directed to a computer readable storage medium having stored therein instructions that, when executed on a computer, cause the computer to perform the methods described in the various aspects above.
  • Yet another aspect of the present application provides a computer program product comprising instructions which, when run on a computer, cause the computer to perform the methods described in the various aspects above.
  • Yet another aspect of the present application provides a computer program that, when run on a computer, causes the computer to perform the methods described in the various aspects above.
  • the performance of the Polar code can be improved.
  • 2a is a schematic diagram of a basic flow of a wireless communication transmitting end and a receiving end;
  • 2b is a schematic diagram of a Polar code encoding and rate matching process implemented by the present application
  • FIG. 3 is a schematic flowchart of a rate matching method for a Polar code implemented in the present application
  • step 330 of FIG. 3 is a flow chart of an embodiment of step 330 of FIG. 3;
  • Figure 5 is a flow chart of still another embodiment of step 330 of Figure 3;
  • Figure 6 is a flow chart of still another embodiment of step 330 of Figure 3;
  • FIG. 7 is a structural diagram of a rate matching apparatus for a Polar code implemented in the present application.
  • FIG 8 is a structural view of the module 703 of Figure 7;
  • FIG. 9 is another structural diagram of the module 703 of Figure 7;
  • FIG. 10 is a structural diagram of a communication device implemented by the present application.
  • 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
  • a component can be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and/or a computer.
  • an application running on a computing device and a computing device can be a component.
  • One or more components can reside within a process and/or execution thread, and the components can be located on one computer and/or distributed between two or more computers.
  • these components can execute from various computer readable media having various data structures stored thereon.
  • a component may, for example, be based on signals having one or more data packets (eg, data from two components interacting with another component between the local system, the distributed system, and/or the network, such as the Internet interacting with other systems) Communicate through local and/or remote processes.
  • data packets eg, data from two components interacting with another component between the local system, the distributed system, and/or the network, such as the Internet interacting with other systems
  • An access terminal may also be called a system, a subscriber unit, a subscriber station, a mobile station, a mobile station, a remote station, a remote terminal, a mobile device, a user terminal, a terminal, a wireless communication device, a user agent, a user device, or a UE (User Equipment, User equipment).
  • the access terminal may be a cellular phone, a cordless phone, a SIP (Session Initiation Protocol) phone, a WLL (Wireless Local Loop) station, a PDA (Personal Digital Assistant), and a wireless communication.
  • the base station can be used for communication with a mobile device, and the base station can be a BTS (Base Transceiver Station) in GSM (Global System of Mobile communication) or CDMA (Code Division Multiple Access), or
  • the NB (NodeB, base station) in the WCDMA (Wideband Code Division Multiple Access) may be an eNB or an eNodeB (Evolved Node B) in LTE (Long Term Evolution).
  • 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 multiple components associated with signal transmission and reception (e.g., processor, modulator, multiplexer, demodulation) , demultiplexer or antenna, etc.).
  • Base station 102 can communicate with one or more access terminals, such as access terminal 116 and access terminal 122. However, it will be appreciated that base station 102 can communicate with 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 a different frequency band than that used by the reverse link 120, and the forward link 124 can utilize the reverse link 126. Different frequency bands used.
  • the forward link 118 and the reverse link 120 can use a common frequency band, and the forward link 124 and the reverse link 126 can use a common frequency band.
  • Each set of antennas and/or regions designed for communication is referred to as a sector of base station 102.
  • the antenna group can be designed to communicate with access terminals in sectors of the coverage area of base station 102.
  • the transmit 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 (eg, 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 multiple transport blocks) of data that 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 (not shown).
  • 2a is a basic flow of wireless communication.
  • the source is sequentially transmitted after source coding, channel coding, and digital modulation.
  • the destination is outputted by digital demodulation, channel decoding, and source decoding.
  • the channel codec can use a Polar code. Since the code length of the original Polar code (parent code) is an integer power of 2, in practical applications, a Polar code of arbitrary code length needs to be implemented by rate matching. As shown in FIG. 2a, rate matching is performed after channel coding at the transmitting end to implement an arbitrary target code length, and at the receiving end, de-rate matching is performed before channel decoding.
  • FIG. 2b is a schematic diagram of a Polar code encoding and rate matching process implemented by the present application.
  • the encoding and rate matching of the Polar code mainly includes four processes of constructing, encoding, determining the puncturing sequence and rate matching.
  • the construction process receiving the input N1 information bits, determining the mother code length N, the mother code length N is determined according to the encoded target code length M, the number of bits to be coded is N, and the N bits to be coded include N1 Information bits and N2 fixed bits, one bit (information bits or fixed bits) corresponds to one polarization channel, the positions of N1 information bits form a set of information bit positions, and the positions of N2 fixed bits form a fixed set of bit positions.
  • the information bit position set may be a set of information bit indexes.
  • the method for determining the information bit position set is not limited.
  • the information bit position may be determined according to the reliability of the polarization channel. Specifically, The reliability estimation of the polarized channel is performed according to the actual parameters and the code rate of the polarized channel, and the information bits are placed on the polarized channel with high reliability; or the position of the information bit may be determined according to the polarization weight of the polarized channel.
  • Encoding process Polar coding of the bits to be coded to obtain coded bits
  • Determining the puncturing sequence determining the puncturing sequence, that is, the puncturing bit set, is used to indicate the puncturing position, and the number of elements included in the puncturing sequence is the number of puncturing.
  • Rate matching puncturing the coded bits according to the determined puncturing sequence to achieve rate matching. Specifically, selecting the partial coded bits in the coded bits according to the determined puncturing sequence does not pass the channel transmission, and directly discards to implement the target code. Long adaptation to achieve the purpose of adjusting the code rate.
  • FIG. 3 is a rate matching method 300 for a Polar code according to an embodiment of the present disclosure. Specifically, the rate matching method 300 includes:
  • the N bits to be encoded include N1 information bits, and N1 and N are positive integers;
  • N is determined according to the target code length M of the Polar code output. symbol Indicates rounding down, M is not equal to a positive integer power of 2, M is a positive integer, N bits to be encoded correspond to N polarized channels, and one bit corresponds to one polarized channel
  • the information bits may only include information bits, or may be bits obtained by using information bits according to a certain functional relationship, and may also include information bits and check bits, and the check bits may be CRC or parity. Check bit.
  • the encoding process of the bit to be encoded may be completed by using the encoding matrix F N of the Polar code, thereby obtaining the encoded code of the Polar encoding.
  • the information bit length refers to the number of information bits.
  • the length of the information bit refers to the sum of the number of information bits and the number of check bits; the number of coded bits N is The mother code length is N.
  • the selected coded bits are selected from the coded bits in the first puncturing sequence without being transmitted through the channel, and are directly discarded, so as to achieve adaptation of the target code length to achieve the purpose of adjusting the coded rate. .
  • obtaining the first puncturing sequence according to the information bit length N1, the number of coding bits N, and the number of puncturing holes Q in the step S330 includes:
  • the replacement value of 54 means that the length N1 of the information bit may be a value close to 54. For example, the replacement value of 54 may be an interval [49, 59] A value between , or a value between intervals [44, 64].
  • a second puncturing sequence can be obtained by querying the puncturing sequence in Table 1 or the equivalent replacement sequence of the puncturing sequence in Table 1.
  • the elements in the puncturing sequence are used to indicate the serial number of the polarized channel, and all or part of the puncturing sequence of Table 1 can be stored in the communication system to which the present embodiment is applied.
  • the elements included in the puncturing sequence in Tables 1 and 2 are used to indicate the serial number of the polarized channel.
  • the serial number of the polarized channel starts from 1, and in fact, the serial number of the polarized channel is also It can start from 0. Therefore, subtracting 1 from each element in the puncturing sequence in Tables 1 and 2 of the current appendix can form a sequence of polarized channels starting from 0.
  • the sequence number or identifier of the above polarized channel may also be represented in other ways, and the specific expression does not affect the specific location of the polarized channel represented in the table.
  • S332a Determine a first puncturing sequence from the second puncturing sequence according to the number of puncturing holes Q.
  • Q punch bits are selected as the first puncturing sequence from the second puncturing sequence, for example, the sequence consisting of the first Q puncturing bits in the second puncturing sequence is determined as the first puncturing sequence. Or determining a sequence consisting of the last Q punctured bits in the second puncturing sequence as the first puncturing sequence. In this embodiment, how to select Q puncturing bits from the second puncturing sequence as the first hit
  • the pore sequence is not specifically limited.
  • the computational complexity of constructing the first puncturing sequence can be reduced by storing the second puncturing sequence in the communication system.
  • obtaining the first puncturing sequence according to the information bit length N1, the number of encoded bits N, and the number of puncturing holes Q in the step S330 includes:
  • the maximum mother code length N max is the mother code length corresponding to the maximum target code length supported by the communication system to which the Polar code is applied, and the length of the third punch sequence is N max -1, and the third punch sequence That is, the maximum puncturing sequence corresponding to the maximum mother code length N max ;
  • the length N1 of the information bit may also be equal to the replacement value of 54.
  • the replacement value of 54 means that the length N1 of the information bit may be a value close to 54.
  • the replacement value of 54 may be an interval [49, 59] A value between , or a value between intervals [44, 64].
  • a third puncturing sequence can be obtained by querying the puncturing sequence in Table 2 or the equivalent replacement sequence of the puncturing sequence in Table 2.
  • the elements in the puncturing sequence of Table 2 are used to indicate the serial number of the polarized channel, and all or part of the puncturing sequence of Table 2 may be stored in the communication system to which the present embodiment is applied.
  • S332b Determine a first puncturing sequence from the third puncturing sequence according to the number N of coding bits and the number of puncturing bits Q.
  • the puncturing bits not greater than N are sequentially read out; when the number of punctured bits read reaches Q, the read Q is determined.
  • the sequence consisting of punctured bits is the first puncturing sequence.
  • the puncturing bits not greater than N are sequentially read out, and the embodiment does not limit the reading of which element in the third puncturing sequence. .
  • the computational complexity of constructing the first puncturing sequence can be reduced by storing the third puncturing sequence in the communication system.
  • obtaining the first puncturing sequence according to the information bit length N1, the number of encoded bits N, and the number of puncturing holes Q in the step S330 includes:
  • S331c Determine, according to the N1 information bits, a first punctured bit among the N coded bits.
  • the error probability of the polarized channel corresponding to the N1 information bits is respectively calculated; and the minimum error probability is determined among the calculated N error probability, The coded bit corresponding to the minimum error probability is determined as the first punctured bit.
  • the error probability of calculating the polarized channel corresponding to the N1 information bits includes:
  • the error probabilities of the polarized channels corresponding to each of the N1 information bits are summed to obtain an error probability of the polarized channel corresponding to the N1 information bits.
  • the error probability of the polarization channel corresponding to the information bit may be calculated by using a density evolution or a Gaussian approximation. This embodiment does not specifically limit how to calculate the error probability of the polarized channel.
  • determining, in the N coded bits, the (i-i+1) coded bits other than the determined (i-1) punctured bits includes:
  • the error probability of the polarized channel corresponding to the N1 information bits is respectively calculated; in the calculated (N-i+1) The minimum error probability is determined among the error probabilities, and the coded bit corresponding to the minimum error probability is determined as the i-th puncture bit.
  • the error probability of calculating the polarized channel corresponding to the N1 information bits includes:
  • the error probabilities of the polarized channels corresponding to each of the N1 information bits are summed to obtain an error probability of the polarized channel corresponding to the N1 information bits.
  • Punch locations include:
  • the minimum error probability is determined among the calculated (N-1) error probabilities, and the coded bit corresponding to the minimum error probability is determined as the second punctured bit.
  • S333c The sequence formed by the determined Q punch bits is used as the first puncturing sequence.
  • the first puncturing sequence is determined by online calculation, and the puncturing sequence does not need to be stored in the communication system, thereby saving storage resources.
  • the puncturing bits indicated in the first puncturing sequence are acquired according to the information bit length N1, the number of encoding bits N, and the number of puncturing bits Q, instead of being randomly generated, Polar can be improved.
  • the performance of the code since the puncturing bits indicated in the first puncturing sequence are acquired according to the information bit length N1, the number of encoding bits N, and the number of puncturing bits Q, instead of being randomly generated, Polar can be improved. The performance of the code.
  • the rate matching apparatus 700 of the Polar code provided by the embodiment of the present application is described below with reference to FIG. 7.
  • the rate matching apparatus 700 includes:
  • a determining module 701 configured to determine N bits to be encoded, where the N bits to be encoded include N1 information bits, and N1 and N are positive integers;
  • Encoding module 702 configured to encode the N to-be-coded bits to obtain N coded bits
  • the encoding process of the bit to be encoded may be completed by using the encoding matrix F N of the Polar code, thereby obtaining the encoded code of the Polar encoding.
  • the first puncturing sequence obtaining module 703 is configured to obtain the first puncturing sequence according to the information bit length N1, the number of encoded bits N, and the number of puncturing bits Q;
  • the puncturing module 704 is configured to punct the N coded bits according to the first puncturing sequence to achieve rate matching.
  • the first puncturing sequence acquisition module 703 includes a second puncturing sequence acquiring module 7031 and a first puncturing sequence determining module 7032.
  • the second puncturing sequence obtaining module 7031 is configured to acquire a second puncturing sequence corresponding to the information bit length N1 and the number of coding bits N, and the length of the second puncturing sequence is (N/2)-1;
  • the first puncturing sequence determining module 7032 is configured to determine a first puncturing sequence from the second puncturing sequence according to the number of puncturing holes Q.
  • the second puncturing sequence obtaining module 7031 may obtain a second puncturing sequence from the puncturing sequence in Appendix Table 1 or the equivalent replacement sequence of the puncturing sequence in the table 1; the first puncturing sequence determining module 7032 may The sequence consisting of the first Q punctured bits in the second puncturing sequence is determined as the first puncturing sequence.
  • the first puncturing sequence acquisition module 703 includes a third puncturing sequence acquiring module 7033 and a first puncturing sequence determining module 7032.
  • the third puncturing sequence obtaining module 7033 is configured to obtain a third puncturing sequence corresponding to the information bit length N1 and the maximum mother code length, where the maximum mother code length is the maximum supported by the communication system to which the Polar code is applied.
  • the first puncturing sequence determining module 7032 is configured to determine the first puncturing sequence from the third puncturing sequence according to the number of encoded bits N and the number of punctured bits Q.
  • the third puncturing sequence obtaining module 7033 may obtain a third puncturing sequence from the puncturing sequence in the Appendix Table 2 or the equivalent replacement sequence of the puncturing sequence in the table 2; the first puncturing sequence determining module 7032 is specifically used. After: starting from the first puncturing bit in the third puncturing sequence, sequentially reading the puncturing bits that are not greater than N; and when the number of punctured bits read reaches the number of puncturing bits Q, determining to read The sequence of Q punch bits is the first puncturing sequence.
  • the first puncturing sequence obtaining module 703 is specifically configured to: determine, according to the N1 information bits, a first punctured bit among the N coded bits; The number of puncturing bits Q, respectively, among the N coded bits, the ith punctured bits are determined from (N-i+1) coded bits except the determined (i-1) punctured bits. 2 ⁇ i ⁇ Q; the sequence composed of the determined Q puncturing bits is taken as the first puncturing sequence.
  • the determining, by the N1 information bits, the first punctured bit among the N coded bits comprises: calculating, by using, each of the N coded bits as a punctured bit, respectively calculating the N1 information bits The error probability of the corresponding polarized channel; the minimum error probability is determined among the calculated N error probabilities, and the coded bit corresponding to the minimum error probability is determined as the first punctured bit.
  • Determining, in the N coded bits, the (i-i+1)th coded bits other than the determined (i-1) punctured bits, determining the ith punctured bit includes: When each code bit of i+1) code bits is used as a puncturing bit, the error probability of the polarized channel corresponding to the N1 information bits is respectively calculated; the calculated (N-i+1) error probability The minimum error probability is determined, and the coded bit corresponding to the minimum error probability is determined as the i-th punctured bit.
  • the calculating the error probability of the polarized channel corresponding to the N1 information bits comprises: summing the error probabilities of the polarized channels corresponding to each of the N1 information bits to obtain the N1 information bits. The error probability of the corresponding polarized channel.
  • the rate matching device since the puncturing bits indicated in the first puncturing sequence are acquired according to the information bit length N1, the number of encoded bits N, and the number of punctured bits Q, instead of being randomly generated, Polar can be improved. The performance of the code.
  • FIG. 10 is a schematic structural diagram of a communication device 1000 according to an embodiment of the present application (for example, an access point or a base station, a communication device such as a station or a terminal, or a chip in the foregoing communication device, etc.).
  • a communication device 1000 for example, an access point or a base station, a communication device such as a station or a terminal, or a chip in the foregoing communication device, etc.
  • communication device 1000 can be implemented by bus 1001 as a general bus architecture.
  • bus 1001 may include any number of interconnecting buses and bridges.
  • Bus 1001 connects various circuits together, including processor 1002, storage medium 1003, and bus interface 1004.
  • the communication device 1000 connects the network adapter 1005 or the like via the bus interface 1004 via the bus interface 1004.
  • the network adapter 1005 can be used to implement signal processing functions of the physical layer in the wireless communication network, and transmit and receive radio frequency signals through the antenna 1007.
  • the user interface 1006 can be connected to a user terminal such as a keyboard, a display, a mouse, or a joystick.
  • the bus 1001 can also be connected to various other circuits, such as timing sources, peripherals, voltage regulators, or power management circuits, etc., which are well known in the art and therefore will not be described in detail.
  • the communication device 1000 can also be configured as a general purpose processing system, such as generally referred to as a chip, the general purpose processing system comprising: one or more microprocessors providing processor functionality; and an external memory providing at least a portion of the storage medium 1003 All of this is connected to other support circuits through an external bus architecture.
  • a general purpose processing system such as generally referred to as a chip, the general purpose processing system comprising: one or more microprocessors providing processor functionality; and an external memory providing at least a portion of the storage medium 1003 All of this is connected to other support circuits through an external bus architecture.
  • the communication device 600 can be implemented using an ASIC (Application Specific Integrated Circuit) having a processor 1002, a bus interface 1004, a user interface 1006, and at least a portion of the storage medium 1003 integrated in a single chip, or
  • the communication device 1000 can be implemented using one or more FPGAs (Field Programmable Gate Arrays), PLDs (Programmable Logic Devices), controllers, state machines, gate logic, discrete hardware components, any other suitable circuitry, Or any combination of circuits capable of performing the various functions described throughout the application.
  • FPGAs Field Programmable Gate Arrays
  • PLDs Programmable Logic Devices
  • controllers state machines, gate logic, discrete hardware components, any other suitable circuitry, Or any combination of circuits capable of performing the various functions described throughout the application.
  • the processor 1002 is responsible for managing the bus and general processing (including executing software stored on the storage medium 1003).
  • the processor 1002 can be implemented using one or more general purpose processors and/or special purpose processors. Examples of processors include microprocessors, microcontrollers, DSP processors, and other circuits capable of executing software.
  • Software should be interpreted broadly to mean instructions, data, or any combination thereof, whether referred to as software, firmware, middleware, microcode, hardware description language, or otherwise.
  • Storage medium 1003 is shown separated from processor 1002 in the following figures, however, those skilled in the art will readily appreciate that storage medium 1003, or any portion thereof, may be located external to communication device 1000.
  • storage medium 1003 can include a transmission line, a carrier waveform modulated with data, and/or a computer article separate from the wireless node, which can be accessed by processor 1002 via bus interface 1004.
  • storage medium 1003, or any portion thereof, may be integrated into processor 1002, for example, may be a cache and/or a general purpose register.
  • the processor 1002 can perform the foregoing embodiments in the foregoing embodiments, for example, FIG. 3, FIG. 4, FIG. 5, and FIG. 6, and the execution of the processor 1002 is not described herein again.
  • the communication device in the embodiment of the present application may be a wireless communication device such as an access point, a station, a base station, or a user terminal.
  • the Polar code in the embodiment of the present application may also be a CA-Polar code or a PC-Polar code.
  • Arikan Polar refers to the original Polar code, which is not cascaded with other codes, only information bits and frozen bits.
  • the CA-Polar code is a Polar code cascading a Cyclic Redundancy Check (CRC) Polar code
  • the PC-Polar code is a Polar code cascading Parity Check (PC) code.
  • PC-Polar and CA-Polar improve the performance of Polar codes by cascading different codes.
  • the "fixed bits” described in the embodiments of the present application may also be referred to as "frozen bits".
  • the unit and method processes of the examples described in the embodiments of the present application can be implemented by electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the solution. The skilled person can use different methods for each particular application to implement the described functionality.
  • the disclosed apparatus and method may be implemented in other manners.
  • the device embodiments described above are merely illustrative.
  • the division of the modules or units is only one logical function division, and may be further divided in actual implementation.
  • multiple modules or units may be combined or integrated into another system, or some steps may be omitted or not performed.
  • the coupling or direct coupling or communication connection of the various modules or units to one another may be through some interfaces, which may be in electrical, mechanical or other form.
  • the units described as separate components may or may not be physically separate, and may be located in one place or on multiple network elements.
  • each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
  • the computer program product includes one or more computer instructions.
  • 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)
  • Mobile Radio Communication Systems (AREA)
  • Error Detection And Correction (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)

Abstract

本申请实施例提供一种极化 Polar 码的速率匹配方法和装置、通信装置。该速率匹配方法包括：确定 N 个待编码比特，该N个待编码比特中包含 N1个信息比特，N1 和N均为正整数；对该 N 个待编码比特进行编码以得到 N个编码比特；根据信息比特长度 N1、编码比特个数 N 和打孔数目 Q 获取第一打孔序列；根据第一打孔序列对该 N 个编码比特进行打孔以实现速率匹配。由于第一打孔序列中所指示的打孔比特是根据信息比特长度 N1、编码比特个数 N 和打孔数目 Q 获取，而非随机产生，可以提高 Polar 码的性能。

Description

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

Claims (23)

  1. 一种极化Polar码的速率匹配方法，其特征在于，包括：
    确定N个待编码比特，所述N个待编码比特中包含N1个信息比特，N1和N均为正整数；
    对所述N个待编码比特进行编码以得到N个编码比特；
    根据信息比特长度N1、编码比特个数N和打孔数目Q获取第一打孔序列；
    根据所述第一打孔序列对所述N个编码比特进行打孔以实现速率匹配。
  2. 根据权利要求1所述的速率匹配方法，其特征在于，所述确定N个待编码比特包括：
    根据M确定N,其中，
    Figure PCTCN2018080072-appb-100001
    符号
    Figure PCTCN2018080072-appb-100002
    表示向下取整，所述M为Polar码输出的目标码长，所述M不等于2的正整数次幂，M为正整数，所述打孔数目Q＝N-M。
  3. 根据权利要求2所述的速率匹配方法，其特征在于，所述根据信息比特长度N1、编码比特个数N和打孔数目Q获取第一打孔序列包括：
    获取与信息比特长度N1和编码比特个数N所对应的第二打孔序列，所述第二打孔序列的长度为(N/2)-1；
    根据所述打孔数目Q从所述第二打孔序列中确定所述第一打孔序列。
  4. 根据权利要求3所述的速率匹配方法，其特征在于，所述获取与信息比特长度N1和编码比特个数N所对应的第二打孔序列包括：
    从附录表1中打孔序列或所述表1中所述打孔序列的等同替换序列得到所述第二打孔序列。
  5. 根据权利要求3或4所述的速率匹配方法，其特征在于，所述根据所述打孔数目Q从所述第二打孔序列中确定所述第一打孔序列包括：
    将所述第二打孔序列中前Q个打孔比特所组成的序列确定为所述第一打孔序列。
  6. 根据权利要求2所述的速率匹配方法，其特征在于，所述根据信息比特长度N1、编码比特个数N和打孔数目Q获取第一打孔序列包括：
    获取与信息比特长度N1和最大母码码长所对应的第三打孔序列，所述最大母码码长为所述Polar码所应用的通信系统所支持的最大目标码长所对应的母码码长；
    根据编码比特个数N和所述打孔数目Q从所述第三打孔序列中确定所述第一打孔序列。
  7. 根据权利要求6所述的速率匹配方法，其特征在于，所述获取与信息比特长度N1和最大母码码长所对应的第三打孔序列包括：
    从附录表2中打孔序列或所述表2中所述打孔序列的等同替换序列得到所述第三打孔序列。
  8. 根据权利要求6或7所述的速率匹配方法，其特征在于，所述根据编码比特个数N和所述打孔数目Q从所述第三打孔序列中确定所述第一打孔序列包括：
    从所述第三打孔序列中第一个打孔比特开始，依次将不大于N的打孔比特读出；
    当读出的打孔比特的个数达到所述打孔数目Q时，确定读出的Q个打孔比特所组成的序列为所述第一打孔序列。
  9. 根据权利要求2所述的速率匹配方法，其特征在于，所述根据信息比特长度N1、编码比特个数N和打孔数目Q获取第一打孔序列包括：
    根据所述N1个信息比特在所述N个编码比特中确定出第1个打孔比特；
    针对i从2遍历到所述打孔数目Q，分别在所述N个编码比特中除去已确定出的(i-1)个打孔比特之外的(N-i+1)个编码比特中确定出第i个打孔比特，2≤i≤Q；
    将确定出的Q个打孔比特所组成的序列作为所述第一打孔序列。
  10. 根据权利要求9所述的速率匹配方法，其特征在于，所述根据所述N1个信息比特在所述N个编码比特中确定出第1个打孔比特包括：
    在所述N位编码比特中每一位编码比特作为打孔比特时，分别计算所述N1个信息比特所对应的极化信道的错误概率；
    在计算出的N个错误概率中确定最小错误概率，将所述最小错误概率所对应的编码比特确定为所述第1个打孔比特。
  11. 根据权利要求9所述的方法，其特征在于，在所述N个编码比特中除去已确定出的(i-1)个打孔比特之外的(N-i+1)个编码比特中确定出第i个打孔比特包括：
    在所述(N-i+1)个编码比特中每一位编码比特作为打孔比特时，分别计算所述N1个信息比特所对应的极化信道的错误概率；
    在计算出的(N-i+1)个错误概率中确定最小错误概率，并且将所述最小错误概率所对应的编码比特确定为第i个打孔比特。
  12. 根据权利要求10或11所述的方法，其特征在于，所述计算所述N1个信息比特所对应的极化信道的错误概率包括：
    将N1个信息比特中每个信息比特所对应的极化信道的错误概率进行求和以得到所述N1个信息比特所对应的极化信道的错误概率。
  13. 一种极化Polar码的速率匹配装置，其特征在于，包括：
    确定模块，用于确定N个待编码比特，所述N个待编码比特中包含N1个信息比特，N1和N均为正整数；
    编码模块，用于对所述N个待编码比特进行编码以得到N个编码比特；
    第一打孔序列获取模块，用于根据信息比特长度N1、编码比特个数N和打孔数目Q获取第一打孔序列；
    打孔模块，用于根据所述第一打孔序列对所述N个编码比特进行打孔以实现速率匹配。
  14. 根据权利要求13所述的速率匹配装置，其特征在于，所述确定模块具体用于：
    根据M确定N,其中，
    Figure PCTCN2018080072-appb-100003
    符号
    Figure PCTCN2018080072-appb-100004
    表示向下取整，所述M为Polar码输 出的目标码长，所述M不等于2的正整数次幂，M为正整数，所述打孔数目Q＝N-M。
  15. 根据权利要求14所述的速率匹配装置，其特征在于，所述第一打孔序列获取模块包括：
    第二打孔序列获取模块，用于获取与信息比特长度N1和编码比特个数N所对应的第二打孔序列，所述第二打孔序列的长度为(N/2)-1；
    第一打孔序列确定模块，用于根据所述打孔数目Q从所述第二打孔序列中确定所述第一打孔序列。
  16. 根据权利要求15所述的速率匹配装置，其特征在于，所述第二打孔序列获取模块具体用于：
    从附录表1中打孔序列或所述表1中所述打孔序列的等同替换序列得到所述第二打孔序列。
  17. 根据权利要求15或16所述的速率匹配装置，其特征在于，第一打孔序列确定模块具体用于：
    将所述第二打孔序列中前Q个打孔比特所组成的序列确定为所述第一打孔序列。
  18. 根据权利要求14所述的速率匹配装置，其特征在于，所述第一打孔序列获取模块包括：
    第三打孔序列获取模块，用于获取与信息比特长度N1和最大母码码长所对应的第三打孔序列，所述最大母码码长为所述Polar码所应用的通信系统所支持的最大目标码长所对应的母码码长；
    第一打孔序列确定模块，用于根据编码比特个数N和所述打孔数目Q从所述第三打孔序列中确定所述第一打孔序列。
  19. 根据权利要求18所述的速率匹配装置，其特征在于，所述第三打孔序列获取模块具体用于：
    从附录表2中打孔序列或所述表2中所述打孔序列的等同替换序列得到所述第三打孔序列。
  20. 根据权利要求18或19所述的速率匹配装置，其特征在于，所述第一打孔序列确定模块具体用于：
    从所述第三打孔序列中第一个打孔比特开始，依次将不大于N的打孔比特读出；
    当读出的打孔比特的个数达到所述打孔数目Q时，确定读出的Q个打孔比特所组成的序列为所述第一打孔序列。
  21. 根据权利要求14所述的速率匹配装置，其特征在于，所述第一打孔序列获取模块具体用于：
    根据所述N1个信息比特在所述N个编码比特中确定出第1个打孔比特；
    针对i从2遍历到所述打孔数目Q，分别在所述N个编码比特中除去已确定出的(i-1)个打孔比特之外的(N-i+1)个编码比特中确定出第i个打孔比特，2≤i≤Q；
    将确定出的Q个打孔比特所组成的序列作为所述第一打孔序列。
  22. 一种通信装置，其特征在于，包括：
    存储器，用于存储程序；
    处理器，用于执行所述存储器存储的所述程序，当所述程序被执行时，所述处理器用于执行如权利要求1-12中任一所述的步骤。
  23. 一种计算机可读存储介质，包括指令，当其在计算机上运行时，使得计算机执行如权利要求1-12任意一项所述的方法。
PCT/CN2018/080072 2017-03-24 2018-03-22 一种编码方法、译码方法、装置和设备 WO2018171682A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP18770411.9A EP3595207A4 (en) 2017-03-24 2018-03-22 CODING METHOD, DECODING METHOD, DEVICE AND DEVICE
US16/579,334 US10938422B2 (en) 2017-03-24 2019-09-23 Polar code rate matching method and apparatus, and a communications apparatus

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710182082.XA CN108631916B (zh) 2017-03-24 2017-03-24 极化Polar码的速率匹配方法和装置、通信装置
CN201710182082.X 2017-03-24

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/579,334 Continuation US10938422B2 (en) 2017-03-24 2019-09-23 Polar code rate matching method and apparatus, and a communications apparatus

Publications (1)

Publication Number Publication Date
WO2018171682A1 true WO2018171682A1 (zh) 2018-09-27

Family

ID=63584119

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/080072 WO2018171682A1 (zh) 2017-03-24 2018-03-22 一种编码方法、译码方法、装置和设备

Country Status (4)

Country Link
US (1) US10938422B2 (zh)
EP (1) EP3595207A4 (zh)
CN (1) CN108631916B (zh)
WO (1) WO2018171682A1 (zh)

Families Citing this family (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107370560B (zh) * 2016-05-12 2020-04-21 华为技术有限公司 一种极化码的编码和速率匹配方法、装置及设备
CN107666370B (zh) 2016-07-29 2023-09-22 华为技术有限公司 编码方法和设备
CN108599891B (zh) * 2017-03-17 2020-05-08 华为技术有限公司 编码方法、编码装置和通信装置
CN108809486B (zh) * 2017-05-03 2020-09-04 华为技术有限公司 Polar码编译码方法及装置
CN111865487B (zh) 2019-04-29 2022-07-29 华为技术有限公司 一种编码方法及通信设备
CN110213016B (zh) * 2019-04-30 2021-09-21 杭州电子科技大学 一种多中继选择极化译码转发方法
CN112187402B (zh) * 2019-07-05 2024-05-17 北京京东振世信息技术有限公司 一种数据处理的方法、装置和存储介质
CN113810060A (zh) * 2020-06-17 2021-12-17 华为技术有限公司 一种Polar码速率匹配方法及装置
WO2022011698A1 (en) * 2020-07-17 2022-01-20 Qualcomm Incorporated Nr-u for 6ghz band: papr reduction for cross cc transmission
US11455208B2 (en) * 2020-08-20 2022-09-27 Western Digital Technologies, Inc. Soft information for punctured bit estimation in a data storage device

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103023618A (zh) * 2013-01-11 2013-04-03 北京邮电大学 一种任意码长的极化编码方法
CN103281166A (zh) * 2013-05-15 2013-09-04 北京邮电大学 一种基于极化码的混合自动重传请求传输方法
WO2015139248A1 (zh) * 2014-03-19 2015-09-24 华为技术有限公司 极性码的速率匹配方法和速率匹配装置
WO2015149225A1 (zh) * 2014-03-31 2015-10-08 华为技术有限公司 极化码的混合自动重传方法及装置、无线通信装置

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
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 华为技术有限公司 与循环冗余校验级联的极性码的译码方法和译码装置
CN103368583B (zh) * 2012-04-11 2016-08-17 华为技术有限公司 极性码的译码方法和译码装置
KR101710025B1 (ko) * 2013-01-24 2017-02-24 캘리포니아 인스티튜트 오브 테크놀로지 재기록 불능 메모리에서의 결합 재기록 및 에러 정정
US9768915B2 (en) * 2013-08-20 2017-09-19 Lg Electronics Inc. Method for transmitting data by using polar coding in wireless access system
RU2571587C2 (ru) * 2014-04-10 2015-12-20 Самсунг Электроникс Ко., Лтд. Способ и устройство кодирования и декодирования данных в скрученном полярном коде
US10193578B2 (en) * 2014-07-10 2019-01-29 The Royal Institution For The Advancement Of Learning / Mcgill University Flexible polar encoders and decoders
EP3381128B1 (en) * 2015-11-24 2020-01-01 Coherent Logix, Incorporated Memory management and path sorting in a polar code successive cancellation list decoder

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103023618A (zh) * 2013-01-11 2013-04-03 北京邮电大学 一种任意码长的极化编码方法
CN103281166A (zh) * 2013-05-15 2013-09-04 北京邮电大学 一种基于极化码的混合自动重传请求传输方法
WO2015139248A1 (zh) * 2014-03-19 2015-09-24 华为技术有限公司 极性码的速率匹配方法和速率匹配装置
WO2015149225A1 (zh) * 2014-03-31 2015-10-08 华为技术有限公司 极化码的混合自动重传方法及装置、无线通信装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP3595207A4 *

Also Published As

Publication number Publication date
CN108631916B (zh) 2020-03-31
US10938422B2 (en) 2021-03-02
CN108631916A (zh) 2018-10-09
US20200021315A1 (en) 2020-01-16
EP3595207A4 (en) 2020-03-18
EP3595207A1 (en) 2020-01-15

Similar Documents

Publication Publication Date Title
WO2018171682A1 (zh) 一种编码方法、译码方法、装置和设备
JP6986091B2 (ja) 符号化方法および装置、復号方法および装置、コンピュータ読み取り可能記憶媒体
WO2018127041A1 (zh) 速率匹配方法、编码装置和通信装置
WO2018137568A1 (zh) 编码方法、编码装置和通信装置
WO2019062145A1 (zh) Ploar编码方法和编码装置、译码方法和译码装置
CN107342845B (zh) 一种速率匹配的方法和装置
CN106982172B (zh) 确定极化码传输块大小的方法和通信设备
WO2018166455A1 (zh) 编码方法、编码装置和通信装置
US11239945B2 (en) Encoding method, decoding method, apparatus, and device
US10924210B2 (en) Method, apparatus, and device for determining polar code encoding and decoding
CN108282259B (zh) 一种编码方法及装置
WO2018196786A1 (zh) Polar码的速率匹配方法及装置
US11936402B2 (en) Puncturing of polar codes with complementary sequences
WO2019024594A1 (zh) 极化码的编译码方法、装置及设备
WO2018228592A1 (zh) 一种极化Polar码的交织处理方法及装置
WO2018184479A1 (zh) 一种编码方法、译码方法、装置和设备
WO2018161946A1 (zh) 数据处理的方法和装置
WO2018141271A1 (zh) 数据处理的方法和装置
WO2017206055A1 (zh) 用于打孔的方法和装置

Legal Events

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

Ref document number: 18770411

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2018770411

Country of ref document: EP

Effective date: 20191009

NENP Non-entry into the national phase

Ref country code: JP