CN116032429A - Method and system for determining interleaving length of triangular interleaver - Google Patents
Method and system for determining interleaving length of triangular interleaver Download PDFInfo
- Publication number
- CN116032429A CN116032429A CN202310031442.1A CN202310031442A CN116032429A CN 116032429 A CN116032429 A CN 116032429A CN 202310031442 A CN202310031442 A CN 202310031442A CN 116032429 A CN116032429 A CN 116032429A
- Authority
- CN
- China
- Prior art keywords
- length
- interleaving
- rate matching
- row
- interleaver
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 24
- 238000013507 mapping Methods 0.000 claims abstract description 59
- 238000004891 communication Methods 0.000 claims abstract description 7
- 238000010276 construction Methods 0.000 claims description 20
- 230000009286 beneficial effect Effects 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 230000010287 polarization Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Landscapes
- Error Detection And Correction (AREA)
Abstract
The invention provides an interleaving length determining method and system of a triangular interleaver, which relate to the technical field of wireless communication and comprise the following steps: constructing an interleaver mapping table according to a plurality of interleaving lengths supported by a triangle interleaver and associated rate matching length values thereof, which are acquired in advance; acquiring the current rate matching length of the matched bit stream obtained after the encoded bit stream is subjected to rate matching, and positioning the line to be searched in an interleaver mapping table according to the current rate matching length; and starting from the first column of the row to be searched, comparing the current rate matching length with the rate matching length value in the interleaver mapping table in sequence until the current rate matching length is not larger than the rate matching length value for the first time, and outputting the interleaving length associated with the rate matching length value as the current interleaving length of the triangular interleaver required by channel interleaving of the bit stream after matching. The method has the beneficial effect of saving 8192 bytes of memory space through processing time of less than 80 machine cycles.
Description
Technical Field
The present invention relates to the field of wireless communications technologies, and in particular, to a method and a system for determining an interleaving length of a triangular interleaver.
Background
The 3GPP (3 rd Generation Partnership Project, third generation partnership project) organization determines that DCI (Downlink Control Information ), UCI (Uplink Control Information, uplink control information) and PBCH (Physical Broadcast Channel ) carried information codes in a control channel employ a Polar Code (polarization Code) with higher decoding reliability when a 5G communication system protocol is standardized, and a channel interleaving technique of uplink UCI information employs a triangle interleaving technique.
The existing terminal chip generally queries a table with a size of 8192 bytes by using a rate matching length parameter to realize a channel triangular interleaving function of uplink Polar code coding, and has the problem of overlarge memory overhead.
Disclosure of Invention
The invention provides an interleaving length determining method of a triangular interleaver, aiming at the problems existing in the prior art, comprising the following steps:
step S1, when channel interleaving is needed to be carried out on the coded bit stream after channel coding, an interleaver mapping table is constructed according to a plurality of interleaving lengths supported by a triangle interleaver and associated rate matching length values thereof, which are acquired in advance;
each row in the interleaver mapping table is respectively associated with a preset interleaving length range, and the largest rate matching length value respectively associated with each interleaving length contained in each interleaving length range is sequentially used as each column element value in the corresponding row according to the sequence from small to large;
step S2, obtaining the current rate matching length of the bit stream after matching obtained after rate matching is carried out on the bit stream after encoding, and positioning the line to be searched in the mapping table of the interleaver according to the current rate matching length;
and S3, starting from the first column of the row to be searched, comparing the current rate matching length with the rate matching length value in the interleaver mapping table in sequence until the current rate matching length is not larger than the rate matching length value for the first time, and outputting the interleaving length associated with the rate matching length value as the current interleaving length of the triangular interleaver required by channel interleaving of the matched bit stream.
Preferably, the step S1 includes:
step S11, when the channel interleaving is needed to be carried out on the bit stream after encoding, dividing each interleaving length supported by the triangular interleaver into a plurality of interleaving length ranges;
step S12, taking the number of the interleaving length ranges as the number of rows, and sequentially constructing each row according to the sequence from small to large of the interleaving lengths correspondingly contained in the interleaving length ranges;
step S13, for each of the interleaving length ranges, extracting the largest rate matching length value associated with each of the interleaving lengths included in the interleaving length range, and sequentially taking the extracted rate matching length values as column element values in the corresponding rows in order from small to large, so as to construct and obtain the interleaver mapping table.
Preferably, the step S2 includes:
step S21, obtaining the current rate matching length of the matched bit stream obtained after rate matching is carried out on the coded bit stream;
step S22, comparing the current rate matching length with the rate matching length value of the last column in each row of the interleaver mapping table in sequence, and determining whether the current rate matching length is not greater than the rate matching length value of the last column in the current row and greater than the rate matching length value of the last column in the previous row:
if yes, the current row is used as the row to be searched, which is obtained through positioning;
if not, returning to the step S22.
Preferably, the step S3 includes:
step S31, the rate matching length value of the last column of the previous row of the row to be searched is obtained from the interleaver mapping table;
step S32, extracting the interleaving length from the interleaving length range associated with the row to be searched in sequence from small to large, and calculating the sum of the obtained rate matching length value of the last column of the previous row of the row to be searched and the extracted interleaving length to obtain a comparison matching length to be used as the rate matching length value of each column in the row to be searched;
step S33, determining whether the to-be-compared matching length is smaller than the current rate matching length:
if yes, returning to the step S32;
if not, outputting the interleaving length corresponding to the matching length to be compared as the current interleaving length of the triangular interleaver required by channel interleaving of the bit stream after matching.
The invention also provides an interleaving length determining system of the triangular interleaver, which applies the interleaving length determining method, and comprises the following steps:
the table construction module is used for constructing an interleaver mapping table according to a plurality of interleaving lengths supported by a triangular interleaver and associated rate matching length values thereof, which are acquired in advance, when channel interleaving is required to be carried out on the coded bit stream after channel coding;
each row in the interleaver mapping table is respectively associated with a preset interleaving length range, and the largest rate matching length value respectively associated with each interleaving length contained in each interleaving length range is sequentially used as each column element value in the corresponding row according to the sequence from small to large;
the searching and positioning module is connected with the table construction module and is used for acquiring the current rate matching length of the matched bit stream obtained after the rate matching of the coded bit stream and positioning the line to be searched in the interleaver mapping table according to the current rate matching length;
and the searching and matching module is connected with the searching and positioning module and is used for sequentially comparing the current rate matching length with the rate matching length value in the interleaver mapping table from the first column of the row to be searched until the current rate matching length is not larger than the rate matching length value for the first time, and outputting the interleaving length associated with the rate matching length value as the current interleaving length of the triangular interleaver required by channel interleaving of the matched bit stream.
Preferably, the table construction module includes:
a range dividing unit, configured to divide each of the interleaving lengths supported by the triangular interleaver into a plurality of interleaving length ranges when channel interleaving is required for the encoded bit stream;
a row construction unit, connected to the range division unit, configured to take the number of the interleaving length ranges as a row number, and construct each row sequentially according to the sequence from small to large of the interleaving lengths correspondingly included in the interleaving length ranges;
and the column construction unit is connected with the row construction unit and is used for respectively extracting the maximum rate matching length value associated with each interleaving length contained in each interleaving length range for each interleaving length range, and sequentially taking the extracted rate matching length values as column element values in the corresponding row according to the order from small to large so as to construct and obtain the interleaver mapping table.
Preferably, the search positioning module includes:
a data obtaining unit, configured to obtain the current rate matching length of the matched bit stream obtained after rate matching is performed on the encoded bit stream;
and the positioning unit is connected with the data acquisition unit and is used for comparing the current rate matching length with the rate matching length value of the last column in each row of the interleaver mapping table in sequence, and taking the current row as the row to be searched obtained by positioning when the current rate matching length is not greater than the rate matching length value of the last column in the current row and is greater than the rate matching length value of the last column in the last row.
Preferably, the search matching module includes:
a searching unit, configured to obtain, from the interleaver mapping table, the rate matching length value of a last column of a previous row of the row to be searched;
the computing unit is connected with the searching unit and is used for sequentially extracting the interleaving length from the interleaving length range associated with the row to be searched according to the sequence from small to large, and computing the sum of the obtained rate matching length value of the last column of the previous row of the row to be searched and the extracted interleaving length to obtain a matching length to be compared, so as to respectively serve as the rate matching length value of each column in the row to be searched;
and the judging unit is connected with the calculating unit and is used for outputting the interleaving length corresponding to the matching length to be compared as the current interleaving length of the triangular interleaver required by channel interleaving of the bit stream after matching when judging that the matching length to be compared is not less than the current rate matching length.
The invention also provides a polar code encoder which is characterized by comprising the interleaving length determining system.
The invention also provides a wireless communication user terminal which comprises the polar code encoder.
The technical scheme has the following advantages or beneficial effects: the method has the advantages that the interleaving lengths supported by the triangular interleaver are divided into a plurality of interleaving length ranges, the interleaver mapping table is constructed, the data query times are effectively reduced, the required interleaving length of the triangular interleaver can be obtained quickly by means of mathematical operation based on the interleaver mapping table, the interleaver mapping table is not required to be stored, the 8192-byte memory space is saved through the processing time of less than 80 machine cycles, the cost of a terminal chip is saved, and the method is significant for the terminal chip with low cost.
Drawings
FIG. 1 is a flow chart of an interleaving length determining method of a triangular interleaver according to a preferred embodiment of the present invention;
FIG. 2 is a schematic flow chart of step S1 in a preferred embodiment of the present invention;
FIG. 3 is a schematic flow chart of step S2 in the preferred embodiment of the present invention;
FIG. 4 is a schematic flow chart of step S3 according to the preferred embodiment of the present invention;
fig. 5 is a schematic diagram of an interleaving length determining system of a triangular interleaver according to a preferred embodiment of the present invention.
Detailed Description
The invention will now be described in detail with reference to the drawings and specific examples. The present invention is not limited to the embodiment, and other embodiments may fall within the scope of the present invention as long as they conform to the gist of the present invention.
In a preferred embodiment of the present invention, based on the above-mentioned problems occurring in the prior art, there is now provided a method for determining an interleaving length of a triangular interleaver, as shown in fig. 1, comprising:
step S1, when channel interleaving is needed to be carried out on the coded bit stream after channel coding, an interleaver mapping table is constructed according to a plurality of interleaving lengths supported by a triangle interleaver and associated rate matching length values thereof, which are acquired in advance;
each row in the interleaver mapping table is respectively associated with a preset interleaving length range, and the maximum rate matching length value respectively associated with each interleaving length contained in each interleaving length range is sequentially used as each column element value in the corresponding row according to the sequence from small to large;
step S2, obtaining the current rate matching length of the matched bit stream obtained after the rate matching of the coded bit stream, and positioning the line to be searched in an interleaver mapping table according to the current rate matching length;
step S3, starting from the first column of the line to be searched, comparing the current rate matching length with the rate matching length value in the interleaver mapping table in sequence until the current rate matching length is not larger than the rate matching length value for the first time, and outputting the interleaving length associated with the rate matching length value as the current interleaving length of the triangular interleaver required by channel interleaving of the bit stream after matching.
Specifically, when channel interleaving is required for the encoded bit stream after channel encoding, an interleaver mapping table needs to be constructed first, where the construction process of the interleaver mapping table can be understood as a process of converting the existing 8192-byte triangle interleaver table, and further specifically, as shown in fig. 2, the construction process of the interleaver mapping table in step S1 includes:
step S11, when the channel interleaving is needed to be carried out on the bit stream after encoding, dividing each interleaving length supported by a triangular interleaver into a plurality of interleaving length ranges;
step S12, taking the number of the interleaving length ranges as the number of lines, and sequentially constructing each line according to the sequence from small interleaving length to large interleaving length correspondingly contained in the interleaving length ranges;
step S13, for each interleaving length range, extracting the maximum rate matching length value associated with each interleaving length contained in the interleaving length range, and sequentially taking the extracted rate matching length values as column element values in the corresponding rows according to the order from small to large so as to construct and obtain an interleaver mapping table.
Specifically, the existing 8192 byte triangle interleaver table is shown in table one below:
table one:
as can be seen from Table one, there are 128 rows and 128 columns in the table, which contains 8256 elements, and the last row is half of the actual encoding, i.e., 64 columns, for a total of 8192 elements. When the interleaving length is 1, the data with the length of one byte can be contained in the first row and the first column of the table corresponding to the number 1, so that the associated rate matching length value is {1}; when the interleaving length is 2, the data with three byte lengths can be accommodated corresponding to the number 1 in the first row and the first column in the first row, the number 2 in the first column in the second row and the number 2 in the second column in the second row, so that the associated rate matching length comprises {1, 2 and 3}, that is, the data within three byte lengths can be subjected to channel interleaving processing by adopting a triangular interleaver with the interleaving length; when the interleaving length is 3, the data with six byte lengths can be accommodated corresponding to the number 1 in the first row and the first column in the first row, the number 2 in the first column in the second row, the number 2 in the second column in the second row, the number 3 in the first column in the third row, the number 3 in the second column in the third row and the number 3 in the third column in the third row, so that the associated rate matching length comprises {1, 2, 3, 4, 5 and 6}, that is, the data within six byte lengths can be subjected to channel interleaving processing by adopting the triangular interleaver with the interleaving length, and so on.
Based on the above table one, in this embodiment, each interleaving length supported by the triangular interleaver is first divided into a plurality of interleaving length ranges, where the interleaving length includes 1-128, and is preferably divided into four segments according to a sequence, each segment includes 32 interleaving lengths, and each segment corresponds to one interleaving length range, specifically: the first section has an interleaving length range of 1-32, as a first row of the interleaver mapping table to be constructed, the second section has an interleaving length range of 33-64, as a second row of the interleaver mapping table to be constructed, the third section has an interleaving length range of 65-96, as a third row of the interleaver mapping table to be constructed, and the fourth section has an interleaving length range of 97-128, as a fourth row of the interleaver mapping table to be constructed, to construct each row of the resulting interleaver mapping table.
For each row, the range of the associated interleaving length is 1-32, the maximum rate matching length value associated when the first row first list indicates that the interleaving length is 1, namely 1, the maximum rate matching length value associated when the first row second list indicates that the interleaving length is 2, namely 3, the maximum rate matching length value associated when the first row third list indicates that the interleaving length is 3, namely 6, and so on, and finally the table of 8192 elements is converted into an interleaver mapping table shown in the following table two containing 128 elements:
and (II) table:
| 0-31 | 1 | 3 | 6 | 10 | ...... | 435 | 465 | 496 | 528 |
| 32-63 | 561 | 595 | 630 | 666 | ...... | 1891 | 1953 | 2016 | 2080 |
| 64-95 | 2145 | 2211 | 2278 | 2346 | ...... | 4371 | 4465 | 4560 | 4656 |
| 96-127 | 4753 | 4851 | 4950 | 5050 | ...... | 7875 | 8001 | 8128 | 8256 |
considering that in a computer system, counting is usually started from 0, for the convenience of system execution, the range of interleaving length 1-32 is represented by sequence numbers 0-31, and so on, when the interleaving length is needed to participate in operation in subsequent calculation, the corresponding sequence number is only needed to be added by 1.
After the interleaver mapping table is constructed, query matching can be performed in the interleaver mapping table based on the current rate matching length of the matched bit stream obtained by rate matching the encoded bit stream, so as to determine the required interleaving length. Specifically, as shown in fig. 3, step S2 includes:
step S21, obtaining the current rate matching length of the matched bit stream obtained after the rate matching of the coded bit stream;
step S22, comparing the current rate matching length with the rate matching length value of the last column in each row of the interleaver mapping table in sequence, and judging whether the current rate matching length is not greater than the rate matching length value of the last column in the current row and greater than the rate matching length value of the last column in the last row:
if yes, the current row is used as a row to be searched, which is obtained through positioning;
if not, return to step S22.
Specifically, in this embodiment, in order to reduce the number of data queries, the row to be searched is first located during the query, so that the subsequent query only needs to be performed in the row, and no whole table is required to be searched, thereby further saving the processing time. Further specifically, as can be seen from the above table two, the maximum rate matching length value of the last column in each row is the maximum element value of the row, so that the current rate matching length can be compared with the rate matching length value of the last column of each row in sequence, and the row to be searched can be located up to four times of comparison.
After locating the line to be searched, the line can be searched, and in the embodiment, the line to be searched is preferably searched by adopting a mathematical operation mode, so that the memory is saved and the processing efficiency is improved. Specifically, as shown in fig. 4, step S3 includes:
step S31, obtaining the rate matching length value of the last column of the previous row of the row to be searched from the interleaver mapping table;
step S32, sequentially extracting interleaving lengths from interleaving length ranges associated with the rows to be searched according to the sequence from small to large, and calculating the sum of the obtained rate matching length value of the last column of the previous row of the rows to be searched and the extracted interleaving length to obtain the matching length to be compared, wherein the matching length is used as the rate matching length value of each column in the rows to be searched;
step S33, judging whether the matching length to be compared is smaller than the current rate matching length:
if yes, return to step S32;
if not, outputting the interleaving length corresponding to the matching length to be compared as the current interleaving length of the triangular interleaver required by channel interleaving of the bit stream after matching.
Specifically, in the present embodiment, as can be seen from the second table, the sum of the rate matching length value 528 of the last column of the first row and the first interleaving length 33 (sequence number 32+1) of the second row is the element value 561 of the first column of the second row, and the sum of the element value 561 of the first column of the second row and the second interleaving length 34 (sequence number 32+2) of the second row is the element value 595 of the second column of the second row, based on which the query can be performed in the row to be searched by means of mathematical operation.
Taking the current rate matching length as 700 as an example, it is greater than the rate matching length value 528 of the last column of the first row and less than the rate matching length value 2080 of the last column of the second row, so that the row to be searched for by the second row is determined. The calculation is then performed based on the rate matching value of the last column of the first row and the associated interleaving length range 33-64 of the second row, 528+33=561, less than 700, 528+33+34=595, less than 700, 528+33+34+35=630, less than 700, 528+33+34+35+36=666, less than 700, 528+33+34+35+36+37=703, greater than 700, the calculation is stopped, and 37 is the current interleaving length of the triangular interleaver required for channel interleaving of the matched bit stream with a rate matching length of 700.
It can be understood that the above-mentioned interleaving length range includes four, each interleaving length range includes 32 elements, which corresponds to 32-bit word, so as to facilitate operation, but the interleaving length range is not limited in such a range division manner, and can be customized according to requirements.
In summary, in the present technical solution, the table two is only used as one step in the flow, and no storage of the table two is required, so, compared with the existing method of obtaining the interleaving length based on 8192 byte table matching, the 8192 byte memory space is optimized, and the segmented query is adopted, so that the processing efficiency is further improved, the cost of the terminal chip is saved, and the method has significant meaning especially for low-cost terminal chips such as the Redcap terminal chip of R17. It can be understood that the present solution, although optimized based on the 3gpp 5g r17 protocol, is equally suitable for all wireless communication systems supporting Polar coding that follow-up evolution.
The invention also provides an interleaving length determining system of the triangular interleaver, which applies the above interleaving length determining method, as shown in fig. 5, the interleaving length determining system comprises:
the table construction module 1 is used for constructing an interleaver mapping table according to a plurality of interleaving lengths supported by a triangle interleaver and associated rate matching length values thereof, which are acquired in advance, when channel interleaving is required to be carried out on the coded bit stream after channel coding;
each row in the interleaver mapping table is respectively associated with a preset interleaving length range, and the maximum rate matching length value respectively associated with each interleaving length contained in each interleaving length range is sequentially used as each column element value in the corresponding row according to the sequence from small to large;
the searching and positioning module 2 is connected with the table construction module 1 and is used for acquiring the current rate matching length of the matched bit stream obtained after the rate matching of the coded bit stream and positioning the line to be searched in the interleaver mapping table according to the current rate matching length;
the searching and matching module 3 is connected with the searching and positioning module 2 and is used for sequentially comparing the current rate matching length with the rate matching length value in the interleaver mapping table from the first column of the row to be searched until the sum of the column number of the current rate matching length value and the lower limit value of the associated interleaving length range is output as the current interleaving length of the triangular interleaver required by channel interleaving of the matched bit stream when the current rate matching length is not larger than the rate matching length value for the first time.
In a preferred embodiment of the present invention, the table construction module 1 includes:
a range dividing unit 11, configured to divide each interleaving length supported by the triangular interleaver into a plurality of interleaving length ranges when channel interleaving is required for the encoded bit stream;
a row construction unit 12, which is connected to the range division unit 11, and is configured to take the number of the interleaving length ranges as the number of rows, and construct each row sequentially according to the sequence from small to large of the interleaving lengths correspondingly included in the interleaving length ranges;
a column construction unit 13, which is connected to the row construction unit 12, and is configured to extract, for each interleaving length range, a maximum rate matching length value associated with each interleaving length included in the interleaving length range, and sequentially use the extracted rate matching length values as column element values in the corresponding rows in order from small to large, so as to construct and obtain an interleaver mapping table.
In a preferred embodiment of the present invention, the search positioning module 2 comprises:
a data obtaining unit 21, configured to obtain a current rate matching length of a matched bit stream obtained by rate matching the encoded bit stream;
the positioning unit 22 is connected to the data obtaining unit 21, and is configured to compare the current rate matching length with the rate matching length value of the last column in each row of the interleaver mapping table in sequence, and when the current rate matching length is not greater than the rate matching length value of the last column in the current row and is greater than the rate matching length value of the last column in the last row, use the current row as the row to be searched obtained by positioning.
In a preferred embodiment of the present invention, the search matching module 3 includes:
a searching unit 31, configured to obtain, from the interleaver mapping table, a rate matching length value of a last column of a previous row of the row to be searched;
a calculating unit 32, connected to the searching unit 31, for sequentially extracting interleaving lengths from interleaving length ranges associated with the rows to be searched in order from small to large, and calculating a sum of the obtained rate matching length value of the last column of the previous row of the rows to be searched and the extracted interleaving length to obtain a matching length to be compared, so as to respectively serve as rate matching length values of each column in the rows to be searched;
the judging unit 33 is connected to the calculating unit 32, and is configured to output, when it is judged that the length of the to-be-compared match is not less than the current rate match length, a sum of the number of columns of the interleaving length corresponding to the length of the to-be-compared match and the rate match length value corresponding to the length of the to-be-compared match as a current interleaving length of the triangular interleaver required for channel interleaving of the matched bit stream.
The invention also provides a polar code encoder which is characterized by comprising the interleaving length determining system.
The invention also provides a wireless communication user terminal which comprises the polar code encoder.
The foregoing description is only illustrative of the preferred embodiments of the present invention and is not to be construed as limiting the scope of the invention, and it will be appreciated by those skilled in the art that equivalent substitutions and obvious variations may be made using the description and drawings, and are intended to be included within the scope of the present invention.
Claims (10)
1. An interleaving length determining method of a triangular interleaver, comprising:
step S1, when channel interleaving is needed to be carried out on the coded bit stream after channel coding, an interleaver mapping table is constructed according to a plurality of interleaving lengths supported by a triangle interleaver and associated rate matching length values thereof, which are acquired in advance;
each row in the interleaver mapping table is respectively associated with a preset interleaving length range, and the largest rate matching length value respectively associated with each interleaving length contained in each interleaving length range is sequentially used as each column element value in the corresponding row according to the sequence from small to large;
step S2, obtaining the current rate matching length of the bit stream after matching obtained after rate matching is carried out on the bit stream after encoding, and positioning the line to be searched in the mapping table of the interleaver according to the current rate matching length;
and S3, starting from the first column of the row to be searched, comparing the current rate matching length with the rate matching length value in the interleaver mapping table in sequence until the current rate matching length is not larger than the rate matching length value for the first time, and outputting the interleaving length associated with the rate matching length value as the current interleaving length of the triangular interleaver required by channel interleaving of the matched bit stream.
2. The interleaving length determining method according to claim 1, wherein the step S1 comprises:
step S11, when the channel interleaving is needed to be carried out on the bit stream after encoding, dividing each interleaving length supported by the triangular interleaver into a plurality of interleaving length ranges;
step S12, taking the number of the interleaving length ranges as the number of rows, and sequentially constructing each row according to the sequence from small to large of the interleaving lengths correspondingly contained in the interleaving length ranges;
step S13, for each of the interleaving length ranges, extracting the largest rate matching length value associated with each of the interleaving lengths included in the interleaving length range, and sequentially taking the extracted rate matching length values as column element values in the corresponding rows in order from small to large, so as to construct and obtain the interleaver mapping table.
3. The interleaving length determining method according to claim 1, wherein the step S2 comprises:
step S21, obtaining the current rate matching length of the matched bit stream obtained after rate matching is carried out on the coded bit stream;
step S22, comparing the current rate matching length with the rate matching length value of the last column in each row of the interleaver mapping table in sequence, and determining whether the current rate matching length is not greater than the rate matching length value of the last column in the current row and greater than the rate matching length value of the last column in the previous row:
if yes, the current row is used as the row to be searched, which is obtained through positioning;
if not, returning to the step S22.
4. The interleaving length determining method according to claim 1, wherein the step S3 comprises:
step S31, the rate matching length value of the last column of the previous row of the row to be searched is obtained from the interleaver mapping table;
step S32, extracting the interleaving length from the interleaving length range associated with the row to be searched in sequence from small to large, and calculating the sum of the obtained rate matching length value of the last column of the previous row of the row to be searched and the extracted interleaving length to obtain a comparison matching length to be used as the rate matching length value of each column in the row to be searched;
step S33, determining whether the to-be-compared matching length is smaller than the current rate matching length:
if yes, returning to the step S32;
if not, outputting the interleaving length corresponding to the matching length to be compared as the current interleaving length of the triangular interleaver required by channel interleaving of the bit stream after matching.
5. An interleaving length determining system of a triangular interleaver, characterized in that an interleaving length determining method according to any one of claims 1 to 5 is applied, the interleaving length determining system comprising:
the table construction module is used for constructing an interleaver mapping table according to a plurality of interleaving lengths supported by a triangular interleaver and associated rate matching length values thereof, which are acquired in advance, when channel interleaving is required to be carried out on the coded bit stream after channel coding;
each row in the interleaver mapping table is respectively associated with a preset interleaving length range, and the largest rate matching length value respectively associated with each interleaving length contained in each interleaving length range is sequentially used as each column element value in the corresponding row according to the sequence from small to large;
the searching and positioning module is connected with the table construction module and is used for acquiring the current rate matching length of the matched bit stream obtained after the rate matching of the coded bit stream and positioning the line to be searched in the interleaver mapping table according to the current rate matching length;
and the searching and matching module is connected with the searching and positioning module and is used for sequentially comparing the current rate matching length with the rate matching length value in the interleaver mapping table from the first column of the row to be searched until the current rate matching length is not larger than the rate matching length value for the first time, and outputting the interleaving length associated with the rate matching length value as the current interleaving length of the triangular interleaver required by channel interleaving of the matched bit stream.
6. The interleaving length determination system as claimed in claim 5, wherein the table construction module comprises:
a range dividing unit, configured to divide each of the interleaving lengths supported by the triangular interleaver into a plurality of interleaving length ranges when channel interleaving is required for the encoded bit stream;
a row construction unit, connected to the range division unit, configured to take the number of the interleaving length ranges as a row number, and construct each row sequentially according to the sequence from small to large of the interleaving lengths correspondingly included in the interleaving length ranges;
and the column construction unit is connected with the row construction unit and is used for respectively extracting the maximum rate matching length value associated with each interleaving length contained in each interleaving length range for each interleaving length range, and sequentially taking the extracted rate matching length values as column element values in the corresponding row according to the order from small to large so as to construct and obtain the interleaver mapping table.
7. The interleaving length determining system as claimed in claim 5, wherein the search positioning module comprises:
a data obtaining unit, configured to obtain the current rate matching length of the matched bit stream obtained after rate matching is performed on the encoded bit stream;
and the positioning unit is connected with the data acquisition unit and is used for comparing the current rate matching length with the rate matching length value of the last column in each row of the interleaver mapping table in sequence, and taking the current row as the row to be searched obtained by positioning when the current rate matching length is not greater than the rate matching length value of the last column in the current row and is greater than the rate matching length value of the last column in the last row.
8. The interleaving length determination system as claimed in claim 5, wherein the search matching module comprises:
a searching unit, configured to obtain, from the interleaver mapping table, the rate matching length value of a last column of a previous row of the row to be searched;
the computing unit is connected with the searching unit and is used for sequentially extracting the interleaving length from the interleaving length range associated with the row to be searched according to the sequence from small to large, and computing the sum of the obtained rate matching length value of the last column of the previous row of the row to be searched and the extracted interleaving length to obtain a matching length to be compared, so as to respectively serve as the rate matching length value of each column in the row to be searched;
and the judging unit is connected with the calculating unit and is used for outputting the interleaving length corresponding to the matching length to be compared as the current interleaving length of the triangular interleaver required by channel interleaving of the bit stream after matching when judging that the matching length to be compared is not less than the current rate matching length.
9. A pole code encoder comprising an interleaving length determining system as claimed in any of claims 1-5.
10. A wireless communication user terminal comprising the polar code encoder as in claim 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310031442.1A CN116032429B (en) | 2023-01-10 | 2023-01-10 | Method and system for determining interleaving length of triangular interleaver |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310031442.1A CN116032429B (en) | 2023-01-10 | 2023-01-10 | Method and system for determining interleaving length of triangular interleaver |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116032429A true CN116032429A (en) | 2023-04-28 |
| CN116032429B CN116032429B (en) | 2024-07-30 |
Family
ID=86079148
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310031442.1A Active CN116032429B (en) | 2023-01-10 | 2023-01-10 | Method and system for determining interleaving length of triangular interleaver |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116032429B (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020194554A1 (en) * | 2001-05-10 | 2002-12-19 | Stmicroelectronics, S.R.L. | Prunable S-random block interleaver method and corresponding interleaver |
| US20090147724A1 (en) * | 2007-12-11 | 2009-06-11 | Motorola, Inc. | Method and appratus for rate matching within a communication system |
| CN101540654A (en) * | 2009-05-04 | 2009-09-23 | 普天信息技术研究院有限公司 | Method for interlacing rate matching and de-interlacing off-rate matching |
| CN101547064A (en) * | 2009-05-06 | 2009-09-30 | 普天信息技术研究院有限公司 | Interleaving and rate matching and de-interleaving and rate de-matching methods |
| CN110071728A (en) * | 2018-01-24 | 2019-07-30 | 华为技术有限公司 | A kind of deinterleaving method and interleaving apparatus |
| CN112003672A (en) * | 2020-08-12 | 2020-11-27 | 广东省新一代通信与网络创新研究院 | Rate matching method, rate de-matching method and device for Polar code |
| CN112104380A (en) * | 2020-09-21 | 2020-12-18 | Oppo广东移动通信有限公司 | Rate matching method, chip and terminal |
| CN113381770A (en) * | 2021-06-10 | 2021-09-10 | Oppo广东移动通信有限公司 | Interleaving method, interleaver, and storage medium |
| CN114629507A (en) * | 2022-01-25 | 2022-06-14 | 海南大学 | Turbo and LDPC code rate matching and interleaver shared storage design method |
-
2023
- 2023-01-10 CN CN202310031442.1A patent/CN116032429B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020194554A1 (en) * | 2001-05-10 | 2002-12-19 | Stmicroelectronics, S.R.L. | Prunable S-random block interleaver method and corresponding interleaver |
| US20090147724A1 (en) * | 2007-12-11 | 2009-06-11 | Motorola, Inc. | Method and appratus for rate matching within a communication system |
| CN101540654A (en) * | 2009-05-04 | 2009-09-23 | 普天信息技术研究院有限公司 | Method for interlacing rate matching and de-interlacing off-rate matching |
| CN101547064A (en) * | 2009-05-06 | 2009-09-30 | 普天信息技术研究院有限公司 | Interleaving and rate matching and de-interleaving and rate de-matching methods |
| CN110071728A (en) * | 2018-01-24 | 2019-07-30 | 华为技术有限公司 | A kind of deinterleaving method and interleaving apparatus |
| CN112003672A (en) * | 2020-08-12 | 2020-11-27 | 广东省新一代通信与网络创新研究院 | Rate matching method, rate de-matching method and device for Polar code |
| CN112104380A (en) * | 2020-09-21 | 2020-12-18 | Oppo广东移动通信有限公司 | Rate matching method, chip and terminal |
| CN113381770A (en) * | 2021-06-10 | 2021-09-10 | Oppo广东移动通信有限公司 | Interleaving method, interleaver, and storage medium |
| CN114629507A (en) * | 2022-01-25 | 2022-06-14 | 海南大学 | Turbo and LDPC code rate matching and interleaver shared storage design method |
Non-Patent Citations (2)
| Title |
|---|
| KANGMING JIANG: ""Improved interleaving scheme for DVB-S2 BICM system"", 《2011 INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS AND SIGNAL PROCESSING (WCSP)》, 8 December 2011 (2011-12-08) * |
| 柴华: ""Turbo码的并行算法和并行交织器的研究"", 《中国优秀硕士学位论文全文数据库 信息科技辑》, 15 April 2015 (2015-04-15) * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116032429B (en) | 2024-07-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9258013B1 (en) | Data compression with Huffman code on multicore processors | |
| US20190207709A1 (en) | Communication method and apparatus | |
| CN111262876B (en) | Data processing method, device and equipment based on block chain and storage medium | |
| EP3614568A1 (en) | Encoding method and device | |
| CN101667843B (en) | Methods and devices for compressing and uncompressing data of embedded system | |
| CN108574494B (en) | Coding and decoding method and device | |
| KR20090025885A (en) | Device and method for compressing data | |
| EP4236129A1 (en) | Communication data processing method and apparatus, device, and storage medium | |
| CN115276662B (en) | Method for efficiently compressing and transmitting micro-service user information | |
| CN102880703A (en) | Methods and systems for encoding and decoding Chinese webpage data | |
| EP3198728A1 (en) | Sharing initial dictionaries and huffman trees between multiple compressed blocks in lz-based compression algorithms | |
| CN116032429B (en) | Method and system for determining interleaving length of triangular interleaver | |
| CN114301468A (en) | FSE encoding method, device, equipment and storage medium | |
| CN112559482B (en) | Binary data classification processing method and system based on distribution | |
| US10873836B2 (en) | Efficient short message compression | |
| US10200152B2 (en) | Method and device for transmitting data using LDPC code | |
| CN104765790B (en) | A kind of method and apparatus of data query | |
| CN114025024A (en) | Data transmission method and device | |
| CN110875743B (en) | Data compression method based on sampling guess | |
| CN1469650A (en) | Transmission format combined indicator decoding circuit and its decoding method | |
| CN113541914B (en) | CNAV-2 text frame synchronization method based on association rule | |
| CN112511171B (en) | Compressed data decoding method, device and equipment and readable storage medium | |
| CN115801192B (en) | Low-complexity pole code information bit set calculation method, medium and device | |
| CN109857340B (en) | Method and device for storing and reading files in NOR FLASH and storage medium | |
| US20220415441A1 (en) | Method for the Compression of Genome Sequence Data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |