WO2018166455A1 - 编码方法、编码装置和通信装置 - Google Patents

编码方法、编码装置和通信装置 Download PDF

Info

Publication number
WO2018166455A1
WO2018166455A1 PCT/CN2018/078901 CN2018078901W WO2018166455A1 WO 2018166455 A1 WO2018166455 A1 WO 2018166455A1 CN 2018078901 W CN2018078901 W CN 2018078901W WO 2018166455 A1 WO2018166455 A1 WO 2018166455A1
Authority
WO
WIPO (PCT)
Prior art keywords
sequence
extended
bits
length
determining
Prior art date
Application number
PCT/CN2018/078901
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 EP18768253.9A priority Critical patent/EP3570472A4/en
Publication of WO2018166455A1 publication Critical patent/WO2018166455A1/zh
Priority to US16/572,163 priority patent/US10979076B2/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
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0009—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the channel coding
    • H04L1/0013—Rate matching, e.g. puncturing or repetition of code symbols
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/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

  • Embodiments of the present invention relate to the field of communications, and more particularly, to an encoding method, an encoding apparatus, 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 among them Is a binary line vector with a length of N (ie, the length of the mother code); 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 encoded output of the Polar code can be simplified to: Is a K ⁇ N matrix.
  • the construction process of the Polar code is a collection
  • the selection process determines the performance of the Polar code.
  • the prior art provides a process for constructing a Polar code, including: determining, according to the code length N of the mother code, that there are a total of N polarization channels, respectively corresponding to N rows of the coding matrix, and calculating the reliability of the polarization channel, which is more reliable.
  • the index of the high pre-K polarized channels is the element of set A, and the index corresponding to the remaining (NK) polarized channels is used as the index set of the fixed bits.
  • Set A determines the position of the information bits, the set The location of the fixed bits is determined; among them, the common measurement of the reliability of the polarized channel has error probability, channel capacity and polarization weight.
  • the reliability of the polarization channel is determined by online calculation for different mother code lengths N, thereby determining the position of the information bits and the position of the fixed bits, and the online calculation increases the complexity of the coding end.
  • the embodiments of the present application provide an encoding method, an encoding device, and a communication device, which can improve the performance of a Polar code.
  • an encoding method comprising:
  • N bits to be coded include N2 fixed bits, and N is greater than the base code length N 0 ;
  • the expanding the first sequence to obtain the second sequence includes:
  • expanding the first sequence to obtain the second sequence includes:
  • the first sequence is extended K times as a sequence to be extended to obtain a K-time-expanded sequence, and the K-time-expanded sequence is used as a second sequence, wherein each extended sequence is used as a next extended sequence to be extended.
  • Each extended sequence consists of a sequence to be expanded and a sequence of extensions having the same length as the sequence to be extended, and each element in the extended sequence is equal to an element located at the same position in the sequence to be expanded Plus the length of the sequence to be extended.
  • determining the number of extensions K includes:
  • each element is sequentially compared with the number N2 of fixed bits until an element not smaller than N2 is determined, and the element from the first element until the determination of not less than N2 is determined.
  • the number of comparisons passed in the middle is taken as the number of extensions K.
  • determining the N to be coded bits includes:
  • the locations of the N2 fixed bits in the coded bits include:
  • the polarization channel number indicated by the first N2 elements in the second sequence is used as the position of N2 fixed bits among the N to-be-coded bits.
  • determining the N to be coded bits includes:
  • 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
  • the method further includes:
  • determining, according to the polarization channel number indicated by the first N2 elements in the second sequence, the positions of the N2 fixed bits in the N to-be-coded bits includes:
  • the first (N2-M+N) elements and the (MN) deletion positions in the fifth sequence are used as positions of N2 fixed bits in the N to-be-coded bits, wherein the fifth sequence is before the second sequence A sequence consisting of elements other than the S deletion positions is removed from the N2 elements.
  • the first sequence corresponding to the basic code length N 0 is obtained.
  • the first sequence corresponding to the base code length N 0 is obtained by looking up the table.
  • the first sequence corresponding to the basic code length N 0 is obtained.
  • the first sequence is determined according to the reliability of the N 0 polarization channels corresponding to the base code length N 0 .
  • an encoding apparatus including:
  • An acquiring module configured to obtain a first sequence corresponding to a base code length N 0 , where the first sequence includes a sequence number of N 0 polarized channels corresponding to the base code length N 0 ;
  • a first determining module configured to determine N bits to be encoded, where N bits to be encoded include N2 fixed bits, and N is greater than the base code length N 0 ;
  • An extension module configured to expand the first sequence acquired by the obtaining module to obtain a second sequence
  • a second determining module configured to determine, according to the polarization channel number indicated by the first N2 elements in the second sequence obtained by the extension module extension, a location of N2 fixed bits in the N to-be-coded bits;
  • an encoding module configured to perform Polar coding on the N to-be-coded bits determined by the first determining module to obtain coded bits.
  • the expansion module is specifically configured to:
  • the expansion module includes:
  • An extension submodule configured to perform a K-time expansion of the first sequence as a sequence to be extended to obtain a K-time extended sequence, and use the K-time-expanded sequence as a second sequence, wherein each extended sequence is used as a lower sequence.
  • An extended sequence to be extended each extended sequence consisting of a sequence to be extended and a spreading sequence, the length of the extended sequence being the same as the length of the sequence to be extended, and each element in the extended sequence is equal to the sequence to be extended The element in the same position is added to the length of the sequence to be expanded.
  • the determining submodule is specifically configured to:
  • each element is sequentially compared with the number N2 of fixed bits until an element not smaller than N2 is determined, and the element from the first element until the determination of not less than N2 is determined.
  • the number of comparisons passed in the middle is taken as the number of extensions K.
  • the first determining module is specifically configured to:
  • M the target code length of the Polar code output
  • M the positive power of 2
  • M a positive integer
  • the second determining module is specifically configured to:
  • the polarization channel number indicated by the first N2 elements in the second sequence is used as the position of N2 fixed bits among the N to-be-coded bits.
  • the first determining module is specifically configured to:
  • M is the positive integer power of the target code length M of the Polar code output is not equal to 2
  • M is a positive integer.
  • the encoding apparatus further includes:
  • a third determining unit configured to determine (M-N) deletion locations, where the (M-N) deletion locations are used to implement rate matching;
  • the second determining module is specifically configured to:
  • the first (N2-M+N) elements and the (MN) deletion positions in the fifth sequence are used as positions of N2 fixed bits in the N to-be-coded bits, wherein the fifth sequence is in the second sequence A sequence consisting of elements other than the S deletion positions is removed from the first N2 elements.
  • the acquiring module is specifically configured to:
  • the first sequence corresponding to the base code length N 0 is obtained by looking up the table.
  • the acquiring module is specifically configured to:
  • the first sequence is determined according to reliability of the N 0 polarization channels corresponding to the base code length N 0 .
  • a communication device including:
  • a processor configured to execute the program stored in the memory, when the program is executed, the processor is configured to perform any one of the foregoing first aspect or the first aspect.
  • Yet another aspect of the present application is directed to a computer readable storage medium having instructions stored therein 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 position of the fixed bit in the N to-be-coded bits is determined based on the second sequence, and the second sequence is extended by the first sequence corresponding to the base code length N 0 , which is compared with the prior art.
  • the reliability of the polarization channel needs to be calculated online to determine the position of the fixed bit, which can reduce the complexity of determining the position of the fixed bit in the Polar code structure, thereby reducing the complexity of the position of the information bits in the Polar code structure and improving the performance of the Polar code. .
  • 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 coding process of a Polar code implemented in the present application.
  • FIG. 3 is a schematic flow chart of an encoding method 300 implemented by the present application.
  • step 330 in the encoding method 300 implemented by the present application is a flow chart of an embodiment of step 330 in the encoding method 300 implemented by the present application
  • FIG. 5 is a flowchart of still another embodiment of step 330 in the encoding method 300 implemented by the present application;
  • Figure 6a is a structural diagram of an encoding apparatus 600 implemented in the present application.
  • FIG. 6b is a structural diagram of an expansion module 603 in the encoding apparatus 600 implemented by the present application.
  • Fig. 7 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.
  • the encoding process of the Polar code includes three processes of construction, coding, and rate matching.
  • the first is a construction process: receiving input N1 information bits, determining the number N of bits to be encoded according to the encoded target code length M, and the N bits to be encoded include N1 information bits and N2 fixed bits, Determining the positions of the N1 information bits and the N2 fixed bits, one bit (information bits or fixed bits) corresponding to one polarization channel; then the encoding process: Polar coding of the bits to be encoded to obtain the Polar coded bits; due to Polar
  • the code coded mother code code length is a positive integer power of 2
  • the target code length of the Polar code output may be a positive integer power of 2 or a positive integer power of 2, and the target code length of the Polar code output.
  • the encoding of the Polar code may further include a rate matching process.
  • the code length after encoding the Polar code (that is, the code length of the mother code) is a positive integer power of 2
  • the specific implementation is to delete part of the NM bits in the code length of the positive integer power of 2 to obtain the target code length, where N, M, N1, and N2 are positive. Integer.
  • the encoding method provided by the embodiment of the present invention relates to the Polar code encoding process shown in FIG. 2b, and most relates to how to determine the position of the fixed bit and the position of the information bit in the construction process.
  • An embodiment of the present invention provides an encoding method, by extending a sequence corresponding to a base code length to obtain an extended sequence, and determining a position of a fixed bit and a position of an information bit in a bit to be encoded according to the extended sequence.
  • FIG. 3 is a flowchart 300 of an encoding method according to an embodiment of the present invention. Specifically, the embodiment includes:
  • the first sequence contains N 0 elements, each element indicating the sequence number of one polarized channel.
  • the number of elements included in the sequence is the length of the sequence, and since the first sequence contains N 0 elements, the length of the first sequence is N 0 .
  • the first sequence can be expressed as Q i is used to represent the polarization channel number, 1 ⁇ i ⁇ N 0;
  • the base code length N 0 may be 8, 16, 32, 64, 128;
  • the first sequence corresponding to the base code length N 0 may be stored in a communication system in the form of a table, and the first sequence corresponding to different base code lengths N 0 is given in Table 1 below. :
  • Table 1 is merely an example, and the sequence in Table 1 may be adjusted to include, but is not limited to, the following aspects or equivalent replacements without affecting the overall effect:
  • sequence number of the N 0 polarization channels can also start from 0 to the end of N 0 -1. Therefore, subtracting 1 from each element in each first sequence in Table 1 can form a sequence from 0 to N 0 . N 0 -1 end elements.
  • 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.
  • the first sequence is determined according to the reliability of the N 0 polarized channels corresponding to the base code length N 0 . Specifically, a basic code length of length N 0, N calculated reliability polarization channels 0, N 0 determined polarization channel number N sort based on the reliability of the polarization channels 0, i.e., the first sequence.
  • the reliability of the N 0 polarized channels calculated by the polarization weight is [0 1 1.1892 2.1892 1.4142 2.4142 2.6034 3.6034]
  • the reliability of the N 0 polarized channels is determined by Sort from small to large, and the sort result [1 2 3 5 4 6 7 8] is the first sequence.
  • the common measurement of the reliability of the polarized channel has an error probability, a channel capacity, and a polarization weight.
  • the present invention does not limit the manner in which the polarization channel reliability is calculated.
  • N to-be-coded bits include N2 fixed bits, and N is greater than a base code length N 0 .
  • N bits to be encoded are determined based on whether a rate is required to be performed.
  • N N polarized channels, and one bit corresponds to one pole Channel.
  • 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
  • the position of the (MN) bits needs to be deleted in the coded bits to achieve rate matching, wherein the location of the (MN) bits is a deletion location, and specifically, the deletion location may be a puncturing location. Or shorten the position.
  • extending the first sequence to obtain the second sequence may have the following two implementations.
  • the jth element in the spreading sequence is equal to the length of the jth element in the sequence to be expanded plus the sequence to be expanded, where 1 ⁇ j ⁇ the length of the sequence to be expanded.
  • the extended sequence refers to a new sequence that is extended based on the sequence to be extended, and does not include the sequence to be extended.
  • the length of the extended sequence is the same as the length of the sequence to be extended, that is, the extended sequence and the sequence to be extended. The same number of elements are included; and, as can be seen from the above, the length of the third sequence is twice the length of the sequence to be expanded.
  • S3302 Insert a first element in the extended sequence into the sequence to be extended in the third sequence to form a fourth sequence, wherein the length of the fourth sequence is the same as the length of the third sequence.
  • the insertion position of the first element in the extended sequence inserted into the sequence to be extended may be determined by looking up a table, wherein the insertion position is related to the length of the sequence to be extended (that is, the length of the extended sequence), and Table 2 gives The insertion positions corresponding to the sequences to be expanded of different lengths are:
  • Table 2 is merely an example, and the sequence in Table 2 may be adjusted, including but not limited to the following adjustments or equivalent replacements, without affecting the overall effect: for sequences of different lengths to be extended, The corresponding insertion position is adjusted to an adjacent position adjacent to the insertion position.
  • the insertion position may specifically be a serial number of a polarized channel.
  • the insertion position “5” indicates the serial number of the fifth polarized channel.
  • the insertion of the first element in the extended sequence into the sequence to be expanded is compared with the number of fixed bits N2, when the insertion position is less than N2, go to step S3304; otherwise, go to step S3305;
  • the fourth sequence is used as the second sequence.
  • the insertion position sequence P corresponding to the base code length N 0 is first determined by looking up the table, wherein for the different base code length N 0 , the corresponding insertion position sequence P is as follows:
  • Table 3 is merely an example, and the sequence in Table 3 may be adjusted to include, but is not limited to, the following aspects or equivalent replacements without affecting the overall effect:
  • each element is sequentially compared with the number N2 of fixed bits until an element not smaller than N2 is determined, starting from the first element until The number of comparisons that have passed between the elements of not less than N2 is determined as the number of extensions K.
  • the number of comparisons from the first element until the middle of the element that is determined to be not less than N2 is also the position of the element not less than N2 in the insertion position sequence P, that is, the sequence at the insertion position.
  • the first few elements in P is also the position of the element not less than N2 in the insertion position sequence P, that is, the sequence at the insertion position.
  • the second element 6 has undergone two comparisons before, so the number of extensions K is equal to 2, or the second element 6 is located at the second position in the sequence of insertion positions P, and therefore, the number of extensions K is equal to two.
  • S3312 Perform K-time expansion on the first sequence as a sequence to be extended to obtain K-time-expanded sequences, and use the K-time-expanded sequence as a second sequence, where each extended sequence is used as the next extended sequence.
  • the sequence to be extended, each extended sequence consists of a sequence to be extended and a spreading sequence, the length of the extended sequence being the same as the length of the sequence to be extended, and each element in the extended sequence is equal to being the same in the sequence to be extended The element of the location plus the length of the sequence to be extended.
  • the jth element in the spreading sequence is equal to the length of the jth element in the sequence to be expanded plus the sequence to be expanded, where 1 ⁇ j ⁇ the length of the sequence to be expanded.
  • each extended sequence is twice the length of the sequence to be extended before expansion
  • S340 Determine, according to the polarization channel number indicated by the first N2 elements in the second sequence, positions of N2 fixed bits of the N to-be-coded bits.
  • S340 specifically includes:
  • the polarization channel number indicated by the first N2 elements in the second sequence is taken as the position of N2 fixed bits among the N to-be-coded bits.
  • S340 specifically includes:
  • the first (N2-M+N) elements and the (MN) deletion positions in the fifth sequence are used as positions of N2 fixed bits in the N to-be-coded bits, wherein the fifth sequence is before the second sequence A sequence consisting of elements other than the S deletion positions is removed from the N2 elements.
  • the number of the polarized channel indicated by the first N2 elements in the second sequence is the position of N2 fixed bits among the N bits to be encoded.
  • the remaining positions among the N to-be-coded bits are used as the positions of the information bits in the N to-be-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 position of the fixed bit in the N to-be-coded bits is determined based on the second sequence, and the second sequence is extended by the first sequence corresponding to the base code length N 0 , which is required in the prior art.
  • the encoding device 600 provided by the embodiment of the present invention is described below with reference to FIG. 6a.
  • the encoding device 600 includes an obtaining module 601, a first determining module 602, an expanding module 603, a second determining module 604, and an encoding module 605.
  • the obtaining module 601 is configured to obtain a first sequence corresponding to the base code length N 0 , where the first sequence includes a sequence number of the N 0 polarized channels corresponding to the base code length N 0 ;
  • the obtaining module 601 is specifically configured to obtain a first sequence corresponding to the base code length N 0 by using a lookup table.
  • the first sequence corresponding to the base code length N 0 may be stored in the communication system in the form of a table.
  • Table 1 in the above embodiment provides a first sequence corresponding to different base code lengths N 0 , and details are not described herein again. .
  • the obtaining module 601 is specifically configured to determine the first sequence according to the reliability of the N 0 polarization channels corresponding to the base code length N 0 . Specifically, a basic code length of length N 0, N calculated reliability polarization channels 0, N 0 determined polarization channel number N sort based on the reliability of the polarization channels 0, i.e., the first sequence.
  • a first determining module 602 configured to determine N bits to be encoded, where N bits to be encoded include N2 fixed bits, and N is greater than the base code length N 0 ;
  • the expansion module 603 is configured to expand the first sequence acquired by the obtaining module 601 to obtain a second sequence.
  • the second determining module 604 is configured to determine, according to the polarization channel number indicated by the first N2 elements in the second sequence obtained by the extension module 603, the location of the N2 fixed bits in the N to-be-coded bits determined by the first determining module 602. ;
  • the encoding module 605 is configured to perform Polar encoding on the N to-be-coded bits determined by the first determining module 602 to obtain coded bits. Specifically, the encoding module 605 can complete the encoding process of the bit to be encoded by using the encoding matrix F N of the Polar code, thereby obtaining the encoded code of the Polar encoding.
  • the expansion module 603 is specifically configured to:
  • the expansion module 603 includes a determination sub-module 6031 and an extension sub-module 6032, as shown in FIG. 6b.
  • the extension sub-module 6032 is configured to perform K-time expansion on the first sequence as a sequence to be extended to obtain a K-time-expanded sequence, and use the K-time-expanded sequence as a second sequence, where each extended sequence is used as The next extended sequence to be extended, each extended sequence consists of a sequence to be extended and an extended sequence, the length of the extended sequence being the same as the length of the sequence to be extended, and each element in the extended sequence is equal to the to-be-expanded An element at the same position in the sequence plus the length of the sequence to be expanded.
  • determining submodule 6031 is specifically configured to:
  • each element is sequentially compared with the number N2 of fixed bits until an element not smaller than N2 is determined, and the element from the first element until the determination of not less than N2 is determined.
  • the number of comparisons passed in the middle is taken as the number of extensions K.
  • the second determining module 604 is specifically configured to: use a polarization channel number indicated by the first N2 elements in the second sequence as a position of N2 fixed bits of the N to-be-coded bits.
  • the first determining module 602 is specifically configured to: determine N according to M, where symbol Indicates rounding down, M is the target code length of the Polar code output, M is not equal to the positive power of 2, and M is a positive integer.
  • the encoding apparatus 600 further includes a third determining module 606, configured to determine (M-N) deletion locations, where the (M-N) deletion locations are used to implement rate matching;
  • the second determining module 604 is specifically configured to:
  • the first (N2-M+N) elements and the (MN) deletion positions in the fifth sequence are used as positions of N2 fixed bits in the N to-be-coded bits, wherein the fifth sequence is before the second sequence A sequence consisting of elements other than the S deletion positions is removed from the N2 elements.
  • the number of the polarized channel indicated by the first N2 elements in the second sequence is the position of N2 fixed bits among the N bits to be encoded.
  • the position of the fixed bit in the N to-be-coded bits is determined based on the second sequence, and the second sequence is extended by the first sequence corresponding to the base code length N 0 , which is required in the prior art.
  • FIG. 7 is a schematic structural diagram of a communication device 700 according to an embodiment of the present invention (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 700 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 700 can be implemented by bus 701 as a general bus architecture. Depending on the particular application of communications device 700 and overall design constraints, bus 701 can include any number of interconnecting buses and bridges. Bus 701 connects various circuits together, including processor 702, storage medium 703, and bus interface 704. Alternatively, the communication device 700 connects the network adapter 705 or the like via the bus 701 using the bus interface 704. The network adapter 705 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 707. The user interface 706 can be connected to a user terminal such as a keyboard, display, mouse or joystick. The bus 701 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 700 can also be configured as a general purpose processing system, such as generally referred to as a chip, the general purpose processing system including: one or more microprocessors providing processor functionality; and an external memory providing at least a portion of the storage medium 703 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 including: one or more microprocessors providing processor functionality; and an external memory providing at least a portion of the storage medium 703 All of this is connected to other support circuits through an external bus architecture.
  • the communication device 700 can be implemented using an ASIC (Application Specific Integrated Circuit) having a processor 702, a bus interface 704, a user interface 706, and at least a portion of a storage medium 703 integrated in a single chip, or Communication device 700 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 present invention.
  • ASIC Application Specific Integrated Circuit
  • the processor 702 is responsible for managing the bus and general processing (including executing software stored on the storage medium 703).
  • Processor 702 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 703 is shown as being separate from processor 702, however, it will be readily apparent to those skilled in the art that storage medium 703, or any portion thereof, can be located external to communication device 700.
  • storage medium 703 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 702 via bus interface 704.
  • storage medium 703, or any portion thereof, may be integrated into processor 702, for example, may be a cache and/or a general purpose register.
  • the processor 702 can perform the embodiments in the foregoing embodiments, for example, FIG. 3, FIG. 4, and FIG. 5, and the execution process of the processor 702 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 fixed 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 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 unit is only a logical function division, and the actual implementation may have another division manner.
  • multiple units or components 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 units to each other 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 above embodiments it may be implemented in whole or in part by software, hardware, firmware, or any combination thereof.
  • 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)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Theoretical Computer Science (AREA)
  • Quality & Reliability (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)
  • Error Detection And Correction (AREA)

Abstract

本申请实施例提供一种编码方法、编码装置和通信装置。具体地，该编码方法包括：获取基础码长N 0所对应的第一序列；确定N个待编码比特，N个待编码比特中包括N2个固定比特，并且N大于该基础码长N 0；将第一序列进行扩展以得到第二序列；基于第二序列中前N2个元素所指示的极化信道序号确定该N个待编码比特中N2个固定比特的位置；对该N个待编码比特进行Polar编码以得到编码比特。由于N个待编码比特中固定比特的位置是基于第二序列确定，而第二序列是由该基础码长N 0所对应的第一序列扩展而来，可以降低Polar码构造中确定固定比特的位置的复杂度，进而降低Polar码构造中信息比特的位置的复杂度，可以提高Polar码的性能。

Description

编码方法、编码装置和通信装置
本申请要求于2017年03月17日提交中国专利局、申请号为201710162011.3、申请名称为“编码方法、编码装置和通信装置”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本发明实施例涉及通信领域，并且更具体地，涉及编码方法、编码装置和通信装置。
背景技术
通信系统通常采用信道编码提高数据传输的可靠性，以保证通信的质量。土耳其教授Arikan提出的极化码(Polar codes)是第一个理论上证明可以达到香农容量且具有低编译码复杂度的好码。Polar码是一种线性块码，其编码矩阵为G N，例如，编码过程为
Figure PCTCN2018078901-appb-000001
其中
Figure PCTCN2018078901-appb-000002
是一个二进制的行矢量，长度为N(即母码长度)；G N是一个N×N的矩阵，且
Figure PCTCN2018078901-appb-000003
Figure PCTCN2018078901-appb-000004
定义为log 2N个矩阵F 2的克罗内克(Kronecker)乘积。
上述矩阵
Figure PCTCN2018078901-appb-000005
Polar码的编码过程中，
Figure PCTCN2018078901-appb-000006
中的一部分比特用来携带信息，称为信息比特，这些比特的索引的集合记作
Figure PCTCN2018078901-appb-000007
另外的一部分比特设置为收发端预先约定的固定值，称之为固定比特或冻结比特(frozen bits)，其索引的集合用
Figure PCTCN2018078901-appb-000008
的补集
Figure PCTCN2018078901-appb-000009
表示。Polar码的编码过程相当于：
Figure PCTCN2018078901-appb-000010
这里，G N.(A)是G N.中由集合A中的索引对应的那些行得到的子矩阵，G N(A C)是G N中由集合A C中的索引对应的那些行得到的子矩阵。
Figure PCTCN2018078901-appb-000011
为
Figure PCTCN2018078901-appb-000012
中的信息比特集合，信息比特个数为K；
Figure PCTCN2018078901-appb-000013
为
Figure PCTCN2018078901-appb-000014
中的固定比特集合，固定比特个数为(N-K)，是已知比特。这些固定比特通常被设置为0，但是只要收发端预先约定，固定比特可以被任意设置。固定比特设置为0时，Polar码的编码输出可简化为：
Figure PCTCN2018078901-appb-000015
是一个K×N的矩阵。
Polar码的构造过程即集合
Figure PCTCN2018078901-appb-000016
的选取过程，决定了Polar码的性能。现有技术提供了一种Polar码的构造过程，包括：根据母码码长N确定共存在N个极化信道，分别对应编码矩阵的N个行，计算极化信道可靠度，将可靠度较高的前K个极化信道的索引作为集合A的元素，剩余(N-K)个极化信道对应的索引作为固定比特的索引集合
Figure PCTCN2018078901-appb-000017
的元素。集合A决定了信息比特的位置，集合
Figure PCTCN2018078901-appb-000018
决定了固定比特的位置；其中，常见的极化信道可靠度的度量有错误概率、信道容量和极化权重等。
在上述Polar码的构造过程中，针对不同的母码码长N，通过在线计算确定极化信道可靠度，进而确定信息比特的位置和固定比特的位置，在线计算会增加编码端的复杂度。
发明内容
本申请实施例提供编码方法、编码装置及通信装置，可以提高Polar码的性能。
第一方面，提供一种编码方法，包括：
获取基础码长N 0所对应的第一序列，其中，第一序列包含该基础码长N 0所对应的N 0个极化信道的序号；
确定N个待编码比特，其中，N个待编码比特中包括N2个固定比特，并且N大于该基础码长N 0；
将第一序列进行扩展以得到第二序列；
基于第二序列中前N2个元素所指示的极化信道序号确定该N个待编码比特中N2个固定比特的位置；
对该N个待编码比特进行Polar编码以得到编码比特。
结合第一方面，在第一方面的第一种可能的实现方式中，将第一序列进行扩展以得到第二序列包括：
a)将第一序列作为待扩展序列进行扩展以得到第三序列，第三序列由该待扩展序列和扩展序列组成，该扩展序列的长度和该待扩展序列的长度相同，且该扩展序列中每个元素等于在该待扩展序列中位于相同位置的元素加上该待扩展序列的长度；
b)在第三序列中将该扩展序列中第一个元素插入到该待扩展序列中以形成第四序列，其中第四序列的长度和第三序列的长度相同；
c)将该扩展序列中第一个元素插入到该待扩展序列中的插入位置和固定比特的数目N2进行比较，在该插入位置小于所述N2时，转到d)，否则，转到e)；
d)将第四序列作为该待扩展序列，继续执行上述a)、b)和c)；
e)将第四序列作为第二序列。
结合第一方面，在第一方面的第二种可能的实现方式中，将第一序列进行扩展以得到第二序列包括：
确定扩展次数K；
将第一序列作为待扩展序列进行K次扩展以得到K次扩展后的序列，将该K次扩展后的序列作为第二序列，其中，每次扩展后的序列作为下一次扩展的待扩展序列，每次扩展后的序列由待扩展序列和扩展序列组成，该扩展序列的长度和该待扩展序列的长度相同，且该扩展序列中每个元素等于在该待扩展序列中位于相同位置的元素加上该待扩展序列的长度。
结合第一方面的第二种可能的实现方式，在第一方面的第三种可能的实现方式中，确定扩展次数K包括：
通过查表确定该基础码长N 0所对应的插入位置序列P；
从该插入位置序列P中第一个元素起，依次将每个元素和固定比特的数目N2进行比较直到确定出不小于N2的元素，将从第一个元素开始直到确定出不小于N2的元素中间所经过的比较次数作为该扩展次数K。
结合第一方面或第一方面的第一至第三中任一种可能的实现方式，在第一方面的第四种可能的实现方式中，确定N个待编码比特包括：
根据M确定N,其中，N＝M，M为Polar码输出的目标码长，M等于2的正整数次 幂，M为正整数。
结合第一方面的第四种可能的实现方式，在第一方面的第五种可能的实现方式中，基于所述第二序列中前N2个元素所指示的极化信道序号确定该N个待编码比特中N2个固定比特的位置包括：
将第二序列中前N2个元素所指示的极化信道序号作为该N个待编码比特中N2个固定比特的位置。
结合第一方面或第一方面的第一至第三中任一种可能的实现方式，在第一方面的第六种可能的实现方式中，确定N个待编码比特包括：
根据M确定N,其中，
Figure PCTCN2018078901-appb-000019
符号
Figure PCTCN2018078901-appb-000020
表示向下取整，M为Polar码输出的目标码长，M不等于2的正整数次幂，M为正整数。
结合第一方面的第六种可能的实现方式，在第一方面的第七种可能的实现方式中，在确定N个待编码比特之后，该方法还包括：
确定(M-N)个删除位置，该(M-N)个删除位置用于实现速率匹配；
相应地，基于第二序列中前N2个元素所指示的极化信道序号确定该N个待编码比特中N2个固定比特的位置包括：
确定在第二序列的前N2个元素中存在S个删除位置，其中，0≤S≤(M-N)；
将第五序列中前(N2-M+N)个元素和该(M-N)个删除位置作为该N个待编码比特中N2个固定比特的位置，其中，第五序列为在第二序列的前N2个元素中除去该S个删除位置之外的元素所组成的序列。
结合第一方面或第一方面的第一至第七中任一种可能的实现方式，在第一方面的第八种可能的实现方式中，获取该基础码长N 0所对应的第一序列包括：
通过查表获取该基础码长N 0所对应的第一序列。
结合第一方面或第一方面的第一至第七中任一种可能的实现方式，在第一方面的第九种可能的实现方式中，获取该基础码长N 0所对应的第一序列包括：
根据该基础码长N 0所对应的N 0个极化信道的可靠度确定第一序列。
第二方面，提供一种编码装置，包括：
获取模块，用于获取基础码长N 0所对应的第一序列，其中，第一序列包含该基础码长N 0所对应的N 0个极化信道的序号；
第一确定模块，用于确定N个待编码比特，其中，N个待编码比特中包括N2个固定比特，并且N大于该基础码长N 0；
扩展模块，用于将该获取模块获取的第一序列进行扩展以得到第二序列；
第二确定模块，用于基于该扩展模块扩展得到的第二序列中前N2个元素所指示的极化信道序号确定该N个待编码比特中N2个固定比特的位置；
编码模块，用于对第一确定模块确定的该N个待编码比特进行Polar编码以得到编码比特。
结合第二方面，在第二方面的第一种可能的实现方式中，该扩展模块具体用于：
a)将第一序列作为待扩展序列进行扩展以得到第三序列，第三序列由该待扩展序列和扩展序列组成，该扩展序列的长度和该待扩展序列的长度相同，且该扩展序列中每个元素等于在该待扩展序列中位于相同位置的元素加上该待扩展序列的长度；
b)在第三序列中将该扩展序列中第一个元素插入到该待扩展序列中以形成第四序列，其中第四序列的长度和第三序列的长度相同；
c)将该扩展序列中第一个元素插入到该待扩展序列中的插入位置和固定比特的数目N2进行比较，在该插入位置小于所述N2时，转到d)，否则，转到e)；
d)将第四序列作为该待扩展序列，继续执行上述a)、b)和c)；
e)将第四序列作为第二序列。
结合第二方面，在第二方面的第二种可能的实现方式中，该扩展模块包括：
确定子模块，用于确定扩展次数K；
扩展子模块，用于将第一序列作为待扩展序列进行K次扩展以得到K次扩展后的序列，将该K次扩展后的序列作为第二序列，其中，每次扩展后的序列作为下一次扩展的待扩展序列，每次扩展后的序列由待扩展序列和扩展序列组成，该扩展序列的长度和该待扩展序列的长度相同，且该扩展序列中每个元素等于在该待扩展序列中位于相同位置的元素加上该待扩展序列的长度。
结合第二方面的第二种可能的实现方式，在第二方面的第三种可能的实现方式中，该确定子模块具体用于：
通过查表确定该基础码长N 0所对应的插入位置序列P；
从该插入位置序列P中第一个元素起，依次将每个元素和固定比特的数目N2进行比较直到确定出不小于N2的元素，将从第一个元素开始直到确定出不小于N2的元素中间所经过的比较次数作为该扩展次数K。
结合第二方面或第二方面的第一至第三中任一种可能的实现方式，在第二方面的第四种可能的实现方式中，第一确定模块具体用于：
根据M确定N,其中，N＝M，M为Polar码输出的目标码长，M等于2的正整数次幂，M为正整数。
结合第二方面的第四种可能的实现方式，在第二方面的第五种可能的实现方式中，第二确定模块具体用于：
将第二序列中前N2个元素所指示的极化信道序号作为该N个待编码比特中N2个固定比特的位置。
结合第二方面或第二方面的第一至第三中任一种可能的实现方式，在第二方面的第六种可能的实现方式中，第一确定模块具体用于：
根据M确定N,其中，
Figure PCTCN2018078901-appb-000021
符号
Figure PCTCN2018078901-appb-000022
表示向下取整，M为Polar码输出的目标码长M不等于2的正整数次幂，M为正整数。
结合第二方面的第六种可能的实现方式，在第二方面的第七种可能的实现方式中，该编码装置还包括：
第三确定单元，用于确定(M-N)个删除位置，该(M-N)个删除位置用于实现速率匹配；
相应地，第二确定模块具体用于：
确定在第二序列的前N2个元素中存在S个删除位置，其中，0≤S≤(M-N)；
将第五序列中前(N2-M+N)个元素和所述(M-N)个删除位置作为该N个待编码比特中N2个固定比特的位置，其中，第五序列为在第二序列的前N2个元素中除去该S个 删除位置之外的元素所组成的序列。
结合第二方面或第二方面的第一至第七中任一种可能的实现方式，在第二方面的第八种可能的实现方式中，该获取模块具体用于：
通过查表获取该基础码长N 0所对应的第一序列。
结合第二方面或第二方面的第一至第七中任一种可能的实现方式，在第二方面的第九种可能的实现方式中，该获取模块具体用于：
根据该基础码长N 0所对应的N 0个极化信道的可靠度确定所述第一序列。
第三方面，提供一种通信装置，包括：
存储器，用于存储程序；
处理器，用于执行所述存储器存储的所述程序，当所述程序被执行时，所述处理器用于执行上述第一方面或第一方面的任意一种可能的实现方式。
本申请的又一方面提了供一种计算机可读存储介质，所述计算机可读存储介质中存储有指令，当其在计算机上运行时，使得计算机执行上述各方面所述的方法。
本申请的又一方面提供了一种包含指令的计算机程序产品，当其在计算机上运行时，使得计算机执行上述各方面所述的方法。
本申请的又一方面提供了一种计算机程序，当其在计算机上运行时，使得计算机执行上述各方面所述的方法。
本申请实施例中，N个待编码比特中固定比特的位置是基于第二序列确定，而第二序列是由基础码长N 0所对应的第一序列扩展而来，相对于现有技术中需要在线计算极化信道的可靠度来确定固定比特的位置，可以降低Polar码构造中确定固定比特的位置的复杂度，进而降低Polar码构造中信息比特的位置的复杂度，提高Polar码的性能。
附图说明
图1是本申请提供的无线通信系统的结构；
图2a是无线通信发送端和接收端的基本流程示意图；
图2b是本申请实施的Polar码的编码过程示意图；
图3是本申请实施的一种编码方法300流程示意图；
图4是本申请实施的编码方法300中步骤330的一种实施方式流程图；
图5是本申请实施的编码方法300中步骤330的又一种实施方式流程图；
图6a是本申请实施的编码装置600结构图；
图6b是本申请实施的编码装置600中扩展模块603的结构图；
图7是本申请实施的通信装置结构图。
具体实施方式
本发明实施例可应用于各种通信系统，因此，下面的描述不限制于特定通信系统。全球移动通讯(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码的编码过程包括构造、编码和速率匹配三个处理过程。
首先是构造过程：接收输入的N1个信息比特，根据编码后的目标码长M确定待编码的比特的个数N，N个待编码的比特包括N1个信息比特和N2个固定比特，还要确定N1个信息比特和N2个固定比特的位置，一个比特(信息比特或固定比特)对应一个极化信道；然后是编码过程：对待编码的比特进行Polar编码，获得Polar编码后的比特；由于Polar码编码后的母码码长为2的正整数次幂，而Polar码输出的目标码长可以为2的正整数次幂或不为2的正整数次幂，在Polar码输出的目标码长为2的正整数次幂时，无需进行速率匹配；在Polar码输出的目标码长不为2的正整数次幂时，则需要进行速率匹配，因此，Polar码的编码还可以包括速率匹配过程：由于Polar码编码后的码长(即母码码长)为2的正整数次幂，而实际应用中一般需要通过速率匹配实现任意码长的Polar码，通常可以采用打孔(puncture)或缩短(shorten)的方案实现速率匹配，具体实现是删掉2的正整数次幂的码长中的部分N-M个比特，得到目标码长，其中N、M、N1、N2均为正整数。
本发明实施例提供的编码方法涉及图2b所示的Polar码编码过程，最主要涉及构造过程中如何确定固定比特的位置和信息比特的位置。本发明实施例提供一种编码方法，通过对基础码长所对应的序列进行扩展以得到扩展后的序列，并根据扩展后的序列确定待编码比特中固定比特的位置和信息比特的位置。
图3是本发明一个实施例提供的编码方法的流程图300，具体地，该实施例包括：
S310、获取基础码长N 0所对应的第一序列，其中，第一序列包含基础码长N 0所对应的N 0个极化信道的序号。
由上可知，第一序列中包含N 0个元素，每个元素指示一个极化信道的序号。
在本发明中，序列中所包含的元素的个数即为该序列的长度，由于第一序列中包含N 0个元素，第一序列的长度为N 0。
例如，第一序列可表示为
Figure PCTCN2018078901-appb-000023
Q i用于表示极化信道的序号，1≤i≤N 0；
示例地，基础码长N 0可以为8,16,32,64,128；
在本发明的一个实施例中，基础码长N 0所对应的第一序列可以以表的形式存储在通信系统中，如下表一给出了不同的基础码长N 0所对应的第一序列：
表一
Figure PCTCN2018078901-appb-000024
Figure PCTCN2018078901-appb-000025
需要说明的是，上述表一仅仅为举例，在不影响其整体效果的前提下，对于表一中的序列可以做包括但不限于如下几方面的调整或者等同替换：
1、第一序列中少数元素之间的位置互换。
2、第一序列中包含从1开始到N 0结束的N 0个元素，从1开始到N 0结束的N 0个元素代表N 0个极化信道的序号。实际上，N 0个极化信道的序号也可以从0开始到N 0-1结束，因此，将上述表一中各个第一序列中各个元素减去1即可形成包含从0开始到N 0-1结束的N 0个元素。当然，也可以采取其他方式表示上述极化信道的序号或者标识，该具体表达方式不影响表格中所表示的极化信道的具体位置。
在本发明的另一个实施例中，根据基础码长N 0所对应的N 0个极化信道的可靠度确定第一序列。具体地，针对长度为N 0的基础码长，计算N 0个极化信道的可靠度，根据N 0个极化信道的可靠度确定N 0个极化信道序号的排序，即第一序列。
例如，取N 0＝8，采用极化权重的方式计算得到N 0个极化信道的可靠度依次为[0 1 1.1892 2.1892 1.4142 2.4142 2.6034 3.6034]，对该N 0个极化信道的可靠度由小到大进行排序，排序结果[1 2 3 5 4 6 7 8]即为第一序列。
需要说明的是，常见的极化信道可靠度的度量有错误概率、信道容量和极化权重等，本发明并不限制采用何种方式计算极化信道可靠度。
S320、确定N个待编码比特，其中，N个待编码比特中包括N2个固定比特，并且N大于基础码长N 0。
具体地，基于是否需要进行速率来确定N个待编码比特。
场景一：无需进行速率匹配
根据M确定N，其中，N＝M，M作为Polar码输出的目标码长等于2的正整数次幂，M为正整数；N个待编码比特对应N个极化信道，一个比特对应一个极化信道。
场景二：需要进行速率匹配
根据M确定N,其中，
Figure PCTCN2018078901-appb-000026
符号
Figure PCTCN2018078901-appb-000027
表示向下取整，M为Polar码输出的目标码长，M不等于2的正整数次幂，M为正整数。
此种情况下，编码后的编码比特中需要删除(M-N)个比特的位置以实现速率匹配，其中，所述(M-N)个比特的位置为删除位置，具体地，删除位置可以为打孔位置或缩短位置。
S330、将第一序列进行扩展以得到第二序列；
具体地，将第一序列进行扩展以得到第二序列可以有如下两种实现方式。
实现方式一：
S3301、将第一序列作为待扩展序列进行扩展以得到第三序列，第三序列由该待扩展序列和扩展序列组成，该扩展序列的长度和该待扩展序列的长度相同，且该扩展序列中每个元素等于在该待扩展序列中位于相同位置的元素加上该待扩展序列的长度。
例如，该扩展序列中第j个元素等于该待扩展序列中第j个元素加上待扩展序列的长度，其中，1≤j≤待扩展序列的长度。
其中，该扩展序列是指基于该待扩展序列所扩展出的新序列，并不包含该待扩展序列，该扩展序列的长度和该待扩展序列的长度相同，即该扩展序列和该待扩展序列包含同样数目的元素；并且，由上可知，第三序列的长度为该待扩展序列的长度的两倍。
S3302、在第三序列中将扩展序列中第一个元素插入到待扩展序列中以形成第四序列，其中，第四序列的长度和第三序列的长度相同。
具体地，可以通过查表确定扩展序列中第一个元素插入到待扩展序列中的插入位置，其中，该插入位置和该待扩展序列的长度(亦即扩展序列的长度)相关，表二给出了不同长度的待扩展序列所对应的插入位置：
表二
待扩展序列的长度 8 16 32 64 128 256 512 1024
插入位置 5 6 8 12 17 26 41 66
需要说明的是，上述表二仅仅为举例，在不影响其整体效果的前提下，对于表二中的序列可以做包括但不限于如下的调整或者等同替换：针对不同长度的待扩展序列，其对应的插入位置调整到与该插入位置相邻的邻近位置。
其中，插入位置具体可以是一个极化信道的序号，例如，插入位置“5”指示第五个极化信道的序号。
S3303、将扩展序列中第一个元素插入到待扩展序列中的插入位置和固定比特的数目N2进行比较，在插入位置小于N2时，转到步骤S3304；否则，转到步骤S3305；
S3304、将第四序列作为待扩展序列，继续执行上述S3301、S3302和S3303步骤；
S3305、将第四序列作为第二序列。
实现方式二：
S3311、确定扩展次数K；
具体地，首先通过查表确定基础码长N 0所对应的插入位置序列P，其中，针对不同的基础码长N 0，其所对应的插入位置序列P如下：
表三
N 0 插入位置序列P
8 5,6,8,12,17,26,41,66
16 6,8,12,17,26,41,66
32 8,12,17,26,41,66
64 12,17,26,41,66
需要说明的是，上述表三仅仅为举例，在不影响其整体效果的前提下，对于表三中的序列可以做包括但不限于如下几方面的调整或者等同替换：
1、对插入位置序列P中位于后面元素进行少量删减以减小位置序列P的长度；
2、在插入位置序列P中最后元素的后面增加少量元素以增加位置序列P的长度。
在确定插入位置序列P之后，从插入位置序列P中第一个元素起，依次将每个元素和固定比特的数目N2进行比较直到确定出不小于N2的元素，将从第一个元素开始直到确定出不小于N2的元素中间所经过的比较次数作为扩展次数K。
实际上，从第一个元素开始直到确定出不小于N2的元素中间所经过的比较次数也为所述不小于N2的元素在该插入位置序列P中所处的位置，即位于该插入位置序列P中第几个元素。
例如，基础码长N 0＝8，固定比特的数据N2＝6，通过查上述表可知基础码长N 0所对应的插入位置序列为P＝[5,6,8,12,17,26,41,66]，从该插入位置序列P中第一个元素5开始，依次将将每个元素和固定比特的数目6进行比较，确定第二个元素6不小于固定比特的数目6，由于确定出第二个元素6之前经历过两次比较，因此，扩展次数K等于2，或者说，第二个元素6位于插入位置序列P中第二个位置，因此，扩展次数K等于2。
S3312、将第一序列作为待扩展序列进行K次扩展以得到K次扩展后的序列，将所述K次扩展后的序列作为第二序列，其中，每次扩展后的序列作为下一次扩展的待扩展序列，每次扩展后的序列由待扩展序列和扩展序列组成，该扩展序列的长度和该待扩展序列的长度相同，且该扩展序列中每个元素等于在该待扩展序列中位于相同位置的元素加上该待扩展序列的长度。
例如，该扩展序列中第j个元素等于该待扩展序列中第j个元素加上待扩展序列的长度，其中，1≤j≤待扩展序列的长度。
由上可知，每次扩展后的序列的长度为扩展前的待扩展序列的长度的两倍；
S340、基于第二序列中前N2个元素所指示的极化信道序号确定N个待编码比特中N2个固定比特的位置。
针对S320中两种不同的场景，S340存在不同的实现方式。
针对S320中场景一，即无需进行速率匹配场景，S340具体包括：
将第二序列中前N2个元素所指示的极化信道序号作为N个待编码比特中N2个固定比特的位置。
针对S320中场景二，即需要进行速率匹配场景，此时存在(M-N)个删除位置，S340具体包括：
确定在第二序列的前N2个元素中存在S个删除位置，其中，0≤S≤(M-N)；
将第五序列中前(N2-M+N)个元素和该(M-N)个删除位置作为该N个待编码比特中N2个固定比特的位置，其中，第五序列为在第二序列的前N2个元素中除去该S个删除位置之外的元素所组成的序列。
由上可知，在S＝0时，即第五序列等于第二序列，第二序列的前N2个元素中不存在删除位置，将第二序列中前(N2-M+N)个元素所指示的极化信道序号和该(M-N)个删除位置作为N个待编码比特中N2个固定比特的位置；在S＝M-N时，即该(M-N)个删除位置均属于第二序列中前N2个元素，则第二序列中前N2个元素所指示的极化信道序号作为N个待编码比特中N2个固定比特的位置。
由于N个待编码比特中N2个固定比特的位置已确定，则N个待编码比特中剩余的位置作为N个待编码比特中信息比特的位置。
S350、对N个待编码比特进行Polar编码以得到编码比特。
具体地，可以使用Polar码的编码矩阵F N完成待编码比特的编码过程，进而得到Polar编码后的编码比特。
本实施例中，N个待编码比特中固定比特的位置是基于第二序列确定，而第二序列是由基础码长N 0所对应的第一序列扩展而来，相对于现有技术中需要在线计算极化信道的可靠度来确定固定比特的位置，可以降低Polar码构造中确定固定比特的位置的复杂度，进而降低Polar码构造中信息比特的位置的复杂度，提高Polar码的性能。
如下将结合图6a来描述本发明实施例提供的编码装置600，编码装置600包括获取模块601、第一确定模块602、扩展模块603、第二确定模块604和编码模块605。
获取模块601，用于获取基础码长N 0所对应的第一序列，其中，第一序列包含该基础码长N 0所对应的N 0个极化信道的序号；
在本发明的一个实施例中，获取模块601具体用于通过查表获取该基础码长N 0所对应的第一序列。基础码长N 0所对应的第一序列可以以表的形式存储在通信系统中，上述实施例中表一给出了不同的基础码长N 0所对应的第一序列，在此不再赘述。
在本发明的另一个实施例中，获取模块601具体用于根据该基础码长N 0所对应的N 0个极化信道的可靠度确定第一序列。具体地，针对长度为N 0的基础码长，计算N 0个极化信道的可靠度，根据N 0个极化信道的可靠度确定N 0个极化信道序号的排序，即第一序列。
第一确定模块602，用于确定N个待编码比特，其中，N个待编码比特中包括N2个固定比特，并且N大于该基础码长N 0；
扩展模块603，用于将获取模块601获取的第一序列进行扩展以得到第二序列；
第二确定模块604，用于基于扩展模块603扩展得到的第二序列中前N2个元素所指示的极化信道序号确定第一确定模块602确定的N个待编码比特中N2个固定比特的位置；
编码模块605，用于对第一确定模块602确定的N个待编码比特进行Polar编码以得到编码比特。具体地，编码模块605可以使用Polar码的编码矩阵F N完成待编码比特的编码过程，进而得到Polar编码后的编码比特。
在本发明的一个实施例中，扩展模块603具体用于：
a)将第一序列作为待扩展序列进行扩展以得到第三序列，第三序列由该待扩展序列和扩展序列组成，该扩展序列的长度和该待扩展序列的长度相同，且该扩展序列中每个元素等于在该待扩展序列中位于相同位置的元素加上该待扩展序列的长度；
b)在第三序列中将该扩展序列中第一个元素插入到该待扩展序列中以形成第四序列，其中，第四序列的长度和第三序列的长度相同；
c)将该扩展序列中第一个元素插入到该待扩展序列中的插入位置和固定比特的数目N2进行比较，在该插入位置小于该N2时，转到d)，否则，转到e)；
d)将第四序列作为该待扩展序列，继续执行上述a)、b)和c)；
e)将第四序列作为第二序列。
上述a)、b)、c)、d)和e)步骤可进一步参考图3对应实施例中S3301-S3305的描述，此处不再赘述。
在本发明的一个实施例中，扩展模块603包括确定子模块6031和扩展子模块6032，具体如图6b所示。
确定子模块6031，用于确定扩展次数K；
扩展子模块6032，用于将第一序列作为待扩展序列进行K次扩展以得到K次扩展后的序列，将该K次扩展后的序列作为第二序列，其中，每次扩展后的序列作为下一次扩展的待扩展序列，每次扩展后的序列由待扩展序列和扩展序列组成，该扩展序列的长度和该待扩展序列的长度相同，且该扩展序列中每个元素等于在该待扩展序列中位于相同位置的元素加上该待扩展序列的长度。
进一步，确定子模块6031具体用于：
通过查表确定该基础码长N 0所对应的插入位置序列P；
从该插入位置序列P中第一个元素起，依次将每个元素和固定比特的数目N2进行比较直到确定出不小于N2的元素，将从第一个元素开始直到确定出不小于N2的元素中间所经过的比较次数作为该扩展次数K。
上述确定子模块6031和扩展子模块6032的功能可进一步参考图3对应实施例中S3311和S3312的描述，此处不再赘述。
在本发明的一个实施例中，针对无需进行速率匹配场景，第一确定模块602具体用于：根据M确定N,其中，N＝M，M为Polar码输出的目标码长，M等于2的正整数次幂，M为正整数。
相应地，第二确定模块604具体用于：将第二序列中前N2个元素所指示的极化信道 序号作为该N个待编码比特中N2个固定比特的位置。
在本发明的另一个实施例中，针对需要进行速率匹配场景，第一确定模块602具体用于：根据M确定N,其中，
Figure PCTCN2018078901-appb-000028
符号
Figure PCTCN2018078901-appb-000029
表示向下取整，M为Polar码输出的目标码长，M不等于2的正整数次幂，M为正整数。
此时，如图6a所示，编码装置600还包括第三确定模块606，用于确定(M-N)个删除位置，该(M-N)个删除位置用于实现速率匹配；
相应地，第二确定模块604具体用于：
确定在第二序列的前N2个元素中存在S个删除位置，其中，0≤S≤(M-N)；
将第五序列中前(N2-M+N)个元素和该(M-N)个删除位置作为该N个待编码比特中N2个固定比特的位置，其中，第五序列为在第二序列的前N2个元素中除去该S个删除位置之外的元素所组成的序列。
由上可知，在S＝0时，即第五序列等于第二序列，第二序列的前N2个元素中不存在删除位置，将第二序列中前(N2-M+N)个元素所指示的极化信道序号和该(M-N)个删除位置作为N个待编码比特中N2个固定比特的位置；在S＝M-N时，即该(M-N)个删除位置均属于第二序列中前N2个元素，则第二序列中前N2个元素所指示的极化信道序号作为N个待编码比特中N2个固定比特的位置。
本实施例中，N个待编码比特中固定比特的位置是基于第二序列确定，而第二序列是由基础码长N 0所对应的第一序列扩展而来，相对于现有技术中需要在线计算极化信道的可靠度来确定固定比特的位置，可以降低Polar码构造中确定固定比特的位置的复杂度，进而降低Polar码构造中信息比特的位置的复杂度，提高Polar码的性能。
图7为本发明实施例所提供的通信装置700的结构示意图(例如接入点或基站、站点或者终端等通信装置，或者前述通信装置中的芯片等)。
通信装置700可以由总线701作一般性的总线体系结构来实现。根据通信装置700的具体应用和整体设计约束条件，总线701可以包括任意数量的互连总线和桥接。总线701将各种电路连接在一起，这些电路包括处理器702、存储介质703和总线接口704。可选的，通信装置700使用总线接口704将网络适配器705等经由总线701连接。网络适配器705可用于实现无线通信网络中物理层的信号处理功能，并通过天线707实现射频信号的发送和接收。用户接口706可以连接用户终端，例如：键盘、显示器、鼠标或者操纵杆等。总线701还可以连接各种其它电路，如定时源、外围设备、电压调节器或者功率管理电路等，这些电路是本领域所熟知的，因此不再详述。
可以替换的，通信装置700也可配置成通用处理系统，例如通称为芯片，该通用处理系统包括:提供处理器功能的一个或多个微处理器；以及提供存储介质703的至少一部分的外部存储器，所有这些都通过外部总线体系结构与其它支持电路连接在一起。
可替换的，通信装置700可以使用下述来实现:具有处理器702、总线接口704、用户接口706的ASIC(专用集成电路)；以及集成在单个芯片中的存储介质703的至少一部分，或者，通信装置700可以使用下述来实现：一个或多个FPGA(现场可编程门阵列)、PLD(可编程逻辑器件)、控制器、状态机、门逻辑、分立硬件部件、任何其它适合的电路、或者能够执行本发明通篇所描述的各种功能的电路的任意组合。
其中，处理器702负责管理总线和一般处理(包括执行存储在存储介质703上的软件)。处理器702可以使用一个或多个通用处理器和/或专用处理器来实现。处理器的例子包括微处理器、微控制器、DSP处理器和能够执行软件的其它电路。应当将软件广义地解释为表示指令、数据或其任意组合，而不论是将其称作为软件、固件、中间件、微代码、硬件描述语言还是其它。
存储介质703被示为与处理器702分离，然而，本领域技术人员很容易明白，存储 介质703或其任意部分可位于通信装置700之外。举例来说，存储介质703可以包括传输线、用数据调制的载波波形、和/或与无线节点分离开的计算机制品，这些介质均可以由处理器702通过总线接口704来访问。可替换地，存储介质703或其任意部分可以集成到处理器702中，例如，可以是高速缓存和/或通用寄存器。
处理器702可执行上述实施例中，例如，图3、图4和图5依次对应的实施例，在此不再对处理器702的执行过程进行赘述。
本申请实施例所说的通信装置，可以是接入点、站点、基站或者用户终端等无线通信设备。
本申请实施例所说的的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))等。

Claims (22)

  1. 一种编码方法，其特征在于，包括：
    获取基础码长N 0所对应的第一序列，其中，第一序列包含所述基础码长N 0所对应的N 0个极化信道的序号；
    确定N个待编码比特，其中，N个待编码比特中包括N2个固定比特，并且N大于所述基础码长N 0；
    将所述第一序列进行扩展以得到第二序列；
    基于所述第二序列中前N2个元素所指示的极化信道序号确定所述N个待编码比特中N2个固定比特的位置；
    对所述N个待编码比特进行Polar编码以得到编码比特。
  2. 根据权利要求1所述的方法，其特征在于，所述将所述第一序列进行扩展以得到第二序列包括：
    a)将所述第一序列作为待扩展序列进行扩展以得到第三序列，所述第三序列由所述待扩展序列和扩展序列组成，所述扩展序列的长度和所述待扩展序列的长度相同，且所述扩展序列中每个元素等于在所述待扩展序列中位于相同位置的元素加上所述待扩展序列的长度；
    b)在所述第三序列中将所述扩展序列中第一个元素插入到所述待扩展序列中以形成第四序列，其中，所述第四序列的长度和所述第三序列的长度相同；
    c)将所述扩展序列中第一个元素插入到所述待扩展序列中的插入位置和所述固定比特的数目N2进行比较，在所述插入位置小于所述N2时，转到d)，否则，转到e)；
    d)将所述第四序列作为所述待扩展序列，继续执行上述a)、b)和c)；
    e)将所述第四序列作为所述第二序列。
  3. 根据权利要求1所述的方法，其特征在于，所述将所述第一序列进行扩展以得到第二序列包括：
    确定扩展次数K；
    将所述第一序列作为待扩展序列进行K次扩展以得到K次扩展后的序列，将所述K次扩展后的序列作为所述第二序列，其中，每次扩展后的序列作为下一次扩展的待扩展序列，每次扩展后的序列由待扩展序列和扩展序列组成，所述扩展序列的长度和所述待扩展序列的长度相同，且所述扩展序列中每个元素等于在所述待扩展序列中位于相同位置的元素加上所述待扩展序列的长度。
  4. 根据权利要求3所述的方法，其特征在于，所述确定扩展次数K包括：
    通过查表确定所述基础码长N 0所对应的插入位置序列P；
    从所述插入位置序列P中第一个元素起，依次将每个元素和所述固定比特的数目N2进行比较直到确定出不小于N2的元素，将从所述第一个元素开始直到确定出不小于N2的元素中间所经过的比较次数作为所述扩展次数K。
  5. 根据权利要求1-4任一所述的方法，其特征在于，所述确定N个待编码比特包括：
    根据M确定N,其中，N＝M，所述M为Polar码输出的目标码长，所述M等于2的 正整数次幂，M为正整数。
  6. 根据权利要求5所述的方法，其特征在于，所述基于所述第二序列中前N2个元素所指示的极化信道序号确定所述N个待编码比特中N2个固定比特的位置包括：
    将所述第二序列中前N2个元素所指示的极化信道序号作为所述N个待编码比特中N2个固定比特的位置。
  7. 根据权利要求1-4任一所述的方法，其特征在于，所述确定N个待编码比特包括：
    根据M确定N,其中，
    Figure PCTCN2018078901-appb-100001
    符号
    Figure PCTCN2018078901-appb-100002
    表示向下取整，所述M为Polar码输出的目标码长，所述M不等于2的正整数次幂，M为正整数。
  8. 根据权利要求7所述的方法，其特征在于，在确定N个待编码比特之后，所述方法还包括：
    确定(M-N)个删除位置，所述(M-N)个删除位置用于实现速率匹配；
    所述基于所述第二序列中前N2个元素所指示的极化信道序号确定所述N个待编码比特中N2个固定比特的位置包括：
    确定在所述第二序列的前N2个元素中存在S个删除位置，其中，0≤S≤(M-N)；
    将第五序列中前(N2-M+N)个元素和所述(M-N)个删除位置作为所述N个待编码比特中N2个固定比特的位置，其中，所述第五序列为在所述第二序列的前N2个元素中除去所述S个删除位置之外的元素所组成的序列。
  9. 根据权利要求1-8任一所述的方法，其特征在于，所述获取基础码长N 0所对应的第一序列包括：
    通过查表获取所述基础码长N 0所对应的第一序列。
  10. 根据权利要求1-8任一所述的方法，其特征在于，所述获取基础码长N 0所对应的第一序列包括：
    根据所述基础码长N 0所对应的N 0个极化信道的可靠度确定所述第一序列。
  11. 一种编码装置，其特征在于，包括：
    获取模块，用于获取基础码长N 0所对应的第一序列，其中，第一序列包含所述基础码长N 0所对应的N 0个极化信道的序号；
    第一确定模块，用于确定N个待编码比特，其中，N个待编码比特中包括N2个固定比特，并且N大于所述基础码长N 0；
    扩展模块，用于将所述获取模块获取的所述第一序列进行扩展以得到第二序列；
    第二确定模块，用于基于所述扩展模块扩展得到的第二序列中前N2个元素所指示的极化信道序号确定所述N个待编码比特中N2个固定比特的位置；
    编码模块，用于对所述第一确定模块确定的所述N个待编码比特进行Polar编码以得到编码比特。
  12. 根据权利要求11所述的编码装置，其特征在于，所述扩展模块具体用于：
    a)将所述第一序列作为待扩展序列进行扩展以得到第三序列，所述第三序列由所述待扩展序列和扩展序列组成，所述扩展序列的长度和所述待扩展序列的长度相同，且所述扩展序列中每个元素等于在所述待扩展序列中位于相同位置的元素加上所述待扩展序列的长度；
    b)在所述第三序列中将所述扩展序列中第一个元素插入到所述待扩展序列中以形成 第四序列，其中，所述第四序列的长度和所述第三序列的长度相同；
    c)将所述扩展序列中第一个元素插入到所述待扩展序列中的插入位置和所述固定比特的数目N2进行比较，在所述插入位置小于所述N2时，转到d)，否则，转到e)；
    d)将所述第四序列作为所述待扩展序列，继续执行上述a)、b)和c)；
    e)将所述第四序列作为所述第二序列。
  13. 根据权利要求11所述的编码装置，其特征在于，所述扩展模块包括：
    确定子模块，用于确定扩展次数K；
    扩展子模块，用于将所述第一序列作为待扩展序列进行K次扩展以得到K次扩展后的序列，将所述K次扩展后的序列作为所述第二序列，其中，每次扩展后的序列作为下一次扩展的待扩展序列，每次扩展后的序列由待扩展序列和扩展序列组成，所述扩展序列的长度和所述待扩展序列的长度相同，且所述扩展序列中每个元素等于在所述待扩展序列中位于相同位置的元素加上所述待扩展序列的长度。
  14. 根据权利要求13所述的编码装置，其特征在于，所述确定子模块具体用于：
    通过查表确定所述基础码长N 0所对应的插入位置序列P；
    从所述插入位置序列P中第一个元素起，依次将每个元素和所述固定比特的数目N2进行比较直到确定出不小于N2的元素，将从所述第一个元素开始直到确定出不小于N2的元素中间所经过的比较次数作为所述扩展次数K。
  15. 根据权利要求11-14任一所述的编码装置，其特征在于，所述第一确定模块具体用于：
    根据M确定N,其中，N＝M，所述M为Polar码输出的目标码长，所述M等于2的正整数次幂，M为正整数。
  16. 根据权利要求15所述的编码装置，其特征在于，所述第二确定模块具体用于：
    将所述第二序列中前N2个元素所指示的极化信道序号作为所述N个待编码比特中N2个固定比特的位置。
  17. 根据权利要求11-14任一所述的编码装置，其特征在于，所述第一确定模块具体用于：
    根据M确定N,其中，
    Figure PCTCN2018078901-appb-100003
    符号
    Figure PCTCN2018078901-appb-100004
    表示向下取整，所述M为Polar码输出的目标码长，所述M不等于2的正整数次幂，M为正整数。
  18. 根据权利要求17所述的编码装置，其特征在于，还包括：
    第三确定单元，用于确定(M-N)个删除位置，所述(M-N)个删除位置用于实现速率匹配；
    所述第二确定模块具体用于：
    确定在所述第二序列的前N2个元素中存在S个删除位置，其中，0≤S≤(M-N)；
    将第五序列中前(N2-M+N)个元素和所述(M-N)个删除位置作为所述N个待编码比特中N2个固定比特的位置，其中，所述第五序列为在所述第二序列的前N2个元素中除去所述S个删除位置之外的元素所组成的序列。
  19. 根据权利要求11-18任一所述的方法，其特征在于，所述获取模块具体用于：
    通过查表获取所述基础码长N 0所对应的第一序列。
  20. 根据权利要求11-18任一所述的方法，其特征在于，所述获取模块具体用于：
    根据所述基础码长N 0所对应的N 0个极化信道的可靠度确定所述第一序列。
  21. 一种通信装置，其特征在于，包括：
    存储器，用于存储程序；
    处理器，用于执行所述存储器存储的所述程序，当所述程序被执行时，所述处理器用于执行如权利要求1-10中任一所述的步骤。
  22. 一种计算机可读存储介质，包括指令，当其在计算机上运行时，使得计算机执行如权利要求1-10任意一项所述的方法。
PCT/CN2018/078901 2017-03-17 2018-03-14 编码方法、编码装置和通信装置 WO2018166455A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP18768253.9A EP3570472A4 (en) 2017-03-17 2018-03-14 CODING METHOD, CODING DEVICE AND COMMUNICATION DEVICE
US16/572,163 US10979076B2 (en) 2017-03-17 2019-09-16 Encoding method, encoding apparatus, and communications apparatus

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710162011.3 2017-03-17
CN201710162011.3A CN108599891B (zh) 2017-03-17 2017-03-17 编码方法、编码装置和通信装置

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/572,163 Continuation US10979076B2 (en) 2017-03-17 2019-09-16 Encoding method, encoding apparatus, and communications apparatus

Publications (1)

Publication Number Publication Date
WO2018166455A1 true WO2018166455A1 (zh) 2018-09-20

Family

ID=63521758

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/078901 WO2018166455A1 (zh) 2017-03-17 2018-03-14 编码方法、编码装置和通信装置

Country Status (4)

Country Link
US (1) US10979076B2 (zh)
EP (1) EP3570472A4 (zh)
CN (1) CN108599891B (zh)
WO (1) WO2018166455A1 (zh)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111200476B (zh) 2018-11-16 2021-12-14 华为技术有限公司 Polar码编码方法及装置
CN109361495B (zh) 2018-12-07 2020-05-08 北京邮电大学 一种极化码构造方法、装置、电子设备及可读存储介质
CN114513212A (zh) * 2020-11-16 2022-05-17 华为技术有限公司 一种极化编码方法和装置
CN114513280A (zh) * 2020-11-16 2022-05-17 华为技术有限公司 一种极化编码方法和装置
CN117716672A (zh) * 2021-08-10 2024-03-15 株式会社Ntt都科摩 基于统一非正交波形的电子设备

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103023618A (zh) * 2013-01-11 2013-04-03 北京邮电大学 一种任意码长的极化编码方法
US20150263767A1 (en) * 2014-03-11 2015-09-17 Postech Academy-Industry Foundation List decoding method for polar code and memory system using the same

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101227193B (zh) * 2008-02-02 2010-06-02 中国科学院计算技术研究所 一种低密度校验码的编解码装置和方法
KR101951663B1 (ko) * 2012-12-14 2019-02-25 삼성전자주식회사 Crc 부호와 극 부호에 의한 부호화 방법 및 장치
CN109861694B (zh) 2013-11-20 2021-10-26 华为技术有限公司 极化码的处理方法和设备
US10461779B2 (en) * 2015-08-12 2019-10-29 Telefonaktiebolaget Lm Ericsson (Publ) Rate-compatible polar codes
WO2018110961A1 (ko) * 2016-12-15 2018-06-21 엘지전자 주식회사 다중 집합 레벨에 따라 하향링크 제어 정보를 디코딩하는 방법 및 단말
EP3602793A4 (en) * 2017-03-23 2020-11-11 Qualcomm Incorporated PARITY BIT CHANNEL ASSIGNMENT FOR POLAR CODING
CN108631916B (zh) * 2017-03-24 2020-03-31 华为技术有限公司 极化Polar码的速率匹配方法和装置、通信装置
CN109412608B (zh) * 2017-03-24 2019-11-05 华为技术有限公司 Polar编码方法和编码装置、译码方法和译码装置
US10432357B2 (en) * 2017-06-02 2019-10-01 Qualcomm Incorporated Sequence-based polar code description

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103023618A (zh) * 2013-01-11 2013-04-03 北京邮电大学 一种任意码长的极化编码方法
US20150263767A1 (en) * 2014-03-11 2015-09-17 Postech Academy-Industry Foundation List decoding method for polar code and memory system using the same

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
HUAWEI ET AL.: "Polar Code Construction for NR", 3GPP TSG RAN WG1 MEETING #86BIS, RL-1608862, 14 October 2016 (2016-10-14), pages 1 - 8, XP051159189 *
JINGBO LIU ET AL.: "Frozen Bits Selection for Polar Codes Based on Simulation and BP Decoding", IEICE ELECTRONICS EXPRESS, 27 February 2017 (2017-02-27), pages 1 - 6, XP055540486 *
See also references of EP3570472A4 *

Also Published As

Publication number Publication date
US20200014403A1 (en) 2020-01-09
US10979076B2 (en) 2021-04-13
EP3570472A1 (en) 2019-11-20
CN108599891B (zh) 2020-05-08
EP3570472A4 (en) 2020-01-22
CN108599891A (zh) 2018-09-28

Similar Documents

Publication Publication Date Title
JP6817452B2 (ja) レートマッチング方法、符号化装置、および通信装置
US10938422B2 (en) Polar code rate matching method and apparatus, and a communications apparatus
WO2018166455A1 (zh) 编码方法、编码装置和通信装置
WO2017101631A1 (zh) 用于处理极化码的方法和通信设备
KR102174947B1 (ko) 폴라 코드 인코딩 및 디코딩 방법과 장치
JP7471357B2 (ja) 符号化方法、復号方法、装置、および装置
CN108365848B (zh) 一种极性码的译码方法和装置
WO2018137568A1 (zh) 编码方法、编码装置和通信装置
WO2017124844A1 (zh) 确定极化码传输块大小的方法和通信设备
WO2018233414A1 (zh) 极化码编码的方法和装置
WO2019158031A1 (zh) 编码的方法、译码的方法、编码设备和译码设备
WO2019062145A1 (zh) Ploar编码方法和编码装置、译码方法和译码装置
CN108282259B (zh) 一种编码方法及装置
US10924210B2 (en) Method, apparatus, and device for determining polar code encoding and decoding
US10419161B2 (en) Method and communications device for transmitting information
US11239945B2 (en) Encoding method, decoding method, apparatus, and device
WO2019024594A1 (zh) 极化码的编译码方法、装置及设备
WO2018228592A1 (zh) 一种极化Polar码的交织处理方法及装置
WO2018127069A1 (zh) 一种编码方法及装置
WO2019037782A1 (zh) 极化码的译码方法和译码器
WO2018161946A1 (zh) 数据处理的方法和装置
WO2018141271A1 (zh) 数据处理的方法和装置
WO2018184479A1 (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: 18768253

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2018768253

Country of ref document: EP

Effective date: 20190812

NENP Non-entry into the national phase

Ref country code: DE