CN115277338A - A diagonal layered OFDM transmission method, storage medium and device - Google Patents

Abstract

A diagonalized layered OFDM transmission method, storage medium and device, which belong to the field of physical layer transmission of wireless communication. The invention solves the problems of insufficient anti-fading ability and limited communication caused by the peak-to-average ratio of the traditional OFDM method. The method of the invention converts a one-dimensional symbol sequence into a two-dimensional matrix, uses diagonal layering and then performs FFT operation on it, so that the peak-to-average ratio is reduced, and the energy is also more averaged through multiple operations under different layering rules. After the channel, the receiving end performs reverse restoration on the operation of the transmitting end, and finally restores a one-dimensional symbol sequence. The improved signal can improve the ability to resist channel fading while reducing the peak-to-average ratio, and solve the problem of limited communication. The method of the present invention can be applied to the field of physical layer transmission of wireless communication.

Description

A diagonal layered OFDM transmission method, storage medium and equipment

technical field

The invention belongs to the field of physical layer transmission of wireless communication, and in particular relates to a diagonal layered OFDM transmission method, storage medium and equipment.

Background technique

The development of the communication era from 3G to 5G is inseparable from the development of the OFDM communication system. As the most mainstream physical layer waveform, OFDM faces many challenges with the development of communication requirements. The OFDM system divides the frequency-selective channel into multiple orthogonal sub-channels, and each sub-channel can be regarded as an independent flat fading, which greatly reduces the inter-symbol interference. However, as the communication scene is increasingly accompanied by high mobility, This orthogonality is broken, introducing inter-carrier interference. Since the in-phase accumulation of multiple subcarriers will lead to instantaneous high peak value, the OFDM system is also accompanied by the communication limitation problem caused by the peak-to-average ratio.

To sum up, due to the two significant shortcomings of the traditional OFDM transmission mechanism, insufficient anti-fading capability and peak-average ratio, the application scenarios of communication are greatly limited. Therefore, it is necessary to improve the traditional OFDM transmission mechanism and design an OFDM transmission method with a more uniform energy distribution to resist channel fading while reducing the peak-to-average ratio.

Contents of the invention

The purpose of the present invention is to solve the problem of insufficient anti-fading ability and communication limitation caused by the peak-to-average ratio in the traditional OFDM method, and propose a diagonal layered OFDM transmission method, storage medium and equipment.

The technical scheme that the present invention takes for solving the problems of the technologies described above is:

A diagonal layered OFDM transmission method, the method specifically includes the following steps:

at the transmitter

Step 1. Express the symbol sequence d obtained after the data to be transmitted is modulated as d=[d ₀ ,d ₁ ,...,d _K-1 ] ^T , where d ₀ is the first symbol sequence d element, d ₁ is the second element in the symbol sequence d, and d _K-1 is the Kth element in the symbol sequence d;

Then arrange the elements in the symbol sequence d into a two-dimensional matrix D of M rows and N columns, satisfying MN=K;

Step 2: Diagonally stratify the two-dimensional matrix D, perform FFT transformation on the elements of each layer, and then use the FFT transformation result to replace the elements before the transformation to obtain the two-dimensional matrix B;

Step 3. Arrange the elements in the two-dimensional matrix B into a one-dimensional sequence b=[b ₀ ,b ₁ ,...,b _K-1 ] ^T , and after processing the one-dimensional sequence b, transmit the processing result through the channel to the receiver;

at the receiving end

Step 4. Express the one-dimensional sequence observed by the receiving end as b′=[b′ ₀ ,b′ ₁ ,...,b′ _K-1 ] ^T , and then reversely restore the sequence b′ to M rows and N columns The two-dimensional matrix B';

Step 5. Diagonalize and layer the two-dimensional matrix B′, perform IFFT transformation on the elements of each layer, and then use the IFFT transformation result to replace the elements before the transformation to obtain the two-dimensional matrix D′;

Step 6: Restore the two-dimensional matrix D' to a one-dimensional symbol sequence d'=[d' ₀ , d' ₁ ,...,d' _K-1 ] ^T .

Further, the two-dimensional matrix D is expressed as:

Among them, d _N-1 is the Nth element in the symbol sequence d, d _N is the N+1th element in the symbol sequence d, d _N+1 is the N+2th element in the symbol sequence d, d _2N-1 is the 2Nth element in the symbol sequence d, d _(M-1)N is the (M-1)N+1th element in the symbol sequence d, and d _(M-1)N+1 is the symbol The (M-1)N+2th element in sequence d.

Further, the specific process of the second step is:

Step 21, define the following (1) and (2) diagonal layering rules

(1) The elements on the main oblique line of the two-dimensional matrix D are regarded as one layer, and for any general oblique line, the elements on the general oblique line are also regarded as one layer;

(2) The elements on the sub-slash line of the two-dimensional matrix D are taken as one layer, and for any one sub-slash line, the elements on the sub-slash line are also taken as one layer;

Step 22, setting the number threshold of diagonalization layering;

Step two and three, initializing the two-dimensional matrix D as the initial matrix;

Step two or four, adopt the (1) layering rule to carry out diagonalization layering to the initial matrix; then perform FFT transformation on each layer obtained respectively, obtain the FFT transformation result corresponding to each layer, use the FFT transformation result of the current layer Replace the elements corresponding to the current layer in the initial matrix, and after all layers are replaced, use the replacement result as the updated initial matrix;

Judging whether the number of times of diagonalization layering reaches the set number threshold, if it does, use the updated initial matrix as the two-dimensional matrix B, if not, go to step 25;

Step two and five, adopt (2) kind of stratification rule to carry out diagonal stratification to the updated initial matrix, adopt the method of step two and four to process the diagonal stratification result, obtain the replacement result;

Judging whether the number of diagonalization layers reaches the set number threshold, if yes, use the replacement result as the two-dimensional matrix B, if not, use the replacement result as the initial matrix, and return to step 2 and 4.

Further, the specific process of the second step is:

Step 21, define the following (1) and (2) diagonal layering rules

(1) The elements on the main oblique line of the two-dimensional matrix D are regarded as one layer, and for any general oblique line, the elements on the general oblique line are also regarded as one layer;

(2) The elements on the sub-slash line of the two-dimensional matrix D are taken as one layer, and for any one sub-slash line, the elements on the sub-slash line are also taken as one layer;

Step 22, setting the number threshold of diagonalization layering;

Step two and three, initializing the two-dimensional matrix D as the initial matrix;

Step two or four, adopt the (2) layering rule to carry out diagonal layering to the initial matrix; then carry out FFT transformation to each obtained layer respectively, obtain the FFT transformation result corresponding to each layer, use the FFT transformation result of the current layer Replace the elements corresponding to the current layer in the initial matrix, and after all layers are replaced, use the replacement result as the updated initial matrix;

Judging whether the number of times of diagonalization layering reaches the set number threshold, if it does, use the updated initial matrix as the two-dimensional matrix B, if not, go to step 25;

Step 25, adopting the (1) stratification rule to carry out diagonal stratification to the updated initial matrix, adopting the method of step 2 or 4 to process the diagonal stratification result, and obtain the replacement result;

Judging whether the number of diagonalization layers reaches the set number threshold, if yes, use the replacement result as the two-dimensional matrix B, if not, use the replacement result as the initial matrix, and return to step 2 and 4.

Further, the processing of the one-dimensional sequence b is sequentially performing IFFT transformation, parallel-serial conversion and cyclic prefix insertion processing on the one-dimensional sequence b.

Further, the receiving end sequentially performs cyclic prefix removal, serial-to-parallel conversion, FFT transformation and channel equalization processing on the received signal to obtain the observed one-dimensional sequence.

Further, in step five, the two-dimensional matrix B' is diagonally layered, and the layering rules need to be reversely restored corresponding to the execution order of step two.

A storage medium stores at least one instruction, and the at least one instruction is loaded and executed by a processor to implement a diagonalized layered OFDM transmission method.

A diagonal layered OFDM transmission device, the device includes a processor and a memory, at least one instruction is stored in the memory, and the at least one instruction is loaded and executed by the processor to implement a diagonal layered layer OFDM transmission method.

The beneficial effects of the present invention are:

The present invention converts a one-dimensional symbol sequence into a two-dimensional matrix, utilizes diagonalization layering and then operates its FFT, so that the peak-to-average ratio is reduced, and the energy is more averaged through multiple operations under different layering rules. Afterwards, the receiving end reversely restores the operation of the transmitting end, and finally restores the one-dimensional symbol sequence.

The method of the present invention performs segmentation processing and energy averaging on the symbol sequence in advance through diagonalization and layering, and the improved signal can improve the ability to resist channel fading while reducing the peak-to-average ratio, and solves the problem of limited communication.

Description of drawings

Fig. 1 is a schematic diagram of the layering rules of the present invention;

FIG. 2 is a system model diagram of a transmitting end and a receiving end of a diagonalized layered OFDM transmission method of the present invention.

Detailed ways

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT 1. This implementation will be described with reference to FIG. 2 . A diagonal layered OFDM transmission method described in this embodiment, the method specifically includes the following steps:

at the transmitter

Step 1. Express the symbol sequence d obtained after the data to be transmitted is modulated as d=[d ₀ ,d ₁ ,...,d _K-1 ] ^T , where d ₀ is the first symbol sequence d element, d ₁ is the second element in the symbol sequence d, and d _K-1 is the Kth element in the symbol sequence d;

Then arrange the elements in the symbol sequence d into a two-dimensional matrix D of M rows and N columns, satisfying MN=K;

Step 2: Diagonally stratify the two-dimensional matrix D, perform FFT transformation on the elements of each layer, and then use the FFT transformation result to replace the elements before the transformation to obtain the two-dimensional matrix B;

Step 3. Arrange the elements in the two-dimensional matrix B into a one-dimensional sequence b=[b ₀ ,b ₁ ,...,b _K-1 ] ^T , and after processing the one-dimensional sequence b, transmit the processing result through the channel to the receiver;

Take the elements of the first row in the two-dimensional matrix B as b ₀ , b ₁ ,...,b _N-1 in the one-dimensional sequence b, and so on, take the elements of the Mth row in the two-dimensional matrix B as a b _KN ,b _K-N+1 ,...,b _K-1 in the dimension sequence b;

at the receiving end

Step 4. Express the one-dimensional sequence observed by the receiving end as b′=[b′ ₀ ,b′ ₁ ,...,b′ _K-1 ] ^T , and then reversely restore the sequence b′ (reverse restoration refers to The inverse process of arranging the elements in the two-dimensional matrix B into a one-dimensional sequence b) is a two-dimensional matrix B' of M rows and N columns;

Step 5. Diagonalize and layer the two-dimensional matrix B′, perform IFFT transformation on the elements of each layer, and then use the IFFT transformation result to replace the elements before the transformation to obtain the two-dimensional matrix D′;

Step 6: Restore the two-dimensional matrix D' with M rows and N columns into a one-dimensional symbol sequence d'=[d' ₀ , d' ₁ ,...,d' _K-1 ] ^T .

Specific embodiment 2: The difference between this embodiment and specific embodiment 1 is that the two-dimensional matrix D is expressed as:

Among them, d _N-1 is the Nth element in the symbol sequence d, d _N is the N+1th element in the symbol sequence d, d _N+1 is the N+2th element in the symbol sequence d, d _2N-1 is the 2Nth element in the symbol sequence d, d _(M-1)N is the (M-1)N+1th element in the symbol sequence d, and d _(M-1)N+1 is the symbol The (M-1)N+2th element in sequence d.

In this embodiment, the first element to the Nth element in the symbol sequence d are used as the first row of the two-dimensional matrix D, and the first element to the Nth element are respectively the elements of the first row and the first column and The elements in the Nth column of the first row, the N+1th element to the 2Nth element in the symbol sequence d are used as the second row of the two-dimensional matrix D, and the N+1th element to the 2Nth element are respectively The element in the first column of the second row and the element in the Nth column of the second row, and so on, the (M-1)N+1th element to the MNth element in the symbol sequence d are used as the second element of the two-dimensional matrix D The M row, the (M-1)N+1th element to the MNth element are respectively the element in the first column of the Mth row and the element in the Mth row and the Nth column.

Other steps and parameters are the same as those in Embodiment 1.

Specific Embodiment Three: This embodiment will be described with reference to FIG. 1 . The difference between this embodiment and the second embodiment is that the specific process of the second step is:

Step 21, define the following (1) and (2) diagonal layering rules

(1) The elements on the main oblique line of the two-dimensional matrix D are regarded as one layer, and for any general oblique line, the elements on the general oblique line are also regarded as one layer;

That is, under the layering rule of (1), the total number of layers obtained is equal to the sum of the number of main oblique lines and general oblique lines;

(2) The elements on the sub-slash line of the two-dimensional matrix D are taken as one layer, and for any one sub-slash line, the elements on the sub-slash line are also taken as one layer;

That is to say, under the layering rule of (2), the total number of layers obtained is equal to the sum of the number of subslashes and subslashes;

Step 22. Set the threshold value of the number of times of diagonalization layering; complete execution of the first (1) layering rule is called a diagonalization layering, and complete execution of the (2) layering rule is also called Performed a diagonal layering;

Step two and three, initializing the two-dimensional matrix D as the initial matrix;

Step two or four, adopt the (1) layering rule to carry out diagonalization layering to the initial matrix; then perform FFT transformation on each layer obtained respectively, obtain the FFT transformation result corresponding to each layer, use the FFT transformation result of the current layer Replace the elements corresponding to the current layer in the initial matrix, and after all layers are replaced, use the replacement result as the updated initial matrix;

Judging whether the number of times of diagonalization layering reaches the set number threshold, if it does, use the updated initial matrix as the two-dimensional matrix B, if not, go to step 25;

Step two and five, adopt (2) kind of stratification rule to carry out diagonal stratification to the updated initial matrix, adopt the method of step two and four to process the diagonal stratification result, obtain the replacement result;

That is, perform FFT transformation on each obtained layer respectively to obtain the corresponding FFT transformation result of each layer, use the FFT transformation result of the current layer to replace the elements corresponding to the current layer in the updated initial matrix, and after all the layers are replaced, Get the replacement result;

Judging whether the number of diagonalization layers reaches the set number threshold, if yes, use the replacement result as the two-dimensional matrix B, if not, use the replacement result as the initial matrix, and return to step 2 and 4.

In this embodiment, the threshold value of the number of times of diagonal layering can be set to one time, or can be set to multiple times, and the rules of two adjacent layers must be different.

Define D _m,n as the elements in row m+1 and column n+1 in matrix D, where m=0,1,...M-1; n=0,1,...N-1.

When M>N, the (1) stratification rule is:

Matrix D is a non-square matrix. When the element subscript m=n, that is, when the number of rows of the element is equal to the number of columns, this type of element forms a main oblique line, and the elements on the main oblique line are divided into one layer; the matrix D The elements in the first P rows are translated to the bottom of the matrix D in order to form a new matrix. At this time, the main slash elements of the new matrix are the general slash elements of the original matrix D, and the value range of P is P=1,2, ...M-1 (that is, when P=1, the elements in the first row of matrix D are translated to the bottom of matrix D to form a new matrix D ₁ , and the main oblique element of the new matrix D ₁ is a generic of the original matrix D The elements on the slash, that is, the main slash elements of the new matrix D ₁ are used as a layer of the original matrix D. When P=2, the elements of the first row in the matrix D ₁ (that is, the second row of the matrix D Row elements) are translated below the matrix D ₁ to form a new matrix D ₂ , and the main slash elements of the new matrix D ₂ are the elements on a general slash line of the original matrix D, that is, the main slash elements of the new matrix D ₂ The oblique line elements are used as a layer of the original matrix D, ... until the value of P traverses to P = 1, 2, ... M-1, and the elements on each pan-slash line of the matrix D are respectively obtained, that is, each point Floor).

When M>N, the (2) stratification rule is:

The matrix D is a non-square matrix. When the element subscript m+n=N+1, this type of element forms a subslash, and the elements on the subslash are divided into one layer; the elements of the first P rows in the matrix D are translated in turn After going below the matrix D, a new matrix is formed. At this time, the sub-slash elements of the new matrix are the sub-slash elements of the original matrix, and the value range of P is P=1,2,...M-1 (that is, when P =1, the elements in the first row of matrix D are translated to the bottom of matrix D to form a new matrix D′ ₁ , and the sub-slash elements of the new matrix D′ ₁ are elements on a sub-slash line of the original matrix D , that is, the subslash elements of the new matrix D′ ₁ are used as a layer of the original matrix D, and when P=2, the elements of the first row in the matrix D′ ₁ (that is, the elements of the second row of the matrix D) After shifting to the bottom of the matrix D′ ₁ , a new matrix D′ ₂ is formed, and the sub-slash elements of the new matrix D′ ₂ are the elements on a sub-slash line of the original matrix D, that is, the new matrix D′ ₂ The subslash elements of the matrix D are used as a layer of the original matrix D, ... until the value of P traverses to P=1, 2, ... M-1, and the elements on each sub-slash line of the matrix D are respectively obtained).

When M<N, the (1) stratification rule is:

Matrix D is a non-square matrix. When the element subscript m=n, that is, when the number of rows of the element is equal to the number of columns, this type of element forms a main oblique line, and the elements in the first P columns of matrix D are translated to the right of the matrix to form New matrix, now the main slash element of new matrix is the general slash element of former matrix, and the value range of P is P=1,2,...N-1 (when P=1, matrix D The elements in the first column are translated to the right of the matrix D to form a new matrix D″ ₁ , and the main slash elements of the new matrix D″ ₁ are the elements on a general slash line of the original matrix D, that is, the new matrix The main slash elements of D″ ₁ are used as a layer of the original matrix D. When P=2, the elements in the first column in the matrix D″ ₁ (that is, the elements in the second column of the matrix D) are translated to the right of the matrix D″ ₁ New matrix D″ ₂ is formed after the square, and the main oblique element of new matrix D″ ₂ is the element on a general oblique line of original matrix D, that is, the main oblique element of new matrix D″ ₂ is used as original A layer of the matrix D, ... until the value of P is traversed to P=1, 2, ... N-1, and the elements on each oblique line of the matrix D are respectively obtained, that is, each layer is obtained).

When M<N, the (2) stratification rule is:

The matrix D is a non-square matrix. When the element subscript m+n=M+1, this type of element forms a subslash, and the elements on the subslash are divided into one layer; the first P column elements in the matrix D are translated to The right side of the matrix D constitutes a new matrix. At this time, the sub-slash elements of the new matrix are the sub-slash elements of the original matrix, and the value range of P is P=1,2,...N-1 (that is, when P= When 1, the elements in the first column of matrix D are translated to the right of matrix D to form a new matrix D″′ ₁ , and the sub-slash element of the new matrix D″’ ₁ is a sub-slash line of the original matrix D elements, that is, the subslash elements of the new matrix D"' ₁ are used as a layer of the original matrix D, and when P=2, the elements in the first column of the matrix D"' ₁ (that is, the first column of the matrix D 2 columns of elements) to the right of matrix D″′ ₁ to form a new matrix D″′ ₂ , and the subslash elements of the new matrix D″′ ₂ are elements on a subslash line of the original matrix D, namely , take the subslash elements of the new matrix D″' ₂ as a layer of the original matrix D, ... until the value of P traverses to P=1, 2, ... N-1, and obtain each item of the matrix D respectively elements on the sub-generic slash).

When M=N, the (1) layering rule is:

The matrix D becomes a square matrix. At this time, the main slash elements correspond to the main diagonal elements of the square matrix, and the pan diagonal elements correspond to the pan diagonal elements of the square matrix.

When M=N, the (2) stratification rule is:

The matrix D becomes a square matrix. At this time, the sub-slash elements correspond to the sub-diagonal elements of the square matrix, and the sub-slash elements correspond to the sub-pan diagonal elements of the square matrix.

Other steps and parameters are the same as in the second embodiment.

Specific Embodiment 4: This embodiment will be described with reference to FIG. 1 . The difference between this embodiment and the second embodiment is that the specific process of the second step is:

Step 21, define the following (1) and (2) diagonal layering rules

(1) The elements on the main oblique line of the two-dimensional matrix D are regarded as one layer, and for any general oblique line, the elements on the general oblique line are also regarded as one layer;

That is, under the layering rule of (1), the total number of layers obtained is equal to the sum of the number of main oblique lines and general oblique lines;

(2) The elements on the sub-slash line of the two-dimensional matrix D are taken as one layer, and for any one sub-slash line, the elements on the sub-slash line are also taken as one layer;

That is to say, under the layering rule of (2), the total number of layers obtained is equal to the sum of the number of subslashes and subslashes;

Step 22. Set the threshold value of the number of times of diagonalization layering; complete execution of the first (1) layering rule is called a diagonalization layering, and complete execution of the (2) layering rule is also called Performed a diagonal layering;

Step two and three, initializing the two-dimensional matrix D as the initial matrix;

Step two or four, adopt the (2) layering rule to carry out diagonal layering to the initial matrix; then carry out FFT transformation to each obtained layer respectively, obtain the FFT transformation result corresponding to each layer, use the FFT transformation result of the current layer Replace the elements corresponding to the current layer in the initial matrix, and after all layers are replaced, use the replacement result as the updated initial matrix;

Judging whether the number of times of diagonalization layering reaches the set number threshold, if it does, use the updated initial matrix as the two-dimensional matrix B, if not, go to step 25;

Step 25, adopting the (1) stratification rule to carry out diagonal stratification to the updated initial matrix, adopting the method of step 2 or 4 to process the diagonal stratification result, and obtain the replacement result;

That is, perform FFT transformation on each obtained layer respectively to obtain the corresponding FFT transformation result of each layer, use the FFT transformation result of the current layer to replace the elements corresponding to the current layer in the updated initial matrix, and after all the layers are replaced, Get the replacement result;

Judging whether the number of diagonalization layers reaches the set number threshold, if yes, use the replacement result as the two-dimensional matrix B, if not, use the replacement result as the initial matrix, and return to step 2 and 4.

In this embodiment, the threshold value of the number of times of diagonal layering can be set to one time, or can be set to multiple times, and the rules of two adjacent layers must be different.

Other steps and parameters are the same as in the second embodiment.

Embodiment 5: This embodiment is different from Embodiment 3 or Embodiment 4 in that the processing of the one-dimensional sequence b is to sequentially perform IFFT transformation, parallel-serial conversion, and cyclic prefix insertion processing on the one-dimensional sequence b.

Other steps and parameters are the same as those in Embodiment 3 or 4.

Embodiment 6: This embodiment is different from Embodiment 5 in that the receiving end sequentially performs cyclic prefix removal, serial-to-parallel conversion, FFT transformation and channel equalization processing on the received signal to obtain the observed one-dimensional sequence .

Other steps and parameters are the same as those in Embodiment 5.

Embodiment 7: This embodiment differs from Embodiment 6 in that in step 5, the two-dimensional matrix B' is diagonally layered, and the layering rules need to be reversed according to the execution order of step 2.

Other steps and parameters are the same as those in Embodiment 6.

The layering rules in step 5 need to correspond to the execution order of step 2, perform reverse restoration, perform IFFT transformation on each layer separately, the transformed sequence replaces the original symbol sequence, and corresponds to the slash position where the original symbol sequence is located . The number of IFFT operations after this diagonalization and layering needs to be consistent with the number of executions of the transmitter in step 2, and the layering rules also need to correspond to the transmitter in step 2, and finally a matrix D' with M rows and N columns is obtained.

Embodiment 8: This embodiment is a storage medium, and at least one instruction is stored in the storage medium, and the at least one instruction is loaded and executed by a processor to realize the above-mentioned diagonal layered OFDM transfer method.

It should be understood that any method corresponding to the description herein may be provided as a computer program product, software or computerized method, which may include a non-transitory machine-readable medium having stored thereon instructions, which may be used to program computer systems, or other electronic devices. The storage medium may include, but not limited to, a magnetic storage medium, an optical storage medium; the magneto-optical storage medium includes: a read-only memory ROM, a random access memory RAM, an erasable programmable memory (for example, EPROM and EEPROM) and a flash memory layer; or Other types of media suitable for storing electronic instructions.

Specific Embodiment 9: This embodiment is a diagonally layered OFDM transmission device, the device includes a processor and a memory. It should be understood that any device including a processor and a memory described in the present invention may be included, and the device may also be Including other units and modules that perform display, interaction, processing, control, etc., and other functions through signals or instructions;

At least one instruction is stored in the memory, and the at least one instruction is loaded and executed by the processor to implement the diagonal layered OFDM transmission method.

Example

The present invention provides a diagonal layered OFDM system transmission method, the method specifically includes the following steps:

Step 1. Assuming that the modulated symbol sequence of the transmitted data is d=[d ₀ ,d ₁ ,...,d _K-1 ] ^T , arrange the one-dimensional symbol sequence into a matrix of M rows and N columns in order Two-dimensional form, and satisfy MN=K.

The arranged two-dimensional symbolic matrix D is expressed as

Step 2: Diagonally layer the symbol matrix in two-dimensional form. There are two layering rules. The first one divides its main oblique elements and pan oblique elements into different layers, and the second layering rule Layering is carried out according to sub-slashes and sub-slashes. The matrix elements of each layer are usually distributed in oblique lines. FFT transformation is performed on each layer respectively. The transformed sequence replaces the original symbol sequence and corresponds to the original The slash position where the symbol sequence is located. This FFT operation after diagonalization and layering can be performed once, or it can be repeated multiple times. The rules of the two adjacent layers must be different, and finally a new matrix B with M rows and N columns is formed.

Step 3. The transmitter arranges the two-dimensional matrix B into a one-dimensional sequence b=[b ₀ ,b ₁ ,...,b _K-1 ] ^T , performs IFFT transformation on it, and inserts the cyclic prefix after parallel-to-serial conversion , passed through the channel to the receiver.

Step 4: The receiving end performs cyclic prefix removal, serial-to-parallel conversion, FFT transformation and channel equalization to observe a one-dimensional sequence b'=[b' ₀ ,b' ₁ ,...,b' _K-1 ] ^T , reverse It is restored to a two-dimensional matrix B' with M rows and N columns.

Step 5. Diagonalize and stratify the two-dimensional symbol matrix. The stratification rules need to correspond to the execution order of step 2, perform reverse restoration, perform IFFT transformation on each layer, and replace the original symbols with the transformed sequence sequence, and corresponds to the slash position where the original symbol sequence is located. The number of IFFT operations after this diagonalization and layering needs to be consistent with the number of executions of the transmitter in step 2, and the layering rules also need to correspond to the transmitter in step 2, and finally a matrix D' with M rows and N columns is obtained.

Step 6: Restore the matrix D' of M rows and N columns to a one-dimensional symbol sequence d'=[d' ₀ ,d' ₁ ,...,d' _K-1 ] ^T in sequence.

The above calculation example of the present invention is only to describe the calculation model and calculation process of the present invention in detail, but not to limit the implementation of the present invention. For those of ordinary skill in the art, on the basis of the above description, other changes or changes in different forms can also be made, and all implementation modes cannot be exhaustively listed here. Obvious changes or modifications are still within the protection scope of the present invention.

Claims (9)

1. A diagonalized layered OFDM transmission method, comprising:

at the transmitting end

Step one, a symbol sequence d obtained by modulating data to be transmitted is expressed as d = [ d ]₀,d₁,...,d_K-1]^TWherein d is₀Is the 1 st element in the symbol sequence d, d₁Is the 2 nd element in the symbol sequence d, d_K-1Is the Kth element in the symbol sequence d;

then arranging elements in the symbol sequence D into a two-dimensional matrix D with M rows and N columns, and meeting the requirement that MN = K;

performing diagonalization and layering on the two-dimensional matrix D, performing FFT (fast Fourier transform) on elements of each layer, and replacing elements before the FFT by using an FFT result to obtain a two-dimensional matrix B;

step three, arranging the elements in the two-dimensional matrix B into a one-dimensional sequence B = [ B ]₀,b₁,...,b_K-1]^TAfter the one-dimensional sequence b is processed, transmitting a processing result to a receiving end through a channel;

at the receiving end

Step four, representing the one-dimensional sequence observed at the receiving end as b '= [ b'₀,b′₁,...,b′_K-1]^TReversely reducing the sequence B 'into a two-dimensional matrix B' with M rows and N columns;

fifthly, diagonalizing and layering the two-dimensional matrix B ', performing IFFT (inverse fast Fourier transform) on elements of each layer respectively, and replacing the elements before transformation by using an IFFT result to obtain a two-dimensional matrix D';

step six, reducing the two-dimensional matrix D ' into a one-dimensional symbol sequence D ' = [ D '₀,d′₁,...,d′_K-1]^T。

2. The diagonalized layered OFDM transmission method according to claim 1, wherein the two-dimensional matrix D is represented as:

wherein d is_N-1Is the Nth element in the symbol sequence d, d_NIs the (N + 1) th element in the symbol sequence d_N+1Is the N +2 th element in the symbol sequence d_2N-1Is the 2N element in the symbol sequence d_(M-1)NIs the (M-1) N +1 th element in the symbol sequence d_(M-1)N+1Is the (M-1) N +2 th element in the symbol sequence d.

3. The diagonalized layered OFDM transmission method according to claim 2, wherein the specific procedure in the second step is:

step two, defining the following diagonalization layering rules (1) and (2)

(1) Regarding elements on a main oblique line of the two-dimensional matrix D as a layer, regarding any oblique line, regarding the elements on the oblique line as a layer;

(2) Regarding elements on a sub-oblique line of the two-dimensional matrix D as a layer, regarding any sub-oblique line, regarding the elements on the sub-oblique line as a layer;

secondly, setting a threshold value of the number of diagonalization layering;

step three, initializing a two-dimensional matrix D as an initial matrix;

fourthly, diagonalizing and layering the initial matrix by adopting the layering rule of the step 1; respectively carrying out FFT (fast Fourier transform) on each obtained layer to obtain FFT results corresponding to each layer, replacing elements corresponding to the current layer in the initial matrix by using the FFT results of the current layer, and taking the replacement results as the updated initial matrix after all the layers are replaced;

judging whether the diagonal layering times reach a set time threshold, if so, taking the updated initial matrix as a two-dimensional matrix B, and if not, executing a fifth step;

step two, diagonalizing and layering the updated initial matrix by adopting the layering rule of the step (2), and processing a diagonalizing and layering result by adopting the method of the step two to obtain a replacement result;

and judging whether the diagonal layering times reach a set time threshold, if so, taking the replacement result as a two-dimensional matrix B, and if not, taking the replacement result as an initial matrix, and returning to the step two or four.

4. The diagonalized layered OFDM transmission method according to claim 2, wherein the specific procedure in the second step is:

step two, defining the following diagonalization layering rules (1) and (2)

(1) Regarding elements on a main oblique line of the two-dimensional matrix D as a layer, regarding any oblique line, regarding the elements on the oblique line as a layer;

(2) Regarding elements on a secondary oblique line of the two-dimensional matrix D as a layer, regarding any one secondary oblique line, regarding the elements on the secondary oblique line as a layer;

secondly, setting a threshold value of the number of diagonalization layering;

step two, initializing a two-dimensional matrix D as an initial matrix;

fourthly, diagonalizing and layering the initial matrix by adopting the layering rule (2); respectively carrying out FFT (fast Fourier transform) on each obtained layer to obtain FFT conversion results corresponding to each layer, replacing elements corresponding to the current layer in the initial matrix by using the FFT conversion results of the current layer, and taking the replacement results as the updated initial matrix after all the layers are replaced;

judging whether the diagonal layering times reach a set time threshold, if so, taking the updated initial matrix as a two-dimensional matrix B, and if not, executing a fifth step;

step two, diagonalizing and layering the updated initial matrix by adopting the layering rule of the step (1), and processing a diagonalizing and layering result by adopting the method of the step two to obtain a replacement result;

and judging whether the diagonal layering times reach a set time threshold, if so, taking the replacement result as a two-dimensional matrix B, and if not, taking the replacement result as an initial matrix, and returning to the step two or four.

5. The diagonalized layered OFDM transmission method according to claim 3 or 4, wherein the processing on the one-dimensional sequence b is to perform IFFT, parallel-to-serial conversion and cyclic prefix insertion on the one-dimensional sequence b in sequence.

6. The diagonalized layered OFDM transmission method according to claim 5, wherein the receiving end sequentially performs cyclic prefix removal, serial-to-parallel conversion, FFT transformation, and channel equalization on the received signal to obtain the observed one-dimensional sequence.

7. The diagonalized layered OFDM transmission method according to claim 6, wherein in the fifth step, diagonalized layering is performed on the two-dimensional matrix B', and a layering rule needs to perform inverse reduction corresponding to an execution sequence of the second step.

8. A storage medium having stored therein at least one instruction which is loaded and executed by a processor to implement a diagonalized layered OFDM transmission method according to one of claims 1 to 7.

9. A diagonalized layered OFDM transmission device, comprising a processor and a memory, wherein at least one instruction is stored in said memory and loaded and executed by said processor to implement a diagonalized layered OFDM transmission method according to one of the claims 1 to 7.

Images