Block interleaving method, de-interleaving method, block interleaver and de-interleaver

Abstract

The invention discloses a block interleaving method, a de-interleaving method, a block interleaver and a de-interleaver, and the interleaving method comprises the steps: writing a first data sequence into the interleaver according to a sequence, and obtaining a first matrix; performing transformation processing on the first matrix to obtain a second matrix; finally, the second matrix is read out according to the sequence, a second data sequence is obtained, the large minimum interleaving depth can be achieved, deep fading and periodic fading on the frequency domain can be effectively resisted, and therefore the fault tolerance performance of the system is improved.

Description

Technical Field

[0001] Embodiments of the present application relate to the field of communication technology, and in particular to a transformation-based interleaving method, a block interleaving method, a deinterleaving method, a block interleaver, and a deinterleaver. Background Art

[0002] With the coming of the 5G era, high-speed mobile communication networks can carry and transmit richer multimedia resources, which will inevitably have a huge impact on the radio and television industry. The emergence of 5G will bring challenges to traditional digital terrestrial broadcasting technology, and also bring new opportunities for mobile reception of radio and television. 5G will support services such as mobile video, ultra-high definition, augmented reality and virtual reality, but in the face of the rapid growth of multimedia services for large-scale users, the explosive traffic consumption will greatly affect the service quality of users accessing mobile communication networks. Against this background, eMBMS (Evolved Multimedia Broadcast Multicast Services) based on LTE (Long Term Evolution) and its evolved version EnTV (Enhancement for TV Service) in Rel-14 provide ideas for solving this contradiction.

[0003] In broadcast communications, the characteristics of the wireless channel itself make its channel conditions very complex and harsh. For example, the presence of pedestrians, vehicles and buildings will cause the signal to reflect and diffract, which makes the final received signal actually the superposition of the same signal through different paths, and the time delay and phase of the sub-signals in each path are different, so the final synthesized total signal often fluctuates violently. This phenomenon is called multipath fading. This signal fading caused by the harsh channel often causes continuous burst errors in the data in the receiver. The existing demodulation and error correction technologies are easier to combat scattered random errors, but it is difficult to correct a continuous burst error. Therefore, in order to convert this continuous burst error into scattered random errors as much as possible and improve the fault tolerance performance of the system, the system requires frequency domain interleaving technology.

[0004] The main function of frequency domain interleaving is to convert long continuous deep fading in the frequency domain into shorter continuous fading that is approximately random, and these shorter fading that is approximately random can be corrected by the system. In this way, frequency domain interleaving can help the system give full play to its error correction capabilities in each frequency band and improve the overall fault tolerance of the system. The design principle of interleaving is to disperse the continuous deep fading generated in the channel into an approximately random pattern as much as possible, facilitate hardware implementation, and reduce the complexity and overhead of the equipment for the channel in which the system is located. In addition, periodic fading often occurs in the frequency domain. Therefore, on the basis of the frequency domain interleaving design, intra-row permutation is further introduced to resist periodic fading in the frequency domain, and the loss in the minimum interleaving depth is very small. Summary of the invention

[0005] In order to solve the above-mentioned problem of periodic fading that often occurs in the frequency domain, the present application provides a block interleaving method, a deinterleaving method, an interleaver, and a deinterleaver.

[0006] The embodiment of the present application provides a block interleaving method, comprising the following steps:

[0007] Step S1, writing a first data sequence into an interleaver in order to obtain a first matrix;

[0008] Step S2, transforming the first matrix to obtain a second matrix;

[0009] Step S3, read out the second matrix in sequence to obtain a second data sequence.

[0010] The embodiment of the present application provides a block interleaving deinterleaving method, comprising the following steps:

[0011] Step N1, writing the second data sequence into the deinterleaver in order to obtain a third matrix;

[0012] Step N2, performing inverse transformation processing on the third matrix to obtain a fourth matrix;

[0013] Step N3, read out the fourth matrix in sequence to obtain a first data sequence.

[0014] The embodiment of the present application provides a block interleaving interleaver, which interleaves symbols within an OFDM symbol, including:

[0015] The reading and writing unit writes the first data sequence into the interleaving block in order to generate a first matrix;

[0016] The processing unit transforms the first matrix written by the reading and writing unit to generate a second matrix;

[0017] The reading and writing unit reads out the second matrix to obtain an interleaved second data sequence.

[0018] The embodiment of the present application provides a block interleaving deinterleaver, which interleaves symbols within an OFDM symbol, including:

[0019] The reading and writing unit writes the second data sequence into the deinterleaver in order to generate a third matrix;

[0020] The processing unit performs an inverse transformation on the third matrix written by the reading and writing unit to generate a fourth matrix;

[0021] The reading and writing unit reads out the fourth matrix to obtain a deinterleaved first data sequence.

[0022] An embodiment of the present application also provides a computer-readable storage medium on which a computer program is stored. When the program is executed by a processor, the above-mentioned block interleaving method or deinterleaving method is implemented.

[0023] The block interleaving method provided in the embodiment of the present application obtains a first matrix by writing a first data sequence into an interleaver in sequence; then transforming the first matrix to obtain a second matrix; and finally reading the second matrix in sequence to obtain a second data sequence. The method can have a larger minimum interleaving depth and can effectively resist deep fading and periodic fading in the frequency domain, thereby improving the fault tolerance performance of the system. BRIEF DESCRIPTION OF THE DRAWINGS

[0024] The features, advantages and aspects of the embodiments disclosed in the present application will become more apparent with reference to the following detailed description in conjunction with the accompanying drawings. Throughout the accompanying drawings, the same or similar reference numerals represent the same or similar elements. It should be understood that the accompanying drawings are schematic and the originals and elements are not necessarily drawn to scale.

[0025] Figure 1 A flowchart of an interleaving method provided in an embodiment of the present application;

[0026] Figure 2 A flowchart of an interleaving method provided in an embodiment of the present application;

[0027] Figure 3 A flowchart of an interleaving method provided in an embodiment of the present application;

[0028] Figure 4 A flowchart of a deinterleaving method provided in an embodiment of the present application;

[0029] Figure 5 A schematic diagram of the structure of an interleaver provided in an embodiment of the present application;

[0030] Figure 6 A schematic diagram of the structure of a deinterleaver provided in an embodiment of the present application.

[0031] Figure 7 A technical effect diagram of the interleaving method provided in Embodiment 1 of the present application;

[0032] Figure 8 A technical effect diagram of the interleaving method provided in Embodiment 2 of the present application;

[0033] Fig. 9 This is a technical effect diagram of the interleaving method provided in Example 3 of the present application. DETAILED DESCRIPTION

[0034] The present application will be further described in detail below in conjunction with the accompanying drawings and embodiments. It is to be understood that the specific embodiments described herein are only used to explain the present application, rather than to limit the present application. It should also be noted that, for ease of description, only the parts related to the present application, rather than all structures, are shown in the accompanying drawings.

[0035] It should be mentioned before discussing the exemplary embodiments in more detail that some exemplary embodiments are described as processes or methods depicted as flow charts. Although the flow charts describe the steps as sequential processes, many of the steps therein can be implemented in parallel, concurrently or simultaneously. In addition, the order of the steps can be rearranged. The process can be terminated when its operation is completed, but can also have additional steps not included in the accompanying drawings. The process can correspond to a method, function, procedure, subroutine, subprogram, etc.

[0036] In addition, the embodiments in the present application and the features in the embodiments may be combined with each other if there is no conflict.

[0037] The present application will be further described in detail below in conjunction with the accompanying drawings and embodiments. It is to be understood that the specific embodiments described herein are only used to explain the present application, rather than to limit the present application. It should also be noted that, for ease of description, only the parts related to the present application, rather than all structures, are shown in the accompanying drawings.

[0038] It should be mentioned before discussing the exemplary embodiments in more detail that some exemplary embodiments are described as processes or methods depicted as flow charts. Although the flow charts describe the steps as sequential processes, many of the steps therein can be implemented in parallel, concurrently or simultaneously. In addition, the order of the steps can be rearranged. The process can be terminated when its operation is completed, but can also have additional steps not included in the accompanying drawings. The process can correspond to a method, function, procedure, subroutine, subprogram, etc.

[0039] It should be noted that the concepts such as "first" and "second" mentioned in the embodiments of the present application are only used to distinguish different devices, modules, units or other objects, and are not used to limit the order of functions performed by these devices, modules, units or other objects or their interdependent relationships.

[0040] In addition, without conflict, the embodiments in the present application and the features in the embodiments can be combined with each other.

[0041] The present invention provides a block interleaving method, including:

[0042] Step S1, writing a first data sequence into an interleaver to obtain a first matrix;

[0043] Step S2, performing a transformation process on the first matrix to obtain a second matrix;

[0044] Step S3, reading the second matrix out of the interleaver to obtain a second data sequence.

[0045] Specifically, for the block interleaving method provided by the present invention, by writing a data sequence into an interleaver and performing a transformation process on the data sequence, an interleaved data sequence is obtained. Compared with the prior art, the block interleaving method provided by the present invention has a relatively large minimum interleaving depth and can effectively resist deep fading and periodic fading in the frequency domain, thereby improving the fault tolerance performance of the communication system.

[0046] Among them, in step S1, during the process of writing the data sequence into the interleaver, the data sequence can be written into the interleaver in order, for example, the data sequence can be written into the interleaver in column order, or the data sequence can be written into the interleaver in row order, to obtain a first matrix.

[0047] Furthermore, in step S1, during the process of writing the data sequence into the interleaver, the data sequence can also be written into the interleaver out of order, for example, the data sequence can be written into the interleaver without a fixed order, or the data sequence can be randomly shuffled and written into the interleaver, to obtain a first matrix.

[0048] Among them, in step S2, when performing the transformation process on the first matrix, the first matrix can be subjected to a transformation process, such as permutation, offset, and other processes other than the transformation process can also be performed on the first matrix, such as operations, to obtain a second matrix. The transformation process proposed by the present invention can also be referred to as Permuted processing in actual operation.

[0049] Among them, in step S3, in the process of reading the second matrix from the interleaver, the second matrix can be read out from the interleaver in sequence, for example, the second matrix can be read out from the interleaver in row order, or the second matrix can be read out from the interleaver in column order to obtain the interleaved second data sequence.

[0050] Furthermore, in step S3, in the process of reading the second matrix from the interleaver, it may not be read out from the interleaver in sequence. For example, the second matrix may not be read out from the interleaver in a fixed order, or the second matrix may be read out from the interleaver in a randomly shuffled order to obtain an interleaved second data sequence.

[0051] That is to say, the present invention provides a block interleaving method, such as Figure 1 As shown, including:

[0052] Step S1, writing a first data sequence into an interleaver in order to obtain a first matrix;

[0053] Step S2, transforming the first matrix to obtain a second matrix;

[0054] Step S3, read out the second matrix in sequence to obtain a second data sequence.

[0055] Furthermore, the specific operations in different steps provided by the present invention can be combined with each other in actual implementation.

[0056] For example, the block interleaving method provided by the present invention may include: step S1, writing the first data sequence into the interleaver in column order to obtain a first matrix; step S2, transforming the first matrix to obtain a second matrix; step S3, reading the second matrix in row order to obtain a second data sequence.

[0057] For example, the block interleaving method provided by the present invention may include: step S1, writing the first data sequence into the interleaver in row order to obtain a first matrix; step S2, transforming the first matrix to obtain a second matrix; step S3, reading the second matrix in row order to obtain a second data sequence.

[0058] For example, the block interleaving method provided by the present invention may include: step S1, writing the first data sequence into the interleaver in column order to obtain a first matrix; step S2, transforming the first matrix to obtain a second matrix; step S3, reading the second matrix in column order to obtain a second data sequence.

[0059] For example, the block interleaving method provided by the present invention may include: Step S1, writing a first data sequence into an interleaver in column order to obtain a first matrix; Step S2, performing a transformation process and other processes on the first matrix to obtain a second matrix; Step S3, reading out the second matrix in row order to obtain a second data sequence.

[0060] For another example, the block interleaving method provided by the present invention may include: Step S1, writing a first data sequence into an interleaver in row order to obtain a first matrix; Step S2, performing a transformation process on the first matrix to obtain a second matrix; Step S3, reading out the second matrix in column order to obtain a second data sequence.

[0061] For still another example, the block interleaving method provided by the present invention may include: Step S1, writing a first data sequence into an interleaver in row order to obtain a first matrix; Step S2, performing a transformation process and other processes on the first matrix to obtain a second matrix; Step S3, reading out the second matrix in column order to obtain a second data sequence.

[0062] There are also other combinations of different steps, which will not be enumerated one by one here.

[0063] The present invention provides a block interleaving method, and the data sequence may use one resource element or multiple resource elements as a basic unit.

[0064] Specifically, the data sequence may use 1 resource element as a basic unit, or may use more than 1 resource element as a basic unit. For example, it may also use 2 resource elements, 3 resource elements, 4 resource elements, etc. as basic units.

[0065] In one embodiment, the process of writing the first data sequence into the interleaver may include: writing the first data sequence into the interleaver in column order.

[0066] In one embodiment, the process of writing the first data sequence into the interleaver may include: writing the first data sequence into the interleaver in row order.

[0067] In one embodiment, the process of performing a transformation process on the first matrix may include: performing an inter-row transformation on the first matrix, and / or performing an intra-row transformation on the first matrix.

[0068] Correspondingly, the interleaving method provided by the present invention, as Figure 2 shown, may include:

[0069] Step S1, writing the first data sequence into the interleaver in order to obtain a first matrix;

[0070] Step S2, performing an inter-row transformation and / or an intra-row transformation on the first matrix to obtain a second matrix;

[0071] Step S3, read out the second matrix in sequence to obtain a second data sequence.

[0072] The process of transforming the first matrix may include only performing intra-row transformation on the first matrix, may include only performing intra-row transformation on the first matrix, or may include performing inter-row transformation and intra-row transformation on the first matrix.

[0073] Specifically, if the transformation process of the first matrix includes inter-row transformation and intra-row transformation, the transformation process may be performed in a fixed order or in a random order.

[0074] For example, in the process of transforming the first matrix, the first matrix may be first permuted within the rows and then permuted between the rows; the first matrix may be first permuted between the rows and then permuted within the rows; or the first matrix may be permuted between the rows and then permuted within the rows at the same time.

[0075] In one embodiment, the process of performing inter-row transformation on the first matrix includes: performing inter-row transformation on the first matrix according to an inter-row transformation index sequence.

[0076] Specifically, the first matrix is ​​subjected to inter-row transformation according to the inter-row transformation index sequence, that is, each basic unit in the first matrix is ​​subjected to inter-row transformation according to the inter-row transformation index sequence. Therefore, in actual operation, after determining the inter-row transformation index sequence, different communication vendors can use the same inter-row transformation index sequence to perform inter-row transformation, and for the same first matrix, that is, the same two-dimensional matrix obtained after the same data sequence is written into the interleaver, the same inter-row transformation index sequence is used to perform inter-row transformation, thereby obtaining the same transformation result, that is, the same second matrix, thereby ensuring that different communication vendors generate the same transformation result, thereby realizing data transmission and communication. Accordingly, in the actual operation of the present invention, the inter-row transformation index sequence proposed by the present invention is used to perform inter-row transformation, which can not only ensure that data between different communication vendors can be transmitted and communicated with each other, but also effectively resist deep fading and periodic fading in the frequency domain of the transmitted data, thereby improving the fault tolerance performance of the communication system.

[0077] In one embodiment, the inter-row transformation index sequence can be calculated based on the first matrix obtained after writing into the interleaver.

[0078] Specifically, in the process of performing inter-row transformation on the first matrix, the inter-row transformation may be performed on the first matrix according to the inter-row transformation index sequence calculated from the first matrix obtained after writing into the interleaver.

[0079] In other words, in the process of performing inter-row transformation on the first matrix, the inter-row transformation may be performed on the first matrix at one or more specific intervals.

[0080] In one embodiment, the inter-row transformation index sequence may be generated according to a random sequence or a pseudo-random sequence or a random extended sequence or a pseudo-random extended sequence.

[0081] Specifically, in the process of performing inter-row transformation on the first matrix, the inter-row transformation may be performed on the first matrix according to an inter-row transformation index sequence generated by a random sequence or a pseudo-random sequence or a random extended sequence or a pseudo-random extended sequence.

[0082] In other words, in the process of performing inter-row transformation on the first matrix, the inter-row transformation index sequence may be obtained in a random manner, such as random intervals and random operations, to perform inter-row transformation on the first matrix.

[0083] In one embodiment, the first matrix may be subjected to inter-row transformation at specific intervals through an inter-row transformation index sequence.

[0084] Specifically, the specific interval may be determined according to the first matrix, for example, the interval is determined according to the number of rows and columns of the first matrix. At this time, the first matrix may be the first matrix directly obtained by the interleaver after writing, or may be the first matrix after partial transformation processing, such as the first matrix after intra-row transformation processing; or

[0085] The interval may be determined according to the interleaver, for example, the interval may be determined according to the number of rows or columns of the interleaver; or

[0086] The interval may also be determined according to the second matrix, for example, the interval is determined according to the number of rows and columns of the second matrix, in which case the second matrix is ​​a transformed second matrix; or

[0087] The interval may also be a predetermined one or more fixed values; or other methods.

[0088] Accordingly, during the generation process, the inter-row transform index sequence may be generated according to a specific interval, or calculated based on the first matrix obtained after writing into the interleaver, or calculated based on the transformed first matrix, or generated in other ways.

[0089] In one embodiment, the generation formula of the inter-row transformation index sequence may be:

[0090]

[0091] Among them, R i refers to the row index before the first matrix transformation, i refers to the row index after the first matrix transformation, M is the number of rows of the interleaver, N is the number of columns of the interleaver, and d is the interval for inter-row permutation.

[0092] Specifically, the first matrix is ​​transformed between rows using the inter-row transformation index sequence, and the Rth i The row is transformed to the i-th row.

[0093] Specifically, for the first row of the first matrix, that is, when i=1, no inter-row transformation is required, that is, the first Rth row of the first matrix 1 The first matrix can be transformed into the first row; for the second row of the first matrix, that is, when i = 2, the R 1 +d rows are transformed to the 2nd row; for the 3rd row of the first matrix, that is, when i=3, the R of the first matrix can be 2 +d line changes to line 3... when R i-1 >Md, the first matrix can be The row is transformed to the i-th row and will not be expanded one by one.

[0094] For example, when d=146 and M=2785, the inter-row transformation index formula can be:

[0095]

[0096] In this case, inter-row transformation is performed on the first matrix. To expand on this, for the first row of the first matrix, that is, when i=1, inter-row transformation may not be performed; for the second row of the first matrix, that is, when i=2, row 147 of the first matrix may be transformed to the second row; for the third row of the first matrix, that is, when i=3, row 293 of the first matrix may be transformed to the third row, and so on. These will not be expanded on one by one here.

[0097] For example, when d=69, M=697, the inter-row transformation index formula can be

[0098]

[0099] In this case, inter-row transformation is performed on the first matrix. To expand on this, for the 1st row of the first matrix, that is, when i=1, inter-row transformation may not be performed; for the 2nd row of the first matrix, that is, when i=2, 70 rows of the first matrix may be transformed to the 2nd row; for the 3rd row of the first matrix, that is, when i=3, 139 rows of the first matrix may be transformed to the 3rd row; ... for the 11th row of the first matrix, that is, when i=11, 691 rows of the first matrix may be transformed to the 11th row; for the 12th row of the first matrix, that is, when i=12, 2 rows of the first matrix may be transformed to the 12th row; for the 13th row of the first matrix, that is, when i=13, 71 rows of the first matrix may be transformed to the 13th row, and so on. They will not be expanded on one by one here.

[0100] It should be noted that the inter-row transformation index sequence formula in this embodiment can have many variations, such as changes in the transformation method, for example:

[0101] In R i-1 ≤Md, R i =R i-1 +d, or in R i-1 >d, it can be R i =R i-1 -d, or other variations.

[0102] In R i-1 >Md, Or in R i-1 When ≤d, it can be Or it may be other variations.

[0103] Another example is the change of judgment conditions, such as:

[0104] In R i-1 ≤M+d and the opposite case, R i Transform, or in R i-1 >d and the opposite case, R i Transformation or other changes may be made.

[0105] The above variations can be combined freely.

[0106] There are more variations, which will not be listed here one by one. In fact, those variations are just adaptive changes of the inter-row transformation index sequence formula provided by this embodiment in different communication scenarios, and the calculation ideas are essentially the same, and the technical effects achieved are also the same.

[0107] In one embodiment, the interval generation formula may be:

[0108]

[0109] Among them, M is the number of rows of the interleaver, N is the number of columns of the interleaver, and d is the interval for inter-row permutation.

[0110] Specifically, when performing inter-row transformation on the first matrix, the rows in the first matrix may be transformed at intervals generated by the above formula.

[0111] For example, when N=8 and M=2785, according to the above generation formula, the interval value is d=146.

[0112] In this case, the first matrix is ​​transformed between rows at a specific interval value of 146. For example, row 147 of the first matrix can be transformed to row 2, row 293 of the first matrix can be transformed to row 3, row 439 of the first matrix can be transformed to row 4, and so on.

[0113] For example, when N=8, M=697, according to the above generation formula, the interval value is d=69

[0114] In this case, the first matrix is ​​transformed between rows at a specific interval value of 69. For example, row 70 of the first matrix can be transformed to row 2, row 139 of the first matrix can be transformed to row 3, row 208 of the first matrix can be transformed to row 4, and so on.

[0115] It should be noted that the row spacing generation formula in this embodiment can have many variations, for example, it can also be:

[0116]

[0117] For example, it can also be:

[0118]

[0119] For example, it can also be:

[0120]

[0121] For example, it can also be:

[0122] (where z', R' are arbitrary values)

[0123] There are more variations, which will not be listed here one by one. In fact, those variations are just adaptive changes of the interval generation formula provided by this embodiment in different communication scenarios, the calculation ideas are essentially the same, and the technical effects achieved are also the same.

[0124] In one embodiment, the first matrix may be subjected to inter-row transformation at random intervals through an inter-row transformation index sequence.

[0125] Specifically, a random interval may be obtained according to a random sequence, a pseudo-random sequence, a random extended sequence, a pseudo-random extended sequence, or a random number, and an inter-row transformation index sequence may be generated, so that the first matrix performs inter-row transformation at random intervals.

[0126] It should be noted that, considering the anti-fading performance of the interleaved data sequence, constraints can be set in the process of determining the random interval so that the row spacing between different rows in the first matrix before the inter-row transformation is not less than the row spacing after the transformation.

[0127] For example, the constraints could be, random intervals

[0128] like, When M=2785, the obtained inter-row transformation index sequence can be:

[0129]

[0130] Wherein R 1 = 1, k = 1, whenever R i-1 + d i > 2785. k = k + 1, R i The value taken cannot be the same as R j , j < i. If they are the same, a random number needs to be reselected.

[0131] Then the randomly selected interval d for the second row 1 is 99, and for the third row d 2 is 101. Correspondingly, the 100th row in the first matrix is transformed to the second row, and the 201st row is transformed to the third row.

[0132] In one embodiment, the process of performing in-row transformation on the first matrix includes: performing in-row transformation on the first matrix to transform the basic unit of the first matrix.

[0133] Specifically, during the in-row transformation process, the basic unit in one or more rows (including all rows) in the first matrix can be subjected to in-row transformation, and the basic unit of the first matrix can also be subjected to specific or random in-row transformation.

[0134] It should be noted that the basic unit can be composed of one resource element or multiple resource elements. When performing in-row transformation, the in-row transformation is carried out with the basic unit composed of one resource element or multiple resource elements.

[0135] In one embodiment, the process of performing in-row transformation on the first matrix can include: performing in-row permutation on the first matrix, and / or performing in-row offset on the first matrix.

[0136] Correspondingly, the interleaving method provided by the present invention, as Figure 3 shown, can include:

[0137] Step S1, writing the first data sequence into the interleaver in sequence to obtain the first matrix;

[0138] Step S2, performing inter-row transformation, and / or in-row permutation and / or in-row offset on the first matrix to obtain the second matrix;

[0139] Step S3, reading out the second matrix in sequence to obtain the second data sequence.

[0140] Specifically, the process of performing in-row transformation on the first matrix can only include performing in-row permutation on the first matrix, can only include performing in-row offset on the first matrix, or can include performing in-row permutation and in-row offset on the first matrix.

[0141] The intra-row permutation refers to exchanging the basic units in the first matrix with each other within the row.

[0142] For example, the basic units in the same row of the first matrix may be interchanged. The basic unit of the first matrix may be composed of one resource element or multiple resource elements. When the basic unit is composed of one resource element, the intra-row permutation refers to the resource elements of the first matrix being interchanged with each other. When the basic unit is composed of multiple resource elements, the intra-row permutation refers to the multiple resource elements of the first matrix being interchanged with each other as a whole.

[0143] The intra-row offset includes a cyclic offset and a non-cyclic offset.

[0144] Furthermore, the cyclic shift operation can cause the positions of the basic units in one or more rows of the first matrix to change in a uniform cyclic manner. For example, it can include uniformly shifting all the basic units in a row of the first matrix in sequence or at specific intervals.

[0145] Furthermore, the operation of non-cyclic shifting can cause non-uniform cyclic changes in the basic units in one or more rows of the first matrix. For example, all the basic units in one or more rows of the first matrix are shifted in sequence, and the basic units that exceed the row after the shift are discarded, and the vacant basic units can be filled with other resource elements or zeros. For another example, non-all basic units in one or more rows of the first matrix are shifted in sequence or not in sequence, such as the first basic unit in a row is shifted to the position of the original fourth basic unit, the fourth basic unit is shifted to the position of the original third basic unit, the third basic unit is shifted to the position of the original second basic unit, and the second basic unit is shifted to the position of the original third basic unit.

[0146] In one embodiment, the process of performing intra-row transformation on the first matrix includes:

[0147] The basic units of the first matrix are permuted within the row by using the intra-row permutation index sequence.

[0148] Specifically, an intra-row permutation index sequence may be used to permute basic units in one or more rows (including all rows) of the first matrix, or an intra-row permutation index sequence may be used to permute basic units of the first matrix specifically or randomly.

[0149] It should be noted that the intra-row permutation index sequence is actually the total transformation formula for the intra-row permutation. In actual implementation, different communication manufacturers can use the intra-row permutation index sequence to perform intra-row permutations on the basic units of the first matrix. The intra-row permutation index sequence can be generated by only one method or by multiple methods, and the final generated results are collectively referred to as intra-row permutation index sequences. It should be further noted that when the intra-row permutation index sequence is generated by multiple methods, different communication manufacturers can use intra-row permutation index sequences generated by different methods to perform intra-row permutations on the basic units in the first matrix, or they can use intra-row permutation index sequences generated by the same method to perform intra-row permutations on the basic units in the first matrix.

[0150] In one embodiment, the process of generating the intra-row permutation index sequence includes: generating the intra-row permutation index sequence according to the odd-even item permutation principle.

[0151] Specifically, in the process of performing intra-row permutation, the intra-row permutation index sequence generated according to the parity item permutation principle can be used to perform intra-row permutation on the basic units of the first matrix, thereby achieving intra-row permutation of the basic units in the parity items. It should be noted that the basic unit can be composed of one or more resource elements, and accordingly, when performing intra-row permutation of the parity items, the basic unit composed of one or more resource elements is also permuted as a whole.

[0152] When performing intra-row transformation, the basic units located in odd-numbered columns in each row may be replaced with the basic units located in even-numbered columns.

[0153] When performing intra-row transformation, odd and even rows can be distinguished, and the basic units in the odd columns of the even rows can be replaced with those in the even columns, while the odd rows are not replaced; or the basic units in the odd columns of the odd rows can be replaced with those in the even columns, while the even rows are not replaced. The formula for this transformation method can be:

[0154]

[0155] Where i is the row index of the first matrix after the inter-row transformation, R i is the row index of the first matrix before inter-row transformation.

[0156] For example, the first row of the first matrix is ​​a1b1c1d1e1f1g1h1, and the second row is a2b2c2d2e2f2g2h2. The basic unit consists of 1 resource element. In this case, after intra-row permutation:

[0157] The first line is a1b1c1d1e1f1g1h1, and the second line is b2a2d2c2f2e2h2g2.

[0158] When performing intra-row transformation, other ways of intra-row transformation of odd and even items may also be performed, which are not listed here.

[0159] In one embodiment, the process of generating the intra-row permutation index sequence includes: generating the intra-row permutation index sequence according to a divisor of the number of columns of the first matrix.

[0160] Specifically, in the process of performing intra-row permutation, an intra-row permutation index sequence generated according to a divisor of the number of columns of the first matrix may be used to perform intra-row permutation on the basic units of the first matrix, thereby achieving intra-row permutation of the basic units in the first matrix. It should be noted that the basic unit may be composed of one or more resource elements, and accordingly, when performing intra-row permutation using a divisor of the number of columns of the first matrix, the basic unit composed of one or more resource elements is also permuted as a whole.

[0161] When performing intra-row transformation, a divisor of the number of columns of the first matrix may be arbitrarily selected, and basic units of the divisor values ​​within the row may be permuted as a group.

[0162] For example, the first row of the first matrix is ​​a1b1c1f1e1f1g1h1, and the basic unit consists of 4 resource elements. In this case, the divisors of the selected column number 8 are 2 and 4, and the basic units are permuted according to the divisor 4, and the permutation result is:

[0163] The first row after permutation is e1f1g1h1a1b1c1d1.

[0164] For example, the second row of the first matrix is ​​a2b2c2d2e2f2g2h2, and the basic unit consists of 4 resource elements. In this case, the divisors of the selected column number 8 are 2 and 4, and the basic units are permuted according to the divisor 2, and the permutation result is:

[0165] After permutation, the second row becomes b2a2d2c2f2e2h2g2.

[0166] When performing intra-line transformation, other approximation methods of intra-line transformation may also be performed, which are not listed here.

[0167] It should be noted that the process of generating the intra-row permutation index sequence also includes: generating the intra-row permutation index sequence according to the product of the number of columns or rows of the first matrix, the remainder, etc. The specific operation is similar to the above embodiment and will not be described here one by one.

[0168] In one embodiment, the process of generating the intra-row permutation index sequence includes: generating the intra-row permutation index sequence according to a random sequence or a pseudo-random sequence.

[0169] Specifically, in the process of performing intra-row permutation, an intra-row permutation index sequence generated according to a random sequence or a pseudo-random sequence can be used to perform intra-row permutation on the basic units of the first matrix, thereby achieving intra-row permutation of the basic units in the first matrix. It should be noted that the basic unit can be composed of one or more resource elements, and accordingly, when performing intra-row permutation with a divisor of the number of columns of the first matrix, the basic unit composed of one or more resource elements is also permuted as a whole.

[0170] When performing intra-row transformation, the generated random sequence or pseudo-random sequence may be converted into a numerical value, and the basic unit corresponding to the numerical value may be replaced.

[0171] In one embodiment, the process of performing intra-row transformation of the first matrix includes:

[0172] The first matrix is ​​cyclically shifted, and the basic unit of the first matrix is ​​cyclically shifted.

[0173] Specifically, the basic units of one or more rows (including all rows) of the first matrix may be cyclically shifted according to a specific or random shift amount.

[0174] It should be noted that the basic units of the first matrix may also be non-circularly offset according to a specific or random offset. The specific concept of non-circular offset has been specifically described in the above embodiment and will not be repeated here.

[0175] In one embodiment, the offset of the circular offset is generated by: calculating and generating according to the row index of the row where the basic unit to be offset is located.

[0176] Specifically, the offset of the circular shift may be generated according to the row index of the row where the basic unit to be shifted is located, and then the basic units in the first matrix may be circularly shifted according to the offset.

[0177] There are many ways to calculate the offset based on the row index. Where i is the row index and N is the number of columns of the interleaver, or other formulas.

[0178] In one embodiment, the offset of the cyclic offset is generated in a manner including: based on a random sequence, and / or based on an extension of a random sequence, and / or based on a pseudo-random sequence, and / or based on an extension of a pseudo-random sequence.

[0179] Specifically, the offset of the cyclic shift can be generated according to a random sequence, and / or an extension based on a random sequence, and / or a pseudo-random sequence, and / or an extension based on a pseudo-random sequence, and then the basic units in the first matrix are cyclically shifted according to the offset.

[0180] There are many calculation methods in the process of generating offsets based on random sequences.

[0181] For example, for an 8-bit pseudo-random binary PN sequence (c 8*i-7 ,c 8*i-6 ,…,c 8*i ), converted to decimal C i After that, for C i Modulo 8 is performed to obtain the offset S (R i )=mod(C i ,8).

[0182] For example, an 8-bit pseudo-random binary PN sequence:

[0183]

[0184] Converted to decimal: (173,109,82,30,87,21,129,159)

[0185] After taking the modulo 8, it is: (5,5,2,6,7,5,1,7), that is, the offset of the first row of the matrix is ​​5, the offset of the second row is 5, the offset of the third row is 2, the offset of the fourth row is 6, the offset of the fifth row is 7, the offset of the sixth row is 5, the offset of the seventh row is 1, and the offset of the eighth row is 7.

[0186] Correspondingly, if the first matrix is ​​originally:

[0187]

[0188] Then, after cyclic shifting according to the offset calculated in the above manner, the first matrix becomes:

[0189]

[0190] In one embodiment, the generation method of the offset of the cyclic offset further includes:

[0191] is calculated based on the row index of the row where the basic unit to be offset is located, and

[0192] Generated according to a random sequence, and / or an extension based on a random sequence, and / or a pseudo-random sequence, and / or an extension based on a pseudo-random sequence.

[0193] The generation formula of the offset of the cyclic offset includes:

[0194] or

[0195]

[0196] Among them, S(Ri ) or S(i) is the offset, i is the row index of the first matrix after transformation, R i is the row index of the first matrix before transformation, and N is the number of columns of the interleaver.

[0197] Specifically, the offset of the cyclic shift may be generated according to the row index of the first matrix before or after the inter-row transformation, and then the basic unit of the row corresponding to the row index may be cyclically shifted according to the offset.

[0198] For example, if the inter-row transformation has been performed, the first matrix is ​​originally:

[0199]

[0200] Then S(R 1 )=0,S(R 2 )=0,S(R 3 )=1,S(R 4 )=7,S(R 5 )=2,S(R 6 )=6,S(R 7 )=3,S(R 8 )=5.

[0201] Then, after cyclic shifting according to the offset calculated in the above manner, the first matrix becomes:

[0202]

[0203] In one embodiment, the process of reading out the second data sequence includes: reading out the second data sequence in row order.

[0204] In one embodiment, the process of reading out the second data sequence includes: reading out the second data sequence in column order.

[0205] In one embodiment, in the interleaver:

[0206] The number of columns N of the interleaver can be calculated by the transmission block size TBS and the actual code length or the maximum code length.

[0207] Specifically, the number of columns N of the interleaver can be obtained by calculating the transmission block size TBS and the actual code length or the maximum code length. The calculation can be performed in various ways, such as dividing the transmission block size TBS by the actual code length or the maximum code length and then rounding, or other calculation methods.

[0208] For example, in a communication system, when the number of effective subcarriers used for data transmission in an OFDM symbol is When the corresponding transmission block size TBS is 45352, the maximum code length is 6144-24, and the number of columns of the interleaver is:

[0209]

[0210] In one embodiment, in the interleaver:

[0211] The number of columns N of the interleaver can be a pre-specified value.

[0212] Specifically, the number of columns N of the interleaver can be a manually specified value, for example, N=8 is manually set, that is, the number of columns of the interleaver is 8, and for another example, N=16 is manually set, that is, the number of columns of the interleaver is 16.

[0213] In one embodiment, in the interleaver:

[0214] The product of the number of rows M and the number of columns N of the interleaver is not less than the number of basic units in the first data sequence.

[0215] For example, when the number of interleaver rows M = 8 and the basic unit size is 1 resource block,

[0216] The number of interleaver rows is:

[0217]

[0218] In one embodiment, in the interleaver:

[0219] The number of interleaver rows M can be a pre-specified value.

[0220] Specifically, the number of rows M of the interleaver can be a manually specified value, for example, M=2785 is manually set, that is, the number of rows M of the interleaver is 2785, and another example is M=697 is manually set, that is, the number of columns of the interleaver is 697.

[0221] It should be noted that the above-mentioned method of calculating the number of columns N of the interleaver and the method of calculating the number of rows M of the interleaver can be freely combined.

[0222] In one embodiment, in the interleaver:

[0223] The product of the number of rows M and the number of columns N of the interleaver is not less than the number of basic units in the first data sequence;

[0224] The number of basic units is the number of effective subcarriers used for data transmission in an OFDM symbol divided by the number of resource elements contained in each basic unit.

[0225] Specifically, the number of interleaver columns N can be calculated by the transmission block size TBS and the actual code length or the maximum code length, and the number of interleaver rows M and the number of interleaver columns N can satisfy the following formula:

[0226]

[0227] Among them, represents the number of valid subcarriers for data transmission within an OFDM symbol, and k represents the number of resource elements included in the basic unit in the data sequence.

[0228] For example, in a communication system, when the number of valid subcarriers for data transmission within an OFDM symbol is 22275 and the corresponding transport block size TBS is 45352, the maximum code length is 6144 - 24.

[0229] If the basic unit size of the data sequence is 1 resource block:

[0230] Then the number of columns of the interleaver is:

[0231]

[0232] The number of rows of the interleaver is:

[0233]

[0234] If the basic unit size of the data sequence is 4 resource blocks:

[0235] Then the number of columns of the interleaver is:

[0236]

[0237] The number of rows of the interleaver is:

[0238]

[0239] In one embodiment, the interleaving method further includes:

[0240] After writing the data sequence into the interleaver, if there are still empty positions in the interleaver, redundant numbers are filled in; and

[0241] After reading out the interleaved data sequence, the redundancy is deleted.

[0242] In one embodiment, a de - interleaving method for block interleaving is provided, as Figure 4 shown, including the following steps:

[0243] Step N1, writing the second data sequence after channel transmission into the de - interleaver in sequence to obtain a third matrix;

[0244] Step N2, performing an inverse transformation process on the third matrix to obtain a fourth matrix;

[0245] Step N3, read out the fourth matrix in sequence to obtain a first data sequence.

[0246] Specifically, in step N1, the second data sequence after channel transmission can be written into the deinterleaver in row order, the second data sequence can be written into the deinterleaver in column order, and the second data sequence can be written into the deinterleaver in a non-fixed order. In step N2, the inverse transformation processing may include performing inter-row inverse transformation and / or intra-row inverse transformation, that is, the third matrix can be subjected to inter-row inverse transformation and / or intra-row inverse transformation. In step N3, the fourth matrix can be read out in row order, in column order, or in a non-fixed order. Inter-row inverse transformation is the corresponding operation of inter-row transformation, and intra-row inverse transformation is the corresponding operation of intra-row transformation. Among them, intra-row inverse transformation includes intra-row inverse permutation and / or intra-row inverse offset, and intra-row inverse offset includes intra-row inverse cyclic offset and / or intra-row inverse non-cyclic offset. Accordingly, intra-row inverse permutation is the corresponding operation of intra-row permutation, and intra-row inverse offset is the corresponding operation of intra-row offset. The operations of inter-row transformation, intra-row transformation, intra-row permutation, and intra-row offset have been described in detail in the above embodiments, and will not be repeated here.

[0247] like Figure 5 As shown, including:

[0248] The reading and writing unit 100 writes the first data sequence into the interleaving block in order to generate a first matrix;

[0249] The processing unit 200 transforms the first matrix written by the reading and writing unit 100 to generate a second matrix;

[0250] The reading and writing unit 100 reads out the second matrix to obtain the interleaved second data sequence.

[0251] Specifically, the read-write unit 100 can write the first data sequence into the interleaver in row order, can write the first data sequence into the interleaver in column order, and can also write the first data sequence into the interleaver in a non-fixed order. The processing unit 200, the transformation processing may include performing inter-row transformation and / or inverse row transformation, that is, the second matrix may be subjected to inter-row transformation and / or intra-row transformation. Among them, the inter-row transformation includes inter-row permutation, and the intra-row transformation includes intra-row permutation and / or intra-row offset. The operations of inter-row transformation, inter-row permutation, intra-row transformation, intra-row permutation, and intra-row offset have been described in detail in the above embodiments, and will not be repeated here.

[0252] In one embodiment, a block interleaving deinterleaver is provided, which interleaves symbols within an OFDM symbol, such as Figure 6 As shown, including:

[0253] The reading and writing unit 300 writes the second data sequence after the channel transmission into the deinterleaver in order to generate a third matrix;

[0254] The processing unit 400 performs an inverse transformation process on the third matrix written by the reading and writing unit 300 to generate a fourth matrix;

[0255] The reading and writing unit 300 reads out the fourth matrix to obtain the deinterleaved first data sequence.

[0256] Specifically, the reading and writing unit 300 can write the second data sequence after channel transmission into the deinterleaver in row order, can write the second data sequence into the deinterleaver in column order, and can also write the second data sequence into the deinterleaver in a non-fixed order. The processing unit 400, the inverse transformation processing may include performing inter-row inverse transformation and / or intra-row inverse transformation, that is, the third matrix can be subjected to inter-row inverse transformation and / or intra-row inverse transformation. Inter-row inverse transformation is the corresponding operation of inter-row transformation, and intra-row inverse transformation is the corresponding operation of intra-row transformation. Among them, intra-row inverse transformation includes intra-row inverse permutation and / or intra-row inverse offset, and intra-row inverse offset includes intra-row inverse cyclic offset and / or intra-row inverse non-cyclic offset. Accordingly, intra-row inverse permutation is the corresponding operation of intra-row permutation, and intra-row inverse offset is the corresponding operation of intra-row offset. The operations of inter-row transformation, intra-row transformation, intra-row permutation, and intra-row offset have been described in detail in the above embodiments, and will not be repeated here.

[0257] Based on the interleaving method, deinterleaving method, interleaver, and deinterleaver provided above, the following specific embodiments are provided:

[0258] Embodiment 1:

[0259] This embodiment provides a transformation-based block interleaving method with a larger minimum interleaving depth, which can resist deep fading in the frequency domain during signal transmission, thereby improving system performance and system stability.

[0260] In this embodiment, the transformation adopted is inter-row transformation, and the inter-row transformation is to perform inter-row transformation according to the inter-row transformation index sequence calculated according to the first matrix obtained after writing into the interleaver, and the basic unit size of the data sequence is 1 resource block.

[0261] The specific technical solution of this embodiment is:

[0262] For the pilot scheme d t =4,d f =3, the subcarrier spacing is The frame structure. The bandwidth is 10M, and 10% protection bandwidth is required, so the effective bandwidth is 9M. The corresponding RB (resource block) occupies 180KHz, so there is resource blocks.

[0263] For the above resource blocks, the number of subcarriers is The cost of RB is Therefore, the effective number of carriers is The corresponding TBS=45352.

[0264] For the above scenario, a block interleaving method based on inter-row transformation is adopted:

[0265] Step S1: Input data sequence (x 1 ,x 2 ,…,x 22275 ) Write by column List OK The interleaver obtains a two-dimensional matrix of M×N where x j =x dummy ,22276≤j≤22280 represents the redundant number;

[0266] Step S2: According to the inter-row transformation index sequence [R 1 ,R 2 ,…,R 2785 ], perform row permutation on the two-dimensional matrix X, and replace the R i Permute the rows to the i-th row to get the permuted two-dimensional matrix The interval between line changes is Therefore, the formula for generating the inter-row transformation index sequence is:

[0267]

[0268] Step S3: Read out the data matrix after the inter-row transformation in row order to obtain a read data sequence. In this example, the first 8×8 elements of the sequence are:

[0269]

[0270] Remove the redundant bits in the sequence, x dummy , and get the interleaved sequence (y 1 ,y 2 ,…,y 22275 ).

[0271] Compared with the existing situation, the transformed block interleaving method provided in this embodiment has the following advantages:

[0272] like Figure 7 As shown, for the same communication system, the block interleaving method provided by the present invention performs intra-row conversion and inter-row conversion on the data sequence input to the interleaver, which can improve the gain, BER=10 compared with the method without interleaving and conversion.-6 When the corresponding SNR without interleaving is 11.95dB, the SNR without transformation is 10.6dB, and the SNR obtained by the present invention based on inter-row transformation is 9.7dB, which is 2.25dB higher than that without interleaving, and 0.9dB higher than that without transformation. It can be seen that a larger minimum interleaving depth can resist deep fading in the frequency domain during signal transmission, thereby improving system performance and system stability.

[0273] Embodiment 2:

[0274] This embodiment provides a transformation-based block interleaving method with a larger minimum interleaving depth, which can resist deep fading in the frequency domain and periodic fading in the frequency domain during signal transmission, thereby improving system performance and system stability.

[0275] In this embodiment, the transformation used is an intra-row transformation, and the intra-row transformation is to calculate the offset of the cyclic shift according to the row index of the row where the basic unit to be shifted is located to perform intra-row shift, and the basic unit size of the data sequence is 1 resource block.

[0276] The specific technical solution of this embodiment is:

[0277] For the pilot scheme d t =4,d f =3, the subcarrier spacing is The frame structure. The bandwidth is 10M, and 10% protection bandwidth is required, so the effective bandwidth is 9M. The corresponding RB (resource block) occupies 180KHz, so there is resource blocks.

[0278] For the above resource blocks, the number of subcarriers is The cost of RB is Therefore, the effective number of carriers is The corresponding TBS=45352.

[0279] For the above scenario, a block interleaving method based on intra-row transformation is adopted:

[0280] Step S1: Input data sequence (x 1 ,x 2 ,…,x 22275 ) Write by column List OK The interleaver obtains a two-dimensional matrix of M×N where x j =x dummy,22276≤j≤22280 represents the redundant number;

[0281] Step S2: Define a two-dimensional matrix

[0282] For a two-dimensional matrix X p Each row of is shifted cyclically by an offset of S(i), and the offset is Get a shifted two-dimensional matrix X q ;

[0283] Step S3: Read out the offset data matrix in row order to obtain a read data sequence. In this example, the first 8×8 elements of the sequence are:

[0284]

[0285] Remove the redundant bits in the sequence, x dummy , and get the interleaved sequence (y 1 ,y 2 ,…,y 22275 ).

[0286] Compared with the existing situation, the transformed block interleaving method provided in this embodiment has the following advantages:

[0287] like Figure 8 As shown, for the same communication system, the block interleaving method provided by the present invention performs intra-row conversion and inter-row conversion on the data sequence input to the interleaver, which can improve the gain, BER=10 compared with the method without interleaving and conversion. -6 When the corresponding SNR without interleaving is 11.95dB, the SNR without transformation is 10.6dB, and the SNR obtained by the intra-row transformation of the present invention is 10.0dB, which is 1.95dB higher than that without interleaving, and 0.6dB higher than that without transformation. It can be seen that the intra-row transformation can resist periodic fading in the frequency domain during signal transmission, and improve the stability of the system while improving the system performance.

[0288] Embodiment 3:

[0289] This embodiment provides a transformation-based block interleaving method with a larger minimum interleaving depth, which can resist deep fading in the frequency domain and periodic fading in the frequency domain during signal transmission, thereby improving system performance and system stability.

[0290] In this embodiment, the transformations adopted include inter-row transformation and intra-row transformation. The inter-row transformation is performed according to the inter-row transformation index sequence calculated from the first matrix obtained after being written into the interleaver, and the intra-row transformation is performed by calculating the offset of the cyclic offset according to the row index of the row where the basic unit to be offset is located for intra-row offset. The basic unit size of the data sequence is 1 resource block.

[0291] The specific technical solution of this embodiment is as follows:

[0292] For the pilot scheme d t = 4, d f = 3, and the subcarrier spacing is The frame structure. The bandwidth is 10M, and 10% protection bandwidth needs to be given, so the effective bandwidth is 9M. The resources occupied by the corresponding RB (resource block) are 180KHz, so there are resource blocks.

[0293] For the above resource blocks, the number of subcarriers is The overhead of RB is So the number of effective carriers is The corresponding TBS = 45352.

[0294] For the above scenario, a block interleaving method based on inter-row transformation and intra-row transformation is adopted:

[0295] Step S1: Write the input data sequence (x 1 , x 2 , …, x 22275 ) column by column into column row interleaver to obtain a two-dimensional matrix M×N where x j = x dummy , 22276 ≤ j ≤ 22280 represents the redundant number;

[0296] Step S2: According to the inter-row transformation index sequence [R 1 , R 2 , …, R 2785 , perform inter-row permutation on the two-dimensional matrix X, and permute the R i row to the i-th row to obtain the permuted two-dimensional matrix The inter-row transformation interval is Therefore, the formula for generating the inter-row transformation index sequence is:

[0297]

[0298] Step S3: For the permuted two-dimensional matrix X p Each row is offset by S(R i ) is the cycle offset of Get a shifted two-dimensional matrix X q ;

[0299] Step S4: Read out the offset data matrix in row order to obtain a read data sequence. In this example, the first 16×8 elements of the sequence are:

[0300]

[0301] Remove the redundant bits in the sequence, x dummy , and get the interleaved sequence (y 1 ,y 2 ,…,y 22275 ).

[0302] Compared with the existing situation, the transformed block interleaving method provided in this embodiment has the following advantages:

[0303] It has a larger minimum interleaving depth and can effectively resist deep fading and periodic fading in the frequency domain, thereby improving the fault tolerance performance of the system.

[0304] Here, you can Fig. 9 As shown, for the same communication system, the block interleaving method provided by the present invention performs intra-row conversion and inter-row conversion on the data sequence input to the interleaver, which can improve the gain, BER=10 compared with the method without interleaving and conversion. -6 When the corresponding SNR without interleaving is 11.95dB, the SNR without transformation is 10.6dB, and the SNR obtained by the present invention is 9.2dB, which is 2.75dB higher than that without interleaving and 1.4dB higher than that without transformation. It can be seen that a larger minimum interleaving depth can resist deep fading in the frequency domain and periodic fading in the frequency domain during signal transmission, thereby improving system performance and system stability.

[0305] Embodiment 4:

[0306] This embodiment provides a transformation-based block interleaving method with a larger minimum interleaving depth, which can resist deep fading in the frequency domain and periodic fading in the frequency domain during signal transmission, thereby improving system performance and system stability.

[0307] In this embodiment, the transformations adopted include inter-row transformation and intra-row transformation. The inter-row transformation is performed according to the inter-row transformation index sequence calculated from the first matrix obtained after writing into the interleaver. The intra-row transformation generates a cyclic offset amount according to the row index of the row where the basic unit to be offset is located for intra-row offset. The basic unit size of the data sequence is 4 resource blocks.

[0308] The specific technical solution of this embodiment is as follows:

[0309] For the pilot scheme d t = 4, d f = 3, and the subcarrier spacing is For the frame structure with a bandwidth of 10M, 10% protection bandwidth needs to be given, so the effective bandwidth is 9M. The resources occupied by the corresponding resource block (RB) are 180KHz, so there are resource blocks.

[0310] For the above resource blocks, the number of subcarriers is The overhead of RB is So the effective number of carriers is The corresponding TBS = 45352.

[0311] For the above scenario, a block interleaving method based on inter-row transformation and intra-row transformation is adopted:

[0312] Step S1: Write the input data sequence (x 1 , x 2 , …, x 22275 ) into the interleaver with columns rows to obtain a two-dimensional matrix M×N where x p = x dummy , 22276 ≤ p ≤ 22304 represents the redundancy number;

[0313] Step S2: According to the inter-row transformation index sequence [R 1 , R 2 , …, R 697 , perform an inter-row permutation on the two-dimensional matrix U, and permute the R i th row to the i-th row to obtain the permuted two-dimensional matrix The inter-row transformation interval is Therefore, the formula for generating the inter-row transformation index sequence is

[0314]

[0315] Step S3: For the permuted two-dimensional matrix U p Each row is offset by S(R i ) is the cycle offset of Get a shifted two-dimensional matrix U q ;

[0316] Step S4: Read out the offset data matrix in row order to obtain a read data sequence. In this example, the first 16×8 elements of the sequence are:

[0317]

[0318] Remove the redundant bits in the sequence, x dummy , and get the interleaved sequence (y 1 ,y 2 ,…,y 22275 ).

[0319] Compared with the existing situation, the permuted block interleaving method provided in this embodiment has the following advantages:

[0320] It has a larger minimum interleaving depth and can effectively resist deep fading and periodic fading in the frequency domain, thereby improving the fault tolerance performance of the system.

[0321] Embodiment 5:

[0322] This embodiment provides a transformation-based block interleaving method with a larger minimum interleaving depth, which can resist deep fading in the frequency domain and periodic fading in the frequency domain during signal transmission, thereby improving system performance and system stability.

[0323] In this embodiment, the transformations used include inter-row transformation and intra-row transformation. The inter-row transformation is to perform inter-row transformation according to the inter-row transformation index sequence calculated according to the first matrix obtained after writing into the interleaver. The intra-row transformation is to perform intra-row offset according to the offset generated by the pseudo-random sequence. The basic unit size of the data sequence is 1 resource block.

[0324] The specific technical solution of this embodiment is:

[0325] For the pilot scheme d t =4,d f =3, the subcarrier spacing is The frame structure. The bandwidth is 10M, and 10% protection bandwidth is required, so the effective bandwidth is 9M. The corresponding resource block (RB) occupies 180KHz, so there is resource blocks.

[0326] For the above resource blocks, the number of subcarriers is The cost of RB is Therefore, the effective number of carriers is The corresponding TBS=45352.

[0327] For the above scenario, a block interleaving method based on inter-row transformation and intra-row transformation is adopted.

[0328] Step S1: Input data sequence (x 1 ,x 2 ,…,x 22275 ) Write by column List The interleaver of the rows obtains a two-dimensional matrix of M×N where x j =x dummy ,22276≤j≤22280 represents the redundant number;

[0329] Step S2: According to the inter-row transformation index sequence [R 1 ,R 2 ,…,R 2785 ], perform row permutation on the two-dimensional matrix X, and replace the R i

[0330] Permute the rows to the i-th row to get the permuted two-dimensional matrix The interval between line changes is Therefore, the formula for generating the inter-row transformation index sequence is:

[0331]

[0332] Step S3: For the permuted two-dimensional matrix X p Each row is offset by S(R i ) is cyclically offset, the offset being calculated by calculating an 8-bit pseudo-random binary PN sequence (c 8*i-7 ,c 8*i-6 ,…,c 8*i ) converted to decimal value C i ,S(R i )=mod(C i ,8), get a shifted two-dimensional matrix X q ;

[0333] In this example, the 8-bit pseudo-random binary PN sequence is assumed to be:

[0334] (1,0,1,0,1,1,0,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,0,0,0,1,1,1,1,0,0,1,0,1,0,1,0,1,1,1,0,0,0,1,0,1,0,1,1,0,0,0,0,0,0,1,1,0,0,1,1,1,1), the corresponding offset is (5, 5, 2, 6, 7, 5, 1, 7),

[0335] Step S4: Read out the offset data matrix in row order to obtain a read data sequence, the first 8×8 elements of which are:

[0336]

[0337] Remove the redundant bits in the sequence, x dummy , and get the interleaved sequence (y 1 ,y 2 ,…,y 22275 ).

[0338] Compared with the existing situation, the permuted block interleaving method provided in this embodiment has the following advantages:

[0339] It has a larger minimum interleaving depth and can effectively resist deep fading and periodic fading in the frequency domain, thereby improving the fault tolerance performance of the system.

[0340] Embodiment 6:

[0341] This embodiment provides a transformation-based block interleaving method with a larger minimum interleaving depth, which can resist deep fading in the frequency domain and periodic fading in the frequency domain during signal transmission, thereby improving system performance and system stability.

[0342] In this embodiment, the transformations used include inter-row transformation and intra-row transformation. The inter-row transformation is to perform inter-row transformation on an inter-row transformation index sequence calculated according to the first matrix obtained after writing into the interleaver. The intra-row transformation is to perform intra-row transformation on an intra-row transformation index sequence generated according to the parity permutation principle. The basic unit size of the data sequence is 1 resource block.

[0343] The specific technical solution of this embodiment is:

[0344] For the pilot scheme d t =4,d f =3, the subcarrier spacing is The frame structure. The bandwidth is 10M, and 10% protection bandwidth is required, so the effective bandwidth is 9M. The corresponding resource block (RB) occupies 180KHz, so there is resource blocks.

[0345] For the above resource blocks, the number of subcarriers is The cost of RB is Therefore, the effective number of carriers is The corresponding TBS=45352.

[0346] For the above scenario, a block interleaving method based on inter-row transformation and intra-row transformation is adopted.

[0347] Step S1: Input data sequence (x 1 ,x 2 ,…,x 22275 ) Write by column List The interleaver of the rows obtains a two-dimensional matrix of M×N where x j =x dummy ,22276≤j≤22280 represents the redundant number;

[0349] Step S2: According to the inter-row transformation index sequence [R 1 ,R 2 ,…,R 2785 ], perform row permutation on the two-dimensional matrix X, and replace the R i Permute the rows to the i-th row to get the permuted two-dimensional matrix The interval between line changes is Therefore, the formula for generating the inter-row transformation index sequence is:

[0350]

[0351] Step S3: For the permuted two-dimensional matrix X p Each row of the matrix is ​​permuted to obtain a permuted two-dimensional matrix X. q ;

[0352] Step S4: Read out the permuted data matrix in row order to obtain a read data sequence. In this example, the first 8×8 elements of the sequence are:

[0353]

[0354] Remove the redundant bits in the sequence, x dummy , and get the interleaved sequence (y 1 ,y 2 ,…,y 22275 ).

[0355] Compared with the existing situation, the permuted block interleaving method provided in this embodiment has the following advantages:

[0356] It has a larger minimum interleaving depth and can effectively resist deep fading and periodic fading in the frequency domain, thereby improving the fault tolerance performance of the system.

[0357] Embodiment 7:

[0358] This embodiment provides a transformation-based block interleaving method with a larger minimum interleaving depth, which can resist deep fading in the frequency domain and periodic fading in the frequency domain during signal transmission, thereby improving system performance and system stability.

[0359] In this embodiment, the transformations used include inter-row transformation and intra-row transformation. The inter-row transformation is to perform inter-row transformation according to an inter-row transformation index sequence generated according to a random sequence or a pseudo-random sequence. The intra-row transformation is to perform intra-row shift according to the row index of the row where the basic unit to be shifted is located, and the basic unit size of the data sequence is 1 resource block.

[0360] The specific technical solution of this embodiment is:

[0361] For the pilot scheme d t =4,d f =3, the subcarrier spacing is The frame structure. The bandwidth is 10M, and 10% protection bandwidth is required, so the effective bandwidth is 9M. The corresponding resource block (RB) occupies 180KHz, so there is resource blocks.

[0362] For the above resource blocks, the number of subcarriers is The cost of RB is Therefore, the effective number of carriers is The corresponding TBS=45352.

[0363] For the above scenario, a block interleaving method based on inter-row transformation and intra-row transformation is adopted.

[0364] Step S1: Input data sequence (x 1 ,x 2 ,…,x 22275 ) Write by column List The interleaver of the rows obtains a two-dimensional matrix of M×N where x j =x dummy ,22276≤j≤22280 represents the redundant number;

[0366] Step S2: According to the inter-row transformation index sequence [R 1 ,R 2 ,…,R2785 , perform row - by - row permutation on the two - dimensional matrix X, and move the R i th row to the ith row to obtain the permuted two - dimensional matrix The row - by - row transformation interval is a random number d greater than i . Therefore, the formula for generating the row - by - row transformation index sequence is

[0368]

[0369] where k = 1, and whenever R i-1 +d i > 2785, k = k + 1. The value of R i cannot be the same as R j , j < i. If they are the same, a new random number needs to be selected

[0370] In this example, the first 16 random numbers d of the generated row - by - row permutation sequence i are 99, 101, 183, 117, 135, 165, 171, 102, 209, 191, 203, 293, 108, 161, 172

[0371] Step S3: Perform a cyclic shift with an offset of S(R p ) on each row of the permuted two - dimensional matrix X. The offset is i to obtain an offset two - dimensional matrix X q ;

[0372] Step S4: Read out the offset data matrix in row - by - row order to obtain the read - out data sequence. The first 16×8 elements of the data sequence are:

[0373]

[0374] Remove the redundant bits in this sequence, x dummy , to obtain the interleaved sequence (y 1 , y 2 , …, y 22275 ).

[0375] The interleaving method of permutation - based block interleaving provided in this embodiment has the following advantages compared with the existing situation:

[0376] It has a relatively large minimum interleaving depth and can effectively resist deep fading and periodic fading in the frequency domain, thereby improving the fault - tolerance performance of the system

[0377] Example 8:

[0378] ​​This embodiment provides a transformation-based block interleaving method with a larger minimum interleaving depth, which can resist deep fading in the frequency domain and periodic fading in the frequency domain during signal transmission, thereby improving system performance and system stability.

[0379] In this embodiment, the transformations used include inter-row transformation and intra-row transformation. The inter-row transformation is to perform inter-row transformation based on an inter-row transformation index sequence calculated according to the first matrix obtained after writing into the interleaver. The intra-row transformation is to perform intra-row permutation based on an intra-row permutation index sequence generated according to a divisor of the number of columns of the first matrix. The basic unit size of the data sequence is 1 resource block.

[0380] The specific technical solution of this embodiment is:

[0381] For the pilot scheme d t =4,d f =3, the subcarrier spacing is The frame structure. The bandwidth is 10M, and 10% protection bandwidth is required, so the effective bandwidth is 9M. The corresponding resource block (RB) occupies 180KHz, so there is resource blocks.

[0382] For the above resource blocks, the number of subcarriers is The cost of RB is Therefore, the effective number of carriers is The corresponding TBS=45352.

[0383] For the above scenario, a block interleaving method based on inter-row transformation and intra-row transformation is adopted.

[0384] Step S1: Input data sequence (x 1 ,x 2 ,…,x 22275 ) Write by column List The interleaver of the rows obtains a two-dimensional matrix of M×N where x j =x dummy ,22276≤j≤22280 represents the redundant number;

[0385] Step S2: According to the inter-row transformation index sequence [R 1 ,R 2 ,…,R 2785 ], perform row permutation on the two-dimensional matrix X, and replace the R i

[0386] Permute the rows to the i-th row to get the permuted two-dimensional matrix The interval between line changes is Therefore, the formula for generating the inter-row transformation index sequence is:

[0387]

[0388] Step S3: The number of interleaver columns N is 8, and the divisors are 2 and 4. When the divisor 2 is selected, it is an odd-even transformation. You can refer to Example 4. Here, the divisor 4 is selected for intra-row permutation. Intra-group permutation is performed in a row with 4 basic units as 1 group. That is, the two-dimensional matrix X after inter-row transformation p Each row of is permuted in groups of 4 as the basic unit to obtain a permuted two-dimensional matrix X q ;

[0389] Step S4: Read out the permuted data matrix in row order to obtain a read data sequence. In this example, the first 8×8 elements of the sequence are:

[0390]

[0391] Remove the redundant bits in the sequence, x dummy , and get the interleaved sequence (y 1 ,y 2 ,…,y 22275 ).

[0392] Compared with the existing situation, the permuted block interleaving method provided in this embodiment has the following advantages:

[0393] It has a larger minimum interleaving depth and can effectively resist deep fading and periodic fading in the frequency domain, thereby improving the fault tolerance performance of the system.

[0394] Embodiment 9:

[0395] This embodiment provides a transformation-based block interleaving method with a larger minimum interleaving depth, which can resist deep fading in the frequency domain and periodic fading in the frequency domain during signal transmission, thereby improving system performance and system stability.

[0396] In this embodiment, the transformations used include inter-row transformation and intra-row transformation. The inter-row transformation is to perform inter-row transformation based on the inter-row transformation index sequence calculated according to the first matrix obtained after writing into the interleaver. The intra-row transformation is to perform group permutation and cyclic shift within the group based on the divisor of the number of columns of the first matrix. The basic unit size of the data sequence is 1 resource block.

[0397] The specific technical solution of this embodiment is:

[0398] For the pilot scheme d t =4,d f =3, the subcarrier spacing is The frame structure. The bandwidth is 10M, and 10% protection bandwidth is required, so the effective bandwidth is 9M. The corresponding resource block (RB) occupies 180KHz, so there is resource blocks.

[0399] For the above resource blocks, the number of subcarriers is The cost of RB is Therefore, the effective number of carriers is The corresponding TBS=45352.

[0400] For the above scenario, a block interleaving method based on inter-row transformation and intra-row transformation is adopted.

[0401] Step S1: Input data sequence (x 1 ,x 2 ,…,x 22275 ) Write by column List The interleaver of the rows obtains a two-dimensional matrix of M×N where x j =x dummy ,22276≤j≤22280 represents the redundant number;

[0402] Step S2: According to the inter-row transformation index sequence [R 1 ,R 2 ,…,R 2785 ], perform row permutation on the two-dimensional matrix X, and replace the R i Permute the rows to the i-th row to get the permuted two-dimensional matrix The interval between line changes is Therefore, the formula for generating the inter-row transformation index sequence is:

[0403]

[0404] Step S3: The number of interleaver columns N is 8, and here a divisor of 4 is selected for grouping and permutation. Grouping and permutation are performed in a row with 4 basic units as 1 group. That is, the two-dimensional matrix X after inter-row transformation p Each row of the 4-unit permutation is performed, and the offset within the group is S (R i ) is the cycle offset of Get a permuted two-dimensional matrix X q ;

[0405] Step S4: Read out the data matrix after the intra-row transformation in row order to obtain a read data sequence. In this example, the first 8×8 elements of the sequence are:

[0406]

[0407] Remove the redundant bits in the sequence, x dummy , and get the interleaved sequence (y 1 ,y 2 ,…,y 22275 ).

[0408] Compared with the existing situation, the permuted block interleaving method provided in this embodiment has the following advantages:

[0409] It has a larger minimum interleaving depth and can effectively resist deep fading and periodic fading in the frequency domain, thereby improving the fault tolerance performance of the system.

[0410] Embodiment 10:

[0411] This embodiment provides a transformation-based block interleaving method with a larger minimum interleaving depth, which can resist deep fading in the frequency domain and periodic fading in the frequency domain during signal transmission, thereby improving system performance and system stability.

[0412] In this embodiment, the transformations used include inter-row transformation and intra-row transformation. The inter-row transformation is to perform inter-row transformation according to the inter-row transformation index sequence calculated according to the first matrix obtained after writing into the interleaver. The intra-row transformation is to perform intra-row permutation according to the intra-row permutation index sequence generated according to the pseudo-random sequence. The basic unit size of the data sequence is 1 resource block.

[0413] The specific technical solution of this embodiment is:

[0414] For the pilot scheme d t =4,d f =3, the subcarrier spacing is The frame structure. The bandwidth is 10M, and 10% protection bandwidth is required, so the effective bandwidth is 9M. The corresponding resource block (RB) occupies 180KHz, so there is resource blocks.

[0415] For the above resource blocks, the number of subcarriers is The cost of RB is Therefore, the effective number of carriers is The corresponding TBS=45352.

[0416] For the above scenario, a block interleaving method based on inter-row transformation and intra-row transformation is adopted.

[0417] Step S1: Input data sequence (x 1 ,x 2 ,…,x 22275) Write by column List The interleaver of the rows obtains a two-dimensional matrix of M×N where x j =x dummy ,22276≤j≤22280 represents the redundant number;

[0418] Step S2: According to the inter-row transformation index sequence [R 1 ,R 2 ,…,R 2785 ], perform row permutation on the two-dimensional matrix X, and replace the R i Permute the rows to the i-th row to get the permuted two-dimensional matrix The interval between line changes is Therefore, the formula for generating the inter-row transformation index sequence is:

[0419]

[0420] Step S3: After the inter-row transformation, the two-dimensional matrix X p , perform intra-row permutation according to the intra-row permutation index sequence generated by the pseudo-random sequence.

[0421] Here, by calculating the 3-bit pseudo-random binary PN sequence (c 8*i-7 ,c 8*i-6 ,…,c 8*i ) converted to octal value C i ,S(R i )=mod(C i ,8), and obtain a two-dimensional matrix X after intra-row permutation q ;

[0422] In this example, suppose the 3-bit binary PN sequence is (1,0,1,0,1,1,0,1,1,0,1,1,0,1,1,0,1,0,1,0,1,0,0,1,0), which is converted into an octal sequence (5, 3, 2, 6, 6, 5, 2, 2). When an octal number is repeated with the previous one, an index that is greater than the previous one is used as the current position replacement index. The corresponding intra-row replacement index sequence is (5, 3, 2, 6, 7, 8, 4, 1).

[0423] Step S4: Read out the data matrix after the intra-row permutation in row order to obtain a read data sequence, the first 1×8 elements of which are:

[0424] e 1 c 1 b 1 f 1 g 1 h1 a 1 d 1

[0425] Remove the redundant bits in the sequence, x dummy , and get the interleaved sequence (y 1 ,y 2 ,…,y 22275 ).

[0426] Compared with the existing situation, the permuted block interleaving method provided in this embodiment has the following advantages:

[0427] It has a larger minimum interleaving depth and can effectively resist deep fading and periodic fading in the frequency domain, thereby improving the fault tolerance performance of the system.

[0428] The present application also provides a network device, including a processor and a memory, wherein the memory is configured to store a computer program, and when the computer program is executed by the processor, the processor implements the above-mentioned interleaving method.

[0429] The present application also provides a user equipment, including a processor and a memory, wherein the memory is configured to store a computer program, and when the computer program is executed by the processor, the processor implements the above-mentioned deinterleaving method.

[0430] The present application also provides a computer-readable storage medium, including a computer program, and when the computer program is executed by a processor, the processor implements any one of the methods.

[0431] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any other combination. When implemented by software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on the computer, the process or function according to the embodiment of the present application is generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions can be transmitted from a website site, computer, server or data center to another website site, computer, server or data center by wired (e.g., coaxial cable, optical fiber, digital subscriber line) or wireless (e.g., infrared, wireless, microwave, etc.) mode. The computer-readable storage medium can be any available medium that can be accessed by the computer or a data storage device such as a server or data center that includes one or more available media integrated. The available medium can be a magnetic medium (e.g., a floppy disk, a hard disk, a tape), an optical medium (e.g., a digital video disc (digital video disc, DVD)), or a semiconductor medium (e.g., a solid state disk (solid state disk, SSD)), etc.

[0432] Those of ordinary skill in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0433] The above are only preferred embodiments of the present application, and are not intended to limit the embodiments and protection scope of the present application. Those skilled in the art should be aware that all solutions obtained by equivalent substitutions and obvious changes made using the description and illustrations of the present application should be included in the protection scope of the present application.

Claims

1. A block interleaving method, characterized in that: The following steps are involved: Step S1, writing a first data sequence into an interleaver in order to obtain a first matrix; Step S2, transforming the first matrix to obtain a second matrix; Step S3, read out the second matrix in sequence to obtain a second data sequence.

2. The block interleaving method according to claim 1, characterized in that: The first data sequence and / or the second data sequence uses one resource element or multiple resource elements as a basic unit.

3. The block interleaving method according to claim 1, characterized in that: The process of writing the first data sequence into the interleaver includes: Writing the first data sequence into the interleaver in column order; or The first data sequence is written into the interleaver in row order.

4. The block interleaving method according to claim 1, characterized in that: The process of transforming the first matrix includes: Performing inter-row transformation on the first matrix; and / or Perform intra-row transformation on the first matrix.

5. The block interleaving method according to claim 4, characterized in that: The process of performing inter-row transformation on the first matrix comprises: An inter-row transformation is performed on the first matrix according to an inter-row transformation index sequence.

6. The block interleaving method according to claim 5, characterized in that: The inter-row transformation index sequence is calculated based on the first matrix obtained after writing into the interleaver; or The inter-row transformation index sequence is generated according to a random sequence or a pseudo-random sequence.

7. The block interleaving method according to claim 6, characterized in that: The first matrix is ​​subjected to inter-row transformation at specific intervals through the inter-row transformation index sequence.

8. The block interleaving method according to claim 5, 6 or 7, characterized in that: The generation formula of the inter-row transformation index sequence includes: Among them, R i refers to the row index before the first matrix transformation, i refers to the row index after the first matrix transformation, M is the number of rows of the interleaver, N is the number of columns of the interleaver, and d is the interval for inter-row permutation; The first matrix is ​​subjected to inter-row transformation using the inter-row transformation index sequence, and the Rth i The row is transformed to the i-th row.

9. The block interleaving method according to claim 7 or 8, characterized in that: The generation formula of the interval is: Wherein, M is the number of rows of the interleaver, N is the number of columns of the interleaver, and d is the interval for inter-row permutation.

10. The block interleaving method according to claim 4, characterized in that: The process of performing intra-row transformation on the first matrix includes: An intra-row transformation is performed on the first matrix to transform a basic unit of the first matrix intra-row.

11. The block interleaving method according to claim 10, characterized in that: The process of performing intra-row transformation on the first matrix includes: Performing intra-row permutation on the first matrix; and / or Performing an intra-row shift on the first matrix.

12. The block interleaving method according to claim 11, characterized in that: The process of performing intra-row transformation on the first matrix includes: An intra-row permutation index sequence is used to permute the basic units of the first matrix intra-row.

13. The block interleaving method according to claim 12, characterized in that: The process of generating the intra-row replacement index sequence includes: Generate an intra-row permutation index sequence according to the even-odd item permutation principle; and / or generating an intra-row permutation index sequence according to a divisor of the number of columns of the first matrix; and / or Generates an intra-row permutation index sequence based on a random sequence or a pseudo-random sequence.

14. The block interleaving method according to claim 11, characterized in that: The process of performing intra-row transformation on the first matrix includes: The first matrix is ​​cyclically shifted, and the basic unit of the first matrix is ​​cyclically shifted.

15. The block interleaving method according to claim 14, characterized in that: The generation method of the offset of the cyclic offset includes: Calculate and generate based on the row index of the row where the basic unit to be offset is located; and / or Generated according to a random sequence, and / or an extension based on a random sequence, and / or a pseudo-random sequence, and / or an extension based on a pseudo-random sequence.

16. The block interleaving method according to claim 14 or 15, characterized in that: The generation formula of the offset of the cyclic offset includes: or Among them, S(R i ) or S(i) is the offset, i is the row index of the first matrix after permutation, R i is the row index of the first matrix before permutation, and N is the number of columns of the interleaver.

17. The block interleaving method according to claim 1, characterized in that: The process of reading out the second data sequence includes: Reading out the second data sequence in row order; and / or The second data sequence is read out in column order.

18. The block interleaving method according to claim 1, characterized in that: In the interleaver: The number of columns of the interleaver is calculated by the transmission block size TBS and the actual code length or the maximum code length; The product of the number of rows and the number of columns of the interleaver is not less than the number of basic units in the first data sequence; The number of basic units is the number of effective subcarriers used for data transmission in an OFDM symbol divided by the number of resource elements contained in each basic unit.

19. The block interleaving method according to claim 1, characterized in that: The interleaving method further comprises: After writing the data sequence into the interleaver, if there are still empty spaces in the interleaver, the redundant numbers are filled in; and After reading the interleaved data sequence, the redundancy is removed.

20. A block interleaving deinterleaving method, characterized in that: The following steps are involved: Step N1, writing the second data sequence after channel transmission into the deinterleaver in order to obtain a third matrix; Step N2, performing inverse transformation processing on the third matrix to obtain a fourth matrix; Step N3, read out the fourth matrix in sequence to obtain a first data sequence.

21. A block interleaving interleaver, which interleaves symbols within an OFDM symbol, characterized in that: include: The reading and writing unit writes the first data sequence into the interleaving block in order to generate a first matrix; The processing unit transforms the first matrix written by the reading and writing unit to generate a second matrix; The reading and writing unit reads out the second matrix to obtain an interleaved second data sequence.

22. A block interleaving deinterleaver, which interleaves symbols within an OFDM symbol, characterized in that: include: The reading and writing part writes the second data sequence after the channel transmission into the deinterleaver in order to generate a third matrix; The processing unit performs an inverse transformation on the third matrix written by the reading and writing unit to generate a fourth matrix; The reading and writing unit reads out the fourth matrix to obtain a deinterleaved first data sequence.

23. A computer-readable storage medium comprising a computer program, wherein when the computer program is executed by a processor, the processor is caused to implement the method according to any one of claims 1 to 18 or 20.

Images