CN113949488A - High-order frequency domain calculation diversity method based on multi-component expansion - Google Patents
High-order frequency domain calculation diversity method based on multi-component expansion Download PDFInfo
- Publication number
- CN113949488A CN113949488A CN202111209112.4A CN202111209112A CN113949488A CN 113949488 A CN113949488 A CN 113949488A CN 202111209112 A CN202111209112 A CN 202111209112A CN 113949488 A CN113949488 A CN 113949488A
- Authority
- CN
- China
- Prior art keywords
- data
- result
- frequency domain
- diversity
- length
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 43
- 238000004364 calculation method Methods 0.000 title claims abstract description 24
- 230000009466 transformation Effects 0.000 claims abstract description 20
- 238000012545 processing Methods 0.000 claims description 29
- 238000006243 chemical reaction Methods 0.000 claims description 12
- 239000011159 matrix material Substances 0.000 claims description 5
- 239000000654 additive Substances 0.000 claims description 3
- 230000000996 additive effect Effects 0.000 claims description 3
- 238000004891 communication Methods 0.000 abstract description 4
- 238000005562 fading Methods 0.000 abstract description 4
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012935 Averaging Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000001228 spectrum Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0041—Arrangements at the transmitter end
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0041—Arrangements at the transmitter end
- H04L1/0042—Encoding specially adapted to other signal generation operation, e.g. in order to reduce transmit distortions, jitter, or to improve signal shape
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0045—Arrangements at the receiver end
- H04L1/0047—Decoding adapted to other signal detection operation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0045—Arrangements at the receiver end
- H04L1/0047—Decoding adapted to other signal detection operation
- H04L1/005—Iterative decoding, including iteration between signal detection and decoding operation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0045—Arrangements at the receiver end
- H04L1/0047—Decoding adapted to other signal detection operation
- H04L1/005—Iterative decoding, including iteration between signal detection and decoding operation
- H04L1/0051—Stopping criteria
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/02—Arrangements for detecting or preventing errors in the information received by diversity reception
- H04L1/04—Arrangements for detecting or preventing errors in the information received by diversity reception using frequency diversity
-
- 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
Abstract
A high-order frequency domain calculation diversity method based on multi-component extension belongs to the technical field of wireless communication. The invention solves the problem of low diversity gain of the existing frequency domain calculation diversity method. The invention makes the energy distribution of the signal tend to average by carrying out multi-component expansion on the data and utilizing weighting transformation, so that the calculation diversity transmitting signal is averagely dispersed in a plurality of independently fading channels, thereby improving the diversity gain of the frequency domain calculation diversity 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 high-order frequency domain calculation diversity method based on multi-component expansion.
Background
In the field of wireless communication, the error rate performance of a calculation diversity algorithm can be effectively improved by prolonging the length of a data block and utilizing the residual available spectrum resources to perform frequency domain two-component calculation diversity. With the increase of the spreading length, the ratio of the resource length occupied by each data stream to the total resource length is further reduced, but from the aspect of energy-averaging distribution anti-fading, when the spreading transform length of the frequency-domain two-component calculation diversity is further increased, a single data block is taken as a research object, and the signals are still concentrated in the two data blocks, so that when the spreading transform length of the frequency-domain two-component calculation diversity is increased, the problem of low diversity gain of the frequency-domain calculation diversity exists, and the deep fading resistance of the frequency-domain two-component calculation diversity is weakened.
Disclosure of Invention
The invention aims to solve the problem of low diversity gain of the existing frequency domain calculation diversity method, and provides a high-order frequency domain calculation diversity method based on multi-component expansion.
The technical scheme adopted by the invention for solving the technical problems is as follows: a high-order frequency domain calculation diversity method based on multi-component extension specifically comprises the following steps:
generating original data D with the length of kL at a sending end, wherein L is the length of a code block, and k is a positive integer;
inputting a transformation order N, carrying out post zero filling operation on the original Data D according to the transformation order N to obtain zero filled Data, recording the zero filled Data as Data _ Z (1), wherein the total length of the zero filled Data is 2N*L；
Step two, performing multi-component expansion on the zero-padded data to obtain a multi-component expansion result;
the specific process of the second step is as follows:
step two, initializing the iteration number n of a sending end to be 1;
step two, starting from the first bit of the Data _ Z (n), dividing the zero-padded Data into 2N-nEach primary data block is 2 in lengthn*L；
After each primary Data block is processed, a processing result corresponding to each primary Data block is represented as a path of serial Data and is recorded as Data _ Z (n + 1);
step two, making n increase by 1, and repeating the process of step two;
stopping iteration until N is N +1, and taking Data _ Z (N +1) obtained in the last iteration as a multi-component expansion result;
step three, carrying out IFFT conversion on the multi-component expansion result to obtain an IFFT conversion result, and then transmitting the IFFT conversion result through an antenna;
step four, the receiving end receives the signal, and after carrying out equalization and FFT transformation on the received signal in sequence, an FFT transformation result is obtained; processing the FFT conversion result, and recording the processing result as Data _ R (1);
step five, processing the Data _ R (1) to obtain an output signal;
the concrete process of the step five is as follows:
fifthly, initializing the receiving end iteration times r as 1;
step two, starting from the first bit of Data _ R (r), dividing Data _ R (r) into 2rGroup data, each of which is 2 in lengthN-r*L；
Then, each group of Data is processed, the processing result corresponding to each group of Data is represented as a path of serial Data and is represented as Data _ R (R + 1);
step three, increasing r by 1 and repeating the process of the step two;
stopping iteration until r is equal to N, obtaining Data _ R (N) obtained in the last iteration, extracting front kL bit Data of the Data _ R (N), and taking the extracted Data as an output signal.
Further, the transformation order N is determined according to the length of the total extended resource, 2NL is the length of the total extended resource.
Further, the equalization and FFT transformation are performed on the received signal in sequence, and the specific process of equalization is as follows:
wherein Y is a signal received by the receiving end, G is an equalization matrix,
for the equalized signal, X is the signal transmitted by the transmitting end through the antenna, and H is the channel state informationAnd Z is zero-mean additive white Gaussian noise.
Further, the processing each primary data block respectively includes:
for any one primary data block:
wherein F (t) represents the data block data, x is the processing result of the data block, F (-t) represents the result obtained by data inversion of F (t), F (t) represents the result obtained by Fourier transform of the data block data, F (-t) represents the result obtained by data inversion of F (t),
is a transform coefficient;
the other primary data blocks are processed in the same way.
Further, the transform coefficients
Comprises the following steps:
where e is the base of the natural logarithm, i is the unit of the imaginary number, θlIs a characteristic value, l is 0,1,2, 3.
Further, in the fifth step, each group of data is processed respectively, and the specific process of processing is as follows:
for any set of data:
wherein x is1As a result of processing the set of data, f1(t) represents the set of data, f1(-t) denotes f1(t) data inversionObtained result, F1(t) results of Fourier transform of the set of data, F1(-t) denotes F1(t) the result obtained through the data inversion,
is a transform coefficient;
the other sets of data are processed in the same manner.
Further, the transform coefficients
Comprises the following steps:
further, the characteristic value θlThe relationship of (1) is:
wherein, thetal∈(0,2π]，l＝0,1,2,3。
The invention has the beneficial effects that: the invention provides a high-order frequency domain calculation diversity method based on multi-component expansion, which leads the energy distribution of signals to tend to be averaged by carrying out multi-component expansion on data and utilizing weighting transformation to lead the emission signals of the calculation diversity to be evenly dispersed in a plurality of independently fading channels, thereby improving the diversity gain of the frequency domain calculation diversity method.
Drawings
FIG. 1 is a flow chart of a high order frequency domain computational diversity method based on multi-component spreading according to the present invention;
in the figure, the position of the upper end of the main shaft,
a power of Z;
FIG. 2a is a comparison graph of energy distribution of double length data after first order frequency domain two-component computation diversity and second order frequency domain two-component computation diversity;
FIG. 2b is a graph comparing the energy distribution of data of three times length after first order frequency domain two-component computation diversity and second order frequency domain two-component computation diversity;
FIG. 2c is a graph comparing the energy distribution of quadruple length data after first order frequency domain two-component computation diversity and second order frequency domain two-component computation diversity;
fig. 3 is a graph of bit error rate comparison for first order frequency domain two-component computational diversity and second order frequency domain two-component computational diversity.
Detailed Description
The first embodiment is as follows: as shown in fig. 1. The method for calculating diversity in a high-order frequency domain based on multi-component extension in the present embodiment specifically includes the following steps:
generating original data D with the length of kL at a sending end, wherein L is the length of a code block, and k is a positive integer;
inputting a transformation order N, carrying out post zero filling operation on the original Data D according to the transformation order N to obtain zero filled Data, recording the zero filled Data as Data _ Z (1), wherein the total length of the zero filled Data is 2N*L，2N＞k；
Step two, performing multi-component expansion on the zero-padded data to obtain a multi-component expansion result;
the specific process of the second step is as follows:
step two, initializing the iteration number n of a sending end to be 1;
step two, starting from the first bit of the Data _ Z (n), dividing the zero-padded Data into 2N-nEach primary data block is 2 in lengthn*L；
After each primary Data block is processed, representing a processing result corresponding to each primary Data block as a path of serial Data (the position of the processing result corresponding to each primary Data block in the serial Data corresponds to the position of the original primary Data block in the zero-padded Data), and marking as Data _ Z (n + 1);
step two, making n increase by 1, and repeating the process of step two;
stopping iteration until N is N +1, and taking Data _ Z (N +1) obtained in the last iteration as a multi-component expansion result;
step three, carrying out IFFT conversion on the multi-component expansion result to obtain an IFFT conversion result, and then transmitting the IFFT conversion result through an antenna;
step four, the receiving end receives the signal, and after carrying out equalization and FFT transformation on the received signal in sequence, an FFT transformation result is obtained; processing the FFT conversion result, and recording the processing result as Data _ R (1);
step five, processing the Data _ R (1) to obtain an output signal;
the concrete process of the step five is as follows:
fifthly, initializing the receiving end iteration times r as 1;
step two, starting from the first bit of Data _ R (r), dividing Data _ R (r) into 2rGroup data, each of which is 2 in lengthN-r*L；
Then, each group of Data is processed, the processing result corresponding to each group of Data is represented as a path of serial Data and is represented as Data _ R (R + 1);
step three, increasing r by 1 and repeating the process of the step two;
stopping iteration until r is equal to N, obtaining Data _ R (N) obtained in the last iteration, extracting front kL bit Data of the Data _ R (N), and taking the extracted Data as an output signal.
The second embodiment is as follows: the first difference between the present embodiment and the specific embodiment is: the transformation order N is determined according to the length of the total extended resource, 2NL is the length of the total extended resource.
Other steps and parameters are the same as those in the first embodiment.
The third concrete implementation mode: the present embodiment differs from the first or second embodiment in that: the equalization and FFT transformation are sequentially carried out on the received signals, and the equalization specifically comprises the following processes:
wherein Y is a signal received by the receiving end, G is an equalization matrix,
for the equalized signal, X is the signal sent by the sending end through the antenna, H is the channel state information matrix, and Z is zero-mean additive white gaussian noise.
Other steps and parameters are the same as those in the first or second embodiment.
The fourth concrete implementation mode: the difference between this embodiment mode and one of the first to third embodiment modes is: the processing is performed on each primary data block, and specifically includes:
for any one primary data block:
wherein F (t) represents the data block data, x is the processing result of the data block, F (-t) represents the result obtained by data inversion of F (t), F (t) represents the result obtained by Fourier transform of the data block data, F (-t) represents the result obtained by data inversion of F (t),
is a transform coefficient;
the other primary data blocks are processed in the same way.
Other steps and parameters are the same as those in one of the first to third embodiments.
The fifth concrete implementation mode: the difference between this embodiment and one of the first to fourth embodiments is: the transform coefficient
Comprises the following steps:
where e is the base of the natural logarithm, i is the unit of the imaginary number, θlIs a characteristic value, l is 0,1,2, 3.
Other steps and parameters are the same as in one of the first to fourth embodiments.
The sixth specific implementation mode: the difference between this embodiment and one of the first to fifth embodiments is: in the second step, each group of data is processed respectively, and the specific process of processing is as follows:
for any set of data:
wherein x is1As a result of processing the set of data, f1(t) represents the set of data, f1(-t) denotes f1(t) result obtained by data inversion, F1(t) results of Fourier transform of the set of data, F1(-t) denotes F1(t) the result obtained through the data inversion,
is a transform coefficient;
the other sets of data are processed in the same manner.
In step four, the method of the present embodiment is also used when processing the FFT result.
Other steps and parameters are the same as those in one of the first to fifth embodiments.
The seventh embodiment: the difference between this embodiment and one of the first to sixth embodiments is: the transform coefficient
Comprises the following steps:
other steps and parameters are the same as those in one of the first to sixth embodiments.
The specific implementation mode is eight: the present embodiment differs from one of the first to seventh embodiments in that: the characteristic value thetalThe relationship of (1) is:
wherein, thetal∈(0,2π]，l＝0,1,2,3。
Other steps and parameters are the same as those in one of the first to seventh embodiments.
As shown in fig. 2a, 2b and 2c, the energy distribution diagrams of the data with the length of two times, three times and four times respectively after the data is subjected to first-order and second-order frequency domain two-component computation diversity (FDC-CD) respectively. No matter the proportion of the original data quantity to the total resource block is large, after the two-component calculation diversity transformation of the second-order frequency domain, each group of data can be uniformly distributed on the whole resource block, and the effect superior to the first-order diversity is realized. Thus, the total extension length is the original data code block length 2NAnd the optimal energy distribution can be completed only by N-order expansion FDC-CD at most by the multiplied data.
As shown in fig. 3, on the premise that the total spreading resource length is 4 times the original data code block length, when the original data percentage is 2/4, 3/4 or 4/4, the bit error rate performance of the second-order FDC-CD is improved compared with that of the first-order FDC-CD, and the smaller the original data percentage is, the larger the gain is.
The above-described calculation examples of the present invention are merely to explain the calculation model and the calculation flow of the present invention in detail, and are not intended to limit the embodiments of the present invention. It will be apparent to those skilled in the art that other variations and modifications of the present invention can be made based on the above description, and it is not intended to be exhaustive or to limit the invention to the precise form disclosed, and all such modifications and variations are possible and contemplated as falling within the scope of the invention.
Claims (8)
1. The method for calculating the diversity in the high-order frequency domain based on the multi-component extension is characterized by comprising the following steps:
generating original data D with the length of kL at a sending end, wherein L is the length of a code block, and k is a positive integer;
inputting a transformation order N, carrying out post zero filling operation on the original Data D according to the transformation order N to obtain zero filled Data, recording the zero filled Data as Data _ Z (1), wherein the total length of the zero filled Data is 2N*L；
Step two, performing multi-component expansion on the zero-padded data to obtain a multi-component expansion result;
the specific process of the second step is as follows:
step two, initializing the iteration number n of a sending end to be 1;
step two, starting from the first bit of the Data _ Z (n), dividing the zero-padded Data into 2N-nEach primary data block is 2 in lengthn*L；
After each primary Data block is processed, a processing result corresponding to each primary Data block is represented as a path of serial Data and is recorded as Data _ Z (n + 1);
step two, making n increase by 1, and repeating the process of step two;
stopping iteration until N is N +1, and taking Data _ Z (N +1) obtained in the last iteration as a multi-component expansion result;
step three, carrying out IFFT conversion on the multi-component expansion result to obtain an IFFT conversion result, and then transmitting the IFFT conversion result through an antenna;
step four, the receiving end receives the signal, and after carrying out equalization and FFT transformation on the received signal in sequence, an FFT transformation result is obtained; processing the FFT conversion result, and recording the processing result as Data _ R (1);
step five, processing the Data _ R (1) to obtain an output signal;
the concrete process of the step five is as follows:
fifthly, initializing the receiving end iteration times r as 1;
step two, starting from the first bit of Data _ R (r), dividing Data _ R (r) into 2rGroup data, each of which is 2 in lengthN-r*L；
Then, each group of Data is processed, the processing result corresponding to each group of Data is represented as a path of serial Data and is represented as Data _ R (R + 1);
step three, increasing r by 1 and repeating the process of the step two;
stopping iteration until r is equal to N, obtaining Data _ R (N) obtained in the last iteration, extracting front kL bit Data of the Data _ R (N), and taking the extracted Data as an output signal.
2. The method of claim 1, wherein the transform order N is determined according to the length of the total spreading resource, 2NL is the length of the total extended resource.
3. The method for the higher-order frequency domain calculation diversity based on the multi-component extension as claimed in claim 2, wherein the equalization and FFT transformation are sequentially performed on the received signal, and the specific process of equalization is as follows:
wherein Y is a signal received by the receiving end, G is an equalization matrix,
for the equalized signal, X is the signal sent by the sending end through the antenna, H is the channel state information matrix, and Z is zero-mean additive white gaussian noise.
4. The method of claim 3, wherein the processing each primary data block is specifically:
for any one primary data block:
wherein F (t) represents the data block data, x is the processing result of the data block, F (-t) represents the result obtained by data inversion of F (t), F (t) represents the result obtained by Fourier transform of the data block data, F (-t) represents the result obtained by data inversion of F (t),
is a transform coefficient;
the other primary data blocks are processed in the same way.
5. The method of claim 4, wherein the transform coefficients are based on a higher order frequency domain computation diversity method of multi-component extension
Comprises the following steps:
where e is the base of the natural logarithm, i is the unit of the imaginary number, θlIs a characteristic value, l is 0,1,2, 3.
6. The method according to claim 5, wherein in step five, each set of data is processed separately, and the specific process of processing is as follows:
for any set of data:
wherein x is1As a result of processing the set of data, f1(t) represents the set of data, f1(-t) denotes f1(t) result obtained by data inversion, F1(t) results of Fourier transform of the set of data, F1(-t) denotes F1(t) the result obtained through the data inversion,
is a transform coefficient;
the other sets of data are processed in the same manner.
7. The method of claim 6, wherein the transform coefficients are based on a higher order frequency domain computation diversity method of multi-component extension
Comprises the following steps:
8. the method of claim 7, wherein the eigenvalue θ is a function of the higher order frequency domain computation diversity method of the multicomponent spreadlThe relationship of (1) is:
wherein, thetal∈(0,2π]，l＝0,1,2,3。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111209112.4A CN113949488B (en) | 2021-10-18 | 2021-10-18 | High-order frequency domain computation diversity method based on multi-component expansion |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111209112.4A CN113949488B (en) | 2021-10-18 | 2021-10-18 | High-order frequency domain computation diversity method based on multi-component expansion |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113949488A true CN113949488A (en) | 2022-01-18 |
| CN113949488B CN113949488B (en) | 2024-01-26 |
Family
ID=79330915
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111209112.4A Active CN113949488B (en) | 2021-10-18 | 2021-10-18 | High-order frequency domain computation diversity method based on multi-component expansion |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113949488B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109391292A (en) * | 2018-12-20 | 2019-02-26 | 哈尔滨工业大学 | The collaborative transmission method of weighted score Fourier transform domain double slot diversities and multiplexing |
| CN111245766A (en) * | 2020-01-19 | 2020-06-05 | 哈尔滨工业大学 | Computing diversity method based on frequency domain double-component spread weighted Fourier transform |
| CN112532351A (en) * | 2020-11-25 | 2021-03-19 | 哈尔滨工业大学 | Interleaving transmission method for weighted fractional Fourier transform frequency domain two-component signal |
-
2021
- 2021-10-18 CN CN202111209112.4A patent/CN113949488B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109391292A (en) * | 2018-12-20 | 2019-02-26 | 哈尔滨工业大学 | The collaborative transmission method of weighted score Fourier transform domain double slot diversities and multiplexing |
| CN111245766A (en) * | 2020-01-19 | 2020-06-05 | 哈尔滨工业大学 | Computing diversity method based on frequency domain double-component spread weighted Fourier transform |
| CN112532351A (en) * | 2020-11-25 | 2021-03-19 | 哈尔滨工业大学 | Interleaving transmission method for weighted fractional Fourier transform frequency domain two-component signal |
Non-Patent Citations (3)
| Title |
|---|
| YUQING FENG 等: "Frequency-domain Dual Component Computation Diversity Design for Air-ground Integrated Mobile Communication", IEEE * |
| 李婧;沙学军;梅林;吴宣利;: "基于加权分数傅里叶变换域的2天线发射方法", 哈尔滨工业大学学报, no. 05 * |
| 马聪;沙学军;张宇思;: "广义加权分数傅里叶变换两分量组合抗衰落技术", 哈尔滨工业大学学报, no. 10 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113949488B (en) | 2024-01-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111698182B (en) | Time-frequency blocking sparse channel estimation method based on compressed sensing | |
| CN109560841B (en) | Large-scale MIMO system channel estimation method based on improved distributed compressed sensing algorithm | |
| Rateb et al. | An optimal low complexity PAPR reduction technique for next generation OFDM systems | |
| CN108111441B (en) | Channel estimation method based on variational Bayesian inference | |
| CN107682297A (en) | A kind of mobile underwater sound communication method | |
| CN111314935A (en) | Method for minimizing downlink transmission delay based on NOMA-MEC system | |
| CN101902431B (en) | Dynamic boundary constraint method for OFDM dynamic resource allocation | |
| CN108833326B (en) | Generalized mixed carrier transmission method for multi-component power averaging | |
| CN112054826B (en) | Single-user low-complexity hybrid precoding method based on intermediate channel | |
| CN113949488A (en) | High-order frequency domain calculation diversity method based on multi-component expansion | |
| CN112702298A (en) | OFDM signal transmission method for expanding mixed carrier wave precoding | |
| CN114499755B (en) | Geometric and probability combined constellation shaping method and system based on mutual information quantity estimation | |
| CN115314163A (en) | Decoding cascade iteration underwater acoustic communication system based on Monte Carlo polarization code | |
| CN111262799B (en) | Adaptive bandwidth adjustment method for industrial field communication | |
| CN113556159A (en) | Channel feedback method of large-scale MIMO multi-user system | |
| CN114337876A (en) | AMP detection algorithm based on training of NSGA2 algorithm and system for implementing same | |
| CN110048974B (en) | Half code block inversion diversity method of mixed carrier system | |
| CN111769975A (en) | MIMO system signal detection method and system | |
| CN114978254B (en) | Machine learning auxiliary low-complexity robust precoding algorithm based on OFDM system | |
| CN105162566B (en) | The low complexity bit position loading method of PLC system based on OFDM | |
| CN114980143B (en) | Probability factor optimizing method based on probability shaping and FTN transmission technology | |
| CN110798249B (en) | Signal fast convergence joint precoding method and signal transmission method in Massive MIMO system | |
| CN103117982B (en) | Data transmission method of OFDM system based on subcarrier grouping | |
| CN107911322A (en) | A kind of decision feedback equalization algorithm of low complex degree | |
| CN114423033B (en) | Anti-interference multi-user detection algorithm based on VSSAMP and design method thereof |
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 |