Polar code rate matching method and device
By using the same bit storage order and different bit reading orders in the polar code encoding process, and using an interleaver to achieve rate matching of polar codes, the problem of high hardware complexity in the prior art is solved, and the complexity and area of hardware implementation are reduced.
Patent Information
- Application Number
- CN202311497960.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2017-03-24
- Publication Date
- 2026-11-10
- Estimated Expiration
- 2037-03-24
AI Technical Summary
In the existing technology, the rate matching method of polar codes requires three different sets of hardware to implement the repetition, puncturing and shortening rate matching, resulting in high hardware implementation complexity and large area.
By selecting a rate matching method during the encoding process and using the same bit storage order and different bit reading orders in the circular buffer, different rate matching methods can be implemented using an interleaver, reducing hardware complexity and area.
It achieves a reduction in hardware complexity and area under different rate matching methods, while ensuring the correctness of the output sequence.
Smart Images

Figure CN117713996B_ABST
Abstract
Description
[0001] This application is a divisional application. The original application has the application number 201710184083.8 and the original application date is March 24, 2017. The entire contents of the original application are incorporated herein by reference. Technical Field
[0002] This application relates to encoding and decoding technology, and more particularly to a method and apparatus for rate matching of polar codes. Background Technology
[0003] Communication systems typically employ channel coding to improve data transmission reliability and ensure communication quality. Polar codes, proposed by Turkish professor Arikan, are the first theoretically good codes that can achieve Shannon capacity while maintaining low encoding and decoding complexity. Therefore, Polar codes have great potential for development and application in 5G and are included in 3GPP (the 3GPP's...). rd The Generation Partner Project (RAN1) was adopted for control channel coding at its 87th meeting.
[0004] During the encoding process, the encoding end can achieve rate matching by repetition, puncturing, or shortening bits on the transmission channel. However, existing rate matching methods such as repetition, puncturing, and shortening require their own hardware implementations. When all three rate matching methods are applied, three different hardware sets are needed, resulting in high hardware complexity and large footprint. Summary of the Invention
[0005] This application provides a polar code rate matching method and device to reduce hardware complexity and hardware area.
[0006] The first aspect of this application provides a rate matching method for polar codes, comprising:
[0007] Polar coding is performed based on the mother code length N and the rate matching method to obtain polar-coded bits. The rate matching method is either a first rate matching method or a second rate matching method, and N is a positive integer. The first rate matching method can be a punched rate matching method or a shortened rate matching method, and the second rate matching method can be a repeated rate matching method. The encoding end will select a rate matching method for encoding during the encoding process.
[0008] According to the bit storage order corresponding to the rate matching method, the polar-coded bits are stored in the circular buffer. The bit storage order corresponding to the first rate matching method and the second rate matching method is the same. That is, the encoding end uses the same bit storage order for different rate matching methods. So after bit collection, the polar-coded bits corresponding to different rate matching methods are stored in the same order in the circular buffer. Therefore, an interleaver can be used to achieve this, or an interleaver is not needed when storing bits in sequence or reverse order, thereby reducing hardware complexity and reducing the area occupied by the hardware.
[0009] According to the bit reading order corresponding to the rate matching method, the output sequence of rate matching is read from the circular buffer, wherein the bit reading order corresponding to the first rate matching method is different from that of the second rate matching method.
[0010] Since different rate matching methods have the same bit storage order, in order to ensure that different rate matching methods can output the correct output sequence after rate matching, the bit reading order of different rate matching methods is different, that is, the corresponding bit selection order is different.
[0011] In one possible design, the length of the output sequence is the target code length M, where M is an integer;
[0012] The target code length M corresponding to the first rate matching method is less than the mother code length N;
[0013] The target code length M corresponding to the second rate matching method is greater than the mother code length N.
[0014] In one possible design, storing the polar-coded bits into a circular buffer according to the bit storage order corresponding to the rate matching method includes:
[0015] According to the interleaving method corresponding to the rate matching method, the polar-coded coded bits are interleaved to obtain interleaved coded bits, and the storage order of the bits is the same as the sorting of the interleaved coded bits.
[0016] The encoded bits after the interleaving process are collected and stored in the circular buffer.
[0017] By using an interleaving method, punched or shortened bits can be set at preset positions, making it easier for the encoding end to read them.
[0018] In one possible design, the bit reading order corresponding to the first rate matching method is to read bits N-M+1 to N in the circular buffer sequentially, with bits 1 to NM corresponding to puncture bits; or, the bit reading order corresponding to the first rate matching method is to read bits 1 to M in the circular buffer sequentially, with bits M+1 to N corresponding to shortened bits; the specific positions of the puncture bits and shortened bits can be set by the rate matching method, which can be implemented through interleaving.
[0019] The bit reading order corresponding to the second rate matching method is to read the encoded bits in the circular buffer sequentially or in reverse order from any position until M bits are read.
[0020] In one possible design, the punched or shortened bit indicated by the first rate matching method is located in the first set, and the bit reading order corresponding to the first rate matching method is to read the circular buffer in sequential or reverse order. When the sequence number corresponding to the current bit is located in the first set, the current bit is skipped until the last bit is read.
[0021] The bit reading order corresponding to the second rate matching method is to read the encoded bits in the circular buffer sequentially or in reverse order from any position until M bits are read.
[0022] In one possible design, storing the polar-coded bits into a circular buffer according to the bit storage order corresponding to the rate matching method includes:
[0023] According to the interleaving method corresponding to the rate matching method, the polar-coded coded bits are interleaved to obtain interleaved coded bits, and the storage order of the bits is the same as the sorting of the interleaved coded bits.
[0024] The interleaved encoded bits are collected and stored in the circular buffer, wherein the punctured or shortened bits of the interleaved encoded bits are deleted during the bit collection process.
[0025] In one possible design, storing the polar-coded bits into a circular buffer according to the bit storage order corresponding to the rate matching method includes:
[0026] According to the bit storage order corresponding to the rate matching method, the polar-coded bits are collected and stored in the circular buffer. Punctured or shortened bits of the polar-coded bits are deleted during the bit collection process. The bit storage order is either sequential or reverse. This method eliminates the need for an interleaver, reducing hardware configuration and complexity.
[0027] In one possible design, the bit reading order corresponding to the first rate matching method is to read sequentially from the first bit of the circular buffer until the last bit is read, or to read in reverse order from the last bit of the circular buffer until the first bit is read.
[0028] The bit reading order corresponding to the second rate matching method is to read the encoded bits in the circular buffer sequentially or in reverse order from any position until M bits are read.
[0029] In one possible design, the bit storage order includes at least one or a combination of the following:
[0030] The polar-coded bits are arranged in the circular buffer in the following order: from back to front, from front to back, from back to front in reverse order, from back to front in reverse order, from high to low reliability, from low to high reliability, random arrangement, from back to front in reverse order of offset bits, from back to front in reverse order of offset bits, and bit-by-bit linear interleaving.
[0031] In one possible design, the interleaving method is used to indicate the number of rows Rn, the number of columns Cn, and row-column interleaving or column-row interleaving, where Rn and Cn are both integer powers of 2, and N = Rn × Cn;
[0032] If the interleaving method indicates column-row interleaving, then the bit storage order is that the encoded bits after bit inverse interleaving are arranged in rows, each row of the encoded bits is divided into a sub-segment, and the encoded bits after bit inverse interleaving are the encoded bits obtained by bit inverse interleaving of polar-coded encoded bits.
[0033] The bit reading order corresponding to the first rate matching method is to perform reverse row interleaving on the encoded bits after bit reverse sequence interleaving, and then read one bit from each segment in turn until M bits are read. The bit reading order corresponding to the second rate matching method is to start from any position of the encoded bits after bit reverse sequence interleaving and read the encoded bits in the circular buffer in turn, either sequentially or in reverse order, until M bits are read.
[0034] or
[0035] If the interleaving method indicates row-column interleaving, then the bit storage order is that the encoded bits after reverse row interleaving are arranged in columns, each column of the encoded bits is divided into a sub-segment, and the encoded bits after reverse row interleaving are the encoded bits obtained by performing reverse row interleaving on the polar-coded encoded bits.
[0036] The bit reading order corresponding to the first rate matching method is to perform bit reverse sequence interleaving on the encoded bits after bit reverse row interleaving, and then read one bit from each segment in sequence until M bits are read. The bit reading order corresponding to the second rate matching method is to start from any position of the encoded bits after bit reverse row interleaving and read the encoded bits in the circular buffer in sequence or in reverse order column by column until M bits are read.
[0037] A second aspect of this application provides a rate matching method for polar codes, comprising:
[0038] Polar coding is performed based on the mother code length N and the rate matching method to obtain the polar-coded encoded bits. The rate matching method is one of the first rate matching method, the second rate matching method, and the third rate matching method, and N is a positive integer. Among them, the first rate matching method is the puncturing rate matching method, the second rate matching method is the shortened rate matching method, and the third rate matching method is the repeated rate matching method. The encoding end will select one rate matching method for encoding during the encoding process.
[0039] According to the bit storage order corresponding to the rate matching method, the polar-coded bits are stored in the circular buffer. The bit storage order corresponding to the first rate matching method, the second rate matching method, and the third rate matching method is the same. That is, the encoding end uses the same bit storage order for different rate matching methods. As a result, after bit collection, the polar-coded bits corresponding to different rate matching methods are stored in the same order in the circular buffer. Therefore, an interleaver can be used to achieve this, or an interleaver is not needed when storing bits in sequence or reverse order, thereby reducing hardware complexity and reducing the area occupied by the hardware.
[0040] According to the bit reading order corresponding to the rate matching method, the output sequence matching the rate is read from the circular buffer; wherein, at least two of the first rate matching method, the second rate matching method, and the third rate matching method have different bit reading orders.
[0041] Since different rate matching methods have the same bit storage order, in order to ensure that different rate matching methods can output the correct output sequence after rate matching, the bit reading order of different rate matching methods is different, that is, the corresponding bit selection order is different.
[0042] In one possible design, the length of the output sequence is the target code length M, where M is an integer;
[0043] The target code length M corresponding to the first rate matching method is less than the mother code length N;
[0044] The target code length M corresponding to the second rate matching method is less than the mother code length N;
[0045] The target code length M corresponding to the third rate matching method is greater than the mother code length N.
[0046] In one possible design, the bit reading order corresponding to the first rate matching method, the second rate matching method, and the third rate matching method is different.
[0047] In one possible design, storing the polar-coded bits into a circular buffer according to the bit storage order corresponding to the rate matching method includes:
[0048] According to the interleaving method corresponding to the rate matching method, the polarization-processed coded bits are interleaved to obtain interleaved coded bits, and the bit storage order is the same as the sorting of the interleaved coded bits.
[0049] The encoded bits after the interleaving process are collected and stored in the circular buffer.
[0050] In one possible design, the bit storage order includes a first storage order and a second storage order, wherein the first rate matching method is used to pre-indicate the first storage order, and the second rate matching method is used to pre-indicate the second storage order;
[0051] The first storage order indicates the storage order of the first N / 2 bits of the polar-coded bit in the circular buffer, and the second storage order indicates the storage order of the last N / 2 bits of the polar-coded bit in the circular buffer; or
[0052] The first storage order is used to indicate the storage order of the last N / 2 bits of the polar-coded bit in the circular buffer, and the second storage order is used to indicate the storage order of the first N / 2 bits of the polar-coded bit in the circular buffer.
[0053] In one possible design, the first storage order includes at least one or a combination of the following:
[0054] The order can be arranged from back to front, from front to back, from high to low reliability, from low to high reliability, random arrangement, arrangement corresponding to linear interleaving of each bit, and the reverse order of arrangement corresponding to linear interleaving of each bit.
[0055] The second storage order includes at least one or a combination of the following:
[0056] Arranged in order from back to front, arranged in order from front to back, arranged in reverse order from back to front, arranged in reverse order from front to back, arranged in order of reliability from high to low, arranged in order of reliability from low to high, random arrangement, arranged in reverse order of offset bits from front to back, arranged in reverse order of offset bits from back to front, arrangement corresponding to bit-by-bit linear interleaving, and the reverse order of arrangement corresponding to bit-by-bit linear interleaving.
[0057] In one possible design, if the first storage order is used to indicate the storage order of the first N / 2 bits of the polar-coded bit in the circular buffer, and the second storage order is used to indicate the storage order of the last N / 2 bits of the polar-coded bit in the circular buffer, then the bit reading order corresponding to the first rate matching method is to read bits N-M+1 to N in the circular buffer sequentially, and the bit reading order corresponding to the second rate matching method is to read bits 1 to M in the circular buffer sequentially; or
[0058] If the first storage order is used to indicate the storage order of the last N / 2 bits of the polar-coded bit in the circular buffer, and the second storage order is used to indicate the storage order of the first N / 2 bits of the polar-coded bit in the circular buffer, then the bit reading order corresponding to the first rate matching method is to read the 1st bit to the Mth bit in the circular buffer in sequence, and the bit reading order corresponding to the second rate matching method is to read the N-M+1th bit to the Nth bit in the circular buffer in sequence;
[0059] The bit reading order corresponding to the third rate matching method is to read the encoded bits in the circular buffer sequentially or in reverse order from any position until M bits are read.
[0060] In one possible design, the number of the punch position indicated by the first speed matching method is located in a first set, and the number of the shortening position indicated by the second speed matching method is located in a second set.
[0061] The bit reading order corresponding to the first rate matching method is to read the circular buffer in sequential or reverse order. When the sequence number corresponding to the current bit is in the first set, the current bit is skipped until the last bit is read.
[0062] The bit reading order corresponding to the second rate matching method is to read the circular buffer in either sequential or reverse order. When the sequence number corresponding to the current bit is in the second set, the current bit is skipped until the last bit is read.
[0063] The bit reading order corresponding to the third rate matching method is to read the encoded bits in the circular buffer sequentially or in reverse order from any position until M bits are read.
[0064] In one possible design, the bit reading order corresponding to the first rate matching method and the second rate matching method is the same, while the bit reading order corresponding to the first rate matching method and the third rate matching method is different.
[0065] In one possible design, storing the polar-coded bits into a circular buffer according to the bit storage order corresponding to the rate matching method includes:
[0066] According to the interleaving method corresponding to the rate matching method, the polar-coded coded bits are interleaved to obtain interleaved coded bits, and the storage order of the bits is the same as the sorting of the interleaved coded bits.
[0067] The interleaved encoded bits are collected and stored in a circular buffer, wherein the punctured or shortened bits of the interleaved encoded bits are deleted during the bit collection process.
[0068] In one possible design, storing the polar-coded bits into a circular buffer according to the bit storage order corresponding to the rate matching method includes:
[0069] According to the bit storage order corresponding to the rate matching method, the polar-coded encoded bits are collected and stored in the circular buffer. The punched or shortened bits of the polar-coded encoded bits are deleted during the bit collection process, and the bit storage order is either sequential or reverse.
[0070] In one possible design, the bit reading order corresponding to the first rate matching method is to read sequentially from the first bit of the circular buffer until the last bit is read, or to read in reverse order from the last bit of the circular buffer until the first bit is read.
[0071] The bit reading order corresponding to the third rate matching method is to read the encoded bits in the circular buffer sequentially or in reverse order from any position until M bits are read.
[0072] A third aspect of this application provides a polar code rate matching device, comprising:
[0073] The encoding module is used to perform polar encoding based on the mother code length N and the rate matching method to obtain polar encoded bits. The rate matching method is either a first rate matching method or a second rate matching method, and N is a positive integer.
[0074] The storage module is used to store the polar-coded bits into a circular buffer according to the bit storage order corresponding to the rate matching method, wherein the bit storage order corresponding to the first rate matching method and the second rate matching method is the same;
[0075] The reading module is used to read the output sequence of rate matching from the circular buffer according to the bit reading order corresponding to the rate matching method, wherein the bit reading order corresponding to the first rate matching method is different from that of the second rate matching method.
[0076] In one possible design, the length of the output sequence is the target code length M, where M is an integer;
[0077] The target code length M corresponding to the first rate matching method is less than the mother code length N;
[0078] The target code length M corresponding to the second rate matching method is greater than the mother code length N.
[0079] In one possible design, the storage module is specifically used for:
[0080] According to the interleaving method corresponding to the rate matching method, the polar-coded coded bits are interleaved to obtain interleaved coded bits, and the storage order of the bits is the same as the sorting of the interleaved coded bits.
[0081] The encoded bits after the interleaving process are collected and stored in the circular buffer.
[0082] In one possible design, the bit reading order corresponding to the first rate matching method is to read the N-M+1th bit to the Nth bit in the circular buffer sequentially, or the bit reading order corresponding to the first rate matching method is to read the 1st bit to the Mth bit in the circular buffer sequentially.
[0083] The bit reading order corresponding to the second rate matching method is to read the encoded bits in the circular buffer sequentially or in reverse order from any position until M bits are read.
[0084] In one possible design, the punched or shortened bit indicated by the first rate matching method is located in the first set, and the bit reading order corresponding to the first rate matching method is to read the circular buffer in sequential or reverse order. When the sequence number corresponding to the current bit is located in the first set, the current bit is skipped until the last bit is read.
[0085] The bit reading order corresponding to the second rate matching method is to read the encoded bits in the circular buffer sequentially or in reverse order from any position until M bits are read.
[0086] In one possible design, the storage module is specifically used for:
[0087] According to the interleaving method corresponding to the rate matching method, the polar-coded coded bits are interleaved to obtain interleaved coded bits, and the storage order of the bits is the same as the sorting of the interleaved coded bits.
[0088] The interleaved encoded bits are collected and stored in the circular buffer, wherein the punctured or shortened bits of the interleaved encoded bits are deleted during the bit collection process.
[0089] In one possible design, the storage module is specifically used for:
[0090] According to the bit storage order corresponding to the rate matching method, the polar-coded encoded bits are collected and stored in the circular buffer. The punched or shortened bits of the polar-coded encoded bits are deleted during the bit collection process, and the bit storage order is either sequential or reverse.
[0091] In one possible design, the bit reading order corresponding to the first rate matching method is to read sequentially from the first bit of the circular buffer until the last bit is read, or to read in reverse order from the last bit of the circular buffer until the first bit is read.
[0092] The bit reading order corresponding to the second rate matching method is to read the encoded bits in the circular buffer sequentially or in reverse order from any position until M bits are read.
[0093] In one possible design, the bit storage order includes at least one or a combination of the following:
[0094] The polar-coded bits are arranged in the circular buffer in the following order: from back to front, from front to back, from back to front in reverse order, from back to front in reverse order, from high to low reliability, from low to high reliability, random arrangement, from back to front in reverse order of offset bits, from back to front in reverse order of offset bits, and bit-by-bit linear interleaving.
[0095] In one possible design, the interleaving method is used to indicate the number of rows Rn, the number of columns Cn, and row-column interleaving or column-row interleaving, where Rn and Cn are both integer powers of 2, and N = Rn × Cn;
[0096] If the interleaving method indicates column-row interleaving, then the bit storage order is that the encoded bits after bit inverse interleaving are arranged in rows, each row of the encoded bits is divided into a sub-segment, and the encoded bits after bit inverse interleaving are the encoded bits obtained by bit inverse interleaving of polar-coded encoded bits.
[0097] The bit reading order corresponding to the first rate matching method is to perform reverse row interleaving on the encoded bits after bit reverse sequence interleaving, and then read one bit from each segment in turn until M bits are read. The bit reading order corresponding to the second rate matching method is to start from any position of the encoded bits after bit reverse sequence interleaving and read the encoded bits in the circular buffer in turn, either sequentially or in reverse order, until M bits are read.
[0098] or
[0099] If the interleaving method indicates row-column interleaving, then the bit storage order is that the encoded bits after reverse row interleaving are arranged in columns, each column of the encoded bits is divided into a sub-segment, and the encoded bits after reverse row interleaving are the encoded bits obtained by performing reverse row interleaving on the polar-coded encoded bits.
[0100] The bit reading order corresponding to the first rate matching method is to perform bit reverse sequence interleaving on the encoded bits after bit reverse row interleaving, and then read one bit from each segment in sequence until M bits are read. The bit reading order corresponding to the second rate matching method is to start from any position of the encoded bits after bit reverse row interleaving and read the encoded bits in the circular buffer in sequence or in reverse order column by column until M bits are read.
[0101] A fourth aspect of this application provides a polar code rate matching device, comprising:
[0102] The encoding module is used to perform polar encoding according to the mother code length N and the rate matching method to obtain polar encoded bits. The rate matching method is one of the first rate matching method, the second rate matching method and the third rate matching method, and N is a positive integer.
[0103] The storage module is used to store the polar-coded bits into a circular buffer according to the bit storage order corresponding to the rate matching method, wherein the bit storage order corresponding to the first rate matching method, the second rate matching method and the third rate matching method is the same;
[0104] The reading module is used to read the output sequence that matches the rate from the circular buffer according to the bit reading order corresponding to the rate matching method; wherein, at least two of the first rate matching method, the second rate matching method, and the third rate matching method have different bit reading orders.
[0105] In one possible design, the length of the output sequence is the target code length M, where M is an integer;
[0106] The target code length M corresponding to the first rate matching method is less than the mother code length N;
[0107] The target code length M corresponding to the second rate matching method is less than the mother code length N;
[0108] The target code length M corresponding to the third rate matching method is greater than the mother code length N.
[0109] In one possible design, the bit reading order corresponding to the first rate matching method, the second rate matching method, and the third rate matching method is different.
[0110] In one possible design, the storage module is specifically used for:
[0111] According to the interleaving method corresponding to the rate matching method, the polarization-processed coded bits are interleaved to obtain interleaved coded bits, and the bit storage order is the same as the sorting of the interleaved coded bits.
[0112] The encoded bits after the interleaving process are collected and stored in the circular buffer.
[0113] In one possible design, the bit storage order includes a first storage order and a second storage order, wherein the first rate matching method is used to pre-indicate the first storage order, and the second rate matching method is used to pre-indicate the second storage order;
[0114] The first storage order indicates the storage order of the first N / 2 bits of the polar-coded bit in the circular buffer, and the second storage order indicates the storage order of the last N / 2 bits of the polar-coded bit in the circular buffer; or
[0115] The first storage order is used to indicate the storage order of the last N / 2 bits of the polar-coded bit in the circular buffer, and the second storage order is used to indicate the storage order of the first N / 2 bits of the polar-coded bit in the circular buffer.
[0116] In one possible design, the first storage order includes at least one or a combination of the following:
[0117] The order can be arranged from back to front, from front to back, from high to low reliability, from low to high reliability, random arrangement, arrangement corresponding to linear interleaving of each bit, and the reverse order of arrangement corresponding to linear interleaving of each bit.
[0118] The second storage order includes at least one or a combination of the following:
[0119] Arranged in order from back to front, arranged in order from front to back, arranged in reverse order from back to front, arranged in reverse order from front to back, arranged in order of reliability from high to low, arranged in order of reliability from low to high, random arrangement, arranged in reverse order of offset bits from front to back, arranged in reverse order of offset bits from back to front, arrangement corresponding to bit-by-bit linear interleaving, and the reverse order of arrangement corresponding to bit-by-bit linear interleaving.
[0120] In one possible design, if the first storage order is used to indicate the storage order of the first N / 2 bits of the polar-coded bit in the circular buffer, and the second storage order is used to indicate the storage order of the last N / 2 bits of the polar-coded bit in the circular buffer, then the bit reading order corresponding to the first rate matching method is to read bits N-M+1 to N in the circular buffer sequentially, and the bit reading order corresponding to the second rate matching method is to read bits 1 to M in the circular buffer sequentially; or
[0121] If the first storage order is used to indicate the storage order of the last N / 2 bits of the polar-coded bit in the circular buffer, and the second storage order is used to indicate the storage order of the first N / 2 bits of the polar-coded bit in the circular buffer, then the bit reading order corresponding to the first rate matching method is to read the 1st bit to the Mth bit in the circular buffer in sequence, and the bit reading order corresponding to the second rate matching method is to read the N-M+1th bit to the Nth bit in the circular buffer in sequence;
[0122] The bit reading order corresponding to the third rate matching method is to read the encoded bits in the circular buffer sequentially or in reverse order from any position until M bits are read.
[0123] In one possible design, the number of the punch position indicated by the first speed matching method is located in a first set, and the number of the shortening position indicated by the second speed matching method is located in a second set.
[0124] The bit reading order corresponding to the first rate matching method is to read the circular buffer in sequential or reverse order. When the sequence number corresponding to the current bit is in the first set, the current bit is skipped until the last bit is read.
[0125] The bit reading order corresponding to the second rate matching method is to read the circular buffer in either sequential or reverse order. When the sequence number corresponding to the current bit is in the second set, the current bit is skipped until the last bit is read.
[0126] The bit reading order corresponding to the third rate matching method is to read the encoded bits in the circular buffer sequentially or in reverse order from any position until M bits are read.
[0127] In one possible design, the bit reading order corresponding to the first rate matching method and the second rate matching method is the same, while the bit reading order corresponding to the first rate matching method and the third rate matching method is different.
[0128] In one possible design, the storage module is specifically used for:
[0129] According to the interleaving method corresponding to the rate matching method, the polar-coded coded bits are interleaved to obtain interleaved coded bits, and the storage order of the bits is the same as the sorting of the interleaved coded bits.
[0130] The interleaved encoded bits are collected and stored in a circular buffer, wherein the punctured or shortened bits of the interleaved encoded bits are deleted during the bit collection process.
[0131] In one possible design, the storage module is specifically used for:
[0132] According to the bit storage order corresponding to the rate matching method, the polar-coded encoded bits are collected and stored in the circular buffer. The punched or shortened bits of the polar-coded encoded bits are deleted during the bit collection process, and the bit storage order is either sequential or reverse.
[0133] In one possible design, the bit reading order corresponding to the first rate matching method is to read sequentially from the first bit of the circular buffer until the last bit is read, or to read in reverse order from the last bit of the circular buffer until the first bit is read.
[0134] The bit reading order corresponding to the third rate matching method is to read the encoded bits in the circular buffer sequentially or in reverse order from any position until M bits are read.
[0135] The fifth aspect of this application provides a rate matching device for polar codes, including a memory and a processor. The memory is used to store a program; the processor is used to execute the program stored in the memory. When the program is executed, the processor is used to execute the method described in the first aspect and various implementations thereof, or the processor is used to execute the method described in the second aspect and various implementations thereof.
[0136] A sixth aspect of this application provides a computer-readable storage medium including instructions that, when executed on a computer, cause the computer to perform the method described in the first aspect and various implementations thereof, or cause the computer to perform the method described in the second aspect and various implementations thereof.
[0137] A seventh aspect of this application provides a program product including a computer program stored in a readable storage medium. The computer program is used to implement the methods described in the first aspect and various implementations thereof, or the methods described in the second aspect and various implementations thereof.
[0138] The polar code rate matching method and apparatus provided in this application embodiment perform polar coding according to the mother code length N and the rate matching method to obtain polar-coded coded bits. The rate matching method is either a first rate matching method or a second rate matching method. According to the bit storage order corresponding to the rate matching method, the polar-coded coded bits are stored in a circular buffer. The bit storage order corresponding to the first rate matching method and the second rate matching method is the same, so the interleaving method corresponding to the first rate matching method and the second rate matching method is the same. Both rate matching methods can be implemented by one interleaver. Alternatively, in sequential or reverse storage, storage can be performed directly without an interleaver, thereby reducing hardware complexity and the area occupied by the hardware. According to the bit reading order corresponding to the rate matching method, the rate-matched output sequence is read from the circular buffer. The bit reading order corresponding to the first rate matching method and the second rate matching method is different, thereby realizing different outputs for different rate matching methods, ensuring that the encoder can output the correct output sequence to the decoder. Attached Figure Description
[0139] Figure 1 This application illustrates a possible network architecture that may be applicable to embodiments thereof;
[0140] Figure 2 A flowchart illustrating the rate matching process for polar codes provided in this application embodiment;
[0141] Figure 3 A flowchart illustrating a rate matching method for polar codes provided in an embodiment of this application;
[0142] Figure 4 A schematic diagram of the bit storage order provided for embodiments of this application. Figure 1 ;
[0143] Figure 5 A schematic diagram of the bit reading order provided for embodiments of this application. Figure 1 ;
[0144] Figure 6 This is a schematic diagram of row and column interleaving of encoded bits provided in an embodiment of this application;
[0145] Figure 7 A flowchart illustrating a rate matching method for polar codes provided in an embodiment of this application;
[0146] Figure 8 A schematic diagram of the bit storage order provided for embodiments of this application. Figure 2 ;
[0147] Figure 9 A schematic diagram of the bit reading order provided for embodiments of this application. Figure 2 ;
[0148] Figure 10 A schematic diagram of the bit storage order provided for embodiments of this application. Figure 3 ;
[0149] Figure 11 This is a schematic diagram of offset bit reversal provided in an embodiment of this application;
[0150] Figure 12 A schematic diagram of the bit reading order provided for embodiments of this application. Figure 3 ;
[0151] Figure 13 Schematic diagram of the polar code rate matching device provided in the embodiments of this application Figure 1 ;
[0152] Figure 14 Schematic diagram of the polar code rate matching device provided in the embodiments of this application Figure 2 ;
[0153] Figure 15 Schematic diagram of the polar code rate matching device provided in the embodiments of this application Figure 3 . Detailed Implementation
[0154] The network architecture and business scenarios described in the embodiments of this application are for the purpose of more clearly illustrating the technical solutions of the embodiments of this application, and do not constitute a limitation on the technical solutions provided in the embodiments of this application. As those skilled in the art will know, with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.
[0155] The embodiments of this application can be applied to scenarios where information bits are polar encoded, and can be applied to Wi-Fi, 4G, 5G and future communication systems. Figure 1 This illustrates a network architecture that may be applicable to embodiments of this application. For example... Figure 1 As shown, the network architecture provided in this embodiment includes: network device 01 and terminal 02. The terminal involved in this application embodiment may include various handheld devices, vehicle-mounted devices, wearable devices, computing devices, or other processing devices connected to a wireless modem, as well as various forms of user equipment (terminal device), mobile station (MS), etc. The network device involved in this application embodiment is a device deployed in a wireless access network to provide wireless communication functions for the terminal. In this embodiment, the network device may, for example, be... Figure 1 The base station shown can include various forms of macro base stations, micro base stations, relay stations, access points, etc. Those skilled in the art will understand that other network devices requiring encoding can also apply the methods provided in this application; this embodiment is not limited to base stations.
[0156] In practical applications, the encoding end needs to perform rate matching after encoding to achieve polar codes of arbitrary code length. The decoding end needs to de-rate the code and then decode. When the network device mentioned above is the encoding end, the corresponding terminal is the decoding end; when the encoding end is the terminal, the corresponding decoding end is the network device.
[0157] To facilitate understanding, the target code length and mother code length involved in the polar coding process will be explained below.
[0158] The target code length M is determined based on at least one of the following: the number of information bits K, the code rate R, the allocated resources, and the channel quality. For example, M = INT(K / R), where INT(·) represents rounding. This target code length M is the length of the output sequence after rate matching. This embodiment does not impose any particular restrictions on the specific method for determining the target code length M.
[0159] The mother code length N can be determined based on the target code length M. For example, N = min(2 n N max ), where n is greater than or equal to log2M The smallest integer, for example Where min(·) represents taking the minimum value, N max This represents the maximum mother code length supported by the system. This represents rounding up. The master code is a binary row vector. A portion of the bits is used to carry information, i.e., information bits, while the other portion of the bits are set to fixed values pre-agreed upon by the encoder and decoder, called frozen bits. The frozen bits can be arbitrarily set, but are usually set to 0. The length of the master code can also be determined in other ways; this embodiment only illustrates one possible implementation.
[0160] The three rate matching methods are explained below. Punching Rate Matching Method. Punching reconstruction, represented by Quasi-Uniform Puncture (QUP), is one of the encoding and rate matching methods for Polar codes of arbitrary code length. Specifically, first, the length of the mother code is determined to be an integer power greater than or equal to the target code length. Then, the puncture positions are determined based on the mother code length and the target code length. The channel capacity corresponding to the puncture position is set to 0 (or the error probability is 1 or the signal-to-noise ratio (SNR) is infinitesimal). The reliability of the polarization channel is calculated and sorted using density evolution, Gaussian approximation, or linear fitting methods to determine the positions of information bits and frozen bits. During transmission, the encoder deletes the bits at the predetermined puncture positions after encoding to obtain the polar code, achieving rate matching. During decoding, the bits corresponding to the predetermined puncture positions are treated as unknown bits, and the corresponding log-likelihood ratio (LLR) is set to 0. Together with the LLR of the received unpunctured positions, the length of the mother code is restored, achieving rate matching, and then decoding is performed.
[0161] The shortened rate matching method is similar to puncturing. The mother code length is determined to be an integer power of 2 greater than or equal to the target code length. The difference is that the coded bits at the shortened positions are only related to the frozen bits. During decoding, the bits at the shortened positions are treated as known bits, and the corresponding LLR is set to infinity. First, the reliability of the polarization channel is calculated based on the mother code; then, the shortened positions are determined, and the corresponding polarization channel is used to place the frozen bits; finally, the positions of the information bits and frozen bits are determined from the remaining polarization channels based on the reliability. During transmission, the bits at the predetermined shortened positions after encoding are deleted to obtain the polar code, achieving rate matching. During decoding, the shortened bits are treated as known bits, the LLR is set to infinity, and together with the received LLR of the unshortened positions, the length is restored to the mother code length, achieving rate matching, and then decoding is performed.
[0162] Rate matching using repetition. To balance coding performance and complexity, the maximum mother code length (an integer power of 2) needs to be limited. The Polar code encoded with the maximum mother code length is repetitive to obtain a target code length greater than the maximum mother code length, thus achieving rate matching. Unlike puncturing and shortening, repetition achieves rate matching by repeatedly transmitting bits encoded to the maximum mother code length in a specific order until the target code length is reached. At the decoding end, rate matching is achieved by merging LLRs at the same encoding positions, and decoding is then performed with the maximum mother code length.
[0163] This application provides a rate matching method for polar codes to solve the technical problem that the three rate matching methods require three sets of hardware, that is, interleaving through their respective corresponding interleavers, which requires three interleavers, resulting in high hardware implementation complexity and large area occupation.
[0164] Figure 2 A flowchart illustrating the rate matching process for polar codes provided in this application embodiment. Figure 2 As shown, based on the encoding parameters, a rate matching method is selected, and Polar code encoding is performed to output an information bitstream. An interleaver is used to interleave the information bitstream to achieve a preset order. The information bitstream in the preset order is then collected and fed into a circular buffer. A bit selection method corresponding to the rate matching method is selected to obtain the rate-matched output sequence. The following implementation... Figure 2 Based on the embodiments, the encoder simultaneously supports two or three rate matching methods, requiring only one interleaver. The following detailed embodiments illustrate the Polar code hybrid rate matching method based on circular buffer provided in this application.
[0165] Figure 3 This is a flowchart illustrating a rate matching method for polar codes provided in an embodiment of this application. The method provided in this embodiment is adapted to the rate matching process performed at the encoding end described above. In this embodiment, the encoding end supports two rate matching methods, such as shortening / repetition rate matching or puncturing / repetition rate matching. Those skilled in the art will understand that shortening and puncturing can also be used as an implementation method, named puncturing, shortening, or others. The method provided in this embodiment includes:
[0166] Step 301: Perform polar coding according to the mother code length N and the rate matching method to obtain the polar-coded coded bits. The rate matching method is either the first rate matching method or the second rate matching method.
[0167] In this embodiment, the first rate matching method can be the aforementioned punching or shortening rate matching method, and the second rate matching method can be the aforementioned repeating rate matching method.
[0168] When the target code length M is less than the mother code length N, the encoder can choose the first rate matching method. Whether the first rate matching method is shortening or puncturing can be determined by the code rate. Specifically, the correspondence between code rate and shortening / puncturing can be predefined through the protocol.
[0169] When the target code length M is greater than the mother code length N, the encoder selects the second rate matching method.
[0170] Those skilled in the art will understand that during an encoding process, the encoder selects a rate matching method for rate matching. After selecting the rate matching method, polar coding is performed based on the mother code length N and the selected rate matching method. The method for determining the mother code length can be found in the above embodiments.
[0171] Specifically, a Polar code is constructed based on the master code length N, the number of information bits K, and the selected rate matching method. This constructed Polar code is then encoded to obtain a code of length N bits. The Polar codes here include, but are not limited to, Arikan Polar codes, PC-Polar codes, CA-Polar codes, and PC-CA-Polar codes. Arikan Polar refers to the original Polar code, without concatenation with other codes, containing only information bits and frozen bits. PC-Polar is a Polar code concatenated with Parity Check (PC). CA-Polar is a Polar code concatenated with CRC, and other concatenated Polar codes. PC-CA-Polar is a Polar code that simultaneously concatenates PC and Cyclic Redundancy Check (CRC). PC-Polar and CA-Polar improve the performance of Polar codes by concatenating different codes.
[0172] Those skilled in the art will understand that, when constructing polar codes, for the puncture rate matching method, the polar code is constructed based on the puncture position; for the shortening rate matching method, the polar code is constructed based on the shortening position. Optionally, an interleaving method may also be used to construct polar codes, such that the puncture position or shortening position after interleaving is a preset position.
[0173] Step 302: Store the polar-coded bits in a circular buffer according to the bit storage order corresponding to the rate matching method, wherein the bit storage order corresponding to the first rate matching method and the second rate matching method is the same.
[0174] Step 303: Read the output sequence of the rate matching from the circular buffer according to the bit reading order corresponding to the rate matching method. The bit reading order corresponding to the first rate matching method is different from that of the second rate matching method.
[0175] In this embodiment, the bit storage order corresponding to the first rate matching method and the second rate matching method is the same, and this bit storage order is determined by the interleaving method of the interleaver. Therefore, since the interleaving methods corresponding to the first and second rate matching methods are the same, this embodiment only requires one interleaver to implement both methods, instead of multiple interleavers. That is, regardless of whether the encoding end selects the first or second rate matching method, the interleaving method and the bit storage order are the same. Those skilled in the art will understand that when the bit storage order is reverse or sequential, the bit storage order can be directly implemented without using an interleaver.
[0176] Since the bit storage order of the first rate matching method and the second rate matching method is the same, in order to achieve different outputs for different rate matching methods, the bit reading order corresponding to the first rate matching method and the second rate matching method is different in this embodiment. That is, the rate-matched output sequence is read from the circular buffer according to the bit reading order corresponding to the selected rate matching method. Those skilled in the art will understand that the process of reading the rate-matched output sequence from the circular buffer is as described above. Figure 2 The process of bit selection in the process can be understood as the order in which bits are read.
[0177] The bit storage order and bit reading order in this embodiment can be implemented in the following possible ways. (The following is a combination of...) Figure 2 Each will be explained separately.
[0178] The first implementation involves interleaving the polar-coded bits to obtain interleaved bits, then collecting the polar-coded bits and storing them in a circular buffer, followed by bit selection. During interleaving, a puncture bit is placed at the beginning; during bit selection, for puncture rate matching, the last M bits are read. During interleaving, a shortening bit is placed at the end; during bit selection, the first M bits are read. For repetitive rate matching, M bits are read cyclically from any position.
[0179] Specifically, when the first rate matching method is the puncturing rate matching method, the corresponding bit reading order is to read bits N-M+1 to N in the circular buffer sequentially, where bits 1 to NM correspond to the puncturing positions. Alternatively, when the first rate matching method is the shortening rate matching method, the corresponding bit reading order is to read bits 1 to M in the circular buffer sequentially, where bits M+1 to N correspond to the shortening positions.
[0180] The second rate matching method is the repetitive rate matching method. The corresponding bit reading order is to read the encoded bits in the circular buffer sequentially or in reverse order, starting from any position, until M bits have been read. This arbitrary position can be determined by the encoding parameters or is a fixed value, such as the N / 4+1th bit. For sequential reading, after every Nth bit, the reading starts from the 1st bit and continues until M bits have been read; for reverse reading, after every 1st bit, the reading starts from the Nth bit and continues until M bits have been read.
[0181] The second implementation involves interleaving the polar-coded bits to obtain interleaved bits, then collecting the polar-coded bits and storing them in a circular buffer before bit selection. In this embodiment, puncture bits or shortening bits can be placed at arbitrary positions during interleaving. To improve interleaving efficiency, sequential or reverse interleaving can be used. During bit selection, puncture bits or shortening bits are simply skipped. Those skilled in the art will understand that this implementation can also be achieved without interleaving, using sequential or reverse storage instead.
[0182] Specifically, the punched or shortened bit indicated by the first rate matching method is located in the first set. During the bit selection process, the bit reading order corresponding to the first rate matching method is to read the circular buffer in sequential or reverse order. When the sequence number corresponding to the current bit is located in the first set, the current bit is skipped until the last bit is read.
[0183] The second rate matching method corresponds to the bit reading order of reading the encoded bits in the circular buffer sequentially or in reverse order from any position until the M bits are read.
[0184] The third implementation involves interleaving the polar-coded bits to obtain interleaved bits, followed by bit collection and storage in a circular buffer. In this embodiment, punched or shortened bits can be placed at arbitrary positions during interleaving. To improve interleaving efficiency, sequential or reverse interleaving can be used. During bit collection, punched or shortened bits are deleted, and all stored content is read sequentially. If there are no punched or shortened bits, deletion is unnecessary. Those skilled in the art will understand that this implementation can also be achieved using sequential or reverse storage instead of interleaving.
[0185] Specifically, when the first rate matching method is a shortening or punching rate matching method, the corresponding bit reading order is to read M bits sequentially from the first bit of the circular buffer, or to read M bits in reverse order from the last bit of the circular buffer. Those skilled in the art will understand that since the punched or shortened bits have been deleted, M bits can be read from the beginning to the end, or from the end to the beginning.
[0186] When the second rate matching method is the repeated rate matching method, no bit deletion is required. The corresponding bit reading order is to read the encoded bits in the circular buffer sequentially or in reverse order from any position until the M bits are read.
[0187] In the above implementation, the interleaving mode is used to indicate the processing procedure of the interleaver, so that the sorting of the encoded bits after interleaving is a preset sorting, i.e., the bit storage order described above. In this embodiment, the bit storage order includes at least one or a combination of the following:
[0188] The polar-coded bits can be arranged in the following order: from back to front, from front to back, from back to front, from back to front, from back to front, from high to low reliability, from low to high reliability, random arrangement, from back to front, from back to front, from back to front, and bit-by-bit linear interleaving.
[0189] In this context, reliability refers to the reliability of the polarization channel corresponding to the Polar code, and the corresponding coded bits also have a similar order. Reliability measurement parameters can include polarization weight (PW) value, Babinski parameter, error probability, channel capacity, etc. Bit reversal refers to converting a decimal integer to binary form, inverting the order of the binary elements, and converting the inverted binary number back to decimal; the resulting number is the bit-reversed value of the original number. Sequence combination refers to combining various of the above sequences, such as: bits 1 to N / 2 being any of the above sequences, and bits N / 2+1 to N being bit-reversed from front to back.
[0190] The polar code rate matching method provided in this embodiment involves the encoder performing polarization encoding based on the mother code length N and the rate matching method to obtain polarized encoded bits. This rate matching method can be either a first rate matching method or a second rate matching method. The polarized encoded bits are stored in a circular buffer according to the bit storage order corresponding to the rate matching method. The first and second rate matching methods have the same bit storage order, resulting in the same interleaving method. Both rate matching methods can be implemented using a single interleaver. Alternatively, in sequential or reverse storage, storage can be performed directly without an interleaver, reducing hardware complexity and area. The encoder reads the rate-matched output sequence from the circular buffer according to the bit reading order corresponding to the rate matching method. The first and second rate matching methods have different bit reading orders, thus enabling different rate matching methods to produce different outputs, ensuring that the encoder can output the correct output sequence to the decoder.
[0191] Several examples are given below for illustration. In the following embodiments, the bit storage order and bit reading order are described in detail. Other processes can be found in the above embodiments, and will not be repeated here.
[0192] A concrete example: the first rate matching method is the punched rate matching method, and the second rate matching method is the repetitive rate matching method. The polar-coded bits are stored in the circular buffer in the following order: the first N / 4 bits are sequential, then bits N / 4+1 to N / 2+1 are alternately selected, and bits N / 2+1 to N are in natural order. Specifically... Figure 4 As shown, Figure 4 A schematic diagram of the bit storage order provided for embodiments of this application. Figure 1 .
[0193] In this diagram, 0, 1, 2...15 represent the natural ordering of the 16 bits, indicating the position numbers of the coded bits after polar coding. During storage, bits 0, 1, 2, and 3 are stored in their natural order; the bit corresponding to 4 remains in its original order; the bit corresponding to 5 changes its storage position from the 6th to the 7th; the bit corresponding to 6 changes its storage position from the 7th to the 9th; and so on. (See [reference needed] for other positions.) Figure 4 The specific details of this embodiment will not be elaborated upon here. Those skilled in the art will understand that, regardless of whether it involves punching or repeating, the bits are stored in the order described above.
[0194] For the bit selection process, based on the selected rate matching scheme, the bit reading order is as follows: Figure 5As shown, Figure 5 A schematic diagram of the bit reading order provided for embodiments of this application. Figure 1 If the selected rate matching method is puncturing, then read bits N-M+1 to N, with the puncturing start point as follows: Figure 5 As shown, if the selected rate matching method is repetition, the encoded bits in the circular buffer are read sequentially or in reverse order from any position until M bits are read. The repetition start point is as follows: Figure 5 As shown.
[0195] Another concrete example is that the first rate matching method is a shortened rate matching method, and the second rate matching method is a repeated rate matching method. The above interleaving method is used to indicate the number of rows Rn, the number of columns Cn, and row-column interleaving or column-row interleaving, where Rn and Cn are both integer powers of 2, and N = Rn × Cn.
[0196] If the interleaving mode indicates column-row interleaving, the bit storage order is that the encoded bits after inverse bit interleaving are arranged in rows, and each row of encoded bits is divided into a sub-segment. The encoded bits after inverse bit interleaving are the encoded bits obtained by inverse bit interleaving of the polar-coded encoded bits. Figure 6 This is a schematic diagram of row and column interleaving of the encoded bits provided in an embodiment of this application. Figure 6 As shown, the data is written row-by-row to the interleaver, resulting in 4 rows and 8 columns. After bit reverse interleaving, the original 2nd column (1, 9, 17, 25) becomes the 5th column, and the original 4th column (3, 11, 19, 27) becomes the 7th column. See also the other columns. Figure 6 The interleaver outputs row-wise, i.e., (0, 4, 2, 6, 1, 5, 3, 7). The corresponding bits are stored in row-wise order, i.e., according to the interleaver output.
[0197] If the selected rate matching method is repetition, the bit reading order is to start from any position of the encoded bits after the bit reverse sequence interleaving and read the encoded bits in the circular buffer sequentially or in reverse order row by row until M bits are read. This bit reading order is the same as the row-by-row output order mentioned above, i.e., reading (0, 4, 2, 6, 1, 5, 3, 7, 8, 12, 10...).
[0198] If the selected rate matching method is shortening, the bit reading order is as follows: after performing reverse interleaving on the encoded bits following the reverse bit sequence, read one bit from each segment sequentially until M bits are read. See details in [link to documentation]. Figure 6 As shown. Figure 6As shown, after the bits are reversed and interleaved, the original second row (8, 12, ... 11, 15) becomes the current third row, and the original third row becomes the current second row. During the reading process, one bit is read sequentially from each sub-segment, that is, read column by column. This embodiment schematically shows the first 4 bits read as (0, 16, 8, 24).
[0199] Those skilled in the art will understand that this interleaving method can also indicate row-column interleaving. In this case, the bit storage order is that the encoded bits after reverse row interleaving are arranged in columns, with each column of encoded bits divided into a sub-segment. The encoded bits after reverse row interleaving are the encoded bits obtained by performing reverse row interleaving on the polar-coded encoded bits. The bit reading order corresponding to the first rate matching method is to perform reverse sequence interleaving on the encoded bits after reverse row interleaving and then read one bit from each sub-segment sequentially until M bits are read. The bit reading order corresponding to the second rate matching method is to start from any position of the encoded bits after reverse row interleaving and sequentially or in reverse order, cyclically read the encoded bits in the circular buffer until M bits are read. The specific implementation is similar to column interleaving, and will not be described in detail here.
[0200] In another specific example, the first rate matching method is the shortening or punching rate matching method, and the second rate matching method is the repeating rate matching method.
[0201] If the selected rate matching method is shortening or puncturing rate matching, the bit reading order is to read the circular buffer sequentially or in reverse order. If the reversed bit of the current sequence number (starting from 0) is greater than or equal to the target code length M, then the current bit is skipped. For example, if the mother code length is 16 and the target code length is 12, when reading the 4th bit (sequence number 3, the reversed bit of 3 is 12), it is skipped, thus achieving code length shortening or puncturing. Those skilled in the art will understand that the reversed bit of the current sequence number is one implementation method for the first set described above.
[0202] If the selected rate matching method is repetition, the bit reading order corresponding to the second rate matching method is to read the encoded bits in the circular buffer sequentially or in reverse order from any position until M bits are read. The reading method is similar to the repetition reading method described above, and will not be repeated here in this embodiment.
[0203] The above embodiments illustrate how the interleaver supports two rate matching methods. In actual implementation, the bit storage order and bit read order can also be implemented in other ways, which will not be elaborated here. The following embodiments will illustrate how the interleaver supports three rate matching methods.
[0204] Figure 7This is a flowchart illustrating a rate matching method for polar codes provided in an embodiment of this application. The method provided in this embodiment is applicable to the rate matching process performed at the encoding end described above. In this embodiment, the encoding end supports three rate matching methods: shortening, puncturing, and repetition, each corresponding to its respective rate matching method. The method provided in this embodiment includes:
[0205] Step 701: Perform polar coding according to the mother code length N and the rate matching method to obtain the polar-coded coded bits. The rate matching method is one of the first rate matching method, the second rate matching method, and the third rate matching method.
[0206] Step 702: Store the polar-coded bits in a circular buffer according to the bit storage order corresponding to the rate matching method, wherein the bit storage order corresponding to the first rate matching method, the second rate matching method and the third rate matching method is the same;
[0207] Step 703: Read the output sequence that matches the rate from the circular buffer according to the bit reading order corresponding to the rate matching method, wherein at least two of the rate matching methods, the first rate matching method, the second rate matching method, and the third rate matching method have different bit reading orders.
[0208] The implementation method of this embodiment is the same as Figure 3 The embodiments shown are similar; for similar aspects, please refer to the above. Figure 3 The description of the embodiments is omitted here. The implementation method of this embodiment is the same as... Figure 3 The difference between the illustrated embodiment and the one shown is that the encoding end of this embodiment supports three rate matching methods. Specifically, the first rate matching method is the puncturing rate matching method, where the target code length M is less than the mother code length N; the second rate matching method is the shortening rate matching method, where the target code length M is less than the mother code length N; and the third rate matching method is the repetition rate matching method, where the target code length M is greater than the mother code length N.
[0209] In this embodiment, combined with Figure 2 As shown, there are also three possible implementation methods, as detailed below:
[0210] The first implementation involves interleaving the polar-coded bits to obtain interleaved bits, followed by bit collection, storing the polar-coded bits in a circular buffer, and then performing bit selection. During interleaving, two factors need to be considered: puncturing and shortening. These are determined by the puncturing bits and shortening bits. The puncturing bits are placed at the beginning, and the shortening bits are placed at the end. During bit selection, for puncturing rate matching, the last M bits are read; for shortening rate matching, the first M bits are read; and for repetitive rate matching, M bits are read cyclically from any position.
[0211] Specifically, the bit storage order in this embodiment includes a first storage order and a second storage order, wherein a first rate matching method is used to pre-indicate the first storage order, and a second rate matching method is used to pre-indicate the second storage order. The first rate matching method can be a puncturing rate matching method, and the second rate matching method can be a shortened rate matching method.
[0212] Wherein, the first storage order is used to indicate the storage order of the first N / 2 bits of the polar-coded bit in the circular buffer, and the second storage order is used to indicate the storage order of the last N / 2 bits of the polar-coded bit in the circular buffer; or
[0213] The first storage order is used to indicate the storage order of the last N / 2 bits of the polar-coded bit in the circular buffer, and the second storage order is used to indicate the storage order of the first N / 2 bits of the polar-coded bit in the circular buffer.
[0214] The first storage order includes at least one or a combination of the following:
[0215] The order can be arranged from back to front, from front to back, from high to low reliability, from low to high reliability, random arrangement, arrangement corresponding to linear interleaving of each bit, and the reverse order of arrangement corresponding to linear interleaving of each bit.
[0216] The second storage order includes at least one or a combination of the following:
[0217] Arranged in order from back to front, arranged in order from front to back, arranged in reverse order from back to front, arranged in reverse order from front to back, arranged in order of reliability from high to low, arranged in order of reliability from low to high, random arrangement, arranged in reverse order of offset bits from front to back, arranged in reverse order of offset bits from back to front, arrangement corresponding to bit-by-bit linear interleaving, and the reverse order of arrangement corresponding to bit-by-bit linear interleaving.
[0218] That is, the bit storage order corresponding to the puncturing rate matching method, shortening rate matching method and repeating rate matching method provided in this application is the same, but the bit storage order fully takes into account both puncturing and shortening factors.
[0219] To ensure that different rate matching methods produce different output sequences, the bit reading orders for the first, second, and third rate matching methods in this embodiment are different. That is, the rate-matched output sequence is read from the circular buffer according to the bit reading order corresponding to the selected rate matching method.
[0220] For example, if the first storage order is used to indicate the storage order of the first N / 2 bits of the polar-coded bit in the circular buffer, and the second storage order is used to indicate the storage order of the last N / 2 bits of the polar-coded bit in the circular buffer, then the bit reading order corresponding to the puncturing rate matching method is to read bits N-M+1 to N in the circular buffer sequentially (bits 1 to NM are puncturing bits), and the bit reading order corresponding to the shortening rate matching method is to read bits 1 to M in the circular buffer sequentially (bits M+1 to N are shortening bits); or
[0221] If the first storage order is used to indicate the storage order of the last N / 2 bits of the polar-coded bit in the circular buffer, and the second storage order is used to indicate the storage order of the first N / 2 bits of the polar-coded bit in the circular buffer, then the bit reading order corresponding to the puncturing rate matching method is to read the 1st to the Mth bits in the circular buffer sequentially (the M+1th to the Nth bits are puncturing bits), and the bit reading order corresponding to the shortening rate matching method is to read the N-M+1th to the Nth bits in the circular buffer sequentially (the 1st to NMth bits are shortening bits).
[0222] The bit reading order corresponding to the repetition rate matching method is to read the encoded bits in the circular buffer sequentially or in reverse order from any position until the M bits are read.
[0223] The following two examples illustrate this with the first rate matching method being a punched rate matching method and the second rate matching method being a shortened rate matching method. The first storage order is used to indicate the storage order of the first N / 2 bits of the polar-coded bit in the circular buffer, and the second storage order is used to indicate the storage order of the last N / 2 bits of the polar-coded bit in the circular buffer. The same principle applies to the first storage order indicating the storage order of the last N / 2 bits of the polar-coded bit in the circular buffer and the second storage order indicating the storage order of the first N / 2 bits of the polar-coded bit in the circular buffer, and will not be repeated here in this embodiment.
[0224] A concrete example is that bit storage order can be achieved through segmented interleaving. Figure 8 A schematic diagram of the bit storage order provided for embodiments of this application. Figure 2 ;like Figure 8As shown, the natural order (0, 1, 2, 3, 4, 5, 6, 7) is reversed to obtain (0, 4, 2, 6, 1, 5, 3, 7). The second storage order is the storage order of bits N / 2+1 to N, which is the storage order of bits N / 2+1 to N in the reverse order. For the shortening design, the first storage order is the remaining natural order, that is, odd-numbered bits from front to back, for the punched design.
[0225] Figure 9 A schematic diagram of the bit reading order provided for embodiments of this application. Figure 2 ;like Figure 9 As shown, the bit length of the encoded bit is N. Figure 9 The punch start point, shortening start point, and repeating start point are shown. The bit reading order corresponding to the punch rate matching method is to read the N-M+1th bit (punch start point) to the Nth bit in the circular buffer sequentially. The bit reading order corresponding to the shortening rate matching method is to read the 1st bit (shortening start point) to the Mth bit in the circular buffer sequentially. The bit reading order corresponding to the repeating rate matching method is to read the encoded bits in the circular buffer sequentially or in reverse order from any position until the Mth bit is read.
[0226] Those skilled in the art will understand that regardless of whether the rate matching method initially selected at the encoding end is punctured rate matching, shortened rate matching, or repeated rate matching, the interleaving method is the same, and the order of the interleaved encoded bits, i.e., the bit storage order, is always the same. Figure 8 As shown. During the reading process, the bit reading order corresponding to the initially selected rate matching method is selected according to the bit reading order described above.
[0227] Those skilled in the art will understand that, in relation to Figure 9 In the illustration shown, if the first storage order is used to indicate the storage order of the last N / 2 bits of the polar-coded bit in the circular buffer, and the second storage order is used to indicate the storage order of the first N / 2 bits of the polar-coded bit in the circular buffer, then the first N / 2 bits are equivalent to Figure 9 The reverse order of the last N / 2 bits shown represents the last N / 2 bits being equivalent to Figure 9 The first N / 2 bits are reversed as shown. The bit storage order is 7, 3, 5, 1, 6, 4, 2, 0. When reading in reverse order, it is equivalent to... Figure 9 The content read is the same.
[0228] Another concrete example is bit storage order, which can be achieved through segmented interleaving.
[0229] Figure 10 A schematic diagram of the bit storage order provided for embodiments of this application. Figure 3 ,like Figure 10As shown, the first storage order is as follows: bits 1 to N / 8 are stored in natural order; bits N / 8+1 to 3N / 8 are stored in a linearly interleaved order, with bits N / 8+1 to N / 4 and N / 4+1 to 3N / 8 interleaved; bits 3N / 8+1 to N / 2 are stored in natural order. The second storage order is as follows: bits N / 2+1 to N are sorted in reverse order by offset bits. Reversing the offset bits involves subtracting an offset value from the sequence of bits whose first element is not 1, reversing the bits of the resulting sequence, and then adding the offset value back. Figure 11 This is a schematic diagram illustrating the reversed offset bits provided in an embodiment of this application.
[0230] The bit reading order for each rate matching method in this embodiment is the same as that in the embodiments described above. Figure 9 Similarly, this embodiment will not be described in detail here.
[0231] The second implementation involves interleaving the polar-coded bits to obtain interleaved bits, then collecting the polar-coded bits and storing them in a circular buffer before bit selection. In this embodiment, puncture bits or shortening bits can be placed at arbitrary positions during interleaving. To improve interleaving efficiency, sequential or reverse interleaving can be used. During bit selection, puncture bits or shortening bits are simply skipped. Those skilled in the art will understand that this implementation can also be achieved without interleaving, using sequential or reverse storage instead.
[0232] Specifically, the serial numbers of the punch positions indicated by the first speed matching method are recorded in the first set. The serial numbers of the shortening positions indicated by the second speed matching method are recorded in the second set. Figure 12 A schematic diagram of the bit reading order provided for embodiments of this application. Figure 3 ,like Figure 12 As shown, during the reading process, the bit reading order corresponding to the first rate matching method is to read the circular buffer in either sequential or reverse order. When the sequence number corresponding to the current bit is in the first set, the current bit is skipped until the last bit is read.
[0233] The bit reading order corresponding to the second rate matching method is to read the circular buffer in either sequential or reverse order. When the sequence number corresponding to the current bit is in the second set, the current bit is skipped until the last bit is read.
[0234] The bit reading order corresponding to the third rate matching method is to read the encoded bits in the circular buffer sequentially or in reverse order from any position until the M bits are read.
[0235] The third implementation involves interleaving the polar-coded bits to obtain interleaved bits, followed by bit collection and storage in a circular buffer. In this embodiment, punctured or shortened bits can be placed at arbitrary positions during interleaving. To improve interleaving efficiency, sequential or reverse interleaving can be used. During bit collection, punctured or shortened bits are deleted, and all stored bits, excluding punctured or shortened bits, are read sequentially. If no punctured or shortened bits are present, deletion is unnecessary. Those skilled in the art will understand that this implementation can also be achieved using sequential or reverse storage instead of interleaving.
[0236] At this time, the bit reading order corresponding to the first rate matching method and the second rate matching method is the same, which is to read M bits sequentially from the first bit of the circular buffer, or to read M bits in reverse order from the last bit of the circular buffer.
[0237] The bit reading order corresponding to the third rate matching method is to read the encoded bits in the circular buffer sequentially or in reverse order from any position until the M bits are read.
[0238] Those skilled in the art will understand that in the second and third implementations, the first rate matching method and the second rate matching method can indicate two bit storage orders as in the above embodiments, or they can indicate the same bit storage order. In specific implementations, when indicating a bit storage order, different bit storage orders can be achieved through different interleaving methods. This bit storage order includes at least one or a combination of the following:
[0239] The polar-coded bits are arranged in the circular buffer in the following order: from back to front, from front to back, from reverse back to front, from reverse front to back, from high to low reliability, from low to high reliability, random arrangement, from reverse front to back offset bits, from back to front offset bits, and bit-by-bit linear interleaving.
[0240] The polar code rate matching method provided in this embodiment involves the encoder performing polarization encoding based on the mother code length N and the rate matching method to obtain polarized encoded bits. The rate matching method can be one of a first rate matching method, a second rate matching method, or a third rate matching method. The polarized encoded bits are stored in a circular buffer according to the bit storage order corresponding to the rate matching method. Since the bit storage order is the same for the first, second, and third rate matching methods, the interleaving order is also the same for all three rate matching methods. This allows for the implementation of all three rate matching methods using a single interleaver, reducing hardware complexity and area. The encoder reads the rate-matched output sequence from the circular buffer according to the bit reading order of the encoded bits corresponding to the rate matching method. Since the bit reading order is different for at least two of the first, second, and third rate matching methods, different rate matching methods result in different outputs, ensuring that the encoder can output the correct output sequence to the decoder.
[0241] This application also provides a rate matching method for polar coding. The storage order of the encoded bits in the circular buffer can be determined by inserting a single-level interleaving process between the Polar code output and the circular buffer, based on the rate matching method.
[0242] Specifically, if the punctured rate matching method is used, interleaving is not used, and the encoded bits are directly input into the circular buffer. If the shortened rate matching method is used, reverse bit interleaving is used, and the encoded bits are input into the circular buffer after interleaving. If the repeated rate matching method is used, interleaving is not used, and the encoded bits are directly input into the circular buffer. That is, a single interleaver can support three rate matching methods, reducing hardware complexity and hardware area.
[0243] Those skilled in the art will understand that, at the decoding end, for the punch rate matching method, the shortened rate matching method, and the repeating rate matching method, the decoding method can be found in the decoding methods described in the above embodiments for the three rate matching methods.
[0244] Those skilled in the art will understand that the various implementation methods or examples given in the above embodiments are various implementation methods provided for understanding this application. In the specific implementation process, they can be combined, referenced or implemented independently. This embodiment does not impose any special restrictions on the specific implementation methods.
[0245] The above mainly describes the solutions provided by the embodiments of this application from the perspective of the encoding end. It is understood that, in order to achieve the above functions, the encoding end includes the corresponding hardware structure and / or software modules for executing each function. Combining the units and algorithm steps of the various examples described in the embodiments disclosed in this application, the embodiments of this application can be implemented in hardware or a combination of hardware and computer software. Whether a certain function is executed by hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered to exceed the scope of the technical solutions of the embodiments of this application.
[0246] This embodiment provides a polar code rate matching device, which can be either the network device as the encoding end described above, or the terminal as the encoding end described above.
[0247] Figure 13 Schematic diagram of the polar code rate matching device provided in the embodiments of this application Figure 1 .like Figure 13 As shown, the device 1300 includes:
[0248] Encoding module 1301 is used to perform polar coding according to the mother code length N and the rate matching method to obtain polar-coded encoded bits, wherein the rate matching method is a first rate matching method or a second rate matching method, and N is a positive integer;
[0249] Storage module 1302 is used to store the polar-coded bits into a circular buffer according to the bit storage order corresponding to the rate matching method, wherein the bit storage order corresponding to the first rate matching method and the second rate matching method is the same;
[0250] The reading module 1303 is used to read the output sequence of rate matching from the circular buffer according to the bit reading order corresponding to the rate matching method, wherein the bit reading order corresponding to the first rate matching method is different from that of the second rate matching method.
[0251] Optionally, the length of the output sequence is the target code length M, where M is an integer;
[0252] The target code length M corresponding to the first rate matching method is less than the mother code length N;
[0253] The target code length M corresponding to the second rate matching method is greater than the mother code length N.
[0254] Optionally, the storage module 1302 is specifically used for:
[0255] According to the interleaving method corresponding to the rate matching method, the polar-coded coded bits are interleaved to obtain interleaved coded bits, and the storage order of the bits is the same as the sorting of the interleaved coded bits.
[0256] The encoded bits after the interleaving process are collected and stored in the circular buffer.
[0257] Optionally, the bit reading order corresponding to the first rate matching method is to read the N-M+1th bit to the Nth bit in the circular buffer sequentially, or the bit reading order corresponding to the first rate matching method is to read the 1st bit to the Mth bit in the circular buffer sequentially;
[0258] The bit reading order corresponding to the second rate matching method is to read the encoded bits in the circular buffer sequentially or in reverse order from any position until M bits are read.
[0259] Optionally, the punched or shortened bit indicated by the first rate matching method is located in the first set, and the bit reading order corresponding to the first rate matching method is to read the circular buffer in sequential or reverse order. When the sequence number corresponding to the current bit is located in the first set, the current bit is skipped until the last bit is read.
[0260] The bit reading order corresponding to the second rate matching method is to read the encoded bits in the circular buffer sequentially or in reverse order from any position until M bits are read.
[0261] Optionally, the storage module 1302 is specifically used for:
[0262] According to the interleaving method corresponding to the rate matching method, the polar-coded coded bits are interleaved to obtain interleaved coded bits, and the storage order of the bits is the same as the sorting of the interleaved coded bits.
[0263] The interleaved encoded bits are collected and stored in the circular buffer, wherein the punctured or shortened bits of the interleaved encoded bits are deleted during the bit collection process.
[0264] Optionally, the storage module 1302 is specifically used for:
[0265] According to the bit storage order corresponding to the rate matching method, the polar-coded encoded bits are collected and stored in the circular buffer. The punched or shortened bits of the polar-coded encoded bits are deleted during the bit collection process, and the bit storage order is either sequential or reverse.
[0266] Optionally, the bit reading order corresponding to the first rate matching method is to read sequentially from the first bit of the circular buffer until the last bit is read, or to read in reverse order from the last bit of the circular buffer until the first bit is read;
[0267] The bit reading order corresponding to the second rate matching method is to read the encoded bits in the circular buffer sequentially or in reverse order from any position until M bits are read.
[0268] Optionally, the bit storage order includes at least one or a combination of the following:
[0269] The polar-coded bits are arranged in the circular buffer in the following order: from back to front, from front to back, from back to front in reverse order, from back to front in reverse order, from high to low reliability, from low to high reliability, random arrangement, from back to front in reverse order of offset bits, from back to front in reverse order of offset bits, and bit-by-bit linear interleaving.
[0270] Optionally, the interleaving method is used to indicate the number of rows Rn, the number of columns Cn, and row-column interleaving or column-row interleaving, wherein Rn and Cn are both integer powers of 2, and N = Rn × Cn;
[0271] If the interleaving method indicates column-row interleaving, then the bit storage order is that the encoded bits after bit inverse interleaving are arranged in rows, each row of the encoded bits is divided into a sub-segment, and the encoded bits after bit inverse interleaving are the encoded bits obtained by bit inverse interleaving of polar-coded encoded bits.
[0272] The bit reading order corresponding to the first rate matching method is to perform reverse row interleaving on the encoded bits after bit reverse sequence interleaving, and then read one bit from each segment in turn until M bits are read. The bit reading order corresponding to the second rate matching method is to start from any position of the encoded bits after bit reverse sequence interleaving and read the encoded bits in the circular buffer in turn, either sequentially or in reverse order, until M bits are read.
[0273] or
[0274] If the interleaving method indicates row-column interleaving, then the bit storage order is that the encoded bits after reverse row interleaving are arranged in columns, each column of the encoded bits is divided into a sub-segment, and the encoded bits after reverse row interleaving are the encoded bits obtained by performing reverse row interleaving on the polar-coded encoded bits.
[0275] The bit reading order corresponding to the first rate matching method is to perform bit reverse sequence interleaving on the encoded bits after bit reverse row interleaving, and then read one bit from each segment in sequence until M bits are read. The bit reading order corresponding to the second rate matching method is to start from any position of the encoded bits after bit reverse row interleaving and read the encoded bits in the circular buffer in sequence or in reverse order column by column until M bits are read.
[0276] The rate matching device provided in this embodiment is used to perform the above. Figure 3 The method embodiments shown are similar in principle and technical effect, and will not be described again here.
[0277] Figure 14 Schematic diagram of the polar code rate matching device provided in the embodiments of this application Figure 2 .like Figure 14 As shown, the device 1400 includes:
[0278] Encoding module 1401 is used to perform polar coding according to the mother code length N and the rate matching method to obtain polar-coded encoded bits. The rate matching method is one of the first rate matching method, the second rate matching method and the third rate matching method, and N is a positive integer.
[0279] Storage module 1402 is used to store the polar-coded bits into a circular buffer according to the bit storage order corresponding to the rate matching method, wherein the bit storage order corresponding to the first rate matching method, the second rate matching method and the third rate matching method is the same;
[0280] The reading module 1403 is used to read the output sequence that matches the rate from the circular buffer according to the bit reading order corresponding to the rate matching method; wherein, at least two of the first rate matching method, the second rate matching method and the third rate matching method have different bit reading orders.
[0281] Optionally, the length of the output sequence is the target code length M, where M is an integer;
[0282] The target code length M corresponding to the first rate matching method is less than the mother code length N;
[0283] The target code length M corresponding to the second rate matching method is less than the mother code length N;
[0284] The target code length M corresponding to the third rate matching method is greater than the mother code length N.
[0285] Optionally, the bit reading order corresponding to the first rate matching method, the second rate matching method, and the third rate matching method is different.
[0286] Optionally, the storage module is specifically used for:
[0287] According to the interleaving method corresponding to the rate matching method, the polarization-processed coded bits are interleaved to obtain interleaved coded bits, and the bit storage order is the same as the sorting of the interleaved coded bits.
[0288] The encoded bits after the interleaving process are collected and stored in the circular buffer.
[0289] Optionally, the bit storage order includes a first storage order and a second storage order, wherein the first rate matching method is used to pre-indicate the first storage order, and the second rate matching method is used to pre-indicate the second storage order;
[0290] The first storage order indicates the storage order of the first N / 2 bits of the polar-coded bit in the circular buffer, and the second storage order indicates the storage order of the last N / 2 bits of the polar-coded bit in the circular buffer; or
[0291] The first storage order is used to indicate the storage order of the last N / 2 bits of the polar-coded bit in the circular buffer, and the second storage order is used to indicate the storage order of the first N / 2 bits of the polar-coded bit in the circular buffer.
[0292] Optionally, the first storage order includes at least one or a combination of the following:
[0293] The order can be arranged from back to front, from front to back, from high to low reliability, from low to high reliability, random arrangement, arrangement corresponding to linear interleaving of each bit, and the reverse order of arrangement corresponding to linear interleaving of each bit.
[0294] The second storage order includes at least one or a combination of the following:
[0295] Arranged in order from back to front, arranged in order from front to back, arranged in reverse order from back to front, arranged in reverse order from front to back, arranged in order of reliability from high to low, arranged in order of reliability from low to high, random arrangement, arranged in reverse order of offset bits from front to back, arranged in reverse order of offset bits from back to front, arrangement corresponding to bit-by-bit linear interleaving, and the reverse order of arrangement corresponding to bit-by-bit linear interleaving.
[0296] Optionally, if the first storage order is used to indicate the storage order of the first N / 2 bits of the polar-coded bit in the circular buffer, and the second storage order is used to indicate the storage order of the last N / 2 bits of the polar-coded bit in the circular buffer, then the bit reading order corresponding to the first rate matching method is to read the N-M+1 bits to the Nth bit in the circular buffer sequentially, and the bit reading order corresponding to the second rate matching method is to read the 1st bit to the Mth bit in the circular buffer sequentially; or
[0297] If the first storage order is used to indicate the storage order of the last N / 2 bits of the polar-coded bit in the circular buffer, and the second storage order is used to indicate the storage order of the first N / 2 bits of the polar-coded bit in the circular buffer, then the bit reading order corresponding to the first rate matching method is to read the 1st bit to the Mth bit in the circular buffer in sequence, and the bit reading order corresponding to the second rate matching method is to read the N-M+1th bit to the Nth bit in the circular buffer in sequence;
[0298] The bit reading order corresponding to the third rate matching method is to read the encoded bits in the circular buffer sequentially or in reverse order from any position until M bits are read.
[0299] Optionally, the number of the punch position indicated by the first speed matching method is located in the first set, and the number of the shortening position indicated by the second speed matching method is located in the second set;
[0300] The bit reading order corresponding to the first rate matching method is to read the circular buffer in sequential or reverse order. When the sequence number corresponding to the current bit is in the first set, the current bit is skipped until the last bit is read.
[0301] The bit reading order corresponding to the second rate matching method is to read the circular buffer in either sequential or reverse order. When the sequence number corresponding to the current bit is in the second set, the current bit is skipped until the last bit is read.
[0302] The bit reading order corresponding to the third rate matching method is to read the encoded bits in the circular buffer sequentially or in reverse order from any position until M bits are read.
[0303] Optionally, the bit reading order corresponding to the first rate matching method and the second rate matching method is the same, while the bit reading order corresponding to the first rate matching method and the third rate matching method is different.
[0304] Optionally, the storage module 1402 is specifically used for:
[0305] According to the interleaving method corresponding to the rate matching method, the polar-coded coded bits are interleaved to obtain interleaved coded bits, and the storage order of the bits is the same as the sorting of the interleaved coded bits.
[0306] The interleaved encoded bits are collected and stored in a circular buffer, wherein the punctured or shortened bits of the interleaved encoded bits are deleted during the bit collection process.
[0307] Optionally, the storage module 1402 is specifically used for:
[0308] According to the bit storage order corresponding to the rate matching method, the polar-coded encoded bits are collected and stored in the circular buffer. The punched or shortened bits of the polar-coded encoded bits are deleted during the bit collection process, and the bit storage order is either sequential or reverse.
[0309] Optionally, the bit reading order corresponding to the first rate matching method is to read sequentially from the first bit of the circular buffer until the last bit is read, or to read in reverse order from the last bit of the circular buffer until the first bit is read;
[0310] The bit reading order corresponding to the third rate matching method is to read the encoded bits in the circular buffer sequentially or in reverse order from any position until M bits are read.
[0311] The rate matching device provided in this embodiment is used to perform the above. Figure 7 The method embodiments shown are similar in principle and technical effect, and will not be described again here.
[0312] Figure 15 Schematic diagram of the polar code rate matching device provided in the embodiments of this application Figure 3 The rate matching device 1500 can be the aforementioned network device, terminal, or other communication device or chip. For example... Figure 15As shown, the rate matching device 1500 can be implemented using a general bus architecture with bus 1501. Depending on the specific application and overall design constraints of the rate matching device 1500, bus 1501 can include any number of interconnect buses and bridges. Bus 1501 connects various circuits, including processor 1502, storage medium 1503, and bus interface 1504. Optionally, the rate matching device 1500 uses bus interface 1504 to connect network adapter 1505, etc., via bus 1501. Network adapter 1505 can be used to implement signal processing functions of the physical layer in a wireless communication network and to transmit and receive radio frequency signals via antenna 1507. User interface 1506 can connect user terminals, such as keyboards, displays, mice, or joysticks. Bus 1501 can also connect various other circuits, such as timing sources, peripheral devices, voltage regulators, or power management circuits, which are well known in the art and will not be described in detail here.
[0313] Alternatively, the rate matching device 1500 can also be configured as a general-purpose processing system, such as commonly referred to as a chip, which includes: one or more microprocessors providing processor functions; and external memory providing at least a portion of the storage medium 1503, all of which are connected to other supporting circuitry via an external bus architecture.
[0314] Alternatively, the rate matching device 1500 can be implemented using: an application-specific integrated circuit (ASIC) having a processor 1502, a bus interface 1504, and a user interface 1506; and at least a portion of a storage medium 1503 integrated on a single chip. Alternatively, the rate matching device 1500 can be implemented using: one or more field-programmable gate arrays (FPGAs), programmable logic devices (PLDs), controllers, state machines, gate logic, discrete hardware components, any other suitable circuitry, or any combination of circuitry capable of performing the various functions described throughout this application.
[0315] Processor 1502 is responsible for managing the bus and general processing (including executing software stored on storage medium 1503). Processor 1502 can be implemented using one or more general-purpose processors and / or special-purpose processors. Examples of processors include microprocessors, microcontrollers, DSP processors, and other circuitry capable of executing software. Software should be interpreted broadly as representing instructions, data, or any combination thereof, regardless of whether it is referred to as software, firmware, middleware, microcode, hardware description language, or anything else.
[0316] In the figure below, storage medium 1503 is shown as separate from processor 1502; however, those skilled in the art will readily understand that storage medium 1503 or any portion thereof may be located outside of rate matching device 1500. For example, storage medium 1503 may include transmission lines, carrier waveforms modulated with data, and / or computer artifacts separate from the wireless node, all of which may be accessed by processor 1502 via bus interface 1504. Alternatively, storage medium 1503 or any portion thereof may be integrated into processor 1502, for example, as a cache and / or general-purpose registers.
[0317] Processor 1502 may execute the above embodiments, for example, Figures 2 to 12 The execution process of the processor 1502 will not be described again here, as in the corresponding embodiments described above.
[0318] Those skilled in the art will understand that the above-described encoding module, storage module, and reading module can be implemented as a processor.
Claims
1. A rate matching method for polar codes, characterized in that, include: Polar coding is performed based on the mother code length N, the number of information bits K, and the rate matching method to obtain the polar-coded encoded bits. The rate matching method is one of punching, shortening, and repetition. N is a positive integer. The polar-coded bits are interleaved to obtain interleaved coded bits, and the interleaved coded bits are stored in a circular buffer. The rate-matched output sequence is read from the circular buffer according to the starting position of the bit read corresponding to the rate matching method; the starting position of the bit read corresponding to the puncturing is different from the starting position of the bit read corresponding to the shortening. When the rate matching method is puncturing, the output sequence is the (N-M+1)th to the Nth bit of the interleaved coded bits in the circular buffer; or, When the rate matching mode is shortened, the output sequence is the first to the Mth bit of the interleaved coded bits in the circular buffer; or, When the rate matching mode is repetitive, the output sequence is a sequence obtained by sequentially reading the encoded bits in the circular buffer from the first bit of the interleaved encoded bits until M bits are read.
2. The method according to claim 1, characterized in that, The length of the output sequence is the target code length M, where M is an integer; When the target code length M is less than the mother code length N, the rate matching method is punching or shortening; When the target code length M is greater than the mother code length N, the rate matching method is repetition.
3. The method according to claim 2, characterized in that, Also includes: The rate matching method, whether shortening or puncturing, is determined based on the code rate R, where R satisfies: M = INT(K / R), where K represents the number of information bits and M represents the target code length. Indicates rounding down.
4. The method according to any one of claims 1 to 3, characterized in that, The mother code length N is determined based on the target code length M.
5. The method according to any one of claims 1 to 4, characterized in that, The method further includes: When the rate matching method is shortening or puncturing, determine the bit position corresponding to shortening or puncturing. The positions of information bits and frozen bits are determined based on reliability from positions other than those corresponding to shortening or punching.
6. The method according to claim 5, characterized in that, The method further includes: A freeze bit is placed at the bit position corresponding to the shortening or punching, and the freeze bit is set to 0.
7. A rate matching device for polar codes, characterized in that, include: The encoding module is used to perform polar encoding based on the mother code length N, the number of information bits K and the rate matching method to obtain polar encoded bits. The rate matching method is one of puncturing, shortening and repetition, and N is a positive integer. The storage module is used to interleave the polar-coded bits to obtain interleaved coded bits, and to store the interleaved coded bits in a circular buffer. as well as The reading module is used to read the rate-matched output sequence from the circular buffer according to the starting position of the bit reading corresponding to the rate matching method; the starting position of the bit reading corresponding to the punching is different from the starting position of the bit reading corresponding to the shortening. When the rate matching method is puncturing, the output sequence is the (N-M+1)th to the Nth bit of the interleaved coded bits in the circular buffer; or, When the rate matching mode is shortened, the output sequence is the first to the Mth bit of the interleaved coded bits in the circular buffer; or, When the rate matching mode is repetitive, the output sequence is a sequence obtained by sequentially reading the encoded bits in the circular buffer from the first bit of the interleaved encoded bits until M bits are read.
8. The device according to claim 7, characterized in that, The length of the output sequence is the target code length M, where M is an integer; When the target code length M is less than the mother code length N, the rate matching method is punching or shortening; When the target code length M is greater than the mother code length N, the rate matching method is repetition.
9. The device according to claim 8, characterized in that, Also includes: The rate matching method, whether shortening or puncturing, is determined based on the code rate R, where R satisfies: M = INT(K / R), where K represents the number of information bits and M represents the target code length. Indicates rounding down.
10. The device according to any one of claims 7 to 9, characterized in that, The mother code length N is determined based on the target code length M.
11. The device according to any one of claims 7 to 10, characterized in that, The encoding module is further configured to, when the rate matching method is shortening or puncturing, determine the bit position corresponding to shortening or puncturing. The positions of information bits and frozen bits are determined based on reliability from positions other than those corresponding to shortening or punching.
12. The device according to claim 11, characterized in that, The encoding module is also used to place a frozen bit at the bit position corresponding to the shortening or punching, and the frozen bit is set to 0.
13. A rate matching device for polar codes, characterized in that, include: A processor for implementing the method according to any one of claims 1 to 6.
14. A computer-readable storage medium comprising instructions which, when executed on a computer, cause the method of any one of claims 1 to 6 to be implemented.
15. A computer program product comprising a computer program that, when run on a computer, causes the method of any one of claims 1 to 6 to be implemented.
