Interleaving method, de-interleaving method, interleaver and de-interleaver

Abstract

Disclosed in the present application are an interleaving method, a de-interleaving method, an interleaver and a de-interleaver. The interleaving method comprises: acquiring first data sequences, and sequentially writing the first data sequences into an interleaver to obtain a first matrix; performing transformation processing on the first matrix to obtain a second matrix; and sequentially reading the second matrix to obtain second data sequences.

Description

Interleaving method, de-interleaving method, interleaver, and de-interleaver

[0001] This application claims priority to the Chinese patent application No. 202510123590.5, filed on January 26, 2025, to the Chinese Patent Office, the content of which is incorporated herein by reference in its entirety. TECHNICAL FIELD

[0002] The present application relates to the field of communication technology, and in particular to an interleaving method based on transformation, and more particularly to an interleaving method, a de-interleaving method, an interleaver, and a de-interleaver. BACKGROUND

[0003] With the advent of the Fifth-Generation Mobile Communication Technology (5G) era, high-speed mobile communication networks can carry and disseminate more diverse multimedia resources, which will inevitably have a huge impact on the broadcast television industry. The advent of 5G will bring challenges to traditional digital terrestrial broadcast technology, but also bring new opportunities for mobile reception of broadcast television. 5G will support mobile video, ultra-high definition, augmented reality, and virtual reality services, but in the face of the rapid growth of multimedia services for a large number of users, the explosive consumption of traffic will greatly affect the quality of service for users accessing mobile communication networks. Under such a background, the Evolved Multimedia Broadcast Multicast Services (eMBMS) based on the evolution of Long Term Evolution (LTE), and the Enhancement for TV Service (EnTV) of the evolved version of eMBMS in Rel-14, provide a way to solve this contradiction.

[0004] In broadcast communication, the characteristics of the wireless channel itself make the channel conditions very complex and poor. For example, the presence of pedestrians, vehicles, and buildings can cause signal reflection and diffraction phenomena, which makes the final received signal actually a superimposed signal of the same signal through different paths, and the time delay and phase of the sub-signal in each path are different, so the final synthesized total signal often fluctuates dramatically. This phenomenon is called multipath fading. This signal fading caused by poor channels often causes continuous burst errors in the data received by the receiver, and demodulation and error correction techniques are more difficult to correct a burst of continuous errors. Therefore, in order to convert this continuous burst error into a dispersed random error as much as possible and improve the fault tolerance performance of the system, the system needs frequency domain interleaving technology.

[0005] The main role of the frequency domain interleaving is to convert the continuous long deep fading appearing in the frequency domain into shorter approximate random appearing fading, and the shorter approximate random appearing fading can be corrected by the system. In this way, the frequency domain interleaving can help the system to fully exert the error correction capability in multiple frequency bands, and improve the overall fault tolerance performance of the system. The design principle of the interleaving is to aim at the channel in which the system is located, and to disperse the continuous deep fading in the channel into an approximate random mode as much as possible, facilitate the implementation of the hardware, and reduce the complexity and overhead of the device. In addition, periodic fading often appears in the frequency domain. Therefore, on the basis of the frequency domain interleaving design, row permutation is further introduced to resist the periodic fading in the frequency domain, and the loss in the minimum interleaving depth is small. SUMMARY

[0006] In view of the above problem that periodic fading often appears in the frequency domain, the application provides an interleaving method, a deinterleaving method, an interleaver, and a deinterleaver.

[0007] The application provides an interleaving method, which comprises the following steps: obtaining a first data sequence; writing the first data sequence into an interleaver in sequence to obtain a first matrix; performing transformation processing on the first matrix to obtain a second matrix; and reading out the second matrix in sequence to obtain a second data sequence.

[0008] The application provides an interleaving method, which comprises the following steps: obtaining a first data sequence; writing the first data sequence into an interleaver in sequence to obtain a first matrix; performing transformation processing on the first matrix to obtain a second matrix; and reading out the second matrix in sequence to obtain a second data sequence.

[0009] The application provides an interleaving method, which comprises the following steps: obtaining a first data sequence; writing the first data sequence into an interleaver in sequence to obtain a first matrix; performing transformation processing on the first matrix to obtain a second matrix; and reading out the second matrix in sequence to obtain a second data sequence.

[0010] The embodiment of the present application provides an interleaver, which is arranged to deinterleave symbols in at least one OFDM symbol, comprising: a read-write unit, arranged to obtain a second data sequence after channel transmission, write the second data sequence into the interleaver according to sequence to generate a third matrix; a processing unit, arranged to perform inverse transform processing on the third matrix generated by the read-write unit to generate a fourth matrix; and the read-write unit is further arranged to read the fourth matrix to obtain a first data sequence after deinterleaving.

[0011] The embodiment of the present application further provides a computer readable storage medium, which stores a computer program, and the program is executed by a processor to implement the above-mentioned interleaving method or deinterleaving method. BRIEF DESCRIPTION OF DRAWINGS

[0012] Fig. 1 is a flow chart of an interleaving method provided by the embodiment of the present application;

[0013] Fig. 2 is a flow chart of another interleaving method provided by the embodiment of the present application;

[0014] Fig. 3 is a flow chart of another interleaving method provided by the embodiment of the present application;

[0015] Fig. 4 is a flow chart of a deinterleaving method provided by the embodiment of the present application;

[0016] Fig. 5 is a structural schematic diagram of an interleaver provided by the embodiment of the present application;

[0017] Fig. 6 is a structural schematic diagram of a deinterleaver provided by the embodiment of the present application.

[0018] Fig. 7 is a technical effect diagram of an interleaving method provided by the embodiment of the present application;

[0019] Fig. 8 is a technical effect diagram of another interleaving method provided by the embodiment of the present application;

[0020] Fig. 9 is a technical effect diagram of another interleaving method provided by the embodiment of the present application;

[0021] Fig. 10 is a structural schematic diagram of a network device provided by the embodiment of the present application;

[0022] Fig. 11 is a structural schematic diagram of a user equipment provided by the embodiment of the present application. DETAILED DESCRIPTION

[0023] Before any examples embodiments are described in further detail, it should be noted that some example embodiments are described as processes depicted as flow diagrams. Although the processes are described in a particular sequential order, many of the processes can be performed concurrently, in parallel, or simultaneously. In addition, the order of the processes can be re-arranged. The processes can be terminated when their functions are completed, but the processes can also have additional steps not included in the figure. The processes can correspond to methods, functions, procedures, subroutines, subprograms, etc.

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

[0025] The terms "first", "second", and the like in the embodiments of the present application are only used to distinguish different devices, modules, units, or other objects, and do not limit the functions performed by the devices, modules, units, or other objects.

[0026] The present application provides an interleaving method, comprising: obtaining a first data sequence, writing the first data sequence into an interleaver to obtain a first matrix; performing transformation processing on the first matrix to obtain a second matrix; and reading out the second matrix in order to obtain a second data sequence.

[0027] The interleaving method provided by the present application writes a data sequence into an interleaver and performs transformation processing on the data sequence to obtain an interleaved data sequence. Compared with the related art, the interleaving method provided by the present application has a large minimum interleaving depth and can effectively resist deep fading and periodic fading in the frequency domain, thereby improving the fault tolerance performance of a communication system. The minimum interleaving depth refers to the sum of the distances of any two data in the data sequence before and after interleaving, and the minimum value of the sum of all pairwise combination distances. For example, if two adjacent data before interleaving are separated by 100 data after interleaving, then the "sum of distances" corresponding to the minimum interleaving depth is 101.

[0028] In the process of writing the data sequence into the interleaver, the data sequence can be written into the interleaver in order, such as writing the data sequence into the interleaver in column order, or writing the data sequence into the interleaver in row order to obtain the first matrix.

[0029] In the process of writing the data sequence into the interleaver, the data sequence can also be written into the interleaver out of order, such as writing the data sequence into the interleaver out of a fixed order, or writing the data sequence into the interleaver randomly to obtain the first matrix.

[0030] In the process of transforming the first matrix, the first matrix can be transformed, such as permutation, offset, and other processing in addition to transformation, such as operation, to obtain the second matrix. The transformation processing proposed in the application can also be referred to as Permute processing in actual operation.

[0031] In the process of reading the second matrix from the interleaver, the second matrix can be read from the interleaver in order, such as reading the second matrix from the interleaver in row order, or reading the second matrix from the interleaver in column order, to obtain the interleaved second data sequence.

[0032] In the process of reading the second matrix from the interleaver, the second matrix can also be read from the interleaver without order, such as reading the second matrix from the interleaver without fixed order, or reading the second matrix from the interleaver in a randomly shuffled order, to obtain the interleaved second data sequence.

[0033] The application provides an interleaving method, as shown in FIG. 1, comprising:

[0034] Step S110, obtaining a first data sequence, writing the first data sequence into an interleaver in order to obtain a first matrix.

[0035] Step S120, transforming the first matrix to obtain a second matrix.

[0036] Step S130, reading the second matrix in order to obtain a second data sequence.

[0037] The specific operations in the different steps provided by the application can be combined with each other in actual execution.

[0038] The interleaving method provided by the application can comprise: step S1, obtaining a first data sequence, writing the first data sequence into an 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.

[0039] The interleaving method provided by the application can comprise: step S1, obtaining a first data sequence, writing the first data sequence into an 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.

[0040] The interleaving method provided in this application may include: step S1, obtaining a first data sequence, writing the first data sequence into an interleaver in column order to obtain a first matrix; step S2, performing a transformation on the first matrix to obtain a second matrix; and step S3, reading the second matrix in column order to obtain a second data sequence.

[0041] The interleaving method provided in this application may include: step S1, obtaining a first data sequence, writing the first data sequence into an interleaver in column order to obtain a first matrix; step S2, performing transformation and other processing on the first matrix to obtain a second matrix; step S3, reading the second matrix in row order to obtain a second data sequence.

[0042] The interleaving method provided in this application may include: step S1, obtaining a first data sequence, writing the first data sequence into an interleaver in row order to obtain a first matrix; step S2, performing a transformation on the first matrix to obtain a second matrix; and step S3, reading the second matrix in column order to obtain a second data sequence.

[0043] The interleaving method provided in this application may include: step S1, obtaining a first data sequence, writing the first data sequence into an interleaver in row order to obtain a first matrix; step S2, performing transformation and other processing on the first matrix to obtain a second matrix; step S3, reading the second matrix in column order to obtain a second data sequence.

[0044] The interleaving method provided in this application may include: step S1, obtaining a first data sequence, writing the first data sequence into an interleaver in row order to obtain a first matrix; step S2, performing transformation and other processing on the first matrix to obtain a second matrix; step S3, reading the second matrix in row order to obtain a second data sequence.

[0045] The interleaving method provided in this application may include: step S1, obtaining a first data sequence, writing the first data sequence into an interleaver in column order to obtain a first matrix; step S2, performing transformation and other processing on the first matrix to obtain a second matrix; step S3, reading the second matrix in column order to obtain a second data sequence.

[0046] This application provides an interleaving method, in which a data sequence can be based on one or more resource elements as the basic unit.

[0047] Data sequences can be based on a single resource element, or on more than one resource element, such as two, three, or four resource elements.

[0048] In an embodiment, the writing the first data sequence into the interleaver can include writing the first data sequence into the interleaver in a column order.

[0049] In an embodiment, the writing the first data sequence into the interleaver can include writing the first data sequence into the interleaver in a row order.

[0050] In an embodiment, the transforming the first matrix can include transforming the first matrix between rows and / or transforming the first matrix within rows.

[0051] The interleaving method provided in the present application, as shown in FIG. 2, can include:

[0052] In step S210, a first data sequence is obtained, and the first data sequence is written into an interleaver in order to obtain a first matrix.

[0053] In step S220, the first matrix is transformed between rows and / or within rows to obtain a second matrix.

[0054] In step S230, the second matrix is read out in order to obtain a second data sequence.

[0055] The transforming the first matrix can include only transforming the first matrix within rows, can include only transforming the first matrix within rows, or can include transforming the first matrix between rows and within rows.

[0056] If the transforming the first matrix includes transforming the first matrix between rows and within rows, the transforming can be performed in a fixed order or in a random order.

[0057] In the transforming the first matrix, the first matrix can be transformed within rows first, and then transformed between rows; the first matrix can be transformed between rows first, and then transformed within rows; or the first matrix can be transformed between rows and within rows simultaneously.

[0058] In an embodiment, the transforming the first matrix between rows includes transforming the first matrix between rows according to a row transformation index sequence.

[0059] The inter-row transformation of the first matrix according to the inter-row transformation index sequence means that each basic unit in the first matrix is transformed according to the inter-row transformation index sequence. Thus, in actual operation, after the inter-row transformation index sequence is determined, different communication manufacturers can use the same inter-row transformation index sequence to perform inter-row transformation on the same first matrix, i.e., the same data sequence after being written into the interleaver to obtain the same two-dimensional matrix, and the same inter-row transformation index sequence is used to perform inter-row transformation to obtain the same transformation result, i.e., the same second matrix, thereby ensuring that different communication manufacturers generate the same transformation result, so as to realize data transmission communication. Correspondingly, in actual operation of the present application, using the inter-row transformation index sequence proposed in the present application to perform inter-row transformation can not only ensure that data between different communication manufacturers 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.

[0060] In an embodiment, the inter-row transformation index sequence can be calculated according to the first matrix.

[0061] In the process of performing inter-row transformation on the first matrix, the inter-row transformation index sequence calculated according to the first matrix can be used to perform inter-row transformation on the first matrix.

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

[0063] In an embodiment, the inter-row transformation index sequence can be generated according to a random sequence or a pseudo-random sequence or a random expansion sequence or a pseudo-random expansion sequence.

[0064] In the process of performing inter-row transformation on the first matrix, the inter-row transformation index sequence generated according to the random sequence or the pseudo-random sequence or the random expansion sequence or the pseudo-random expansion sequence can be used to perform inter-row transformation on the first matrix.

[0065] In other words, in the process of performing inter-row transformation on the first matrix, the inter-row transformation index sequence can be obtained in a random manner, such as a random interval or a random operation, to perform inter-row transformation on the first matrix.

[0066] In an embodiment, the inter-row transformation index sequence can be used to perform inter-row transformation on the first matrix at a specific interval.

[0067] The specific interval can be determined based on the first matrix, such as the number of rows and columns of the first matrix. In this case, the first matrix can be a directly obtained first matrix or a first matrix that has undergone partial transformation, such as a first matrix after in-row transformation. Alternatively, the interval can be determined based on the interleaver, such as the number of rows and columns of the interleaver. Or the interval can also be determined based on the second matrix, such as the number of rows and columns of the second matrix, in which case the second matrix has undergone transformation. Alternatively, the interval can be determined by one or more fixed values ​​in advance. Or the interval can be determined in other ways.

[0068] Correspondingly, the inter-row transformation index sequence can be generated according to a specific interval, calculated directly from the first matrix, calculated from the transformed first matrix, or generated in other ways.

[0069] In one embodiment, the formula for generating the inter-row transformation index sequence can be:

[0070] ,

[0071] This refers to the row index before the first matrix transformation. This refers to the row index after the transformation of the first matrix. It is the row number of the interleaver. It is the number of columns of the interleaver. It is the interval for performing line permutations.

[0072] The first matrix is ​​transformed using an inter-row transformation index sequence, thus transforming the first matrix into its first row. row transformation to the th OK.

[0073] To elaborate, for the first row of the first matrix, that is... When, row operations are not required, that is, the first matrix's first row operation is performed without row operations. Transform the row to the first row; for the second row of the first matrix, i.e. At that time, the first matrix can be... Transform the row to the second row; for the third row of the first matrix, i.e. At that time, the first matrix can be... Transform the line to the 3rd line... when At that time, the first matrix can be... The row transformation is applied to the i-th row, which will not be elaborated here.

[0074] For example, when , When the inline transformation index formula is:

[0075] ,

[0076] In this case, we perform row-wise transformations on the first matrix. Specifically, for the first row of the first matrix, i.e. When this is the case, row transformations are not required; for the second row of the first matrix, i.e. When this happens, row 147 of the first matrix can be transformed into row 2; for row 3 of the first matrix, i.e. In this case, row 293 of the first matrix can be transformed to row 3, etc., which will not be elaborated here.

[0077] For example, when , When, the formula for interline transformation index can be:

[0078] ,

[0079] In this case, we perform row-wise transformations on the first matrix. Specifically, for the first row of the first matrix, i.e. When this is the case, row transformations are not required; for the second row of the first matrix, i.e. When the 70th row of the first matrix is ​​transformed into the second row; for the third row of the first matrix, i.e. At that time, row 139 of the first matrix can be transformed to row 3; ... for row 11 of the first matrix, that is... At that time, row 691 of the first matrix can be transformed to row 11; for row 12 of the first matrix, that is... When this happens, rows 2 of the first matrix can be transformed to row 12; for row 13 of the first matrix, i.e. In this case, row 71 of the first matrix can be transformed to row 13, etc., which will not be elaborated here.

[0080] The inter-row transformation index sequence formula in this embodiment can have many variations, such as changes in the transformation method, for example: in hour, , or in Time can be Or it could be other variations. hour, , or in Time can be Or it could be other variations.

[0081] For example, judging changes in conditions, such as: in And the opposite, Perform transformation, or in And the opposite, It can be transformed, or it can be other forms of transformation.

[0082] The above changes can be freely combined.

[0083] There are many more variations, which will not be listed here. In fact, those variations are merely adaptive changes to the inter-row transformation index sequence formula provided in this embodiment under different communication scenarios. The calculation idea is essentially the same, and the achieved technical effect is also the same.

[0084] In one embodiment, the formula for generating the interval can be:

[0085]

[0086] M is the number of rows in the interleaver, N is the number of columns in the interleaver, and d is the interval for performing row transformations.

[0087] When performing row transformations on the first matrix, the rows in the first matrix can be transformed using the intervals generated by the above formula.

[0088] For example, when , At that time, according to the above generation formula, the interval value is... In this case, the first matrix undergoes row-to-row transformations at a specific interval of 146. For example, row 147 of the first matrix can be transformed into row 2, row 293 into row 3, row 439 into row 4, and so on.

[0089] For example, when , At that time, according to the above generation formula, the interval value is... In this case, the first matrix undergoes row transformations at a specific interval of 69. For example, row 70 of the first matrix can be transformed into row 2, row 139 into row 3, row 208 into row 4, and so on.

[0090] The line spacing generation formula in this embodiment can have many variations; for example, it can also be: For example, it could also be: For example, it could also be: For example, it could also be: (in, (Any value).

[0091] There are many more variations, which will not be listed here. In fact, those variations are merely adaptive changes to the interval generation formula provided in this embodiment under different communication scenarios. The calculation idea is essentially the same, and the achieved technical effect is also the same.

[0092] In one embodiment, an inter-row transformation index sequence can be used to perform inter-row transformations on the first matrix at random intervals.

[0093] Random intervals can be obtained from random sequences, pseudo-random sequences, random extended sequences, pseudo-random extended sequences, or random numbers, generating an inter-row transformation index sequence, and performing inter-row transformations on the first matrix at random intervals.

[0094] To address the fading resistance of the interleaved data sequence, constraints can be set during the determination of the random interval to ensure that the row spacing between different rows in the first matrix before the row transformation is not less than the row spacing after the transformation.

[0095] For example, the constraint could be a random interval. .

[0096] like, At that time, the resulting inter-row transformation index sequence can be:

[0097] ,

[0098] ,whenever hour. The value cannot be the same as ,like Values ​​and If the values ​​are the same, you need to select a new random number.

[0099] Then the selected random interval for the second row It is 99, the third line. The value is 101. Accordingly, the 100th row of the first matrix is ​​transformed to the 2nd row, and the 201st row is transformed to the 3rd row.

[0100] In one embodiment, the process of performing an inline transformation on the first matrix includes: performing an inline transformation on the first matrix to transform the basic units of the first matrix.

[0101] During the inline transformation process, inline transformations can be performed on the basic units in one or more rows (including all rows) of the first matrix, and specific or random inline transformations can also be performed on the basic units of the first matrix.

[0102] The basic unit can consist of one or more resource elements. When performing inline transformations, the inline transformation is performed using the basic unit consisting of one or more resource elements.

[0103] In one embodiment, the process of performing an inline transformation on the first matrix may include: performing an inline permutation on the first matrix, and / or performing an inline offset on the first matrix.

[0104] Accordingly, the interleaving method provided in this application, as shown in Figure 3, may include:

[0105] Step S310: Obtain the first data sequence and write the first data sequence into the interleaver in order to obtain the first matrix.

[0106] Step S320: Perform inter-row transformations and / or intra-row permutations and / or intra-row offsets on the first matrix to obtain the second matrix.

[0107] Step S330: Read out the second matrix in sequence to obtain the second data sequence.

[0108] The process of performing an inline transformation on the first matrix may include only performing an inline permutation on the first matrix, or only performing an inline offset on the first matrix, or it may include performing both an inline permutation and an inline offset on the first matrix.

[0109] In-row permutation refers to the mutual exchange of basic units within the first matrix.

[0110] For example, the basic units in the same row of the first matrix can be interchanged. The basic unit of the first matrix can consist of one or more resource elements. When the basic unit consists of one resource element, the in-row permutation refers to the interchange of the resource elements in the first matrix. When the basic unit consists of multiple resource elements, the in-row permutation refers to the interchange of the multiple resource elements in the first matrix as a whole.

[0111] Inline offsets include cyclic offsets and non-cyclic offsets.

[0112] Cyclic offset operations can cause the positions of basic units within one or more rows of a first matrix to change uniformly and cyclically. For example, it can include performing a uniform in-row offset on all basic units in a row of the first matrix in sequence or at specific intervals.

[0113] Non-cyclic offset operations can cause non-uniform cyclic changes to the basic units within one or more rows of the first matrix. For example, all basic units in one or more rows of the first matrix can be offset sequentially, with units exceeding the offset range discarded, and vacated units filled with other resource elements or zeros. Another example is offsetting not all basic units in one or more rows of the first matrix sequentially or out of order; for instance, the first basic unit in a row can be offset to the position of the original fourth basic unit, the fourth basic unit to the position of the original third basic unit, the third basic unit to the position of the original second basic unit, and so on.

[0114] In one embodiment, the process of performing an inline transformation on the first matrix includes: using an inline permutation index sequence to perform an inline permutation on the basic units of the first matrix.

[0115] An inline permutation index sequence can be used to perform inline permutations on the basic units within one or more rows (including all rows) of the first matrix. Alternatively, an inline permutation index sequence can be used to perform specific or random inline permutations on the basic units of the first matrix.

[0116] The inline permutation index sequence is essentially the overall transformation formula for inline permutations. In practice, different communication vendors can use the inline permutation index sequence to perform inline permutations on the basic units of the first matrix. The inline permutation index sequence can be generated using only one method or multiple methods; the final result is collectively referred to as the inline permutation index sequence. When the inline permutation index sequence is generated using multiple methods, different communication vendors can use inline permutation index sequences generated by different methods to perform inline permutations on the basic units within the first matrix, or they can use inline permutation index sequences generated by the same method to perform inline permutations on the basic units within the first matrix.

[0117] In one embodiment, the process of generating the inline permutation index sequence includes: generating the inline permutation index sequence according to the odd-even permutation principle.

[0118] During the inline permutation process, an inline permutation index sequence generated according to the odd-even permutation principle can be used to perform inline permutations on the basic units of the first matrix. This allows for inline permutations of basic units located in the odd-even terms. A basic unit can consist of one or more resource elements. Correspondingly, when performing inline permutations of odd-even terms, the basic unit consisting of one or more resource elements is treated as a whole for inline permutation.

[0119] When performing an inline transformation, the basic unit located in the odd-numbered column of each row can be swapped with the basic unit located in the even-numbered column.

[0120] When performing inline transformations, we can distinguish between odd and even rows. In even rows, we can swap the basic units located in odd columns with those located in even columns, while leaving the odd rows unchanged. Alternatively, we can swap the basic units located in odd columns with those located in even columns, while leaving the even rows unchanged. The formula for this type of transformation is:

[0121]

[0122] It is the row index of the first matrix after the row transformation. It is the row index of the first matrix before the inter-row transformation.

[0123] For example, the first row of the first matrix The second line The basic unit consists of one resource element. In this case, after inline substitution: the first line... The second line .

[0124] Other methods of parity-even term inline transformations can also be performed, which will not be listed here.

[0125] In one embodiment, the process of generating the inline permutation index sequence includes: generating the inline permutation index sequence based on the divisors of the column numbers of the first matrix.

[0126] During the inline permutation process, an inline permutation index sequence generated based on the divisors of the column numbers of the first matrix can be used to perform inline permutations on the basic units of the first matrix. This allows inline permutations of the basic units within the first matrix. A basic unit can consist of one or more resource elements; correspondingly, when performing inline permutations based on the divisors of the column numbers of the first matrix, the basic unit consisting of one or more resource elements is treated as a whole for inline permutation.

[0127] When performing inline transformations, you can arbitrarily select a divisor of the column number of the first matrix and perform permutations in the rows using the basic units of the divisor values ​​as a group.

[0128] For example, the first row of the first matrix The basic unit consists of 4 resource elements. In this case, the divisors of the selected column number 8 are 2 and 4. The basic unit is then permuted based on the divisor 4. The permutation result is: the second row after permutation is... .

[0129] For example, the second row of the first matrix The basic unit consists of 4 resource elements. In this case, the divisors of the selected column number 8 are 2 and 4. The basic unit is then permuted based on the divisor 2. The permutation result is: the second row after permutation is... .

[0130] Other inline transformations can also be performed using different divisor methods, which will not be listed here.

[0131] The process of generating the inline permutation index sequence also includes generating the inline permutation index sequence based on the product, remainder, or other values ​​of the number of columns or rows of the first matrix. The specific operation method is similar to that in the above embodiments, and will not be described in detail here.

[0132] In one embodiment, the process of generating the in-row permutation index sequence includes: generating the in-row permutation index sequence based on a random sequence or a pseudo-random sequence.

[0133] During the in-row permutation process, an in-row permutation index sequence generated based on a random or pseudo-random sequence can be used to perform in-row permutations on the basic units of the first matrix. This allows for the in-row permutation of the basic units within the first matrix. A basic unit can consist of one or more resource elements. Correspondingly, when performing in-row permutations using divisors of the column number of the first matrix, the basic unit consisting of one or more resource elements is treated as a whole for in-row permutation.

[0134] When performing inline transformations, the generated random or pseudo-random sequence can be converted into numerical values, and the basic units corresponding to the numerical values ​​can be permuted.

[0135] In one embodiment, the process of performing an inline transformation on the first matrix includes: performing a cyclic offset on the first matrix, and cyclically offsetting the basic units of the first matrix.

[0136] The basic units of one or more rows (including all rows) of the first matrix can be cyclically offset according to specific or random offsets.

[0137] The basic units of the first matrix can also be offset acyclically according to a specific or random offset. The specific concept of acyclic offset has been explained in the above embodiments and will not be repeated here.

[0138] In one embodiment, the offset of the cyclic offset is generated by calculating the offset of the cyclic offset based on the row index of the row where the basic unit to be offset is located.

[0139] The offset of the cyclic offset can be generated based on the row index of the row where the basic unit to be offset is located, and then the basic unit in the first matrix can be cyclically offset based on the offset.

[0140] There are many ways to calculate the offset based on the row index. For example, the offset itself... , ,in It is a row index. It is the number of columns in the interleaver, or some other formula.

[0141] In one embodiment, the offset of the cyclic offset is generated by: generating the offset of the cyclic offset based on a random sequence, and / or an extension of the random sequence, and / or a pseudo-random sequence, and / or an extension of the pseudo-random sequence.

[0142] The offset of the cyclic offset can be generated based on the random sequence, and / or the extension of the random sequence, and / or the pseudo-random sequence, and / or the extension of the pseudo-random sequence, and then the basic units in the first matrix are cyclically offset based on the offset.

[0143] There are many ways to calculate the offset when generating an offset from a random sequence.

[0144] For example, for an 8-bit pseudo-random binary PN sequence Convert to decimal Afterwards, Taking the remainder after dividing by 8 gives the offset of the cycle offset. .

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

[0146] After converting to decimal, it is: .

[0147] The remainder after dividing by 8 is: That is, for the matrix, the first row offset is 5, the second row offset is 5, the third row offset is 2, the fourth row offset is 6, the fifth row offset is 7, the sixth row offset is 5, the seventh row offset is 1, and the eighth row offset is 7.

[0148] Accordingly, if the first matrix was originally:

[0149]

[0150] After performing a cyclic offset based on the offset calculated in the above manner, the first matrix becomes:

[0151]

[0152] In one embodiment, the method for generating the offset of the cyclic offset further includes: calculating the offset of the cyclic offset based on the row index of the row where the basic unit to be offset is located, and generating the offset of the cyclic offset based on a random sequence, and / or an extension of a random sequence, and / or a pseudo-random sequence, and / or an extension of a pseudo-random sequence.

[0153] The formula for generating the offset of the cyclic offset includes:

[0154] or

[0155] or It's the offset. It is the row index of the first matrix after the offset. is the row index of the first matrix before the offset, and N is the column number of the interleaver.

[0156] The offset of the circular offset can be generated based on the row index of the first matrix before or after the row transformation, and then the basic unit of the row corresponding to the row index can be cyclically offset based on the offset.

[0157] For example, if row operations have already been performed, the original first matrix is:

[0158]

[0159] but , , , , , , , .

[0160] After performing a cyclic offset based on the offset calculated in the above manner, the first matrix becomes:

[0161]

[0162] In one embodiment, reading out the second data sequence includes reading out the second data sequence in row order.

[0163] In one embodiment, reading out the second data sequence includes reading out the second data sequence in column order.

[0164] In one embodiment, in the interleaver: the number of columns of the interleaver It can be calculated using the Transport Block Size (TBS) and the actual code length or maximum code length.

[0165] Number of columns of the interleaver It can be obtained by calculating the Transport Block Size (TBS) and the actual code length or the maximum code length. There are several ways to calculate it, such as dividing the TBS by the actual code length or the maximum code length and then rounding it down, or other calculation methods.

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

[0167]

[0168] In one embodiment, in the interleaver: the number of columns of the interleaver It can be done using pre-specified values.

[0169] Number of columns of the interleaver It can be achieved through manually specified values, such as manually setting... That is, the number of columns in the interleaver is 8, or for example, it is set manually. That is, the number of columns in the interleaver is 16.

[0170] In one embodiment, in the interleaver: the number of rows of the interleaver With column number The product is not less than the number of basic units in the first data sequence.

[0171] For example, when the number of columns of the interleaver When the basic unit size is 1 resource block,

[0172] The number of rows in the interleaver is:

[0173]

[0174] In one embodiment, in the interleaver: the number of rows of the interleaver It can be done using pre-specified values.

[0175] Number of rows of interleaver It can be done by manually specifying a value, such as manually setting it. That is, the number of rows of the interleaver. For example, 2785, or a manually set value. That is, the number of rows of the interleaver is 697.

[0176] The above calculation of the number of columns of the interleaver The method of calculating the number of rows in the interleaver The methods can be freely combined.

[0177] In one embodiment, in the interleaver: the number of rows of the interleaver With column number The product 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 within an OFDM symbol divided by the number of resource elements contained in each basic unit.

[0178] Number of interleaver columns The number of rows in the interleaver can be calculated from the TBS and the actual or maximum code length. Number of columns of the interleaver The following formula can be satisfied:

[0179]

[0180] This represents the number of effective subcarriers used for data transmission within an OFDM symbol. This represents the number of resource elements contained in the basic unit of a data sequence.

[0181] For example, in a communication system, when the number of effective subcarriers used for data transmission within an OFDM symbol... When the value is 22275 and the corresponding TBS is 45352, the maximum code length is 6144-24.

[0182] If the basic unit size of the data sequence is 1 resource block, then the number of columns in the interleaver is:

[0183]

[0184] The number of rows in the interleaver is:

[0185]

[0186] If the basic unit size of the data sequence is 4 resource blocks, then the number of columns in the interleaver is:

[0187]

[0188] The number of rows in the interleaver is:

[0189]

[0190] In one embodiment, the interleaving method further includes: after writing the data sequence into the interleaver, if there are still empty slots in the interleaver, adding redundant numbers; and after reading out the interleaved data sequence, deleting the redundancy.

[0191] In one embodiment, a de-intertwining method is provided, as shown in Figure 4, including the following steps:

[0192] Step S410: Obtain the second data sequence after transmission through the channel, and write the second data sequence into the deinterleaver in sequence to obtain the third matrix.

[0193] Step S420: Perform an inverse transformation on the third matrix to obtain the fourth matrix.

[0194] Step S430: Read out the fourth matrix in sequence to obtain the first data sequence.

[0195] In step S410, the second data sequence transmitted through the channel can be written into the deinterleaver in row order, column order, or a non-fixed order. In step S420, the inverse transformation processing can include performing inter-row inverse transformation and / or intra-row inverse transformation, that is, performing inter-row inverse transformation and / or intra-row inverse transformation on the third matrix. In step S430, the fourth matrix can be read out in row order, column order, or 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. 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. Correspondingly, 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 related to 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.

[0196] In one embodiment, at least one of the first data sequence and the second data sequence uses at least one resource element as the basic unit.

[0197] In one embodiment, writing the second data sequence sequentially into the deinterleaver includes: writing the second data sequence into the deinterleaver in column order; or writing the second data sequence into the deinterleaver in row order.

[0198] In one embodiment, the inverse transformation of the third matrix includes at least one of the following: performing an inverse inter-row transformation on the third matrix; or performing an inverse intra-row transformation on the third matrix.

[0199] In one embodiment, performing an inverse transformation on the third matrix includes: performing an inverse row transformation on the third matrix according to the inverse row transformation index sequence.

[0200] In one embodiment, the inverse inter-row transform index sequence is calculated based on a third matrix; or the inverse inter-row transform index sequence is generated based on a random sequence or a pseudo-random sequence.

[0201] In one embodiment, performing an inverse row transformation on the third matrix according to the inverse row transformation index sequence includes: using the inverse row transformation index sequence to perform an inverse row transformation on the third matrix at specific intervals.

[0202] In one embodiment, the formula for generating the inverse inter-row transform index sequence includes:

[0203] ,

[0204] It is the row index after the inverse transformation of the third matrix. It is the row index before the inverse transformation of the third matrix. It is the number of rows in the deinterleaver. It is the number of columns in the deinterleaver. It is the interval for performing inverse interline transformation.

[0205] Perform an inverse row transformation on the third matrix according to the inverse row transformation index sequence, including: performing an inverse row transformation on the third matrix using the inverse row transformation index sequence, and changing the third matrix's... row transformation to the th OK.

[0206] In one embodiment, the formula for generating the interval is:

[0207] ;

[0208] It is the number of rows in the deinterleaver. It is the number of columns in the deinterleaver. The interval is the interval for performing the inverse interline transformation.

[0209] In one embodiment, performing an inverse inline transformation on the third matrix includes performing an inverse inline transformation on the basic units of the third matrix.

[0210] In one embodiment, performing an inverse inline transformation on the third matrix includes at least one of the following: performing an inverse inline permutation on the third matrix; or performing an inverse inline offset on the third matrix.

[0211] In one embodiment, performing an inverse permutation on the third matrix includes: using an inverse permutation index sequence to perform an inverse permutation on the basic units of the third matrix.

[0212] In one embodiment, the process of generating the in-row inverse permutation index sequence includes at least one of the following: generating the in-row inverse permutation index sequence according to the odd-even term inverse permutation principle; generating the in-row inverse permutation index sequence according to the divisors of the column numbers of the third matrix; generating the in-row inverse permutation index sequence according to a random sequence or a pseudo-random sequence.

[0213] In one embodiment, performing an in-row reverse offset on the third matrix includes performing an inverse cyclic offset or an inverse non-cyclic offset on the basic units of the third matrix.

[0214] In one embodiment, the offset of the anti-cyclic offset or anti-acyclic offset is generated by at least one of the following: calculating the offset of the anti-cyclic offset or anti-acyclic offset based on the row index of the row where the basic unit to be offset is located; generating the offset of the anti-cyclic offset or anti-acyclic offset based on at least one of a random sequence, an extension of a random sequence, a pseudo-random sequence, and an extension of a pseudo-random sequence.

[0215] In one embodiment, the formula for generating the offset of the anti-loop offset includes:

[0216] or ;

[0217] or It's the offset. It is the row index of the third matrix before the reverse circular offset. It is the row index of the third matrix after the reverse circular offset. It is the column number of the deinterleaver.

[0218] In one embodiment, reading the fourth matrix sequentially includes at least one of the following: reading the fourth matrix in row order; or reading the fourth matrix in column order.

[0219] In one embodiment, in the deinterleaver, the number of columns of the deinterleaver is calculated by using the 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 deinterleaver is not less than the number of basic units in the second data sequence; the number of basic units is the number of effective subcarriers used for data transmission within an OFDM symbol divided by the number of resource elements contained in each basic unit.

[0220] In one embodiment, after writing the second data sequence sequentially into the deinterleaver, the method further includes: filling in redundant data in response to a gap in the deinterleaver.

[0221] After obtaining the first data sequence, the process also includes: removing redundant numbers from the first data sequence.

[0222] This application provides an interleaver configured to interleave symbols within at least one OFDM symbol, as shown in FIG5. The interleaver includes: a read / write unit 100 configured to acquire a first data sequence and write the first data sequence sequentially into an interleaving block to generate a first matrix; a processing unit 200 configured to perform transformation processing on the first matrix generated by the read / write unit 100 to generate a second matrix; the read / write unit 100 is further configured to read out the second matrix to obtain the interleaved second data sequence.

[0223] The read / write unit 100 can write the first data sequence into the interleaver in row order, in column order, or in a non-fixed order. The transformation processing performed in the processing unit 200 can include inter-row transformations and / or inverse row transformations, i.e., it can perform inter-row transformations and / or intra-row transformations on the second matrix. Inter-row transformations include inter-row permutations, and intra-row transformations include intra-row permutations and / or intra-row offsets. The operations related to inter-row transformations, inter-row permutations, intra-row transformations, intra-row permutations, and intra-row offsets have been described in detail in the above embodiments and will not be repeated here.

[0224] This application provides a deinterleaving device configured to deinterleave symbols within at least one OFDM symbol, as shown in FIG6. The deinterleaving device includes: a read / write unit 300 configured to acquire a second data sequence after transmission through the channel, and write the second data sequence sequentially into the deinterleaving device to generate a third matrix; a processing unit 400 configured to perform inverse transformation processing on the third matrix generated by the read / write unit 300 to generate a fourth matrix; the read / write unit 300 is also configured to read out the fourth matrix to obtain a deinterleaved first data sequence.

[0225] The read / write unit 300 can write the second data sequence transmitted through the channel into the deinterleaver in row order, column order, or any other order. The processing unit 400 can perform inverse transformation processing, including inter-row inverse transformation and / or intra-row inverse transformation; that is, it can perform inter-row inverse transformation and / or intra-row inverse transformation on the third matrix. Inter-row inverse transformation corresponds to the operation of inter-row transformation, and intra-row inverse transformation corresponds to the operation of intra-row transformation. Intra-row inverse transformation includes intra-row inverse permutation and / or intra-row inverse offset; intra-row inverse offset includes intra-row inverse cyclic offset and / or intra-row inverse non-cyclic offset. Correspondingly, intra-row inverse permutation corresponds to the operation of intra-row permutation, and intra-row inverse offset corresponds to the operation of intra-row offset. The operations related to 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.

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

[0227] Example 1:

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

[0229] In this embodiment, the transformation used is the inter-row transformation, which is performed by calculating the inter-row transformation index sequence based on the first matrix obtained after writing to the interleaver. The basic unit size of the data sequence is 1 resource block.

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

[0231] For pilot schemes as , The subcarrier spacing is The frame structure. Bandwidth is... A 10% protection bandwidth is required, therefore the effective bandwidth is... The corresponding resource block (RB) occupies resources of... Therefore, it exists. One resource block.

[0232] For the above resource block, the number of subcarriers is The cost of RB is Therefore, the number of effective carriers is Corresponding .

[0233] For the above scenario, a block interleaving method based on line-to-line transformation is adopted:

[0234] Step S1: Input data sequence Write by column List The line interleaver, gets Two-dimensional matrix ,in Indicates the number of redundancies.

[0235] Step S2: Based on the inter-row transformation index sequence For two-dimensional matrices Perform inter-row permutation, and replace the first row with the second row. Interline permutation to the first , and obtain the permuted two-dimensional matrix. The interline transition interval is... Therefore, the formula for generating the inter-row transformation index sequence is:

[0236] , .

[0237] Step S3: Read the data matrix after row transformation in row-wise order to obtain the read data sequence. In this example, the first row of this sequence... The elements are:

[0238]

[0239] Remove redundant bits from the sequence The interleaved sequence is obtained. .

[0240] The block interleaving method of the transformation provided in this embodiment has the following advantages:

[0241] As shown in Figure 7, for the same communication system, the block interleaving method provided in this application performs intra-line and inter-line transformations on the data sequence input to the interleaver, which can improve the gain compared to a method without interleaving or transformation. At that time, the corresponding signal-to-noise ratio (SNR) without interleaving was 11.95 dB, and the SNR without transformation was 10.6 dB. The SNR obtained by this application based on interline transformation is 9.7 dB, representing a gain of 2.25 dB compared to without interleaving and a gain of 0.9 dB compared to without transformation. It is evident that a larger minimum interleaving depth can resist deep fading in the frequency domain during signal transmission, improving both system performance and system stability.

[0242] Example 2:

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

[0244] In this embodiment, the transformation used is an inline transformation. The inline transformation is to calculate the offset of the cyclic offset based on the row index of the row where the basic unit to be offset is located, and then perform the inline offset. The basic unit size of the data sequence is 1 resource block.

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

[0246] For pilot schemes as , The subcarrier spacing is The frame structure. Bandwidth is... A 10% protection bandwidth is required, therefore the effective bandwidth is... The corresponding RB (resource block) occupies resources of... Therefore, it exists One resource block.

[0247] For the above resource block, the number of subcarriers is The cost of RB is Therefore, the number of effective carriers is Corresponding .

[0248] For the above scenario, a block interleaving method based on inline transformation is adopted:

[0249] Step S1: Input data sequence Write by column List The line interleaver, gets Two-dimensional matrix ,in Indicates the number of redundancies.

[0250] Step S2: Define a two-dimensional matrix For two-dimensional matrix The offset of each row is The cyclic offset, the offset amount is This yields an offset two-dimensional matrix. .

[0251] Step S3: Read the offset data matrix in row-wise order to obtain the read data sequence. In this example, the first row of this sequence... The elements are:

[0252]

[0253] Remove redundant bits from the sequence The interleaved sequence is obtained. .

[0254] The block interleaving method of the transformation provided in this embodiment has the following advantages:

[0255] As shown in Figure 8, for the same communication system, the interleaving method provided in this application performs intra-line and inter-line transformations on the data sequence input to the interleaver, which can improve the gain compared to a method without interleaving or transformation. At that time, the corresponding SNR without interleaving was 11.95dB, and the SNR without transformation was 10.6dB. However, the SNR obtained by in-line transformation in this application is 10.0dB, representing a gain of 1.95dB compared to without interleaving and a gain of 0.6dB compared to without transformation. It is evident that in-line transformation can resist periodic fading in the frequency domain during signal transmission, improving both system performance and system stability.

[0256] Example 3:

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

[0258] In this embodiment, the transformations used include inter-row transformation and intra-row transformation. The inter-row transformation is performed by calculating the inter-row transformation index sequence based on the first matrix obtained after writing to the interleaver. The intra-row transformation is performed by calculating the offset of the cyclic offset based on the row index of the row where the basic unit to be offset is located. The basic unit size of the data sequence is 1 resource block.

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

[0260] For pilot schemes as , The subcarrier spacing is The frame structure. Bandwidth is... A 10% protection bandwidth is required, therefore the effective bandwidth is... The corresponding RB (resource block) occupies resources of... Therefore, it exists. One resource block.

[0261] For the above resource block, the number of subcarriers is The cost of RB is Therefore, the number of effective carriers is Corresponding .

[0262] For the above scenario, a block interleaving method based on interline transformation and intraline transformation is adopted:

[0263] Step S1: Input data sequence Write by column List The line interleaver, gets Two-dimensional matrix ,in Indicates the number of redundancies.

[0264] Step S2: Based on the inter-row transformation index sequence For two-dimensional matrices Perform inter-row permutation, and replace the first row with the second row. Interline permutation to the first , and obtain the permuted two-dimensional matrix. The interline transition interval is... Therefore, the formula for generating the inter-row transformation index sequence is:

[0265] , .

[0266] Step S3: For the permuted two-dimensional matrix The offset of each row is The cyclic offset, the offset amount is This yields an offset two-dimensional matrix. .

[0267] Step S4: Read the offset data matrix in row-wise order to obtain the read data sequence. In this example, the first row of this sequence... The elements are:

[0268]

[0269] Remove redundant bits from the sequence The interleaved sequence is obtained. .

[0270] The block interleaving method of the transformation provided in this embodiment has the following advantages:

[0271] It has a 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. Here, as shown in Figure 9, for the same communication system, the interleaving method provided in this application performs intra-line and inter-line transformations on the data sequence input to the interleaver. Compared with the method without interleaving or transformation, this can improve the gain. At that time, the corresponding SNR without interleaving was 11.95dB, and the SNR without transformation was 10.6dB, while the SNR obtained in this application was 9.2dB. Compared with no interleaving, the gain was 2.75dB, and compared with no transformation, the gain was 1.4dB. It can be seen that with a larger minimum interleaving depth, it can resist deep fading and periodic fading in the frequency domain during signal transmission, thereby improving system performance and system stability.

[0272] Example 4:

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

[0274] In this embodiment, the transformations used include inter-row transformation and intra-row transformation. The inter-row transformation is performed by calculating the inter-row transformation index sequence based on the first matrix obtained after writing to the interleaver. The intra-row transformation is performed by calculating the offset of the cyclic offset based on the row index of the row where the basic unit to be offset is located. The basic unit size of the data sequence is 4 resource blocks.

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

[0276] For pilot schemes as , The subcarrier spacing is The frame structure. Bandwidth is... A 10% protection bandwidth is required, therefore the effective bandwidth is... The resources occupied by the corresponding resource block (RB) are... Therefore, it exists. There are [number] resource blocks. For the above resource blocks, the number of subcarriers is [number]. The cost of RB is Therefore, the number of effective carriers is Corresponding .

[0277] For the above scenario, an interleaving method based on interline transformation and intraline transformation was adopted:

[0278] Step S1: Input data sequence Write by column List The line interleaver, gets Two-dimensional matrix ,in , Indicates the number of redundancies.

[0279] Step S2: Based on the inter-row transformation index sequence For two-dimensional matrices Perform inter-row permutation, and replace the first row with the second row. Interline permutation to the first , and obtain the permuted two-dimensional matrix. The interline transition interval is... Therefore, the formula for generating the inter-row transformation index sequence is:

[0280] ,

[0281] Step S3: For the permuted two-dimensional matrix The offset of each row is The cyclic offset, the offset amount is This yields an offset two-dimensional matrix. .

[0282] Step S4: Read the offset data matrix in row-wise order to obtain the read data sequence. In this example, the first row of this sequence... The elements are:

[0283]

[0284] Remove redundant bits from the sequence The interleaved sequence is obtained. .

[0285] The interleaving method of the permutation block interleaving provided in this embodiment has the following advantages:

[0286] It has a 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.

[0287] Example 5:

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

[0289] In this embodiment, the transformations used include inter-row transformation and intra-row transformation. The inter-row transformation is performed by calculating the inter-row transformation index sequence based on the first matrix obtained after writing to the interleaver. The intra-row transformation is performed by offsetting based on the offset generated by the pseudo-random sequence. The basic unit size of the data sequence is 1 resource block.

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

[0291] For pilot schemes as , The subcarrier spacing is The frame structure.

[0292] Bandwidth is A 10% protection bandwidth is required, therefore the effective bandwidth is... The resources occupied by the corresponding resource block (RB) are... Therefore, it exists. One resource block.

[0293] For the above resource block, the number of subcarriers is The cost of RB is Therefore, the number of effective carriers is corresponding .

[0294] For the above scenario, a block interleaving method based on interline transformation and intraline transformation is adopted:

[0295] Step S1: Input data sequence Write by column List The line interleaver, gets Two-dimensional matrix ,in Indicates the number of redundancies.

[0296] Step S2: Based on the inter-row transformation index sequence For two-dimensional matrices Perform inter-row permutation, and replace the first row with the second row. Interline permutation to the first , and obtain the permuted two-dimensional matrix. The interline transition interval is... Therefore, the formula for generating the inter-row transformation index sequence is:

[0297] , .

[0298] Step S3: For the permuted two-dimensional matrix The offset of each row is The cyclic offset is calculated by using an 8-bit pseudo-random binary PN sequence. Value after converting to decimal , This yields an offset two-dimensional matrix. .

[0299] In this example, let the 8-bit pseudo-random binary PN sequence be: (1,0,1,0,1,1,0,1,0,1,1,0,1,1,0,1,0,1,0,1,0,0,1,0,0,0,0,1,1,1,1,0,0,1,0,1,0,1,1,1,0,0,0,1,0,1,0,1,1,1,0,0,0,0,0,1,1,0,0,1,1,1,1,1), with corresponding offsets of (5, 5, 2, 6, 7, 5, 1, 7).

[0300] Step S4: Read the offset data matrix in row-wise order to obtain the read data sequence. The first row of this sequence... The elements are:

[0301]

[0302] Remove redundant bits from the sequence The interleaved sequence is obtained. .

[0303] The permutation block interleaving method provided in this embodiment has the following advantages: 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] Example 6:

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

[0306] In this embodiment, the transformations used include inter-row transformation and intra-row transformation. The inter-row transformation is performed by calculating the inter-row transformation index sequence based on the first matrix obtained after writing to the interleaver. The intra-row transformation is performed by generating an intra-row permutation index sequence based on the odd-even term permutation principle. The basic unit size of the data sequence is 1 resource block.

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

[0308] For pilot schemes as , The subcarrier spacing is The frame structure. Bandwidth is... A 10% protection bandwidth is required; therefore, the effective bandwidth is... The resources occupied by the corresponding resource block are... Therefore, there exists There are [number] resource blocks. For the above resource blocks, the number of subcarriers is [number]. The cost of RB is Therefore, the number of effective carriers is Corresponding .

[0309] For the above scenario, a block interleaving method based on interline transformation and intraline transformation is adopted:

[0310] Step S1: Input data sequence Write by column List The line interleaver, gets Two-dimensional matrix ,in Indicates the number of redundancies.

[0311] Step S2: Based on the inter-row transformation index sequence For two-dimensional matrices Perform inter-row permutation, and replace the first row with the second row. Interline permutation to the first , and obtain the permuted two-dimensional matrix. The interline transition interval is... Therefore, the formula for generating the inter-row transformation index sequence is:

[0312] , .

[0313] Step S3: For the permuted two-dimensional matrix Perform parity permutations on each row to obtain a permuted two-dimensional matrix. .

[0314] Step S4: Read the permuted data matrix in row-wise order to obtain the read data sequence. In this example, the first row of the sequence... The elements are:

[0315]

[0316] Remove redundant bits from the sequence The interleaved sequence is obtained. .

[0317] The interleaving method of the permutation block interleaving provided in this embodiment has the following advantages:

[0318] It has a 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.

[0319] Example 7:

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

[0321] In this embodiment, the transformations used include inter-row transformation and intra-row transformation. Inter-row transformation is performed by generating an inter-row transformation index sequence based on a random sequence or pseudo-random sequence. Intra-row transformation is performed by calculating the offset of the cyclic offset based on the row index of the row where the basic unit to be offset is located. The size of the basic unit of the data sequence is 1 resource block.

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

[0323] For pilot schemes as , The subcarrier spacing is The frame structure. Bandwidth is... A 10% protection bandwidth is required, therefore the effective bandwidth is... The resources occupied by the corresponding resource block (RB) are... Therefore, it exists. One resource block.

[0324] For the above resource block, the number of subcarriers is The cost of RB is Therefore, the number of effective carriers is Corresponding .

[0325] For the above scenario, a block interleaving method based on interline transformation and intraline transformation is adopted:

[0326] Step S1: Input data sequence Write by column List The line interleaver, gets Two-dimensional matrix ,in Indicates the number of redundancies.

[0327] Step S2: Based on the inter-row transformation index sequence For two-dimensional matrices Perform inter-row permutation, and replace the first row with the second row. Interline permutation to the first , and obtain the permuted two-dimensional matrix. The interline transition interval is greater than... random numbers Therefore, the formula for generating the inter-row transformation index sequence is:

[0328] , .

[0329] Where k=1, whenever hour The value cannot be the same as If the numbers are the same, a new random number needs to be selected.

[0330] In this example, the first 16 random numbers of the generated inter-row permutation sequence The values ​​are 99, 101, 183, 117, 135, 165, 171, 102, 209, 191, 203, 293, 108, 161, and 172.

[0331] Step S3: For the permuted two-dimensional matrix The offset of each row is The cyclic offset, the offset amount is This yields an offset two-dimensional matrix. .

[0332] Step S4: Read the offset data matrix in row-wise order to obtain the read data sequence. The first part of the data sequence... The elements are:

[0333]

[0334] Remove redundant bits from the sequence The interleaved sequence is obtained. .

[0335] The interleaving method of the permutation block interleaving provided in this embodiment has the following advantages:

[0336] It has a 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.

[0337] Example 8:

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

[0339] In this embodiment, the transformations used include inter-row transformation and intra-row transformation. The inter-row transformation is performed by calculating the inter-row transformation index sequence based on the first matrix obtained after writing to the interleaver. The intra-row transformation is performed by performing intra-row permutation based on the intra-row permutation index sequence generated by the divisors of the column numbers of the first matrix. The basic unit size of the data sequence is 1 resource block.

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

[0341] For pilot schemes as , The subcarrier spacing is The frame structure.

[0342] Bandwidth is A 10% protection bandwidth is required, therefore the effective bandwidth is... The resources occupied by the corresponding resource block (RB) are... Therefore, it exists. One resource block.

[0343] For the above resource block, the number of subcarriers is The cost of RB is Therefore, the number of effective carriers is Corresponding .

[0344] For the above scenario, a block interleaving method based on interline transformation and intraline transformation is adopted:

[0345] Step S1: Input data sequence Write by column List The line interleaver, gets Two-dimensional matrix .

[0346] in Indicates the number of redundancies.

[0347] Step S2: Based on the inter-row transformation index sequence For two-dimensional matrices Perform inter-row permutation, and replace the first row with the second row. Interline permutation to the first , and obtain the permuted two-dimensional matrix. .

[0348] The interline transformation interval is Therefore, the formula for generating the inter-row transformation index sequence is:

[0349] , .

[0350] Step S3: The interleaver has 8 columns N and divisors of 2 and 4. Choosing divisor 2 results in an even / odd transformation, as shown in Example 4. Here, divisor 4 is chosen for intra-row permutation. Intra-row permutations are performed in groups of 4 basic units. This involves transforming the two-dimensional matrix after inter-row transformation. Perform intra-group permutations on each row of the matrix, grouped in units of 4, to obtain a permuted two-dimensional matrix. .

[0351] Step S4: Read the permuted data matrix in row-wise order to obtain the read data sequence. In this example, the first row of the sequence... The elements are:

[0352]

[0353] Remove redundant bits from the sequence. The interleaved sequence is obtained. .

[0354] The permutation block interleaving method provided in this embodiment has the following advantages: 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.

[0355] Example 9:

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

[0357] In this embodiment, the transformations used include inter-row transformation and intra-row transformation. The inter-row transformation is performed by calculating the inter-row transformation index sequence based on the first matrix obtained after writing to the interleaver. The intra-row transformation is performed by grouping and permuting based on the divisors of the column numbers of the first matrix and cyclically shifting within the group. The basic unit size of the data sequence is 1 resource block.

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

[0359] For pilot schemes as , The subcarrier spacing is The frame structure. Bandwidth is... A 10% protection bandwidth is required, therefore the effective bandwidth is... The resources occupied by the corresponding resource block (RB) are... Therefore, it exists. There are [number] resource blocks. For the above resource blocks, the number of subcarriers is [number]. The cost of RB is Therefore, the number of effective carriers is Corresponding .

[0360] For the above scenario, a block interleaving method based on interline transformation and intraline transformation is adopted:

[0361] Step S1: Input data sequence Write by column List The line interleaver, gets Two-dimensional matrix ,in Indicates the number of redundancies.

[0362] Step S2: Based on the inter-row transformation index sequence For two-dimensional matrices Perform inter-row permutation, and replace the first row with the second row. Interline permutation to the first , and obtain the permuted two-dimensional matrix. The interline transition interval is... Therefore, the formula for generating the inter-row transformation index sequence is:

[0363] , .

[0364] Step S3: The interleaver has 8 columns N, and here we choose a divisor of 4 for grouping permutations. Within each row, grouping permutations are performed using 4 basic units as a group. That is, the two-dimensional matrix after inter-row transformation... Each row is grouped and permuted in units of 4, with an offset of within each group. The cyclic offset, the offset amount is This yields a permuted two-dimensional matrix. .

[0365] Step S4: Read the data matrix after row transformation in row order to obtain the read data sequence. In this example, the first row of the sequence... The elements are:

[0366]

[0367] Remove redundant bits from the sequence The interleaved sequence is obtained. .

[0368] The interleaving method of the permutation block interleaving provided in this embodiment has the following advantages:

[0369] It has a 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.

[0370] Example 10:

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

[0372] In this embodiment, the transformations used include inter-row transformation and intra-row transformation. The inter-row transformation is performed by calculating the inter-row transformation index sequence based on the first matrix obtained after writing to the interleaver. The intra-row transformation is performed by performing intra-row permutation based on the intra-row permutation index sequence generated by the pseudo-random sequence. The basic unit size of the data sequence is 1 resource block.

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

[0374] For pilot schemes as , The subcarrier spacing is The frame structure. Bandwidth is... A 10% protection bandwidth is required, therefore the effective bandwidth is... The resources occupied by the corresponding resource block (RB) are... Therefore, it exists. One resource block.

[0375] For the above resource block, the number of subcarriers is The cost of RB is Therefore, the number of effective carriers is Corresponding .

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

[0377] Step S1: Input data sequence Write by column List The line interleaver, gets Two-dimensional matrix ,in Indicates the number of redundancies.

[0378] Step S2: Based on the inter-row transformation index sequence For two-dimensional matrix Perform inter-row permutation, and replace the first row with the second row. Interline permutation to the first , and obtain the permuted two-dimensional matrix. The interline transition interval is... Therefore, the formula for generating the inter-row transformation index sequence is:

[0379] , .

[0380] Step S3: Perform row-wise transformations on the two-dimensional matrix. Intra-row permutation is performed based on the intra-row permutation index sequence generated from the pseudo-random sequence.

[0381] This is achieved by calculating a 3-bit pseudo-random binary PN sequence. value after conversion to octal , This yields a two-dimensional matrix after inline permutation. .

[0382] In this example, let the 3-bit binary PN sequence be (1,0,1,0,1,1,0,1,0,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0), which is converted to an octal sequence of (5, 3, 2, 6, 6, 5, 2, 2). When the octal number is repeated from the previous one, the index greater than the one that has not appeared before it is used as the replacement index for the current position. The corresponding inline replacement index sequence is (5, 3, 2, 6, 7, 8, 4, 1).

[0383] Step S4: Read the data matrix after in-row permutation in row-by-row order to obtain the read data sequence. The first row of this sequence... The elements are:

[0384] Remove redundant bits from the sequence The interleaved sequence is obtained. .

[0385] The interleaving method of the permutation block interleaving provided in this embodiment has the following advantages:

[0386] It has a 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.

[0387] As shown in Figure 10, this application embodiment also provides a network device, including a processor 101 and a memory 102. The memory 102 is configured to store a computer program. When the computer program is executed by the processor 101, the processor 101 implements the interleaving method as described above.

[0388] As shown in Figure 11, this application embodiment also provides a user equipment, including a processor 111 and a memory 112. The memory 112 is configured to store a computer program. When the computer program is executed by the processor 111, the processor 111 implements the above-described deinterleaving method.

[0389] This application also provides a computer-readable storage medium including a computer program, which, when executed by a processor, causes the processor to implement any one of the methods.

[0390] In the above embodiments, implementation can be achieved, in whole or in part, through software, hardware, firmware, or any other combination thereof. When implemented in software, it can be implemented, in whole or in part, as a computer program product. A computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the flow or function according to the embodiments of this application is generated. 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. For example, computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, digital subscriber line) or wireless (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that integrates one or more available media. Available media can be magnetic media (e.g., floppy disks, hard disks, magnetic tapes), optical media (e.g., digital video discs (DVDs)), or semiconductor media (e.g., solid-state drives (SSDs)).

[0391] Those skilled in the art will recognize that the units and algorithm steps of the examples 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 implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

Claims

1. An interleaving method, comprising: Obtain the first data sequence and write the first data sequence into the interleaver in sequence to obtain the first matrix; The first matrix is ​​transformed to obtain the second matrix; The second matrix is ​​read out sequentially to obtain the second data sequence.

2. The interleaving method of claim 1, wherein, At least one of the first data sequence and the second data sequence uses at least one resource element as the basic unit.

3. The interlacing method according to claim 1, wherein, The process of writing the first data sequence into the interleaver includes: Write 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 interlacing method according to claim 1, wherein, The transformation process performed on the first matrix includes at least one of the following: Perform row transformations on the first matrix; Perform an inline transformation on the first matrix.

5. The interleaving method of claim 4, wherein, The row transformation of the first matrix includes: Perform row transformations on the first matrix according to the row transformation index sequence.

6. The interleaving method of claim 5, wherein, The inter-row transformation index sequence is calculated based on the first matrix; or the inter-row transformation index sequence is generated based on a random sequence or a pseudo-random sequence.

7. The interleaving method of claim 5, wherein, The step of performing inter-row transformation on the first matrix according to the inter-row transformation index sequence includes: The first matrix is ​​subjected to row-by-row transformations at specific intervals using the row-by-row transformation index sequence.

8. The interlacing method according to any one of claims 5 to 7, wherein, The formula for generating the inter-row transformation index sequence includes: ， ； wherein is the row index before the first matrix transformation, is a row index after the first matrix transformation, is the number of rows of the interleaver, It is the number of columns of the interleaver. It is the interval for performing line breaks; The step of performing inter-row transformation on the first matrix according to the inter-row transformation index sequence includes: The first matrix is ​​subjected to inter-row transformation using the aforementioned inter-row transformation index sequence, thereby transforming the first matrix into its first row... row transform to the first OK.

9. The interleaving method of claim 7 or 8, wherein, The formula for generating the interval is: ； Where M is the number of rows in the interleaver, N is the number of columns in the interleaver, and d is the interval for performing the row transformation.

10. The interleaving method of claim 4, wherein, The in-row transformation of the first matrix includes: Perform an inline transformation on the basic unit of the first matrix.

11. The interleaving method of claim 10, wherein, The inline transformation of the first matrix includes at least one of the following: Perform an inline permutation on the first matrix; Perform an inline offset on the first matrix.

12. The interleaving method of claim 11, wherein, The step of performing an in-row permutation on the first matrix includes: The basic units of the first matrix are permuted using an inline permutation index sequence.

13. The interleaving method of claim 12, wherein, The process of generating the inline permutation index sequence includes at least one of the following: The in-row permutation index sequence is generated according to the odd / even item permutation principle; The in-row permutation index sequence is generated based on the divisors of the column numbers of the first matrix; The in-row permutation index sequence is generated based on a random sequence or a pseudo-random sequence.

14. The interleaving method of claim 11, wherein, The in-row offset of the first matrix includes: The basic unit of the first matrix is ​​cyclically offset.

15. The interleaving method of claim 14, wherein, The offset of the cyclic offset is generated in at least one of the following ways: The offset amount of the cyclic offset is calculated based on the row index of the row containing the basic unit to be offset. The offset of the cyclic offset is generated based on at least one of the following: a random sequence, an extension of the random sequence, a pseudo-random sequence, and an extension of the pseudo-random sequence.

16. The interleaving method of claim 14 or 15, wherein, The formula for generating the offset of the cyclic offset includes: or ； wherein, or is the offset amount, is a row index of the first matrix after the offset, is the row index of the first matrix before the offset, and N is the column number of the interleaver.

17. The interleaving method of claim 1, wherein, Reading the second data sequence sequentially includes at least one of the following: Read the second data sequence in row order; Read the second data sequence in column order.

18. The interleaving method of claim 1, wherein, In the interleaver, the number of columns of the interleaver is calculated by the transport 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 within an orthogonal frequency division multiplexing (OFDM) symbol divided by the number of resource elements contained in each basic unit.

19. The interleaving method according to claim 1, further comprising, after writing the first data sequence sequentially into the interleaver: In response to a vacancy in the interleaver, redundant numbers are added; After obtaining the second data sequence, the process further includes: Remove the redundant numbers from the second data sequence.

20. A method for deinterlacing, comprising: The second data sequence after transmission through the channel is obtained, and the second data sequence is written into the deinterleaver in sequence to obtain the third matrix; Perform an inverse transformation on the third matrix to obtain the fourth matrix; The fourth matrix is ​​read out sequentially to obtain the first data sequence.

21. The deinterleaving method of claim 20, wherein, At least one of the first data sequence and the second data sequence uses at least one resource element as the basic unit.

22. The deinterleaving method of claim 20 wherein, The step of writing the second data sequence into the deinterleaver in sequence includes: Write the second data sequence into the deinterleaver in column order; or The second data sequence is written into the deinterleaver in row order.

23. The deinterleaving method of claim 20 wherein, The inverse transformation of the third matrix includes at least one of the following: Perform an inverse row transformation on the third matrix; Perform an inverse inline transformation on the third matrix.

24. The deinterleaving method of claim 23 wherein, The inverse transformation of the third matrix includes: Perform an inverse row transformation on the third matrix according to the inverse row transformation index sequence.

25. The deinterleaving method of claim 24, wherein, The inverse inter-row transform index sequence is calculated based on the third matrix; or the inverse inter-row transform index sequence is generated based on a random sequence or a pseudo-random sequence.

26. The deinterleaving method of claim 24 wherein, The step of performing an inverse row transformation on the third matrix according to the inverse row transformation index sequence includes: The inverse row transformation index sequence is used to perform an inverse row transformation on the third matrix at specific intervals.

27. A deinterleaving method according to any one of claims 24 to 26, wherein, The formula for generating the inverse inter-row transform index sequence includes: ， ； wherein is the row index after the third matrix inverse transformation, is the row index before the third matrix inverse transformation, is the number of rows of the deinterleaver, is the number of columns of the deinterleaver, It is the interval for performing inverse interline transformation; The step of performing an inverse row transformation on the third matrix according to the inverse row transformation index sequence includes: The third matrix is ​​subjected to an inverse row transformation using the aforementioned inverse row transformation index sequence, thereby transforming the third matrix into its first row. row transform to the first OK.

28. A deinterleaving method according to claim 26 or 27, wherein, The formula for generating the interval is: ； Where M is the number of rows in the deinterleaver, N is the number of columns in the deinterleaver, and d is the interval for performing the inverse row transformation.

29. The deinterleaving method of claim 23 wherein, The inverse inline transformation of the third matrix includes: Perform an inverse inline transformation on the basic units of the third matrix.

30. A deinterleaving method according to claim 29, wherein, The inverse inline transformation of the third matrix includes at least one of the following: Perform an inverse permutation within the third matrix; Perform in-row inverse offset on the third matrix.

31. A deinterleaving method according to claim 29, wherein, The in-row inverse permutation of the third matrix includes: The basic units of the third matrix are subjected to in-row inverse permutation using an in-row inverse permutation index sequence.

32. A deinterleaving method according to claim 31, wherein, The process of generating the in-row inverse permutation index sequence includes at least one of the following: The in-row inverse permutation index sequence is generated according to the odd-even item inverse permutation principle; The in-row inverse permutation index sequence is generated based on the divisors of the column numbers of the third matrix; The in-row inverse permutation index sequence is generated based on a random sequence or a pseudo-random sequence.

33. The deinterleaving method of claim 30 wherein, The in-row inverse offset of the third matrix includes: Perform an anti-cyclic offset or an anti-non-cyclic offset on the basic unit of the third matrix.

34. A deinterleaving method according to claim 33, wherein, The method for generating the offset of the anti-cyclic offset or the anti-non-cyclic offset includes at least one of the following: The offset amount of the reverse circular offset or the reverse non-circular offset is calculated based on the row index of the row where the basic unit to be offset is located. The offset of the anti-cyclic offset or the anti-non-cyclic offset is generated based on at least one of the following: a random sequence, an extension of the random sequence, a pseudo-random sequence, and an extension of the pseudo-random sequence.

35. A deinterleaving method according to claim 33 or 34, wherein, The formula for generating the offset of the anti-loop offset includes: or ； wherein, or is the offset amount, is a row index of the third matrix before the reverse circulation offset, is the row index of the third matrix after the reverse loop offset, and N is the column number of the deinterleaver.

36. The deinterleaving method of claim 20 wherein, Reading the fourth matrix sequentially includes at least one of the following: Read the fourth matrix in row order; Read the fourth matrix in column order.

37. The deinterleaving method of claim 20 wherein, In the deinterleaving unit, the number of columns of the deinterleaving unit is calculated by the transport 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 deinterleaving unit is not less than the number of basic units in the second data sequence; the number of basic units is the number of effective subcarriers used for data transmission within an orthogonal frequency division multiplexing (OFDM) symbol divided by the number of resource elements contained in each basic unit.

38. The deinterleaving method according to claim 20, further comprising, after writing the second data sequence sequentially into the deinterleaver: In response to a vacancy in the deinterleaver, redundant numbers are added; After obtaining the first data sequence, the process further includes: Remove the redundant numbers from the first data sequence.

39. An interleaver configured to interleave symbols within at least one Orthogonal Frequency Division Multiplexing (OFDM) symbol, comprising: The read / write unit is configured to acquire a first data sequence, write the first data sequence sequentially into the interleaving block, and generate a first matrix. The processing unit is configured to transform the first matrix generated by the read / write unit to generate a second matrix. The read / write unit is also configured to read out the second matrix to obtain the interleaved second data sequence.

40. A deinterleaving device configured to deinterleave symbols within at least one Orthogonal Frequency Division Multiplexing (OFDM) symbol, comprising: The read / write unit is configured to acquire the second data sequence after transmission through the channel, write the second data sequence sequentially into the deinterleaver, and generate a third matrix. The processing unit is configured to perform an inverse transformation on the third matrix generated by the read / write unit to generate a fourth matrix; The read / write unit is also configured to read out the fourth matrix to obtain the first data sequence after deinterleaving.

41. A computer-readable storage medium comprising a computer program that, when executed by a processor, causes the processor to perform the method as described in any one of claims 1-38.

Images