CN113965442B - Symbol-oriented diagonalization wireless transmission method - Google Patents
Symbol-oriented diagonalization wireless transmission method Download PDFInfo
- Publication number
- CN113965442B CN113965442B CN202111223922.5A CN202111223922A CN113965442B CN 113965442 B CN113965442 B CN 113965442B CN 202111223922 A CN202111223922 A CN 202111223922A CN 113965442 B CN113965442 B CN 113965442B
- Authority
- CN
- China
- Prior art keywords
- matrix
- signal
- signal matrix
- diagonalization
- result
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 49
- 230000005540 biological transmission Effects 0.000 title claims abstract description 26
- 239000011159 matrix material Substances 0.000 claims abstract description 122
- 230000009466 transformation Effects 0.000 claims abstract description 54
- 230000008569 process Effects 0.000 claims abstract description 15
- 230000006798 recombination Effects 0.000 claims abstract description 13
- 238000005215 recombination Methods 0.000 claims abstract description 13
- 239000013598 vector Substances 0.000 claims description 45
- 238000006243 chemical reaction Methods 0.000 claims description 40
- 238000012545 processing Methods 0.000 claims description 22
- 230000008521 reorganization Effects 0.000 claims description 11
- 238000013507 mapping Methods 0.000 claims description 8
- 230000001131 transforming effect Effects 0.000 claims description 4
- 238000004891 communication Methods 0.000 abstract description 15
- 238000005562 fading Methods 0.000 abstract description 7
- 239000006185 dispersion Substances 0.000 abstract description 6
- 238000012935 Averaging Methods 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 4
- 230000006872 improvement Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000010485 coping Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000010363 phase shift Effects 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/26—Systems using multi-frequency codes
- H04L27/2601—Multicarrier modulation systems
- H04L27/2626—Arrangements specific to the transmitter only
- H04L27/2627—Modulators
- H04L27/2634—Inverse fast Fourier transform [IFFT] or inverse discrete Fourier transform [IDFT] modulators in combination with other circuits for modulation
- H04L27/2636—Inverse fast Fourier transform [IFFT] or inverse discrete Fourier transform [IDFT] modulators in combination with other circuits for modulation with FFT or DFT modulators, e.g. standard single-carrier frequency-division multiple access [SC-FDMA] transmitter or DFT spread orthogonal frequency division multiplexing [DFT-SOFDM]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/18—Phase-modulated carrier systems, i.e. using phase-shift keying
- H04L27/20—Modulator circuits; Transmitter circuits
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Discrete Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Digital Transmission Methods That Use Modulated Carrier Waves (AREA)
Abstract
A symbol-oriented diagonalization wireless transmission method and a system belong to the technical field of wireless communication. The invention solves the problem that the performance of the existing communication scheme against the time-frequency double-dispersion channel is poor. At a transmitting end, the invention forms a signal form with diagonalized symbol energy averaging characteristics by carrying out data recombination and Fourier transformation on the transformation matrix. At the receiving end, the original signal matrix can be recovered through the corresponding diagonalization inverse transformation process. The proposal of the invention realizes the symbol energy expansion of the signal through the diagonalization process, effectively compensates the time-frequency double-selectivity fading of the channel, greatly improves the anti-fading capability of the system and can obtain better error code performance. Meanwhile, the invention has good compatibility to the existing communication method. The invention can be applied to the technical field of wireless communication.
Description
Technical Field
The invention belongs to the technical field of wireless communication, and particularly relates to a symbol-oriented diagonalization wireless transmission method.
Background
In the technical field of wireless communication, a single carrier system and a multi-carrier system are used as the current mainstream communication system, and the advantages of the single carrier system and the multi-carrier system are different, so that the single carrier system and the multi-carrier system have application scenes. However, with increasing communication demands, the capability of the existing single-carrier and multi-carrier systems in coping with complex channel conditions gradually becomes insufficient, the performance under the time-frequency double-dispersion channel is still poor, and further improvement of the system communication reliability is limited. In recent years, researchers have extensively explored communication schemes with greater flexibility and robustness. With the deep research, the further improvement of the anti-fading performance of the system by signal energy expansion has research value.
Disclosure of Invention
The invention aims to solve the problem of poor performance of the prior communication scheme against a time-frequency double-dispersion channel, and provides a symbol-oriented diagonalization wireless transmission method.
The technical scheme adopted by the invention for solving the technical problems is as follows:
a symbol-oriented diagonalized wireless transmission method, the method comprising the steps of:
step C1, modulating 0 and 1 bit data generated by an information source to obtain a modulation result; then, the modulation result is subjected to serial-parallel conversion to generate N rows and M columns of signal matrixes;
step C2, respectively carrying out N-point inverse Fourier transform on each column of the signal matrix obtained in the step C1 to obtain an inverse Fourier transformed signal matrix;
step C3, diagonalizing the signal matrix obtained in the step C2 to obtain a diagonalized output signal matrix X T ；
Then to matrix X T Performing matrix inversion to obtain an inverted signal matrix;
the specific process of the step C3 is as follows:
step C31, marking the signal matrix obtained in the step C2 as X, and obtaining M vectors by extracting data of the matrix Xk＝0,1,...,M-1：
Wherein,is the p-th element in the k-th vector, x pq Elements representing row p, column q in matrix X, p=0, 1,..n-1, q=0, 1,..m-1;
step C32, respectively performing N-point inverse Fourier transform on each vector obtained in the step C31 to obtain a transformation result
k＝0,1,...,M-1
Wherein F is -1 [·]Representing inverse fourier transforms；
Step C33, for the transformation resultData recombination is carried out to obtain an output signal matrix X of N rows and M columns T ：
Wherein [ X ] T ] p,q Representing an output signal matrix X T The elements of row q and column p,representing the transformation result +.>P=0, 1,..n-1, q=0, 1,..m-1;
step C34, matrix X T Performing matrix inversion to obtain an inverted signal matrix;
step C4, diagonalizing the overturned signal matrix obtained in the step C3 to obtain an output signal matrix after double diagonalization;
step C5, performing parallel-serial conversion on the output signal matrix obtained in the step C4 after the double diagonalization treatment to obtain a path of serial signals;
sequentially performing digital-to-analog conversion and up-conversion on one path of serial signals, and transmitting the up-converted signals to a channel;
step C6, the signals reach a receiving end through the transmission of the channel, and the receiver sequentially performs down-conversion, analog-to-digital conversion and channel equalization on the received signals to obtain signal data after the channel equalization;
step C7, serial-parallel conversion is carried out on the signal data obtained in the step C6 after the channel equalization processing, and a signal matrix Y of N rows and M columns is generated R And for the generated signal matrix Y R Performing diagonalization inverse transformation to obtain diagonalizationInverse transforming the processed signal matrix;
step C8, performing matrix inversion on the diagonalized inverse transformation signal matrix obtained in the step C7 to obtain an inverted signal matrix;
then, diagonalizing inverse transformation is carried out on the turned signal matrix, and an output signal matrix after double diagonalization inverse transformation is obtained;
step C9, performing N-point Fourier transform on each column of the output signal matrix subjected to the double-diagonalization inverse transformation processing to obtain an output signal matrix subjected to the Fourier transform;
and step C10, performing parallel-to-serial conversion on the output signal matrix obtained in the step C9 after Fourier transformation to obtain one path of serial digital signals, and performing constellation demapping on the one path of serial digital signals to recover 0 and 1 bit data.
A symbol-oriented diagonalized wireless transmission method, the method comprising the steps of:
s1, modulating 0 and 1 bit data generated by an information source, and then carrying out serial-parallel conversion on a modulation result to generate a signal matrix of N rows and M columns;
s2, respectively performing N-point inverse Fourier transform on each column of the signal matrix generated in the step S1 to obtain N rows and M columns of signal matrices X;
step S3, diagonalizing the signal matrix X obtained in the step S2 to obtain a diagonalized output signal X T ；
The specific process of the step S3 is as follows:
step S31, extracting data from the signal matrix X to obtain M vectorsk＝0,1,...,M-1；
Wherein,represents the p-th element in the kth vector, (q-p) mod m=k represents the remainder of (q-p) divided by M as k, x pq Elements representing row p, column q in signal matrix X, p=0, 1,..n-1, q=0, 1,..m-1;
s32, respectively performing N-point inverse Fourier transform on the M extracted vectors to obtain transformation results of the extracted vectorsk＝0,1,...,M-1：
Step S33, transforming result X of each extracted vector 1 k Data recombination is carried out to obtain a path of serial signal X T ：
Wherein [ X ] T ] Nq+p Representing serial signal X T In (c) the nq+p-th element,representation->P=0, 1,..n-1, q=0, 1,..m-1;
the obtained serial signal X T Namely, the output signal after diagonalization treatment;
s4, processing the output signal after the diagonalization processing, and transmitting the processed signal to a channel;
step S5, the receiver receives signals from the channels and processes the received signals to obtain processed signals Y R ；
Step S6, for the processed signal Y obtained in step S5 R Extracting data to obtain M vectorsk=0, 1,..m-1; then the extracted M vectors are respectively +.>k=0, 1,..m-1 performs an N-point fourier transform to obtain a transform result Y 1 k ，k＝0,1,...,M-1；
Step S7, respectively for the transformation results Y obtained in step S6 1 k K=0, 1, M-1 performs data reorganization to obtain a data reorganization resultk1＝0,1,...,M-1；
Data reorganization resultsThe p-th element of (a)>The method comprises the following steps:
wherein p=0, 1,..n-1;
step S8, recombining the results for each datak1 N-point fourier transform of M-1, yielding transform result Y, =0, 1 k1 ,k1＝0,1,...,M-1；
Step S9, converting the conversion result Y obtained in step S8 k1 K1=0, 1..m-1 is represented as a serial digital signal Y, y= [ Y 0 Y 1 … Y k1 … Y M-1 ] MN And then constellation demapping is carried out on the signal Y, and 0 and 1 bit data are recovered.
The beneficial effects of the invention are as follows: the invention designs a symbol-oriented diagonalization wireless transmission method for improving the performance of the existing communication method for resisting channel fading under a time-frequency double-dispersion channel. At the transmitting end, a signal form with diagonalized symbol energy averaging feature is formed by carrying out data recombination and Fourier transformation on the transformation matrix. At the receiving end, the original signal matrix can be recovered through the corresponding diagonalization inverse transformation process. The proposal of the invention realizes the symbol energy expansion of the signal through the diagonalization process, effectively compensates the time-frequency double-selectivity fading of the channel, greatly improves the anti-fading capability of the system and can obtain better error code performance. Meanwhile, the invention has good compatibility to the existing communication method.
The invention adopts diagonalization processing and inverse transformation technology, can improve the performance of the existing communication scheme against time-frequency double-dispersion channels, reduces the error rate of the system and realizes the improvement of the reliability of the wireless communication system.
Drawings
Fig. 1 is a block diagram of a transmitter system of a symbol-oriented diagonalized wireless transmission method according to a first embodiment of the present invention;
fig. 2 is a block diagram of a receiver system for a symbol-oriented diagonalized wireless transmission method according to a first embodiment of the present invention;
FIG. 3 is a flow chart of a diagonalization process in accordance with one embodiment of the present invention;
FIG. 4 is a flow chart of the diagonalization inverse transformation in accordance with a third embodiment of the invention;
fig. 5 is a block diagram of a transmitter system of a symbol-oriented diagonalized wireless transmission method according to a fourth embodiment of the present invention;
fig. 6 is a block diagram of a receiver system for a symbol-oriented diagonalized wireless transmission method according to a fourth embodiment of the present invention.
Detailed Description
Detailed description of the inventionthe present embodiment is described with reference to fig. 1, 2 and 3. The symbol-oriented diagonalization wireless transmission method in this embodiment specifically includes:
step C1, modulating 0 and 1 bit data generated by an information source to obtain a modulation result; then, the modulation result is subjected to serial-parallel conversion to generate N rows and M columns of signal matrixes;
step C2, respectively carrying out N-point inverse Fourier transform (IDFT) on each column of the signal matrix obtained in the step C1 to obtain an inverse Fourier transformed signal matrix;
step C3, diagonalizing the signal matrix obtained in the step C2 to obtain a diagonalized output signal matrix X T ；
Then to matrix X T Performing matrix inversion to obtain an inverted signal matrix;
the specific process of the step C3 is as follows:
step C31, marking the signal matrix obtained in the step C2 as X, and obtaining M vectors by extracting data of the matrix Xk＝0,1,...,M-1：
Wherein,is the p-th element in the k-th vector, x pq Elements representing row p, column q in matrix X, p=0, 1,..n-1, q=0, 1,..m-1;
step C32, respectively performing N-point inverse Fourier transform on each vector obtained in the step C31 to obtain a transformation result
k＝0,1,...,M-1
Wherein F is -1 [·]Representing an inverse fourier transform;
step C33, for the transformation resultData recombination is carried out to obtain an output signal matrix X of N rows and M columns T ：
Wherein [ X ] T ] p,q Representing an output signal matrix X T The elements of row q and column p,representing the transformation result +.>P=0, 1,..n-1, q=0, 1,..m-1;
step C34, matrix X T Performing matrix inversion to obtain an inverted signal matrix;
step C4, diagonalizing the overturned signal matrix obtained in the step C3 to obtain an output signal matrix after double diagonalization;
step C5, performing parallel-serial conversion on the output signal matrix obtained in the step C4 after the double diagonalization treatment to obtain a path of serial signals;
sequentially performing digital-to-analog conversion and up-conversion on one path of serial signals, and transmitting the up-converted signals to a channel;
step C6, the signals reach a receiving end through the transmission of the channel, and the receiver sequentially performs down-conversion, analog-to-digital conversion and channel equalization on the received signals to obtain signal data after the channel equalization;
step C7, serial-parallel conversion is carried out on the signal data obtained in the step C6 after the channel equalization processing, and a signal matrix Y of N rows and M columns is generated R And for the generated signal matrix Y R Performing diagonalization inverse transformation processing to obtain a signal matrix after diagonalization inverse transformation processing;
step C8, performing matrix inversion on the diagonalized inverse transformation signal matrix obtained in the step C7 to obtain an inverted signal matrix;
then, diagonalizing inverse transformation is carried out on the turned signal matrix, and an output signal matrix after double diagonalization inverse transformation is obtained;
step C9, performing N-point Fourier transform (DFT) on each column of the output signal matrix subjected to the double-diagonalization inverse transformation processing to obtain an output signal matrix subjected to the Fourier transform;
and step C10, performing parallel-to-serial conversion on the output signal matrix obtained in the step C9 after Fourier transformation to obtain one path of serial digital signals, and performing constellation demapping on the one path of serial digital signals to recover 0 and 1 bit data.
In the embodiment, at a transmitting end, the signal matrix is diagonalized twice along the main diagonal direction and the auxiliary diagonal direction; at the receiving end, the recombination of signal energy is realized by performing corresponding diagonalization inverse transformation. The proposal of the invention realizes the expansion and recovery of the signal energy by the symbol-oriented double diagonalization processing and inverse transformation technology, improves the average degree of the symbol energy, and can better compensate the channel fading under the condition of time-frequency double dispersion channel.
The second embodiment is different from the first embodiment in that: modulating the 0 and 1 bit data generated by the information source to obtain a modulation result; the method comprises the following steps:
and performing constellation mapping on the 0 and 1 bit data generated by the information source to obtain a modulation result after constellation mapping.
Other steps and parameters are the same as in the first embodiment.
The third embodiment will be described with reference to fig. 4. This embodiment differs from the first or second embodiment in that: in the step C7, the generated signal matrix Y R The diagonalization inverse transformation processing is carried out, which comprises the following steps:
step C71, for signal matrix Y R Extracting data to obtain M vectorsk＝0,1,...,M-1：
Wherein,represents the kth vector +.>P-th element of [ Y ] R ] p,q Representing a signal matrix Y R The p-th row and q-th column elements;
step C72, performing N-point Fourier transform on each vector obtained in the step C71 to obtain a transformation result Y 1 k ；
k＝0,1,...,M-1
Wherein F [. Cndot. ] represents a Fourier transform;
step C73, converting the result Y corresponding to M vectors 1 k Performing data recombination to obtain a data recombination matrix Y of N rows and M columns;
[Y] p,q ＝[Y 1 k ] p ,(q-p)modM＝k
wherein [ Y ]] p,q Elements representing the p-th row and q-th column in the data reassembly matrix Y, [ Y ] 1 k ] p Representing the transformation result Y 1 k P=0, 1,..n-1, q=0, 1,..m-1;
and taking the data reorganization matrix Y as a signal matrix after diagonalization inverse transformation processing.
Other steps and parameters are the same as in the first or second embodiment.
A fourth embodiment will be described with reference to fig. 5 and 6. The symbol-oriented diagonalization wireless transmission method in this embodiment specifically includes:
s1, modulating 0 and 1 bit data generated by an information source, and then carrying out serial-parallel conversion on a modulation result to generate a signal matrix of N rows and M columns;
the modulation mode is a phase shift keying (BPSK) mode;
step S2, respectively performing N-point inverse Fourier transform (IDFT) on each column of the signal matrix generated in the step S1 to obtain N rows and M columns of signal matrices X;
step S3, diagonalizing the signal matrix X obtained in the step S2 to obtain a diagonalized output signal X T ；
The specific process of the step S3 is as follows:
step S31, extracting data from the signal matrix X to obtain M vectorsk＝0,1,...,M-1；
Wherein,represents the p-th element in the kth vector, (q-p) mod m=k represents the remainder of (q-p) divided by M as k, x pq Elements representing row p, column q in signal matrix X, p=0, 1,..n-1, q=0, 1,..m-1;
s32, respectively performing N-point inverse Fourier transform on the M extracted vectors to obtain transformation results of the extracted vectorsk＝0,1,...,M-1：
Step S33, transforming the extracted vectorsData recombination is carried out to obtain a path of serial signal X T ：
Wherein [ X ] T ] Nq+p Representing serial signal X T In (c) the nq+p-th element,representation->P=0, 1,..n-1, q=0, 1,..m-1;
the obtained serial signal X T Namely, the output signal after diagonalization treatment;
s4, processing the output signal after the diagonalization processing, and transmitting the processed signal to a channel;
step S5, the receiver receives signals from the channels and processes the received signals to obtain processed signals Y R ；
Step S6, for the processed signal Y obtained in step S5 R Extracting data to obtain M vectorsk=0, 1,..m-1; then the extracted M vectors are respectively +.>k=0, 1,..m-1 performs an N-point fourier transform (DFT) to obtain a transform result Y 1 k ，k＝0,1,...,M-1；
Step S7, respectively for the transformation results Y obtained in step S6 1 k K=0, 1, M-1 performs data reorganization to obtain a data reorganization resultk1＝0,1,...,M-1；
Data reorganization resultsThe p-th element of (a)>The method comprises the following steps:
wherein p=0, 1,..n-1;
step S8, recombining the results for each datak1 N-point fourier transform of M-1, yielding transform result Y, =0, 1 k1 ,k1＝0,1,...,M-1；
Step S9, converting the conversion result Y obtained in step S8 k1 K1=0, 1..m-1 is represented as a serial digital signal Y, y= [ Y 0 Y 1 … Y k1 … Y M-1 ] MN And then constellation demapping is carried out on the signal Y, and 0 and 1 bit data are recovered.
The fifth embodiment is different from the fourth embodiment in that: the specific process of the step S1 is as follows:
performing constellation mapping on 0 and 1 bit data generated by an information source to obtain a modulation result after constellation mapping;
and performing serial-parallel conversion on the obtained modulation result to generate a signal matrix of N rows and M columns.
Other steps and parameters are the same as in the fourth embodiment.
The sixth embodiment is different from the fourth or fifth embodiment in that: in the step S4, the output signal after the diagonalization is sequentially subjected to digital-to-analog conversion and up-conversion.
Other steps and parameters are the same as those of the fourth or fifth embodiment.
Seventh embodiment, the present embodiment and the specific embodimentOne of the four to six modes is different: in the step S5, the received signal is subjected to down-conversion, analog/digital conversion and channel equalization in order to obtain a processed signal Y R 。
Other steps and parameters are the same as those of the fourth to sixth embodiments.
The eighth embodiment is different from one of the fourth to seventh embodiments in that: the M extracted vectorsk=0, 1..p-th element in M-1 is:
wherein,for the extracted vector->P=0, 1,..n-1, [ Y, R ] Nq+p for signal Y R Nq+p elements of (a).
Other steps and parameters are the same as in one of the fourth to seventh embodiments.
The ninth embodiment mode and the fourth to eighth embodiment modes are different from each other in that: in the step S32, N-point inverse fourier transforms are performed on the extracted M vectors, which specifically includes:
k＝0,1,...,M-1
wherein F is -1 [·]Representing an inverse fourier transform;
in the step S6, the M extracted vectors are respectivelyk=0, 1..m-1 performs an N-point fourier transform, which is specifically:
k＝0,1,...,M-1
the result is recombined for each data respectivelyk1 N-point fourier transform for M-1, which is specifically:
k1＝0,1,...,M-1
wherein F [. Cndot ] represents the Fourier transform.
Other steps and parameters are the same as those of the fourth to eighth embodiments.
The above examples of the present invention are only for describing the calculation model and calculation flow of the present invention in detail, and are not limiting of the embodiments of the present invention. Other variations and modifications of the above description will be apparent to those of ordinary skill in the art, and it is not intended to be exhaustive of all embodiments, all of which are within the scope of the invention.
Claims (9)
1. The symbol-oriented diagonalization wireless transmission method is characterized by comprising the following steps of:
step C1, modulating 0 and 1 bit data generated by an information source to obtain a modulation result; then, the modulation result is subjected to serial-parallel conversion to generate N rows and M columns of signal matrixes;
step C2, respectively carrying out N-point inverse Fourier transform on each column of the signal matrix obtained in the step C1 to obtain an inverse Fourier transformed signal matrix;
step C3, diagonalizing the signal matrix obtained in the step C2 to obtain a diagonalized output signal matrix X T ；
Then to matrix X T Performing matrix inversion to obtain an inverted signal matrix;
the specific process of the step C3 is as follows:
step C31, marking the signal matrix obtained in the step C2 as X, and obtaining M vectors by extracting data of the matrix X
Wherein,is the p-th element in the k-th vector, x pq Elements representing row p, column q in matrix X, p=0, 1,..n-1, q=0, 1,..m-1;
step C32, respectively performing N-point inverse Fourier transform on each vector obtained in the step C31 to obtain a transformation result
k＝0,1,...,M-1
Wherein F is -1 [·]Representing an inverse fourier transform;
step C33, for the transformation resultData recombination is carried out to obtain output signals of N rows and M columnsMatrix X T ：
Wherein [ X ] T ] p,q Representing an output signal matrix X T The elements of row q and column p,representing the transformation result +.>P=0, 1,..n-1, q=0, 1,..m-1;
step C34, matrix X T Performing matrix inversion to obtain an inverted signal matrix;
step C4, diagonalizing the overturned signal matrix obtained in the step C3 to obtain an output signal matrix after double diagonalization;
step C5, performing parallel-serial conversion on the output signal matrix obtained in the step C4 after the double diagonalization treatment to obtain a path of serial signals;
sequentially performing digital-to-analog conversion and up-conversion on one path of serial signals, and transmitting the up-converted signals to a channel;
step C6, the signals reach a receiving end through the transmission of the channel, and the receiver sequentially performs down-conversion, analog-to-digital conversion and channel equalization on the received signals to obtain signal data after the channel equalization;
step C7, serial-parallel conversion is carried out on the signal data obtained in the step C6 after the channel equalization processing, and a signal matrix Y of N rows and M columns is generated R And for the generated signal matrix Y R Performing diagonalization inverse transformation processing to obtain a signal matrix after diagonalization inverse transformation processing;
step C8, performing matrix inversion on the diagonalized inverse transformation signal matrix obtained in the step C7 to obtain an inverted signal matrix;
then, diagonalizing inverse transformation is carried out on the turned signal matrix, and an output signal matrix after double diagonalization inverse transformation is obtained;
step C9, performing N-point Fourier transform on each column of the output signal matrix subjected to the double-diagonalization inverse transformation processing to obtain an output signal matrix subjected to the Fourier transform;
and step C10, performing parallel-to-serial conversion on the output signal matrix obtained in the step C9 after Fourier transformation to obtain one path of serial digital signals, and performing constellation demapping on the one path of serial digital signals to recover 0 and 1 bit data.
2. The symbol-oriented diagonalized wireless transmission method according to claim 1, wherein the modulation is performed on 0, 1-bit data generated by a source to obtain a modulation result; the method comprises the following steps:
and performing constellation mapping on the 0 and 1 bit data generated by the information source to obtain a modulation result after constellation mapping.
3. The symbol-oriented diagonalized wireless transmission method according to claim 2, wherein in said step C7, the generated signal matrix Y R The diagonalization inverse transformation processing is carried out, which comprises the following steps:
step C71, for signal matrix Y R Extracting data to obtain M vectors Y 0 k ,k＝0,1,...,M-1：
[Y 0 k ] p ＝[Y R ] p,q ,(q-p)mod M＝k
Wherein [ Y ] 0 k ] p Represents the kth vector Y 0 k P-th element of [ Y ] R ] p,q Representing a signal matrix Y R The p-th row and q-th column elements;
step C72, performing N-point Fourier transform on each vector obtained in the step C71 to obtain a transformation result Y 1 k ；
Y 1 k ＝F[Y 0 k ]
k＝0,1,...,M-1
Wherein F [. Cndot. ] represents a Fourier transform;
step C73, converting the result Y corresponding to M vectors 1 k Performing data recombination to obtain a data recombination matrix Y of N rows and M columns;
[Y] p,q ＝[Y 1 k ] p ,(q-p)modM＝k
wherein [ Y ]] p,q Elements representing the p-th row and q-th column in the data reassembly matrix Y, [ Y ] 1 k ] p Representing the transformation result Y 1 k P=0, 1,..n-1, q=0, 1,..m-1;
and taking the data reorganization matrix Y as a signal matrix after diagonalization inverse transformation processing.
4. The symbol-oriented diagonalization wireless transmission method is characterized by comprising the following steps of:
s1, modulating 0 and 1 bit data generated by an information source, and then carrying out serial-parallel conversion on a modulation result to generate a signal matrix of N rows and M columns;
s2, respectively performing N-point inverse Fourier transform on each column of the signal matrix generated in the step S1 to obtain N rows and M columns of signal matrices X;
step S3, diagonalizing the signal matrix X obtained in the step S2 to obtain a diagonalized output signal X T ；
The specific process of the step S3 is as follows:
step S31, extracting data from the signal matrix X to obtain M vectors
Wherein,represents the p-th element in the kth vector, (q-p) mod m=k represents the remainder of (q-p) divided by M as k, x pq Elements representing row p, column q in signal matrix X, p=0, 1,..n-1, q=0, 1,..m-1;
s32, respectively performing N-point inverse Fourier transform on the M extracted vectors to obtain transformation results of the extracted vectors
Step S33, transforming the extracted vectorsData recombination is carried out to obtain a path of serial signal X T ：
Wherein [ X ] T ] Nq+p Representing serial signal X T In (c) the nq+p-th element,representation->P=0, 1,..n-1, q=0, 1,..m-1;
the obtained serial signal X T Namely, the output signal after diagonalization treatment;
s4, processing the output signal after the diagonalization processing, and transmitting the processed signal to a channel;
step S5, the receiver receives signals from the channels and processes the received signals to obtain processed signals Y R ；
Step S6, for the processed signal Y obtained in step S5 R Extracting data to obtain M vectors Y 0 k K=0, 1,..m-1; then respectively for the extracted M vectors Y 0 k K=0, 1, M-1 performs an N-point fourier transform to obtain a transform result Y 1 k ，k＝0,1,...,M-1；
Step S7, respectively for the transformation results Y obtained in step S6 1 k K=0, 1, M-1 performs data reorganization to obtain a data reorganization result Y 2 k1 ,k1＝0,1,...,M-1；
Data reorganization result Y 2 k1 The p-th element [ Y ] 2 k1 ] p The method comprises the following steps:
[Y 2 k1 ] p ＝[Y 1 k ] p ,(k1-p)modM＝k
wherein p=0, 1, …, N-1;
step S8, recombining the result Y for each data 2 k1 K1=0, 1, …, M-1, and obtaining a transformation result Y k1 ,k1＝0,1,…,M-1；
Step S9, converting the conversion result Y obtained in step S8 k1 K1=0, 1, …, M-1 is expressed as a serial digital signal Y, y= [ Y ] 0 Y 1 … Y k1 … Y M-1 ] MN And then constellation demapping is carried out on the signal Y, and 0 and 1 bit data are recovered.
5. The symbol-oriented diagonalized wireless transmission method according to claim 4, wherein the specific procedure of the step S1 is as follows:
performing constellation mapping on 0 and 1 bit data generated by an information source to obtain a modulation result after constellation mapping;
and performing serial-parallel conversion on the obtained modulation result to generate a signal matrix of N rows and M columns.
6. The symbol-oriented diagonalized wireless transmission method according to claim 5, wherein in the step S4, the output signal after the diagonalization is sequentially subjected to digital/analog conversion and up-conversion.
7. The symbol-oriented diagonalized wireless transmission method according to claim 6, wherein in said step S5, the received signal is subjected to down-conversion, analog/digital conversion and channel equalization in order to obtain a processed signal Y R 。
8. The symbol-oriented diagonalized wireless transmission method according to claim 7, wherein said extracted M vectors Y 0 k The p-th element in k=0, 1, …, M-1 is:
[Y 0 k ] p ＝[Y R ] Nq+p ,(q-p)modM＝k
wherein [ Y ] 0 k ] p For the extracted vector Y 0 k P=0, 1,..n-1, [ Y, R ] Nq+p for signal Y R Nq+p elements of (a).
9. The symbol-oriented diagonalized wireless transmission method according to claim 8, wherein in the step S32, N-point inverse fourier transforms are performed on the extracted M vectors, respectively, which are specifically:
k＝0,1,...,M-1
wherein F is -1 [·]Representing an inverse fourier transform;
in the step S6, M vectors Y are extracted 0 k K=0, 1..m-1 performs an N-point fourier transform, which is specifically:
Y 1 k ＝F[Y 0 k ]
k＝0,1,...,M-1
the result Y is recombined for each data respectively 2 k1 K1=0, 1..m-1 performs an N-point fourier transform, which is specifically:
Y k1 ＝F[Y 2 k1 ]
k1＝0,1,...,M-1
wherein F [. Cndot ] represents the Fourier transform.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111223922.5A CN113965442B (en) | 2021-10-18 | 2021-10-18 | Symbol-oriented diagonalization wireless transmission method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111223922.5A CN113965442B (en) | 2021-10-18 | 2021-10-18 | Symbol-oriented diagonalization wireless transmission method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113965442A CN113965442A (en) | 2022-01-21 |
| CN113965442B true CN113965442B (en) | 2024-03-01 |
Family
ID=79465164
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111223922.5A Active CN113965442B (en) | 2021-10-18 | 2021-10-18 | Symbol-oriented diagonalization wireless transmission method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113965442B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108964731A (en) * | 2018-08-23 | 2018-12-07 | 哈尔滨工业大学 | Non-cycle prefix based on fast convolution filters mixed carrier continuous flow transmission method |
| CN112532351A (en) * | 2020-11-25 | 2021-03-19 | 哈尔滨工业大学 | Interleaving transmission method for weighted fractional Fourier transform frequency domain two-component signal |
| CN112532350A (en) * | 2020-11-25 | 2021-03-19 | 哈尔滨工业大学 | Interleaving transmission method for weighted fractional Fourier transform time domain two-component signal |
| CN112702298A (en) * | 2020-12-23 | 2021-04-23 | 哈尔滨工业大学 | OFDM signal transmission method for expanding mixed carrier wave precoding |
-
2021
- 2021-10-18 CN CN202111223922.5A patent/CN113965442B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108964731A (en) * | 2018-08-23 | 2018-12-07 | 哈尔滨工业大学 | Non-cycle prefix based on fast convolution filters mixed carrier continuous flow transmission method |
| CN112532351A (en) * | 2020-11-25 | 2021-03-19 | 哈尔滨工业大学 | Interleaving transmission method for weighted fractional Fourier transform frequency domain two-component signal |
| CN112532350A (en) * | 2020-11-25 | 2021-03-19 | 哈尔滨工业大学 | Interleaving transmission method for weighted fractional Fourier transform time domain two-component signal |
| CN112702298A (en) * | 2020-12-23 | 2021-04-23 | 哈尔滨工业大学 | OFDM signal transmission method for expanding mixed carrier wave precoding |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113965442A (en) | 2022-01-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112532351B (en) | Interleaving transmission method for weighted fractional Fourier transform frequency domain two-component signal | |
| CN109688082B (en) | Communication radar integrated system based on OFDM carrier joint optimization | |
| CN113206813B (en) | OFDM system peak-to-average power ratio suppression method based on improved selective mapping method | |
| CN112532350B (en) | Interleaving transmission method for weighted fractional Fourier transform time domain two-component signal | |
| CN114024811A (en) | OTFS waveform PAPR suppression method and device based on deep learning | |
| CN107222446B (en) | Large-scale MIMO-OFDM peak-to-average power ratio reduction system and method thereof | |
| CN110932766B (en) | Multi-carrier spatial modulation transmission method for reducing radio frequency switching times | |
| CN112714090A (en) | Transmission method of weighted fractional Fourier transform extended hybrid carrier | |
| CN101141167A (en) | Single carrier frequency domain equalization method and system in DFT-CDMA system | |
| CN111614595A (en) | F-TR peak-to-average ratio inhibition method based on energy efficiency optimization | |
| CN109391315B (en) | Data model dual-drive MIMO receiver | |
| CN112702298B (en) | OFDM signal transmission method for expanding mixed carrier wave precoding | |
| CN111786705B (en) | Precoding method, multi-carrier transmission method, transmitter, receiver and system | |
| CN113965442B (en) | Symbol-oriented diagonalization wireless transmission method | |
| CN110381003B (en) | Multi-user signal detection method aiming at peak-to-average ratio suppression in SCMA-OFDM system | |
| CN109525290A (en) | Real number feedback iteration channel estimation methods based on MIMO-FBMC system | |
| Liu et al. | Real-time implementation and evaluation of sdr-based deep joint source-channel coding | |
| CN101459648A (en) | Method for lowering PAR of OFDM system based on virtual carrier preservation algorithm | |
| CN113630353B (en) | Signal time-frequency energy complete-averaging transmission method based on extended weighted fractional Fourier transform | |
| CN114124637B (en) | Low-complexity method suitable for reducing peak-to-average ratio of OFDM (orthogonal frequency division multiplexing) system | |
| CN113098816B (en) | System and method for dual-mode three-dimensional OFDM index modulation algorithm | |
| CN113708881B (en) | Time-frequency complete averaging orthogonal multiple access transmission method based on extended weighted fractional Fourier transform | |
| CN106789822B (en) | Method and system for reducing peak-to-average power ratio of multi-user large-scale MIMO-OFDM system | |
| CN101764770B (en) | Channel equalization method and communication system thereof based on precoding | |
| Peng et al. | A novel PTS scheme for PAPR reduction of filtered-OFDM signals without side information |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |