CN101039290B - Method for estimating MIMO related channel based on self-adaptive training sequence - Google Patents

Method for estimating MIMO related channel based on self-adaptive training sequence Download PDF

Info

Publication number
CN101039290B
CN101039290B CN2007100177092A CN200710017709A CN101039290B CN 101039290 B CN101039290 B CN 101039290B CN 2007100177092 A CN2007100177092 A CN 2007100177092A CN 200710017709 A CN200710017709 A CN 200710017709A CN 101039290 B CN101039290 B CN 101039290B
Authority
CN
China
Prior art keywords
msub
training sequence
channel
matrix
mrow
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
Application number
CN2007100177092A
Other languages
Chinese (zh)
Other versions
CN101039290A (en
Inventor
李建东
庞继勇
赵林靖
吕卓
陈亮
董伟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xidian University
Original Assignee
Xidian University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Xidian University filed Critical Xidian University
Priority to CN2007100177092A priority Critical patent/CN101039290B/en
Publication of CN101039290A publication Critical patent/CN101039290A/en
Application granted granted Critical
Publication of CN101039290B publication Critical patent/CN101039290B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Radio Transmission System (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

This invention discloses a relative channel estimation method of MIMO based on self-adaptive training sequence. The process is that, the receptor determines the best length of the training sequence according to relative known information of the channel and transfers the value of the length and relative information of the channel through feedback link to the transmitter. The transmitter uses this feedback information to compute the optimal training sequence correspondent to current state of the channel according to the training sequence expression St=UD1/2tU*t designed by this model and transfers this optimal training sequence to the receptor through the forward link. Then the training cycle begins and the transmitter launches the training sequence to wireless channel. The receptor estimates the channel parameters of current time according to the known training sequence and the receipted signal in the training cycle and by using the minimum mean square error estimation criteria. The training sequence designed by this invention can make self-adaptive adjustment according to the needs of the actual system and the change of relative information of the channel. The invention has advantages of high estimation performance and strong robustness, thus can be used in wireless communication system with muti-antenna MIMO.

Description

MIMO related channel estimation method based on self-adaptive training sequence
Technical Field
The invention belongs to the field of communication signal processing, and relates to a channel estimation method which can be used for a multi-antenna MIMO wireless communication system.
Background
In the last decade, information communication technology and application systems thereof have been rapidly developed, presenting an unprecedented prosperous scene. The development and maturity of mobile communication, wireless communication, multimedia information service and internet show a good prospect for anyone to be able to perform any kind of information interaction at any time and any place. The widespread use of internet technology and the increasing reliance and demand of people on data transmission services have impacted and pushed the continuous update of mobile communication technology at the end of the twentieth century. The existing third generation mobile communication system has difficulty in meeting the requirements of high-speed, multi-service and high-quality communication and data transmission of future mobile communication, so that the concept of super 3G or 4G is proposed, and a plurality of international standardization organizations and forums are actively developing the research of future mobile communication. For example, the international telecommunications union-radio communication sector ITU-R indicates in the future development of the global standard IMT-2000 for third generation wireless communication and documents of the beyond-IMT-2000 system: the capability of the IMT-2000 terrestrial wireless interface will extend to nearly 30Mbps in around 2005; the new system envisioned to exceed IMT-2000 around 2010 would support a peak rate of about 100Mbps under high speed mobile conditions and about 1Gbps under low speed mobile conditions.
The key of the currently widely agreed technology for supporting the high-rate requirement of future mobile communication is a multiple-input multiple-output (MIMO) system, and the MIMO technology can improve the channel capacity of a wireless channel by times on the premise of not increasing the system bandwidth and the transmission power. According to the research result of information theory, if the channel fading between different transmitting-receiving antenna pairs are independent, one has N under the same transmitting power and bandwidthtA transmitting antenna and NrThe channel capacity of the MIMO system with a plurality of receiving antennas can reach min (N) of the prior single-antenna systemt,Nr) And thus provides capacity boosting potential that is incomparable with other current technologies. So MIMO systems are considered realOne of the key technologies for future mobile communication is now available.
However, the premise of the MIMO system for achieving the multiple channel capacity is that the receiver can acquire the channel fading state information as accurate as possible, thereby effectively demodulating and decoding the received signal. Therefore, the channel estimation technique is a key for realizing effective transmission of wireless communication, and is a technical problem that must be solved first in the practical process of the MIMO system.
At present, the MIMO channel estimation methods mainly include three types, i.e., a training sequence/pilot based channel estimation algorithm, a blind channel estimation algorithm, and a semi-blind channel estimation algorithm. In consideration of the maturity, robustness and complexity of the algorithm, in combination with various standard specifications, an estimation method based on a training sequence is generally adopted. The method is fast, simple and effective, is favorable for separating and processing the channel estimation and signal detection processes, and can greatly simplify the design of a receiver.
A great deal of literature is available to make extensive studies on the design of training sequences, and it is generally considered that the estimated mean square error of orthogonal training sequences is the smallest. These studies typically assume that the channel fading coefficients between each transceiver antenna pair are independently and equally distributed, or that a suboptimal estimation criterion is adopted that does not take into account channel-related information. However, it is known that the spatial fading correlation of signals caused by insufficient angular spread of incoming waves and small antenna element spacing in a wireless mobile channel, the correlation between multi-paths determined by the pulse forming filters at the transmitting and receiving ends and the physical channel response, the time correlation introduced by doppler shift and the existence of direct paths all seriously affect the characteristics of the MIMO system, and these factors must be considered.
The related information of the channel belongs to the second-order statistical characteristic of the channel state, the variable speed of the channel is much slower than the fading coefficient of the channel, and the related information of the channel can be obtained and tracked even under the condition that the coherence time of the channel is short. The receiving end can use the relevant information to assist channel parameter estimation and the transmitting end can use the relevant information to design the optimal training sequence, thus effectively improving the accuracy of channel estimation. In addition, the correlation of channel fading will reduce the number of independent coefficients in the channel matrix, and reduce the dimension of the channel coefficient space. For the channel estimation mechanism based on the training sequence, the number of parameters to be estimated directly determines the length of the training period, thereby limiting the transmission efficiency of the system. Therefore, under the channel estimation mechanism, the correlation reduces the number of independent parameters to be estimated, and also reduces the estimation workload and shortens the length of the training sequence, thereby theoretically improving the system capacity.
In recent years, there are also a few articles that consider the problem of training sequence design under the relevant MIMO channel in combination with channel-related information on the basis of orthogonal training sequences. However, the training sequences designed in these only few documents are only one of pursuit of minimizing the mean square error of channel estimation, and obviously, the longer the training sequence is, the better the estimation performance is, and no consideration is given to the trade-off between the length of the training sequence and the length of data transmission, and no consideration is given to the problem from the perspective of the effective transmission rate of the system under the training mechanism. It is clear that the effect of the training sequence is only to estimate the channel, and not to have any information transfer effect, and how much the occupied/consumed channel transmission time will directly affect the practical availability of the system. Moreover, since the structure of the existing training sequence is fixed and invariable, the length of the training sequence cannot be adaptively adjusted according to the spatial domain related information of the current channel, and the known channel related information cannot be used more effectively, which results in a problem of low robustness of the estimation performance.
Disclosure of the invention
The invention aims to overcome the defects of fixed training sequence structure and poor training length adaptive adjustment performance in the prior art, and provides a training sequence-based MIMO related channel adaptive estimation method.
The technical idea for realizing the purpose of the invention is as follows: aiming at an MIMO flat block fading channel with spatial fading correlation, on the basis of assuming that the spatial correlation of the channel obeys a Kronecker separation correlation model, a training sequence generation method which can effectively utilize channel correlation information and has controllable length is designed, the compromise between estimation accuracy and system transmission capacity is comprehensively considered in combination with channel coherence time, and the self-adaptive channel estimation of the MIMO correlation channel is realized by the Minimum Mean Square Error (MMSE) estimation criterion and the optimization principle, and the specific process is as follows:
(1) receiver pair known transmitting end space domain correlation matrix RtAnd receiving end space domain correlation matrix RrPerforming matrix direct product operation to obtain second-order statistical correlation information R of the current channelhI.e. Rh=Rr Rt
Figure 200710017709210000210003_1
Representing the direct product between matrices, the channel correlation matrix RhRank K of (2) is denoted as K ═ rank (R)h);
(2) Determining the training sequence length for channel estimation from the value of K, i.e.
Figure A20071001770900061
Wherein N isrWhich indicates the number of receive antennas to be used,
Figure A20071001770900062
represents rounding up;
(3) the receiver will determine the training sequence length T through a feedback link between the receiver and the transmitterτAnd channel related information RhFeeding back to the transmitter;
(4) the transmitter determines a diagonal matrix D in the training sequence structure according to the feedback informationτ
When T isτ≥NtWhen it is taken <math><mrow> <msubsup> <mi>D</mi> <mi>&tau;</mi> <mrow> <mn>1</mn> <mo>/</mo> <mn>2</mn> </mrow> </msubsup> <mo>=</mo> <mfenced open='[' close=']'> <mtable> <mtr> <mtd> <msup> <mi>D</mi> <mrow> <mn>1</mn> <mo>/</mo> <mn>2</mn> </mrow> </msup> </mtd> </mtr> <mtr> <mtd> <msub> <mn>0</mn> <mrow> <mrow> <mo>(</mo> <msub> <mi>T</mi> <mi>&tau;</mi> </msub> <mo>-</mo> <msub> <mi>N</mi> <mi>t</mi> </msub> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>N</mi> <mi>t</mi> </msub> </mrow> </msub> </mtd> </mtr> </mtable> </mfenced> <mo>,</mo> </mrow></math>
When T isτ<NtWhen it is taken <math><mrow> <msubsup> <mi>D</mi> <mi>&tau;</mi> <mrow> <mn>1</mn> <mo>/</mo> <mn>2</mn> </mrow> </msubsup> <mo>=</mo> <msubsup> <mi>D</mi> <mrow> <mo>[</mo> <mn>1</mn> <mo>:</mo> <msub> <mi>T</mi> <mrow> <mi>&tau;</mi> <mo>,</mo> </mrow> </msub> <mo>:</mo> <mo>]</mo> </mrow> <mrow> <mn>1</mn> <mo>/</mo> <mn>2</mn> </mrow> </msubsup> <mo>,</mo> </mrow></math>
Wherein N istDenotes the number of transmitting antennas, 0(Tτ-Nt)×NtRepresents a (T)τ-Nt)×NtAll 0 matrix, superscript, of dimension1/2Represents the square root of the matrix, D[1:Tτ,:] 1/2Represents to take D1/2Front T ofτRow, matrix D is one Nt×NtA dimensional diagonal matrix;
(5) from the above matrix DτGenerating a training sequence SτI.e. by
<math><mrow> <msub> <mi>S</mi> <mi>&tau;</mi> </msub> <mo>=</mo> <mi>U</mi> <msubsup> <mi>D</mi> <mi>&tau;</mi> <mrow> <mn>1</mn> <mo>/</mo> <mn>2</mn> </mrow> </msubsup> <msubsup> <mi>U</mi> <mi>t</mi> <mo>*</mo> </msubsup> </mrow></math>
Wherein U is an arbitrary Tτ×TτA dimensional unitary matrix; u shapetIs a transmit-end correlation matrix RtN in eigenvalue decomposition oft×NtDimensional eigenvector unitary matrix, superscript*A conjugate transpose operation representing a matrix;
(6) the transmitter informs the receiver of the currently used training sequence S via the forward link from the transmitter to the receiverτThe specific numerical values of (a);
(7) starting the training period, the transmitter transmits a training sequence SτTransmitted into a radio channel H via a transmitting antenna, the receiver being at TτThe signal received in one symbol period may be represented as a Tτ×NtMatrix X of dimensionsτ
(8) The receiver receives the signal X according to the aboveτAnd the signalled training sequence SτAnd obtaining the estimated value of the current channel coefficient by adopting a Minimum Mean Square Error (MMSE) estimation criterion according to the following formula
<math><mrow> <mover> <mi>h</mi> <mo>^</mo> </mover> <mo>=</mo> <msqrt> <mfrac> <msub> <mi>&rho;</mi> <mi>&tau;</mi> </msub> <msub> <mi>N</mi> <mi>t</mi> </msub> </mfrac> </msqrt> <msup> <mrow> <mo>(</mo> <msubsup> <mi>R</mi> <mi>h</mi> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mo>+</mo> <mfrac> <msub> <mi>&rho;</mi> <mi>&tau;</mi> </msub> <msub> <mi>N</mi> <mi>t</mi> </msub> </mfrac> <msubsup> <mover> <mi>S</mi> <mo>~</mo> </mover> <mi>&tau;</mi> <mo>*</mo> </msubsup> <msub> <mover> <mi>S</mi> <mo>~</mo> </mover> <mi>&tau;</mi> </msub> <mo>)</mo> </mrow> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> <msubsup> <mover> <mi>S</mi> <mo>~</mo> </mover> <mi>&tau;</mi> <mo>*</mo> </msubsup> <msub> <mi>x</mi> <mi>&tau;</mi> </msub> </mrow></math>
Wherein, h ^ = vec ( H ^ ) , xτ=vec(Xτ) H ═ vec (h) denotes channel estimation matrices, respectively
Figure A20071001770900074
Received signal matrix XτAnd the column-piled-up vector, p, of the channel matrix HτRepresents the average transmit power over the training period, <math><mrow> <msub> <mover> <mi>S</mi> <mo>~</mo> </mover> <mi>&tau;</mi> </msub> <mo>=</mo> <mrow> <mo>(</mo> <msub> <mi>I</mi> <msub> <mi>N</mi> <mi>r</mi> </msub> </msub> <mo>&CircleTimes;</mo> <msub> <mi>S</mi> <mi>&tau;</mi> </msub> <mo>)</mo> </mrow> <mo>,</mo> <msub> <mi>I</mi> <msub> <mi>N</mi> <mi>r</mi> </msub> </msub> </mrow></math> represents NrDimension unit array, superscript-1Representing a matrix inversion operation;
(9) after the training is finished, the transmission of real useful data is started. After one frame transmission is finished, if the channel related information R ishIf the value of the training sequence is changed, returning to the first step to re-determine a new training sequence, and performing channel estimation and data transmission of the next frame; if the channel related information RhIf the value of (2) is not changed, returning to the step (7) to start the channel estimation and data transmission of the next frame.
The above channel estimation method, wherein Nt×NtThe dimension diagonal matrix D may be normalized to N by the traces satisfying matrix DtTτIs obtained by minimizing the following formula:
<math><mrow> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <msub> <mi>N</mi> <mi>t</mi> </msub> </munderover> <munderover> <mi>&Sigma;</mi> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> </mrow> <msub> <mi>N</mi> <mi>r</mi> </msub> </munderover> <msup> <mrow> <mo>{</mo> <msup> <mrow> <mo>[</mo> <msub> <mi>&lambda;</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>R</mi> <mi>t</mi> </msub> <mo>)</mo> </mrow> <msub> <mi>&lambda;</mi> <mi>j</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>R</mi> <mi>r</mi> </msub> <mo>)</mo> </mrow> <mo>]</mo> </mrow> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mo>+</mo> <mfrac> <msub> <mi>&rho;</mi> <mi>&tau;</mi> </msub> <msub> <mi>N</mi> <mi>t</mi> </msub> </mfrac> <msub> <mi>d</mi> <mi>i</mi> </msub> <mo>}</mo> </mrow> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> </mrow></math>
wherein d isiIs the ith diagonal element of D, λi(Rt) Representing a transmit-side spatial correlation matrix RtOf the ith characteristic value, λj(Rr) Represents the receiving end spatial correlation matrix RrThe jth eigenvalue of (1).
Compared with the prior art, the invention has the following advantages:
(1) the training sequence structure used by the channel estimation has universality and generalization, and can contain the existing specific training sequence under the same channel condition and model, such as the traditional orthogonal training sequence;
(2) the length of a training sequence generated by a training sequence structure in the channel estimation has self-adaptive characteristics, and the training time can be adjusted according to different channel airspace correlation conditions and different channel estimation error requirements;
(3) on the premise of the same training length, the estimation error of channel estimation through the training sequence is obviously smaller than that when the orthogonal training sequence is adopted;
(4) on the premise of the same channel estimation error, the length of the training sequence is smaller than that of the orthogonal training sequence, so that the training overhead is reduced, and the utilization rate of the system bandwidth is improved;
(5) the training sequence design idea has universality and can be effectively combined with an MIMO precoding technology and a self-adaptive transmission technology.
Drawings
FIG. 1 is a schematic block diagram of a training sequence based MIMO channel estimation/data detection system according to the present invention
FIG. 2 is a schematic diagram of training sequence design concept of the present invention
FIG. 3 is a flow chart of the adaptive channel estimation of the present invention
FIG. 4 is a graph comparing the estimation performance of the training sequence of the present invention and the conventional orthogonal training sequence
FIG. 5 is a graph of the length adaptation of training sequence and the estimation accuracy of the present invention
Detailed Description
The technical solution of the present invention is described in further detail below with reference to the accompanying drawings.
Referring to fig. 1, the principle of the MIMO channel estimation/data detection system based on training sequence of the present invention is to transmit a certain number of training symbols, called training sequence S, known to both the transmitter and the receiver at the beginning of each data frame/packetτ. The receiving end receives the signal X according to the training periodτAnd a training sequence SτEstimating the channel parameter matrix in the frame by adopting the Minimum Mean Square Error (MMSE) estimation criterionAfter the training period, transmission of the actual information data symbols S is starteddThe receiving end utilizes the estimated channel parametersReceiving signal X from data transmission stagedIntermediate demodulation/decoding of original data information
Figure A20071001770900083
The two ends of the receiving and transmitting realize the interaction between information sharing and parameter control through an error-free bidirectional link independent of data transmission, namely a forward link and a feedback link, thereby establishing an adaptive channel estimation mechanism.
Referring to fig. 2, the starting point of the training sequence design of the present invention is to fully and effectively utilize the known channel related information to improve the performance and robustness of channel estimation. The important point of consideration is the spatial fading correlation of the channel, and the spatial fading correlation is modeled by a Kronecker correlation model. The main factor reflecting the self-adaptive principle in the training sequence structure is the controllability of the training length, the evaluation criterion adopted by the training sequence design is the minimum mean square error MMSE estimation criterion, and in the calculation of deriving the minimum mean square error, the matrix theory and the optimization principle are utilized to derive the optimal training sequence.
Referring to fig. 3, the system for channel estimation of the present invention is a MIMO system having N thereintA transmitting antenna and NrA receiving antenna, currently Nt×NrThe dimensional channel state matrix is H, the training sequence length is TτT over the entire training periodτ×NtThe dimension training sequence matrix is written as Sτ,Tτ×NrDimension received signal matrix is Xτ,Tτ×NrThe received complex Gaussian white noise matrix is Nτ. In the system, there is a two-way link between the transmitter and the receiver, i.e. a forward link from the transmitter to the receiver and a feedback link from the receiver to the transmitter, the two-way link communicating with the transceiving antennas wirelesslyThe link is independent, only used for transmitting a small amount of interactive control information, the communication frequency band of the link is independent from the service data transmission frequency band, the transmission rate is low, and the link can be regarded as error-free transmission. The receiver in the system can obtain the second-order statistical correlation information of the channel, namely the transmitting terminal space domain correlation matrix R of the channeltAnd receiving end space domain correlation matrix RrAnd can better track the change of the channel related information. The specific channel estimation process is as follows:
1. obtaining second-order statistical relevant information R of current channelh
Receiver pair known transmitting end space domain correlation matrix RtAnd receiving end space domain correlation matrix RrPerforming matrix direct product operation to obtain second-order statistical correlation information R of the current channelhI.e. Rh=Rr
Figure 200710017709210000210003_2
Rt
Figure 200710017709210000210003_3
Representing the direct product between the matrices; the channel correlation matrix RhRank of (c) is K, denoted as K ═ rank (R)h);
2. Selecting training sequence length T for channel estimationτ
Training sequence length T is selected by using theory of incoherent capacity and requirement of receiving end on estimation error performanceτ', i.e. according to Nt×NrThe number of independent parameters in the dimensional channel matrix H is equal to RhAccording to the system capacity maximization criterion, selecting
Figure A20071001770900091
Figure A20071001770900092
Indicating rounding-up, i.e. ensuring estimated reliability and data transmission speedAn optimal compromise between rate maximization;
3. determining the final training sequence length T for channel estimationτ
The above threshold valueThe length of the training sequence is ideally optimal, but in specific application, the length of the training sequence needs to be adjusted according to the limit of the practical system on the training time and the requirement of the receiver on the performance of the current channel estimation mean square error. The basic principle of the adjustment is to reduce the training overhead as much as possible on the premise of ensuring that the performance requirement of the estimation error and the data transmission rate required by the service are met, and generally, the method is to take
Figure A20071001770900094
4. The receiver will finally determine the training sequence length T through the feedback link from the receiver to the transmitterτAnd channel related information RhFeeding back to the transmitter;
5. determining a diagonal matrix D in a training sequence structureτ
The transmitter determines the matrix D according to the feedback information according to the following two conditionsτThe concrete structure of (1):
when T isτ≥NtWhen it is taken <math><mrow> <msubsup> <mi>D</mi> <mi>&tau;</mi> <mrow> <mn>1</mn> <mo>/</mo> <mn>2</mn> </mrow> </msubsup> <mo>=</mo> <mfenced open='[' close=']'> <mtable> <mtr> <mtd> <msup> <mi>D</mi> <mrow> <mn>1</mn> <mo>/</mo> <mn>2</mn> </mrow> </msup> </mtd> </mtr> <mtr> <mtd> <msub> <mn>0</mn> <mrow> <mrow> <mo>(</mo> <msub> <mi>T</mi> <mi>&tau;</mi> </msub> <mo>-</mo> <msub> <mi>N</mi> <mi>t</mi> </msub> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>N</mi> <mi>t</mi> </msub> </mrow> </msub> </mtd> </mtr> </mtable> </mfenced> <mo>,</mo> </mrow></math>
When T isτ<NtWhen it is taken <math><mrow> <msubsup> <mi>D</mi> <mi>&tau;</mi> <mrow> <mn>1</mn> <mo>/</mo> <mn>2</mn> </mrow> </msubsup> <mo>=</mo> <msubsup> <mi>D</mi> <mrow> <mo>[</mo> <mn>1</mn> <mo>:</mo> <msub> <mi>T</mi> <mi>&tau;</mi> </msub> <mo>,</mo> <mo>:</mo> <mo>]</mo> </mrow> <mrow> <mn>1</mn> <mo>/</mo> <mn>2</mn> </mrow> </msubsup> <mo>,</mo> </mrow></math> Get D immediately1/2Front T ofτThe rows of the image data are, in turn,
wherein the matrix D is an Nt×NtAnd (5) maintaining a diagonal matrix. The matrix D can be obtained by minimizing the following equation, i.e.
<math><mrow> <mi>tr</mi> <msup> <mrow> <mo>(</mo> <msubsup> <mi>D</mi> <mi>h</mi> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mo>+</mo> <mfrac> <msub> <mi>&rho;</mi> <mi>&tau;</mi> </msub> <msub> <mi>N</mi> <mi>t</mi> </msub> </mfrac> <msub> <mi>I</mi> <msub> <mi>N</mi> <mi>r</mi> </msub> </msub> <mo>&CircleTimes;</mo> <mi>D</mi> <mo>)</mo> </mrow> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> </mrow></math>
<math><mrow> <mo>=</mo> <mi>tr</mi> <msup> <mrow> <mo>(</mo> <msup> <mrow> <mo>(</mo> <msub> <mi>D</mi> <mi>r</mi> </msub> <mo>&CircleTimes;</mo> <msub> <mi>D</mi> <mi>t</mi> </msub> <mo>)</mo> </mrow> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mo>+</mo> <mfrac> <msub> <mi>&rho;</mi> <mi>&tau;</mi> </msub> <msub> <mi>N</mi> <mi>t</mi> </msub> </mfrac> <msub> <mi>I</mi> <msub> <mi>N</mi> <mi>r</mi> </msub> </msub> <mo>&CircleTimes;</mo> <mi>D</mi> <mo>)</mo> </mrow> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> </mrow></math>
<math><mrow> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <msub> <mi>N</mi> <mi>t</mi> </msub> </munderover> <munderover> <mi>&Sigma;</mi> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> </mrow> <msub> <mi>N</mi> <mi>r</mi> </msub> </munderover> <msup> <mrow> <mo>{</mo> <msup> <mrow> <mo>[</mo> <msub> <mi>&lambda;</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>R</mi> <mi>t</mi> </msub> <mo>)</mo> </mrow> <msub> <mi>&lambda;</mi> <mi>j</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>R</mi> <mi>r</mi> </msub> <mo>)</mo> </mrow> <mo>]</mo> </mrow> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mo>+</mo> <mfrac> <msub> <mi>&rho;</mi> <mi>&tau;</mi> </msub> <msub> <mi>N</mi> <mi>t</mi> </msub> </mfrac> <msub> <mi>d</mi> <mi>i</mi> </msub> <mo>}</mo> </mrow> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> </mrow></math>
Where tr denotes the trace of the matrix, diIs the ith diagonal element of D, λi(Rt) Representing a transmit-side spatial correlation matrix RtOf the ith characteristic value, λj(Rr) Represents the receiving end spatial correlation matrix RrIs the jth characteristic value of (1) < p >τRepresenting the average transmit power over the training period.
The above formula can be solved iteratively by the optimization theory, and the constraint condition of the optimization is that the trace of the matrix D is normalized to NtTτ. For four different conditions of high signal-to-noise ratio and low signal-to-noise ratio, only receiving end spatial correlation and only transmitting end spatial correlation, the above formula can obtain a closed solution by Lagrange number multiplication and a limit approximation method;
6. from the above diagonal matrix DτGenerating a training sequence SτI.e. by
<math><mrow> <msub> <mi>S</mi> <mi>&tau;</mi> </msub> <mo>=</mo> <mi>U</mi> <msubsup> <mi>D</mi> <mi>&tau;</mi> <mrow> <mn>1</mn> <mo>/</mo> <mn>2</mn> </mrow> </msubsup> <msubsup> <mi>U</mi> <mi>t</mi> <mo>*</mo> </msubsup> </mrow></math>
The training sequence structure consists of three parts. Wherein U is an arbitrary Tτ×TτThe dimensional unitary matrix such as a Fourier matrix and the 'arbitrary' binary ensures the universality and the wide inclusion of the structure; u shapetIs a transmit-end correlation matrix RtN in eigenvalue decomposition oft×NtA dimensional eigenvector unitary matrix; matrix DτThe number of rows is equal to the length of the training sequence, so the training sequence structure can generate the training sequence with any length and has self-adaptability.
It can be shown that S is present when there is no spatial correlation in the channelτIs an orthogonal matrix, that is, the conventional orthogonal training sequence is an application of a specific case in the invention;
7. the transmitter informs the receiver of the currently used training sequence S via the forward link from the transmitter to the receiverτThe specific numerical values of (a);
8. starting the training period, the transmitter transmits a training sequence SτTransmitted into a radio channel H via a transmitting antenna, the receiver being at TτThe signal received in one symbol period may be represented as a Tτ×NtMatrix X of dimensionsτ. The mathematical description of the transceived signals of the training phase is as follows:
<math><mrow> <msub> <mi>X</mi> <mi>&tau;</mi> </msub> <mo>=</mo> <msqrt> <mfrac> <msub> <mi>&rho;</mi> <mi>&tau;</mi> </msub> <msub> <mi>N</mi> <mi>t</mi> </msub> </mfrac> </msqrt> <msub> <mi>S</mi> <mi>&tau;</mi> </msub> <mi>H</mi> <mo>+</mo> <msub> <mi>N</mi> <mi>&tau;</mi> </msub> </mrow></math>
<math><mrow> <mo>&DoubleRightArrow;</mo> <mi>vec</mi> <mrow> <mo>(</mo> <msub> <mi>X</mi> <mi>&tau;</mi> </msub> <mo>)</mo> </mrow> <mo>=</mo> <msqrt> <mfrac> <msub> <mi>&rho;</mi> <mi>&tau;</mi> </msub> <msub> <mi>N</mi> <mi>t</mi> </msub> </mfrac> </msqrt> <mrow> <mo>(</mo> <msub> <mi>I</mi> <msub> <mi>N</mi> <mi>r</mi> </msub> </msub> <mo>&CircleTimes;</mo> <msub> <mi>S</mi> <mi>&tau;</mi> </msub> <mo>)</mo> </mrow> <mi>vec</mi> <mrow> <mo>(</mo> <mi>H</mi> <mo>)</mo> </mrow> <mo>+</mo> <mi>vec</mi> <mrow> <mo>(</mo> <msub> <mi>N</mi> <mi>&tau;</mi> </msub> <mo>)</mo> </mrow> </mrow></math>
<math><mrow> <mo>&DoubleRightArrow;</mo> <msub> <mi>x</mi> <mi>&tau;</mi> </msub> <mo>=</mo> <msqrt> <mfrac> <msub> <mi>&rho;</mi> <mi>&tau;</mi> </msub> <msub> <mi>N</mi> <mi>t</mi> </msub> </mfrac> </msqrt> <msub> <mover> <mi>S</mi> <mo>~</mo> </mover> <mi>&tau;</mi> </msub> <mi>h</mi> <mo>+</mo> <msub> <mi>n</mi> <mi>&tau;</mi> </msub> <mo>,</mo> <mi>s</mi> <mo>.</mo> <mi>t</mi> <mo>.</mo> <mi>tr</mi> <mrow> <mo>(</mo> <msubsup> <mi>S</mi> <mi>&tau;</mi> <mo>*</mo> </msubsup> <msub> <mi>S</mi> <mi>&tau;</mi> </msub> <mo>)</mo> </mrow> <mo>=</mo> <msub> <mi>N</mi> <mi>t</mi> </msub> <msub> <mi>T</mi> <mi>&tau;</mi> </msub> </mrow></math>
in the formula xτ=vec(Xτ) H ═ vec (h) denotes the received signal matrix X, respectivelyτAnd the column-piled-up vector, p, of the channel matrix HτRepresents the average transmit power over the training period, <math><mrow> <msub> <mover> <mi>S</mi> <mo>~</mo> </mover> <mi>&tau;</mi> </msub> <mo>=</mo> <mrow> <mo>(</mo> <msub> <mi>I</mi> <msub> <mi>N</mi> <mi>r</mi> </msub> </msub> <mo>&CircleTimes;</mo> <msub> <mi>S</mi> <mi>&tau;</mi> </msub> <mo>)</mo> </mrow> <mo>,</mo> </mrow></math> INrrepresents NrA dimensional unit array;
9. the receiver receives the signal X according to the aboveτAnd the signalled training sequence SτThe estimation value of the current channel coefficient is obtained by the following formula by adopting the Minimum Mean Square Error (MMSE) estimation criterion
Figure A20071001770900115
<math><mrow> <mover> <mi>h</mi> <mo>^</mo> </mover> <mo>=</mo> <msqrt> <mfrac> <msub> <mi>&rho;</mi> <mi>&tau;</mi> </msub> <msub> <mi>N</mi> <mi>t</mi> </msub> </mfrac> </msqrt> <msup> <mrow> <mo>(</mo> <msubsup> <mi>R</mi> <mi>h</mi> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mo>+</mo> <mfrac> <msub> <mi>&rho;</mi> <mi>&tau;</mi> </msub> <msub> <mi>N</mi> <mi>t</mi> </msub> </mfrac> <msubsup> <mover> <mi>S</mi> <mo>~</mo> </mover> <mi>&tau;</mi> <mo>*</mo> </msubsup> <msub> <mover> <mi>S</mi> <mo>~</mo> </mover> <mi>&tau;</mi> </msub> <mo>)</mo> </mrow> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> <msubsup> <mover> <mi>S</mi> <mo>~</mo> </mover> <mi>&tau;</mi> <mo>*</mo> </msubsup> <msub> <mi>x</mi> <mi>&tau;</mi> </msub> </mrow></math>
In the formula h ^ = vec ( H ^ ) Representing a channel estimation matrix
Figure A20071001770900118
The corresponding estimated mean square error MSE is:
<math><mrow> <mi>MSE</mi> <mo>=</mo> <mi>tr</mi> <msup> <mrow> <mo>(</mo> <msubsup> <mi>R</mi> <mi>h</mi> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mo>+</mo> <mfrac> <msub> <mi>&rho;</mi> <mi>&tau;</mi> </msub> <msub> <mi>N</mi> <mi>t</mi> </msub> </mfrac> <msubsup> <mover> <mi>S</mi> <mo>~</mo> </mover> <mi>&tau;</mi> <mo>*</mo> </msubsup> <msub> <mover> <mi>S</mi> <mo>~</mo> </mover> <mi>&tau;</mi> </msub> <mo>)</mo> </mrow> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mo>;</mo> </mrow></math>
10. after the training is finished, the transmission of real useful data is started
After one frame transmission is finished, if the channel related information R ishIf the value of the training sequence is changed, returning to the first step to re-determine a new training sequence, and performing channel estimation and data transmission of the next frame; if the channel related information RhIf the value is not changed, the step 8 is returned to start the channel estimation and data transmission of the next frame.
The technical effects of the present invention will be described in further detail below with reference to the accompanying drawings.
Referring to fig. 4, assuming that a 4-transmission 4-reception MIMO system has the same spatial correlation coefficient at both transmission and reception ends, an exponential correlation coefficient generation model is used, and R is setr(i,j)=Rt(i,j)=r|i-j|And i, j is equal to 1, 2, 3 and 4, r is less than or equal to 1, and the larger the value of r is, the stronger the spatial correlation is. The training length is 4 symbol periods. In fig. 4, 'ort' represents a conventional orthogonal training sequence, and 'opt' represents a training sequence employed in the present invention. It can be seen that, although the mean square error of the channel estimation corresponding to the two training sequences is gradually reduced as the signal-to-noise ratio is increased. However, the estimation performance of the training sequence of the invention is better than that of the traditional orthogonal training sequence, and the performance is improved more obviously along with the enhancement of the spatial correlation of the channel.
Referring to fig. 5, still assume a 4-transmission 4-reception MIMO system, taking the following three cases as an example:
(1) assuming no spatial correlation, take Tτ=4;
(2) Assuming no receiving correlation, the transmitting end has space-domain correlation and the correlation matrix is not full rank, and has three eigenvalues of 2, 1.5 and 0.5, and tr (R) is satisfiedt) When K is equal to 12, take <math><mrow> <msub> <mi>T</mi> <mi>&tau;</mi> </msub> <mo>=</mo> <mfrac> <mi>K</mi> <msub> <mi>N</mi> <mi>r</mi> </msub> </mfrac> <mo>=</mo> <mn>3</mn> <mo>;</mo> </mrow></math>
(3) Further ignoring RhThe smaller 4 positive eigenvalues in (K) 8 are taken, in which case <math><mrow> <msub> <mi>T</mi> <mi>&tau;</mi> </msub> <mo>=</mo> <mfrac> <mi>K</mi> <msub> <mi>N</mi> <mi>r</mi> </msub> </mfrac> <mo>=</mo> <mn>2</mn> <mo>.</mo> </mrow></math>
As can be seen from the relationship curves of the estimated mean square error with the change of the signal-to-noise ratio in the three cases given in fig. 5, although the training overhead of case (2) is reduced by 25% compared with case (1), the estimated variance is still smaller than that of case (1); case (3) uses 50% less training overhead than case (1), and its estimated variance is better than case (1) at low signal-to-noise ratios. This shows that the estimation performance in the case of the correlated channel can still be obtained with less training symbols than in the case of the independent channel. Meanwhile, the training sequence of the invention can make self-adaptive adjustment to the length of the training sequence according to the variation of the channel correlation strength and the estimation performance of the receiver, so as to reduce the training overhead to the maximum extent on the basis of meeting the estimation performance requirement, achieve the maximization of the data transmission rate and improve the utilization rate of the frequency band.

Claims (2)

1. A MIMO related channel estimation method based on self-adaptive training sequence includes the following steps:
(1) receiver pair known transmitting end space domain correlation matrix RtAnd receiving end space domain correlation matrix RrPerforming matrix direct product operation to obtain second-order statistical correlation information R of the current channelhI.e. by
Figure FSB00000081728300011
Figure FSB00000081728300012
Representing the direct product between matrices, the channel correlation matrix RhRank K of (2) is denoted as K ═ rank (R)h);
(2) Determining the training sequence length for channel estimation from the value of K, i.e.Wherein N isrWhich indicates the number of receive antennas to be used,
Figure FSB00000081728300014
represents rounding up;
(3) the receiver will determine the training sequence length T through a feedback link between the receiver and the transmitterτAnd channel related information RhFeeding back to the transmitter;
(4) the transmitter determines a diagonal matrix D in the training sequence structure according to the feedback informationτ
When T isτ≥NtWhen it is taken
Figure FSB00000081728300015
When T isτ≥NtWhen it is taken
Wherein N istWhich represents the number of transmit antennas to be transmitted,
Figure FSB00000081728300017
represents a (T)τ-Nt)×NtAll 0 matrix, superscript, of dimension1/2The square root of the matrix is represented as,
Figure FSB00000081728300018
represents to take D1/2Front T ofτRow, matrix D is one Nt×NtA dimensional diagonal matrix;
(5) from the above matrix DτGeneration trainingTraining sequence SτI.e. by
Figure FSB00000081728300019
Wherein U is an arbitrary Tτ×TτA dimensional unitary matrix; u shapetIs a transmit-end correlation matrix RtN in eigenvalue decomposition oft×NtDimensional eigenvector unitary matrix, superscript*A conjugate transpose operation representing a matrix;
(6) the transmitter informs the receiver of the currently used training sequence S via the forward link from the transmitter to the receiverτThe specific numerical values of (a);
(7) starting the training period, the transmitter will train symbols SτTransmitted into a radio channel H via a transmitting antenna, the receiver being at TτThe signal received in one symbol period may be represented as a Tτ×NtMatrix X of dimensionsτ
(8) The receiver receives the signal X according to the aboveτAnd the signalled training sequence SτThe estimation value of the current channel coefficient is obtained by the following formula by adopting the Minimum Mean Square Error (MMSE) estimation criterion
Figure FSB00000081728300021
Figure FSB00000081728300022
Wherein,
Figure FSB00000081728300023
xτ=vec(Xτ) Respectively represent channel estimation matrices
Figure FSB00000081728300024
And a received signal matrix XτColumn pile-up vector of rhoτRepresenting the average transmitted power over the training period,
Figure FSB00000081728300026
Represents NrDimension unit array, superscript-1Representing a matrix inversion operation;
(9) after training, the transmission of real useful data is started, and after one frame transmission is finished, if the channel related information R ishIf the value of the training sequence is changed, returning to the first step to re-determine a new training sequence, and performing channel estimation and data transmission of the next frame; if the channel related information RhIf the value of (2) is not changed, returning to the step (7) to start the channel estimation and data transmission of the next frame.
2. The channel estimation method of claim 1, wherein Nt×NtThe dimension diagonal matrix D can be normalized to N by satisfying the normalization of the matrix DtTτIs obtained by minimizing the following formula:
wherein d isiIs the ith diagonal element of D, λi(Rt) Representing a transmit-side spatial correlation matrix RtOf the ith characteristic value, λj(Rr) Represents the receiving end spatial correlation matrix RrThe jth eigenvalue of (1).
CN2007100177092A 2007-04-19 2007-04-19 Method for estimating MIMO related channel based on self-adaptive training sequence Active CN101039290B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2007100177092A CN101039290B (en) 2007-04-19 2007-04-19 Method for estimating MIMO related channel based on self-adaptive training sequence

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2007100177092A CN101039290B (en) 2007-04-19 2007-04-19 Method for estimating MIMO related channel based on self-adaptive training sequence

Publications (2)

Publication Number Publication Date
CN101039290A CN101039290A (en) 2007-09-19
CN101039290B true CN101039290B (en) 2010-08-04

Family

ID=38889929

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2007100177092A Active CN101039290B (en) 2007-04-19 2007-04-19 Method for estimating MIMO related channel based on self-adaptive training sequence

Country Status (1)

Country Link
CN (1) CN101039290B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI572241B (en) * 2015-02-16 2017-02-21 啟碁科技股份有限公司 Access point and associated anteena selecting method
FR3111453A1 (en) * 2020-06-10 2021-12-17 Thierry Lucidarme Adaptive discrimination of radio signals by neural network

Families Citing this family (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8848816B2 (en) * 2008-05-21 2014-09-30 Qualcomm Incorporated Method and apparatus for determining the spatial channels in a spatial division multiple access (SDMA)-based wireless communication system
CN101686065B (en) * 2008-09-24 2013-01-30 华为技术有限公司 Method and equipment for modulation and demodulation
CN101931504B (en) * 2009-07-24 2013-07-03 广州杰赛科技股份有限公司 Communication method of MIMO-STC (Multiple Input Multiple Output-Space Time Code) wireless communication transmission system
US20120263141A1 (en) 2011-04-15 2012-10-18 Qualcomm Incorporated Systems and methods for range extension of wireless communication in sub gigahertz bands
CN102932094B (en) * 2011-08-12 2016-08-10 华为技术有限公司 The method and apparatus of transmission information
CN103763222B (en) * 2014-01-16 2016-07-27 西安电子科技大学 A kind of channel ambiguity minimizing technology in MIMO signal blind Detecting
CN104468428B (en) * 2014-12-04 2018-06-05 南京邮电大学 Safety of physical layer method based on low complex degree difference channel estimation
CN105991173B (en) * 2015-02-17 2019-09-13 启碁科技股份有限公司 Wireless network base station and antenna selecting method
CN106789763B (en) * 2016-06-30 2019-08-09 北京展讯高科通信技术有限公司 The channel estimation methods and device of mimo system, base station
CN106685864B (en) * 2017-01-18 2019-09-17 深圳市极致汇仪科技有限公司 A kind of composite system channel estimation methods and device suitable for tester
CN107703489B (en) * 2017-09-26 2021-05-18 西北工业大学 Joint design method for MIMO radar constant modulus waveform and receiver
CN109547067A (en) * 2018-11-23 2019-03-29 温州大学 A kind of channel detection method suitable for power carrier communication system

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
Jayesh H. Kotecha et al..Transmit signal design for optimal estimation of correlatedMIMO channels.IEEE TRANSACTIONS ON SIGNAL PROCESSING52 2.2004,52(2),546-557. *
Jayesh H.Kotecha et al..Transmit signal design for optimal estimation of correlatedMIMO channels.IEEE TRANSACTIONS ON SIGNAL PROCESSING52 2.2004,52(2),546-557. *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI572241B (en) * 2015-02-16 2017-02-21 啟碁科技股份有限公司 Access point and associated anteena selecting method
US9717093B2 (en) 2015-02-16 2017-07-25 Wistron Neweb Corporation Access point and associated antenna selecting method
FR3111453A1 (en) * 2020-06-10 2021-12-17 Thierry Lucidarme Adaptive discrimination of radio signals by neural network

Also Published As

Publication number Publication date
CN101039290A (en) 2007-09-19

Similar Documents

Publication Publication Date Title
CN101039290B (en) Method for estimating MIMO related channel based on self-adaptive training sequence
CN101378277B (en) Multi-user pre-coding and dispatching method and realize the base station of the method
CN101083647B (en) Method for realizing synchronization in multi-input multi-output OFDM system
CN107947840B (en) Time reversal anti-interference method based on millimeter wave large-scale MIMO
EP1499056A1 (en) Method and apparatus for transmitting signals in a multi-antenna mobile communications system that compensates for channel variations
CN101771509B (en) Orthogonal network space-time coding method and relay transmission system
US11121760B2 (en) Multiple-input multiple output communication system with virtual trajectory reception for doubly selective channels
WO2008000119A1 (en) Communication method for adaptive multiple antennas and device thereof
CN102223327B (en) SAGE (Space-alternating Generalized Expectation-maximization) based channel estimation method in CoMP multi-user system
CN103716263B (en) Based on the parallel efficient pilot frequency system offset in large-scale multi-antenna system
WO2008113216A1 (en) A channel estimation method
CN101964695B (en) Method and system for precoding multi-user multi-input multi-output downlink
CN102098244B (en) Multi-user precoding robust construction method under explicit delayed feedback
CN102007739B (en) MIMO slow precoding method and apparatus
AU2007249136A1 (en) Data equalisation in a communication receiver with transmit and receive diversity
CN101292481B (en) Method and apparatus for estimating channel based on implicit training sequence
CN101645757B (en) Method and device for selecting precoding matrix
CN103118436A (en) User scheduling algorithm for MU-MIMO (multi-user multiple input multiple output) down link based on interference pre-evaluation
CN101640649B (en) Method and device for determining channel prediction factor in channel prediction and channel predictor
CN112953612B (en) Maximum ratio combining method and system with time robustness
Kanthimathi et al. Improved performance by ICI cancellation in MIMO-OFDM system
EP3447933B1 (en) Signal decoding method, apparatus and device
CN102315873B (en) Cross polarization antenna system reception merging method and apparatus thereof
Prasad et al. Joint data detection and dominant singular mode estimation in time varying reciprocal MIMO systems
Wan et al. Perturbation analysis of whitening-rotation-based semi-blind MIMO channel estimation

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant