CN109600195B

CN109600195B - Information interleaving method, information de-interleaving method and related device

Info

Publication number: CN109600195B
Application number: CN201710917431.8A
Authority: CN
Inventors: 张暄薇; 王加庆; 黄勤; 孙韶辉
Original assignee: China Academy of Telecommunications Technology CATT
Current assignee: China Academy of Telecommunications Technology CATT; Datang Mobile Communications Equipment Co Ltd
Priority date: 2017-09-30
Filing date: 2017-09-30
Publication date: 2020-09-25
Anticipated expiration: 2037-09-30
Also published as: CN109600195A; WO2019062829A1

Abstract

The invention provides an information interleaving method, an information de-interleaving method and a related device. The information interleaving method comprises the following steps: acquiring original bits of target information, wherein the original bits correspond to an original bit sequence of the target information; adding at least one wildcard character to an interleaving model for scrambling a sequence of original bits, wherein at least one wildcard character is not used as a start input position and an end input position of the interleaving model; inputting original bits into the interleaving model added with the wildcards; and acquiring scrambling bits of the target information output by the interleaving model after the wildcard is added, wherein the scrambling bits correspond to a bit sequence of scrambling the target information. The interleaving method of the invention can disturb the distance of adjacent bits after interleaving before interleaving, thereby realizing stronger burst error resistance. In addition, because the scheme of the invention only adds the wildcard characters in the original interweaving model, the complexity of the implementation of the scheme is low, the processing resources are not occupied, and the invention has high practicability.

Description

Information interleaving method, information de-interleaving method and related device

Technical Field

The present invention relates to the field of communications technologies, and in particular, to an information interleaving method, an information deinterleaving method, and a related apparatus.

Background

Interleaving coding is a communication technique for improving fading of mobile communication signals in an actual mobile communication environment. Burst errors in digital signal transmission are generated, and the burst errors can be dispersed and corrected by using an interleaving coding technique, thereby improving the transmission characteristics of mobile communication.

The purpose of interleaving coding is to de-align a long burst error into random errors and then to remove the random errors using a coding (FEC) technique that corrects the random errors. The larger the interleaving depth, the greater the dispersion and the stronger the burst error resistance. However, the larger the interleaving depth, the longer the interleaving encoding processing time, which results in the increase of data transmission delay, that is, the interleaving encoding is at the cost of time. Thus, interleaved coding belongs to time implicit diversity. Fading in an actual mobile communication environment will cause burst errors in digital signal transmission. Such burst errors can be dispersed and corrected using an interleaving coding technique, improving the transmission characteristics of mobile communications.

A common interleaver that performs interleaving coding is a block interleaver, which uses an interleaving matrix with rows and columns as an interleaving model, and writes bits of information in the row direction and reads them in the column direction, so that the bits are out of order in a random manner. However, the block interleaver has poor randomness at present, and cannot change the interval between any two bits in the original information, so the burst error resistance is very limited.

Of course, the block interleaver is only described as an example, and the interleaver of other interleaving models and the interleaving manner of the block interleaver are the same, which also causes the above problem.

Disclosure of Invention

The invention aims to provide an information interleaving method, an information de-interleaving method and a related device, which can obtain scrambled bits of target information with higher randomness, thereby improving the error correction performance.

The scheme of the invention has the following beneficial effects:

the interleaving method adds wildcard characters at the writing positions of the non-two ends of the interleaving model, so that original bits are not continuously written in the interleaving model, at least one wildcard character is inevitably inserted between the bits, and a scrambling bit output by the interleaving model can randomly scramble a gap between the original two bits of target information, namely the distance between adjacent bits after interleaving before interleaving is scrambled, thereby realizing stronger burst error resistance. In addition, because the scheme of the invention only adds the wildcard characters in the original interweaving model, the complexity of the implementation of the scheme is low, the processing resources are not occupied, and the invention has high practicability.

Drawings

Fig. 1 is a schematic flowchart of an information interleaving method according to an embodiment of the present invention;

fig. 2 is a schematic diagram illustrating a comparison between an information interleaving method provided in an embodiment of the present invention and a conventional information interleaving method;

fig. 3 is a carnot diagram used in practical application of the information interleaving method according to the embodiment of the present invention;

fig. 4 is a schematic diagram illustrating a comparison between an information interleaving method provided in an embodiment of the present invention and a conventional information interleaving method in practical application;

fig. 5 is a carnot diagram used in another practical application of the information interleaving method according to the embodiment of the present invention;

fig. 6 is a schematic diagram illustrating a comparison between an information interleaving method provided in an embodiment of the present invention and a conventional information interleaving method in another practical application;

fig. 7 is a flowchart illustrating an information deinterleaving method according to an embodiment of the present invention

Fig. 8 is a schematic logical structure diagram of an information interleaving apparatus according to an embodiment of the present invention;

fig. 9 is a schematic logical structure diagram of an information deinterleaving apparatus according to an embodiment of the present invention;

fig. 10 is a schematic diagram of an actual structure of an information interleaving apparatus according to an embodiment of the present invention;

fig. 11 is a schematic diagram of an actual structure of an information deinterleaving apparatus according to an embodiment of the present invention.

Detailed Description

In order to make the technical problems, technical solutions and advantages of the present invention more apparent, the following detailed description is given with reference to the accompanying drawings and specific embodiments. In the following description, specific details such as specific configurations and components are provided only to help the full understanding of the embodiments of the present invention. Thus, it will be apparent to those skilled in the art that various changes and modifications may be made to the embodiments described herein without departing from the scope and spirit of the invention. In addition, descriptions of well-known functions and constructions are omitted for clarity and conciseness.

It should be appreciated that reference throughout this specification to "one embodiment" or "an embodiment" means that a particular feature, structure or characteristic described in connection with the embodiment is included in at least one embodiment of the present invention. Thus, the appearances of the phrases "in one embodiment" or "in an embodiment" in various places throughout this specification are not necessarily all referring to the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.

In various embodiments of the present invention, it should be understood that the sequence numbers of the following processes do not mean the execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present invention.

The invention provides a solution for the problem that the existing block interleaver can not change the interval between any two bits in the original code word to cause the limited error correction performance.

In one aspect, an embodiment of the present invention provides an information interleaving method, as shown in fig. 1, including:

step 101, obtaining original bits (i.e. original bit stream) of target information, wherein the original bits correspond to an original bit sequence of the target information;

step 102, adding at least one wildcard character to an interleaving model for scrambling a sequence of original bits, wherein at least one wildcard character is not used as a starting input position and an ending input position of the interleaving model;

the interleaving model is not unique, and may be any existing interleaving mode, such as a sandwich interleaving matrix, an interleaving triangle, and the like.

Step 103, inputting original bits into the interleaving model added with the wildcards;

and 104, acquiring a scrambling bit of the target information output by the interleaving model after the wildcard is added, wherein the scrambling bit corresponds to a bit sequence scrambled by the target information.

In the interleaving method of the embodiment, wildcards are added at the writing positions at the non-two ends of the interleaving model, so that original bits are not continuously written in the interleaving model, and at least one wildcard is inevitably inserted between the bits, so that the scrambling bits output by the interleaving model can randomly scramble the gap between the original two bits of the target information, namely, the distance between adjacent bits after interleaving before interleaving is scrambled, thereby realizing stronger burst error resistance. In addition, because the scheme of the embodiment only adds the wildcard characters in the original interleaving model, the complexity of the implementation of the scheme is low, the processing resources are not occupied, and the method has high practicability.

The method of adding wildcards to the interleaving model in the present embodiment will be described in detail below.

Illustratively, when the step 102 is executed, the present embodiment specifically includes:

step 1021, determining the number of wildcards needing to be added to the interweaving model;

specifically, in this step, the number of wildcards that need to be added to the interleaving model may be determined according to a formula Δ N — T-N; wherein, T represents the maximum number of bits supported and received by the interleaving model, N represents the number of bits of the target information, and Δ N represents the number of wildcards needed to be added to the interleaving model.

Step 1022, determining the adding position of the interweaving model corresponding to the wildcard;

specifically, in this step, a set sequence may be generated, where the set sequence is composed of elements with values; and then mapping the adding position of the wildcard character to be added corresponding to the interweaving model according to the value of the element in the set sequence based on a preset mapping method. The method for generating the set sequence is not unique, and can be flexibly set according to actual requirements, for example, randomness is increased, and the set sequence can be determined in a random mode or a pseudo-random mode.

And step 1023, adding the wildcards of which the adding positions are determined to the interaction model.

By way of exemplary introduction, referring to fig. 2, an upper general block interleaver corresponds to an existing interleaving method (an interleaving model corresponding to the block interleaver is an interleaving matrix), and a lower wildcard block interleaver corresponds to the interleaving method of the present embodiment. The depth of the general block interleaver is consistent with that of the wildcard block interleaver, and the general block interleaver has 16 rows and 8 columns, and can provide input of 16 × 8-128 bits.

Assuming that the codeword of the current information is 100 bits as shown in fig. 2, after the 100 bit rows are input to a general block interleaver, based on the conventional interleaving method, 28 "×" are used to fill in the fixed position, thereby occupying the interleaving matrix together with the 100 bits in the target information.

While the wildcard block interleaver of the present embodiment uses 28 wildcards (i.e., the slash "\" in fig. 2) to add to the interleaving matrix in a random or pseudo-random manner and to fill the interleaving matrix with 100 bits in the target information.

Comparing the input results of two block interleaves, it can be known that, in the conventional interleaving method, since "+" is a fixed position, it is only a row input, a column output, and 100 bits after sequence scrambling are continuous, and the distance between 100 bits cannot be changed, so the scrambling degree is low.

The interleaving method of this embodiment may allow the wildcard to be inserted between 100 bits in the target information, and the 100 bits after the sequence scrambling are no longer continuous, wherein the distance between some bits may change, and thus, the interleaving method has a higher scrambling degree.

The steps 1021 to 1023 are exemplarily described below with reference to a practical application.

Illustratively, in this practical application, the interleaving model is assumed to be an interleaving matrix, and the interleaving matrix is composed of rows and columns.

Thus, T ═ W × D described above;

wherein, W is the depth of the interleaving matrix in the first direction, and D is the depth of the interleaving matrix in the second direction; the first direction and the second direction are different and are respectively one of a row direction and a column direction of the interlace matrix. For example, if the first direction is a row direction, the second direction is a column direction, the depth of the first direction is the number of rows of the interleaving matrix, and the depth of the second direction is the number of columns of the interleaving matrix; or if the first direction is the column direction, the second direction is the row direction, the depth of the first direction is the column number of the interleaving matrix, and the depth of the second direction is the row number of the interleaving matrix;

then, according to the interleaving matrix, a carnot diagram is generated, and the number of elements in the carnot diagram is required to be 2^x，W≤2^x(x is a positive integer) to match the interleaving matrix;

after determining the carnot graph, traversing all active elements in the carnot graph onceAnd orderly arranging all effective elements in the Carnot graph according to the traversal sequence to obtain a set sequence A { a }₀、a₁……、a_k－1}; wherein k is more than or equal to delta N, and the effective elements refer to elements with values less than W in the Carnot diagram;

after the set sequence a is determined, mapping an adding position of a wildcard based on the set sequence a, specifically including:

if D ≧ Δ N, then from set sequence A { a₀、a₁……、a_k－1In the method, delta N effective elements which correspond to wildcards needing to be added in an interleaving matrix one by one are selected to form a set B1{ B }₀、b₁……、b_ΔN－1Taking an effective sequence of an effective element corresponding to a wildcard needing to be added in a set B1 as an effective sequence of the wildcard in a first direction of the interleaving matrix, and taking a value of the effective element corresponding to the wildcard needing to be added as an effective sequence of the wildcard in a second direction of the interleaving matrix;

if D < Δ N, from the set sequence A { a }₀、a₁……、a_k－1D effective elements which are in one-to-one correspondence with part of wildcards needing to be added are sequentially selected to form a set B2{ B }₀、b₁……、b_D－1Taking an effective sequence of effective elements corresponding to the part of the wildcards in a set B2 as an effective sequence of the part of the wildcards in a first direction in the interleaving matrix, and taking a value of the effective elements corresponding to the part of the wildcards as an effective sequence of the part of the wildcards in a second direction in the interleaving matrix; and directly determining the effective sequences of the fixed other part of wildcards needing to be added in the first direction and the second direction in the interleaving matrix according to a preset protocol.

The following two implementations are combined to describe a method for determining wildcard addition positions based on a carnot diagram.

Implementation mode one

Assuming that the first direction of the interleaving matrix of the first implementation is a column direction and the depth W is 8 (i.e., 8 columns in total); the second direction is the row direction and the depth D is 7 (i.e. there are 7 rows in total).

First, a matching carnot graph is determined based on W ≦ 8 (i.e., 8 ≦ 2)^x) The carnot diagram is a binary representation, so that the carnot diagram shown in fig. 3 can be obtained;

then, based on a preset traversal rule, facilitating elements in the carnot diagram according to the sequence shown by an arrow in fig. 3 to obtain a set A {0, 4, 5, 1, 3, 7, 6, 2 }; it should be noted that the traversal order of fig. 3 is only used for exemplary presentation, and the actual feasible traversal order is not unique; the carnot diagram shown in fig. 3 is not the only solution for this practical application, but the carnot diagram may have more elements as other feasible solutions, and of course, 2 may be defined as a preferable solution^x-1＜W≤2^xSo that the number of elements of the carnot diagram is 2^xIs the minimum value larger than W, thereby reducing the complexity of the method as much as possible.

Assuming that the bit length of the target information binary is 51, the number Δ N of wildcards that need to be added is 7 × 8-51, which is 5, so D ≧ Δ N, 5 valid elements (elements less than 8) are sequentially selected from a {0, 4, 5, 1, 3, 7, 6, 2} as a set B1{0, 4, 5, 1, 3}, where the set B1 corresponds to the 5 added wildcards one-to-one;

the first added wildcard corresponds to 0 (with 0 as the starting ordered sequence) in the set B1, and the number of columns of the first wildcard in the interleaving matrix is 0+1, i.e. the first column, and the corresponding row is the valid sequence of "0" in B1, i.e. the first row;

the second added wildcard corresponds to 4 in the set B1, the number of columns of the first wildcard in the interleaving matrix is 4+1, i.e. the fifth column, and the corresponding number of rows is "4" in the valid sequence in B1, i.e. the second row;

the third added wildcard corresponds to 5 in the set B1, the number of columns of the second wildcard in the interleaving matrix is 5+1, i.e. the sixth column, and the corresponding number of rows is "5" of the valid sequence in B1, i.e. the third row;

the fourth added wildcard corresponds to 1 in the set B1, and the third wildcard has the number of columns in the interleaving matrix equal to 1+1, i.e. the second column, and the corresponding number of rows is "5" in the effective sequence in B1, i.e. the fourth row;

the fifth added wildcard corresponds to 3 in the set B1, the number of columns of the fourth wildcard in the interleaving matrix is 3+1, i.e. the fourth column, and the corresponding column is "5" in the valid sequence in B1, i.e. the fifth row;

after determining the positions of the 5 added wildcards in the interleaving matrix, referring to fig. 4, it is assumed that 51 bits in the target information in fig. 4 are input to the ordinary block interleaver of the related art and the wildcard block interleaver of the present embodiment, respectively, and the corresponding output results are as shown in fig. 4.

Implementation mode two

In the second implementation, the first direction of the interleaving matrix is assumed to be the column direction, and the depth W is 16 (i.e. 16 columns in total); the second direction is the row direction and the depth D is 4 (i.e. there are 4 rows in total).

First, a matching carnot graph is determined based on W ≦ 8 (i.e., W ≦ 2)^x) The carnot diagram is a binary representation, so that the carnot diagram shown in fig. 5 can be obtained;

then, based on a preset traversal rule, facilitating elements in the carnot diagram according to the sequence shown by an arrow in fig. 5 to obtain a set A {2, 0, 4, 6, 7, 5, 1, 3 }; it should be noted that the traversal order of fig. 5 is only used for exemplary presentation, and the actual traversal order is not unique. The carnot diagram shown in fig. 5 is not the only solution in this practical application, and as other feasible solutions, the carnot diagram may have more elements, and of course, as a preferred solution, 2 may be defined^x-1＜W≤2^xSo that the number of elements of the carnot diagram is 2^xIs the minimum value larger than W, thereby reducing the complexity of the method as much as possible.

Assuming that the bit length of the target information binary is 51, and the number Δ N of wildcards to be added is 4 × 16-51 — 13, that is, D < Δ N, so that from a {2, 0, 4, 6, 7, 5, 1, 3}, D is 4 effective elements (elements smaller than 8) are sequentially selected as a set B2{2, 0, 4, 6 }; the 13 wildcards to be added can be divided into a first part and a second part, wherein the first part comprises 4 wildcards and requires pseudo-random confirmation of the adding position; the second part comprises the remaining 9 wildcards, the corresponding add positions of which are determined by the protocol, so that this wildcard is a fixed position;

wherein the set B2 corresponds to the 4 wildcards of the first part one by one;

the first part of the first added wildcard corresponds to 2 in the set B2, and the number of columns of the first wildcard in the interleaving matrix is 0+2, i.e. the second column, and the corresponding row is the valid sequence of "0" in B1, i.e. the first row;

the first part of the second added wildcards corresponds to 0 in the set B1, the number of columns of the first wildcard in the interleaving matrix is 0+1, i.e. the first column, and the corresponding row number is "4", i.e. the second row, of the valid sequence in B1;

the first part, the third added wildcard corresponds to 4 in the set B1, the number of columns of the second wildcard in the interleaving matrix is 4+1, i.e. the fifth column, and the corresponding row number is "5", which is the effective sequence in B1, i.e. the third row;

the first part, the fourth added wildcard, corresponds to 6 in the set B1, the third wildcard has the number of columns in the interleaving matrix equal to 6+1, i.e. the seventh column, and the corresponding number of rows is "5", which is the valid sequence in B1, i.e. the fourth row.

Further, assuming that the preset protocol specifies that the 9 wildcards of the second part are the position of the last input interleave array, if the actual application is inputting in a row, the last interleave array with added wildcards can be obtained as shown in the lower part of fig. 6.

Referring to fig. 6, it is assumed that 51 bits of the target information in fig. 6 are input to the ordinary block interleaver of the related art and the wildcard block interleaver of the present embodiment, respectively, and the corresponding output results are as shown in fig. 6.

The above is an introduction to the information interleaving method of the present embodiment, and it should be noted that the above description is only used to exemplarily introduce the information interleaving method of the present embodiment, but not to limit the protection scope of the present invention. For example, the protocol may specify the addition position of the wildcard of the second part as the enlightenment position of the interleaving matrix input; as another example, the interleaving matrix of this embodiment may also output wildcards,

in summary, the interleaving method of the present embodiment has the following advantages:

1) the method is simple and easy to implement, and can be implemented on the conventional interleaving method and improve the performance.

2) Compared with the common block interleaver, the wildcard block interleaver has obviously improved performance, and avoids performance reduction on the 'bad point' that the performance of the common interleaver suddenly reduces in some input sequence lengths.

3) The interleaving method of the present embodiment can be applied not only to a block interleaver but also to an alien interleaver.

In practical application, the scrambled bits determined by the information interleaving method of the embodiment can be sent to a receiving end by a sending end through a network; for the receiving end, after the scrambled bits are received, the scrambled bits need to be restored to the original bits by using the same principle.

Correspondingly, another embodiment of the present invention further provides an information deinterleaving method for recovering scrambled bits of target information into original bits, as shown in fig. 7, including:

step 701, obtaining a scrambling bit of the target information, wherein the scrambling bit corresponds to a bit sequence scrambled by the target information;

step 702, adding at least one wildcard character to a deinterleaving model for recovering a sequence of scrambled bits, wherein at least one wildcard character is not used as a start input position and an end input position of the interleaving model;

the deinterleaving model may be the same as the interleaving matrix model, but the input direction is opposite, for example, if the interleaving model and the deinterleaving model are interleaving matrices, if the interleaving matrix is row input and row output, the deinterleaving matrix is row input and row output;

step 703, inputting the scrambled bits to the de-interleaving model after adding the wildcard;

step 704, obtaining the original bits of the target information output by the deinterleaving model after adding the wildcard, where the original bits correspond to the original bit sequence of the target information.

Obviously, the information deinterleaving method of the present embodiment corresponds to the information interleaving method provided by the present invention, and therefore, the processes of interleaving transmission and deinterleaving reading of the target information can be completed together.

The information deinterleaving method of the embodiment will be described in detail below.

Specifically, the step 702 of this embodiment includes:

step 7021, determining the number of wildcards to be added to the deinterleaving model;

in this step, the number of wildcards to be added to the interleaving model can be determined according to a formula Δ N ═ T-N; wherein T represents the maximum number of bits supported and received by the de-interleaving model, N represents the number of bits of the target information, and Δ N represents the number of wildcards required to be added to the de-interleaving model.

For example, assuming that the codeword of the current information has 98 bits, if the interleaving model is a 10 × 10 interleaving matrix, the 98 bits of the current information can be all input into the interleaving matrix, and the remaining two positions of the interleaving matrix can be supplemented by wildcards, i.e. the number of added wildcards is 2.

7022, determining an adding position of the wildcard corresponding to the deinterleaving model;

in this step, a set sequence may be generated, where the set sequence is composed of elements with values; and then mapping the adding position of the corresponding deinterleaving model of the wildcard needing to be added according to the value of the element in the set sequence based on a preset mapping method.

Step 7023, add the wildcard determined to be added to the deinterleaving model.

Thus, T ═ W × D described above; wherein, W is the depth of the interleaving matrix in the first direction, and D is the depth of the interleaving matrix in the second direction; the first direction and the second direction are different and are respectively one of a row direction and a column direction of the interlace matrix.

For example, if the first direction is a row direction, the second direction is a column direction, the depth of the first direction is the number of rows of the interleaving matrix, and the depth of the second direction is the number of columns of the interleaving matrix; or if the first direction is the column direction, the second direction is the row direction, the depth of the first direction is the column number of the interleaving matrix, and the depth of the second direction is the row number of the interleaving matrix;

after the carnot diagram is determined, traversing all effective elements in the carnot diagram once, and orderly arranging all effective elements in the carnot diagram according to the traversing sequence to obtain a set sequence A { a }₀、a₁……、a_k－1}; wherein k is more than or equal to delta N, and the effective elements refer to elements with values less than W in the Carnot diagram;

if D < Δ N, from the set sequence A { a }₀、a₁……、a_k－1In the method, D wildcards to be added to one part of the wild cards are selected in orderSymbol-to-symbol correspondence of effective elements constitutes set B2{ B₀、b₁……、b_D－1Taking an effective sequence of effective elements corresponding to the part of the wildcards in a set B2 as an effective sequence of the part of the wildcards in a first direction in the interleaving matrix, and taking a value of the effective elements corresponding to the part of the wildcards as an effective sequence of the part of the wildcards in a second direction in the interleaving matrix; and directly determining the effective sequences of the fixed other part of wildcards needing to be added in the first direction and the second direction in the interleaving matrix according to a preset protocol.

Obviously, the method for adding wildcards to the deinterleaving model in the present embodiment is the same as the method for adding wildcards to the interleaving model described above in principle, and thus the description is omitted here for example.

On the other hand, as shown in fig. 8, another embodiment of the present invention further provides an information interleaving apparatus 800, including:

a first obtaining module 801, configured to obtain original bits of target information, where the original bits correspond to an original bit sequence of the target information;

a first adding module 802, configured to surely add at least one wildcard to an interleaving model used for scrambling the sequence of the original bits, where at least one wildcard is not used as a start input position and an end input position of the interleaving model;

a second adding module 803, configured to input the original bits to the interleaving model after wildcard addition;

a second obtaining module 804, configured to obtain a scrambled bit of the target information output by the interleaving model after adding the wildcard, where the scrambled bit corresponds to a bit sequence in which the target information is scrambled.

Obviously, the information interleaving apparatus of the present embodiment corresponds to the information interleaving method provided in the present invention, and therefore, the technical effects that can be achieved by the information interleaving method can be achieved by the information interleaving apparatus of the present embodiment as well.

Specifically, on the basis, the first adding module 802 of the present embodiment includes:

a first determining unit, configured to determine the number of wildcards that need to be added to the interleaving model;

a second determining unit, configured to determine an adding position of the wildcard corresponding to the interleaving model;

and the adding unit is used for adding the wildcard which determines the adding position to the interweaving model.

The first determining unit determines the number of wildcards needing to be added to the interleaving model according to a formula delta N-T-N; in the formula, T represents the maximum number of bits supported and received by the interleaving model, N represents the number of bits of the target information, and Δ N represents the number of wildcards required to be added to the interleaving model.

Specifically, on the basis of the above, the second determination unit of the present embodiment includes:

the sequence generating unit is used for generating a set sequence, and the set sequence consists of elements with values;

and the mapping unit is used for mapping the adding position of the wildcard character to be added corresponding to the interweaving model according to the value of the element in the set sequence based on a preset mapping method.

Wherein the sequence generating unit may be configured to generate a carnot diagram, and select elements from the carnot diagram to form a set sequence.

Taking an interleaving model as an interleaving matrix as an example, T is W × D; wherein W is the depth of the interleaving matrix in the first direction, and D is the depth of the interleaving matrix in the second direction; the first direction and the second direction are different and are respectively one of a row direction and a column direction of the interleaving matrix.

Correspondingly, the sequence generating unit is specifically configured to:

generating a carnot diagram, the number of elements in the carnot diagram being 2^x，W≤2^xX is a positive integer;

traversing all effective elements in the Carnot graph once, and traversing the card according to the traversal sequenceAll effective elements in the nomogram are orderly arranged to obtain a set sequence A { a }₀、a₁……、a_k－1}; wherein k is more than or equal to delta N, and the effective elements are elements with values smaller than W in the Carnot diagram;

the mapping unit is specifically configured to:

if D ≧ Δ N, then from set sequence A { a₀、a₁……、a_k－1In the interleaving matrix, selecting delta N effective elements which are in one-to-one correspondence with wildcards needing to be added to the interleaving matrix to form a set B1{ B }₀、b₁……、b_ΔN－1Taking an effective sequence of an effective element corresponding to a wildcard needing to be added in a set B1 as an effective sequence of the wildcard in a first direction of the interleaving matrix, and taking a value of the effective element corresponding to the wildcard needing to be added as an effective sequence of the wildcard in a second direction of the interleaving matrix;

On the other hand, as shown in fig. 9, another embodiment of the present invention further provides an information deinterleaving apparatus 900, including:

a first obtaining module 901, configured to obtain a scrambling bit of target information, where the scrambling bit corresponds to a bit sequence in which the target information is scrambled;

a first adding module 902, configured to add at least one wildcard to a deinterleaving model for recovering the sequence of scrambled bits, where at least one wildcard is not used as a start input position and an end input position of the interleaving model;

a second adding module 903, configured to input the scrambled bits to the deinterleaving model after adding the wildcards;

a second obtaining module 904, configured to obtain original bits of the target information output by the wildcard added deinterleaving model, where the original bits correspond to an original bit sequence of the target information.

Obviously, the information restoring apparatus of the present embodiment corresponds to the information interleaving method provided in the present invention, and therefore the technical effects that can be achieved by the information restoring method can be achieved by the information restoring apparatus of the present embodiment as well.

Specifically, on the basis of the foregoing, the first adding module of the present embodiment includes:

a first determining unit, configured to determine the number of wildcards that need to be added to the deinterleaving model;

a second determining unit, configured to determine an adding position of the wildcard corresponding to the deinterleaving model;

and the adding unit is used for adding the wildcard which determines the adding position to the de-interleaving model.

By way of exemplary introduction, the first determining unit determines the number of wildcards to be added to the interleaving model according to a formula Δ N ═ T-N; wherein T represents the maximum number of bits supported and received by the interleaving model, N represents the number of bits of the target information, and Δ N represents the number of wildcards required to be added to the interleaving model.

The second determination unit includes:

and the mapping unit is used for mapping the adding position of the wildcard character to be added corresponding to the de-interlacing model according to the value of the element in the set sequence based on a preset mapping method.

Specifically, the sequence generating unit is configured to generate a carnot diagram, and select elements from the carnot diagram to form a set sequence.

Assuming that the interleaving model is an interleaving matrix, then T is W multiplied by D; wherein W is the depth of the interleaving matrix in the first direction, and D is the depth of the interleaving matrix in the second direction; the first direction and the second direction are different and are respectively one of a row direction and a column direction of the interleaving matrix.

The sequence generation unit is specifically configured to:

traversing all effective elements in the Carnot graph once, and orderly arranging all effective elements in the Carnot graph according to a traversal sequence to obtain a set sequence A { a }₀、a₁……、a_k－1}; wherein k is more than or equal to delta N, and the effective elements are elements with values smaller than W in the Carnot diagram;

the mapping unit is specifically configured to:

if D ≧ Δ N, then from set sequence A { a₀、a₁……、a_k－1In the interleaving matrix, selecting delta N effective elements which are in one-to-one correspondence with wildcards needing to be added to the interleaving matrix to form a set sequence B1{ B }₀、b₁……、b_ΔN－1Taking an effective sequence of an effective element corresponding to a wildcard needing to be added in a set B1 as an effective sequence of the wildcard in a first direction of the interleaving matrix, and taking a value of the effective element corresponding to the wildcard needing to be added as an effective sequence of the wildcard in a second direction of the interleaving matrix;

if D < Δ N, from the set sequence A { a }₀、a₁……、a_k－1D effective elements which correspond to part of wildcards needing to be added one by one are selected to form a set sequence B2{ B }₀、b₁……、b_D－1And taking the effective sequence of the effective elements corresponding to the wildcards of the part in the set B2 as the partEffective sequences of the divided wildcards in a first direction in the interleaving matrix, and taking the value of an effective element corresponding to one part of the wildcards as the effective sequences of the one part of the wildcards in a second direction in the interleaving matrix; and directly determining the effective sequences of the fixed other part of wildcards needing to be added in the first direction and the second direction in the interleaving matrix according to a preset protocol.

Furthermore, as shown in fig. 10, another embodiment of the present invention further provides an information interleaving apparatus 1000, which includes a processor 1001, a memory 1002, and a computer program 1003 stored on the memory 1002 and operable on the processor, and when executed by the processor, the computer program implements the following steps:

acquiring original bits of target information, wherein the original bits correspond to an original bit sequence of the target information;

adding at least one wildcard character to an interleaving model used for scrambling the sequence of the original bits, wherein at least one wildcard character is not used as a starting input position and an ending input position of the interleaving model;

inputting the original bits into an interleaving model added with wildcards;

and acquiring the scrambling bits of the target information output by the interleaving model after the wildcard is added, wherein the scrambling bits correspond to the bit sequence scrambled by the target information.

Specifically, the processor 1001 and the memory 1002 of the present embodiment are connected by a bus interface. The bus architecture of the bus interface may include any number of interconnected buses and bridges, with one or more processors represented by processor 1001 and various circuits of memory represented by memory 1002 being linked together. The bus architecture may also link together various other circuits such as peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further herein. The bus interface provides an interface.

The processor 1001 is responsible for managing the bus architecture and general processing, and the memory 1002 may store data used by the processor 1001 in performing operations.

Optionally, when the processor 1001 adds not less than one wildcard to the interleaving model for scrambling the sequence of the original bits, the method specifically includes the following steps:

determining the number of wildcards needed to be added to the interleaving model;

determining an adding position of a wildcard corresponding to the interweaving model;

and adding the wildcards determining the adding positions to the interweaving model.

Optionally, when the processor 1001 determines that the number of wildcards needed to be added to the interleaving model, the computer program specifically includes the following steps:

determining the number of wildcards needing to be added to the interleaving model according to a formula delta N-T-N;

wherein T represents the maximum number of bits supported and received by the interleaving model, N represents the number of bits of the target information, and Δ N represents the number of wildcards required to be added to the interleaving model.

Optionally, when the processor 1001 determines that the wildcard corresponds to the adding position of the interleaving model, the computer program specifically includes the following steps:

generating a set sequence, wherein the set sequence consists of elements with values;

and mapping the adding position of the wildcard character to be added corresponding to the interweaving model according to the value of the element in the set sequence based on a preset mapping method.

Optionally, the computer program is executed by the processor 1001 to generate a set sequence, where the set sequence is composed of elements with values, and the method specifically includes the following steps:

a carnot diagram is generated from which elements are selected to form a sequence of sets.

Optionally, the interleaving model is an interleaving matrix, and T is W × D; wherein W is the depth of the interleaving matrix in the first direction, and D is the depth of the interleaving matrix in the second direction; the first direction and the second direction are different and are respectively one of a row direction and a column direction of the interleaving matrix.

The computer program is executed by the processor 1001 to generate a carnot diagram, and when an element is selected from the carnot diagram to form a set sequence, the method specifically includes the following steps:

when the computer program is executed by the processor 1001 based on a preset mapping method, and maps an adding position of the interleaving model corresponding to a wildcard to be added according to a value of an element in the set sequence, the method specifically includes the following steps:

if D < Δ N, from the set sequence A { a }₀、a₁……、a_k－1D effective elements which are in one-to-one correspondence with part of wildcards needing to be added are sequentially selected to form a set B2{ B }₀、b₁……、b_D－1And taking an effective sequence of effective elements corresponding to the part of the wildcards in the set B2 as an effective sequence of the part of the wildcards in the first direction in the interleaving matrix, and taking the value of the effective elements corresponding to the part of the wildcards as the value of the part of the wildcards in the interleaving matrixAn effective sequence in a second direction in the interleaving matrix; and directly determining the effective sequences of the fixed other part of wildcards needing to be added in the first direction and the second direction in the interleaving matrix according to a preset protocol.

Furthermore, another embodiment of the present invention also provides a computer-readable storage medium having a computer program stored thereon, which when executed by a processor, implements the steps of:

inputting the original bits into an interleaving model added with wildcards;

Optionally, when the computer program is executed by a processor to add not less than one wildcard to an interleaving model for scrambling the sequence of the original bits, the method specifically includes the following steps:

Optionally, when the processor executes the pseudo-random determination to determine the number of wildcards to be added to the interleaving model, the method specifically includes the following steps:

Optionally, when the processor determines that the wildcard corresponds to the adding position of the interleaving model, the computer program specifically includes the following steps:

Optionally, the computer program is executed by a processor to generate a set sequence, where the set sequence is composed of elements with values, and the method specifically includes the following steps:

Optionally, the interleaving model is an interleaving matrix, and T ═ W × D; wherein W is the depth of the interleaving matrix in the first direction, and D is the depth of the interleaving matrix in the second direction; the first direction and the second direction are different and are respectively one of a row direction and a column direction of the interleaving matrix.

The computer program is executed by a processor to generate a carnot diagram, and when elements are selected from the carnot diagram to form a set sequence, the method specifically comprises the following steps:

when the computer program is executed by a processor based on a preset mapping method and maps the adding position of the wildcard needed to be added corresponding to the interleaving model according to the value of the element in the set sequence, the method specifically comprises the following steps:

Furthermore, as shown in fig. 11, another embodiment of the present invention further provides an information deinterleaving apparatus 1100, including a processor 1101, a memory 1102, and a computer program 1103 stored in the memory 1102 and operable on the processor, where the computer program, when executed by the processor, implements the following steps:

acquiring a scrambling bit of target information, wherein the scrambling bit corresponds to a bit sequence scrambled by the target information;

adding at least one wildcard character to a deinterleaving model for recovering the sequence of scrambled bits, wherein at least one wildcard character is not used as a start input position and an end input position of the interleaving model;

inputting the scrambled bits into a deinterleaving model added with wildcards;

and acquiring original bits of the target information output by the de-interleaving model after the wildcard is added, wherein the original bits correspond to an original bit sequence of the target information.

Specifically, the processor 1101 and the memory 1102 of the present embodiment are connected by a bus interface. The bus architecture of the bus interface may include any number of interconnected buses and bridges, with one or more processors, represented by processor 1101, and various circuits of memory, represented by memory 1102, being linked together. The bus architecture may also link together various other circuits such as peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further herein. The bus interface provides an interface.

The processor 1101 is responsible for managing the bus architecture and general processing, and the memory 1102 may store data used by the processor 1001 in performing operations.

Optionally, when the computer program is executed by the processor 1101 to add not less than one wildcard to a deinterleaving model for recovering the scrambled bit sequence, the method specifically includes the following steps:

determining the number of wildcards needed to be added to the deinterleaving model;

determining an adding position of a wildcard corresponding to the de-interlacing model;

and adding the wildcard determining the adding position to the de-interleaving model.

Optionally, when the computer program is executed by the processor 1101 to determine the number of wildcards that need to be added to the deinterleaving model, the method specifically includes the following steps:

wherein T represents the maximum number of bits supported and received by the de-interleaving model, N represents the number of bits of the target information, and Δ N represents the number of wildcards required to be added to the de-interleaving model.

Optionally, when the computer program is executed by the processor 1101 to determine the adding position of the wildcard corresponding to the deinterleaving model, the method specifically includes the following steps:

and mapping the adding position of the wildcard character to be added corresponding to the de-interlacing model according to the value of the element in the set sequence based on a preset mapping method.

Optionally, the computer program is executed by the processor 1101 to generate a set sequence, where the set sequence is composed of elements with values, and the method specifically includes the following steps:

The computer program executed by the processor 1101 generates a carnot diagram, and when an element is selected from the carnot diagram to form a set sequence, the method specifically includes the following steps:

when the above computer program is executed by the processor 1101, based on a preset mapping method, and the adding position of the deinterleaving model corresponding to the wildcard to be added is mapped according to the element in the set sequence, the method specifically includes the following steps:

if D < Δ N, from the set sequence A { a }₀、a₁……、a_k－1D effective elements which correspond to part of wildcards needing to be added one by one are selected to form a set sequence B2{ B }₀、b₁……、b_D－1Taking an effective sequence of effective elements corresponding to the part of the wildcards in a set B2 as an effective sequence of the part of the wildcards in a first direction in the interleaving matrix, and taking a value of the effective elements corresponding to the part of the wildcards as an effective sequence of the part of the wildcards in a second direction in the interleaving matrix; and directly determining the effective sequences of the fixed other part of wildcards needing to be added in the first direction and the second direction in the interleaving matrix according to a preset protocol.

Furthermore, another embodiment of the present invention also provides a computer-readable storage medium on which a computer program is stored, which when executed by a processor, implements the steps of:

inputting the scrambled bits into a deinterleaving model added with wildcards;

Optionally, when the processor executes a deinterleaving model for recovering the sequence of scrambled bits and adds not less than one wildcard, the method specifically includes the following steps:

Optionally, when the processor executes the pseudo-random determination to determine the number of wildcards to be added to the deinterleaving model, the method specifically includes the following steps:

Optionally, when the processor determines the adding position of the wildcard corresponding to the deinterleaving model, the computer program specifically includes the following steps:

Optionally, the computer program is executed by a processor to generate a set sequence, where the set sequence includes an element group having a value, and the method specifically includes the following steps:

when the computer program is executed by a processor based on a preset mapping method, and the adding position of the wildcard to be added corresponding to the deinterleaving model is mapped according to the elements in the set sequence, the method specifically includes the following steps:

if D < Δ N, from the set sequence A { a }₀、a₁……、a_k－1D effective elements which correspond to part of wildcards needing to be added one by one are selected to form a set sequence B2{ B }₀、b₁……、b_D－1And valid elements corresponding to wildcards of the part are valid in the set B2Taking the sequence as an effective sequence of the part of the wildcards in a first direction in the interleaving matrix, and taking the value of an effective element corresponding to the part of the wildcards as an effective sequence of the part of the wildcards in a second direction in the interleaving matrix; and directly determining the effective sequences of the fixed other part of wildcards needing to be added in the first direction and the second direction in the interleaving matrix according to a preset protocol.

Embodiments of the present invention are described with reference to flowchart illustrations and/or block diagrams of methods, apparatus, and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing terminal to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing terminal, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing terminal to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing terminal to cause a series of operational steps to be performed on the computer or other programmable terminal to produce a computer implemented process such that the instructions which execute on the computer or other programmable terminal provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

While preferred embodiments of the present invention have been described, additional variations and modifications of these embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all such alterations and modifications as fall within the scope of the embodiments of the invention.

It is further noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or terminal that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or terminal. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or terminal that comprises the element.

While the foregoing is directed to the preferred embodiment of the present invention, it will be understood by those skilled in the art that various changes and modifications may be made without departing from the spirit and scope of the invention as defined in the appended claims.

Claims

1. An information interleaving method, comprising:

inputting the original bits into an interleaving model added with wildcards;

acquiring scrambling bits of the target information output by the interleaving model after the wildcard is added, wherein the scrambling bits correspond to a bit sequence scrambled by the target information;

the step of adding not less than one wildcard to an interleaving model used to scramble the sequence of original bits comprises:

adding wildcards of which the adding positions are determined to the interweaving model;

the step of determining the adding position of the wildcard corresponding to the interweaving model comprises the following steps:

based on a preset mapping method, mapping the adding position of the wildcard character to be added corresponding to the interweaving model according to the value of the element in the set sequence;

generating a set sequence, the set sequence consisting of elements with values, comprising:

2. The information interleaving method according to claim 1,

the step of determining the number of wildcards that need to be added to the interleaving model comprises:

3. The information interleaving method according to claim 2,

the interleaving model is an interleaving matrix, and T is W multiplied by D; wherein W is the depth of the interleaving matrix in the first direction, and D is the depth of the interleaving matrix in the second direction; the first direction and the second direction are different and are respectively one of a row direction and a column direction of the interleaving matrix.

4. The information interleaving method according to claim 3,

generating a carnot diagram, the step of selecting elements from the carnot diagram to form a sequence of sets, comprising:

the step of mapping the adding position of the wildcard to be added corresponding to the interleaving model according to the value of the element in the set sequence based on the preset mapping method comprises the following steps:

if D < Δ N, from the set sequence A { a }₀、a₁……、a_k－1D wildcard symbols which are in one-to-one correspondence with a part of wildcard symbols needing to be added are sequentially selectedValid elements form set B2{ B₀、b₁……、b_D－1Taking an effective sequence of effective elements corresponding to the part of the wildcards in a set B2 as an effective sequence of the part of the wildcards in a first direction in the interleaving matrix, and taking a value of the effective elements corresponding to the part of the wildcards as an effective sequence of the part of the wildcards in a second direction in the interleaving matrix; and directly determining the effective sequences of the fixed other part of wildcards needing to be added in the first direction and the second direction in the interleaving matrix according to a preset protocol.

5. An information deinterleaving method, comprising:

inputting the scrambled bits into a deinterleaving model added with wildcards;

acquiring original bits of the target information output by the de-interleaving model after the wildcard is added, wherein the original bits correspond to an original bit sequence of the target information;

a step of adding not less than one wildcard to a deinterleaving model used to recover the sequence of scrambled bits, comprising:

adding wildcards of which the adding positions are determined to the de-interlacing model;

the step of determining the adding position of the wildcard corresponding to the deinterleaving model comprises the following steps:

based on a preset mapping method, mapping an adding position of the wildcard character to be added corresponding to the de-interlacing model according to the value of the element in the set sequence;

6. The information deinterleaving method according to claim 5,

the step of determining the number of wildcards to be added to the deinterleaving model comprises:

7. The information deinterleaving method according to claim 6,

8. The information deinterleaving method according to claim 7,

traversing all effective elements in the Carnot graph once and according to traversal ordersOrderly arranging all effective elements in the Carnot graph to obtain a set sequence A { a }₀、a₁……、a_k－1}; wherein k is more than or equal to delta N, and the effective elements are elements with values smaller than W in the Carnot diagram;

the step of mapping an adding position of the wildcard to be added corresponding to the deinterleaving model according to the element in the set sequence based on the preset mapping method comprises the following steps:

9. An information interleaving apparatus, comprising:

a first obtaining module, configured to obtain an original bit of target information, where the original bit corresponds to an original bit sequence of the target information;

a first adding module, configured to add at least one wildcard to an interleaving model for scrambling the sequence of original bits, where at least one wildcard is not used as a start input position and an end input position of the interleaving model;

a second adding module, configured to input the original bits to the interleaving model to which the wildcard is added;

a second obtaining module, configured to obtain a scrambling bit of the target information output by the interleaving model after adding the wildcard, where the scrambling bit corresponds to a bit sequence in which the target information is scrambled;

the first adding module comprises:

an adding unit, configured to add a wildcard character for which an adding position is determined to the interlace model;

the second determination unit includes:

a mapping unit, configured to map, based on a preset mapping method, an addition position of the wildcard to be added corresponding to the interleaving model according to a value of an element in the set sequence;

the sequence generating unit is used for generating a carnot diagram, and selecting elements from the carnot diagram to form a set sequence.

10. The information interleaving apparatus according to claim 9,

the first determining unit determines the number of wildcards needing to be added to the interleaving model according to a formula delta N-T-N;

11. The information interleaving apparatus according to claim 9,

12. The information interleaving apparatus according to claim 11,

the sequence generation unit is specifically configured to:

the mapping unit is specifically configured to:

if D < Δ N, from the set sequence A { a }₀、a₁……、a_k－1In the previous paragraph, sorting in orderD effective elements corresponding to a part of wildcards needing to be added are taken to form a set B2{ B }₀、b₁……、b_D－1Taking an effective sequence of effective elements corresponding to the part of the wildcards in a set B2 as an effective sequence of the part of the wildcards in a first direction in the interleaving matrix, and taking a value of the effective elements corresponding to the part of the wildcards as an effective sequence of the part of the wildcards in a second direction in the interleaving matrix; and directly determining the effective sequences of the fixed other part of wildcards needing to be added in the first direction and the second direction in the interleaving matrix according to a preset protocol.

13. An information deinterleaving apparatus, characterized by comprising:

a first obtaining module, configured to obtain a scrambling bit of target information, where the scrambling bit corresponds to a bit sequence in which the target information is scrambled;

a first adding module, configured to add at least one wildcard to a deinterleaving model for recovering the sequence of scrambled bits, where at least one wildcard is not used as a start input position and an end input position of the interleaving model;

a second adding module, configured to input the scrambled bits to the deinterleaving model after wildcard addition;

a second obtaining module, configured to obtain an original bit of the target information output by the deinterleaving model after adding the wildcard, where the original bit corresponds to an original bit sequence of the target information;

the first adding module comprises:

an adding unit, configured to add a wildcard determined to be an adding position to the deinterleaving model;

the second determination unit includes:

the mapping unit is used for mapping the adding position of the wildcard character to be added corresponding to the de-interlacing model according to the value of the element in the set sequence based on a preset mapping method;

14. The information deinterleaving apparatus according to claim 13,

15. The information deinterleaving apparatus according to claim 13,

16. The information deinterleaving apparatus according to claim 15,

the sequence generation unit is specifically configured to:

traversing all effective elements in the Carnot graph once, and orderly arranging all effective elements in the Carnot graph according to the traversal sequence to obtain a setSequence A { a₀、a₁……、a_k－1}; wherein k is more than or equal to delta N, and the effective elements are elements with values smaller than W in the Carnot diagram;

the mapping unit is specifically configured to:

17. An information interleaving apparatus comprising a processor, a memory, and a computer program stored on the memory and executable on the processor, wherein the computer program when executed by the processor implements the steps of:

inputting the original bits into an interleaving model added with wildcards;

18. A computer-readable storage medium, on which a computer program is stored, which program, when executed by a processor, performs the steps of:

inputting the original bits into an interleaving model added with wildcards;

19. An apparatus for deinterleaving information comprising a processor, a memory and a computer program stored in the memory and executable on the processor, wherein the computer program when executed by the processor performs the steps of:

inputting the scrambled bits into a deinterleaving model added with wildcards;

20. A computer-readable storage medium, on which a computer program is stored, which program, when executed by a processor, performs the steps of:

inputting the scrambled bits into a deinterleaving model added with wildcards;