WO2018127206A1 - 极性Polar码的速率匹配处理方法及装置 - Google Patents
极性Polar码的速率匹配处理方法及装置 Download PDFInfo
- Publication number
- WO2018127206A1 WO2018127206A1 PCT/CN2018/071956 CN2018071956W WO2018127206A1 WO 2018127206 A1 WO2018127206 A1 WO 2018127206A1 CN 2018071956 W CN2018071956 W CN 2018071956W WO 2018127206 A1 WO2018127206 A1 WO 2018127206A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- bit sequence
- bit
- circular buffer
- bits
- initial
- Prior art date
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
- 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
Definitions
- the present disclosure relates to the field of communication technologies, for example, to a rate matching processing method and apparatus for a polar Polar code.
- the polar Polar code is a rigorously proven constructive coding mode of the reachable channel capacity, which can satisfy the communication throughput (Throughput) in the new 5G radio access technology (RAT). Latency requirements.
- the check bits can be generated by parity coding, cyclic redundancy check coding, RS coding, and the like.
- the freeze bits are known bits in the code, typically 0 bits, or pseudo-random bits.
- the length code N of the Polar code coding structure can be recursively obtained by using two code structures of length N/2.
- FIG. 1a and FIG. 1b are schematic diagrams of the recursive structure of the polar code code in the related art
- the length of the data bit sequence encoded by the Polar code is a power of two, and the excess bits can be discarded by means of punching and shortening to perform rate matching to realize transmission of an arbitrary code length.
- Different code lengths and rate-rate matching patterns are different. Therefore, different hardware modules need to be implemented, which results in a large complexity of the Polar code hardware in different application scenarios.
- the present disclosure provides a rate matching processing method and apparatus for a polar Polar code to at least solve the problem of high complexity of implementing Polar code hardware for transmitting bit sequences of any length in the related art.
- the present disclosure provides a rate matching processing method for a polar Polar code, comprising: cascading K information bits and (NK) freeze bits to generate a bit sequence of N bits, and passing a bit sequence of N bits through one Generating a matrix of N ⁇ N polar Polar code encoders to generate N bits of initial bit sequences ⁇ S 0 , S 1 , . . . , S N-1 ⁇ , where K and N are positive integers, And K is less than or equal to N;
- bit sequence in the circular buffer starting from a preset starting position, sequentially reading a bit sequence of a specified length, and using the bit sequence of the specified length after reading as a rate-matched bit to be transmitted sequence.
- the check bits may be included in the K information bits.
- S N-1 ⁇ is written into the q parts of the circular buffer according to a preset processing rule, including: according to the one-to-one mapping interleaving function f(n), the initial bit sequence The nth bit S n is mapped to a position in the circular buffer whose index number is f(n).
- S N-1 ⁇ is written into the q parts of the circular buffer according to a preset processing rule, including: according to the one-to-one mapping interleaving function p(n), the initial bit sequence The p(n)th bit Sp (n) is mapped to the position of the index number n in the circular buffer.
- the bits are randomly selected from the initial bit sequence ⁇ S 0 , S 1 , . . . , S N-1 ⁇ , and are written into the q parts of the circular buffer according to a preset processing rule.
- the data feature includes at least one of: a transport block length, a code rate, a number of available physical resource blocks, a modulation and coding level, a user equipment type index, and a data transmission link direction.
- the preset starting position includes one of the following:
- the loop buffer P 0 NM is used as the preset starting position, where P 0 represents an index of a bit sequence in the circular buffer, and M is a length of the bit sequence to be transmitted, where N is Describe the length of the initial bit sequence;
- the end bit position of the bit sequence in the circular buffer is taken as the preset starting position.
- the preset starting position is selected according to a code rate of the polar Polar encoding.
- the manner of selecting the preset starting location may include:
- M is the length of the bit sequence to be transmitted, and N is the length of the initial bit sequence.
- the preset starting position selection manner is adopted. Includes one of the following:
- the seventh bit of the bit sequence in the circular buffer is set a starting bit position of the sequence portion as the preset starting position
- the eighth bit of the bit sequence in the circular buffer is set
- the end bit position of the sequence portion is taken as the preset starting position
- the eighth bit of the bit sequence in the circular buffer is set a starting bit position of the sequence portion as the preset starting position
- the circular buffer is composed of a sixth bit sequence portion, the seventh bit sequence portion, the eighth bit sequence portion, and the ninth bit sequence portion, the ninth bit sequence of the bit sequence in the circular buffer a portion of the starting bit position as the preset starting position;
- M is the length of the bit sequence to be transmitted
- t 6 is the partial bit length of the sixth bit sequence
- t 7 is the partial bit length of the seventh bit sequence
- t 8 is the partial bit length of the eighth bit sequence
- t 9 is a ninth bit sequence partial bit length
- the sixth bit of the bit sequence in the circular buffer is set
- the end bit position of the sequence portion is taken as the preset starting position
- the ninth bit of the bit sequence in the circular buffer is set a starting bit position of the sequence portion as the preset starting position
- the seventh bit of the bit sequence in the circular buffer is set
- the end bit position of the sequence portion is taken as the preset starting position
- the sixth bit of the bit sequence in the circular buffer is set
- the end bit position of the sequence portion is taken as the preset starting position.
- the manner of selecting the preset starting location may include:
- the start bit position of the bit sequence in the circular buffer is taken as the preset start position.
- the mother code length of the polar Polar code Indicates rounding up
- R is the code rate
- m is a positive integer.
- the shift, mod(x 1 , x 2 ), represents x 1 for x 2 .
- bit sequence in the circular buffer starting from a preset starting position, sequentially reading a bit sequence of a specified length, and using the bit sequence of the specified length after reading as a to-be-sent
- the bit sequence includes:
- the bits are sequentially read in an index increment or an index decrement manner, and when one end of the bit sequence in the circular buffer is read, jumping to the location The other end of the bit sequence in the circular buffer continues to read until the bit sequence of the specified length is read, and the read bit sequence of the specified length is taken as the bit sequence to be transmitted.
- P 0 represents an index of the bit sequence in the circular buffer
- M For the length of the bit sequence to be transmitted, N is the length of the initial bit sequence.
- the start bit position of the bit sequence in the circular buffer is used as the preset start position, and sequentially read in an index increment manner.
- M bits when reading one end of the bit sequence in the circular buffer, skip to the other end of the bit sequence in the circular buffer to continue reading, where N is the length of the initial bit sequence.
- bit sequence to be transmitted is in the order of the bit sequence read from the circular buffer or in reverse order.
- the present disclosure also provides a rate matching processing apparatus for a polar Polar code, comprising: a generating module configured to concatenate K information bits and (NK) freeze bits to generate N bit bit sequences, N
- the bit sequence of the bit is encoded by a polar Polar code encoder whose generation matrix is N ⁇ N, and an initial bit sequence ⁇ S 0 , S 1 , . . . , S N-1 ⁇ of N bits is generated, where K and N is a positive integer, and K is less than or equal to N;
- the write module is set to divide the circular buffer into q parts, without repeating from the initial bit sequence ⁇ S 0 , S 1 , . . .
- S N-1 ⁇ is written into the q parts of the circular buffer according to a preset processing rule, including: according to the one-to-one mapping interleaving function p(n), the initial bit sequence The p(n)th bit Sp (n) is mapped to the position of the index number n in the circular buffer.
- the one-to-one mapping interleaving function f(n) has the following nesting features:
- the initial processing of the initial bit sequence ⁇ S 0 , S 1 , . . . , S N-1 ⁇ may process the nth bit S of the initial bit sequence according to a data feature of the polar Polar code.
- the preset starting position includes one of the following:
- the loop buffer P 0 NM is used as the preset starting position, where P 0 represents an index of a bit sequence in the circular buffer, and M is a length of the bit sequence to be transmitted, where N is Describe the length of the initial bit sequence;
- the end bit position of the bit sequence in the circular buffer is taken as the preset starting position.
- the present disclosure also provides a rate matching processing apparatus for a polar Polar code, comprising: a processor and a memory; and a memory configured to concatenate K information bits and (NK) freeze bits to generate a bit sequence of N bits Transmitting a bit sequence of N bits through a polar Polar code encoder whose generation matrix is N ⁇ N, and generating an initial bit sequence ⁇ S 0 , S 1 , . . . , S N-1 ⁇ of N bits, Wherein, K and N are both positive integers, and K is less than or equal to N; dividing the circular buffer into q parts, and repeatedly selecting from the initial bit sequences ⁇ S 0 , S 1 , . . .
- the selected bit sequence in the S N-1 ⁇ is written into the q parts of the circular buffer according to the preset processing rule, including: the p(n) in the initial bit sequence according to the one-to-one mapping interleaving function p(n)
- the bits S p(n) are mapped to the position of the index number n in the circular buffer.
- the preset starting position includes one of the following:
- the loop buffer P 0 NM is used as the preset starting position, where P 0 represents an index of a bit sequence in the circular buffer, and M is a length of the bit sequence to be transmitted, where N is Describe the length of the initial bit sequence;
- the end bit position of the bit sequence in the circular buffer is taken as the preset starting position.
- the present disclosure also provides a computer storage medium having stored thereon an execution instruction for performing an implementation of a rate matching processing method of any one of the polar Polar codes in the above embodiments.
- the rate matching processing method and device for the polar Polar code provided by the present disclosure can solve the problem that the complexity of the Polar code hardware is large and the encoding process of the Polar code in the hybrid automatic repeat request is cumbersome, and the hardware complexity of the Polar code is greatly reduced. , simplifies the encoding process when mixing automatic retransmission requests.
- 1a is a schematic diagram of a recursive structure of a polar code encoding in the related art
- FIG. 1b is a schematic diagram of another polarity coding recursive structure in the related art
- FIG. 2 is a schematic diagram showing the structure of a minimum basic unit of a recursive structure of a polar code code in the related art
- FIG. 3 is a flowchart of a rate matching processing method of a polar Polar code according to an embodiment
- FIG. 4 is a structural block diagram of a rate matching processing apparatus for a polar Polar code according to an embodiment
- FIG. 5 is a structural block diagram of another rate matching processing apparatus for a polar Polar code according to an embodiment.
- the present embodiment provides a rate matching processing method for a polar Polar code, which may be performed in a computer system such as a set of computer executable instructions, and although shown in a flowchart The logical order is presented, but in some cases the steps shown or described may be performed in a different order than the ones described herein.
- FIG. 3 is a flowchart of a rate matching processing method of a polar Polar code according to the embodiment. As shown in FIG. 3, the method may include the following steps:
- step 302 K information bits and NK freeze bits are concatenated to generate a bit sequence of N bits, and the bit sequence of N bits is encoded by a polar Polar code encoder whose generation matrix is N ⁇ N. Generating an initial bit sequence ⁇ S 0 , S 1 , . . . , S N-1 ⁇ of N bits, wherein K and N are both positive integers, and K is less than or equal to N;
- K information bits may be mapped on the bit channel, and K information bits may include check bits.
- step 304 the circular buffer is divided into q parts, bits are randomly selected from the initial bit sequence ⁇ S 0 , S 1 , . . . , S N-1 ⁇ , and written in a loop according to a preset processing rule.
- q 1, 2, 3 or 4;
- step 306 in the obtained bit sequence in the circular buffer, starting from a preset starting position, sequentially reading a bit sequence of a specified length, and reading the bit sequence of the specified length as a rate matching The sequence of bits to be transmitted.
- the bit sequence to be transmitted is Polar-coded, and the bit sequence after the Polar encoding is processed according to a preset rule to obtain a bit sequence in the circular buffer, and the sequence is specified from the preset starting position.
- the bit sequence of the length is used as the bit sequence to be transmitted, so that the data bit transmission in different application scenarios can be matched by corresponding processing and reading rules, and the related complexity of the Polar code hardware and the Polar code are solved in the related art.
- the cumbersome coding process in the hybrid automatic repeat request greatly reduces the hardware complexity of the Polar code and simplifies the encoding process.
- the loop cache here may be a hardware loop buffer or a virtual device, which is not limited in this embodiment.
- the mother code length of the polar Polar code Indicates rounding up, 0 ⁇ ⁇ ⁇ 2, and R is the code rate at which the Polar code is encoded.
- the selected bit sequence in the S N-1 ⁇ is written into the q parts of the circular buffer according to the preset processing rule, including: the p(n) in the initial bit sequence according to the one-to-one mapping interleaving function p(n)
- the bits S p(n) are mapped to the position of the index number n in the circular buffer.
- the preset processing rule for the initial bit sequence ⁇ S 0 , S 1 , . . . , S N-1 ⁇ may be the nth of the initial bit sequence according to the data feature of the polar Polar code.
- the data feature includes at least one of: a transport block length, a code rate, a number of available physical resource blocks, a modulation and coding level, a user equipment type index, and a data transmission link direction.
- the manner of selecting the preset starting position includes one of the following:
- the loop buffer P 0 NM is used as the preset starting position, where P 0 represents an index of a bit sequence in the circular buffer, and M is a length of the bit sequence to be transmitted, where N is Describe the length of the initial bit sequence;
- the end bit position of the bit sequence in the circular buffer is taken as the preset starting position.
- the preset starting position is selected according to a code rate of the polar Polar encoding.
- the manner of selecting the preset starting location may include:
- M is the length of the bit sequence to be transmitted, and N is the length of the initial bit sequence.
- the preset starting position selection manner is adopted. Includes one of the following:
- the seventh bit of the bit sequence in the circular buffer is set a starting bit position of the sequence portion as the preset starting position
- the eighth bit of the bit sequence in the circular buffer is set
- the end bit position of the sequence portion is taken as the preset starting position
- the eighth bit of the bit sequence in the circular buffer is set a starting bit position of the sequence portion as the preset starting position
- the circular buffer is composed of a sixth bit sequence portion, the seventh bit sequence portion, the eighth bit sequence portion, and the ninth bit sequence portion, the ninth bit sequence of the bit sequence in the circular buffer a portion of the starting bit position as the preset starting position;
- M is the length of the bit sequence to be transmitted
- t 6 is the partial bit length of the sixth bit sequence
- t 7 is the partial bit length of the seventh bit sequence
- t 8 is the partial bit length of the eighth bit sequence
- t 9 is a ninth bit sequence partial bit length
- the sixth bit of the bit sequence in the circular buffer is set
- the end bit position of the sequence portion is taken as the preset starting position
- the ninth bit of the bit sequence in the circular buffer is set a starting bit position of the sequence portion as the preset starting position
- the seventh bit of the bit sequence in the circular buffer is set
- the end bit position of the sequence portion is taken as the preset starting position
- the sixth bit of the bit sequence in the circular buffer is set
- the end bit position of the sequence portion is taken as the preset starting position.
- the manner of selecting the preset starting location may include:
- the start bit position of the bit sequence in the circular buffer is taken as the preset start position.
- the first bit sequence portion is composed of t 2 consecutive bits in the initial bit sequence in a BRO interleaving order;
- the first bit sequence portion and the second bit sequence portion are sequentially arranged to form a bit sequence in the circular buffer.
- the initial bit sequence is denoted as ⁇ S 0 , S 1 , . . . , S N-1 ⁇
- the first bit sequence portion is represented by t 1 consecutive bits in the initial bit sequence Arranging sequentially or in a BRO interleaving sequence; the second bit sequence portion consisting of the remaining Nt 1 consecutive bits in the initial bit sequence Composed in BRO interleaving order, or
- the first bit sequence portion is Nt 1 consecutive bits in the initial bit sequence Constructed in a BRO interleaving sequence; the second bit sequence portion consists of the remaining t 1 consecutive bits in the initial bit sequence The sequence is constructed in the order of BRO interleaving.
- the circular buffer includes: a third bit sequence portion, a fourth bit sequence portion, and a fifth bit sequence portion, wherein the third bit sequence portion is t 3 consecutive bits in the initial bit sequence
- the sequence consists of or consists of a BRO interleaving sequence or a row and column interleave
- the fourth bit sequence portion is determined by taking two consecutive bit sequences of length t 4 from the initial bit sequence, and the two lengths are t
- the bit sequence of 4 is constituted by BRO interleaving order or row-row interleaving or interleaving
- the third bit sequence portion, the fourth bit sequence portion, and the fifth bit sequence portion are sequentially arranged to form a bit sequence in the circular buffer.
- the initial bit sequence is denoted as ⁇ S 0 , S 1 , . . . , S N-1 ⁇
- the third bit sequence portion is composed of t 3 consecutive bits
- the middle sequence is constructed or composed of BRO interleaving order or row and column interleaving
- the fourth bit sequence portion is composed of t 4 bits
- t 4 bits Formed in a BRO interleaving order or interleaved or interleaved
- the fifth bit sequence portion consists of the remaining Nt 3 -2t 4 bits in the initial bit sequence with
- the preset starting position includes one of the following:
- the loop buffer P 0 NM is used as the preset starting position, where P 0 represents an index of a bit sequence in the circular buffer, and M is a length of the bit sequence to be transmitted, where N is Describe the length of the initial bit sequence;
- the loop buffer includes: a sixth bit sequence portion, a seventh bit sequence portion, an eighth bit sequence portion, and a ninth bit sequence portion, wherein the sixth bit sequence portion is included in the initial bit sequence t 6 bits are constructed in a BRO interleaving order, the seventh bit sequence portion being composed of t 7 bit sequences in the initial bit sequence or in a BRO interleaving order, the eighth bit sequence portion being composed of the initial bit sequence
- the t 8 bits are constructed in a BRO interleaving order
- the eighth bit sequence portion is composed of t 7 bit sequences in the initial bit sequence or in a BRO interleaving sequence
- the ninth bit sequence portion is composed of t 6 bits in the initial bit sequence in a BRO interleaving order.
- t 6 , t 7 , t 8 , t 9 are integers greater than or equal to 0, and
- t 6 + t 7 + t 8 + t 9 N.
- the initial bit sequence is denoted as ⁇ S 0 , S 1 , . . . , S N-1 ⁇
- the sixth bit sequence portion is composed of t 6 bits ⁇ I 1 ⁇ in BRO interleaving order
- ⁇ I 1 ⁇ is the intersection of the set of bit sequences ⁇ S 0 , S 1 , . . .
- the seventh bit sequence portion is composed of t 7 bits ⁇ I 2 ⁇ or BRO interleaving order, ⁇ I 2 ⁇ a difference set of bit sequence sets ⁇ S 0 , S 1 , . . .
- the eighth bit sequence portion is composed of t 8 bits ⁇ I 3 ⁇ in BRO interleaving order, ⁇ I 3 ⁇ is a bit sequence set ⁇ S a , S a+1 , ..., S N-1 ⁇ and bits The difference set of the sequence set ⁇ I 4 ⁇ ; or
- the initial bit sequence is denoted as ⁇ S 0 , S 1 , . . . , S N-1 ⁇
- the sixth bit sequence portion is composed of t 9 bits ⁇ I 4 ⁇ in BRO interleaving order, where ⁇ I 4 ⁇ is the intersection of the set of bit sequences ⁇ S N-1 , S N-2 , . . .
- the seventh bit sequence portion is composed of t 8 bits ⁇ I 3 ⁇ in BRO interleaving order, and ⁇ I 3 ⁇ is a bit sequence set ⁇ S N-1 , S N-2 , . . .
- the eighth bit sequence portion is composed of t 7 bits ⁇ I 2 ⁇ or is constructed in the BRO interleaving order ⁇ I 2 ⁇ as a bit sequence set ⁇ S a-1 , S a-2 , . . . , S 0 ⁇ And a difference set of the bit sequence set ⁇ I 1 ⁇ ;
- the sixth bit sequence portion, the seventh bit sequence portion, the eighth bit sequence portion, and the ninth bit sequence portion are sequentially arranged to form a bit sequence in the circular buffer.
- the selection of the preset starting position is related to a code rate of the Polar code
- the preset starting position includes one of the following:
- P 0 NM is used as the preset start position, and when the code rate of the polar Polar code is greater than a preset threshold, the loop buffer is cached.
- the starting bit position of the seventh bit sequence portion of the bit sequence in the bit sequence is taken as the preset starting position;
- the end bit position of the bit sequence in the circular buffer is used as the preset starting position, and the code rate of the polar Polar code is greater than the preset.
- the end bit position of the eighth bit sequence portion of the bit sequence in the circular buffer is taken as the preset starting position;
- the start bit position of the bit sequence in the circular buffer is used as the preset start position, and the code rate of the polar Polar code is greater than the pre-predetermined
- the threshold is set, the starting bit position of the seventh bit sequence portion of the bit sequence in the circular buffer is used as the preset starting position;
- the preset starting position needs to be selected according to the code rate of the polar Polar encoding.
- the sixth bit sequence by the initial section t bit sequence by 9 bits BRO interleaver sequentially configuration the seventh bit sequence by the initial part of t bit sequence of 8 bits constituted by the BRO interleaver sequentially,
- the eighth bit sequence portion is composed of t 7 bits in the initial bit sequence in a BRO interleaving order
- the ninth bit sequence portion is composed of t 6 bit sequences in the initial bit sequence or in a BRO interleaving order.
- t 6 , t 7 , t 8 , t 9 are integers greater than or equal to 0, and
- t 6 + t 7 + t 8 + t 9 N.
- the initial bit sequence is denoted as ⁇ S 0 , S 1 , . . . , S N-1 ⁇
- the seventh bit sequence portion is composed of t 7 bits ⁇ I 2 ⁇ in BRO interleaving order.
- ⁇ I 2 ⁇ is the intersection of the set of bit sequences ⁇ S 0 , S 1 , . . .
- the sixth bit sequence portion is composed of t 6 bits ⁇ I 1 ⁇ or in BRO interleaving order, where ⁇ I 1 ⁇ is a set of bit sequences And a difference set of the bit sequence set ⁇ I 2 ⁇ ;
- the ninth bit sequence portion is composed of t 9 bits ⁇ I 4 ⁇ in BRO interleaving order, ⁇ I 4
- the initial bit sequence is denoted as ⁇ S 0 , S 1 , . . . , S N-1 ⁇
- the seventh bit sequence portion is composed of t 8 bits ⁇ I 3 ⁇ in BRO interleaving order, ⁇ I 3 ⁇ is the intersection of the set of bit sequences ⁇ S N-1 , S N-2 , . . .
- the sixth bit sequence portion is composed of t 9 bits ⁇ I 4 ⁇ in BRO interleaving order, where ⁇ I 4 ⁇ is a set of bit sequences ⁇ S N-1 , S N-2 , . . .
- the ninth bit sequence portion is composed of t 6 bits ⁇ I 1 ⁇ sequentially or in a BRO interleaving order. a difference set of a set of bit sequences ⁇ S a-1 , S a-2 , . . . , S 0 ⁇ and a set of bit sequences ⁇ I 2 ⁇ ;
- the sixth bit sequence portion, the seventh bit sequence portion, the eighth bit sequence portion, and the ninth bit sequence portion are sequentially arranged to form a bit sequence in the circular buffer.
- the preset starting position includes one of the following:
- the start bit position of the eighth bit sequence portion of the bit sequence in the cyclic buffer is used as the preset start position, when the polarity Polar
- the starting bit position of the ninth bit sequence portion of the bit sequence in the cyclic buffer is used as the preset starting position
- the end bit position of the seventh bit sequence portion of the bit sequence in the cyclic buffer is used as the preset start position, when the polarity Polar coding
- the end bit position of the sixth bit sequence portion of the bit sequence in the circular buffer is taken as the preset starting position.
- the preset starting position needs to be selected according to the code rate of the polar Polar encoding.
- the preset threshold is taken from a set ⁇ 1/3, 1/2 ⁇ , that is, the preset threshold may be 1/3 or 1/2.
- the mother code length of the polar Polar code Indicates rounding up
- R is the code rate
- m is a positive integer.
- the shift, mod(x 1 , x 2 ), represents x 1 for x 2 .
- the preset starting position includes one of the following:
- the loop buffer P 0 NM is used as the preset starting position, where P 0 represents an index of a bit sequence in the circular buffer, and M is a length of the bit sequence to be transmitted, where N is Describe the length of the initial bit sequence;
- the end bit position of the bit sequence in the circular buffer is taken as the preset starting position.
- bit sequence in the circular buffer starting from a preset starting position, sequentially reading a bit sequence of a specified length, and using the bit sequence of the specified length after reading as a to-be-sent
- the bit sequence includes:
- the bits are sequentially read in an index increment or an index decrement manner, and when one end of the bit sequence in the circular buffer is read, jumping to the location The other end of the bit sequence in the circular buffer continues to read until the bit sequence of the specified length is read, and the read bit sequence of the specified length is taken as the bit sequence to be transmitted.
- the initial bit position of the bit sequence in the circular buffer is jumped. The reading is continued until a bit sequence of a specified length is read, and the bit sequence of the specified length after reading is taken as the bit sequence to be transmitted.
- the initial bit position of the bit sequence in the circular buffer is read in descending manner from the preset starting position, the specified length is not read, and then the bit position of the bit sequence in the circular buffer is skipped to continue reading. Take until the bit sequence of the specified length is read, and the bit sequence of the specified length after reading is taken as the bit sequence to be transmitted.
- P 0 represents an index of the bit sequence in the circular buffer
- M For the length of the bit sequence to be transmitted, N is the length of the initial bit sequence.
- the start bit position of the bit sequence in the circular buffer is used as the preset start position, and sequentially read in an index increment manner.
- M bits when reading one end of the bit sequence in the circular buffer, skip to the other end of the bit sequence in the circular buffer to continue reading, where N is the length of the initial bit sequence.
- the determination process of the preset starting position may be applied to any one of the above two parts, three parts and four parts as needed, or may be applied to the first combination case, the second combination case, and the third type.
- the combination case and any of the fourth combination cases are not limited in this embodiment.
- bit sequence to be transmitted is in the order of the bit sequence read from the circular buffer or in reverse order.
- the method of the above embodiment can be implemented by means of software plus a necessary general hardware platform, and of course, can also be through hardware, but in many cases the former is a better implementation.
- the content provided by the embodiment in essence or contributing to the related art may be embodied in the form of a software product stored in a storage medium (such as ROM/RAM, disk, CD), including A number of instructions are used to cause a terminal device (which may be a cell phone, computer, server, or network device, etc.) to perform the method of any embodiment.
- a rate matching processing device for a polar Polar code is further provided, and the device may perform the method provided by any of the foregoing embodiments, and details are not described herein.
- the term "module” may implement a combination of software and/or hardware of a predetermined function.
- the apparatus described in the following embodiments is preferably implemented in software, hardware, or a combination of software and hardware, is also possible and contemplated.
- the apparatus may include:
- the generating module 40 is configured to concatenate K information bits and NK freeze bits to generate a bit sequence of N bits, and encode the bit sequence of N bits through a polarity Polar code encoder with a generator matrix of N ⁇ N. , generating an initial bit sequence ⁇ S 0 , S 1 , . . . , S N-1 ⁇ of N bits, wherein K and N are both positive integers, and K is less than or equal to N;
- the reading module 44 is configured to sequentially read a bit sequence of a specified length from a preset starting position in the obtained bit sequence in the circular buffer;
- the determining module 46 is configured to use the read bit sequence of the specified length as the rate-matched bit sequence to be transmitted.
- the generating module 40 may cascade K bit channels as information bits and NK freeze bits to generate a bit sequence of N bits, and pass the bit sequence of N bits to a matrix of N ⁇ N.
- the Polar code encoder encodes to generate an initial bit sequence of N bits; the writing module 42 divides the circular buffer into q parts, and randomly selects the bit sequence from the initial bit sequence to write to the circular buffer according to a preset processing rule.
- the reading module 44 reads the bit sequence of the specified length sequentially from the preset starting position in the obtained bit sequence in the circular buffer; and further determines that the module 46 will read the specified length.
- the bit sequence is used as a rate-matched bit sequence to be transmitted, so that the data bit transmission in different application scenarios can be matched by corresponding processing and reading rules, and the related complexity of the Polar code hardware and the Polar code are solved in the related art.
- the cumbersome coding process in the hybrid automatic repeat request greatly reduces the hardware complexity of the Polar code and simplifies the encoding process.
- S N-1 ⁇ is written into the q parts of the circular buffer according to a preset processing rule, including: according to the one-to-one mapping interleaving function p(n), the initial bit sequence The p(n)th bit Sp (n) is mapped to the position of the index number n in the circular buffer.
- the one-to-one mapping interleaving function f(n) has the following nesting features:
- the initial processing of the initial bit sequence ⁇ S 0 , S 1 , . . . , S N-1 ⁇ may process the nth bit S of the initial bit sequence according to a data feature of the polar Polar code.
- the manner of selecting the preset starting position includes one of the following:
- the loop buffer P 0 NM is used as the preset starting position, where P 0 represents an index of a bit sequence in the circular buffer, and M is a length of the bit sequence to be transmitted, where N is Describe the length of the initial bit sequence;
- the end bit position of the bit sequence in the circular buffer is taken as the preset starting position.
- the preset starting position is selected according to a code rate of the polar Polar encoding.
- the manner of selecting the preset starting location may include:
- M is the length of the bit sequence to be transmitted, and N is the length of the initial bit sequence.
- the preset starting position selection manner is adopted. Includes one of the following:
- the seventh bit of the bit sequence in the circular buffer is set a starting bit position of the sequence portion as the preset starting position
- the eighth bit of the bit sequence in the circular buffer is set
- the end bit position of the sequence portion is taken as the preset starting position
- the eighth bit of the bit sequence in the circular buffer is set a starting bit position of the sequence portion as the preset starting position
- the circular buffer is composed of a sixth bit sequence portion, the seventh bit sequence portion, the eighth bit sequence portion, and the ninth bit sequence portion, the ninth bit sequence of the bit sequence in the circular buffer a portion of the starting bit position as the preset starting position;
- M is the length of the bit sequence to be transmitted
- t 6 is the partial bit length of the sixth bit sequence
- t 7 is the partial bit length of the seventh bit sequence
- t 8 is the partial bit length of the eighth bit sequence
- t 9 is a ninth bit sequence partial bit length
- the sixth bit of the bit sequence in the circular buffer is set
- the end bit position of the sequence portion is taken as the preset starting position
- the ninth bit of the bit sequence in the circular buffer is set a starting bit position of the sequence portion as the preset starting position
- the seventh bit of the bit sequence in the circular buffer is set
- the end bit position of the sequence portion is taken as the preset starting position
- the sixth bit of the bit sequence in the circular buffer is set
- the end bit position of the sequence portion is taken as the preset starting position.
- the manner of selecting the preset starting location may include:
- the start bit position of the bit sequence in the circular buffer is taken as the preset start position.
- the circular buffer includes: a first bit sequence portion and a second bit sequence portion, wherein the first bit sequence portion is composed of t 1 consecutive bit sequences in the initial bit sequence or interleaved by BRO
- the first bit sequence portion is composed of t 2 consecutive bits in the initial bit sequence in a BRO interleaving order;
- the first bit sequence portion and the second bit sequence portion are sequentially arranged to form a bit sequence in the circular buffer.
- the circular buffer includes: a third bit sequence portion, a fourth bit sequence portion, and a fifth bit sequence portion, wherein the third bit sequence portion is t 3 consecutive bits in the initial bit sequence
- the sequence consists of or consists of a BRO interleaving sequence or a row and column interleave, the fourth bit sequence portion being determined by taking two consecutive bit sequences of length t 4 in the initial bit sequence, two lengths being t
- the bit sequence of 4 is constituted by BRO interleaving order or row-row interleaving or interleaving
- the third bit sequence portion is formed by t 5 bit sequences in the initial bit sequence or in BRO interleaving order or row and column interleaving
- the fourth bit sequence portion is determined by: initializing the bit Two consecutive bit sequences of length t 4 are taken in the sequence, and two bit sequences of length t 4 are formed in a BRO interleaving order or interleaved or interleaved, and the fifth bit sequence part is composed of the initial bit sequence.
- the third bit sequence portion, the fourth bit sequence portion, and the fifth bit sequence portion are sequentially arranged to form a bit sequence in the circular buffer.
- the preset starting position includes one of the following:
- the loop buffer P 0 NM is used as the preset starting position, where P 0 represents an index of a bit sequence in the circular buffer, and M is a length of the bit sequence to be transmitted, where N is Describe the length of the initial bit sequence;
- the end bit position of the bit sequence in the circular buffer is taken as the preset starting position.
- the loop buffer includes: a sixth bit sequence portion, a seventh bit sequence portion, an eighth bit sequence portion, and a ninth bit sequence portion, wherein the sixth bit sequence portion is included in the initial bit sequence t 6 bits are constructed in a BRO interleaving order, the seventh bit sequence portion being composed of t 7 bit sequences in the initial bit sequence or in a BRO interleaving order, the eighth bit sequence portion being composed of the initial bit sequence
- the t 8 bits are constructed in a BRO interleaving order
- the sixth bit sequence by the initial section t 9 constituting the bit sequence by BRO interleaver sequentially the seventh bit sequence by the initial part of t bit sequence of 8 bits constituted by the BRO interleaver sequentially, by
- the eighth bit sequence portion is composed of t 7 bit sequences in the initial bit sequence or in a BRO interleaving sequence
- the ninth bit sequence portion is composed of t 6 bits in the initial bit sequence in a BRO interleaving order.
- t 6 , t 7 , t 8 , t 9 are integers greater than or equal to 0, and
- t 6 + t 7 + t 8 + t 9 N.
- the sixth bit sequence by the initial section t bit sequence by 9 bits BRO interleaver sequentially configuration the seventh bit sequence by the initial part of t bit sequence of 8 bits constituted by the BRO interleaver sequentially,
- the eighth bit sequence portion is composed of t 7 bits in the initial bit sequence in a BRO interleaving order
- the ninth bit sequence portion is composed of t 6 bit sequences in the initial bit sequence or in a BRO interleaving order.
- t 6 , t 7 , t 8 , t 9 are integers greater than or equal to 0, and
- t 6 + t 7 + t 8 + t 9 N.
- the mother code length of the polar Polar code Indicates rounding up and m is a positive integer.
- the shift, mod(x 1 , x 2 ), represents x 1 for x 2 .
- a rate matching processing device for a polar Polar code is further provided for explaining an application body of the device in the above embodiment.
- the system can perform any of the methods provided in the foregoing embodiments, and details are not described herein.
- FIG. 5 is a structural block diagram of a processing apparatus for a bit sequence according to the embodiment. As shown in FIG. 5, the apparatus may include:
- a processor 50 configured to store instructions executable by the processor; the processor 50 configured to perform an operation of freezing K bit channels as information bits and NK according to instructions stored in the memory
- the bit concatenation generates a bit sequence of N bits, and encodes the bit sequence of N bits through a polar Polar code encoder whose generation matrix is N ⁇ N, and generates an initial bit sequence of N bits ⁇ S 0 , S 1 , ..., S N-1 ⁇ , where K and N are both positive integers, and K is less than or equal to N; the cyclic buffer is divided into q parts, and the initial bit sequence ⁇ S 0 , S 1 is not repeatedly repeated.
- the bit sequence after the Polar encoding is processed according to a preset rule to obtain a bit sequence in the circular buffer, and the specified length is sequentially read from the preset starting position.
- the bit sequence is used as the bit sequence to be transmitted, so that the data bit transmission in different application scenarios can be matched by corresponding processing and reading rules, and the related art has a large complexity of the Polar code hardware and the Polar code is mixed.
- the problem of cumbersome coding process in the automatic retransmission request greatly reduces the hardware complexity of the Polar code and simplifies the coding process.
- S N-1 ⁇ is written into the q parts of the circular buffer according to a preset processing rule, including: according to the one-to-one mapping interleaving function p(n), the initial bit sequence The p(n)th bit Sp (n) is mapped to the position of the index number n in the circular buffer.
- the one-to-one mapping interleaving function f(n) has the following nesting features:
- the initial processing of the initial bit sequence ⁇ S 0 , S 1 , . . . , S N-1 ⁇ may process the nth bit S of the initial bit sequence according to a data feature of the polar Polar code.
- the manner of selecting the preset starting position includes one of the following:
- the loop buffer P 0 NM is used as the preset starting position, where P 0 represents an index of a bit sequence in the circular buffer, and M is a length of the bit sequence to be transmitted, where N is Describe the length of the initial bit sequence;
- the end bit position of the bit sequence in the circular buffer is taken as the preset starting position.
- the preset starting position is selected according to a code rate of the polar Polar encoding.
- the manner of selecting the preset starting location may include:
- M is the length of the bit sequence to be transmitted, and N is the length of the initial bit sequence.
- the manner of selecting the preset starting location may include:
- the start bit position of the bit sequence in the circular buffer is taken as the preset start position.
- the circular buffer includes: a first bit sequence portion and a second bit sequence portion, wherein the first bit sequence portion is composed of t 1 consecutive bit sequences in the initial bit sequence or interleaved by BRO
- the first bit sequence portion is composed of t 2 consecutive bits in the initial bit sequence in a BRO interleaving order;
- the first bit sequence portion and the second bit sequence portion are sequentially arranged to form a bit sequence in the circular buffer.
- the circular buffer includes: a third bit sequence portion, a fourth bit sequence portion, and a fifth bit sequence portion, wherein the third bit sequence portion is t 3 consecutive bits in the initial bit sequence
- the sequence consists of or consists of a BRO interleaving sequence or a row and column interleave
- the fourth bit sequence portion is determined by taking two consecutive bit sequences of length t 4 from the initial bit sequence, and the two lengths are t
- the bit sequence of 4 is constituted by BRO interleaving order or row-row interleaving or interleaving
- the third bit sequence portion is formed by t 5 bit sequences in the initial bit sequence or in BRO interleaving order or row and column interleaving
- the fourth bit sequence portion is determined by: initializing the bit Two consecutive bit sequences of length t 4 are taken in the sequence, and two bit sequences of length t 4 are formed in a BRO interleaving order or interleaved or interleaved, and the fifth bit sequence part is composed of the initial bit sequence.
- the third bit sequence portion, the fourth bit sequence portion, and the fifth bit sequence portion are sequentially arranged to form a bit sequence in the circular buffer.
- the preset starting position includes one of the following:
- the loop buffer P 0 NM is used as the preset starting position, where P 0 represents an index of a bit sequence in the circular buffer, and M is a length of the bit sequence to be transmitted, where N is Describe the length of the initial bit sequence;
- the end bit position of the bit sequence in the circular buffer is taken as the preset starting position.
- the loop buffer includes: a sixth bit sequence portion, a seventh bit sequence portion, an eighth bit sequence portion, and a ninth bit sequence portion, wherein the sixth bit sequence portion is included in the initial bit sequence t 6 bits are constructed in a BRO interleaving order, the seventh bit sequence portion being composed of t 7 bit sequences in the initial bit sequence or in a BRO interleaving order, the eighth bit sequence portion being composed of the initial bit sequence
- the t 8 bits are constructed in a BRO interleaving order
- the sixth bit sequence by the initial section t bit sequence by 9 bits BRO interleaver sequentially configuration the seventh bit sequence by the initial part of t bit sequence of 8 bits constituted by the BRO interleaver sequentially,
- the eighth bit sequence portion is composed of t 7 bit sequences in the initial bit sequence or in a BRO interleaving sequence
- the ninth bit sequence portion is composed of t 6 bits in the initial bit sequence in a BRO interleaving order.
- t 6 , t 7 , t 8 , t 9 are integers greater than or equal to 0, and
- t 6 + t 7 + t 8 + t 9 N.
- the sixth bit sequence by the initial section t bit sequence by 9 bits BRO interleaver sequentially configuration the seventh bit sequence by the initial part of t bit sequence of 8 bits constituted by the BRO interleaver sequentially,
- the eighth bit sequence portion is composed of t 7 bits in the initial bit sequence in a BRO interleaving order
- the ninth bit sequence portion is composed of t 6 bit sequences in the initial bit sequence or in a BRO interleaving order.
- t 6 , t 7 , t 8 , t 9 are integers greater than or equal to 0, and
- t 6 + t 7 + t 8 + t 9 N.
- the mother code length of the polar Polar code Indicates rounding up
- R is the code rate
- m is a positive integer.
- the shift, mod(x 1 , x 2 ), represents x 1 for x 2 .
- S N-1 ⁇ is written into the q portions of the circular buffer according to a preset processing rule, including: the initial bit sequence according to the one-to-one mapping interleaving function p(n) The p(n)th bit S p(n) in the middle is mapped to the position of the index number n in the circular buffer.
- the one-to-one mapping interleaving function f(n) has the following nesting features:
- the initial processing of the initial bit sequence ⁇ S 0 , S 1 , . . . , S N-1 ⁇ may process the nth bit S of the initial bit sequence according to a data feature of the polar Polar code.
- the manner of selecting the preset starting position includes one of the following:
- the loop buffer P 0 NM is used as the preset starting position, where P 0 represents an index of a bit sequence in the circular buffer, and M is a length of the bit sequence to be transmitted, where N is Describe the length of the initial bit sequence;
- the end bit position of the bit sequence in the circular buffer is taken as the preset starting position.
- the preset starting position is selected according to a code rate of the polar Polar encoding.
- the manner of selecting the preset starting location may include:
- M is the length of the bit sequence to be transmitted, and N is the length of the initial bit sequence.
- the manner of selecting the preset starting location may include:
- the start bit position of the bit sequence in the circular buffer is taken as the preset start position.
- the circular buffer includes: a first bit sequence portion and a second bit sequence portion, wherein the first bit sequence portion is composed of t 1 consecutive bit sequences in the initial bit sequence or interleaved by BRO
- the first bit sequence portion is composed of t 2 consecutive bits in the initial bit sequence in a BRO interleaving order;
- the first bit sequence portion and the second bit sequence portion are sequentially arranged to form a bit sequence in the circular buffer.
- the circular buffer includes: a third bit sequence portion, a fourth bit sequence portion, and a fifth bit sequence portion, wherein the third bit sequence portion is t 3 consecutive bits in the initial bit sequence
- the sequence consists of or consists of a BRO interleaving sequence or a row and column interleave
- the fourth bit sequence portion is determined by taking two consecutive bit sequences of length t 4 from the initial bit sequence, and the two lengths are t
- the bit sequence of 4 is constituted by BRO interleaving order or row-row interleaving or interleaving
- the third bit sequence portion is formed by t 5 bit sequences in the initial bit sequence or in BRO interleaving order or row and column interleaving
- the fourth bit sequence portion is determined by: initializing the bit Two consecutive bit sequences of length t 4 are taken in the sequence, and two bit sequences of length t 4 are formed in a BRO interleaving order or interleaved or interleaved, and the fifth bit sequence part is composed of the initial bit sequence.
- the third bit sequence portion, the fourth bit sequence portion, and the fifth bit sequence portion are sequentially arranged to form a bit sequence in the circular buffer.
- the preset starting position includes one of the following:
- the loop buffer P 0 NM is used as the preset starting position, where P 0 represents an index of a bit sequence in the circular buffer, and M is a length of the bit sequence to be transmitted, where N is Describe the length of the initial bit sequence;
- the end bit position of the bit sequence in the circular buffer is taken as the preset starting position.
- the loop buffer includes: a sixth bit sequence portion, a seventh bit sequence portion, an eighth bit sequence portion, and a ninth bit sequence portion, wherein the sixth bit sequence portion is included in the initial bit sequence t 6 bits are constructed in a BRO interleaving order, the seventh bit sequence portion being composed of t 7 bit sequences in the initial bit sequence or in a BRO interleaving order, the eighth bit sequence portion being composed of the initial bit sequence
- the t 8 bits are constructed in a BRO interleaving order
- the eighth bit sequence portion is composed of t 7 bit sequences in the initial bit sequence or in a BRO interleaving sequence
- the ninth bit sequence portion is composed of t 6 bits in the initial bit sequence in a BRO interleaving order.
- t 6 , t 7 , t 8 , t 9 are integers greater than or equal to 0, and
- t 6 + t 7 + t 8 + t 9 N.
- the sixth bit sequence by the initial section t bit sequence by 9 bits BRO interleaver sequentially configuration the seventh bit sequence by the initial part of t bit sequence of 8 bits constituted by the BRO interleaver sequentially,
- the eighth bit sequence portion is composed of t 7 bits in the initial bit sequence in a BRO interleaving order
- the ninth bit sequence portion is composed of t 6 bit sequences in the initial bit sequence or in a BRO interleaving order.
- t 6 , t 7 , t 8 , t 9 are integers greater than or equal to 0, and
- t 6 + t 7 + t 8 + t 9 N.
- the mother code length of the polar Polar code Indicates rounding up
- R is the code rate
- m is a positive integer.
- the shift, mod(x 1 , x 2 ), represents x 1 for x 2 .
- This embodiment exemplifies the processing method and the embodiment in the above embodiment by the following examples.
- mapping function for mapping the initial bit sequence is determined by the BRO, but is not limited to the BRO operation, so that the bit sequence in the circular buffer is ⁇ S 0 , S 4 , S 2 , S 6 , S 1 , S 5 , S 3 , S 7 ⁇ .
- the read 6 data bits ⁇ S 0 , S 4 , S 2 , S 6 , S 1 , S 5 ⁇ are used as rate matching data bit sequences to be transmitted, and are sequentially arranged and transmitted.
- Steps 1 and 2 are the same as in Example 1.
- the read 6 data bits ⁇ S 5 , S 1 , S 6 , S 2 , S 4 , S 0 ⁇ are transmitted as a rate matched data bit sequence to be transmitted in reverse order.
- Steps 1 and 2 are the same as in Example 1.
- the read 6 data bits ⁇ S 2 , S 6 , S 1 , S 5 , S 3 , S 7 ⁇ are used as rate matched data bit sequences to be transmitted, and are sequentially arranged and transmitted.
- Steps 1 and 2 are the same as in Example 1.
- the read 6 data bits ⁇ S 7 , S 3 , S 5 , S 1 , S 6 , S 2 ⁇ are transmitted as a rate-matched data bit sequence to be transmitted in reverse order.
- Step 1 is the same as Example 1.
- the bit sequence in the circular buffer is arranged in reverse order according to the result in Example 1 as ⁇ S 7 , S 3 , S 5 , S 1 , S 6 , S 2 , S 4 , S 0 ⁇ .
- Steps 3 and 4 are the same as in Example 1.
- Steps 1 and 2 are the same as Example 5.
- Steps 3 and 4 are the same as in Example 2.
- Steps 1 and 2 are the same as Example 5.
- Steps 3 and 4 are the same as Example 3.
- Steps 1 and 2 are the same as Example 5.
- Steps 3 and 4 are the same as in Example 4.
- the bit sequence in the circular buffer can directly delete the element with the bit sequence index number greater than or equal to 4 in the circular buffer in the example 1 to obtain a circular buffer.
- the middle bit sequence is ⁇ S 0 , S 2 , S 1 , S 3 ⁇
- the read 3 data bits ⁇ S 0 , S 2 , S 1 ⁇ are used as rate-matched data bit sequences to be transmitted, and are sequentially arranged and transmitted.
- the read 3 data bits ⁇ S 1 , S 2 , S 0 ⁇ are transmitted as a rate matched data bit sequence to be transmitted in reverse order.
- the read 3 data bits ⁇ S 2 , S 1 , S 3 ⁇ are used as rate matched data bit sequences to be transmitted, and are sequentially arranged and transmitted.
- the read 6 data bits ⁇ S 3 , S 1 , S 2 ⁇ are transmitted as a rate-matched data bit sequence to be transmitted in reverse order.
- Step 1 is the same as Example 9.
- the bit sequence in the circular buffer is arranged in reverse order according to the result in Example 9 as ⁇ S 3 , S 1 , S 2 , S 0 ⁇ .
- Steps 3 and 4 are the same as Example 9.
- Steps 1 and 2 are the same as Example 13.
- Steps 3 and 4 are the same as Example 10.
- Steps 1 and 2 are the same as Example 13.
- Steps 3 and 4 are the same as Example 11.
- Steps 1 and 2 are the same as Example 13.
- Steps 3 and 4 are the same as Example 12.
- the method includes the following steps:
- the length of the coded bit sequence is
- Part 1 of the cyclic buffer consists of 6 consecutive bits ⁇ S 0 , S 1 , ..., S 5 ⁇ in the encoded bit sequence; part 2 is a continuous bit in the encoded bit sequence ⁇ S 6 , S 7 , ..., S 31 ⁇ are constructed in the BRO interleaving order, and the bit sequence of the partial two is obtained as ⁇ S 16 , S 8 , S 24 , S 20 , S 12 , S 28 , S 18 , S 10 , S 26 , S 6 , S 22 , S 14 , S 30 , S 17 , S 9 , S 25 , S 21 , S 13 , S 29 , S 19 , S 11 , S 27 , S 7 , S 23 , S 15 , S 31 ⁇ ;
- the read 24 data bits are used as a rate matched sequence of data bits to be transmitted, and are sequentially arranged and transmitted.
- the method includes the following steps:
- Steps 1 and 2 are the same as the example 117.
- the read 24 data bits are sent as a rate matched data bit sequence to be transmitted in reverse order.
- the method includes the following steps:
- the length of the coded bit sequence is
- Part 1 of the cyclic buffer is composed of 26 consecutive bits ⁇ S 31 , S 30 , ..., S 7 ⁇ in the encoded bit sequence in BRO interleaving order, and part 2 is 6 consecutive bits in the encoded bit sequence.
- ⁇ S 5 , S 4 , ..., S 0 ⁇ are sequentially constructed.
- the read 24 data bits are used as the rate matched data bit sequence to be transmitted, and the bit sequence read from the cyclic buffer is sent in reverse order.
- the method includes the following steps:
- Steps 1 and 2 are the same as Example 17.
- the read 24 data bits are used as the rate matched data bit sequence to be transmitted, and the bit sequences read from the cyclic buffer are sequentially arranged and transmitted.
- the method includes the following steps:
- the length of the coded bit sequence is
- Part 3 of the cyclic buffer consists of 64 consecutive bits ⁇ S 0 , S 1 , ..., S 63 ⁇ in the encoded bit sequence; part 4 consists of 64 bits in the encoded bit sequence ⁇ S 64 , S 65 , . . . , S 127 ⁇ and the bit interleaving of 64 bits ⁇ S 128 , S 129 , . . . , S 191 ⁇ , that is, the partial four constituent bits are ⁇ S 64 , S 128 , S 65 , S 129 , . . . , S 127 , S 191 ⁇ ; Part 5 is a sequence of 64 consecutive bits ⁇ S 192 , S 193 , . . .
- the bit sequence in the circular buffer is ⁇ S 0 , S 1 , . . . , S 63 , S 64 , S 128 , S 65 , S 129 , . . . , S 127 , S 191 , S 192 , S 193 , ...,S 255 ⁇ .
- the read 192 data bits are used as rate matching data bit sequences to be transmitted, and are sequentially arranged and sent out.
- the method includes the following steps:
- Steps 1 and 2 are the same as in Example 21.
- the read 192 data bits are sent as a rate matched data bit sequence to be transmitted in reverse order.
- the method includes the following steps:
- the length of the coded bit sequence is
- Part 3 of the circular buffer is composed of 64 consecutive bits ⁇ S 255 , S 254 , . . . , S 192 ⁇ in the encoded bit sequence; part 4 is 64 bits in the encoded bit sequence ⁇ S 191 , S 190 , . . . , S 128 ⁇ and the interleaving composition of 64 bits ⁇ S 127 , S 126 , . . . , S 64 ⁇ , that is, the partial four constituent bits are ⁇ S 191 , S 127 , S 190 , S 126 , ..., S 128 , S 64 ⁇ ; Part 5 is a sequence of 64 consecutive bits ⁇ S 63 , S 62 , . . .
- the bit sequence in the circular buffer is ⁇ S 255 , S 254 , . . . , S 192 , S 191 , S 127 , S 190 , S 126 , . . . , S 128 , S 64 , S 63 , S 62 ,. ..,S 0 ⁇ .
- the read 192 data bits are used as the rate matched data bit sequence to be transmitted, and the bit sequence read from the cyclic buffer is sent in reverse order.
- the method includes the following steps:
- Steps 1 and 2 are the same as in Example 23.
- the read 192 data bits are used as a rate matched data bit sequence to be transmitted, and the bit sequences read from the cyclic buffer are sequentially arranged and transmitted.
- the length of the coded bit sequence is
- the bit sequence set ⁇ SBRO(j) ⁇ ⁇ S 9 , S 25 , S 5 , S 21 , S 13 , S 29 , S 3 , S 19 , S 11 , S 27 , S 7 , S 23 , S 15 , S 31 ⁇
- the part of the loop buffer, six ⁇ I 1 ⁇ is the intersection of ⁇ S 0 , S 1 , . . . , S 5 ⁇ and ⁇ S BRO(j) ⁇ , and is arranged in the BRO interleaving order.
- the read 18 data bits are used as a rate matched data bit sequence to be transmitted, and the bit sequences read from the cyclic buffer are sequentially arranged and transmitted.
- Steps 1 and 2 are the same as Example 25.
- the read 18 data bits are used as the rate matched data bit sequence to be transmitted, and the bit sequence read from the cyclic buffer is sent in reverse order.
- the cyclically buffered bit sequence is arranged in reverse order according to the bit sequence in Example 25 as ⁇ S 31 , S 15 , S 23 , S 7 , S 27 , S 11 , S 19 , S 29 , S 13 , S 21 , S 25 , S 9 , S 17 , S 30 , S 14 , S 22 , S 6 , S 26 , S 10 , S 18 , S 28 , S 12 , S 20 , S 24 , S 8 , S 16 , S 4 , S 2 , S 1 , S 0 , S 3 , S 5 ⁇ .
- the read 18 data bits are used as a rate matched data bit sequence to be transmitted, and the bit sequences read from the cyclic buffer are sequentially arranged and transmitted.
- Steps 1 and 2 are the same as Example 27.
- the read 18 data bits are used as the rate matched data bit sequence to be transmitted, and the bit sequence read from the cyclic buffer is sent in reverse order.
- Step 1 is the same as Example 25.
- the read 18 data bits are used as a rate-matched data bit sequence to be transmitted, and the bit sequences read from the cyclic buffer are sequentially arranged and transmitted.
- Steps 1 and 2 are the same as Example 29.
- the read 18 data bits are used as the rate matched data bit sequence to be transmitted, and the bit sequence read from the cyclic buffer is sent in reverse order.
- Step 1 is the same as Example 29
- the cyclically buffered bit sequence is arranged in reverse order according to the bit sequence in Example 29.
- the read 18 data bits are used as a rate matched data bit sequence to be transmitted, and the bit sequences read from the cyclic buffer are sequentially arranged and transmitted.
- Steps 1 and 2 are the same as example 31
- the read 18 data bits are used as the rate matched data bit sequence to be transmitted, and the bit sequence read from the cyclic buffer is sent in reverse order.
- mapping function of the initial bit sequence is interleaved by BRO, so that the bit sequence in the circular buffer is ⁇ S 0 , S 4 , S 2 , S 6 , S 1 , S 5 , S 3 , S 7 ⁇
- the read 3 data bits ⁇ S 0 , S 4 , S 2 ⁇ are used as rate matched data bit sequences to be transmitted, and are sequentially arranged and transmitted.
- Steps 1 and 2 are the same as Example 33
- the read 3 data bits ⁇ S 2 , S 4 , S 0 ⁇ are transmitted as a rate matched data bit sequence to be transmitted in reverse order.
- Steps 1 and 2 are the same as Example 33
- the read 3 data bits ⁇ S 5 , S 3 , S 7 ⁇ are used as rate matched data bit sequences to be transmitted, and are sequentially arranged and transmitted.
- Steps 1 and 2 are the same as Example 33
- the read 3 data bits ⁇ S 7 , S 3 , S 5 ⁇ are transmitted as a rate matched data bit sequence to be transmitted in reverse order.
- Step 1 is the same as Example 33.
- Steps 3 and 4 are the same as Example 33.
- Steps 1 and 2 are the same as Example 37.
- Steps 3 and 4 are the same as in Example 34.
- Steps 1 and 2 are the same as Example 37.
- Steps 3 and 4 are the same as Example 35.
- Steps 1 and 2 are the same as Example 37.
- Steps 3 and 4 are the same as Example 36.
- mapping function for mapping the initial bit sequence is determined by p(n), may be the mapping function in Examples 1-40, or may be other functions having a one-to-one mapping relationship.
- mapping function for mapping the initial bit sequence is determined by p(n), may be the mapping function in Examples 1-40, or may be other functions having a one-to-one mapping relationship.
- This embodiment also provides a storage medium.
- the foregoing storage medium may be used to save the program code executed by the processing method of the bit sequence provided by the foregoing embodiment.
- the foregoing storage medium may be located in any one of the computer terminal groups in the computer network, or in any one of the mobile terminal groups.
- the storage medium is arranged to store program code for performing the following steps:
- S1 cascading K bit channels as information bits and NK freeze bits to generate a bit sequence of N bits, and encoding a bit sequence of N bits through a polar Polar code encoder with a generator matrix of N ⁇ N, Generating an initial bit sequence ⁇ S 0 , S 1 , . . . , S N-1 ⁇ of N bits, wherein K and N are both positive integers, and K is less than or equal to N;
- the technical content provided in several embodiments provided by the present application can be implemented in other manners.
- the device embodiments described above are merely illustrative.
- the division of the unit is only a logical function division.
- multiple units or components may be combined or may be Integrate 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, unit or module, and may be electrical or otherwise.
- 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 embodiment may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
- the above integrated unit can be implemented in the form of hardware or in the form of a software functional unit.
- the integrated unit if implemented in the form of a software functional unit and sold or used as a standalone product, may be stored in a computer readable storage medium.
- the content provided by the embodiment in essence or the contribution to the prior art or all or part of the technical solution may be embodied in the form of a software product stored in a storage medium, including several instructions. It is used to cause a computer device (which may be a personal computer, a server or a network device, etc.) to perform all or part of the steps of the method described in the above embodiments.
- the foregoing storage medium includes: a U disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic disk, or an optical disk, and the like, which can store program code. .
- the rate matching processing method and device for the polar Polar code provided by the present disclosure can solve the problem that the complexity of the Polar code hardware is large and the encoding process of the Polar code in the hybrid automatic repeat request is cumbersome, and the hardware complexity of the Polar code is greatly reduced. To simplify the encoding process.
Landscapes
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Error Detection And Correction (AREA)
Abstract
Description
Claims (25)
- 一种极性Polar码的速率匹配处理方法,包括:将K个信息比特和(N-K)个冻结比特级联,生成N个比特的比特序列,将N个比特的比特序列经过一个生成矩阵为N×N的极性Polar码编码器编码,生成N个比特的初始比特序列{S 0,S 1,...,S N-1},其中,K和N均为正整数,且K小于等于N;将循环缓存分成q部分,不重复地从所述初始比特序列{S 0,S 1,...,S N-1}中选取比特,并按照预设处理规则写入循环缓存的q个部分中,其中q=1,2,3或4;在得到的所述循环缓存中的比特序列中,从预设的起始位置开始,顺序读取指定长度的比特序列,并将读取后的指定长度的比特序列作为速率匹配的待发送的比特序列。
- 根据权利要求1所述的方法,其中,所述预设处理规则由依据极性Polar码的数据特征产生的一一映射交织函数f(n)确定,其中n=0,1,...,N-1,f(n)=0,1,...,N-1,n为初始比特序列中比特位置索引,f(n)为循环缓存位置索引;所述不重复地从所述初始比特序列{S 0,S 1,...,S N-1}中选取比特序列按照预设处理规则写入循环缓存的q个部分中包括:根据所述一一映射交织函数f(n)将所述初始比特序列中第n个比特S n映射到循环缓存中索引号为f(n)的位置处。
- 根据权利要求1所述的方法,其中,所述预设处理规则由依据极性Polar码的数据特征产生的一一映射交织函数p(n)确定,其中n=0,1,...,N-1,p(n)=0,1,...,N-1,p(n)为初始比特序列中比特位置索引,n为循环缓存位置索引;所述不重复地从所述初始比特序列{S 0,S 1,...,S N-1}中选取比特序列按照预设处理规则写入循环缓存的q个部分中包括:根据所述一一映射交织函数p(n)将所述初始比特序列中第p(n)个比特S p(n)映射到循环缓存中索引号为n的位置处。
- 根据权利要求2-3中任一项所述的方法,其中,所述数据特征至少包括以下之一:传输块长度、码率、可用物理资源块数、调制编码等级、用户设备类型索引和数据传输链路方向。
- 根据权利要求1-4中任一项所述的方法,其中,所述预设的起始位置的选择方式包括以下之一:将所述循环缓存中的比特序列的起始比特位置作为所述预设的起始位置;将所述循环缓存P 0=N-M作为所述预设的起始位置,其中,P 0表示所述循环缓存中的比特序列的索引,M为所述待发送的比特序列的长度,N为所述初始比特序列的长度。
- 根据权利要求1或5所述的方法,其中,根据极性Polar编码的码率选择所述预设的起始位置。
- 根据权利要求1、5或6中任一项所述的方法,其中,所述预设的起始位置的选择方式包括:当极性Polar编码的码率小于或等于预设阈值时,将所述循环缓存P 0=N-M作为所述预设的起始位置,其中,P 0表示所述循环缓存中的比特序列的索引,M为所述待发送的比特序列的长度,N为所述初始比特序列的长度。
- 根据权利要求1或5-7中任一项所述的方法,其中,所述预设的起始位置的选择方式包括:当极性Polar编码的码率大于预设阈值时,将所述循环缓存中的比特序列的起始比特位置作为所述预设的起始位置。
- 根据权利要求9所述的方法,其中,所述循环缓存中的比特序列由所述初始比特序列{S 0,S 1,...,S N-1}经BRO交织得到,所述初始比特序列中第n个比特S n经BRO交织器映射到循环缓存中索引号为mod(BRO(n)+m,N)的位置,其中n,m=0,1,…,N-1,m为偏移量,mod(x 1,x 2)表示x 1对x 2求余,x 1为整数,x 2为正整数。
- 根据权利要求9所述的方法,其中,所述循环缓存中的比特序列由所述初始比特序列{S 0,S 1,...,S N-1}经BRO交织得到,所述初始比特序列中第n个比特S n经BRO交织器映射到循环缓存中索引号为N-1-mod(BRO(n)+m,N)的位置,其中n,m=0,1,…,N-1,m为偏移量,mod(x 1,x 2)表示x 1对x 2求余,x 1为整数,x 2为正整数。
- 根据权利要求9-11中任一项所述的方法,其中,所述预设的起始位置包括以下之一:将所述循环缓存中的比特序列的起始比特位置作为所述预设的起始位置;将所述循环缓存P 0=M-1作为所述预设的起始位置,其中,P 0表示所述循环缓存中的比特序列的索引,M为所述待发送的比特序列的长度;将所述循环缓存P 0=N-M作为所述预设的起始位置,其中,N为所述初始比特序列的长度;将所述循环缓存中的比特序列的末尾比特位置作为所述预设的起始位置。
- 根据权利要求1、5-8和12中任一项所述的方法,其中,所述在得到的所述循环缓存中的比特序列中,从预设的起始位置开始,顺序读取指定长度的比特序列,并将读取后的指定长度的比特序列作为待发送的比特序列包括:在得到的所述循环缓存中的比特序列中,从预设位置开始,按照索引递增或索引递减的方式顺序读取比特,当读到所述循环缓存中的比特序列的一端时,跳至所述循环缓存中的比特序列的另一端继续读取,直至读取所述指定长度的比特序列,并将读取后的指定长度的比特序列作为待发送的比特序列。
- 根据权利要求1、7或13中任一项所述的方法,其中,所述所从预设的起始位置开始,顺序读取指定长度的比特序列包括:当极性Polar编码的码率小于或等于预设阈值时,将所述循环缓存P 0=N-M作为所述预设的起始位置,按照索引递增的方式顺序读取M个比特,当读到所述循环缓存中的比特序列的一端时,跳至所述循环缓存中的比特序列的另一端继续读取,其中,P 0表示所述循环缓存中的比特序列的索引,M为所述待发送的比特序列的长度,N为所述初始比特序列的长度。
- 根据权利要求1、8或13中任一项所述的方法,其中,所述从预设的起始位置开始,顺序读取指定长度的比特序列包括:当极性Polar编码的码率大于预设阈值时,将所述循环缓存中的比特序列的起始比特位置作为所述预设的起始位置,按照索引递增的方式顺序读取M个比特,当读到所述循环缓存中的比特序列的一端时,跳至所述循环缓存中的比特序列的另一端继续读取,其中,N为所述初始比特序列的长度。
- 根据权利要求1、5-8和12-15中任一项所述的方法,其中,所述待发送的比特序列为从循环缓存读取的比特序列的顺序或者逆序排列。
- 根据权利要求1-16中任一项所述的方法,其中,所述K个信息比特中包括校验比特。
- 一种极性Polar码的速率匹配处理装置,包括:生成模块,设置为将K个信息比特和(N-K)个冻结比特级联,生成N个比特的比特序列,将N个比特的比特序列经过一个生成矩阵为N×N的极性Polar码编码器编码,生成N个比特的初始比特序列{S 0,S 1,...,S N-1},其中,K和N均为正整数,且K小于等于N;写入模块,设置为将循环缓存分成q部分,不重复地从所述初始比特序列{S 0,S 1,...,S N-1}中选取比特,并按照预设处理规则写入循环缓存的q个部分中,其 中q=1,2,3或4;读取模块,设置为在得到的所述循环缓存中的比特序列中,从预设的起始位置开始,顺序读取指定长度的比特序列;确定模块,设置为将读取后的指定长度的比特序列作为速率匹配的待发送的比特序列。
- 根据权利要求18所述的装置,其中,所述预设处理规则由依据极性Polar码的数据特征产生的一一映射交织函数f(n)确定,其中n=0,1,...,N-1,f(n)=0,1,...,N-1,n为初始比特序列中比特位置索引,f(n)为循环缓存位置索引;所述写入模块是设置为:根据所述一一映射交织函数f(n)将所述初始比特序列中第n个比特S n映射到循环缓存中索引号为f(n)的位置处。
- 根据权利要求18所述的装置,其中,所述预设处理规则由依据极性Polar码的数据特征产生的一一映射交织函数p(n)确定,其中n=0,1,...,N-1,p(n)=0,1,...,N-1,p(n)为初始比特序列中比特位置索引,n为循环缓存位置索引;所述不重复地从所述初始比特序列{S 0,S 1,...,S N-1}中选取比特序列按照预设处理规则写入循环缓存的q个部分中包括:根据所述一一映射交织函数p(n)将所述初始比特序列中第p(n)个比特S p(n)映射到循环缓存中索引号为n的位置处。
- 根据权利要求18-20中任一项所述的装置,其中,所述预设的起始位置包括以下之一:将所述循环缓存中的比特序列的起始比特位置作为所述预设的起始位置;将所述循环缓存P 0=M-1作为所述预设的起始位置,其中,P 0表示所述循环缓存中的比特序列的索引,M为所述待发送的比特序列的长度;将所述循环缓存P 0=N-M作为所述预设的起始位置,其中,P 0表示所述循环缓存中的比特序列的索引,M为所述待发送的比特序列的长度,N为所述初始比特序列的长度;将所述循环缓存中的比特序列的末尾比特位置作为所述预设的起始位置。
- 一种极性Polar码的速率匹配处理装置,包括:处理器和存储器;所述存储器,设置为存储所述处理器可执行的指令;所述处理器设置为根据所述存储器中存储的指令执行以下操作:将K个信息比特和(N-K)个冻结比特级联,生成N个比特的比特序列,将N个比特的比特序列经过一个生成矩阵为N×N的极性Polar码编码器编码,生成N个比特的初始比特序列{S 0,S 1,...,S N-1},其中,K和N均为正整数,且K 小于等于N;将循环缓存分成q部分,不重复地从所述初始比特序列{S 0,S 1,...,S N-1}中选取比特,并按照预设处理规则写入循环缓存的q个部分中,其中q=1,2,3或4;在得到的所述循环缓存中的比特序列中,从预设的起始位置开始,顺序读取指定长度的比特序列,并将读取后的指定长度的比特序列作为速率匹配的待发送的比特序列。
- 根据权利要求22所述的装置,其中,所述处理器还设置为根据所述存储器中存储的指令执行以下操作:对所述初始比特序列{S 0,S 1,...,S N-1}的预设处理规则由依据极性Polar码的数据特征产生的一一映射交织函数f(n)确定,其中n=0,1,...,N-1,f(n)=0,1,...,N-1,n为初始比特序列中比特位置索引,f(n)为循环缓存位置索引,根据所述一一映射交织函数f(n)将所述初始比特序列中第n个比特S n映射到循环缓存中索引号为f(n)的位置处。
- 根据权利要求22或23所述的装置,其中,所述预设的起始位置包括以下之一:将所述循环缓存中的比特序列的起始比特位置作为所述预设的起始位置;将所述循环缓存P 0=M-1作为所述预设的起始位置,其中,P 0表示所述循环缓存中的比特序列的索引,M为所述待发送的比特序列的长度;将所述循环缓存P 0=N-M作为所述预设的起始位置,其中,P 0表示所述循环缓存中的比特序列的索引,M为所述待发送的比特序列的长度,N为所述初始比特序列的长度;将所述循环缓存中的比特序列的末尾比特位置作为所述预设的起始位置。
- 一种计算机可读存储介质,存储有计算机可执行指令,所述计算机可执行指令用于执行权利要求1-17任一项所述的方法。
Priority Applications (7)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2019537290A JP6882490B2 (ja) | 2017-01-09 | 2018-01-09 | ポーラ符号のレートマッチング方法及び装置 |
EP18736435.1A EP3567734B1 (en) | 2017-01-09 | 2018-01-09 | Method and apparatus for processing rate matching of polar codes |
KR1020217011598A KR102383593B1 (ko) | 2017-01-09 | 2018-01-09 | 폴라 코드의 레이트 매칭을 프로세싱하기 위한 방법 및 장치 |
KR1020197023378A KR102244117B1 (ko) | 2017-01-09 | 2018-01-09 | 폴라 코드의 레이트 매칭을 프로세싱하기 위한 방법 및 장치 |
US16/505,688 US11342945B2 (en) | 2017-01-09 | 2019-07-08 | Method and apparatus for processing rate matching of polar codes |
US17/664,491 US11955992B2 (en) | 2017-01-09 | 2022-05-23 | Rate matching method and apparatus for polar code |
US18/629,536 US20240259035A1 (en) | 2017-01-09 | 2024-04-08 | Rate matching method and apparatus for polar code |
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201710014289 | 2017-01-09 | ||
CN201710014289.6 | 2017-01-09 | ||
CN201710056532.0 | 2017-01-25 | ||
CN201710056532.0A CN108288966B (zh) | 2017-01-09 | 2017-01-25 | 极性Polar码的速率匹配处理方法及装置 |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US16/505,688 Continuation US11342945B2 (en) | 2017-01-09 | 2019-07-08 | Method and apparatus for processing rate matching of polar codes |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2018127206A1 true WO2018127206A1 (zh) | 2018-07-12 |
Family
ID=62789304
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2018/071956 WO2018127206A1 (zh) | 2017-01-09 | 2018-01-09 | 极性Polar码的速率匹配处理方法及装置 |
Country Status (1)
Country | Link |
---|---|
WO (1) | WO2018127206A1 (zh) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN116610599A (zh) * | 2023-07-19 | 2023-08-18 | 北京开源芯片研究院 | 处理器缓存的优化方法、装置、电子设备及可读存储介质 |
US11856590B2 (en) | 2016-08-12 | 2023-12-26 | Zte Corporation | Method for obtaining network system resource allocation, terminal, network device, and system |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103023618A (zh) * | 2013-01-11 | 2013-04-03 | 北京邮电大学 | 一种任意码长的极化编码方法 |
CN103746708A (zh) * | 2013-10-25 | 2014-04-23 | 中国农业大学 | 一种Polar-LDPC级联码的构造方法 |
US20150156242A1 (en) * | 2013-11-13 | 2015-06-04 | Lg Electronics Inc. | Apparatus for transmitting broadcast signals, apparatus for receiving broadcast signals, method for transmitting broadcast signals and method for receiving broadcast signals |
CN105811998A (zh) * | 2016-03-04 | 2016-07-27 | 深圳大学 | 一种基于密度演进的极化码构造方法及极化码编译码系统 |
-
2018
- 2018-01-09 WO PCT/CN2018/071956 patent/WO2018127206A1/zh unknown
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103023618A (zh) * | 2013-01-11 | 2013-04-03 | 北京邮电大学 | 一种任意码长的极化编码方法 |
CN103746708A (zh) * | 2013-10-25 | 2014-04-23 | 中国农业大学 | 一种Polar-LDPC级联码的构造方法 |
US20150156242A1 (en) * | 2013-11-13 | 2015-06-04 | Lg Electronics Inc. | Apparatus for transmitting broadcast signals, apparatus for receiving broadcast signals, method for transmitting broadcast signals and method for receiving broadcast signals |
CN105811998A (zh) * | 2016-03-04 | 2016-07-27 | 深圳大学 | 一种基于密度演进的极化码构造方法及极化码编译码系统 |
Non-Patent Citations (1)
Title |
---|
See also references of EP3567734A4 * |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US11856590B2 (en) | 2016-08-12 | 2023-12-26 | Zte Corporation | Method for obtaining network system resource allocation, terminal, network device, and system |
CN116610599A (zh) * | 2023-07-19 | 2023-08-18 | 北京开源芯片研究院 | 处理器缓存的优化方法、装置、电子设备及可读存储介质 |
CN116610599B (zh) * | 2023-07-19 | 2023-11-10 | 北京开源芯片研究院 | 处理器缓存的优化方法、装置、电子设备及可读存储介质 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
KR102244117B1 (ko) | 폴라 코드의 레이트 매칭을 프로세싱하기 위한 방법 및 장치 | |
JP5123174B2 (ja) | 前方エラー訂正(fec)符号およびストリーミング | |
JP4033245B2 (ja) | ターボ符号化装置およびターボ符号化方法 | |
KR100438448B1 (ko) | 통신시스템에서 부호 생성장치 및 방법 | |
CN108400838B (zh) | 数据处理方法及设备 | |
KR100970645B1 (ko) | 블록 코드를 이용한 다양한 길이를 가진 정보의 채널 코딩방법 | |
KR20060096156A (ko) | 서브심볼 기반 코드를 이용한 데이터 삭제를 방지하기 위한방법 | |
JP2000156646A5 (ja) | 符号化装置及び方法、復号装置及び方法、情報処理装置及び方法、並びに記憶媒体 | |
WO2018149411A1 (zh) | 数据处理方法及装置 | |
WO2018127206A1 (zh) | 极性Polar码的速率匹配处理方法及装置 | |
KR101493999B1 (ko) | 선형 부호 생성 장치 및 방법 | |
Kaipa et al. | System for random access dna sequence compression | |
CN109391365B (zh) | 一种交织方法及装置 | |
CN109391364B (zh) | 一种信息处理方法及装置 | |
WO2018141292A1 (zh) | 数据处理方法及设备 | |
CN108574556A (zh) | 一种Polar码的速率匹配方法及装置 | |
KR20120071511A (ko) | 이동통신 시스템의 데이터 레이트 매칭 방법 및 장치 | |
KR101233175B1 (ko) | 연속적인 길이를 가지는 터보 코드 인코딩 및 디코딩 방법 | |
JP6381400B2 (ja) | インタリーバ生成方法及びインタリーバ生成装置 | |
JP4458495B2 (ja) | ターボ符号化・復号装置およびターボ符号化・復号方法 | |
KR101613984B1 (ko) | 입력 데이터의 상대적 고밀도를 이용한 부호화 방법 및 장치 |
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: 18736435 Country of ref document: EP Kind code of ref document: A1 |
|
ENP | Entry into the national phase |
Ref document number: 2019537290 Country of ref document: JP Kind code of ref document: A |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
ENP | Entry into the national phase |
Ref document number: 20197023378 Country of ref document: KR Kind code of ref document: A |
|
ENP | Entry into the national phase |
Ref document number: 2018736435 Country of ref document: EP Effective date: 20190809 |