WO2018202166A1 - 一种Polar码传输方法及装置 - Google Patents

一种Polar码传输方法及装置 Download PDF

Info

Publication number
WO2018202166A1
WO2018202166A1 PCT/CN2018/085711 CN2018085711W WO2018202166A1 WO 2018202166 A1 WO2018202166 A1 WO 2018202166A1 CN 2018085711 W CN2018085711 W CN 2018085711W WO 2018202166 A1 WO2018202166 A1 WO 2018202166A1
Authority
WO
WIPO (PCT)
Prior art keywords
bit
matrix
polar code
information
sequence
Prior art date
Application number
PCT/CN2018/085711
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 EP18794483.0A priority Critical patent/EP3614591B1/en
Publication of WO2018202166A1 publication Critical patent/WO2018202166A1/zh
Priority to US16/673,581 priority patent/US11258463B2/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/0057—Block codes
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/27—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 using interleaving techniques
    • H03M13/2792—Interleaver wherein interleaving is performed jointly with another technique such as puncturing, multiplexing or routing
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/09—Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/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/27—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 using interleaving techniques
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/61—Aspects and characteristics of methods and arrangements for error correction or error detection, not provided for otherwise
    • H03M13/615—Use of computational or mathematical techniques
    • H03M13/616—Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0061—Error detection codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0071—Use of interleaving

Definitions

  • the embodiments of the present invention relate to the field of communications technologies, and in particular, to a method and an apparatus for transmitting a Polar code.
  • the physical broadcast channel (English: Physical Broadcast Channel, PBCH) carries the master information block (English: Master Information Block, MIB for short).
  • the length of the MIB is 24 bits, and the MIB includes a downlink system bandwidth, a Physical Hybrid ARQ Indicator Channel (PHICH) size, and a system frame number (English: System Frequency Number, referred to as : SFN) The high eight and so on.
  • the processing procedure of the transmitting end PBCH is as shown in FIG. 1.
  • the base station first performs a Cyclic Redundancy Check (CRC) encoding on the MIB to be transmitted to obtain a 16-bit CRC sequence, and then the base station will have a 40-bit long sequence (including a 24-bit MIB and a 16-bit CRC).
  • CRC Cyclic Redundancy Check
  • a coding sequence is obtained, and the coding sequence is copied to obtain four equal-sized PBCH independent units, each PBCH independent unit carries the same data, and four PBCH independent units are respectively added by four scrambling code sequences. Interference, finally, the base station completes the subsequent modulation, mapping, and transmission procedures for scrambling.
  • the channel coding of PBCH adopts Tailing bit convolution coding (abbreviation: TBCC), and the four scrambling code sequences adopt different phases.
  • the four PBCH independent units carry the same coded bits, and the four PBCH independent units perform the processes of scrambling, modulation, and mapping, and then transmit in a time interval of 40 ms (the transmission time of four radio frames, each radio frame is 10 ms).
  • the processing procedure of the receiving end PBCH is as shown in FIG. 2.
  • the four PBCH independent units carry the same coded bits. Therefore, if the channel quality is good enough, the receiver only receives a PBCH independent unit within 40 ms and successfully completes the descrambling, decoding, and CRC check. operating. Since the receiving end transmits the MIB in the first few radio frames within 40 ms by the descrambling successful scrambling code sequence, the lower 2 bits of the SFN are known.
  • the receiving end For the case of poor channel quality, if the receiving end only receives one PBCH independent unit and cannot successfully descramble the decoding, it will perform soft combining with the next PBCH independent unit transmitted in the next 10ms and then decode it until successful decoding.
  • the embodiment of the present application provides a method and a device for transmitting a Polar code, which are used to apply a Polar code coding mode to a PBCH.
  • a method for transmitting a Polar code is provided.
  • the transmitting end scrambles and interleaves the coded sequence encoded by the Polar code, so that when the bit sequence to be encoded is an all-zero vector, the Polar codes transmitted at different timings are identical. The resulting timing confusion helps the Polar code encoding method to be better applied to the PBCH.
  • the transmitting end performs a Polar code encoding on part or all of the bit sequence U to be encoded to generate a coding sequence, the length of the U being N; the transmitting end adopts a scrambling sequence S X and an interleaving matrix P X , scrambling and interleaving the coding sequence.
  • the length of the mother code is N
  • the length of the U is the same as the length of the mother code, wherein: if the bit at the N/2 position in U is an information bit, and the bit at the N/2 position in U
  • the G N is a generation matrix of a Polar code
  • the Su is a vector of 1 ⁇ N
  • the G N is a generation matrix of a Polar code
  • the Su is a vector of 1 ⁇ N
  • the T u is a transformation matrix
  • T u The column vector corresponding to the information bit position of the U constitutes
  • the mother code length is d*N
  • the sequence to be encoded is divided into d parts of equal length
  • the U is any part of the d parts
  • the d is 2 The exponent of the exponent; wherein: if the bit at the N/2th position in U is an information bit, and the bit at the N/2th position in U is a fixed bit, the bit at the N/4 position in the Su is set to 1
  • the S X S U ⁇ G N
  • the G N is a generation matrix of the Polar code
  • the Su is a vector of 1 ⁇ N
  • the G N is a generation matrix of a Polar code
  • the Su is a vector of 1 ⁇ N
  • the T u is a transformation matrix
  • the transmitting end performs first scrambling on the coding sequence and then interleaves; or the transmitting end performs interleaving on the coding sequence and then scrambles.
  • the row with the largest row weight in the Su and at least one M ⁇ M upper triangular matrix is in the Tu.
  • the bit corresponding to the position is set to 1.
  • the interleaving matrix is a permutation matrix, and optionally, a cyclic shift matrix.
  • a method for transmitting a Polar code performs a Polar code encoding on a part or all of the bit sequence U to be encoded to generate a coding sequence, the length of the U is N; and the transmitting end uses an interlacing matrix P X Interleaving the encoded sequence.
  • the fixed bit of a specific position in U is set to 1.
  • the bit at the N/2th position in U is a fixed bit
  • the fixed bit of the N/2th position in U is set to 1; or, if the bit at the N/2th position in U is Information bit, and the bit at the N/4 position in U is a fixed bit, then the bit at the N/4 position in U is set to 1; or, if the number of the first information bit in U is greater than N/4, then U
  • the first information bit is set to 1 along the N/4 fixed bit position before the natural order of the polar code; or, the column vector corresponding to the information bit position of U in T u constitutes an information bit transformation matrix, information bit transformation
  • the row with the largest row weight in the triangular matrix on the MxM in the matrix corresponds to a position index in U.
  • the N/4 bit before the natural order of the polar code in U is a fixed bit
  • the position index in U is along the polar
  • the N/4 fixed bit before the code natural order is set to 1.
  • the M is a positive integer greater than or equal to 2.
  • at least one upper triangular matrix of M ⁇ M is selected to perform the foregoing processing.
  • the interleaving matrix is a permutation matrix, and optionally, a cyclic shift matrix.
  • a Polar code transmission device having the function of implementing the behavior of the sender in any of the possible aspects of the first aspect and the first aspect described above.
  • the functions may be implemented by hardware or by corresponding software implemented by hardware.
  • the hardware or software includes one or more modules corresponding to the functions described above.
  • the Polar code transmission device comprises: an input interface circuit for acquiring part or all of the bit sequence U; and a logic circuit for performing the above The behavior of the transmitting end in any of the possible designs of the first aspect and the first aspect; the output interface circuit for outputting the scrambled and interleaved bit sequence.
  • the Polar code transmission device may be a chip or an integrated circuit.
  • the Polar code transmission device when part or all of the function is implemented by software, the Polar code transmission device comprises: a memory for storing a program; a processor for executing the program stored by the memory, When the program is executed, the Polar code transmission device may implement the method described in any of the possible aspects of the first aspect and the first aspect described above.
  • the above memory may be a physically separate unit or may be integrated with the processor.
  • the Polar code transmission device when some or all of the functions are implemented by software, includes a processor.
  • a memory for storing a program is located outside the encoding device, and the processor is connected to the memory through a circuit/wire for reading and executing a program stored in the memory.
  • a Polar code transmission apparatus having a function of implementing the behavior of the sender in any of the possible aspects of the second aspect and the second aspect described above.
  • the functions may be implemented by hardware or by corresponding software implemented by hardware.
  • the hardware or software includes one or more modules corresponding to the functions described above.
  • the Polar code transmission device comprises: an input interface circuit for acquiring part or all of the bit sequence U; and a logic circuit for performing the above The behavior of the transmitting end in one aspect and any possible design of the first aspect; the output interface circuit for outputting the interleaved bit sequence.
  • the Polar code transmission device may be a chip or an integrated circuit.
  • the Polar code transmission device when part or all of the function is implemented by software, the Polar code transmission device comprises: a memory for storing a program; a processor for executing the program stored by the memory, When the program is executed, the Polar code transmission device may implement the method described in any of the possible aspects of the first aspect and the first aspect described above.
  • the above memory may be a physically separate unit or may be integrated with the processor.
  • the Polar code transmission device when some or all of the functions are implemented by software, includes a processor.
  • a memory for storing a program is located outside the encoding device, and the processor is connected to the memory through a circuit/wire for reading and executing a program stored in the memory.
  • a wireless communication system comprising the apparatus of the third aspect, and the apparatus of the fourth aspect.
  • a sixth aspect a computer storage medium for storing a computer program, the computer program comprising any of the first aspect, the second aspect, any of the possible implementations of the first aspect, or the second aspect The instructions of the method in a possible implementation.
  • a computer program product comprising instructions, when executed on a computer, causes the computer to perform the methods described in the various aspects above.
  • FIG. 1 is a schematic diagram of a processing procedure of a transmitting end PBCH in the prior art
  • FIG. 2 is a schematic diagram of a processing procedure of a receiving end PBCH in the prior art
  • FIG. 3 is a schematic diagram of a wireless communication system in an embodiment of the present application.
  • FIG. 4 is a schematic diagram showing algebraic characteristics of a Polar code in an embodiment of the present application.
  • FIG. 5 is a schematic diagram of a manner of progressive interleaving and scrambling of a Polar code in an embodiment of the present application
  • FIG. 6 is a schematic diagram of a manner of decoding and deinterleaving at a receiving end according to an embodiment of the present application
  • FIG. 7 is a schematic diagram of a process of blind detection at a receiving end according to an embodiment of the present application.
  • FIG. 8 is a schematic diagram of a manner of progressive scrambling and interleaving of a Polar code in an embodiment of the present application.
  • FIG. 9 is a second schematic diagram of a decoding and deinterleaving manner of a receiving end according to an embodiment of the present application.
  • FIG. 10 is a second schematic diagram of a blind end check process in the embodiment of the present application.
  • FIG. 11 is a second schematic diagram of a manner of progressive interleaving and scrambling of a Polar code in an embodiment of the present application.
  • FIG. 12 is a schematic flowchart of a method for transmitting a Polar code according to an embodiment of the present application.
  • 13a to 13c are schematic diagrams showing a transformation matrix in the embodiment of the present application.
  • 15 is a schematic diagram of an upper triangular matrix in an information bit transformation matrix according to an embodiment of the present application.
  • 16 is a schematic diagram of a cyclic segment shift of a transmitting end according to an embodiment of the present application.
  • FIG. 17 is a schematic structural diagram of a Polar code transmission apparatus according to an embodiment of the present application.
  • FIG. 18 is a second schematic structural diagram of a Polar code transmission apparatus according to an embodiment of the present application.
  • FIG. 19 is a third schematic structural diagram of a Polar code transmission apparatus according to an embodiment of the present application.
  • FIG. 20 is a fourth schematic structural diagram of a Polar code transmission apparatus according to an embodiment of the present application.
  • the wireless communication system 300 to which the embodiment of the present application is applied includes a transmitting end 301 and a receiving end 302.
  • the sending end 301 can be a network device, and the receiving end 302 is a terminal; or the sending end 301 is a terminal, and the receiving end 302 is a network device.
  • the network device may be a base station, or may be a device integrated with a base station controller, or may be another device having similar communication functions.
  • the wireless communication system mentioned in the embodiments of the present application includes, but is not limited to, a narrowband Internet of Things system (English: Narrow Band-Internet of Things, referred to as NB-IoT), and a global mobile communication system (English: Global System) For Mobile Communications (GSM), Enhanced Data Rate for GSM Evolution (EDGE), Wideband Code Division Multiple Access (WCDMA) , Code Division Multiple Access (English: Code Division Multiple Access, CDMA2000 for short), Time Division-Synchronization Code Division Multiple Access (TD-SCDMA), Long Term Evolution ( English: Long Term Evolution (LTE), the three major application scenarios of next-generation 5G mobile communication systems, eMBB, URLLC and eMTC, or new communication systems that will emerge in the future.
  • GSM Global System
  • EDGE Enhanced Data Rate for GSM Evolution
  • WCDMA Wideband Code Division Multiple Access
  • CDMA2000 Code Division Multiple Access
  • TD-SCDMA Time Division-Synchronization Code Division Multiple Access
  • LTE Long Term Evolution
  • the terminals involved in the embodiments of the present application may include various handheld devices having wireless communication functions, in-vehicle devices, wearable devices, computing devices, or other processing devices connected to a wireless modem.
  • the terminal may be an MS (English: Mobile Station), a subscriber unit (English: subscriber unit), a cellular phone (English: cellular phone), a smart phone (English: smart phone), a wireless data card, a personal digital assistant (English: Personal Digital Assistant, referred to as: PDA) computer, tablet computer, wireless modem (English: modem), handheld device (English: handset), laptop (English: laptop computer), machine type communication (English: Machine Type Communication , referred to as: MTC) terminal.
  • MS International: Mobile Station
  • PDA Personal Digital Assistant
  • PDA Personal Digital Assistant
  • tablet computer tablet computer
  • wireless modem English: modem
  • handheld device English: handset
  • laptop English: laptop computer
  • machine type communication English: Machine Type Communication
  • the Polar code coding mode is applied to the PBCH, and the coded sequence encoded by the Polar code is scrambled and interleaved, so that when the bit sequence to be encoded is an all-zero vector, the Polar codes sent at different timings are identical. The resulting timing confusion helps the Polar code encoding method to be better applied to the PBCH.
  • the encoding strategy of the Polar code utilizes a noise-free channel to transmit useful information of the user, and the full-noise channel transmits the agreed information or does not transmit information.
  • the Polar code is also a linear block code, and its coding matrix is GN.
  • the encoding process is among them Is a binary line vector of length N (ie code length); G N is an N ⁇ N matrix, and Defined as the Kronecker product of log 2 N matrices F 2 . Above matrix
  • G N (A) is the set of G N The sub-matrices obtained from those rows corresponding to the index
  • G N (AC) is the set of G N The sub-matrices obtained from those rows corresponding to the index.
  • the encoded output of the Polar code can be simplified to:
  • indicates the number of elements in the collection, and K is the size of the information block.
  • the construction process of the Polar code is a collection
  • the selection process determines the performance of the Polar code.
  • 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.
  • Channel index as a collection Element
  • the index corresponding to the remaining (NK) polarized channels as the index set of fixed bits Elements. set Determine the location of the information bits, the collection The position of the fixed bit is determined.
  • the length of the bit sequence to be encoded is N, which can be applied to two cases, to be encoded.
  • the length of the bit sequence is the same as the length of the mother code, and is N; or, in the first case, the length of the mother code is d*N, that is, the sequence to be encoded is divided into d parts of equal length, and U is in d parts.
  • d is the exponential power of 2.
  • G N can be regarded as 1/d parts of the coding matrix corresponding to the sequence of N to be coded.
  • the encoding matrix of Polar with a mother code length of d*N is:
  • the coding matrix of Polar in which the mother code length is N is:
  • Polar code based on progressive interleaving can implement implicit transmission and carry implicit information.
  • the method of scrambling is added on the basis of progressive interleaving, which can be regarded as a Polar code based on progressive interleaving and scrambling.
  • the method based on progressive interleaving and scrambling Polar code can be It is not limited to the following application scenarios: Scene 1: PBCH timing implicit transmission, which can support soft combining of multiple transmissions and blind detection of timing.
  • Scenario 2 Implicit information transmission in Ultra-reliable and Low Latency Communications (URLLC) can support multi-point concurrent transmission and blind detection of certain information.
  • Scene 3 a general single transmission, supports blind detection of certain information.
  • F is a fixed bit set in the vector u to be encoded of the Polar code to be encoded, including (NK) elements.
  • I is the information to be encoded in the vector to be encoded U to be encoded of the Polar code, including K elements, including information bits and parity bits.
  • the verification method uses CRC as an example, and the check bit is the CRC bit.
  • U is the information vector to be encoded of the Polar code or the bit sequence to be encoded, which is a vector of 1 ⁇ N.
  • P x is a matrix of NxN, which represents multiplying the input bit vector by the Px operation.
  • P x is a permutation matrix, that is, a row-column transformation matrix, and each row has only one element per column.
  • Px is a row-column transformation matrix
  • Px can be referred to as an interleaving matrix.
  • Tu is a matrix of NxN, representing the input bit vector multiplied by the Tu operation.
  • S X and S U are 1xN vectors, representing the input bit vector for scrambling operations.
  • T u G N ⁇ P x ⁇ G N
  • S X S U ⁇ G N
  • the results of the upper half and the lower half of the operation flow in Figure 4 are equivalent, and the output bit sequence is the same. of.
  • T u may be referred to as a transformation matrix
  • Px may be referred to as an interleave matrix
  • both S X and S U may be referred to as a scrambling vector.
  • the upper half of FIG. 4 a fixed set of bits and a set of information bits I F consisting of information to be encoded vector U, and U is multiplied by the transformation matrix T u, U S and U of the transformation matrix T u multiplied output
  • the vector is scrambled, and the scrambled vector is encoded by the coding matrix G N to output the encoded bit sequence.
  • the fixed bit set F and the information bit set I constitute the information vector U to be encoded
  • U is encoded by the coding matrix G N
  • the encoded vector is multiplied by the interleaving matrix P x
  • the S X pairs are encoded.
  • the vector obtained by multiplying the vector by P x performs a scrambling operation, and outputs the scrambled bit sequence.
  • a progressive interleaving and scrambling method can be designed to transmit implicit information by the number m of interleaving and scrambling.
  • the number of interleaving and scrambling is different, and different versions can be output, that is, different bit sequences are output.
  • Different versions carry implicit information m, m can be used to describe various information such as antenna port, carrier position, timing, and the like.
  • the value of m is from 0 to M-1, and the value of M can be agreed by both parties.
  • the output version is represented by SS#0 to SS#M-1.
  • Progressive interleaving and scrambling can be understood as interleaving and scrambling operations on each layer based on the previous layer of interleaving and scrambling.
  • the upper half and the lower half of Figure 5 are equivalent in the operational flow, and the output bit sequences are the same.
  • the implicit information m carried by different versions sent by the sender is different.
  • the receiving end After receiving the decoding sequence, the receiving end performs blind detection through the reverse flow of the process shown in FIG. 5, and can obtain implicit information according to m. For example, timing information can be obtained, that is, the version corresponds to the timing of the transmission.
  • the receiving end can also implement soft combining of the received different versions, and then perform decoding, which helps the successful decoding in case of poor channel conditions.
  • the version to be decoded received by the receiving end is represented by LLR#m, LLR#m+1, LLR#m+2, ... LLR#m+j, and the receiving end passes through FIG. 6.
  • the illustrated flow performs the reverse operation of the flow shown in FIG.
  • Sx represents scrambling a Log Likely Ratio (LLR) vector
  • LLR Log Likely Ratio
  • Px -1 represents the deinterleaving operation on the input LLR vector.
  • the different LLRs obtained by the deinterleaving operation are added, and the added signals are subjected to Polar decoding to obtain a decoded vector.
  • the Polar decoding method uses a conventional serial cancellation list (SCL)-x Polar decoding method to obtain x decoding vectors, which can be based on the absolute value of the PM. Sorting a large number of x decoding vectors to get Of course, other methods of Polar decoding may also be used, which are not limited in this application.
  • the receiving end after receiving the x decoding vectors, the receiving end performs blind detection to acquire data information and implicit information m.
  • the reverse flow of the upper half of the flow shown in Figure 5 can be used, and the specific steps are as follows.
  • Step 702 The receiving end selects the ith decoding vector.
  • Step 703 the decoding vector Scramble using S U. And the obtained scrambled vector is multiplied by Tu -1 for solution transformation.
  • Step 703 is repeated a total of m times.
  • Step 704 the extracting step 703 decomposes the transformed data information, where the data information includes information bits and CRC bits.
  • Step 705 The receiving end performs CRC detection on the data information.
  • Step 706 The receiving end determines whether the CRC detection is passed. If yes, the information bit and the implicit information m used in the current round of verification are obtained. Otherwise, step 707 is performed.
  • Step 707 The receiving end determines whether m is less than M-1. If yes, step 708 is performed; otherwise, step 709 is performed.
  • Step 709 The receiving end determines whether i is smaller than the CRC detection size (English: check size). If yes, step 710 is performed; otherwise, it is determined that the decoding fails. Among them, the CRC detection size is predefined.
  • the relationship between S X-1 and S U-1 and the relationship between S X-2 and S U-2 may refer to the scrambling vector transformation of the segmented Polar code. rule.
  • the scrambling vector transformation rule of the segmented Polar code may be defined as: for the Nxd long polar code, first determine the scrambling vector S u1 , S u2 ,..., S of each segment on u. UD, and then makes up a length of Nxd vector [S u1, S u2, ... , S ud], its polar code encoding matrix times Nxd to give [S x1, S x2, ... , S xd ], where S x1 , S x2 , . . . , S xd are scrambling vectors corresponding to S u1 , S u2 , . . .
  • the number of times of scrambling and interleaving is different, and different versions can be output, that is, different bit sequences are output.
  • the value of m is from 0 to M-1, and the value of M can be agreed by both parties.
  • the output version is represented by SS#0 to SS#M-1.
  • Progressive interleaving and scrambling can be understood as interleaving and scrambling operations on each layer based on the previous layer of interleaving and scrambling.
  • the receiving end after receiving the decoding sequence, performs blind detection through the reverse flow of the flow shown in FIG. 8, and can obtain implicit information according to m.
  • the version to be decoded received by the receiving end is represented by LLR#m, LLR#m+1, LLR#m+2, ... LLR#m+j, and Px -1 represents the input.
  • the LLR vector deinterleaving operation. Sx indicates that the vector after the deinterleaving operation is scrambled, and the scrambling and descrambling operations are the same.
  • the receiving end after receiving the x decoding vectors, the receiving end performs blind detection to acquire data information and implicit information m.
  • the reverse flow of the upper half of the flow shown in Figure 5 can be used, and the specific steps are as follows.
  • Step 1002 The receiving end selects the ith decoding vector
  • Step 1003 the decoding vector Multiply Tu -1 to perform the transform, and use S U to scramble the vector after the transform.
  • Step 1003 is repeated a total of m times.
  • Step 1004 The extraction step 1003 de-converts the data information, where the information information includes information bits and CRC bits.
  • Step 1005 The receiving end performs CRC detection on the data information.
  • Step 1006 The receiving end determines whether the CRC detection is passed. If yes, the information bit and the implicit information m used in the current round of verification are obtained. Otherwise, step 10010 is performed.
  • Step 1007 The receiving end determines whether m is less than M-1. If yes, step 10010 is performed; otherwise, step 1009 is performed.
  • Step 1009 The receiving end determines whether i is smaller than the CRC detection size (English: check size). If yes, step 1010 is performed; otherwise, it is determined that the decoding fails. Among them, the CRC detection size is predefined.
  • the data transmitted by the transmitting end is carried out after m times of transforming and scrambling, and the implicit information m is carried, and the data transmitted in different times may be at different times and on different frequencies.
  • interleaving and scrambling may be performed by the transformation matrix Tu and the scrambling vector Su before being encoded by the coding matrix G N , or may be encoded.
  • the matrix G N is encoded and interleaved and scrambled by the interleaving matrix Px and the scrambling vector Sx.
  • the order of operations of the two steps of interleaving and scrambling can be interchanged, which is equivalent in terms of implementation effect.
  • Step 1201 The transmitting end performs a Polar code encoding on part or all of the bit sequence U to be encoded to generate a coding sequence.
  • Step 1202 The transmitting end performs scrambling and interleaving on the coding sequence by using the scrambling sequence S X and the interleaving matrix P X .
  • the bit sequence U described in step 1201 can be applied to two cases.
  • the length of the mother code is N
  • the length of U is the same as the length of the mother code.
  • the length of the mother code is d*N, that is, the sequence to be encoded is divided into d parts of equal length
  • U is any part of d parts
  • d is an exponential power of 2.
  • G N can be regarded as 1/d parts of the coding matrix corresponding to the sequence of N to be coded.
  • T u m For convenience of description, explain how to extract from the first T u m transform matrix information bits, the information bits of the transform matrix T u m information bits in the column vector U corresponding to the position of the matrix composition, 1 ⁇ m ⁇ M-1.
  • U undergoes different transformations and scrambling times, and different transmission versions correspond to different T u m .
  • P X is a cyclic shift matrix with an offset of N/4.
  • a total of 4 transmission versions are supported, and the corresponding transformation matrix is I, T u 1 , T u . 2 , T u 3 .
  • T u 1 , T u 2 , and T u 3 are as shown in FIGS. 13 a to 13 c , respectively.
  • the information bit position in U is ⁇ 8 10 11 12 13 14 15 16 ⁇ , and the rows and columns whose position index is ⁇ 8 10 11 12 13 1415 16 ⁇ in T u 1 , T u 2 , and T u 3 are respectively taken out, and generated.
  • T uA , T uA 2 , T uA 3 are information bit transformation matrices, as shown in Fig. 14a, Fig. 14b and Fig.
  • T uA , T uA 2 , T uA 3 are 8x8 matrix
  • T uA , T uA 2 , T uA 3 are sub-matrices of T u 1 , T u 2 , and T u 3 , respectively.
  • S X can be determined by, but not limited to, the following ways.
  • bit at the N/2th position in U is an information bit, and the bit at the N/4 position in U is a fixed bit, the bit at the 1st to the N/2th position in Sx is set to 1, in Sx If the sequence number is numbered from 0, the bit from the 0th to the (N/2)-1th position in Sx is set to 1; or, if the bit at the N/2th position in U is the information bit, and the Nth in U
  • the bit at the /4 position is a fixed bit, and the bit at the N/2th position in Su is set to 1.
  • the column vector corresponding to the information bit position of U in T u constitutes an information bit transformation matrix, and the bit corresponding to the position of the row with the largest row weight in Tu in the upper triangular matrix of M ⁇ M in the information bit transformation matrix in Su.
  • M is a positive integer greater than or equal to 2.
  • the bits corresponding to the position of the row with the largest row weight in the upper triangular matrix of at least one M ⁇ M in Su are set. Is 1.
  • more than one 2x2 upper triangular matrix may be found, 1 ⁇ m ⁇ M-1, and the portion of the two dotted rectangles in FIG. 15 is one of the 2x2 upper triangular matrices.
  • the portion of the two dotted rectangles in FIG. 15 is one of the 2x2 upper triangular matrices.
  • only one 2x2 upper triangular matrix can be found in T uA 2
  • multiple 2x2 upper triangular matrices can be found in T uA 3
  • there is a 3x3 upper triangular matrix there is a 3x3 upper triangular matrix.
  • bit at the N/2th position in U is an information bit
  • bit at the N/4 position in U is a fixed bit
  • bit at the N/2th position in Su is set to 1.
  • bit at the N/4 position in U is a fixed bit
  • bit corresponding to the first information bit position in Su in Su is set to 1.
  • the column vector corresponding to the information bit position of U in T u constitutes an information bit transformation matrix
  • the bit corresponding to the position of the row with the largest row weight in Tu in the upper triangular matrix of M ⁇ M in the information bit transformation matrix in Su is Set to 1
  • M is a positive integer greater than or equal to 2.
  • the position of the row with the largest row weight in the upper triangular matrix of at least one M ⁇ M in the Su corresponds to the position in the Tu.
  • the bit is set to 1.
  • S x is calculated by the scramble vector transformation rule of the segmented Polar code.
  • the scrambling sequence S X may be an all-zero vector. More generally, the transmitting end may also omit the scrambling step, that is, in step 1202, the transmitting end only uses the interlacing matrix P X The coding sequence is interleaved and the scrambling step is omitted. In this case, the problem of timing aliasing caused by U being an all-zero vector can be solved by setting the fixed bit of a specific position in U to 1.
  • the following setting rules may be included.
  • the second rule if the bit at the N/2th position in U is an information bit, and the bit at the N/4 position in U is a fixed bit, the bit at the N/4 position in U is set to 1.
  • the third rule if the sequence number of the first information bit in U is greater than N/4, the first information bit in U is set to 1 along the N/4 fixed bit position before the natural order of the polar code.
  • the column vector corresponding to the information bit position of U in T u constitutes an information bit transformation matrix, and the row with the largest row weight in the triangular matrix on the MxM in the information bit transformation matrix corresponds to a position index in U, if U
  • the N/4 bit of the position index along the natural order of the polar code is a fixed bit, and the position index of the position index in the U is set to 1 along the N/4 fixed bit before the natural order of the polar code.
  • M is a positive integer greater than or equal to 2.
  • At least one MxM upper triangular transformation matrix is selected to perform the above processing.
  • the interleaving matrix P X is a cyclic shift matrix
  • the scheme in which the specific fixed bit position in the U provided in the above embodiment of the present application is set to 1 is not adopted, only the cyclic shift matrix is used. Cyclic shift can only generate up to 4 versions without changing the configuration, and cannot support more versions.
  • Tu the rows and columns corresponding to the information bits in U constitute a set of information bit transformation matrix: Tu A , Tu A 2 , ..., Tu A M-1 , subscript A denotes the row and column corresponding to the information bits in the extracted information bit transformation matrix Tu m , 1 ⁇ m ⁇ M-1.
  • Extracting some rows and columns in the information bit transformation matrix Tu m can find the following sub-matrices:
  • the so-called version that is, for a sequence to be encoded, a different version of the transmitting unit that can be generated by progressive interleaving, different versions of the transmitting unit are transmitted at different timings, and the receiving end can obtain timing information through different number of interleaving times, and can be different
  • the version of the sending unit implements a soft merge.
  • the method of determining Su by the above fourth type is introduced as an example.
  • Px offset is N/2. Support for 2 transmission versions.
  • the 2x2 upper triangular matrix is found in the information bit transformation matrix. According to the polar code structure, the position index of the row with the largest row weight in the 2x2 upper triangular matrix in U is determined, and the Su element corresponding to the position index in Su is set to 1.
  • the 3x3 upper triangular matrix is found in the information bit transformation matrix. According to the polar code structure, the position index of the row with the largest row weight in the triangular matrix on the 3x3 is determined, and the Su element corresponding to the position index in Su is set to 1.
  • the equivalent of U is multiplied by the transformation matrix Tu 0, 1, 2, and 3 times, that is, U is multiplied by I, Tu, Tu ⁇ 2, Tu ⁇ 3, and I is an identity matrix.
  • the rows and columns corresponding to the information bit positions of U in the four matrices I, Tu, Tu ⁇ 2, and Tu ⁇ 3 are taken out, and are recorded as information bit transformation matrices: I, T uA , T uA 2 , T uA 3 ,
  • the four information bit transformation matrices are summed by rows to obtain the position of the natural number of the sequence whose maximum position of the row weight is in U, and the bit of the natural sequence number position in Su is set to 1.
  • the information bits are constructed using the PW sequence, and the four rows of I, T uA , T uA 2 , and T uA 3 are observed, and the first row in the T uA 3 matrix is observed. The biggest weight.
  • the 2x2 upper triangular matrix structure only supports 2 copies of the transmission version, and the remaining structures support 4 copies of the transmission version without repeating.
  • the maximum number that can support the transmission version not to be repeated depends on the maximum upper triangular matrix dimension that can be extracted in Tu. If a scrambling is introduced after the above transformation, for example, the scrambling "1" is introduced every time the position corresponding to the largest row of the upper triangular matrix row weight, the above 2x2 upper triangular matrix structure can support 4 copies without repeating, 4x4 upper triangular matrix.
  • the structure can support 8 copies without repeating.
  • the high code rate is defined as the N/4 position of U is the information bit.
  • the transformation matrix of the information bits can appear to have a row weight of 4, that is, there is a case of 4x4 upper triangular transformation, and the Su and 4x4 upper triangular transformations are performed.
  • the bit corresponding to the position of the largest line in Tu is set to 1.
  • the element number set to 1 in Su is less than or equal to N/4, and correspondingly, 8 transmission versions can be generated, and the specific form is different from Table 1.
  • the length of the mother code is d*N, that is, the sequence to be encoded is divided into d parts of equal length, U is any part of d parts, and d is the exponential power of 2. For example, d is 2 parts, 4 parts, or 8 parts. Each part performs the same cyclic shift.
  • Tu corresponding to Px its information bit transformation matrix is extracted according to the configuration. Find the row with the row size greater than 4 in the information bit transformation matrix, and set the bit of the corresponding position in Su to 1.
  • FIG. 16 it is a schematic diagram of the cyclic segment shift of the transmitting end.
  • the embodiment of the present application further provides a Polar code transmission device 1700 for performing the Polar shown in FIG. Code transmission method.
  • a Polar code transmission device 1700 for performing the Polar shown in FIG. Code transmission method.
  • the receiving unit 1701 is configured to acquire part or all of the bit sequence U to be encoded
  • the processing unit 1702 is configured to perform a Polar code encoding on the part or all of the bit sequence U to be encoded acquired by the receiving unit 1701 to generate a code sequence, where the length of U is N;
  • the processing unit 1702 is further configured to perform scrambling and interleaving on the coding sequence by using the scrambling sequence S X and the interleaving matrix P X .
  • the length of the mother code is N, and the length of the U is the same as the length of the mother code, where:
  • bit at the N/2th position in U is an information bit
  • bit at the N/4 position in U is a fixed bit
  • bit at the 1st to the N/2th position in Sx is set to 1;
  • the length of the mother code is d*N, and the sequence to be encoded is divided into d parts of equal length, U is any part of d parts, and d is an exponential power of 2;
  • bit at the N/2th position in U is an information bit, and the bit at the N/4 position in U is a fixed bit, the bit at the N/2th position in Su is set to 1; or,
  • the column vector corresponding to the information bit position of U constitutes an information bit transformation matrix, and the bit corresponding to the position of the row having the largest row weight in the upper triangular matrix of M ⁇ M in Su in the information bit transformation matrix is set to 1, M Is a positive integer greater than or equal to 2.
  • processing unit 1702 is configured to:
  • the coding sequence is first interleaved and then scrambled.
  • the bits corresponding to the position of the row with the largest row weight in the upper triangular matrix of at least one M ⁇ M in Su are set. Is 1.
  • the interleaving matrix comprises a cyclic shift matrix.
  • a Polar code transmission device 1800 is further provided in the embodiment of the present application, and the Polar code transmission device 1800 is configured to perform the method shown in FIG. Polar code transmission method.
  • the Polar code transmission apparatus 1800 includes: an input interface circuit 1801, which is used to acquire a code to be encoded. Part or all of the bit sequence U; the logic circuit 1802 is used to perform the Polar code transmission method shown in FIG. 12 above.
  • the output interface circuit 1803 is used for The bit sequence after scrambling is output.
  • the Polar code transmission device 1800 may be a chip or an integrated circuit when implemented.
  • the Polar code transmission apparatus 1800 includes: a memory 1901 for storing a program; and a processor 1902 The program stored in the memory 1901 is executed, and when the program is executed, the Polar code transmission device 1800 can implement the Polar code transmission method provided by the above embodiment.
  • the foregoing memory 1901 may be a physically independent unit, or as shown in FIG. 20, the memory 1901 is integrated with the processor 1902.
  • the Polar code transmission device 1800 may also include only the processor 1902.
  • the memory 1901 for storing programs is located outside the Polar code transmission device 1800, and the processor 1902 is connected to the memory 1901 through circuits/wires for reading and executing programs stored in the memory 1901.
  • the embodiment of the present application provides a computer storage medium for storing a computer program, the computer program comprising a method for performing the Polar code transmission shown in FIG.
  • the embodiment of the present application provides a computer program product including instructions, which when executed on a computer, causes the computer to execute the Polar code transmission method shown in FIG.
  • embodiments of the present application can be provided as a method, system, or computer program product.
  • the present application can take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment in combination of software and hardware.
  • the application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) including computer usable program code.
  • the computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture comprising the instruction device.
  • the apparatus implements the functions specified in one or more blocks of a flow or a flow and/or block diagram of the flowchart.
  • These computer program instructions can also be loaded onto a computer or other programmable data processing device such that a series of operational steps are performed on a computer or other programmable device to produce computer-implemented processing for execution on a computer or other programmable device.
  • the instructions provide steps for implementing the functions specified in one or more of the flow or in a block or blocks of a flow diagram.

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)
  • Mathematical Analysis (AREA)
  • General Physics & Mathematics (AREA)
  • Computational Mathematics (AREA)
  • Mathematical Optimization (AREA)
  • Mathematical Physics (AREA)
  • Pure & Applied Mathematics (AREA)
  • Algebra (AREA)
  • Computing Systems (AREA)
  • Error Detection And Correction (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

一种Polar码传输方法及装置，用以将Polar码编码方式应用到PBCH中。该方法为：发送端将待编码的部分或全部比特序列U进行Polar码编码，生成编码序列，所述U的长度为N；所述发送端采用加扰序列SX和交织矩阵PX，对所述编码序列进行加扰和交织。

Description

一种Polar码传输方法及装置
本申请要求在2017年5月5日提交中国专利局、申请号为201710314206.5、发明名称为“一种Polar码传输方法及装置”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请实施例涉及通信技术领域，尤其涉及一种Polar码传输方法及装置。
背景技术
在长期演进(英文：Long Term Evolution，简称：LTE)系统中，物理广播信道(英文：Physical Broadcast Channel，简称：PBCH)承载主信息块(英文：Master Information Block，简称：MIB)。其中，MIB的长度为24比特，MIB包含下行链路系统带宽、物理混合自动重传请求指示信道(英文：Physical Hybrid ARQ Indicator Channel，PHICH)大小、以及系统帧号(英文：System Frequency Number，简称：SFN)的高八位等内容。发送端PBCH的处理过程如图1所示。基站首先对要发送的MIB进行循环冗余校验(英文：Cyclical Redundancy Check，简称：CRC)编码，得到16位CRC序列，然后基站将40比特长的序列(包含24bits的MIB和16bits的CRC)进行信道编码以及速率匹配后得到编码序列，将该编码序列复制得到4个大小相等的PBCH独立单元，每个PBCH独立单元携带相同数据，将4个PBCH独立单元采用4个扰码序列分别进行加扰，最后，基站完成加扰后续的调制、映射和发送流程。
其中，PBCH的信道编码采用咬尾卷积编码(英文：Tailing bit convolution coding，简称：TBCC)，4个扰码序列采用不同的相位。4个PBCH独立单元携带相同的编码比特，4个PBCH独立单元执行加扰、调制以及映射等流程后，在40ms(4个无线帧的传输时间，每个无线帧10ms)的时间间隔内发送。
接收端PBCH的处理过程如图2所示。由发送端描述可知，4个PBCH独立单元携带相同的编码比特，因此信道质量足够好的情况下，接收端只接收40ms内的一个PBCH独立单元就成功完成解扰、译码以及CRC校验的操作。由于接收端通过解扰成功的扰码序列，得到发送端是在40ms内的第几个无线帧发送MIB，即知道了SFN的低2位。对于信道质量较差的情况，接收端如果只接收一个PBCH独立单元不能成功解扰译码，就与下一个10ms发送的PBCH独立单元进行软合并再进行译码，直到成功解码。
由于第五代(英文：5th Generation，简称：5G)5G或之后的通信技术与4G通信技术存在很大差异，因此，LTE中对PBCH的编译码方式在已经不能沿用，需要有新解决方案。
发明内容
本申请实施例提供一种Polar码传输方法及装置，用以将Polar码编码方式应用到PBCH中。
本申请实施例提供的具体技术方案如下：
第一方面，提供一种Polar码传输方法，发送端将Polar码编码后的编码序列进行加扰和交织，避免了当待编码的比特序列为全0向量时，不同时序发送的Polar码完全相同从而导致的时序混淆，有助于Polar码编码方式更好的应用到PBCH中。
在一个可能的设计中，发送端将待编码的部分或全部比特序列U进行Polar码编码，生成编码序列，所述U的长度为N；所述发送端采用加扰序列S X和交织矩阵P X，对所述编码序列进行加扰和交织。
在一个可能的设计中，母码长度为N，所述U的长度与母码长度相同，其中：若U中第N/2位置的比特为信息比特，且U中第N/2位置的比特为固定比特，则所述Sx中第1至第N/4位置的比特设置为1；或者，若U中第N/4位置的比特为固定比特，所述S X＝S U·G N，所述G N为Polar码的生成矩阵，所述Su为1×N的向量，所述Su中与U中第一个信息比特位置对应的比特被设置为1；或者，所述S X＝S U·G N，所述G N·P x·G N＝T u，所述G N为Polar码的生成矩阵，所述Su为1×N的向量，所述T u为变换矩阵，T u中与U的信息比特位置对应的列向量组成信息位变换矩阵，所述Su中与所述信息位变换矩阵中M×M的上三角矩阵中行重最大的行在Tu中的位置对应的比特被设置为1，所述M为大于或等于2的正整数。这样，通过Sx加扰，可以有效避免待编码的比特序列为全0向量时，不同传输版本携带的隐式信息不能被接收端正确检测出。
在一个可能的设计中，母码长度为d*N，所述待编码的序列被分成了等长的d个部分，所述U为所述d个部分中的任意一部分，所述d为2的指数次方；其中：若U中第N/2位置的比特为信息比特，且U中第N/2位置的比特为固定比特，则所述Su中第N/4位置的比特设置为1；或者，若U中第N/4位置的比特为固定比特，所述S X＝S U·G N，所述G N为Polar码的生成矩阵，所述Su为1×N的向量，所述Su中与U中第一个信息比特位置对应的比特被设置为1；或者，所述S X＝S U·G N，所述G N·P x·G N＝T u，G N，所述G N为Polar码的生成矩阵，所述Su为1×N的向量，所述T u为变换矩阵，T u中与U的信息比特位置对应的列向量组成信息位变换矩阵，所述Su中与所述信息位变换矩阵中M×M的上三角矩阵中行重最大的行在Tu中的位置对应的比特被设置为1，所述M为大于或等于2的正整数。
在一个可能的设计中，所述发送端对所述编码序列进行先加扰后交织；或者，所述发送端对所述编码序列进行先交织后加扰。
在一个可能的设计中，若所述信息位变换矩阵中存在至少两个M×M的上三角矩阵，则所述Su中与至少一个M×M的上三角矩阵中行重最大的行在Tu中的位置对应的比特被设置为1。
在一个可能的设计中，所述交织矩阵为置换矩阵，可选的，为循环移位矩阵。
第二方面，提供一种Polar码传输方法，发送端将待编码的部分或全部比特序列U进行Polar码编码，生成编码序列，所述U的长度为N；所述发送端采用交织矩阵P X，对所述编码序列进行交织。其中，将U中特定位置的固定比特设置为1。
在一个可能的设计中，若U中第N/2位置的比特为固定比特，则U中第N/2位置的固定比特被设置为1；或者，若U中第N/2位置的比特为信息比特，且U中第N/4位置的比特为固定比特，则U中第N/4位置的比特设置为1；或者，若U中第一个信息比特的序号大于N/4，则U中第一个信息比特沿polar码自然顺序之前的第N/4的固定比特位置被设置为1；或者，T u中与U的信息比特位置对应的列向量组成信息位变换矩阵，信息位变换矩阵中MxM上三角矩阵中行重最大的行在U中对应一个位置索引，若U中该位置索引沿polar码自然顺序之前的第N/4的比特是固定比特，则U中该位置索引沿polar码自然顺序之前的第N/4的固定比特被设置1。所述M为大于或等于2的正整数。可选的，若所述信 息位变换矩阵中存在至少两个M×M的上三角矩阵，则选择至少一个M×M的上三角矩阵执行上述处理。
在一个可能的设计中，所述交织矩阵为置换矩阵，可选的，为循环移位矩阵。
第三方面，提供一种Polar码传输装置，该装置具有实现上述第一方面和第一方面的任一种可能的设计中发送端行为的功能。所述功能可以通过硬件实现，也可以通过硬件执行相应的软件实现。所述硬件或软件包括一个或多个与上述功能相对应的模块。
在一个可能的设计中，当所述功能的部分或全部通过硬件实现时，所述Polar码传输装置包括：输入接口电路，用于获取部分或全部比特序列U；逻辑电路，用于执行上述第一方面和第一方面的任一种可能的设计中发送端的行为；输出接口电路，用于输出加扰和交织后的比特序列。
可选的，所述Polar码传输装置可以是芯片或者集成电路。
在一个可能的设计中，当所述功能的部分或全部通过软件实现时，所述Polar码传输装置包括：存储器，用于存储程序；处理器，用于执行所述存储器存储的所述程序，当所述程序被执行时，所述Polar码传输装置可以实现如上述第一方面和第一方面的任一种可能的设计中所述的方法。
可选的，上述存储器可以是物理上独立的单元，也可以与处理器集成在一起。
在一个可能的设计中，当所述功能的部分或全部通过软件实现时，所述Polar码传输装置包括处理器。用于存储程序的存储器位于所述编码装置之外，处理器通过电路/电线与存储器连接，用于读取并执行所述存储器中存储的程序。
第四方面，提供一种Polar码传输装置，该装置具有实现上述第二方面和第二方面的任一种可能的设计中发送端行为的功能。所述功能可以通过硬件实现，也可以通过硬件执行相应的软件实现。所述硬件或软件包括一个或多个与上述功能相对应的模块。
在一个可能的设计中，当所述功能的部分或全部通过硬件实现时，所述Polar码传输装置包括：输入接口电路，用于获取部分或全部比特序列U；逻辑电路，用于执行上述第一方面和第一方面的任一种可能的设计中发送端的行为；输出接口电路，用于输出交织后的比特序列。
可选的，所述Polar码传输装置可以是芯片或者集成电路。
在一个可能的设计中，当所述功能的部分或全部通过软件实现时，所述Polar码传输装置包括：存储器，用于存储程序；处理器，用于执行所述存储器存储的所述程序，当所述程序被执行时，所述Polar码传输装置可以实现如上述第一方面和第一方面的任一种可能的设计中所述的方法。
可选的，上述存储器可以是物理上独立的单元，也可以与处理器集成在一起。
在一个可能的设计中，当所述功能的部分或全部通过软件实现时，所述Polar码传输装置包括处理器。用于存储程序的存储器位于所述编码装置之外，处理器通过电路/电线与存储器连接，用于读取并执行所述存储器中存储的程序。
第五方面，提供了一种无线通信系统，该系统包括第三方面所述的装置，和第四方面所述的装置。
第六方面，提供了一种计算机存储介质，用于存储计算机程序，该计算机程序包括用于执行第一方面、第二方面、第一方面的任一可能的实施方式或第二方面的任一可能的实施方式中的方法的指令。
第七方面，提供了一种包含指令的计算机程序产品，当其在计算机上运行时，使得计算机执行上述各方面所述的方法。
附图说明
图1为现有技术中发送端PBCH的处理过程示意图；
图2为现有技术中接收端PBCH的处理过程示意图；
图3为本申请实施例中无线通信系统示意图；
图4为本申请实施例中Polar码的代数特性示意图；
图5为本申请实施例中Polar码的累进交织和加扰的方式示意图之一；
图6为本申请实施例中接收端译码和解交织方式示意图之一；
图7为本申请实施例中接收端盲检流程示意图之一；
图8为本申请实施例中Polar码的累进加扰和交织的方式示意图；
图9为本申请实施例中接收端译码和解交织方式示意图之二；
图10为本申请实施例中接收端盲检流程示意图之二；
图11为本申请实施例中Polar码的累进交织和加扰的方式示意图之二；
图12为本申请实施例中Polar码传输方法流程示意图；
图13a～图13c为本申请实施例中变换矩阵示意图；
图14a～图14c为本申请实施例中信息位变换矩阵示意图；
图15为本申请实施例中信息位变换矩阵中上三角矩阵示意图；
图16为本申请实施例中发送端分段循环移位示意图；
图17为本申请实施例中Polar码传输装置结构示意图之一；
图18为本申请实施例中Polar码传输装置结构示意图之二；
图19为本申请实施例中Polar码传输装置结构示意图之三；
图20为本申请实施例中Polar码传输装置结构示意图之四。
具体实施方式
下面将结合附图，对本申请实施例进行详细描述。
如图3所示，本申请实施例应用的无线通信系统300中包括发送端301和接收端302。其中，发送端301可以为网络设备，接收端302为终端；或者，发送端301为终端，接收端302为网络设备。该网络设备可以是基站，也可以是基站与基站控制器集成后的设备，还可以是具有类似通信功能的其它设备。
需要说明的是，本申请实施例提及的无线通信系统包括但不限于：窄带物联网系统(英文：Narrow Band-Internet of Things，简称：NB-IoT)、全球移动通信系统(英文：Global System for Mobile Communications，简称：GSM)、增强型数据速率GSM演进系统(英文：Enhanced Data rate for GSM Evolution，简称：EDGE)、宽带码分多址系统(英文：Wideband Code Division Multiple Access，简称：WCDMA)、码分多址2000系统(英文：Code Division Multiple Access，简称：CDMA2000)、时分同步码分多址系统(英文：Time Division-Synchronization Code Division Multiple Access，简称：TD-SCDMA)，长期演进系统(英文：Long Term Evolution，简称：LTE)、下一代5G移动通信系统的三大应用场景eMBB，URLLC和eMTC 或者将来出现的新的通信系统。
本申请实施例中所涉及到的终端可以包括各种具有无线通信功能的手持设备、车载设备、可穿戴设备、计算设备或连接到无线调制解调器的其它处理设备。所述终端可以是MS(英文：Mobile Station)、用户单元(英文：subscriber unit)、蜂窝电话(英文：cellular phone)、智能电话(英文：smart phone)、无线数据卡、个人数字助理(英文：Personal Digital Assistant，简称：PDA)电脑、平板型电脑、无线调制解调器(英文：modem)、手持设备(英文：handset)、膝上型电脑(英文：laptop computer)、机器类型通信(英文：Machine Type Communication, 简称：MTC)终端等。
本申请实施例将Polar码编码方式应用到PBCH中，将Polar码编码后的编码序列进行加扰和交织，避免了当待编码的比特序列为全0向量时，不同时序发送的Polar码完全相同从而导致的时序混淆，有助于Polar码编码方式更好的应用到PBCH中。
为方便对本申请实施例的理解，下面对Polar码作简单介绍。
Polar码的编码策略利用无噪信道传输用户有用的信息，全噪信道传输约定的信息或者不传信息。Polar码也是一种线性块码，其编码矩阵为GN，编码过程为
Figure PCTCN2018085711-appb-000001
其中
Figure PCTCN2018085711-appb-000002
是一个二进制的行矢量，长度为N(即码长)；G N是一个N×N的矩阵，且
Figure PCTCN2018085711-appb-000003
定义为log 2 N个矩阵F 2的克罗内克(Kronecker)乘积。上述矩阵
Figure PCTCN2018085711-appb-000004
Polar码的编码过程中，
Figure PCTCN2018085711-appb-000005
中的一部分比特用来携带信息，称为信息比特集合，这些比特的索引的集合记作
Figure PCTCN2018085711-appb-000006
另外的一部分比特设置为接收端和发送端预先约定的固定值，称之为固定比特集合或冻结比特集合(frozen bits)，其索引的集合用
Figure PCTCN2018085711-appb-000007
的补集
Figure PCTCN2018085711-appb-000008
表示。Polar码的编码过程相当于：
Figure PCTCN2018085711-appb-000009
这里，G N(A)是G N中由集合
Figure PCTCN2018085711-appb-000010
中的索引对应的那些行得到的子矩阵，G N(AC)是G N中由集合
Figure PCTCN2018085711-appb-000011
中的索引对应的那些行得到的子矩阵。
Figure PCTCN2018085711-appb-000012
为
Figure PCTCN2018085711-appb-000013
中的信息比特集合，数量为K；
Figure PCTCN2018085711-appb-000014
为
Figure PCTCN2018085711-appb-000015
中的固定比特集合，其数量为(N-K)，是已知比特。这些固定比特通常被设置为0，但是只要接收端和发送端预先约定，固定比特可以被任意设置。从而，Polar码的编码输出可简化为：
Figure PCTCN2018085711-appb-000016
这里
Figure PCTCN2018085711-appb-000017
为
Figure PCTCN2018085711-appb-000018
中的信息比特集合，
Figure PCTCN2018085711-appb-000019
为长度K的行矢量，即
Figure PCTCN2018085711-appb-000020
|·|表示集合中元素的个数，K为信息块大小，
Figure PCTCN2018085711-appb-000021
是矩阵G N中由集合
Figure PCTCN2018085711-appb-000022
中的索引对应的那些行得到的子矩阵，
Figure PCTCN2018085711-appb-000023
是一个K×N的矩阵。
Polar码的构造过程即集合
Figure PCTCN2018085711-appb-000024
的选取过程， 决定了Polar码的性能。Polar码的构造过程通常是，根据母码码长N确定共存在N个极化信道，分别对应编码矩阵的N个行，计算极化信道可靠度，将可靠度较高的前K个极化信道的索引作为集合
Figure PCTCN2018085711-appb-000025
的元素，剩余(N-K)个极化信道对应的索引作为固定比特的索引集合
Figure PCTCN2018085711-appb-000026
的元素。集合
Figure PCTCN2018085711-appb-000027
决定了信息比特的位置，集合
Figure PCTCN2018085711-appb-000028
决定了固定比特的位置。
以上为常规的Polar码的编码方式，基于上述常规的Polar码的编码方式，本申请实施例中，第一种情况，待编码的比特序列长度为N，可以适用于两种情况，待编码的比特序列长度与母码长度相同，均为N；或者，第一种情况，母码长度为d*N， 即待编码的序列 被分成了等长的d个部分，U为d个部分中的任意一部分，d为2的指数次方。在第二种情况下，G N可以认为N长的待编码序列对应的编码矩阵1/d个部分。
第二种情况下，母码长度为d*N的Polar的编码矩阵为：
Figure PCTCN2018085711-appb-000029
其中母码长度为N的Polar的编码矩阵为：
Figure PCTCN2018085711-appb-000030
两者的关系为：
Figure PCTCN2018085711-appb-000031
Figure PCTCN2018085711-appb-000032
为Kronecke积。
基于累进交织的Polar码可以实现隐式传输，携带隐式信息。本申请实施例中，在基于累进交织的基础上增加了加扰的方式，可以认为是一种基于累进交织和加扰的Polar码，这种基于累进交织和加扰的Polar码的方法可以但不限于应用于以下应用场景：场景一、PBCH的时序隐式传输，可以同时支持多次传输的软合并和时序的盲检测。场景二、超高可靠低时延通信(英文：Ultra-reliable and Low Latency Communications，URLLC)中隐式信息传输，可以同时支持多分并发传输和某种信息的盲检测。场景三、一般的单次传输，支持某种信息的盲检测。
下面介绍一下基于累进交织和加扰的Polar码传输隐式信息的实现方法。
一、Polar码的加扰特性
Polar编码过程可表示为u·G N＝x，其中u是1xN待编码向量，x是1xN的编码后向量,G N是NxN编码矩阵。根据矩阵相乘的性质，(u+p)·G N＝x+q，其中p·G N＝q， p和q都为1xN向量，分别可以看做对u和x的加扰向量。
二、Polar码的代数特性
基于第一点所述的Polar码的加扰特性，可以获得如图4所示的代数特性。
图4中，F为Polar码的待编码待编码向量u中的固定比特集合，包括(N-K)个元素。I为Polar码的待编码待编码向量U中的待编码信息，包括K个元素，其中包括信息比特和校验比特。校验方式均以CRC为例，校验比特即为CRC比特。U为Polar码的待编码信息向量或待编码的比特序列，为1xN的向量。P x为NxN的矩阵，表示对输入比特向量乘以Px操作，可选的，P x为置换矩阵，即行列变换矩阵，每行每列均只有一个元素1。对输入比特向量乘以Px，由于Px是行列变换矩阵，相当于对输入bit向量做交织操作。更一般的，Px可以称为交织矩阵。Tu为NxN的矩阵，表示对输入bit向量乘以Tu操作。S X和S U均为1xN向量，表示输入比特向量进行加扰操作。
若T u＝G N·P x·G N，S X＝S U·G N，则图4中上半部分和下半部分操作流程实现的结果是等价的，所输出的比特序列是相同的。本申请实施例中，T u可称为变换矩阵，Px可以称为交织矩阵，S X和S U均可称为加扰向量。
将图4中Tu和Su操作位置互换，编码方法依然等价。将图4中Px和Sx操作的位置互换，两种编码方法同样依然等价。
具体地，图4上半部分中，固定比特集合F和信息比特集合I组成待编码的信息向量U，U与变换矩阵T u相乘，S U对U与变换矩阵T u相乘后输出的向量进行加扰操作，加扰后 的向量经过编码矩阵G N编码，输出编码后的比特序列。图4下半部分中，固定比特集合F和信息比特集合I组成待编码的信息向量U，U经过编码矩阵G N编码，编码后的向量与交织矩阵P x相乘，S X对编码后的向量与P x相乘后得到的向量进行加扰操作，输出加扰后的比特序列。
三、基于累进交织和加扰的Polar码传输方法
基于第一点所述的Polar码的代数特性，可以设计一种累进交织和加扰的方式，通过交织和加扰的次数m来传输隐式信息。
如图5所示，交织和加扰的次数m不同，可以输出不同的版本，即输出不同的比特序列。不同的版本携带隐式信息m，m可被用于描述天线端口、载波位置、时序等各种信息。m取值从0～M-1，M的值可以由收发双方约定。图5中，交织和加扰次数m分别取值为0～M-1时，输出版本用SS#0～SS#M-1来表示。累进交织和加扰可以理解为每一层在上一层交织和加扰的基础上再进行交织和加扰操作。同理，图5中上半部分和下半部分在操作流程实现的结果是等价的，所输出的比特序列是相同的。
发送端发送的不同的版本所携带的隐式信息m是不同的，接收端在接收到译码序列后，通过图5所示流程的反向流程进行盲检，可以根据m获得隐式信息，例如可以获得时序信息，即该版本对应传输的时序。另外，接收端还可以将接收到的不同版本实现软合并，然后再进行译码，在信道条件不好的情况下有助于成功译码。具体地，如图6所示，接收端接收到的待译码的版本用LLR#m、LLR#m+1、LLR#m+2……LLR#m+j表示，接收端通过如图6所示的流程进行与图5所示流程的逆向操作。其中，Sx表示对对数似然比(Log Likely Ratio，LLR)向量进行加扰，LLR在接受符号解调后得到，用于表征该比特为0和为1的概率。在二进制条件下，加扰和解扰操作相同。Px -1表示对输入的LLR向量解交织操作。解交织操作得到的不同LLR相加，对相加后的信号进行Polar译码，得到译码后的向量。例如，一种可选的实现方式中，Polar译码方式采用常规的串行干扰消除(success cancellation list，SCL)-x Polar译码方式，获取x个译码向量，可以根据PM绝对值从小到大对x个译码向量进行排序，得到
Figure PCTCN2018085711-appb-000033
当然，也可以通过其他的Polar译码方式，本申请中不作限定。
如图7所示，接收端在得到x个译码向量之后，进行盲检，获取数据信息和隐式信息m。可以采用5所示流程的上半部分的反向流程，具体步骤如下所述。
步骤701、接收端接收x个译码向量，初始的隐式信息m为0，CRC检测计数的初始值i＝1。
步骤702、接收端选择第i个译码向量
Figure PCTCN2018085711-appb-000034
步骤703、对译码向量
Figure PCTCN2018085711-appb-000035
使用S U进行加扰。以及对获得的加扰后的向量乘以Tu -1进行解变换。
重复执行步骤703共m次。
步骤704、提取步骤703解变换后的数据信息，该数据信息中包括信息比特和CRC比特。
步骤705、接收端对数据信息进行CRC检测。
步骤706、接收端判断CRC检测是否通过，若是，则获取到信息比特和本轮校验使用的隐式信息m，否则，执行步骤707。
步骤707、接收端判断m是否小于M-1，若是，执行步骤708，否则，执行步骤709。
步骤708、执行m++，即按照m＝m+1更新m，并返回执行步骤703。
步骤709、接收端判断i是否小于CRC检测大小(英文：check size)，若是，则执行 步骤710，否则，判定译码失败。其中，CRC检测大小是预定义的。
步骤710、执行i++，即按照i＝i+1更新i，并返回执行步骤702。
如上所述，将图5中加扰和交织的顺序互换，可以实现相同效果，且数学上可以完全等价。以类似图5中下半部分为例，将加扰和交织的顺序互换，得到如图8所示的流程。其中，图5中所用的S X将假设记为S X-1,，图8中所用的S X将假设记为S X-2，S X-1,与S X-2满足以下关系：
当U的长度与母码长度相同时
Figure PCTCN2018085711-appb-000036
S X-1＝S U-1·G N，S X-2＝S U-2·G N；
当U的长度为N，母码长度为Nxd时，S X-1与S U-1的关系、以及S X-2与S U-2的关系可以引用分段式Polar码的加扰向量变换规则。
本申请实施例中，可以定义分段式Polar码的加扰向量变换规则为：对于Nxd长的polar码，首先确定每一段在u上的加扰向量S u1,S u2,...,S ud，然后将其拼成一个长的Nxd的向量[S u1,S u2,...,S ud]，对其乘以Nxd的polar码编码矩阵，得到[S x1,S x2,...,S xd]，其中S x1,S x2,...,S xd为分别与S u1,S u2,...,S ud对应加扰向量。公式如下：[S u1,S u2,...,S ud]·G N×d＝[S x1,S x2,...,S xd]。
为方便对比，图5和图8中的加扰向量均用S X示意。
加扰和交织的次数m不同，可以输出不同的版本，即输出不同的比特序列。m取值从0～M-1，M的值可以由收发双方约定。加扰和交织次数m分别取值为0～M-1时，输出版本用SS#0～SS#M-1来表示。累进交织和加扰可以理解为每一层在上一层交织和加扰的基础上再进行交织和加扰操作。
同样，接收端在接收到译码序列后，通过图8所示流程的反向流程进行盲检，可以根据m获得隐式信息。具体地，如图9所示，接收端接收到的待译码的版本用LLR#m、LLR#m+1、LLR#m+2……LLR#m+j表示，Px -1表示对输入的LLR向量解交织操作。Sx表示对解交织操作后的向量进行加扰，加扰和解扰操作相同。Sx加扰后得到的不同LLR相加，对相加后的信号进行常规的SCL-x Polar译码，获取x个译码向量，可以根据PM绝对值从小到大对x个译码向量进行排序，得到
Figure PCTCN2018085711-appb-000037
如图10所示，接收端在得到x个译码向量之后，进行盲检，获取数据信息和隐式信息m。可以采用5所示流程的上半部分的反向流程，具体步骤如下所述。
步骤1001、接收端接收x个译码向量，初始的隐式信息m为0，CRC检测计数的初始值i＝1。
步骤1002、接收端选择第i个译码向量
Figure PCTCN2018085711-appb-000038
步骤1003、对译码向量
Figure PCTCN2018085711-appb-000039
乘以Tu -1进行解变换，使用S U对解变换后的的向量进行加扰。
重复执行步骤1003共m次。
步骤1004、提取步骤1003解变换后的数据信息，该数据信息中包括信息比特和CRC比特。
步骤1005、接收端对数据信息进行CRC检测。
步骤1006、接收端判断CRC检测是否通过，若是，则获取到信息比特和本轮校验使用的隐式信息m，否则，执行步骤10010。
步骤1007、接收端判断m是否小于M-1，若是，执行步骤10010，否则，执行步骤1009。
步骤1008、接收端执行m++，即按照m＝m+1更新m，并返回执行步骤1003。
步骤1009、接收端判断i是否小于CRC检测大小(英文：check size)，若是，则执行步骤1010，否则，判定译码失败。其中，CRC检测大小是预定义的。
步骤1010、接收端执行i++，即按照i＝i+1更新i，并返回执行步骤1002。
通过以上描述可知，发送端每次发送的数据，经过m次变换和加扰，隐式信息m被携带，不同次发送的数据可以是不同时间、不同频率上的。
针对单次发送的数据，如图11所示，经过m次交织和加扰，可以在经过编码矩阵G N编码之前通过变换矩阵Tu和加扰向量Su进行交织和加扰，也可以在经过编码矩阵G N编码之后通过交织矩阵Px和加扰向量Sx进行交织和加扰。当然，交织和加扰两个步骤的操作顺序可以互换，在实现效果上是等价的。
基于上述描述，下面详细介绍一下本申请实施例提供的Polar码传输方法，如图12所示，本申请实施例中，Polar码传输方法的具体流程如下所述。
步骤1201、发送端将待编码的部分或全部比特序列U进行Polar码编码，生成编码序列。
其中，U的长度为N；
步骤1202、发送端采用加扰序列S X和交织矩阵P X，对编码序列进行加扰和交织。
具体地，步骤1201中所述的比特序列U可以适用于两种情况。第一种情况，母码长度为N，U的长度与母码长度相同。第二种情况，母码长度为d*N，即待编码的序列被分成了等长的d个部分，U为d个部分中的任意一部分，d为2的指数次方。在第二种情况下，G N可以认为N长的待编码序列对应的编码矩阵1/d个部分。
为方便说明，首先介绍一下如何从T u m中提取信息位变换矩阵，信息位变换矩阵为T u m中与U的信息比特位置对应的列向量组成的矩阵，1≤m≤M-1。根据m的不同取值，U经历变换和加扰的次数不同，不同次数的传输版本对应不同的T u m。以N＝16、信息比特长度K为8为例，P X为循环移位矩阵，偏移量为N/4，一共支持4个传输版本，对应的变换矩阵为I、T u 1、T u 2、T u 3。其中，T u 1、T u 2、T u 3分别如图13a～图13c所示。U中信息比特位置为{8 10 11 12 13 14 15 16}，分别将T u 1、T u 2、T u 3中位置索引为{8 10 11 12 13 1415 16}的行和列取出，生成T uA，T uA 2，T uA 3为信息位变换矩阵，分别如图14a、图14b和图14c所示，T uA，T uA 2，T uA 3为8x8的矩阵，T uA，T uA 2，T uA 3分别T u 1、T u 2、T u 3的子矩阵。
以下介绍一下对于第一种情况和第二种情况下如何确定加扰序列S X。由于S X＝S U·G N，因此，也可以通过确定S U来确定S X。
第一种情况下，可以但不限于通过以下几种方式确定S X。
1)、若U中第N/2位置的比特为信息比特，且U中第N/4位置的比特为固定比特，则Sx中第1至第N/2位置的比特设置为1，Sx中序号从0开始编号的话，则将Sx中第0至第(N/2)-1位置的比特设置为1；或者，若U中第N/2位置的比特为信息比特，且U中第N/4位置的比特为固定比特，则Su中第N/2位置的比特设置为1。
2)、若U中第N/4位置的比特为固定比特，则Su中与U中第一个信息比特位置对应的比特被设置为1。
3)、T u中与U的信息比特位置对应的列向量组成信息位变换矩阵，Su中与信息位变换矩阵中M×M的上三角矩阵中行重最大的行在Tu中的位置对应的比特被设置为1，M为大于或等于2的正整数。
可选的，若信息位变换矩阵中存在至少两个M×M的上三角矩阵，则Su中与至少一个M×M的上三角矩阵中行重最大的行在Tu中的位置对应的比特被设置为1。
例如，在信息位变换矩阵T uA m中可能找到不止一个2x2上三角矩阵，1≤m≤M-1，图 15中两个虚线矩形框出的部分为其中一个2x2上三角矩阵。如，在T uA 2中只能找到一个2x2上三角矩阵，在T uA 3中能找到多个2x2上三角矩阵，并且存在一个3x3上三角矩阵。
第二种情况下，可以但不限于通过以下几种方式确定S u。
1、若U中第N/2位置的比特为信息比特，且U中第N/4位置的比特为固定比特，则Su中第N/2位置的比特设置为1。
2、若U中第N/4位置的比特为固定比特，Su中与U中第一个信息比特位置对应的比特被设置为1。
3、T u中与U的信息比特位置对应的列向量组成信息位变换矩阵，Su中与信息位变换矩阵中M×M的上三角矩阵中行重最大的行在Tu中的位置对应的比特被设置为1，M为大于或等于2的正整数。可选的，若所述信息位变换矩阵中存在至少两个M×M的上三角矩阵，则所述Su中与至少一个M×M的上三角矩阵中行重最大的行在Tu中的位置对应的比特被设置为1。
确定S u之后，通过分段式Polar码的加扰向量变换规则计算S x。
通过上述图12所示的方法，避免了当待编码的比特序列U为全0向量时，不同时序发送的Polar码完全相同从而导致的时序混淆，有助于Polar码编码方式更好的应用到PBCH中。
另一种可能的实现方式中，加扰序列S X可能为全0向量，更一般的，发送端也可以省略加扰步骤，即在步骤1202中，发送端只采用交织矩阵P X对所述编码序列进行交织，而省略加扰步骤。在这种情况下，可以通过将U中特定位置的固定比特设置为1的方式，来解决U为全零向量导致的时序混淆的问题。
具体地，可以包括以下几种设置规则。
第一种规则：若U中第N/2位置的比特为固定比特，则U中第N/2位置的固定比特被设置为1。
第二种规则：若U中第N/2位置的比特为信息比特，且U中第N/4位置的比特为固定比特，则U中第N/4位置的比特设置为1。
第三种规则：若U中第一个信息比特的序号大于N/4，则U中第一个信息比特沿polar码自然顺序之前的第N/4的固定比特位置被设置为1。
第四种规则：T u中与U的信息比特位置对应的列向量组成信息位变换矩阵，信息位变换矩阵中MxM上三角矩阵中行重最大的行在U中对应一个位置索引，若U中该位置索引沿polar码自然顺序之前的第N/4的比特是固定比特，则U中该位置索引沿polar码自然顺序之前的第N/4的固定比特被设置1。M为大于或等于2的正整数。
可选的，若信息位变换矩阵中存在至少两个MxM上三角变换矩阵，则至少选一个MxM上三角变换矩阵进行上述处理。
下面结合具体的应用场景对加扰向量S X的确定或者U中被设置为1的固定比特位置的确定方式进行详细说明。
原始方案：
假设交织矩阵P X为循环移位矩阵，在步骤1202没有加扰操作、且不采用本申请实施例上述提供的U中特定固定比特位置被设置为1的方案时，只采用循环移位矩阵进行循环移位，只能在不改变构造的情况下最多产生4个版本，无法支持更多版本。
以Px为循环移位矩阵，偏移量为N/4为例，在Tu，Tu 2，…，Tu M-1中，U中的信息比特所对应的行列构成一组信息位变换矩阵：Tu A，Tu A 2，…，Tu A M-1，下标A表示抽取信息位变换矩阵Tu m中信息比特所对应的行列，1≤m≤M-1。
抽取信息位变换矩阵Tu m中一些行列可发现存在以下子矩阵：
2x2上三角变换矩阵
Figure PCTCN2018085711-appb-000040
最多产生2个版本；3x3上三角变换矩阵
Figure PCTCN2018085711-appb-000041
最多产生4个版本；4x4上三角变换
Figure PCTCN2018085711-appb-000042
最多产生4个版本。所谓版本，即对于一份待编码的序列，可通过累进交织产生的不同版本的发送单元，不同版本的发送单元在不同时序发送，接收端能够通过不同版本交织次数获知时序信息，并可以对不同版本的发送单元实现软合并。
本申请实施例提供的方案：
以上述第4)种确定Su的方式为例进行介绍。
应用场景1、Px偏移量为N/2。支持2个传输版本。
在信息位变换矩阵中找到2x2上三角矩阵，根据polar码构造，确定2x2上三角矩阵中行重最大的行在U中的位置索引，将Su中该位置索引对应的Su元素置为1。
应用场景2、Px偏移量为N/4。支持4个传输版本，
在信息位变换矩阵中找到3x3上三角矩阵，根据polar码构造，确定3x3上三角矩阵中行重最大的行在U中的位置索引，将Su中该位置索引对应的Su元素置为1。
需要说明的是，当有至少两个个2x2或者3x3上三角矩阵时，至少选择其中一个上三角矩阵进行上述操作。如果只选其中一个上三角矩阵，可以选择在polar排序中最靠前的。
举例说明，以四个传输版本为例，相当于U分别乘以变换矩阵Tu 0、1、2、3次，即U乘以I，Tu，Tu^2,Tu^3，I为单位矩阵。取出I，Tu，Tu^2,Tu^3这四个矩阵中为U的信息比特位置对应的行和列，记为信息位变换矩阵：I，T uA，T uA 2，T uA 3,将这四个信息位变换矩阵按行求和，获取它们行重最大位置的序号在U中自然序号的位置，将Su中这个自然序号位置的比特设置为1。
以N＝512，K＝40的polar码为例，信息比特使用PW序列构造，对I，T uA，T uA 2，T uA 3这四个矩阵观察可见，T uA 3矩阵中第一行行重最大。该第一行在U中序号为256，则Su(256)＝1。
这样，可以通过加扰操作解决全零混淆的问题。
如上述原始方案所述，2x2上三角矩阵结构只支持2份传输版本不重复，其余结构支持4份传输版本不重复。实际上，能支持传输版本不重复的最大数目取决于Tu中能提取的最大上三角矩阵维度。如果在上述变换后引入一个加扰，比如在上三角矩阵行重最大行对应的位置每次都引入加扰“1”，则上述2x2上三角矩阵结构可支持4份不重复，4x4上三角矩阵结构可支持8份不重复。
下面对传输版本增加方式进行详细描述。
(1)对Polar码字进行循环移位的处理，这种情况只有在高码率情况下能够出现。
其中高码率的定义为U的第N/4位置为信息比特，此时信息比特的变换矩阵能够出现行重为4，即存在4x4上三角变换的情况，将Su中与4x4上三角变换中行重最大的行在Tu中的位置对应的比特设置为1。
以Su中第N/4位置的比特被设为1为例，编码后的比特序列呈现出经典规律：
如果U表示为[a b c d]，输出的8个传输版本分别如表1所示，用#1～#8表示。其中，
Figure PCTCN2018085711-appb-000043
表示异或操作，即加扰。
表1
Figure PCTCN2018085711-appb-000044
Su中被设为1的元素序号小于等于N/4，相应的也能产生8个传输版本，具体形式与表1不同而已。
(2)母码长度为d*N，即待编码的序列被分成了等长的d个部分，U为d个部分中的任意一部分，d为2的指数次方。例如，d为2份，4份，或者8份。每一个部分均进行相同的循环移位。对于Px对应的变换矩阵Tu，根据构造取出其信息位变换矩阵。找到信息位变换矩阵中行重大于4的行，将Su中对应位置的比特设为1。
例如N＝512，K＝40的polar码，设d＝8,不同的信息位变换矩阵Tu m中只有一个4x4的上三角矩阵，该4x4的上三角矩阵中行重最大的行在信息位变换矩阵排序第10个，对应U中的排序为464，则将Su中464位置的比特设为1。
在加扰的情况下，在Px偏移量为N/4方案基础上，即4份循环移位方案基础上，能够产生8个传输版本，并且接收端的软合并和盲检只用一套规则即可。具体传输版本的增加情况如表2所示。
表2
Figure PCTCN2018085711-appb-000045
如图16所示，为发送端分段循环移位示意图。
基于图12所示的Polar码传输方法的同一发明构思，如图17所示，本申请实施例还提供一种Polar码传输装置1700，该Polar码传输装置1700用于执行图12所示的Polar码传输方法。包括：
接收单元1701，用于获取待编码的部分或全部比特序列U；
处理单元1702，用于将接收单元1701获取的待编码的部分或全部比特序列U进行Polar码编码，生成编码序列，U的长度为N；
处理单元1702，还用于采用加扰序列S X和交织矩阵P X，对编码序列进行加扰和交织。
可选的，母码长度为N，U的长度与母码长度相同，其中：
若U中第N/2位置的比特为信息比特，且U中第N/4位置的比特为固定比特，则Sx中第1至第N/2位置的比特设置为1；或者，
若U中第N/4位置的比特为固定比特，S X＝S U·G N，G N为Polar码的生成矩阵，Su为1×N的向量，Su中与U中第一个信息比特位置对应的比特被设置为1；或者，
S X＝S U·G N，G N·P x·G N＝T u，G N为Polar码的生成矩阵，Su为1×N的向量，T u为变换矩阵，T u中与U的信息比特位置对应的列向量组成信息位变换矩阵，Su中与信息位变换矩阵中M×M的上三角矩阵中行重最大的行在Tu中的位置对应的比特被设置为1，M为大于或等于2的正整数。
可选的，母码长度为d*N，待编码的序列被分成了等长的d个部分，U为d个部分中的任意一部分，d为2的指数次方；：
若U中第N/2位置的比特为信息比特，且U中第N/4位置的比特为固定比特，则Su中第N/2位置的比特设置为1；或者，
若U中第N/4位置的比特为固定比特，S X＝S U·G N，G N为Polar码的生成矩阵，Su为1×N的向量，Su中与U中第一个信息比特位置对应的比特被设置为1；或者，
S X＝S U·G N，G N·P x·G N＝T u，G N，G N为Polar码的生成矩阵，Su为1×N的向量，T u为变换矩阵，T u中与U的信息比特位置对应的列向量组成信息位变换矩阵，Su中与信息位变换矩阵中M×M的上三角矩阵中行重最大的行在Tu中的位置对应的比特被设置为1，M为大于或等于2的正整数。
可选的，处理单元1702用于：
对编码序列进行先加扰后交织；或者，
对编码序列进行先交织后加扰。
可选的，若信息位变换矩阵中存在至少两个M×M的上三角矩阵，则Su中与至少一个M×M的上三角矩阵中行重最大的行在Tu中的位置对应的比特被设置为1。
可选的，交织矩阵包括循环移位矩阵。
基于图12所示的Polar码传输方法的同一发明构思，如图18所示，本申请实施例中还提供一种Polar码传输装置1800，该Polar码传输装置1800用于执行图12所示的Polar码传输方法。上述实施例的Polar码传输方法中的部分或全部可以通过硬件来实现也可以通过软件来实现，当通过硬件实现时，所述Polar码传输装置1800包括：输入接口电路1801，用于获取待编码的部分或全部比特序列U；逻辑电路1802，用于执行上述图12所示的Polar码传输方法，具体请见前面方法实施例中的描述，此处不再赘述；输出接口电路1803，用于输出加扰交织后的比特序列。
可选的，Polar码传输装置1800在具体实现时可以是芯片或者集成电路。
可选的，当上述实施例的Polar码传输方法中的部分或全部通过软件来实现时，如图19所示，Polar码传输装置1800包括：存储器1901，用于存储程序；处理器1902，用于执行存储器1901存储的程序，当程序被执行时，使得Polar码传输装置1800可以实现上述实施例提供的Polar码传输方法。
可选的，上述存储器1901可以是物理上独立的单元，也可以如图20所示，存储器1901与处理器1902集成在一起。
可选的，当上述实施例的编码方法中的部分或全部通过软件实现时，Polar码传输装置1800也可以只包括处理器1902。用于存储程序的存储器1901位于Polar码传输装置1800之外，处理器1902通过电路/电线与存储器1901连接，用于读取并执行存储器1901中存 储的程序。
本申请实施例提供了一种计算机存储介质，用于存储计算机程序，该计算机程序包括用于执行图12所示的Polar码传输方法。
本申请实施例提供了一种包含指令的计算机程序产品，当其在计算机上运行时，使得计算机执行图12所示的Polar码传输方法。
本领域内的技术人员应明白，本申请的实施例可提供为方法、系统、或计算机程序产品。因此，本申请可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。而且，本申请可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。
本申请是参照根据本申请实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器，使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中，使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品，该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上，使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。
尽管已描述了本申请的优选实施例，但本领域内的技术人员一旦得知了基本创造性概念，则可对这些实施例作出另外的变更和修改。所以，所附权利要求意欲解释为包括优选实施例以及落入本申请范围的所有变更和修改。
显然，本领域的技术人员可以对本申请实施例进行各种改动和变型而不脱离本申请实施例的精神和范围。这样，倘若本申请实施例的这些修改和变型属于本申请权利要求及其等同技术的范围之内，则本申请也意图包含这些改动和变型在内。

Claims (17)

  1. 一种Polar码传输方法，其特征在于，包括：
    发送端将待编码的部分或全部比特序列U进行Polar码编码，生成编码序列，所述U的长度为N；
    所述发送端采用加扰序列S X和交织矩阵P X，对所述编码序列进行加扰和交织。
  2. 如权利要求1所述的方法，其特征在于，母码长度为N，所述U的长度与母码长度相同，其中：
    若U中第N/2位置的比特为信息比特，且U中第N/4位置的比特为固定比特，则所述Sx中第1至第N/2位置的比特设置为1；或者，
    若U中第N/4位置的比特为固定比特，所述S X＝S U·G N，所述G N为Polar码的生成矩阵，所述Su为1×N的向量，所述Su中与U中第一个信息比特位置对应的比特被设置为1；或者，
    所述S X＝S U·G N，所述G N·P x·G N＝T u，所述G N为Polar码的生成矩阵，所述Su为1×N的向量，所述T u为变换矩阵，T u中与U的信息比特位置对应的列向量组成信息位变换矩阵，所述Su中与所述信息位变换矩阵中M×M的上三角矩阵中行重最大的行在Tu中的位置对应的比特被设置为1，所述M为大于或等于2的正整数。
  3. 如权利要求1所述的方法，其特征在于，母码长度为d*N，所述待编码的序列被分成了等长的d个部分，所述U为所述d个部分中的任意一部分，所述d为2的指数次方；所述：
    若U中第N/2位置的比特为信息比特，且U中第N/2位置的比特为固定比特，则所述Su中第N/4位置的比特设置为1；或者，
    若U中第N/4位置的比特为固定比特，所述S X＝S U·G N，所述G N为Polar码的生成矩阵，所述Su为1×N的向量，所述Su中与U中第一个信息比特位置对应的比特被设置为1；或者，
    所述S X＝S U·G N，所述G N·P x·G N＝T u，G N，所述G N为Polar码的生成矩阵，所述Su为1×N的向量，所述T u为变换矩阵，T u中与U的信息比特位置对应的列向量组成信息位变换矩阵，所述Su中与所述信息位变换矩阵中M×M的上三角矩阵中行重最大的行在Tu中的位置对应的比特被设置为1，所述M为大于或等于2的正整数。
  4. 如权利要求1～3任一项所述的方法，其特征在于，所述发送端对所述编码序列进行加扰和交织，包括：
    所述发送端对所述编码序列进行先加扰后交织；或者，
    所述发送端对所述编码序列进行先交织后加扰。
  5. 如权利要求2或3所述的方法，其特征在于，若所述信息位变换矩阵中存在至少两个M×M的上三角矩阵，则所述Su中与至少一个M×M的上三角矩阵中行重最大的行在Tu中的位置对应的比特被设置为1。
  6. 如权利要求1～5任一项所述的方法，其特征在于，所述交织矩阵包括循环移位矩阵。
  7. 一种Polar码传输装置，其特征在于，包括：
    接收单元，用于获取待编码的部分或全部比特序列U；
    处理单元，用于将所述接收单元获取的待编码的部分或全部比特序列U进行Polar码编码，生成编码序列，所述U的长度为N；
    所述处理单元，还用于采用加扰序列S X和交织矩阵P X，对所述编码序列进行加扰和 交织。
  8. 如权利要求7所述的装置，其特征在于，母码长度为N，所述U的长度与母码长度相同，其中：
    若U中第N/2位置的比特为信息比特，且U中第N/4位置的比特为固定比特，则所述Sx中第1至第N/2位置的比特设置为1；或者，
    若U中第N/4位置的比特为固定比特，所述S X＝S U·G N，所述G N为Polar码的生成矩阵，所述Su为1×N的向量，所述Su中与U中第一个信息比特位置对应的比特被设置为1；或者，
    所述S X＝S U·G N，所述G N·P x·G N＝T u，所述G N为Polar码的生成矩阵，所述Su为1×N的向量，所述T u为变换矩阵，T u中与U的信息比特位置对应的列向量组成信息位变换矩阵，所述Su中与所述信息位变换矩阵中M×M的上三角矩阵中行重最大的行在Tu中的位置对应的比特被设置为1，所述M为大于或等于2的正整数。
  9. 如权利要求7所述的装置，其特征在于，母码长度为d*N，所述待编码的序列被分成了等长的d个部分，所述U为所述d个部分中的任意一部分，所述d为2的指数次方；所述：
    若U中第N/2位置的比特为信息比特，且U中第N/4位置的比特为固定比特，则所述Su中第N/2位置的比特设置为1；或者，
    若U中第N/4位置的比特为固定比特，所述S X＝S U·G N，所述G N为Polar码的生成矩阵，所述Su为1×N的向量，所述Su中与U中第一个信息比特位置对应的比特被设置为1；或者，
    所述S X＝S U·G N，所述G N·P x·G N＝T u，G N，所述G N为Polar码的生成矩阵，所述Su为1×N的向量，所述T u为变换矩阵，T u中与U的信息比特位置对应的列向量组成信息位变换矩阵，所述Su中与所述信息位变换矩阵中M×M的上三角矩阵中行重最大的行在Tu中的位置对应的比特被设置为1，所述M为大于或等于2的正整数。
  10. 如权利要求7～9任一项所述的装置，其特征在于，所述处理单元用于：
    对所述编码序列进行先加扰后交织；或者，
    对所述编码序列进行先交织后加扰。
  11. 如权利要求8或9所述的装置，其特征在于，若所述信息位变换矩阵中存在至少两个M×M的上三角矩阵，则所述Su中与至少一个M×M的上三角矩阵中行重最大的行在Tu中的位置对应的比特被设置为1。
  12. 如权利要求7～11任一项所述的装置，其特征在于，所述交织矩阵包括循环移位矩阵。
  13. 一种Polar码传输装置，其特征在于，包括：
    存储器，用于存储程序；
    处理器，用于执行所述存储器存储的所述程序，当所述程序被执行时，所述处理器用于执行如权利要求1～6任一项所述的方法。
  14. 如权利要求13所述的装置，其特征在于，所述装置为芯片。
  15. 一种芯片，其特征在于，包括：
    输入接口电路，用于获取部分或全部比特序列U；
    逻辑电路，用于执行上述如权利要求1～6任一项所述的方法；
    输出接口电路，用于输出交织后的比特序列。
  16. 一种计算机可读存储介质，其特征在于，所述计算机存储介质中存储有计算机可读指令，当计算机读取并执行所述计算机可读指令时，使得计算机执行如权利要求1-8任 意一项所述的方法。
  17. 一种计算机程序产品，其特征在于，当计算机读取并执行所述计算机程序产品时，使得计算机执行如权利要求1-8任意一项所述的方法。
PCT/CN2018/085711 2017-05-05 2018-05-04 一种Polar码传输方法及装置 WO2018202166A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP18794483.0A EP3614591B1 (en) 2017-05-05 2018-05-04 Polar code transmission method and device
US16/673,581 US11258463B2 (en) 2017-05-05 2019-11-04 Polar code transmission method and apparatus

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710314206.5 2017-05-05
CN201710314206.5A CN108809332B (zh) 2017-05-05 2017-05-05 一种Polar码传输方法及装置

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/673,581 Continuation US11258463B2 (en) 2017-05-05 2019-11-04 Polar code transmission method and apparatus

Publications (1)

Publication Number Publication Date
WO2018202166A1 true WO2018202166A1 (zh) 2018-11-08

Family

ID=64015873

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/085711 WO2018202166A1 (zh) 2017-05-05 2018-05-04 一种Polar码传输方法及装置

Country Status (4)

Country Link
US (1) US11258463B2 (zh)
EP (1) EP3614591B1 (zh)
CN (1) CN108809332B (zh)
WO (1) WO2018202166A1 (zh)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114598424A (zh) * 2017-02-15 2022-06-07 中兴通讯股份有限公司 一种数据处理方法及装置
EP3711169A1 (en) * 2017-11-15 2020-09-23 IDAC Holdings, Inc. Urllc transmissions with polar codes
CN111835474B (zh) * 2019-04-19 2021-07-23 大唐移动通信设备有限公司 一种基于pbch的信号处理方法及装置
CN115622572A (zh) * 2020-04-22 2023-01-17 华为技术有限公司 编码、译码方法、装置及设备
CN114915297A (zh) * 2021-02-09 2022-08-16 华为技术有限公司 一种编码和译码方法及相关装置

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140169492A1 (en) * 2012-12-18 2014-06-19 Samsung Electronics Co., Ltd. Communication system with compund coding mechanism and method of operation thereof
US20160182187A1 (en) * 2013-08-20 2016-06-23 Lg Electronics Inc. Method for transmitting data by using polar coding in wireless access system
CN107835063A (zh) * 2016-09-14 2018-03-23 华为技术有限公司 信息传输的方法、发送端设备和接收端设备

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7516390B2 (en) * 2005-01-10 2009-04-07 Broadcom Corporation LDPC (Low Density Parity Check) coding and interleaving implemented in MIMO communication systems
US20110216857A1 (en) * 2010-03-04 2011-09-08 Designart Networks Ltd Receiver for a wireless telecommunication system with a channel deinterleaver
CN102299735B (zh) * 2010-06-25 2014-03-12 普天信息技术研究院有限公司 一种降低Ir接口带宽的方法及分布式基站
CN102122966B (zh) * 2011-04-15 2012-11-14 北京邮电大学 基于信道极化的交错结构重复码的编码器及其编译码方法
CA2972643C (en) * 2014-03-21 2020-05-26 Huawei Technologies Co., Ltd. Polar code rate matching method and apparatus
CN109075900B (zh) * 2016-04-12 2020-10-23 华为技术有限公司 用于信号扩频和复用的方法和设备
US10728080B2 (en) * 2016-05-20 2020-07-28 Qualcomm Incorporated Polar codes and modulation mappings
CN115361090B (zh) * 2017-01-06 2024-04-16 Idac控股公司 基于检错的同步和广播信道
CN108575116B (zh) * 2017-01-09 2019-09-24 联发科技股份有限公司 比特映射方法及其发送装置
EP3501109B1 (en) 2017-04-01 2023-12-27 Huawei Technologies Co., Ltd. Polar code transmission method and apparatus
CN108880566B (zh) * 2017-05-15 2020-08-25 华为技术有限公司 一种Polar码传输方法及装置

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140169492A1 (en) * 2012-12-18 2014-06-19 Samsung Electronics Co., Ltd. Communication system with compund coding mechanism and method of operation thereof
US20160182187A1 (en) * 2013-08-20 2016-06-23 Lg Electronics Inc. Method for transmitting data by using polar coding in wireless access system
CN107835063A (zh) * 2016-09-14 2018-03-23 华为技术有限公司 信息传输的方法、发送端设备和接收端设备

Non-Patent Citations (6)

* Cited by examiner, † Cited by third party
Title
HUAWEI ET AL.: "Details of the Polar Code Design.", 3GPPTSG RAN WG1 MEETING #87 R1-1611254, 3 November 2016 (2016-11-03), Reno, USA, XP051189033 *
INTERDIGITAL COMMUNICATIONS: "Interleaver for Polar Codes", R1-1612656, 3GPP TSG RAN WG1 MEETING #87, 5 November 2016 (2016-11-05), Reno, USA, XP051190487 *
NOKIA ET AL.: "Polar Codes for Control Channels", R1-1609590, 3GPP TSG-RAN WG1 #86BIS, 30 September 2016 (2016-09-30), Lisbon, Portugal, XP051158781 *
NOKIA ET AL.: "Polar Codes for Control Channels", R1-1612284, 3GPP TSG-RAN WG1 #87, 4 November 2016 (2016-11-04), Reno, USA, XP051189260 *
See also references of EP3614591A4
SPREADTRUM COMMUNICATIONS: "Comparison of Polar and LDPC with Short Information Length for eMBB Scenario", R1-1611478, 3GPPTSG RAN WG1 MEETING #87, 4 November 2016 (2016-11-04), Reno, USA, XP051189083 *

Also Published As

Publication number Publication date
CN108809332B (zh) 2021-09-03
EP3614591A4 (en) 2020-05-06
EP3614591A1 (en) 2020-02-26
US20200067536A1 (en) 2020-02-27
US11258463B2 (en) 2022-02-22
CN108809332A (zh) 2018-11-13
EP3614591B1 (en) 2022-04-13

Similar Documents

Publication Publication Date Title
WO2018202166A1 (zh) 一种Polar码传输方法及装置
US20200295867A1 (en) Method and Apparatus for Encoding Data Using a Polar Code
US11689220B2 (en) Method and device for interleaving data
US11171741B2 (en) Polar code transmission method and apparatus
RU2691885C2 (ru) Способ согласования скорости полярного кода и устройство согласования скорости полярного кода
JP7471357B2 (ja) 符号化方法、復号方法、装置、および装置
US11075652B2 (en) Polar code transmission method and apparatus
JP6803969B2 (ja) 識別情報を搬送するための方法および装置
CN109257140B (zh) 一种极化信道可靠度排序的方法、极化码编码方法及装置
US11050510B2 (en) Polar code transmission method and apparatus
WO2018202140A1 (zh) 编码方法、装置和设备
WO2018146552A1 (en) Crc aided decoding of polar codes
WO2018127788A1 (en) Methods and apparatuses for spreading error detection bits in a polar code
CN113810061A (zh) Polar码编码方法、Polar码译码方法及其装置
CN110098891B (zh) 交织方法和交织装置
US10917275B2 (en) Information transmission method for reducing PAPR, transmitting terminal and receiving terminal
CN108809485B (zh) 一种编码的方法和装置
CN108574562A (zh) 数据传输方法及装置
CN113541698B (zh) 编码、译码方法、装置及设备
CN110785937B (zh) Crc和极化码传输方案
CN111525980B (zh) 译码方法及装置
CN115913451A (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: 18794483

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

Country of ref document: EP

Effective date: 20191120