WO2017092543A1 - Procédé et dispositif d'adaptation de débit d'un code polaire - Google Patents

Procédé et dispositif d'adaptation de débit d'un code polaire Download PDF

Info

Publication number
WO2017092543A1
WO2017092543A1 PCT/CN2016/104381 CN2016104381W WO2017092543A1 WO 2017092543 A1 WO2017092543 A1 WO 2017092543A1 CN 2016104381 W CN2016104381 W CN 2016104381W WO 2017092543 A1 WO2017092543 A1 WO 2017092543A1
Authority
WO
WIPO (PCT)
Prior art keywords
bit
bit sequence
bits
transmitted
sequence
Prior art date
Application number
PCT/CN2016/104381
Other languages
English (en)
Chinese (zh)
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 华为技术有限公司
Publication of WO2017092543A1 publication Critical patent/WO2017092543A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/13—Linear 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/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0009—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the channel coding
    • H04L1/0013—Rate matching, e.g. puncturing or repetition of code symbols
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • 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/6306—Error control coding in combination with Automatic Repeat reQuest [ARQ] and diversity transmission, e.g. coding schemes for the multiple transmission of the same information or the transmission of incremental redundancy
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/63—Joint error correction and other techniques
    • H03M13/635—Error control coding in combination with rate matching
    • H03M13/6362—Error control coding in combination with rate matching by puncturing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0057—Block codes
    • 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 present application relates to the field of coding and, more particularly, to a method and apparatus for rate matching of polarized codes.
  • the latest research shows that the SCL-based decoding, SCL decoding, SCS decoding and Successive Cancellation Hybrid (SCH) translation based on the improved SC algorithm.
  • the code algorithm can significantly improve the frame error rate (FER) performance of the Polar code.
  • FER frame error rate
  • These algorithms are collectively referred to as the enhanced SC decoding algorithm.
  • the Polar code can obtain better FER performance than the LDPC code and the Turbo code.
  • Hybrid Automatic Repeat ReQuest is a commonly used transmission method to increase system throughput.
  • the transmitting end encodes the information block and sends it to the channel. If the receiving end decodes the received signal and finds that the transmission fails (for example, fails to pass the CRC), the receiving end passes a feedback link.
  • a Negative ACKnowledgment (NACK) message is transmitted to the sender, and the sender re-encodes the information block. This process will continue until the receiver decodes correctly. At this point, the receiver sends an acknowledgment (ACKnowledgment, The ACK message is sent to the sender to complete the transmission of the information block.
  • NACK Negative ACKnowledgment
  • HARQ-II incremental redundancy HARQ and is generally classified as HARQ type 2, which is described as HARQ-II.
  • HARQ technology has been widely used in existing communication systems, such as Wideband Code Division Multiple Access (W-CDMA) systems, Long Term Evolution (LTE) systems, etc., and most scenarios. Next, HARQ-II is used.
  • W-CDMA Wideband Code Division Multiple Access
  • LTE Long Term Evolution
  • the code length of the conventional Polar code is strictly limited and must be 2 integer powers, which cannot be applied to a system in which the code length of the HARQ transmission scheme is required to be flexibly adapted according to system requirements.
  • the coding is simply repeated at the time of retransmission, and a good coding gain cannot be obtained.
  • the decoding complexity is very large.
  • the present application provides a method and apparatus for rate matching of a polarization code, which can implement HARQ transmission based on Polar code encoding, and can obtain a good coding gain.
  • the present application provides a method for rate matching of a Polar code, the method may include:
  • the information bit sequence of length K bits is subjected to Polar code encoding to generate a coded bit sequence of length M bits, wherein K and M are positive integers, M is a positive integer power of 2, and M is greater than or equal to K;
  • N min bits from the coded bit sequence as the first bit to the N min bit of the to-be-transmitted bit sequence of the hybrid automatic repeat request HARQ transmission process, where N min is the first in the HARQ transmission process
  • N max The minimum number of bits that may be transmitted by the secondary transmission, and the maximum number of bits that the transmitted bit sequence is allowed to transmit is N max ;
  • each bit from the Nthth +1th bit to the Nthth bit of the bit sequence to be transmitted from K bits of the information bit sequence and M bits of the coded bit sequence, wherein the determining Each bit of the N min +1 bit to the N max bit of the bit sequence to be transmitted is an error frame of the bit sequence to be transmitted according to when each bit is added to the bit sequence to be transmitted The rate is determined.
  • the N min bits are selected from the coded bit sequence as the first bit to the N min bits of the to-be-transmitted bit sequence of the hybrid automatic repeat request HARQ transmission process, comprising: the encoded bit sequence after interleaving, the coded bit sequence before selecting the interleaved bits N min, as the first bit to the N min bits of the bit sequence to be transmitted.
  • the interleaving the coded bit sequence may include: performing bit reverse order BRO ordering on the coded bit sequence, and then performing sequential or reverse order arrangement.
  • M is the sequence of bits from the K bits of the information bit sequence and the bits coded bit sequence to be transmitted is determined in the first bit of each of N min + 1 bit to the bits of the N max
  • the method may include: using the N min bits as the first type of bit sequence, using the remaining MN min bits of the coded bit sequence as the second type of bit sequence, and using the K bits of the information bit sequence as the third type of bit a sequence; calculating, when each bit of the first type of bit sequence, the second type of bit sequence, and the third type of bit sequence is added to the bit sequence to be transmitted, the bit sequence to be transmitted a frame error rate, where the corresponding bit is determined to be the N min +1 bit, and then from the first class bit sequence, the second class bit sequence, and the third class bit sequence Among the remaining bits, a bit that minimizes the frame error rate of the bit sequence to be transmitted is determined as the N min + 2 bits until the N max bit is determined.
  • the calculating, when each bit of the first type of bit sequence, the second type of bit sequence, and the third type of bit sequence is added to the bit sequence to be transmitted, the to-be-transmitted The frame error rate of the bit sequence may include: calculating, by using a density evolution algorithm, each bit of the first type of bit sequence, the second type of bit sequence, and the third type of bit sequence The frame error rate of the bit sequence to be transmitted when transmitting a bit sequence.
  • the density evolution algorithm may be an unimproved density evolution algorithm, and more preferably, the density evolution algorithm may be simplified by using a Gaussian approximation. This simplified algorithm may be referred to as a Gaussian approximation algorithm.
  • the method may further include: performing repeated operations, punching operations, and punching operations on the first type of bit sequence, the second type of bit sequence, and the third type of bit sequence, respectively. Performing at least one of an interleaving operation, and performing the at least one operation of the first type of bit sequence, performing the at least one operation of the second type of bit sequence, and performing the at least one Performing a mixing operation on the third type of bit sequence to obtain a mixed bit sequence, such that the first MN min bits of the mixed bit sequence are the N min +1 bits to the N max bits of the bit sequence to be transmitted; And encoding the N min bits and the first MN min bits of the mixed bit sequence; sequentially reading the bits in the to-be-transmitted bit sequence in the buffer for transmission.
  • the method for rate matching of a Polar code performs Polar code encoding on the information bit sequence to generate a coded bit sequence, and selects a partial bit from the coded bit sequence as a first part of the bit sequence to be transmitted in the HARQ transmission process, according to When a bit is added to the bit sequence to be transmitted, the frame error rate of the bit sequence is transmitted, and bits are selected one by one from the information bit sequence and the coded bit sequence as subsequent bits of the bit sequence to be transmitted.
  • the method of the embodiment of the present invention can implement HARQ transmission based on Polar code coding, and can obtain a good coding gain.
  • the good coding gain is obtained because not only the information bits are considered in the bit sequence to be transmitted, but also the coding bits are added, so that the bit sequence to be transmitted carries more kinds of bits, thereby improving the bit number compared with the existing HARQ transmission. Coding gain.
  • the N min bits are selected from the coded bit sequence as the first bit to the N min bits of the to-be-transmitted bit sequence of the hybrid automatic repeat request HARQ transmission process, including : puncturing the coded bit sequence to obtain a punctured bit sequence of length N max ; calculating, when placing each bit in the bit sequence of length N max in the bit sequence to be transmitted When the N max bit is used, the frame error rate of the bit sequence to be transmitted is determined as the N max bit when the frame error rate is maximum, and is determined from the remaining bits in the bit sequence of length N max . The bit with the highest frame error rate of the bit sequence to be transmitted is used as the N max -1 bit until the N min +1 bit is determined, and the remaining N min bits are used as the first bit to the bit sequence to be transmitted. N min bit;
  • the weight of the K bits of the information bit sequence is set to zero, and the calculation is performed when each bit in the bit sequence of length N max is placed in the N max bit of the bit sequence to be transmitted.
  • Determining the frame error rate of the transmission bit sequence determining the bit corresponding to the maximum frame error rate as the N max bit, and determining the bit sequence to be transmitted from the remaining bits in the bit sequence of length N max
  • the bit with the largest frame error rate is used as the N max -1 bit until the bit determined by the process of determining the N min +1 bit is taken as the N min +1 bit to the N max bit of the bit sequence to be transmitted.
  • the method may further include: using the N min bits as a first type of bit sequence, and using a remaining MN min bits of the coded bit sequence as a second type of bit sequence; Performing at least one of a repeat operation, a puncturing operation, and an interleaving operation on the first type of bit sequence and the second type of bit sequence, respectively, and performing the first operation after the at least one operation And mixing the bit-like sequence with the second-type bit sequence after performing the at least one operation to obtain a mixed bit sequence, such that the first MN min bits of the mixed bit sequence are the N min of the bit sequence to be transmitted N max +1 bit to the bit; bits of said N min and said bit sequence before mixing bits cache MN min; buffer sequentially read bit sequence to be transmitted in bit transmission.
  • the method for rate matching of a Polar code performs Polar code encoding on the information bit sequence to generate a coded bit sequence, and selects a partial bit from the coded bit sequence as a bit sequence to be transmitted in the HARQ transmission process, and is added according to the bit
  • the frame error rate of the transmission bit sequence and the bit sequence to be transmitted are sorted, and HARQ transmission based on Polar code coding can be realized, and a good coding gain can be obtained.
  • the present application provides an apparatus for rate matching of a Polar code, the apparatus comprising:
  • An encoding module configured to perform a Polar code encoding on an information bit sequence of length K bits, to generate a coded bit sequence of length M bits, wherein K and M are positive integers, M is a positive integer power of 2, and M is greater than Or equal to K;
  • a first determining module configured to select N min bits from the encoded bit sequence output by the encoding module, as a first bit to an N min bit of a to-be-transmitted bit sequence of a hybrid automatic repeat request HARQ transmission process, Where N min is the minimum number of bits that may be transmitted for the first transmission in the HARQ transmission process, and the maximum number of bits that the to-be-transmitted bit sequence is allowed to transmit is N max ;
  • a second determining module configured to M bits from the K bits of the information bit sequence and the coded bit sequence to be transmitted is determined in the first bit sequence N min +1 bit to the bits of each of the N max bits, wherein said N min of the to-be transmitted bit sequence for each bit of a bit to the N max +1 bits is in accordance with the bit is added to each of the bit sequence to be transmitted, the The frame error rate of the bit sequence to be transmitted is determined.
  • the first determining module may be specifically configured to: after interleaving the encoded bit sequence, select the first N min bits of the encoded bit sequence after the interleaving, as the to-be-transmitted the first bit to the bit sequence of bits N min.
  • the first determining module interleaving the encoded bit sequence may include: performing bit reverse order BRO ordering on the coded bit sequence, and then performing sequential or reverse ordering. Column.
  • the second determining module may be specifically configured to: use the N min bits as a first type of bit sequence, and use the remaining MN min bits of the encoded bit sequence as a second type of bit sequence to set information bits. K bits of the sequence as a third type of bit sequence; calculating when each bit of the first type of bit sequence, the second type of bit sequence, and the third type of bit sequence is added to the bit sequence to be transmitted Medium, the frame error rate of the bit sequence to be transmitted, the bit corresponding to the minimum frame rate is determined as the N min +1 bit, and then from the first class bit sequence, the second class bit the third sequence and the remaining bits in the bit sequence is determined such that the frame error rate of the bit sequence to be transmitted as the smallest bit N min +2 bits until it is determined that bits of the first N max.
  • the second determining module calculates when each bit of the first type of bit sequence, the second type of bit sequence, and the third type of bit sequence is added to the bit sequence to be transmitted.
  • the frame error rate of the bit sequence to be transmitted may include: calculating, by using a density evolution algorithm, each of the first class bit sequence, the second class bit sequence, and the third class bit sequence The frame error rate of the bit sequence to be transmitted when a bit is added to the bit sequence to be transmitted.
  • the apparatus may further include: a mixing module, configured to repeatedly perform operations on the first type of bit sequence, the second type of bit sequence, and the third type of bit sequence, At least one of a puncturing operation and an interleaving operation, and performing the at least one operation of the first type of bit sequence, performing the at least one operation of the second type of bit sequence Performing a mixing operation on the at least one operation of the third type of bit sequence to obtain a mixed bit sequence, such that the first MN min bits of the mixed bit sequence are the N min +1 bits to the to-be-transmitted bit sequence a N max bit; a buffering module, configured to buffer the N min bits and the first MN min bits of the mixed bit sequence; and a sending module, configured to sequentially read the bits in the to-be-transmitted bit sequence in the buffer Transfer.
  • a mixing module configured to repeatedly perform operations on the first type of bit sequence, the second type of bit sequence, and the third type of bit sequence, At least one of a puncturing operation and an interleaving operation, and performing
  • the first determining module may be specifically configured to: perform puncturing on the encoded bit sequence to obtain a bit sequence having a length of N max after puncturing; calculate when the length is to be frame error rate when a bit sequence N max of each bit in the bit sequence to be N max of transmitted bits, the bit sequence to be transmitted, the error corresponding to the maximum frame rate is determined as the first bit N max Bits, and determining, from the remaining bits in the bit sequence of length N max , a bit that maximizes the frame error rate of the bit sequence to be transmitted as the N max -1 bit until the N min +1 is determined. bits, the remaining bits of the N min as the first bit to the N min bits of the bit sequence to be transmitted;
  • the second determining module may be specifically configured to: set a weight of K bits of the information bit sequence to zero, and perform the calculation when placing each bit in the bit sequence of length N max frame error rate to be transmitted in the first bit sequence of bits N max, bit sequence to be transmitted, the error corresponding to the maximum frame rate is determined as the first bit of bits N max, then from the length of the bit sequence for N max Determining, in the remaining bits, a bit that maximizes the frame error rate of the bit sequence to be transmitted as the N max -1 bit until the bit determined by the process of determining the N min +1 bit is used as the bit sequence to be transmitted. N min +1 bit to N max bit.
  • the apparatus may further include: a mixing module, configured to use the N min bits as a first type of bit sequence, and use the remaining MN min bits of the encoded bit sequence as a second type of bit sequence Performing at least one of a repeat operation, a puncturing operation, and an interleaving operation on the first type of bit sequence and the second type of bit sequence, respectively, and performing the at least one operation Performing a mixing operation on a type of bit sequence and the second type of bit sequence after performing the at least one operation to obtain a mixed bit sequence such that a pre-MN min bit of the mixed bit sequence is the Nth of the bit sequence to be transmitted min + 1'd bit to the bits N max; buffering module, for N min before the MN and the bits of the bit sequence mixing bits caching min; sending module, configured to buffer the sequence to be read The bits in the transmitted bit sequence are transmitted.
  • a mixing module configured to use the N min bits as a first type of bit sequence, and use the remaining MN min bits of the encoded bit sequence as a second
  • the present application provides an apparatus for rate matching of a Polar code, comprising a processor, and a memory, the memory for storing instructions for executing the memory stored instructions when processing
  • the apparatus is used to perform the method of the first aspect and its corresponding aspects when the instructions stored by the memory are executed.
  • a transceiver may also be included in the apparatus for implementing a transceiving related scheme.
  • the apparatus for rate matching of a Polar code performs Polar code encoding on the information bit sequence to generate a coded bit sequence, and selects a partial bit from the coded bit sequence as a previous part of the bit sequence to be transmitted in the HARQ transmission process, according to When a bit is added to the bit sequence to be transmitted, the frame error rate of the bit sequence is transmitted, and bits are selected one by one from the information bit sequence and the coded bit sequence as subsequent bits of the bit sequence to be transmitted.
  • the apparatus of the embodiment of the present invention can implement HARQ transmission based on Polar code encoding, and can obtain a good coding gain.
  • Figure 1 is a schematic diagram of a HARQ transmission process.
  • FIG. 2 is a schematic illustration of a method for rate matching of Polar codes in accordance with one embodiment of the present invention. Sexual flow chart.
  • FIG. 3 is a schematic diagram of a method for rate matching of a Polar code in accordance with another embodiment of the present invention.
  • FIG. 4 is a schematic diagram of performance for rate matching of Polar codes, in accordance with one embodiment of the present invention.
  • 5 is a schematic diagram of performance for rate matching of Polar codes, in accordance with one embodiment of the present invention.
  • FIG. 6 is a schematic diagram of performance for rate matching of Polar codes, in accordance with one embodiment of the present invention.
  • FIG. 7 is a schematic diagram of performance for rate matching of a Polar code, in accordance with one embodiment of the present invention.
  • FIG. 8 is a schematic block diagram of an apparatus for rate matching of a Polar code, in accordance with one embodiment of the present invention.
  • FIG. 9 is a schematic block diagram of an apparatus for rate matching of a Polar code in accordance with another embodiment of the present invention.
  • the Polar code is a linear block code whose generating matrix is G M and the encoding process is among them, Is the mother code of the Polar code, is a binary line vector, the length is M, and its element is the mother code word; Is a binary line vector with a length of M (ie code length); G M is an M ⁇ M matrix, and Here B M is an M ⁇ M transposed matrix, such as a Bit Reversal matrix; It is defined as the Kronecker product of log 2 M matrices F 2 ; the addition and multiplication operations mentioned above are addition and multiplication operations on the binary Galois field.
  • a part of the bits are used to carry information, called information bits, and the set of indices of these bits is denoted as A.
  • the other part of the bits is set to a fixed value pre-agreed by the transceiver, which is called a fixed bit, and the set of indexes is represented by the complement A c of A.
  • these fixed bits are usually set to 0, which is also used in the description of the present invention; in practice, however, only the transceiver end is required to pre-arrange, and the fixed bit sequence can be arbitrarily set.
  • u A is In the set of information bits, u A is a row vector of length K, ie
  • K,
  • the selection of set A determines the performance of the Polar code.
  • the probability density distribution function is a function describing the probability that the output value of the log likelihood ratio is near a certain value point. Calculate the transmission error probability of the polarized channel based on this select
  • the K indexes with the smallest value constitute the set A. It should be understood that the probability of transmission error refers to the probability that one bit is transmitted erroneously.
  • the most basic decoding method of the Polar code is SC decoding.
  • the SC decoding algorithm utilizes a sequence of signals received from the channel One by one Decoding each bit in the middle Estimated sequence
  • SC decoding Serial Cancellation
  • LDPC Low-Density Parity-Check
  • CRC-assisted Successive Cancellation List CASCL
  • CRC-assisted SCS CRC-Aided Successive Cancellation Stack
  • CASCH CRC-assisted Successive Cancellation Hybrid
  • HARQ is a commonly used transmission method to increase system throughput.
  • the transmitting end When transmitting a certain information block, the transmitting end encodes the information block and sends it to the channel. If the receiving end decodes the received signal and finds that the transmission fails, for example, the CRC cannot pass, the receiving end transmits through a feedback link. A non-acknowledgment NACK message is sent to the sender, and the sender re-encodes the information block. This process will continue until the receiving end correctly decodes. At this time, the receiving end sends an acknowledgement ACK message to the transmitting end, thereby completing the transmission of the information block.
  • the receiver In order to obtain the largest possible link throughput, the receiver will buffer all received signals and decode them with the newly received signals, which means that each transmission only transmits a part of the encoder output sequence.
  • This HARQ is called incremental redundancy HARQ and is generally classified as HARQ type 2, which is described as HARQ-II.
  • HARQ technology has been widely used in existing communication systems, such as W-CDMA systems, LTE systems, etc., and in most scenarios, HARQ-II is adopted. In the subsequent descriptions herein, the HARQ technology involved refers to HARQ-II unless otherwise specified.
  • Figure 1 shows the process of encoding and transmitting a sequence of information bits during HARQ transmission.
  • the information bit sequence of length K bits is encoded and interleaved to obtain N max bits to be transmitted to form a bit sequence to be transmitted.
  • R 2 K/N 2
  • the NACK message is still fed back to the sender.
  • the sender After the sender receives the NACK message, it starts the third transmission. This process continues until the receiver decodes successfully and feeds back the ACK message to the sender, or the number of transmissions exceeds the maximum number of transmissions T preset by the system.
  • the HARQ process requires that the encoding be performed by flexibly changing the code rate. All transmitted bits are from the same code sequence, so the receiver can use the same decoder to decode the information bit sequence after each transmission.
  • the code length of a conventional Polar code is strictly limited and must be an integer power of 2, such as 512, 1024, 2048, and the like.
  • the code length of the code can be flexibly adapted according to system requirements. Aiming at this problem, a Polar code coding method for adapting the code length through the puncturing operation is proposed.
  • the punctured pattern sequence contains N max 0s and MN max 1s, the position of which is obtained by initializing the punctured pattern sequence into an all-one sequence, ie all bit indices are initially marked as puncturing positions.
  • i-1 is represented by a binary of length m as (b 1 , b 2 ,. ..,b m ),b j ⁇ 0,1 ⁇ ,1 ⁇ j ⁇ m, ie
  • the channel corresponding to the punctured bit is replaced by a virtual channel of the same type but zero capacity, and then the calculation algorithm is performed by using a density evolution algorithm, a Gaussian approximation algorithm, and the like.
  • the reliability of the channel is selected, and the K sets of information signal index sets A with the highest reliability are selected to carry the information bits.
  • the code length of the punched Polar code can be set to an arbitrary integer.
  • the punctured Polar code is used to perform code construction, that is, when the elements of the index set A are selected, it is necessary to perform optimized reselection according to the puncturing pattern.
  • the HARQ process requires that all transmitted bits come from the same code sequence, so that the decoder can integrate the received signals obtained in each transmission for joint decoding. Therefore, although the code length of the existing punctured Polar code can be arbitrarily configured, since the information bit position selection under different code lengths is not completely the same, this makes it impossible to construct a series of punctured Polar codes of different code lengths. It is obtained by puncturing the same low code rate mother code, so it cannot meet the requirements of HARQ transmission.
  • a HARQ transmission method that can be used based on Polar code :
  • the sequence lengths of the respective transmissions are N 1 , N 2 -N 1 , ..., N T -N T-1 , respectively, wherein the maximum number of retransmissions is T, and N T is equal to N max .
  • a perforated Polar code is first constructed according to N 1 , and the mother code length is That is, when the first transmission is transmitted, a coding sequence of a punctured Polar code is transmitted. If the receiving end feeds back the NACK message, the transmitting end selects the reliability of each polarized channel calculated by the density evolution algorithm or the Gaussian approximation algorithm according to the method of constructing the punched Polar code, and selects one with the lowest reliability from the index set A.
  • the information bits are directly retransmitted, and the reliability of the corresponding polarized channel is updated, and the above selection transmission process is repeated until the number of bits N 2 -N 1 of the second transmission is reached. If the receiving end still feeds back the NACK message, in the third transmission, the transmitting end continues to select N 3 -N 2 information bits for retransmission according to the above method... until the receiving end feeds back the ACK message or the number of transmissions exceeds T.
  • the HARQ transmission process is equivalent to first constructing a code sequence of length N T by Polar coding, puncturing, repetition, etc., wherein the first N 1 bits are obtained by puncturing the Polar code sequence, and then N T -N One bit is obtained by repeating the selection of partial information bits.
  • the corresponding starting point is determined according to the transmission process index, and the bits are sequentially read out from the coding sequence for transmission.
  • This scheme only performs Polar coding at the time of initial transmission, and is only a simple repeated transmission of information bits in the 2nd to the Tth transmissions.
  • the equivalent coding scheme is very close to simply repeating the coding.
  • repeated coding is unable to obtain coding gain. Therefore, the method can only obtain a certain coding gain at the time of initial transmission, and the retransmission can only obtain the diversity gain. Therefore, the rate-adaptive Polar code constructed by the scheme has poor performance when the number of retransmissions is greater than one.
  • the total number of transmitted bits is much larger than N 1 , its performance under the constant-parameter AWGN channel is the same as that without any coding.
  • the specific method of the scheme is to first construct a Polar code according to a preset mother code length M (M is an integer power of 2), the set of information bit indexes is A, and the set of fixed bit indexes is A c , where
  • K,
  • MK.
  • the indices of the fixed bits are arranged from small to large according to the reliability of the corresponding polarized channel as (j 1 , j 2 , . . . , j MK ), j k ⁇ A c , 0 ⁇ k ⁇ MK. If the code length of the desired perforated Polar code is N T , N T ⁇ M, then the MN T fixed bit index with the least reliability is selected.
  • the scheme can adapt the code length within a certain range, and at the same time guarantee the rate-adaptive punched Polar coding of the coding gain.
  • the mother code length M when applied to HARQ transmission, the mother code length M must be greater than the maximum possible number of transmission bits N T (i.e., N max ).
  • N T When applied to HARQ transmission, the mother code length M must be greater than the maximum possible number of transmission bits N T (i.e., N max ).
  • N T maximum possible number of transmission bits
  • N max the decoding complexity is also very large.
  • the order of N max bits to be transmitted it is not further improved, so the performance of the method after rate adaptation is not excellent.
  • the Polar code based HARQ transmission scheme or simply repeating the coding during retransmission, cannot obtain a good coding gain, or can improve the coding gain, but the decoding complexity is very large.
  • the present invention provides a method 100 for rate matching of a Polar code, and the method 100 can be applied to an access point of a base station, a terminal, and a wireless fidelity (Wi-Fi) technology (Access Point). , AP), a terminal of a Wi-Fi technology, a relay node, or the like, but the embodiment of the present invention is not limited to the above communication device.
  • Wi-Fi wireless fidelity
  • the base station may be a device for communicating with the terminal device, for example, may be a base station (Base Transceiver Station, BTS) in the GSM system or CDMA, or a base station (NodeB, NB) in the WCDMA system, or Is an evolved base station in the LTE system (Evolutional Node B, eNB or eNodeB), or the base station may be a relay station, an access point, an in-vehicle device, a wearable device, and a network side device in a future 5G network.
  • BTS Base Transceiver Station
  • NodeB NodeB
  • NB evolved base station in the LTE system
  • the base station may be a relay station, an access point, an in-vehicle device, a wearable device, and a network side device in a future 5G network.
  • the terminal may be a communication with one or more core networks via a radio access network (RAN), and the terminal may refer to a user equipment (User Equipment, UE), an access terminal, a subscriber unit, a subscriber station, a mobile station, Mobile station, remote station, remote terminal, mobile device, user terminal, wireless communication device, user agent or user device.
  • the access terminal may be a cellular phone, a cordless phone, a Session Initiation Protocol (SIP) phone, a Wireless Local Loop (WLL) station, a Personal Digital Assistant (PDA), with wireless communication.
  • the method 100 for rate matching of a Polar code may include:
  • N min bits from the coded bit sequence as the first bit to the N min bit of the to-be-transmitted bit sequence of the hybrid automatic repeat request HARQ transmission process, where N min is the first in the HARQ transmission process The minimum number of bits that may be transmitted by the secondary transmission, and the maximum number of bits that the to-be-transmitted bit sequence is allowed to transmit is N max ;
  • the frame error rate refers to the probability that the decoding end cannot correctly decode the information bit sequence (K bits) according to the received bit sequence.
  • the frame error rate of the bit sequence to be transmitted can be estimated by an algorithm such as a density evolution algorithm (or more preferably, a Gaussian approximation density evolution algorithm).
  • each The bit sequence in the process performs at least one of a puncturing operation, a repetitive operation, and an interleaving operation, or may perform the foregoing operations a plurality of times to improve the coding performance, which is not limited in the embodiment of the present invention.
  • the starting position of each transmission in the bit sequence to be transmitted is determined according to the length of each HARQ transmission, from the cache.
  • the bits of the bit sequence to be transmitted are read for transmission.
  • the method for rate matching of a Polar code in the embodiment of the present invention performs Polar code encoding on the information bit sequence to generate a coded bit sequence, and selects a partial bit from the coded bit sequence as a first part of the bit sequence of the to-be-transmitted bit sequence in the HARQ transmission process.
  • the bit is added to the bit sequence to be transmitted, the frame error rate of the bit sequence is transmitted, and the bits are successively selected from the information bit sequence and the coded bit sequence as subsequent bits of the bit sequence to be transmitted.
  • the method of the embodiment of the present invention can implement HARQ transmission based on Polar code coding, and can obtain a good coding gain.
  • the good coding gain is obtained because not only the information bits are considered in the bit sequence to be transmitted, but also the coding bits are added, so that the bit sequence to be transmitted carries more kinds of bits, thereby improving the bit number compared with the existing HARQ transmission. Coding gain.
  • method 200 includes:
  • S210 Perform a Polar code encoding on a K-bit information bit sequence (for example, can be encoded by a conventional Polar code encoder) to generate a coded bit sequence of length M bits.
  • M 2 m
  • m is a predetermined positive integer greater than 1
  • M is greater than or equal to K.
  • the set of polarized channel indices corresponding to the information bits is A.
  • S210 corresponds to S110 of method 100, and m may select different values in different embodiments, and specific examples will be described below.
  • S220 Perform an interleaving operation on the encoded bit sequence output by the Polar encoder to obtain an interleaved bit sequence.
  • a typical interleaving operation (such as the first interleaving operation shown in FIG. 3) may be a BRO sorting of the encoded bit sequences, followed by sequential or reverse ordering.
  • the embodiment of the present invention does not limit the interleaving operation, and the embodiment of the present invention may also use other interleaving operations, or use multiple interleaving operations in combination, and the embodiment of the present invention may not interleave the encoding bit sequence.
  • the operation is not limited in the embodiment of the present invention.
  • N min bits from the interleave bit sequence of length M bits obtained in S220 as the first bit to the N min bit of the bit sequence to be transmitted in the HARQ transmission process.
  • N min is equal to 0 ⁇ ⁇ ⁇ 1, Take the rounding operation.
  • S230 corresponds to S120 of method 100, and N min bits may be directly before the interleaving bit sequence is selected. Bits, which can also be selected according to the punch pattern The bits are also selected by other means, which is not limited by the embodiment of the present invention.
  • bit sequences including the above Bits (ie, N min bits)
  • the second type of bit sequence includes the remaining bits of the M-bit interleaved bit sequence One bit (MN min bits)
  • the third type of bit sequence includes K bits of the information bit sequence.
  • the at least one operation of the first type of bit sequence, the second type of bit sequence after performing the at least one operation, and the third type of bit sequence after performing the at least one operation are mixed to obtain a mixed bit sequence.
  • the first MN min bits of the mixed bit sequence are taken as the N min +1 bits to the N max bits of the bit sequence to be transmitted.
  • a first repetition operation and a first puncturing operation are performed on the first type of bit sequence (of course, an interleaving operation may also be performed, which is not shown in FIG. 3);
  • the bit sequence performs the second repeating operation and the second puncturing operation (the same can also be performed for the interleaving operation, not shown in FIG. 3); performing the third repeating operation and the third puncturing operation on the third type of bit sequence (same reason Interleaving operations can also be performed, not shown in Figure 3.
  • the above operation of obtaining the mixed bit sequence is set according to the result of the following calculation.
  • the calculation is: calculating a frame error rate of the bit sequence to be transmitted when each bit in the first type of bit sequence, the second type of bit sequence, and the third type of bit sequence is added to the bit sequence to be transmitted And determining, according to the minimum frame error rate, the corresponding bit as the N min +1 bit, and determining from the first type of the bit sequence, the second type of the bit sequence, and the remaining bits of the third type of bit sequence
  • the bit with the smallest frame error rate of the bit sequence to be transmitted is taken as the N min + 2 bits until the N max bit is determined.
  • the frame error rate of the bit sequence to be transmitted is calculated when the bits are added to the bit sequence to be transmitted, and the N min +1 bit added to the bit sequence to be transmitted is sequentially determined according to the frame error rate of the bit sequence to be transmitted. of N max bits.
  • N max is the number of bits of the bit sequence to be transmitted, which is a preset maximum number of bits allowed to be transmitted during HARQ transmission of the code block.
  • the bit sequence to be transmitted can be stored in the cache. That is, N min bits and the first MN min bits of the mixed bit sequence are buffered to form a sequence to be transmitted to wait for HARQ transmission.
  • S240 corresponds to S130 of method 100.
  • the manner of determining the N min +1 bit to the N max bit of the bit sequence to be transmitted from the K bits of the information bit sequence and the M bits of the coded bit sequence may be various. limited.
  • the transmitting end determines, according to the length of each transmission of the HARQ, the starting position of each transmission in the bit sequence to be transmitted, and sequentially reads the bits of the bit sequence to be transmitted from the buffer for transmission.
  • the length M of the coded bit sequence (ie, the mother code) in the above steps, the repeated operations, the puncturing operation, and the interleaving operation may be jointly designed with the index set A.
  • a mother code length M is set according to the system requirements for the code complexity, and M is greater than or equal to K (corresponding to S210). Preferably, among them, To round up on log 2 N min .
  • the construction code length is ( A punctured Polar code equal to N min ) (corresponding to S220 and S230).
  • the coded bit sequence of the code length M is obtained by performing the first interleaving operation. After replacing the channel corresponding to each bit with a non-property channel having a capacity of zero, the capacity of each polarized channel is calculated, and K channels for carrying information bits are selected therefrom, and the index set is A.
  • the first interleaving operation is to perform BRO ordering on the coded bit sequence, and then perform sequential or reverse order.
  • the second interleaving operation is performed on the encoded bit sequence after the first interleaving operation, wherein the second interleaving operation is configured in a through mode, that is, the bit with the index i in the input sequence corresponds to the sequence number in the output sequence is also i.
  • the bits are selected from the three types of bit sequences one by one and added to the bit sequence to be transmitted.
  • This process can estimate the FER performance under SC decoding by using techniques such as density evolution algorithm or Gaussian approximation algorithm, each time from the first type of bit sequence, second. Selecting one bit from the class bit sequence or the third class bit sequence that can minimize the estimation value of the FER, that is, selecting one bit from the first class bit sequence, the second class bit sequence, or the third class bit sequence to make the determined
  • the portion of the bit sequence to be transmitted, including the bit has the smallest frame error rate, which is added to the bit sequence to be transmitted. The selection process is repeated until the length of the bit sequence to be transmitted reaches N max .
  • the embodiment of the present invention can adopt an unimproved density evolution algorithm, and more preferably, a Gaussian Approximation for Density Evolution can be used, and the simplified algorithm is called a Gaussian approximation algorithm. Gaussian Approximation).
  • the algorithm used in the embodiment of the present invention does not limit the algorithm.
  • the N min bits are used as the first type of bit sequence
  • the remaining MN min bits of the coded bit sequence are used as the second type of bit sequence
  • the K bits of the information bit sequence are used as the third type of bit sequence; Calculating a frame error rate of the bit sequence to be transmitted when each bit of the first type of bit sequence, the second type of bit sequence, and the third type of bit sequence is added to the bit sequence to be transmitted, When the rate is minimum, the corresponding bit is determined as the N min +1 bit, and then the bit sequence to be transmitted is determined from the first bit sequence, the second class bit sequence, and the remaining bits in the third class bit sequence. The bit with the smallest frame error rate is taken as the N min + 2 bits until the N max bit is determined.
  • the configurations of the corresponding repeated operations, the puncturing operations, and the interleaving operations in S240 may be determined according to the indexes in the three types of bits corresponding to the respective bits in the final to-be-transmitted bit sequence.
  • a bit sequence consisting of a length of K information bit sequence and MK fixed bits of all zeros Transmitting a polarization code encoder with a code length of M to obtain a coded bit sequence
  • the MN min bits in the sequence are deleted according to the minimum number of bits N min that may be transmitted for the first transmission in the HARQ transmission process required by the system; the index of the reserved coded bits (the index before interleaving) is recorded as The index set of information bits is A.
  • the starting point is determined according to the transmission index and the sequence length of each transmission, and the transmission bit sequence is transmitted.
  • the middle order takes the corresponding bit for transmission.
  • the function The Gaussian approximation algorithm is used to calculate the frame error rate of each bit.
  • the function ⁇ -1 (x) represents its inverse function
  • the method for rate matching of a Polar code performs Polar code encoding on the information bit sequence to generate a coded bit sequence, and selects a partial bit from the coded bit sequence as a first part of the bit sequence to be transmitted in the HARQ transmission process, according to When the bit is added to the bit sequence to be transmitted, the frame error rate of the transmission bit sequence is selected one by one from the information bit sequence and the coded bit sequence, and as the subsequent bit of the bit sequence to be transmitted, HARQ based on Polar code coding can be implemented. Transmission, and can get a good coding gain.
  • the mother code length is set to among them, To round up the log 2 N max .
  • the construction code length is ( A punctured Polar code equal to N max ) (corresponding to S220 and S230).
  • the coded bit sequence of the code length M is obtained by performing the first interleaving operation. After replacing the channel corresponding to each bit with a non-property channel having a capacity of zero, the capacity of each polarized channel is calculated, and K channels for carrying information bits are selected therefrom, and the index set is A.
  • the first interleaving operation is to perform BRO ordering on the coded bit sequence, and then perform sequential or reverse order.
  • the second interleaving operation is performed on the encoded bit sequence after the first interleaving operation, wherein the second interleaving operation is configured in a through mode, that is, the bit with the index i in the input sequence corresponds to the sequence number in the output sequence is also i.
  • the FER performance under SC decoding is estimated by using a density evolution algorithm or a Gaussian approximation algorithm that further simplifies the calculation based on the density evolution algorithm, and one bit that can maximize the increment of the estimated value of the FER is selected from the N max bits.
  • the selection process is repeated until the N min +1 bit of the bit sequence to be transmitted is determined. N min remaining bits to be transmitted for the first bit to the bit sequence of bits N min.
  • S120 N min selecting bits from the coded bit sequence, as the hybrid automatic repeat request of the first bit to the N min bits of the bit sequence to be transmitted HARQ transmission process may include: for playing the coded bit sequence a hole, obtaining a bit sequence having a length of N max after puncturing; calculating, when each bit in the bit sequence of length N max is placed in the N max bit of the bit sequence to be transmitted, the bit sequence to be transmitted a frame error rate, the bit with the largest frame error rate is determined as the N max bit, and the bit that maximizes the frame error rate of the bit sequence to be transmitted is determined as the Nth from the remaining bits in the bit sequence of length N max Max -1 bit until the first N min +1 bit is determined, and the remaining N min bits are the first bit to the N min bit of the bit sequence to be transmitted;
  • S130 determines from each bit of the M bits of the K bits of the information bit sequence and the coded bit sequence to be transmitted in the bit sequence of N min +1 bit to the bits of the N max, may include: the information bits The weight of the K bits of the sequence is set to zero, and the calculation is performed when the bit in the bit sequence of length N max is placed in the N max bit of the bit sequence to be transmitted. a frame rate, where the bit corresponding to the maximum frame rate is determined to be the N max bit, and the bit remaining in the bit sequence of the length N max is determined to be the bit that maximizes the frame error rate of the bit sequence to be transmitted. N max -1 bit until the bit determined by the process of the N min +1 bit is determined as the N min +1 bit to the N max bit of the bit sequence to be transmitted.
  • the first bit to the N min-bit bit sequence is a first type, determined in the above procedure to N max -N min bits of the second type bit sequence.
  • the third type of bit sequence is not used, and its code rate can be set to 0 in the repeated operation of S240.
  • each repeated operation, the puncturing operation, and the interleaving operation in S240 may be determined according to the indexes in the first type of bit sequence and the second type of bit sequence corresponding to the respective bits in the final to-be-transmitted bit sequence.
  • the N min bits are used as the first type of bit sequence, and the remaining MN min bits of the coded bit sequence are used as the second type of bit sequence; by respectively, the first type of bit sequence and the second type of bit sequence are respectively Performing at least one of a repeat operation, a puncturing operation, and an interleaving operation, and mixing the first type of bit sequence after performing the at least one operation and the second type of bit sequence after performing the at least one operation Operation, obtaining a mixed bit sequence such that the first MN min bits of the mixed bit sequence are the N min +1 bits to the N max bits of the bit sequence to be transmitted; the N min bits and the pre-MN of the mixed bit sequence
  • the min bits are buffered; the bits in the bit sequence to be transmitted in the sequential read buffer are transmitted.
  • the method for rate matching of a Polar code in the embodiment of the present invention performs Polar code encoding on the information bit sequence to generate a coded bit sequence, and selects a partial bit from the coded bit sequence as a bit sequence to be transmitted in the HARQ transmission process, and is added according to the bit.
  • the bit sequence to be transmitted is transmitted, the frame error rate of the transmission bit sequence and the bit sequence to be transmitted are sorted, and HARQ transmission based on Polar code coding can be realized, and a good coding gain can be obtained.
  • a bit sequence consisting of a length of K information bit sequence and MK fixed bits of all zeros Transmitting a polarization code encoder with a code length of M to obtain a coded bit sequence
  • the last MN max bits in the sequence are deleted according to the maximum code length N max of the bit sequence to be transmitted in the HARQ transmission process required by the system, and the information bit number set is A.
  • the starting point is determined according to the transmission index and the sequence length of each transmission, and the transmission bit sequence is transmitted.
  • the middle order takes the corresponding bit for transmission.
  • the method for calculating the frame error rate may be similar to the method of the previous example, and details are not described herein again.
  • FER performance for a scheme based on Polar code for HARQ transmission.
  • 4 to 7 are graphs showing the FER performance of the two schemes when N max is taken as 320, 360, 400, and 450, respectively.
  • the solution of the present invention can obtain a larger coding gain than the rate adaptation scheme of the existing Polar code under the various code length configurations involved.
  • the rate matching method for the Polar code provided by the embodiment of the present invention performs coding, and the finally outputted bit sequence to be transmitted can be flexibly configured within the maximum number of transmission bits N max , and The information bit number set A in the mother code and the mother code are the same, and the obtained codes of each code length can be decoded by using the same Polar code decoder. Therefore, the proposed scheme of the present invention can well meet the requirements of the HARQ transmission technology.
  • bit reverse ordering involved in the embodiments of the present invention is a general concept applied to mathematics.
  • a sequence containing a elements, where a 2 b , ie a is an integer power of two.
  • the index of a element in the sequence is defined by a number from 0 to a-1. These index numbers are represented by a binary of length b.
  • the binary representation of these index numbers is inverted, ie, "1" in the binary representation is inverted to "0", and "0" in the binary representation is inverted to "1".
  • Each element is mapped to a new position after the inversion, and the above is the bit reverse order.
  • Performing a two-bit reverse ordering of a sequence results in a sequence of the original order.
  • the bit reverse ordering maps the element with the index a-1 to the position where the index is 0, and the element with the index a-2 to the position with the index of 1, until all the elements are rearranged.
  • FIG. 8 shows an apparatus 300 for rate matching of Polar codes in accordance with an embodiment of the present invention.
  • Apparatus 300 includes:
  • the encoding module 310 is configured to perform a Polar code encoding on the information bit sequence of length K bits to generate a coded bit sequence of length M bits, where K and M are positive integers, M is a positive integer power of 2, and M Greater than or equal to K;
  • the first determining module 320 is configured to select N min bits from the coded bit sequence output by the encoding module 310 as the first bit to the N min bit of the to-be-transmitted bit sequence of the hybrid automatic repeat request HARQ transmission process, Where N min is the minimum number of bits that may be transmitted for the first transmission in the HARQ transmission process, and the maximum number of bits that the to-be-transmitted bit sequence is allowed to transmit is N max ;
  • Second determining module 330 for determining a bit every N min +1 N max bit to the bits of the bit sequence to be transmitted from the M bits of the K bits of the information bit sequence and the coded bit sequence, wherein, determining each bit of the N min +1 bit to the N max bit of the bit sequence to be transmitted is an error frame of the bit sequence to be transmitted according to adding the each bit to the bit sequence to be transmitted The rate is determined.
  • the first determining module 320 is specifically configured to: after interleaving the coded bit sequence, select the first N min bits of the coded bit sequence after the interleaving, as the bit sequence to be transmitted. Bit 1 to N min bits.
  • the first determining module 320 performs interleaving on the coded bit sequence, including: performing bit reverse order BRO ordering on the coded bit sequence, and then performing sequential or reverse order.
  • the second determining module 330 is specifically configured to: use the N min bits as the first type of bit sequence, and use the remaining MN min bits of the encoded bit sequence as the second type. a bit sequence, the K bits of the information bit sequence are used as a third type of bit sequence; calculating when each bit of the first type of bit sequence, the second type of bit sequence, and the third type of bit sequence is added to the to-be-transmitted In the bit sequence, the frame error rate of the bit sequence to be transmitted, the bit corresponding to the minimum frame rate is determined as the N min +1 bit, and then from the first class bit sequence, the second class bit sequence and Among the remaining bits in the third type of bit sequence, a bit that minimizes the frame error rate of the bit sequence to be transmitted is determined as the N min + 2 bits until the N max bit is determined.
  • the second determining module 320 calculates that each bit in the first type bit sequence, the second type bit sequence, and the third type bit sequence is added to the to-be-transmitted bit.
  • the frame error rate of the bit sequence to be transmitted includes: using a density evolution algorithm (or, more preferably, a Gaussian approximation algorithm based on a density evolution algorithm), calculating when the first class bit sequence, the second The frame error rate of the bit sequence to be transmitted when each bit in the class bit sequence and the third class bit sequence is added to the bit sequence to be transmitted.
  • the apparatus 300 further includes:
  • a mixing module configured to perform at least one of a repeat operation, a puncturing operation, and an interleaving operation on the first type of bit sequence, the second type of bit sequence, and the third type of bit sequence, respectively, and perform the at least one An operation of the first type of bit sequence, the second type of bit sequence after performing the at least one operation, and the third type of bit sequence after performing the at least one operation are mixed to obtain a mixed bit sequence
  • the first MN min bits of the mixed bit sequence are the N min +1 bits to the N max bits of the bit sequence to be transmitted;
  • the buffer module is configured to use the N min bits and the first MN min of the mixed bit sequence
  • the bit is buffered;
  • the sending module is configured to sequentially read the bits in the bit sequence to be transmitted in the buffer for transmission.
  • the first determining module 320 is specifically configured to: perform puncturing on the coded bit sequence to obtain a bit sequence having a length of N max after puncturing; and calculate when the length is N max The bit error rate of the bit sequence to be transmitted when each bit in the bit sequence is placed in the N max bit of the bit sequence to be transmitted, and the corresponding bit is determined to be the N max bit when the bit error rate is maximum, and then N max is the length of the bit sequence of the remaining bits is determined such that the maximum frame error rate of the bits to be transmitted as the bit sequence N max -1 bits, until it is determined that the first bit of N min + 1'd, the remaining number N min bit as the first bit to the N min bits of the bit sequence to be transmitted; the second determining module 320 is configured to: weight the K bits of the information bit sequence is reset to zero, when the calculated length of the a frame error rate of the bit sequence of N max of each bit in the bit sequence to be transmitted N max bits
  • the apparatus 300 further includes: a mixing module, configured to use the N min bits as a first type of bit sequence, and the remaining MN min bits of the coded bit sequence As a second type of bit sequence, by performing at least one of a repeat operation, a puncturing operation, and an interleaving operation on the first type of bit sequence and the second type of bit sequence, and performing the at least one operation
  • the first type of bit sequence and the second type of bit sequence after performing the at least one operation are mixed to obtain a mixed bit sequence, such that the first MN min bits of the mixed bit sequence are the N min of the bit sequence to be transmitted.
  • the bits are transmitted.
  • the encoding module 310, the first determining module 320, the second determining module 330, and the mixing module may be implemented by a processor, and the cache module may be implemented by a memory.
  • device 400 can include a processor 410 and a memory 420, and can also include a transceiver 430 for receiving or transmitting a sequence of bits.
  • the memory 420 can be used to store code and the like executed by the processor 410, and can also be used to buffer a bit sequence to be transmitted.
  • bus system 440 may include, in addition to a data bus, a power bus, a control bus, a status signal bus, and the like.
  • the device 400 shown in FIG. 9 or the device 300 shown in FIG. 8 can implement the various processes implemented in the foregoing embodiments of FIG. 1 to FIG. 3. To avoid repetition, details are not described herein again.
  • the processor may be an integrated circuit chip with signal processing capabilities.
  • each step of the foregoing method embodiment may be completed by an integrated logic circuit of hardware in a processor or an instruction in a form of software.
  • the processor may be a general-purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a Field Programmable Gate Array (FPGA), or the like. Programming logic devices, discrete gates or transistor logic devices, discrete hardware components.
  • the methods, steps, and logical block diagrams disclosed in the embodiments of the present invention may be implemented or carried out.
  • the general purpose processor may be a microprocessor or the processor or any conventional processor or the like.
  • the steps of the method disclosed in the embodiments of the present invention may be directly implemented by the hardware decoding processor, or may be performed by a combination of hardware and software modules in the decoding processor.
  • the software module can be located in a conventional storage medium such as random access memory, flash memory, read only memory, programmable read only memory or electrically erasable programmable memory, registers, and the like.
  • the storage medium is located in the memory, and the processor reads the information in the memory and combines the hardware to complete the steps of the above method.
  • the memory in the embodiments of the present invention may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memory.
  • the non-volatile memory may be a read-only memory (ROM), a programmable read only memory (PROM), an erasable programmable read only memory (Erasable PROM, EPROM), or an electric Erase programmable read only memory (EEPROM) or flash memory.
  • the volatile memory can be a Random Access Memory (RAM) that acts as an external cache.
  • RAM Random Access Memory
  • many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (Synchronous DRAM).
  • SDRAM Double Data Rate SDRAM
  • DDR SDRAM Double Data Rate SDRAM
  • ESDRAM Enhanced Synchronous Dynamic Random Access Memory
  • SLDRAM Synchronous Connection Dynamic Random Access Memory
  • DR RAM direct memory bus random access memory
  • the encoding module 310 of the embodiment of the present invention may correspond to an encoder of an entity
  • the interleaving function of the first determining module 320 may correspond to an interleaver of the entity
  • the cache module may correspond to an entity.
  • the embodiment of the present invention does not limit the buffer.
  • the disclosed systems, devices, and methods may be implemented in other manners.
  • the device embodiments described above are merely illustrative.
  • the division of the unit is only a logical function division.
  • there may be another division manner for example, multiple units or components may be combined or Can be integrated into another system, or some features can be ignored or not executed.
  • the mutual coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interface, device or unit, and may be in an electrical, mechanical or other form.
  • the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of the embodiment.
  • each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
  • the functions may be stored in a computer readable storage medium if implemented in the form of a software functional unit and sold or used as a standalone product.
  • the technical solution of the present invention which is essential or contributes to the prior art, or a part of the technical solution, may be embodied in the form of a software product, which is stored in a storage medium, including
  • the instructions are used to cause a computer device (which may be a personal computer, server, or network device, etc.) to perform all or part of the steps of the methods described in various embodiments of the present invention.
  • the foregoing storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (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)
  • Quality & Reliability (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)
  • Error Detection And Correction (AREA)

Abstract

La présente invention concerne un procédé et un dispositif d'adaptation de débit d'un code polaire. Le procédé comprend les étapes suivantes : exécuter un codage de code polaire sur une séquence de bits d'information avec une longueur de K bits, et générer une séquence de bits de codage avec une longueur de M bits; sélectionner Nmin bits parmi la séquence de bits de codage en tant que premier bit à Nmin-ième bit d'une séquence de bits à transmettre pendant un processus de demande de répétition automatique hybride (HARQ); déterminer chaque bit du (Nmin+1)ième bit au Nmax-ième bit de la séquence de bits à transmettre à partir de la séquence de bits d'information et la séquence de bits de codage, chaque bit du (Nmin+1)ième bit au Nmax-ième bit de la séquence de bits à transmettre étant déterminé en fonction d'un taux d'erreur sur les trames de la séquence de bits à transmettre lorsque chaque bit est ajouté dans la séquence de bits à transmettre. Grâce au procédé des modes de réalisation de la présente invention, on peut obtenir une transmission HARQ basée sur un codage de code polaire, et un meilleur gain de codage peut être obtenu.
PCT/CN2016/104381 2015-12-02 2016-11-02 Procédé et dispositif d'adaptation de débit d'un code polaire WO2017092543A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201510870909.7 2015-12-02
CN201510870909.7A CN106817195B (zh) 2015-12-02 2015-12-02 用于极化码的速率匹配的方法和装置

Publications (1)

Publication Number Publication Date
WO2017092543A1 true WO2017092543A1 (fr) 2017-06-08

Family

ID=58796243

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/104381 WO2017092543A1 (fr) 2015-12-02 2016-11-02 Procédé et dispositif d'adaptation de débit d'un code polaire

Country Status (2)

Country Link
CN (1) CN106817195B (fr)
WO (1) WO2017092543A1 (fr)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107342846A (zh) * 2017-06-27 2017-11-10 华为技术有限公司 一种编码方法、无线设备和芯片
CN107425941A (zh) * 2017-06-16 2017-12-01 华为技术有限公司 速率匹配和解速率匹配的方法及装置
CN109327280A (zh) * 2017-08-01 2019-02-12 华为技术有限公司 分段编码方法及装置
CN109525360A (zh) * 2017-09-18 2019-03-26 华为技术有限公司 极化码的速率匹配的方法和装置
CN110800216A (zh) * 2017-06-19 2020-02-14 三星电子株式会社 用于通信和广播系统的速率匹配的方法和装置
US11646830B2 (en) * 2018-05-28 2023-05-09 Qualcomm Incorporated Polar code construction for incremental redundancy

Families Citing this family (28)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109150376B (zh) 2017-06-16 2022-02-15 大唐移动通信设备有限公司 一种信道编码方法及设备
CN109150381A (zh) * 2017-06-18 2019-01-04 株式会社Ntt都科摩 极化编码方法、极化编码器和无线通信设备
CN109150384B (zh) * 2017-06-27 2020-11-17 华为技术有限公司 极化码编码的方法和装置
CN111030707B (zh) 2017-07-28 2020-10-27 华为技术有限公司 一种Polar码编码方法及装置
CN109391353B (zh) * 2017-08-11 2021-09-14 华为技术有限公司 一种速率匹配的方法和装置
CN109391363B (zh) 2017-08-11 2020-08-25 华为技术有限公司 一种交织方法及装置
WO2019036867A1 (fr) * 2017-08-21 2019-02-28 Qualcomm Incorporated Techniques d'adaptation de débit pour codes polaires
CN109428675B (zh) * 2017-08-30 2022-05-24 华为技术有限公司 数据传输方法及装置
US10594439B2 (en) 2017-09-08 2020-03-17 Huawei Technologies Co., Ltd. Channel encoding method and apparatus in wireless communications to output a polar encoded bit sequence
WO2019047788A1 (fr) 2017-09-08 2019-03-14 华为技术有限公司 Procédé et dispositif de codage
CN108234081B (zh) * 2017-09-08 2019-02-12 华为技术有限公司 编码方法及装置
CN109495210B (zh) * 2017-09-13 2020-07-31 上海诺基亚贝尔股份有限公司 用于在无线通信系统中交织数据的方法、设备和计算机可读存储介质
CN109586843B (zh) * 2017-09-29 2024-05-03 华为技术有限公司 通信系统中冗余版本的设计方案
CN109672497B (zh) * 2017-10-16 2021-09-28 普天信息技术有限公司 一种极化码的速率匹配方法及装置
CN109756307B (zh) * 2017-11-02 2020-11-17 华为技术有限公司 数据重传方法及装置
WO2019095270A1 (fr) 2017-11-17 2019-05-23 Qualcomm Incorporated Segmentation d'informations de commande de liaison montante pour codes polaires
WO2019095362A1 (fr) 2017-11-20 2019-05-23 Qualcomm Incorporated Techniques et appareils pour la conception de demande de répétition automatique hybride de codes polaires pour des communications à faible latence ultra-fiables
CN110048802B (zh) 2018-01-16 2021-12-28 华为技术有限公司 数据传输方法及装置、系统
CN108304658B (zh) * 2018-02-02 2020-05-19 中国计量大学 一种基于fpga的极化码编码器硬件实现方法
WO2019157617A1 (fr) * 2018-02-13 2019-08-22 Qualcomm Incorporated Techniques et appareils pour une demande de répétition automatique hybride (harq) codée polaire à polarisation de canal incrémentielle
CN109257144B (zh) * 2018-10-11 2021-03-19 暨南大学 可变速率harq-ir的低复杂度设计方法
CN111181695B (zh) * 2018-11-12 2022-12-02 中兴通讯股份有限公司 一种极化码混合自动重传请求方法、装置和系统
CN111371527B (zh) * 2018-12-25 2021-08-13 华为技术有限公司 一种数据传输方法及通信设备
CN109889307B (zh) * 2019-01-24 2021-06-01 东南大学 一种基于组合极化码的打孔方法
CN110048813B (zh) * 2019-04-17 2021-10-08 上海道生物联技术有限公司 一种无线通信帧结构信号处理方法
WO2020227915A1 (fr) * 2019-05-14 2020-11-19 Qualcomm Incorporated Adaptation de débit souple de codes polaires
CN116346277A (zh) * 2021-12-13 2023-06-27 华为技术有限公司 一种速率匹配的方法及装置
WO2024092517A1 (fr) * 2022-11-01 2024-05-10 Zte Corporation Procédé et appareil de transmission de données

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103281166A (zh) * 2013-05-15 2013-09-04 北京邮电大学 一种基于极化码的混合自动重传请求传输方法
CN103825669A (zh) * 2012-11-16 2014-05-28 华为技术有限公司 数据处理的方法和装置
WO2015026148A1 (fr) * 2013-08-20 2015-02-26 엘지전자 주식회사 Procédé de transmission de données à l'aide d'un codage polaire dans un système d'accès sans fil
WO2015139297A1 (fr) * 2014-03-21 2015-09-24 华为技术有限公司 Procédé d'adaptation de débit de code polaire et dispositif d'adaptation de débit

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2015062107A1 (fr) * 2013-11-04 2015-05-07 华为技术有限公司 Procédé et appareil d'adaptation de débit pour codes polaires, et dispositif de communication sans fil

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103825669A (zh) * 2012-11-16 2014-05-28 华为技术有限公司 数据处理的方法和装置
CN103281166A (zh) * 2013-05-15 2013-09-04 北京邮电大学 一种基于极化码的混合自动重传请求传输方法
WO2015026148A1 (fr) * 2013-08-20 2015-02-26 엘지전자 주식회사 Procédé de transmission de données à l'aide d'un codage polaire dans un système d'accès sans fil
WO2015139297A1 (fr) * 2014-03-21 2015-09-24 华为技术有限公司 Procédé d'adaptation de débit de code polaire et dispositif d'adaptation de débit

Cited By (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107425941B (zh) * 2017-06-16 2022-11-18 华为技术有限公司 速率匹配和解速率匹配的方法及装置
CN107425941A (zh) * 2017-06-16 2017-12-01 华为技术有限公司 速率匹配和解速率匹配的方法及装置
US11689220B2 (en) 2017-06-16 2023-06-27 Huawei Technologies Co., Ltd. Method and device for interleaving data
CN110800216B (zh) * 2017-06-19 2023-07-04 三星电子株式会社 用于通信和广播系统的速率匹配的方法和装置
CN110800216A (zh) * 2017-06-19 2020-02-14 三星电子株式会社 用于通信和广播系统的速率匹配的方法和装置
CN107342846B (zh) * 2017-06-27 2023-01-13 华为技术有限公司 一种编码方法、无线设备和芯片
CN107342846A (zh) * 2017-06-27 2017-11-10 华为技术有限公司 一种编码方法、无线设备和芯片
CN109327280B (zh) * 2017-08-01 2021-01-15 华为技术有限公司 分段编码方法及装置
CN109327280A (zh) * 2017-08-01 2019-02-12 华为技术有限公司 分段编码方法及装置
US11362760B2 (en) 2017-09-18 2022-06-14 Huawei Technologies Co., Ltd. Polar code rate matching method and apparatus
US10958374B2 (en) 2017-09-18 2021-03-23 Huawei Technologies Co., Ltd. Polar code rate matching method and apparatus
CN109525360B (zh) * 2017-09-18 2020-10-16 华为技术有限公司 极化码的速率匹配的方法和装置
CN109525360A (zh) * 2017-09-18 2019-03-26 华为技术有限公司 极化码的速率匹配的方法和装置
US11646830B2 (en) * 2018-05-28 2023-05-09 Qualcomm Incorporated Polar code construction for incremental redundancy

Also Published As

Publication number Publication date
CN106817195A (zh) 2017-06-09
CN106817195B (zh) 2020-04-21

Similar Documents

Publication Publication Date Title
WO2017092543A1 (fr) Procédé et dispositif d'adaptation de débit d'un code polaire
US10374754B2 (en) Polar code rate matching method and apparatus, and wireless communications device
US10461779B2 (en) Rate-compatible polar codes
US10469207B2 (en) Polar code retransmission method and apparatus
EP3570475B1 (fr) Adaptation de débit pour un bloc de code ldpc stocké dans un tampon circulaire pour des transmissions harq
WO2018045849A1 (fr) Procédé et dispositif de retransmission de code polaire
WO2015180187A1 (fr) Procédé et appareil permettant d'élaborer un code polaire poinçonné
JP7248762B2 (ja) データ処理方法およびデバイス
WO2020048537A1 (fr) Procédé et dispositif de codage en cascade
WO2018019082A1 (fr) Procédé de retransmission de code polaire et dispositif d'envoi et dispositif de réception associés
US20240030941A1 (en) Encoding and decoding method and apparatus
JP2022516802A (ja) ワイヤレスネットワークでのデータ再送信
US20230171033A1 (en) Retransmission method and apparatus
US11695435B2 (en) Data transmission method, apparatus, and system
CN109391356B (zh) 编码方法、译码方法、编码装置和译码装置
CN113078911A (zh) Ldpc码的编码的方法和通信装置
US10581464B2 (en) Encoder device, decoder device, and methods thereof
CN109756307B (zh) 数据重传方法及装置
CN114070461A (zh) 一种重传方法及装置
US20230224082A1 (en) Retransmission method and apparatus
WO2021136539A1 (fr) Procédé de mise en correspondance de débit de code convolutif et appareil de communication sans fil
CN113708778A (zh) Ldpc的速率匹配的方法和通信装置
WO2015176284A1 (fr) Procédé et appareil de transmission de données
US20230163784A1 (en) Polar code encoding method and apparatus, and decoding method and apparatus
WO2022036657A1 (fr) Extension permutée et codes de contrôle de parité à faible densité raccourcis pour demande de répétition automatique hybride

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

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 16869853

Country of ref document: EP

Kind code of ref document: A1