WO2018196765A1 - Polar码传输方法及装置 - Google Patents

Polar码传输方法及装置 Download PDF

Info

Publication number
WO2018196765A1
WO2018196765A1 PCT/CN2018/084343 CN2018084343W WO2018196765A1 WO 2018196765 A1 WO2018196765 A1 WO 2018196765A1 CN 2018084343 W CN2018084343 W CN 2018084343W WO 2018196765 A1 WO2018196765 A1 WO 2018196765A1
Authority
WO
WIPO (PCT)
Prior art keywords
bit sequence
coded
timing information
burst
sequence
Prior art date
Application number
PCT/CN2018/084343
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 EP18790492.5A priority Critical patent/EP3609099A4/en
Publication of WO2018196765A1 publication Critical patent/WO2018196765A1/zh
Priority to US16/661,832 priority patent/US11075652B2/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
    • 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/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/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/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/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0041—Arrangements at the transmitter end
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0057—Block codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0061—Error detection codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0061—Error detection codes
    • H04L1/0063—Single parity check
    • 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
    • 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
    • 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/0072—Error control for data other than payload data, e.g. control data

Definitions

  • the present application relates to the field of communications technologies, and in particular, to a Polar code transmission method and apparatus.
  • Polar (polarization) code is the first channel coding method that can be strictly proved to "reach" the channel capacity.
  • the Polar code is a linear block code whose generating matrix is G N and its encoding process is Is a binary line vector of length N (ie code length);
  • B N is an N ⁇ N transposed matrix, such as a bit reverse transposed matrix; Defined as the Kronecker product of log 2 N matrices F 2 .
  • 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.
  • K is the size of the information block.
  • FIG. 1 is a schematic diagram of a process of transmitting a PBCH by a base station. As shown in FIG. 1, the base station adds a 16-bit CRC check to the MIB to obtain a 40-bit sequence. Then, channel coding and rate matching are performed to obtain a coded sequence.
  • PBCH physical broadcast channel
  • MIB main information block
  • the length of the MIB is 24 bits, and the MIB includes a downlink bandwidth.
  • FIG. 1 is a schematic diagram of a process of transmitting a PBCH by a base station. As shown in FIG. 1, the base station adds a 16-bit CRC check to the MIB to obtain a 40-bit sequence. Then, channel coding and rate matching are performed to obtain a coded sequence.
  • the PBCH is repeatedly transmitted 4 times in one cycle (40 ms), and each transmitted PBCH carries the same coded sequence, and each transmitted PBCH is different by scrambling.
  • the four sequences implicitly carry the last 2 bits of the SFN.
  • the base station performs modulation, resource mapping, and transmission processes.
  • 2 is a schematic diagram of a process for a terminal device to receive a PBCH. As shown in FIG. 2, after receiving a PBCH, the terminal device performs demapping and demodulation, and then performs descrambling by using each of four possible scrambling sequences.
  • the base station transmits the MIB in the first system frame in one cycle, that is, the lowest 2 bits of the SFN are known; if the decoding is unsuccessful, the next The content of the PBCH transmitted at one time is soft combined and then decoded until the PBCH is successfully decoded.
  • the application provides a Polar code transmission method and device.
  • a Polar code transmission method performs two or more different granularity transformations (for example, interleaving (cyclic shift) or scrambling) for a bit sequence to be processed, where each specific manner of one granularity is used. Implicitly indicating one of the timing information of one level, each specific manner of another granularity is used to implicitly indicate one of the timing information of the other level.
  • the bit sequence after the transformation (processing) is transmitted.
  • a Polar code transmission device comprises means for performing the method of the first aspect or any of the possible implementations of the first aspect.
  • an embodiment of the present application provides a Polar code transmission apparatus.
  • the device includes: a memory, a processor, wherein the memory and the processor are connected to each other by a bus system.
  • the memory is for storing instructions for executing the instructions stored by the memory, and when the instructions are executed, the processor performs the method of the first aspect or any possible implementation of the first aspect.
  • the present application provides a computer readable medium for storing a computer program, the computer program comprising instructions for performing the method of the first aspect or any of the possible implementations of the first aspect.
  • the Polar code transmission method provided in this embodiment performs two or more different granularity transformations on a bit sequence to be processed, and each specific mode of one granularity is used to implicitly indicate one of timing information of one level. Value, another specific way of granularity is used to implicitly indicate one of the timing information of another level, and the bit sequence after the transformation (processing) is sent, and different coded bit sequences can be obtained, which can be realized. Multi-version timing information to meet the needs of multi-level timing transmission.
  • 1 is a schematic flow chart of a communication system
  • FIG. 2 is a schematic diagram of a coding process of a Polar code
  • FIG. 3 is a schematic structural diagram of a system of a transmitting end and a receiving end provided by the present application;
  • FIG. 4 is a schematic diagram of an equivalent flow of a transform operation of a Polar code
  • 5a and 5b are schematic diagrams showing a process flow of a physical layer in a wireless communication system
  • FIG. 6 is a schematic diagram of cyclic shift corresponding to different timings
  • FIG. 7 is a schematic structural view of a PBCH
  • FIG. 8 is a flowchart of an embodiment of a method for transmitting a Polar code according to the present application.
  • FIG. 9 is a schematic diagram of grouping and cyclically shifting a sequence after grouping
  • FIG. 10 is a schematic diagram of a transform matrix T for cyclically shifting bits before encoding
  • FIG. 11 a schematic view of T 1 as a matrix for the sub-sub-matrix transformation matrix shown in FIG. 11 corresponding to T 1;
  • FIG. 13a and 13b are schematic diagrams of a hierarchical interleaving process provided by the present application.
  • FIG. 14 is a flowchart of an embodiment of a method for transmitting a Polar code according to the present application.
  • Figure 15 is a diagram showing an example of a 2-stage timing transmission
  • Figure 16 is a diagram showing an example of a 2-stage timing transmission
  • Figure 17 is a diagram showing an example of a 2-stage timing transmission
  • FIG. 18 is a schematic structural diagram of a Polar code transmission apparatus provided by the present application.
  • 19 is a schematic structural view of a communication device 600.
  • the present invention relates to a channel coding technology for improving information transmission reliability and ensuring communication quality in a 5G communication scenario, and can be applied to a scenario in which information is Polar encoded and decoded, for example, can be applied to Enhanced Mobile Broadband (Enhanced Mobile). Broad Band, eMBB)
  • Enhanced Mobile Broadband Enhanced Mobile Broadband
  • eMBB Enhanced Mobile Broadband
  • the scenario in which the uplink control information and the downlink control information are used for the encoding and decoding of the uplink and can also be applied to other scenarios, for example, channel coding (Channel Coding) and uplink control information applied to the communication standard TS 36.212.
  • the downlink control information and the channel coding part of the Sidelink channel are not limited in this application. More specifically, the present application can be mainly applied to a scenario in which an information such as a PBCH needs to be implicitly transmitted.
  • the communication system of the present application may include a transmitting end and a receiving end.
  • FIG. 3 is a schematic diagram of a system architecture of a transmitting end and a receiving end provided by the present application, as shown in FIG. 3, where the sending end is an encoding side, which may be used for coding and coding. Output coding information, the coding information is transmitted to the decoding side on the channel; the receiving end is the decoding side, and can be used to receive the encoded information sent by the transmitting end, and decode the encoded information.
  • the sending end and the receiving end may be a terminal, a server, a base station, or other device that can compile a code, which is not limited in this application.
  • the terminal can be a personal computer (PC), a mobile phone, a tablet, a smart learning machine, a smart game machine, a smart TV, a smart glasses or a smart watch.
  • PC personal computer
  • the transform operation on the encoded bit sequence may be equivalent to first performing a transform operation on the pre-encoded bits, and then encoding the transformed bits.
  • a cyclic code such as TBCC
  • the transform operation is a cyclic shift
  • cyclically shifting the encoded codeword is equivalent to cyclically shifting and re-encoding the information block before encoding.
  • the coding matrix structure does not have a cyclic characteristic, and the bit sequence encoded by the Polar code is interleaved, which is equivalent to performing the transform operation on the bit before coding and then performing the Polar code encoding.
  • 4 is a schematic diagram of an equivalent flow of a transform operation of a Polar code. As shown in FIG.
  • the bit before encoding is U, and the code is encoded by Polar code for U.
  • G N (A) corresponds to G on FIG. 4
  • U corresponds to u A on FIG. 4
  • the encoded bit sequence C is obtained, and then C is hierarchically interleaved or scrambled to obtain C , which is equivalent to: U performs a transformation of the transformation matrix to T, obtains U , and then performs Polar coding on U to obtain a coded bit sequence C.
  • the transform matrix of the pre-coding of the Polar code is T
  • the interleaving transform matrix of the encoded bits is P
  • the transform matrix T has a special form, which is a Toeplitz matrix of the upper triangle.
  • the effective interleaving operation needs to satisfy the following conditions: the transform operation of the pre-encoding bit does not affect the value of the frozen bit, that is, the value of the frozen bit before and after the transform does not change, and the frozen bit needs to be guaranteed to be frozen before and after the transform. It is just a function that freezes bits, independent of the information bits. This is because the Polar code needs to know the value of the frozen bit in advance when decoding, otherwise it cannot be decoded normally.
  • 5a and 5b are schematic diagrams showing a process flow of a physical layer in a wireless communication system.
  • a source is encoded by a source code and then subjected to channel coding, or rate matching, digitally modulated, and transmitted to a receiving end via a channel.
  • the signals received through the channel are digitally demodulated, de-rate matched, channel decoded, and source decoded to arrive at the sink.
  • hierarchical interleaving or scrambling transmission is performed according to the hierarchical timing information, and more timing information may be implicitly carried.
  • the process of hierarchical interleaving or scrambling is performed after channel coding, before the rate matching, the length of the bit sequence subjected to hierarchical interleaving or scrambling is the length of the Polar code mother code; the process of hierarchical interleaving or scrambling can also be performed after rate matching.
  • the length of the bit interleaved or scrambled bit sequence is the target length after rate matching.
  • FIG. 5a the process of hierarchical interleaving or scrambling is performed after channel coding, before rate matching, corresponding to FIG. 5a, corresponding to hierarchical deinterleaving or descrambling at the receiving end after de-rate matching, before channel decoding; referring to FIG. 5b, the hierarchical interleaving or The scrambling process performs an equivalent transformation before channel coding, and inversely transforms the channel after decoding at the receiving end.
  • one method in the related art is to carry the same coded sequence by using each PBCH, and each time the PBCH is transmitted, the time series information is implicitly carried by scrambling four different sequences (such as the last 2 bits of SFN).
  • scrambling four different sequences Such as the last 2 bits of SFN.
  • all possible scrambling code sequences are required to be decoded, and the delay is large. If the required version is greater than 4, the delay will be larger.
  • another method is to implicitly carry timing information by performing progressive interleaving on the encoded codeword (bit sequence) at the time of PBCH transmission. For example, by cyclic shift, a fixed-length cyclic shift of the codeword transmitted the previous time may be performed every transmission in the PBCH period.
  • 6 is a schematic diagram of cyclic shift corresponding to different timings. As shown in FIG. 6, the codewords after Polar encoding are divided into four segments of equal length, which are respectively denoted as C 1 , C 2 , C 3 , and C 4 , respectively.
  • the codeword of the previous transmission is cyclically shifted, and the size of each shift is N/4, and N is the length of the codeword after Polar coding, such as the first shift of 0, the second shift Bit N/4, the second time shifts N/4 on the first basis, and so on.
  • the UE When receiving multiple transmissions, the UE first performs reverse cyclic shift according to the relative cyclic shift of the transmitting end, then performs soft combining and decoding, and finally blindly checks the absolute length of the cyclic shift through the CRC check, and finally obtains corresponding Timing information.
  • the available version of the effective cyclic shift operation is limited.
  • the cyclic shift size that satisfies the PBCH requirement can only be N/2 or N/4, that is, only 2 or 4 versions can be generated, at most Can carry 4 different timing information implicitly.
  • FIG. 7 is a schematic structural diagram of a PBCH. As shown in FIG. 7, a 5G PBCH is carried in a synchronization signal block, and a plurality of synchronization signal blocks (SS blocks) form a synchronization signal group, and a plurality of synchronization signal groups (SS bursts) are formed. A set of sync bursts (SS burst set).
  • SS blocks synchronization signal blocks
  • SS bursts synchronization signal groups
  • the need for soft combining of sync signal blocks may be: merging within one sync signal group, merging between different sync signal groups, or merging between different sets of sync signal groups, therefore, the transmission of 5G PBCH has a hierarchical structure, Correspondingly, multiple levels of timing indication are required. Correspondingly, the original Polar code transmission method needs to be improved to meet the requirements of 5G PBCH multi-level timing transmission.
  • the method and apparatus for transmitting a Polar code provided by the present application are described in detail below with reference to the accompanying drawings.
  • the present application is mainly applied to various wireless communication systems, and acts on a digital signal processing unit in the system to improve the reliability of wireless communication.
  • FIG. 8 is a flowchart of an embodiment of a method for transmitting a Polar code according to the present application. As shown in FIG. 8, the method in this embodiment may include:
  • the transmitting end performs polarization coding on the first coded bit sequence to obtain a second coded bit sequence.
  • the first coded bit sequence may include information bits and CRC bits of the information to be encoded.
  • the CRC bit is included, the CRC bit is added to the information bits in the coded information to obtain the first coded bit sequence, and the PBCH is taken as an example.
  • the base station adds 16 bits of CRC bits to the 24-bit MIB to obtain a 40-bit sequence.
  • the first coded bit sequence is then polar coded to obtain a second coded bit sequence.
  • the transmitting end divides the second coded bit sequence into equal-length L sets of sequences, each set of sequences includes N/L coded bits, N is a length of the second coded bit sequence, and L and N are positive integers.
  • the transmitting end separately interleaves or scrambles the coded bits of each group of sequences according to the current timing to obtain a third coded bit sequence.
  • the transmitting end performs modulation, mapping, and transmission on the third coded bit sequence.
  • the interleaving of each group of sequences is the same in one transmission, and the cyclic shift size in the group carries the timing information. Similar to cyclic shifting by the entire codeword, the receiving end performs reverse cyclic shifting on each group, combines the received multiple copies of the signal, and then performs decoding, and finally inversely transforms the bits obtained by the Polar code decoding.
  • the CRC check blind check gets the timing information sent.
  • the transmitting end separately interleaves the coded bits of each group of sequences according to the current timing.
  • the interleaving method takes a cyclic shift as an example. For example, performing a cyclic shift of size N/L/4* (sequence-1) requires two timings. The information is cyclically shifted by N/L/2, and four timing information is required to cyclically shift N/L/4.
  • FIG. 9 is a schematic diagram of a grouping and cyclic shifting of a sequence after the grouping.
  • the transmitting end first divides the second coded bit sequence into two groups of equal lengths, each group of sequences including N/2 coded bits, N being the length of the second coded bit sequence. Then, the transmitting end cyclically shifts the coded bits of each group of sequences according to the current timing, and the cyclic shift corresponding to the four timings is as shown in FIG. 9, where C 11 , C 12 , C 13 , C 14 , and C 21 , C 22 , C 23 , and C 24 all contain the same number of coded bits, and are cyclically shifted 4 times to obtain 4 timing information.
  • FIG. 10 is to cyclically shift the bits before encoding.
  • a transform matrix T for transforming a pre-encoded bit equivalent to the above-described packet cyclic shift of the encoded bits is as shown in FIG. 10, wherein the blank position elements are all 0, the matrix 11 is a schematic view of a sub T 1, ie, sub-matrix corresponding to FIG transformation matrix T 1 shown in FIG. 11.
  • the Polar code transmission method In the Polar code transmission method provided in this embodiment, multiple groups of sequences are obtained by first grouping the encoded bits, and each group of sequences is separately interleaved or scrambled to obtain different coded bit sequences for implicitly carrying timing information.
  • the decoding can reduce the delay.
  • rate matching punchcturing
  • the hole is punched from the head to the back.
  • This method has a small set of coded bits due to the cyclic shift, thus affecting the hit. There are fewer hole bits and the performance is more stable.
  • FIG. 12 is a flowchart of an embodiment of a method for transmitting a Polar code according to the present application.
  • a level 2 timing is taken as an example, and each level corresponds to a version number of timing information.
  • the number of versions of the timing information corresponding to each level may be the same, and may be different.
  • the number of time series versions corresponding to the first level is L
  • the number of time series versions corresponding to the second level is K, as shown in FIG. 12, the method of this embodiment Can include:
  • the transmitting end performs polarization coding on the first coded bit sequence to obtain a second coded bit sequence.
  • the first coded bit sequence may include information bits and CRC bits of the information to be encoded.
  • the transmitting end adds a CRC bit to the information bits in the coded information to obtain a first coded bit sequence.
  • the transmitting end divides the second coded bit sequence into equal-length L sets of sequences, each set of sequences includes N/L coded bits, N is a length of the second coded bit sequence, and L and N are positive integers.
  • the transmitting end divides each group of the L group sequence into K groups of equal lengths and each group includes N/(K*L) coded bits, and K is a positive integer.
  • the transmitting end interleaves each group sequence in the K group sequence in the first group sequence according to the current time sequence and the first interleaving rule corresponding to the current time sequence.
  • each group of the L group sequences is interleaved or scrambled according to the current timing, and the above operations are performed cyclically until the Lth group sequence operation in the L group sequence ends.
  • a third coding sequence is obtained.
  • the K group sequence in the first group of sequences is subjected to the following operations, and each group of the K group sequence is interleaved to obtain K time series information, and then each of the L group sequences is obtained according to the current timing.
  • the group sequence is interleaved or scrambled, and the above operations are performed cyclically until the end of the Lth sequence operation in the L group sequence.
  • FIG. 13a and FIG. 13b are schematic diagrams of a hierarchical interleaving process provided by the present application, such as As shown in FIG. 13a and FIG. 13b, the transmitting end divides the second coded bit sequence into four sets of sequences of equal length (C 1 , C 2 , C 3 , C 4 ) and then divides each set of sequences into four sets of sequences, such as C.
  • each bracket Represents a timing
  • the first level element in parentheses represents the first level of timing information
  • the second element serves as the second level of timing information
  • FIG. 13a is a schematic diagram of four timings obtained by cyclically shifting four sets of sequences of the second stage when the first stage is not cyclically shifted
  • FIG. 13b is a fourth stage sequence of the second stage when the first stage is cyclically shifted once. Four timing diagrams obtained by cyclic shift.
  • the transmitting end performs modulation and mapping on the third coded bit sequence, and then sends the third coded bit sequence.
  • a plurality of sets of sequences are obtained by first performing first grouping on the encoded bits, and each set of sequences is further grouped to obtain multiple sets of sequences, and the sequences of the two groups are respectively interleaved or scrambled.
  • Different encoding bit sequences can be obtained, which can realize more versions of timing information and meet the requirements of multi-level timing transmission.
  • FIG. 14 is a flowchart of an embodiment of a method for transmitting a Polar code according to the present application, in which a cyclic shift or interleaving (processing) of two or more different granularities may be performed for a bit sequence to be processed, according to Implied indications of different transform (processing) types indicate different levels of timing information.
  • Timing information of different levels includes: first-level timing information, and second-level timing information included in the first-level timing information.
  • the first level of timing information such as the sequence number of the SS burst
  • the second level of timing information such as the sequence number of the SS block in the SS burst.
  • the first level timing information such as the sequence number of the SS burst set
  • the second level timing information such as the sequence number of the SS burst.
  • the method includes:
  • S301 Perform, for the bit sequence to be processed, two or more different granularity transforms (such as interleaving (cyclic shift) or scrambling), where each specific manner of one granularity is used to implicitly indicate a hierarchical timing.
  • granularity transforms such as interleaving (cyclic shift) or scrambling
  • each specific manner of one granularity is used to implicitly indicate a hierarchical timing.
  • One value in the message each specific way of another granularity is used to implicitly indicate one of the timing information of the other level.
  • a larger granularity of cyclic shift or interleaving implied timing information indicating a higher level is generally adopted, and a smaller granularity cyclic shift or an interleaved implied timing information indicating a smaller level is used.
  • the bit sequence to be processed may be an input bit sequence before the polar code encoding, or may be a bit sequence after the polar code encoding.
  • the corresponding reverse processing can be performed at the corresponding position.
  • FIG. 15 is an example diagram of a 2-level timing transmission, (between different SS bursts) implicitly indicating first-layer timing information, such as SS burst, with a cyclic shift to the overall codeword (ie, the first granularity) Serial number. (SS block within each SS burst) interleaving or cyclic shifting with a packet for the overall codeword (ie, the second granularity) implicitly indicating different second layer timing information, such as the timing in Figure 15. Timing 1, Timing 2, Timing 3, or Timing 4 in Group 1.
  • each group is further divided into smaller groups (or granularity), then more time series transmissions can be implicitly indicated.
  • the cyclic shift mode (the overall codeword or the coded codeword) between different stages may be different, and it is not necessary to correspond in the above manner.
  • the SS block within the SS burst is first subjected to intra-group de-interleaving or reverse cyclic shift according to the relative intra-packet interleaving or shifting size, soft-combined, and then subjected to Polar code decoding and blind detection.
  • intra-group de-interleaving or reverse cyclic shift according to the relative intra-packet interleaving or shifting size, soft-combined, and then subjected to Polar code decoding and blind detection.
  • the reverse rotation of the entire codeword is performed according to the shift size of the relative overall codeword, soft combining, and then the Polar code is performed.
  • Decoding and blind detection if they are in different relative positions within the burst, the reverse rotation of the entire codeword is performed according to the shift size of the relative overall codeword, and they are shifted into received signals having the same relative position, and then The de-interleaving or reverse cyclic shift in the group is performed according to the relative intra-packet interleave or shift size, soft combining is performed, and then Polar code decoding and blind detection are performed.
  • Timing information of different levels includes: first-level timing information, and second-level timing information included in the first-level timing information.
  • the first level of timing information such as the sequence number of the SS burst
  • the second level of timing information such as the sequence number of the SS block in the SS burst.
  • the first level timing information such as the sequence number of the SS burst set
  • the second level timing information such as the sequence number of the SS burst.
  • the receiving end obtains the inverse transform type by blind detection of the received bit sequence to determine or obtain timing information of the implied indication of the transform type.
  • the method includes:
  • S401 Perform two or more types of transformation (processing) on a bit sequence to be processed, where each specific mode of one type is used to implicitly indicate one value in one level of timing information, and the other Each specific mode in the type is used to implicitly indicate one of the timing information of the other level.
  • each specific mode of one type is used to implicitly indicate one value in one level of timing information
  • Each specific mode in the type is used to implicitly indicate one of the timing information of the other level.
  • different specific ones of one type are used to implicitly indicate different timing information of one level; different specific ways of another type are used to implicitly indicate different levels of another level Timing information.
  • the bit sequence to be processed may be an input bit sequence before the polar code encoding, or may be a bit sequence after the polar code encoding.
  • the corresponding reverse processing can be performed at the corresponding position.
  • S402. Send the transformed (processed) bit sequence.
  • it is a polar encoded bit sequence, it can be modulated and resource mapped and transmitted.
  • the bit sequence is before the polar encoding, the corresponding transformed (processed) bit sequence needs to be polar-coded, rate matched (optional), and modulated and resource mapped.
  • a processing type may be a scrambling mode, wherein different scrambling modes are used to indicate timing information of one level, such as first layer timing information;
  • the type of processing may be a cyclic shift, wherein the displacement of the cyclic shift is used to indicate timing information of another layer, such as second layer timing information.
  • one of the above processing types may be a cyclic shift, wherein the displacement of the cyclic shift is used to indicate timing information of a layer, such as first layer timing information.
  • Another type of processing may be a scrambling mode in which different scrambling modes are used to indicate timing information of another level, such as first layer timing information.
  • Figure 16 is an example of a 2-level timing information transmission (between different SS bursts) with different scrambling methods implicitly indicating the SS burst number; (within each SS burst), using the overall codeword
  • the cyclic shift implicitly indicates the sequence number of the different SS block.
  • the first layer timing information includes a timing group number 1 and a timing group number 2, and the two timing groups are distinguished by all 1 scrambling, and the sequence numbers of the two timing groups may be implicitly indicated (of course, other uses may also be used. Indicating information about the timing group). Of course, more scrambling methods can be used to indicate more timing group numbers.
  • the second layer timing information includes timing 1, timing 2, timing 3, and timing 4.
  • the above four timings are distinguished by a cyclic shift of the overall codeword, and the shift size is N/4. That is, the specific way of cyclic shift can implicitly indicate 4 timings within a timing group.
  • the four timings are only examples, and can be timings of two, three, or other natural numbers.
  • the SS block within the SS burst is first subjected to reverse cyclic shift and soft combining according to the magnitude of the relative shift, and then the Polar code decoding and blind detection are performed.
  • the SS blocks between different SS bursts if they have the same relative position in the burst, first perform descrambling soft combining, then perform Polar code decoding and blind detection; if they are in different relative positions in the burst, firstly according to the relative position
  • the shift size is shifted to a received signal of the same relative position by reverse cyclic shift, and then descrambled softly combined, and finally Polar code decoding and blind detection are performed.
  • FIG. 18 is a schematic structural diagram of a Polar code transmission apparatus provided by the present application.
  • the apparatus of this embodiment may include: a processing module 11 and a sending module 12, and the processing module 11 is configured to execute FIG. 8 or FIG.
  • the transmitting module 12 is configured to transmit a sequence of encoded bits processed by the processing module.
  • 19 is a schematic structural diagram of a communication device 600, which is applicable to a Polar code transmission device according to the present application, and correspondingly usable for encoding and description.
  • communication device 600 can 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 storage medium 603, 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 storage medium 603, All of this is connected to other support circuits through an external bus architecture.
  • the communication device 600 can be implemented using an ASIC (application specific integrated circuit) having a processor 602, a bus interface 604, a user interface 606, and at least a portion of the storage medium 603 integrated in a single chip, or Communication device 600 can be implemented using one or more FPGAs (Field Programmable Gate Arrays), PLDs (Programmable Logic Devices), controllers, state machines, gate logic, discrete hardware components, any other suitable circuitry, Or any combination of circuits capable of performing the various functions described throughout the application.
  • FPGAs Field Programmable Gate Arrays
  • PLDs Programmable Logic Devices
  • controllers state machines, gate logic, discrete hardware components, any other suitable circuitry, Or any combination of circuits capable of performing the various functions described throughout the application.
  • FIG. 19 is a schematic structural diagram of a communication device 600 according to an embodiment of the present application (for example, an access point or a base station, a communication device such as a station or a terminal, or a chip in the foregoing communication device, etc.).
  • a communication device 600 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 600 can be implemented by bus 601 as a general bus architecture.
  • bus 601 can include any number of interconnecting buses and bridges.
  • Bus 601 connects various circuits together, including processor 602, storage medium 603, and bus interface 604.
  • the communication device 600 connects the network adapter 605 or the like via the bus 601 using the bus interface 604.
  • the network adapter 605 can be used to implement signal processing functions of the physical layer in the wireless communication network and to transmit and receive radio frequency signals through the antenna 607.
  • the user interface 606 can be connected to a user terminal such as a keyboard, display, mouse or joystick.
  • Bus 601 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 processor 602 is responsible for managing the bus and general processing (including executing software stored on the storage medium 1203).
  • Processor 602 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 603 is shown separated from processor 602 in the following figures, however, those skilled in the art will readily appreciate that storage medium 603, or any portion thereof, may be located external to communication device 600.
  • storage medium 603 can include transmission lines, carrier waveforms modulated with data, and/or computer products separate from wireless nodes, all of which can be accessed by processor 602 via bus interface 604.
  • storage medium 603, or any portion thereof, may be integrated into processor 602, for example, may be a cache and/or a general purpose register.
  • the processor 602 can perform the methods in the foregoing embodiments, for example, FIG. 8, FIG. 12 or FIG. 14 and the corresponding embodiments, and the execution process of the processor 602 is not described herein again.
  • the communication device in the embodiment of the present application may be a wireless communication device such as an access point, a station, a base station, or a user terminal.
  • the Polar code in the embodiment of the present application may also be a CA-Polar code or a PC-Polar code.
  • Arikan Polar refers to the original Polar code, which is not cascaded with other codes, only information bits and frozen bits.
  • the CA-Polar code is a Polar code cascading a Cyclic Redundancy Check (CRC) Polar code
  • the PC-Polar code is a Polar code cascading Parity Check (PC) code.
  • PC-Polar and CA-Polar improve the performance of Polar codes by cascading different codes.
  • the aforementioned program can be stored in a computer readable storage medium.
  • the program when executed, performs the steps including the foregoing method embodiments; and the foregoing storage medium includes various media that can store program codes, such as a ROM, a RAM, a magnetic disk, or an optical disk.

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)
  • Error Detection And Correction (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)

Abstract

本申请提供一种Polar码传输方法及装置。该方法包括：针对待处理的比特序列，进行两种以上不同粒度的变换，其中一种粒度的每个具体方式用于隐式的指示一种层级的时序信息中的一个值，另一种粒度的每个具体方式用于隐式的指示另一种层级的时序信息中的一个值，发送所述变换(处理)后的比特序列。从而，可以得到不同的编码比特序列，可实现更多版本的时序信息，满足多级时序传输的需求。

Description

Polar码传输方法及装置
本申请要求于2017年04月25日提交中国专利局、申请号为201710279367.5、申请名称为“Polar码传输方法及装置”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及通信技术领域，尤其涉及一种Polar码传输方法及装置。
背景技术
通信系统通常采用信道编码提高数据传输的可靠性，保证通信的质量，Polar(极化)码是第一种能够被严格证明“达到”信道容量的信道编码方法。Polar码是一种线性块码，其生成矩阵为G N，其编码过程为
Figure PCTCN2018084343-appb-000001
是一个二进制的行矢量，长度为N(即码长)；且
Figure PCTCN2018084343-appb-000002
这里
Figure PCTCN2018084343-appb-000003
B N是一个N×N的转置矩阵，例如比特逆序转置矩阵；
Figure PCTCN2018084343-appb-000004
定义为log 2N个矩阵F 2的克罗内克(Kronecker)乘积。在Polar码的编码过程中，
Figure PCTCN2018084343-appb-000005
中的一部分比特用来携带信息，称为信息比特，信息比特的索引的集合记作
Figure PCTCN2018084343-appb-000006
另外的一部分比特置为收发端预先约定的固定值，称之为固定比特，其索引的集合用
Figure PCTCN2018084343-appb-000007
的补集
Figure PCTCN2018084343-appb-000008
表示。固定比特通常被设为0，只需要收发端预先约定，固定比特序列可以被任意设置。从而，Polar码的编码输出可简化为：
Figure PCTCN2018084343-appb-000009
这里
Figure PCTCN2018084343-appb-000010
为
Figure PCTCN2018084343-appb-000011
中的信息比特集合，
Figure PCTCN2018084343-appb-000012
为长度K的行矢量，即
Figure PCTCN2018084343-appb-000013
|·|表示集合中元素的个数，K为信息块大小，
Figure PCTCN2018084343-appb-000014
是矩阵G N中由集合
Figure PCTCN2018084343-appb-000015
中的索引对应的那些行得到的子矩阵，
Figure PCTCN2018084343-appb-000016
是一个K×N的矩阵。Polar码的构造过程即集合
Figure PCTCN2018084343-appb-000017
的选取过程，决定了Polar码的性能。
在长期演进(Long Term Evolution，LTE)系统中，物理广播信道(Physical Broadcast Channel，PBCH)传输主信息块(main information block，MIB)，MIB的长度为24比特(bits)，MIB包含下行带宽、物理混合重传指示信道(Physical Hybrid ARQ Indicator Channel，PHICH)和系统帧号(System Frame Number，SFN)的高8位。图1为基站发送PBCH的流程示意图，如图1所示，基站对MIB添加16bits的CRC校验，得到40比特的序列。接着进行信道编码和速率匹配，得到编码后的序列，PBCH在一个周期(40ms)内重复发送4次，每一次发送的PBCH都携带相同的编码后的序列，每次发送的PBCH通过加扰不同的四个序列隐式携带SFN的最后2位信息。最后基站进行调制、资源映射和发送过程。图2为终端设备接收PBCH的流程示意图，如图2所示，终端设备接收到PBCH后，先进行解映射和解调，接着通过使用4个可能的加扰序列中的每一个进行解扰后去尝试译码和CRC校验，如果译码成功，就知道了基站是在一个周期内的第几个系统帧发送MIB，即知道了SFN的最低2位；如果译码不成功， 就与下一次发送的PBCH的内容进行软合并，再进行译码，直到成功译码出PBCH。
现有技术中的Polar编解码的通信性能需要进一步提高。
发明内容
本申请提供一种Polar码传输方法及装置。
第一方面，一种Polar码传输方法，针对待处理的比特序列，进行两种以上不同粒度的变换(例如交织(循环移位)或者加扰)，其中一种粒度的每个具体方式用于隐式的指示一种层级的时序信息中的一个值，另一种粒度的每个具体方式用于隐式的指示另一种层级的时序信息中的一个值。发送所述变换(处理)后的比特序列。
第二方面，还提供了Polar码传输装置。具体地，该装置包括用于执行第一方面或第一方面的任意可能的实现方式中的方法的单元。
第三方面，本申请实施方式提供了一种Polar码传输装置。具体地，该装置包括：存储器、处理器，其中，存储器、处理器通过总线系统相互连接。该存储器用于存储指令，该处理器用于执行该存储器存储的指令，当该指令被执行时，该处理器执行第一方面或第一方面的任意可能的实现方式中的方法。
第四方面，本申请提供一种计算机可读介质，用于存储计算机程序，该计算机程序包括用于执行第一方面或第一方面的任意可能的实现方式中的方法的指令。
本实施例提供的Polar码传输方法，针对待处理的比特序列，进行两种以上不同粒度的变换，其中一种粒度的每个具体方式用于隐式的指示一种层级的时序信息中的一个值，另一种粒度的每个具体方式用于隐式的指示另一种层级的时序信息中的一个值，发送变换(处理)后的比特序列，可以得到不同的编码比特序列，可实现更多版本的时序信息，满足多级时序传输的需求。
附图说明
图1为一种通信系统的流程示意图；
图2为Polar码的编码过程示意图；
图3为本申请提供的一种发送端和接收端的系统架构示意图；
图4为对Polar码的变换操作等效流程示意图；
图5a以及图5b为一种无线通信系统中物理层的处理流程过程示意图；
图6为不同时序对应的循环移位示意图；
图7为PBCH的结构示意图；
图8为本申请提供的一种Polar码传输方法实施例的流程图；
图9为一种分组和对分组后的序列进行循环移位的示意图；
图10为对编码前的比特进行循环移位的变换矩阵T的示意图；
图11为子矩阵T 1的示意图，子矩阵T 1对应如图11所示的变换矩阵；
图12为本申请提供的一种Polar码传输方法实施例的流程图；
图13a和图13b为本申请提供的一种分级交织过程的示意图；
图14为本申请提供的一种Polar码传输方法实施例的流程图；
图15是一个2级时序传输的示例图；
图16是一个2级时序传输的示例图；
图17是一个2级时序传输的示例图；
图18为本申请提供的一种Polar码传输装置的结构示意图；
图19为通信装置600的结构示意图。
具体实施方式
本申请涉及5G通信场景下，用于提高信息传输可靠性，保证通信质量的信道编码技术，可以应用于对信息进行Polar编码和译码的场景，例如可以应用于对增强型移动宽带(Enhanced Mobile Broad Band，eMBB)上行控制信息和下行控制信息进行Polar编码和译码的场景，也可应用于其他场景，例如应用于通信标准TS 36.212的5.1.3的信道编码(Channel Coding)、上行控制信息、下行控制信息以及Sidelink信道的信道编码部分，本申请不做限定。更具体地，本申请主要可以应用于PBCH等需要隐式的传输信息的场景。
本申请的通信系统可以包括发送端和接收端，图3为本申请提供的一种发送端和接收端的系统架构示意图，如图3所示，其中，发送端为编码侧，可以用于编码和输出编码信息，编码信息在信道上传输至译码侧；接收端为译码侧，可以用于接收发送端发送的编码信息，并对该编码信息译码。发送端和接收端可以是终端、服务器、基站或其他可以编译码的设备，本申请不做限制。终端可以为个人计算机(Personal Computer，PC)、手机、平板电脑(pad)、智能学习机、智能游戏机、智能电视、智能眼镜或智能手表等。
一般地，对编码后的比特序列的变换操作可以等效于先对编码前的比特进行变换操作，然后对变换后的比特再进行编码。对于循环码(如TBCC)，如变换操作为循环移位，则对编码后的码字进行循环移位等效于对编码前的信息块进行循环移位再编码。而对于Polar码，其编码矩阵结构不具有循环特性，对Polar码编码后的比特序列进行交织，等效于对编码前的比特进行变换操作再进行Polar码编码。图4为对Polar码的变换操作等效流程示意图，如图4所示，对待编码信息中的信息比特添加循环冗余校验比特后，编码前比特为U，对U进行Polar码编码，
Figure PCTCN2018084343-appb-000018
这里G N(A)对应图4上的G，U对应图4上的u A，得到编码后的比特序列C，接着对C进行分级交织或加扰得到 C，等效于：对编码前比特U进行变换矩阵为T的变换，得到 U，然后对 U进行Polar编码，得到编码后的比特序列 C。Polar码编码前比特的变换矩阵为T，对编码后比特的交织变换矩阵为P，则变换矩阵满足T＝G*P*G。若交织操作为循环移位，变换矩阵T具有特殊形式，为上三角的Toeplitz矩阵。有效的交织操作需要满足如下条件：编码前比特的变换操作不影响冻结比特的值，即变换前后冻结比特的值不变，在冻结比特设定为全0的条件下，需要保证变换前后冻结比特只是冻结比特的函数，不受信息比特的影响。这是因为Polar码在译码时需要预先知道冻结比特的值，否则无法正常译码。
图5a以及图5b为一种无线通信系统中物理层的处理流程过程示意图，在发送端，信源通过信源编码再经过信道编码，或者速率匹配，经过数字调制，经过信道发送到接收端。在接收端，通过信道接收的信号经过数字解调，解速率匹配，信道解码，信 源解码，从而到达信宿。其中，本申请实施方式中，采用了根据分级的时序信息进行分级交织或加扰传输，可以隐式携带更多的时序信息。该分级交织或加扰的过程在信道编码后，速率匹配前，进行分级交织或加扰的比特序列长度为Polar码母码长度；分级交织或加扰的过程也可以在速率匹配之后进行，进行分级交织或加扰的比特序列长度为速率匹配后的目标长度。参考图5a该分级交织或加扰的过程在信道编码后，速率匹配前，参考图5a相应在接收端分级解交织或解扰在解速率匹配之后，信道解码之前；参考图5b该分级交织或加扰的过程在信道编码之前进行等效的变换，相应在接收端信道解码后进行反变换。
为实现隐式携带时序信息，相关技术中，一种方法是通过每一次发送的PBCH都携带相同的编码后的序列，每次发送的PBCH通过加扰不同的四个序列隐式携带时序信息(如SFN的最后2位信息)。但是，对于接收端而言，尝试所有可能的扰码序列后均需译码，时延较大，所需的版本若大于4，则时延会更大。
相关技术中，另一种方法是通过在PBCH传输时对编码后的码字(比特序列)进行累进交织隐式携带时序信息。例如通过循环移位，在PBCH周期内每次传输时对前一次传输的码字进行固定长度的循环移位即可。图6为不同时序对应的循环移位示意图，如图6所示，将Polar编码后的码字分为等长的4段，分别记作C 1、C 2、C 3、C 4，在每个时序传输时对前一次传输的编码码字进行循环移位，每次移位的大小为N/4，N为Polar编码后的码字长度，如第一次移位0，第二次移位N/4，第二次在第一次的基础上移位N/4，依次类推。UE在接收到多次传输时首先根据发送端相对的循环移位进行逆向循环移位，然后进行软合并和译码，最后通过CRC校验来盲检循环移位的绝对长度，最终得到对应的时序信息。但是，有效的循环移位操作产生的可用版本是有限的，目前满足PBCH需求的循环移位大小只能为N/2或者N/4，也就是只能产生2个或者4个版本，最多只能隐式携带4个不同的时序信息。
第五代移动通信系统(5th-generation，5G)中，由于高频的引入，5G的PBCH结构相对于LTE显著的变化是PBCH发送次数的增多。图7为PBCH的结构示意图，如图7所示，5G的PBCH承载于同步信号块之中，多个同步信号块(SS block)组成一个同步信号组，多个同步信号组(SS burst)组成一个同步信号组集合(SS burst set)。同步信号块软合并的需求可能有：在一个同步信号组之内合并、在不同同步信号组之间合并或者在不同的同步信号组集合之间合并，因此，5G PBCH的发送具有分级的结构，相应地需要多级时序指示。相应地，原有的Polar码传输方法需要改进，以满足5G PBCH多级时序传输的需求。下面结合附图详细说明本申请提供的Polar码传输方法及装置。
本申请主要应用于各种无线通信系统，作用于该系统中的数字信号处理单元，提高无线通信的可靠性。
图8为本申请提供的一种Polar码传输方法实施例的流程图，如图8所示，本实施例的方法可以包括：
S101、发送端对第一编码比特序列进行极化编码，得到第二编码比特序列。
具体地，第一编码比特序列可以包括待编码信息的信息比特和CRC比特，包括CRC比特时，发送端对待编码信息中的信息比特添加CRC比特，得到第一编码比特序列，以PBCH为例，基站对24比特的MIB添加16bits的CRC比特，得到40比特 的序列。然后对第一编码比特序列进行极化编码，得到第二编码比特序列。
S102、发送端将第二编码比特序列分成等长的L组序列，每一组序列包含N/L个编码比特，N为第二编码比特序列的长度，L、N为正整数。
S103、发送端根据当前时序对每一组序列的编码比特分别进行交织或加扰，得到第三编码比特序列。
S104、发送端将第三编码比特序列进行调制和映射后发送。
其中，各组序列的交织在一次传输时相同，组内的循环移位大小即携带了时序信息。与按整个码字进行循环移位类似，接收端先对各组进行逆向的循环移位，合并接收到的多份信号，然后进行译码，最后对Polar码译码得到的比特进行反变换和CRC校验盲检得到发送的时序信息。发送端根据当前时序对每一组序列的编码比特分别进行交织，交织方式以循环移位为例，如进行大小为N/L/4*(时序-1)的循环移位，需要2个时序信息则循环移位N/L/2，需要4个时序信息则循环移位N/L/4。
具体地，图9为一种分组和对分组后的序列进行循环移位的示意图，如图9所示，首先发送端将第二编码比特序列分成等长的2组序列，每一组序列包含N/2个编码比特，N为第二编码比特序列的长度。接着，发送端根据当前时序对每一组序列的编码比特分别进行循环移位，4个时序对应的循环移位如图9所示，其中，C 11、C 12、C 13、C 14以及C 21、C 22、C 23、C 24均包含相同数目的编码比特，循环移位4次得到4个时序信息。
其中，上述对编码后比特进行分组，对分组进行交织或加扰的变换，等效于对编码前的比特进行分组，对各组进行相应的变换，图10为对编码前的比特进行循环移位的变换矩阵T的示意图，本实施例中，与上述对编码后比特的分组循环移位等效的对编码前的比特进行变换的变换矩阵T如图10所示，其中空白位置元素全为0，图11为子矩阵T 1的示意图，子矩阵T 1对应如图11所示的变换矩阵。
本实施例提供的Polar码传输方法，通过先对编码后比特进行分组得到多组序列，对每一组序列分别进行交织或加扰，可以得到不同的编码比特序列，用于隐式携带时序信息，一方面译码时可以降低时延，在有速率匹配(打孔)的时候，尤其是按顺序从前往后打孔，该方式由于循环移位影响的编码比特集合较小，从而影响的打孔比特也较少，性能更稳定。
为满足5G PBCH多级时序传输的需求，图12为本申请提供的一种Polar码传输方法实施例的流程图，本实施例以2级时序为例，每一级对应有时序信息的版本数，每一级对应的时序信息的版本数可以相同，可以不同，第一级对应的时序版本数为L，第二级对应的时序版本数为K，如图12所示，本实施例的方法可以包括：
S201、发送端对第一编码比特序列进行极化编码，得到第二编码比特序列。
具体地，第一编码比特序列可以包括待编码信息的信息比特和CRC比特，包括CRC比特时，发送端对待编码信息中的信息比特添加CRC比特，得到第一编码比特序列。
S202、发送端将第二编码比特序列分成等长的L组序列，每一组序列包含N/L个编码比特，N为第二编码比特序列的长度，L、N为正整数。
S203、发送端将L组序列中的每一组序列分成等长且每一组包含N/(K*L)个编码 比特的K组序列，K为正整数。
S204、从L组序列中的第一组序列开始，发送端根据当前时序和当前时序对应的第一交织规则对第一组序列中的K组序列中的每一组序列进行交织，对L组序列中的第一组序列交织完成后，接着根据当前时序对L组序列中的每一组序列进行交织或加扰，循环执行上述操作，直到L组序列中的第L组序列操作结束。得到第三编码序列。
具体地，首先对第一组序列中的K组序列进行如下操作，对K组序列中的每一组序列进行交织，得到K个时序信息后，接着根据当前时序对L组序列中的每一组序列进行交织或加扰，循环执行上述操作，直到L组序列中的第L组序列操作结束。
例如，第一级对应的时序版本数为4，第二级对应的时序版本数为4，以循环移位为例，图13a和图13b为本申请提供的一种分级交织过程的示意图，如图13a和图13b所示，发送端将第二编码比特序列分成等长的4组序列(C 1、C 2、C 3、C 4)接着将每一组序列分为4组序列，如C 1分为C 11、C 12、C 13、C 14，C 2分为C 21、C 22、C 23、C 24，等等，按照如下顺序对第一级和第二级的序列分别进行4次循环移位：
(1,1)→(1,2)→(1,3)→(1,4)→(2,1)→(2,2)→(2,3)→(2,4)→(3,1)→(3,2)→(3,3)→(3,4)→(4,1)→(4,2)→(4,3)→(4,4)，这里每个括号代表一个时序，括号中的第一级元素表示第一级时序信息，第二个元素作为第二级时序信息。
图13a为第一级没有循环移位时对第二级的4组序列进行循环移位得到的4种时序示意图，图13b为第一级循环移位一次时对第二级的4组序列进行循环移位得到的4种时序示意图。
S205、发送端将第三编码比特序列进行调制和映射后发送。
本实施例提供的Polar码传输方法，通过先对编码后比特进行第一分组得到多组序列，对每一组序列再进行分组得到多组序列，分别对两次分组的序列进行交织或加扰，可以得到不同的编码比特序列，可实现更多版本的时序信息，满足多级时序传输的需求。
图14为本申请提供的一种Polar码传输方法实施例的流程图，在该方法中，可以通过针对待处理的比特序列进行两种以上的不同粒度的循环移位或者交织(处理)，根据不同的变换(处理)类型分别的隐含的指示不同层级的时序信息。不同层级的时序信息包括：第一级时序信息，和，所述第一级时序信息包括的第二级时序信息。第一级时序信息例如SS burst的序号，第二级时序信息例如SS block在SS burst中的序号。或者，第一级时序信息例如SS burst set的序号，第二级时序信息例如SS burst的序号。当然，也可以有更多层级的时序信息，例如SS burst set。
该方法包括：
S301、针对待处理的比特序列，进行两种以上不同粒度的变换(例如交织(循环移位)或者加扰)，其中一种粒度的每个具体方式用于隐式的指示一种层级的时序信息中的一个值，另一种粒度的每个具体方式用于隐式的指示另一种层级的时序信息中的一个值。可选的，一般采用较大粒度的循环移位或者交织隐含的指示较高层级的时序信息，采用较小粒度的循环移位或者交织隐含的指示较小层级的时序信息。
其中，该待处理的比特序列可以是polar码编码前的输入比特序列，也可以是polar码编码后的比特序列。在接收端，在相应的位置上进行相应的反向处理即可。
S302、发送所述变换(处理)后的比特序列。当然，此处需要结合通信技术做需要的其他步骤。例如，如果是polar编码后的比特序列，可以进行调制和资源映射后发送。如果是polar编码前的比特序列，需要对相应的变换(处理)后的比特序列进行polar编码，进行速率匹配(可选的)，以及调制和资源映射后发送出去。
本实施例给出一种Polar码传输方法，可以用于隐含的指示PBCH的分级的时序信息。图15是一个2级时序传输的示例图，(在不同的SS burst之间，)采用对整体码字(即第一种粒度)的循环移位隐含指示第一层时序信息，例如SS burst的序号。(在每一个SS burst之内的SS block，)采用针对整体码字的分组(即第二种粒度)进行交织或者循环移位隐含指示不同的第二层时序信息，例如图15中的时序组1内的时序1，时序2，时序3或者时序4。若将每组进一步分成更小的组(或者粒度)，则可以进一步隐含指示更多级的时序传输。不同级之间的循环移位方式(整体码字或者分组的码字)不同即可，并非必须按照上述方式对应。
在接收端，对SS burst之内的SS block，首先根据相对的分组内交织或者移位大小进行组内反交织或者反向循环移位，进行软合并，然后进行Polar码译码和盲检。对于不同SS burst之间的SS block，若它们在burst内的相对位置相同，首先根据相对的整体码字的移位大小进行整体码字的反向循环移位，进行软合并，然后进行Polar码译码和盲检；若它们在burst内相对位置不同，则根据相对的整体码字的移位大小进行整体码字的反向循环移位，将它们移位成为相对位置相同的接收信号，再根据相对的分组内交织或者移位大小进行组内的反交织或者反向循环移位，进行软合并，然后进行Polar码译码和盲检。
本实施例提供一种Polar码传输方法，在该方法中，可以通过针对待处理的比特序列进行两种以上的不同的类型变换(处理)，根据不同的变换(处理)类型(例如不同的加扰和不同的循环移位的)分别的隐含的指示不同层级的时序信息。不同层级的时序信息包括：第一级时序信息，和，所述第一级时序信息包括的第二级时序信息。第一级时序信息例如SS burst的序号，第二级时序信息例如SS block在SS burst中的序号。或者，第一级时序信息例如SS burst set的序号，第二级时序信息例如SS burst的序号。
接收端通过对接收到的比特序列的盲检测获取反向的变换类型，以确定或者获得该变换类型隐含指示的时序信息。
该方法包括：
S401、针对待处理的比特序列，进行两种以上类型的变换(处理)，其中一种类型中的每个具体方式用于隐式的指示一种层级的时序信息中的一个值，另一种类型中的每个具体方式用于隐式的指示另一种层级的时序信息中的一个值。或者，其中一种类型中的不同的具体方式用于隐式的指示一种层级的不同的时序信息；另一种类型中的不同的具体方式用于隐式的指示另一种层级的不同的时序信息。
其中，该待处理的比特序列可以是polar码编码前的输入比特序列，也可以是polar码编码后的比特序列。在接收端，在相应的位置上进行相应的反向处理即可。
S402、发送所述变换(处理)后的比特序列。当然，此处需要结合通信技术做需要的其他步骤。例如，如果是polar编码后的比特序列，可以进行调制和资源映射后发送。如果是polar编码前的比特序列，需要对相应的变换(处理)后的比特序列进行polar编码，进行速率匹配(可选的)，以及调制和资源映射后发送出去。
图16是一个2级时序传输的示例图，参考图16，一种处理类型可以是加扰方式，其中不同的加扰方式用于指示一个层级的时序信息，例如第一层时序信息；上述一种处理类型可以是循环位移，其中循环位移的位移方式用于指示另一个层的时序信息，例如第二层时序信息。
图17是一个2级时序传输的示例图，参考图17，上述一种处理类型可以是循环位移，其中循环位移的位移方式用于指示一个层的时序信息，例如第一层时序信息。另一种处理类型可以是加扰方式，其中不同的加扰方式用于指示另一个层级的时序信息，例如第一层时序信息。
下面针对图16和图17，采取上述方法用于实现PBCH的不同层级的时序信息的方法分别详细说明。
图16是一个2级时序信息传输的示例，(在不同的SS burst之间)采用不同的加扰方式隐含指示的SS burst序号；(在每一个SS burst之内)，采用整体码字的循环移位隐含指示不同的SS block的序号。如图16所示，第一层时序信息包括时序组序号1和时序组序号2，用全1加扰区分两个时序组，可以隐含指示两个时序组的序号(当然也可以是其他用于指示该时序组的信息)。当然，可以采用更多的加扰方式指示更多的时序组序号。
如图17所示，第二层时序信息包括时序1，时序2，时序3和时序4。在一个时序组内，用整体码字的循环移位区分前述4个时序，移位大小为N/4。即循环移位的具体方式可以隐含指示一个时序组内的4个时序。当然，4个时序仅为举例，可以是2个，3个或者其他自然数的时序。
在接收端，对SS burst之内的SS block，先根据相对移位的大小进行反向循环移位和软合并，然后进行Polar码译码和盲检。对于不同SS burst之间的SS block，若它们在burst内的相对位置相同，先进行解扰软合并，然后进行Polar码译码和盲检；若它们在burst内相对位置不同，则先根据相对的移位大小通过反向循环移位将它们移位成为相对位置相同的接收信号，再进行解扰软合并，最后进行Polar码译码和盲检。
图18为本申请提供的一种Polar码传输装置的结构示意图，如图18所示，本实施例的装置可以包括：处理模块11和发送模块12，处理模块11用于执行图8或图12所示的处理过程，发送模块12用于发送处理模块处理后的编码比特序列。具体可参照图8或图12所示的处理过程，实现原理和技术效果类似，此处不再赘述。
本领域技术人员可以理解，上述Polar码编解码器可以硬件或者软硬件结合的方式实现。以下结合图19，图19为通信装置600的结构示意图，对根据本申请的用于Polar码传输装置，以及相应的可用于编码、进行说明。
可以替换的，通信装置600可配置成通用处理系统，例如通称为芯片，该通用处理系统包括:提供处理器功能的一个或多个微处理器；以及提供存储介质603的至少一部分的外部存储器，所有这些都通过外部总线体系结构与其它支持电路连接在一起。
可替换的，通信装置600可以使用下述来实现:具有处理器602、总线接口604、用户接口606的ASIC(专用集成电路)；以及集成在单个芯片中的存储介质603的至少一部分，或者，通信装置600可以使用下述来实现：一个或多个FPGA(现场可编程门阵列)、PLD(可编程逻辑器件)、控制器、状态机、门逻辑、分立硬件部件、任何其它适合的电路、或者能够执行本申请通篇所描述的各种功能的电路的任意组合。
图19为本申请实施例所提供的通信装置600的结构示意图(例如接入点或基站、站点或者终端等通信装置，或者前述通信装置中的芯片等)。
在一种实施方式中，如图19所示，通信装置600，可以由总线601作一般性的总线体系结构来实现。根据通信装置600的具体应用和整体设计约束条件，总线601可以包括任意数量的互连总线和桥接。总线601将各种电路连接在一起，这些电路包括处理器602、存储介质603和总线接口604。可选的，通信装置600使用总线接口604将网络适配器605等经由总线601连接。网络适配器605可用于实现无线通信网络中物理层的信号处理功能，并通过天线607实现射频信号的发送和接收。用户接口606可以连接用户终端，例如：键盘、显示器、鼠标或者操纵杆等。总线601还可以连接各种其它电路，如定时源、外围设备、电压调节器或者功率管理电路等，这些电路是本领域所熟知的，因此不再详述。
其中，处理器602负责管理总线和一般处理(包括执行存储在存储介质1203上的软件)。处理器602可以使用一个或多个通用处理器和/或专用处理器来实现。处理器的例子包括微处理器、微控制器、DSP处理器和能够执行软件的其它电路。应当将软件广义地解释为表示指令、数据或其任意组合，而不论是将其称作为软件、固件、中间件、微代码、硬件描述语言还是其它。
在下图中存储介质603被示为与处理器602分离，然而，本领域技术人员很容易明白，存储介质603或其任意部分可位于通信装置600之外。举例来说，存储介质603可以包括传输线、用数据调制的载波波形、和/或与无线节点分离开的计算机制品，这些介质均可以由处理器602通过总线接口604来访问。可替换地，存储介质603或其任意部分可以集成到处理器602中，例如，可以是高速缓存和/或通用寄存器。
处理器602可执行上述实施例中，例如，图8、图12或者图14及相应的实施方式中的方法，在此不再对处理器602的执行过程进行赘述。
本申请实施例所说的通信装置，可以是接入点、站点、基站或者用户终端等无线通信设备。
本申请实施例所说的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码的性能。
本领域普通技术人员可以理解：实现上述各方法实施例的全部或部分步骤可以通过程序指令相关的硬件来完成。前述的程序可以存储于一计算机可读取存储介质中。该程序在执行时，执行包括上述各方法实施例的步骤；而前述的存储介质包括：ROM、RAM、磁碟或者光盘等各种可以存储程序代码的介质。

Claims (16)

  1. 一种极化Polar码传输方法，其特征在于，包括：
    针对待处理的比特序列，进行两种以上不同粒度的变换；
    其中，一种粒度的每个具体方式用于隐式的指示一种层级的时序信息中的一个值，另一种粒度的每个具体方式用于隐式的指示另一种层级的时序信息中的一个值；
    发送所述变换后的比特序列。
  2. 根据权利要求1所述的方法，其特征在于，所述方法还包括：
    对待编码信息中的信息比特添加循环冗余校验CRC比特，得到第一编码比特序列；
    对第一编码比特序列进行极化编码，得到第二编码比特序列。
  3. 根据权利要求2所述的方法，其特征在于，所述方法还包括：
    将所述第二编码比特序列分成等长的L组序列，其中，每一组序列包含N/L个编码比特，N为第二编码比特序列的长度，L、N为正整数。
  4. 根据权利要求3所述的方法，其特征在于，所述方法还包括：
    根据当前时序，对所述每一组序列的编码比特分别进行交织或加扰，得到第三编码比特序列。
  5. 根据权利要求4所述的方法，其特征在于，所述方法还包括：
    对所述第三编码比特进行速率匹配，获得所述速率匹配之后的编码比特。
  6. 根据权利要求1或4所述的方法，其特征在于，所述待处理的比特序列为极化polar码编码前的输入比特序列，或者为所述第三编码比特序列。
  7. 根据权利要求1所述的方法，其特征在于，所述针对待处理的比特序列，进行两种以上不同粒度的变换具体为：
    在不同的同步信号组SS burst之间采用对整体码字的循环移位隐含指示第一层时序信息；
    每一个同步信号组集合SS burst之内的同步信号块SS block采用对整体码字的分组隐含指示不同的第二层时序信息。
  8. 根据权利要求7所述的方法，其特征在于，第一级时序信息为同步信号组SS burst的序号，第二级时序信息为同步信号块SS block在同步信号组SS burst中的序号；或者，第一级时序信息为同步信号组集合SS burst set的序号，第二级时序信息为同步信号组SS burst的序号。
  9. 一种极化Polar码传输装置，其特征在于，包括：
    处理模块，用于针对待处理的比特序列，进行两种以上不同粒度的变换；
    其中，一种粒度的每个具体方式用于隐式的指示一种层级的时序信息中的一个值，另一种粒度的每个具体方式用于隐式的指示另一种层级的时序信息中的一个值；
    发送模块，用于发送所述变换后的比特序列。
  10. 根据权利要求9所述的传输装置，其特征在于，所述处理模块还用于：
    对待编码信息中的信息比特添加循环冗余校验CRC比特，得到第一编码比特序列；
    对第一编码比特序列进行极化编码，得到第二编码比特序列。
  11. 根据权利要求10所述的传输装置，其特征在于，所述处理模块还用于：
    将所述第二编码比特序列分成等长的L组序列，其中，每一组序列包含N/L个编码比特，N为第二编码比特序列的长度，L、N为正整数。
  12. 根据权利要求11所述的传输装置，其特征在于，所述处理模块还用于：
    根据当前时序，对所述每一组序列的编码比特分别进行交织或加扰，得到第三编码比特序列。
  13. 根据权利要求12所述的传输装置，其特征在于，所述处理模块还用于：
    对所述第三编码比特进行速率匹配，获得所述速率匹配之后的编码比特。
  14. 根据权利要求9或12所述的传输装置，其特征在于，所述待处理的比特序列为极化polar码编码前的输入比特序列，或者为所述第三编码比特序列。
  15. 根据权利要求9所述的传输装置，其特征在于，所述处理模具体用于：
    在不同的同步信号组SS burst之间采用对整体码字的循环移位隐含指示第一层时序信息；
    每一个同步信号组集合SS burst之内的同步信号块SS block采用对整体码字的分组隐含指示不同的第二层时序信息。
  16. 根据权利要求15所述的传输装置，其特征在于，第一级时序信息为同步信号组SS burst的序号，第二级时序信息为同步信号块SS block在同步信号组SS burst中的序号；或者，第一级时序信息为同步信号组集合SS burst set的序号，第二级时序信息为同步信号组SS burst的序号。
PCT/CN2018/084343 2017-04-25 2018-04-25 Polar码传输方法及装置 WO2018196765A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP18790492.5A EP3609099A4 (en) 2017-04-25 2018-04-25 POLAR CODE TRANSFER METHOD AND DEVICE
US16/661,832 US11075652B2 (en) 2017-04-25 2019-10-23 Polar code transmission method and apparatus

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710279367.5A CN108737021B (zh) 2017-04-25 2017-04-25 Polar码传输方法及装置
CN201710279367.5 2017-04-25

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/661,832 Continuation US11075652B2 (en) 2017-04-25 2019-10-23 Polar code transmission method and apparatus

Publications (1)

Publication Number Publication Date
WO2018196765A1 true WO2018196765A1 (zh) 2018-11-01

Family

ID=63920205

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/084343 WO2018196765A1 (zh) 2017-04-25 2018-04-25 Polar码传输方法及装置

Country Status (4)

Country Link
US (1) US11075652B2 (zh)
EP (1) EP3609099A4 (zh)
CN (1) CN108737021B (zh)
WO (1) WO2018196765A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2020261038A1 (en) * 2019-06-26 2020-12-30 Polaran Haberlesme Teknolojileri Anonim Sirketi Methods and apparatus for error correction coding with triangular factorization of generator matrix

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109429567B (zh) * 2017-06-16 2021-10-15 北京小米移动软件有限公司 信号传输方法和信号传输装置
CN114584260B (zh) * 2017-07-27 2024-02-13 苹果公司 物理广播信道(pbch)的加扰
CN113691300A (zh) 2018-12-25 2021-11-23 华为技术有限公司 一种数据传输方法及通信设备
CN113424469B (zh) * 2019-01-29 2024-07-19 交互数字专利控股公司 用于极性编码的方法和设备
CN110958081A (zh) * 2019-12-02 2020-04-03 上海道生物联技术有限公司 一种无线通信帧结构分段信号处理方法
CN112636873B (zh) * 2020-12-18 2023-03-24 浙江三维利普维网络有限公司 数据传输方法、装置、存储介质及电子装置
CN115225201A (zh) * 2021-04-16 2022-10-21 华为技术有限公司 一种调制方法、解调方法及通信装置

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104219019A (zh) * 2013-05-31 2014-12-17 华为技术有限公司 编码方法及编码设备
CN106100794A (zh) * 2016-06-17 2016-11-09 哈尔滨工业大学深圳研究生院 一种基于打孔的极化码编码协作

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10135460B2 (en) * 2013-10-01 2018-11-20 Texas Instruments Incorporated Apparatus and method for multilevel coding (MLC) with binary alphabet polar codes
US10075197B1 (en) * 2017-03-07 2018-09-11 Lg Electronics Inc. Method and apparatus for transmitting hamming weight and codeword
US10432357B2 (en) * 2017-06-02 2019-10-01 Qualcomm Incorporated Sequence-based polar code description
DE102018113351A1 (de) * 2017-06-08 2018-12-13 Samsung Electronics Co., Ltd. Polares Codieren und Decodieren unter Verwendung von vordefinierten Informationen

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104219019A (zh) * 2013-05-31 2014-12-17 华为技术有限公司 编码方法及编码设备
CN106100794A (zh) * 2016-06-17 2016-11-09 哈尔滨工业大学深圳研究生院 一种基于打孔的极化码编码协作

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
ARIKAN ERDAL ET AL.: "Challenges and Some New Directions in Channel Coding", JOURNAL OF COMMUNICATION AND NETWORKS, vol. 17, no. 4, 31 August 2015 (2015-08-31), pages 328 - 338, XP011669353 *
HUAWEI ET AL.: "Polar Code Construction for NR", 3GPP DRAFT; R1-1608862 POLAR CODE CONSTUCTION FOR NR, 31 October 2016 (2016-10-31), XP051159189, Retrieved from the Internet <URL:http://www.3gpp.org/ftp/tsg_ran/WG1_RL1/TSGR1_86b/Docs/> *
See also references of EP3609099A4

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2020261038A1 (en) * 2019-06-26 2020-12-30 Polaran Haberlesme Teknolojileri Anonim Sirketi Methods and apparatus for error correction coding with triangular factorization of generator matrix
CN114342266A (zh) * 2019-06-26 2022-04-12 波拉兰哈伯雷斯姆技术公司 用生成矩阵的三角分解进行纠错编码的方法和装置
US11405055B2 (en) 2019-06-26 2022-08-02 Polaran Haberlesme Teknolojileri Anonim Sirketi Methods and apparatus for error correction coding with triangular factorization of generator matrix
CN114342266B (zh) * 2019-06-26 2022-12-20 波拉兰哈伯雷斯姆技术公司 用生成矩阵的三角分解进行纠错编码的方法和装置
EP4293918A3 (en) * 2019-06-26 2024-03-06 Polaran Haberlesme Teknolojileri Anonim Sirketi Methods and apparatus for error correction coding with triangular factorization of generator matrix

Also Published As

Publication number Publication date
US20200059245A1 (en) 2020-02-20
CN108737021B (zh) 2021-12-10
US11075652B2 (en) 2021-07-27
EP3609099A1 (en) 2020-02-12
EP3609099A4 (en) 2020-03-25
CN108737021A (zh) 2018-11-02

Similar Documents

Publication Publication Date Title
WO2018196765A1 (zh) Polar码传输方法及装置
KR101633326B1 (ko) 전송 방법
WO2019062145A1 (zh) Ploar编码方法和编码装置、译码方法和译码装置
WO2017101631A1 (zh) 用于处理极化码的方法和通信设备
WO2018210244A1 (zh) 一种Polar码传输方法及装置
CN110800216A (zh) 用于通信和广播系统的速率匹配的方法和装置
CN109075799A (zh) 极化Polar码的编译码方法及装置
WO2018214927A1 (zh) 编译码方法及装置
WO2018184480A1 (zh) 一种编码方法、译码方法、装置和设备
WO2018141212A1 (zh) 一种信息的传输方法、译码方法和装置
WO2019047544A1 (zh) 编码方法及装置
US20200067531A1 (en) Polar code encoding and decoding method and apparatus
JP2023157921A (ja) メディア内容に基づく自己適応システムコードｆｅｃ符号化および復号化方法、装置、システムおよび媒体
CN110476357B (zh) 极化码传输方法和装置
WO2020147527A1 (zh) 一种极化编译码方法及装置
WO2016179743A1 (zh) 一种编码装置及方法
WO2019149180A1 (zh) 交织方法和交织装置
WO2018228592A1 (zh) 一种极化Polar码的交织处理方法及装置
US10581464B2 (en) Encoder device, decoder device, and methods thereof
WO2019047741A1 (zh) 比特交织、解交织方法及装置
US11283465B2 (en) Network data prediction method, network data processing device and network data processing method
US8649342B2 (en) Method of mapping transport sequences to component carriers in a wireless communication system
WO2019047788A1 (zh) 编码方法及装置
WO2020200163A1 (zh) 信息传输方法及终端
WO2019047543A1 (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: 18790492

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

Country of ref document: EP

Effective date: 20191106