CN102263614B - A kind of method for multi-user pre-coding and device - Google Patents
A kind of method for multi-user pre-coding and device Download PDFInfo
- Publication number
- CN102263614B CN102263614B CN201110237551.6A CN201110237551A CN102263614B CN 102263614 B CN102263614 B CN 102263614B CN 201110237551 A CN201110237551 A CN 201110237551A CN 102263614 B CN102263614 B CN 102263614B
- Authority
- CN
- China
- Prior art keywords
- mrow
- msub
- msup
- matrix
- mover
- 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
Abstract
The invention discloses a kind of multi-user pre-coding information to determine method, comprises the following steps：Estimate base station and user UEkBetween channel matrix Hk；Leakage noise ratio criterion is believed according to maximum, error is less than predetermined threshold between repeating the pre-coding matrix that following iterative process obtains to adjacent iteration twice：Utilize HkThe decoding matrix obtained with last iteration, obtain this pre-coding matrix；The pre-coding matrix obtained using current iteration, obtain this decoding matrix；The pre-coding matrix and decoding matrix that last time iteration is obtained, base station is respectively used to issuing user UEkSignal precoding when use, and user UEkUsed when being decoded to data.The present invention believes leakage noise ratio criterion and iterative manner tries to achieve base station and user uses pre-coding matrix and decoding matrix using maximum, eliminates the mutual interference of user to a greater degree, and make it that the number of sending and receiving end antenna is unrestricted.
Description
Technical field
The present invention relates to pre- in LTE-A (Long Term Evolution Advanced, long-term evolution upgrading) system
Coding techniques field, more particularly to a kind of method for multi-user pre-coding and device.
Background technology
In lte-a system, when downlink closed-loop transmitting antenna is 2 antennas and 4 antenna, closed loop feedback is mainly using feedback
PMI (Precoding Metrix Indicator, pre-coding matrix instruction) form, i.e. user's receiving terminal select the code book that prelists
In some pre-coding matrix, its corresponding PMI is then returned into evolution base station (eNodeB).In MU-MIMO
In the pattern of (Mutiple User Mutiple Input Mutiple Output, multi-user's Multiinputoutput), multiple users
Data flow transmitted on identical physical resource, to realize spatial reuse.It is dry between multiple customer traffics in order to eliminate
Disturb, base station selects pre-coding matrix to be capable of the user of approximate pairwise orthogonal and used as pairing according to the PMI of multiple user feedbacks
Family, or pairing user is selected after being corrected in the PMI of no nearly orthogonal, then transmitted on identical physical resource
Match the data flow of user.But this method is to eliminating between customer traffic the effect disturbed and bad so that space is multiple
It is larger with gain loss.
In addition, in lte-a system, traditional multi-user pre-coding technology based on block diagonalization is realized simply, can be very
It is combined with single user precoding technique well, and certain bit error rate requirement can be met, but block diagonalization method is to transmitting-receiving
The antenna amount at end has strict limitation, once antenna amount is unsatisfactory for requiring, performance will drastically deteriorate.Therefore, it is necessary to seek
Look for high accuracy, and practical method for multi-user pre-coding.
The content of the invention
The present invention provides a kind of method for multi-user pre-coding, is done to overcome to eliminate in the prior art between customer traffic
The effect difference and the restricted problem of antenna amount of sending and receiving end disturbed.
The inventive method includes：
A kind of multi-user pre-coding information determines method, comprises the following steps：
Estimate base station and user UEkBetween channel matrix Hk；
Leakage noise ratio criterion is believed according to maximum, repeats the precoding square that following iterative process obtains to adjacent iteration twice
Error is less than predetermined threshold between battle array：Utilize HkThe decoding matrix obtained with last iteration, obtain this pre-coding matrix；Utilize
The pre-coding matrix that current iteration obtains, obtain this decoding matrix；Wherein, first iteration when, calculate pre-coding matrix make
Decoding matrix passes through to HkCarry out singular value decomposition acquisition；
The pre-coding matrix and decoding matrix that last time iteration is obtained, base station is respectively used to issuing user UEk's
Used during signal precoding, and user UEkUsed when being decoded to data.
A kind of multi-user pre-coding information determining means, including：
Subscriber channel estimation module, for estimating base station and user UEkBetween channel matrix Hk；
Matrix deciding module, for according to maximum believe leakage noise ratio criterion, repeat following iterative process to it is adjacent twice
Error is less than predetermined threshold between the pre-coding matrix that iteration obtains：Utilize HkThe decoding matrix obtained with last iteration, obtain this
Secondary pre-coding matrix；The pre-coding matrix obtained using current iteration, obtain this decoding matrix；Wherein, iteration first
When, calculate the decoding matrix that pre-coding matrix uses and pass through to HkCarry out singular value decomposition acquisition；
Terminate module, for the pre-coding matrix and decoding matrix for obtaining last time iteration, it is respectively used to base station pair
Issue user UEkSignal precoding when use, and user UEkUsed when being decoded to data.
It is an object of the invention to provide a kind of method for precoding for multi-user, using maximum letter leakage noise ratio criterion and
Iterative manner tries to achieve the pre-coding matrix and decoding matrix finally used between base station and user, eliminates base station to a greater degree
Mutual interference during using space multiplexing technique to multiuser transmission signal, and in the present invention sending and receiving end antenna number
It is unrestricted, especially adapt to the higher channel of channel correlation coefficient.
Brief description of the drawings
Fig. 1 provides a kind of method for multi-user pre-coding flow chart for the present invention；
Fig. 2 is a kind of method for multi-user pre-coding application scenario diagram provided by the invention；
Fig. 3 is a kind of particular flow sheet of method for multi-user pre-coding embodiment provided by the invention；
Fig. 4 is a kind of multi-user pre-coding apparatus structure block diagram provided by the invention；
Fig. 5 is the analogous diagram of the method for multi-user pre-coding based on the present invention.
Embodiment
Signal-noise ratio estimation method proposed by the present invention and device are carried out in more detail with reference to the accompanying drawings and examples
It is bright.
Assuming that communication system is by an evolution base station eNB, K mobile subscriber UE1, UE2..., UEKForm, K be more than etc.
In 1 integer, and each user uses same running time-frequency resource, and evolution base station eNB has a M root transmitting antennas, kth (k=1,2,
3 ..., K) individual user includes NkRoot reception antenna, user UEKThe data transfer number of plies be mk(need to transmit mkIndividual independent number
According to stream), mkFor the integer more than or equal to 1.Then evolution base station eNB is to user UEKThe signal of transmission is represented by M dimensional vectors
Wksk, wherein, M is integer more than or equal to 1, WkFor user UEKM × mkPre-coding matrix is tieed up, and is metWherein, tr () represents mark computing, and superscript H represents conjugate transposition computing, skIt is user UEKMk
Dimension transmitting symbolic vector.
The present invention provides a kind of method for multi-user pre-coding, as shown in figure 1, comprising the following steps：
Step 101, base station and user UE are estimatedkBetween channel matrix Hk。
Step 102, leakage noise ratio criterion is believed according to maximum, repeats what following iterative process obtained to adjacent iteration twice
Error is less than predetermined threshold between pre-coding matrix：Utilize HkThe decoding matrix obtained with last iteration, obtain this precoding
Matrix；The pre-coding matrix obtained using current iteration, obtain this decoding matrix；Wherein, first iteration when, calculating prelists
The decoding matrix that code matrix uses passes through to HkCarry out singular value decomposition acquisition.
Step 103, the pre-coding matrix and decoding matrix last time iteration obtained, is respectively used to base station to issuing use
Family UEkSignal precoding when use, and user UEkUsed when being decoded to data.
A kind of method for precoding for multi-user provided by the invention, using maximum letter leakage noise ratio criterion and iterative manner
The pre-coding matrix and decoding matrix finally used between base station and user is tried to achieve, base station and user are utilized respectively what is finally tried to achieve
Pre-coding matrix, decoding matrix carry out precoding and decoding so that equivalent to one single antenna channel of whole signals transmission,
It efficiently avoid the interference between user.And the inventive method is not restricted to the number of sending and receiving end antenna, can be fitted well
Answer the channel that channel correlation coefficient is higher.
In order to which the signal for allowing base station to send really is reduced as far as possible in user's receiving terminal in MU-MIMO system, except
Need the pre-coding matrix of acquisition base station end, it is also necessary to obtain the decoding matrix of user's receiving terminal.Assuming that user UEkReceiving terminal
One linear mk×NkDimensional decoding matrix is Gk, user UEkIt is through the decoded signal of the decoding matrix：
Section 1 is the useful signal of the user in formula (1), and Section 2 is the interference of other users, and Section 3 is additivity
White Gaussian noise, wherein WkFor user UEkPre-coding matrix, HkIt is user UEkWith the N between this cell base station eNBk× M dimension letters
Road matrix, i are the user corresponding to base station, i=1,2,3 ..., K, and i ≠ k, nkIt is NkThe noise column vector of dimension, it is user
UEkIndependent identically distributed additive white Gaussian noise.So, to eliminate the interference between user should just construct a pre-coding matrix Wk
With a decoding matrix GkSo that Section 2 is 0 in formula (1), i.e.,
By formula (2) further
GkHkWi=0, i ≠ k (3)
Assuming that user UEkIt is expected user without loss of generality, make it that in formula (1) that Section 2 is 0 to prelist for construction
Code matrix WkWith decoding matrix Gk, it is preferred that determine corresponding user UE using following methodskPre-coding matrix and decoding matrix：
Step 1, user UE is estimatedkWith the channel matrix H between this cell evolution base station eNBk。
Step 2, the user UE is utilizedkChannel matrix HkWith the decoding matrix G of the f-1 times iterationk (f-1), obtain user
UEkThe f times iteration equivalent channel matrixFor：
Wherein, f is iterations, f=1,2,3 ... ...
Step 3, leakage noise ratio criterion is believed from maximum, in order to reach the purpose for eliminating inter-user interference as far as possible, can made
Section 2 in formula (1) goes to zero as far as possible, should cause user UEkSignal power with the signal power is compromised gives institute
The ratio for having the power sum of other users reaches maximum, now user UEkCorresponding pre-coding matrix is represented by：
Wherein,W when representing to take the ratio to reach maximumk；
It can further obtain：
WhereinExpression takes the preceding m of matrixkFeature vector set corresponding to individual big characteristic value.
From above inference, the user UE obtained using formula (6)kThe pre-coding matrix W of the f times iterationk (f), can make
Obtain user UEkThe compromised power to every other user of signal power and the signal power and ratio reach maximum, to Wk (f)Computing is normalized to obtain：
Wherein, | | | | represent modulus computing.
Step 4, user UE is utilizedkPre-coding matrix Wk (f), channel matrix Hk, decoding matrixObtain user UEkThe
The signal power of f iteration is：
Wherein, Pk (f)Represent user UEkThe signal power of the f times iteration.
It can be seen from maximum believes leakage noise ratio criterion, in formula (5)For user UEkPeak signal
Power, it can further obtain：
Wherein,Represent user UEkMaximum signal power.
Using formula (8) (9), user UE can be obtainedkThe decoding matrix when signal power of the f times iteration reaches maximum is：
Wherein,For user UEkThe signal power of the f times iteration reaches decoding matrix during maximum.
It is rightComputing is normalized to obtain：
Wherein k=1,2 ..., K (11)
Step 5, step 2, step 3, step 4 are repeated, and is calculated between the pre-coding matrix of adjacent iteration twice
Difference μk：
Work as μkWhen value is less than predetermined threshold value, stop iteration, it is determined that currentWithFinally to try to achieve to application
Family UEkPre-coding matrix and decoding matrix.
Above-mentioned determination user UEkPre-coding matrix and decoding matrix method in, decoding matrix that step 2 uses first
(i.e. initial decoding matrix) be related to iteration whether being capable of Fast Convergent, it is preferred that the present invention uses channel matrix singular value
The method of decomposition obtains initial decoding matrix
To user UEkChannel matrix HkCarrying out singular value decomposition is：
Obtain user UEkInitial decoding matrix
Wherein, HkIt is user UEkN between base stationk× M ties up channel matrix, NkFor user UEkReception antenna quantity, M
For the number of transmission antennas of base station, UkIt is Nk× M ties up unitary matrice, ∈k=diag (σ1, σ2..., σr), r=rank (Hk), σ1,
σ2..., σrIt is HkSingular value, diag () represent diagonal matrix, rank () represent order computing, VkIt is M × M dimension unitary matrice,
For the initial decoding matrix used first,For UkPreceding mkRow, mkFor user UEkThe number of plies.
The initial decoding matrix determined using channel matrix singular value decomposition method, may be such that it is determined that user UEkFinally
Pre-coding matrix and decoding matrix process iterative convergence speed it is fast, although the iterative process adds certain amount of calculation,
But due to reducing the number of iteration, considerably improve the performance of system.
It is a kind of embodiment of method for multi-user pre-coding provided by the invention below, as shown in Fig. 2 including two in cell
The transmitting antenna number of individual user, wherein base station eNB are 4, user UE1、UE2Reception antenna be 2, and the number of plies of each user
Be 2, i.e. K=2, M=4, Nk=2, mk=2.As shown in figure 3, the present embodiment comprises the following steps：
Step 301, base station eNB and this community user UE are estimated1、UE2Between channel matrix H1、H2Respectively：
Step 302, to channel matrix H1、H2Singular value decomposition is carried out, tries to achieve corresponding user UE1、UE2Initial decoding square
Battle array
Step 303, the user UE is utilized1Channel matrix H1The decoding matrix G obtained with the f-1 times iteration1 (f-1), obtain
To user UE1The obtained equivalent channel matrix of the f times iteration
Wherein, the decoding matrix used first is the initial decoding matrix determined in step 302
Leakage noise ratio criterion is believed according to maximum, utilizes the user UE1The f times equivalent channel matrixObtain user
UE1The f times pre-coding matrix W1 (f)For：
Similarly obtain, user UE2The f times iteration equivalent channel matrixFor：
User UE2The f times pre-coding matrix W2 (f)For：
Step 304, user UE is utilized1The obtained pre-coding matrix W of the f times iteration1 (f), obtain user UE1The f times
The decoding matrix G that iteration obtains1 (f)：
Similarly obtain user UE2The f times iteration decoding matrix G2 (f)：
Step 305, step 303 and 304 are repeated, calculates user UE1Adjacent iteration twice pre-coding matrix it
Between difference μ1：
Work as μ1During ＜ 0.1, stop iteration, perform step 306, otherwise, perform in step 305 be directed to user UE again1Behaviour
Make.
Similarly, user UE is calculated2Adjacent iteration twice pre-coding matrix between difference μ2：
Work as μ2During ＜ 0.1, stop iteration, perform step 306, otherwise, perform in step 305 be directed to user UE again2Behaviour
Make.
In this example, for user UE1, during iterations f=3, μ1＜ 0.1, stop iteration, perform step 306；For with
Family UE2, during iterations f=5, μ2＜ 0.1, stop iteration, perform step 306.
Step 306, it is determined thatWithFor user UE1The pre-coding matrix and decoding matrix finally determined, it is determined thatWithFor user UE2The pre-coding matrix and decoding matrix finally determined.
Step 307, to user UE1, the pre-coding matrix W that finally determines described in base station applies1 (3)Primary signal is carried out pre-
User UE is sent to after coded treatment1, user UE1Using the decoding matrix G finally determined1 (3)The signal of reception is carried out
Decoding, decoded signal are：
Similarly, to user UE2, the pre-coding matrix W that finally determines described in base station applies2 (5)Primary signal is prelisted
User UE is sent to after code processing2, user UE2Using the decoding matrix G finally determined2 (5)The signal of reception is solved
Code, decoded signal are：
The present invention provides a kind of multi-user pre-coding device, applied to lte-a system, as shown in figure 4, the device includes：
Subscriber channel estimation module, for estimating base station and user UEkBetween channel matrix Hk；
Matrix deciding module, for according to maximum believe leakage noise ratio criterion, repeat following iterative process to it is adjacent twice
Error is less than predetermined threshold between the pre-coding matrix that iteration obtains：Utilize HkThe decoding matrix obtained with last iteration, obtain this
Secondary pre-coding matrix；The pre-coding matrix obtained using current iteration, obtain this decoding matrix；Wherein, iteration first
When, calculate the decoding matrix that pre-coding matrix uses and pass through to HkCarry out singular value decomposition acquisition；
Terminate module, for the pre-coding matrix and decoding matrix for obtaining last time iteration, it is respectively used to base station pair
Issue user UEkSignal precoding when use, and user UEkUsed when being decoded to data.
The specific implementation function of the modules of the multi-user pre-coding device is referring to above-mentioned method for multi-user pre-coding
Specific implementation process, will not be repeated here.
The pre-coding matrix and decoding matrix finally determined in the present invention, precoding will be used for by base station and user respectively
Journey and decoding process, the present invention are not restricted to the installation position of multi-user pre-coding device, can be installed in base station end or use
Family end, it can be selected according to specific application environment.
Fig. 5 be based on the present invention method for multi-user pre-coding analogous diagram, wherein the simulation model used for：Send out base station
Penetrating end has 6 antennas, and receiving terminal has 3 users, and each user has 3 antennas, and the number of plies of each user is 2.Provided in emulation
Under flat fading channel, using the multi-user pre-coding (R-T- of block diagonalization precoding (BD-UCD) method and the present invention
UN) the bit error rate performance contrast of method, from figure 5 it can be seen that due to being unsatisfactory for antenna restrictive condition, block diagonalization precoding
Method failure (with the increase of signal to noise ratio, the bit error rate improves unobvious) substantially under this model, and method for multi-user pre-coding
Preferable systematic function can then be reached.
Obviously, those skilled in the art can carry out the essence of various changes and modification without departing from the present invention to the present invention
God and scope.So, if these modifications and variations of the present invention belong to the scope of the claims in the present invention and its equivalent technologies
Within, then the present invention is also intended to comprising including these changes and modification.
Claims (9)
1. a kind of multi-user pre-coding information determines method, it is characterised in that comprises the following steps：
Estimate base station and user UEkBetween channel matrix Hk；
Leakage noise ratio criterion is believed according to maximum, repeated between the pre-coding matrix that following iterative process obtains to adjacent iteration twice
Error is less than predetermined threshold：Utilize HkThe decoding matrix obtained with last iteration, obtain this pre-coding matrix；Utilize this
The pre-coding matrix that iteration obtains, obtain this decoding matrix；Wherein, first iteration when, calculate pre-coding matrix and use
Decoding matrix passes through to HkCarry out singular value decomposition acquisition；
The pre-coding matrix and decoding matrix that last time iteration obtains, base station is respectively used to issuing user UEkSignal prelist
Used during code, and user UEkUsed when being decoded to data；
Wherein, the pre-coding matrix obtained using current iteration, this decoding matrix is specifically obtained in the following way, specifically
Including：
<mrow>
<msubsup>
<mi>G</mi>
<mi>k</mi>
<mrow>
<mo>(</mo>
<mi>f</mi>
<mo>)</mo>
</mrow>
</msubsup>
<mo>=</mo>
<mfrac>
<msup>
<mrow>
<mo>(</mo>
<mover>
<msub>
<mi>H</mi>
<mi>k</mi>
</msub>
<mo>&OverBar;</mo>
</mover>
<msup>
<msub>
<mi>W</mi>
<mi>k</mi>
</msub>
<mrow>
<mo>(</mo>
<mi>f</mi>
<mo>)</mo>
</mrow>
</msup>
<mo>)</mo>
</mrow>
<mi>H</mi>
</msup>
<mrow>
<mo>|</mo>
<mo>|</mo>
<mover>
<msub>
<mi>H</mi>
<mi>k</mi>
</msub>
<mo>&OverBar;</mo>
</mover>
<msup>
<msub>
<mi>W</mi>
<mi>k</mi>
</msub>
<mrow>
<mo>(</mo>
<mi>f</mi>
<mo>)</mo>
</mrow>
</msup>
<mo>|</mo>
<msup>
<mo>|</mo>
<mn>2</mn>
</msup>
</mrow>
</mfrac>
</mrow>
Wherein, Gk (f)The decoding matrix obtained for current iteration.
2. the method as described in claim 1, it is characterised in that specifically in the following way to HkCarry out singular value decomposition acquisition
The decoding matrix used first during iteration：
<mrow>
<msub>
<mi>H</mi>
<mi>k</mi>
</msub>
<mo>=</mo>
<msub>
<mi>U</mi>
<mi>k</mi>
</msub>
<msub>
<mo>&Element;</mo>
<mi>k</mi>
</msub>
<msubsup>
<mi>V</mi>
<mi>k</mi>
<mi>H</mi>
</msubsup>
</mrow>
<mrow>
<mover>
<msub>
<mi>G</mi>
<mi>k</mi>
</msub>
<mo>&OverBar;</mo>
</mover>
<mo>=</mo>
<msubsup>
<mi>U</mi>
<mrow>
<mi>k</mi>
<mo>,</mo>
<mo>&lsqb;</mo>
<msub>
<mi>m</mi>
<mi>k</mi>
</msub>
<mo>&rsqb;</mo>
</mrow>
<mi>H</mi>
</msubsup>
</mrow>
Wherein, HkFor Nk× M matrix, NkFor user UEkReception antenna quantity, M be base station number of transmission antennas, UkIt is Nk
× M ties up unitary matrice, ∈k=diag (σ1, σ2..., σr), r=rank (Hk), σ1, σ2..., σrIt is HkSingular value, VkIt is M × M
Tie up unitary matrice,The decoding matrix used for iteration first,For UkPreceding mkRow, mkFor user UEkData transfer
The number of plies.
3. the method as described in claim 1, it is characterised in that utilize HkThe decoding matrix obtained with last iteration, obtains this
Pre-coding matrix, specifically include：
Utilize HkThe decoding matrix obtained with last iteration, obtain this equivalent channel matrix
<mrow>
<msup>
<mover>
<msub>
<mi>H</mi>
<mi>k</mi>
</msub>
<mo>&OverBar;</mo>
</mover>
<mrow>
<mo>(</mo>
<mi>f</mi>
<mo>)</mo>
</mrow>
</msup>
<mo>=</mo>
<msup>
<msub>
<mi>G</mi>
<mi>k</mi>
</msub>
<mrow>
<mo>(</mo>
<mi>f</mi>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
</msup>
<msub>
<mi>H</mi>
<mi>k</mi>
</msub>
</mrow>
Wherein, Gk (f-1)The decoding matrix obtained for last iteration；
Leakage noise ratio criterion is believed according to maximum, utilizedObtain this pre-coding matrix：
<mrow>
<msup>
<msub>
<mi>W</mi>
<mi>k</mi>
</msub>
<mrow>
<mo>(</mo>
<mi>f</mi>
<mo>)</mo>
</mrow>
</msup>
<mo>=</mo>
<munder>
<mrow>
<mi>e</mi>
<mi>i</mi>
<mi>g</mi>
</mrow>
<msub>
<mi>m</mi>
<mi>k</mi>
</msub>
</munder>
<mo>&lsqb;</mo>
<msup>
<mrow>
<mo>(</mo>
<munderover>
<munder>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
</munder>
<mrow>
<mi>i</mi>
<mo>&NotEqual;</mo>
<mi>k</mi>
</mrow>
<mi>K</mi>
</munderover>
<msup>
<mover>
<msub>
<mi>H</mi>
<mi>k</mi>
</msub>
<mo>&OverBar;</mo>
</mover>
<msup>
<mrow>
<mo>(</mo>
<mi>f</mi>
<mo>)</mo>
</mrow>
<mi>H</mi>
</msup>
</msup>
<msup>
<mover>
<msub>
<mi>H</mi>
<mi>k</mi>
</msub>
<mo>&OverBar;</mo>
</mover>
<mrow>
<mo>(</mo>
<mi>f</mi>
<mo>)</mo>
</mrow>
</msup>
<mo>)</mo>
</mrow>
<mrow>
<mo>-</mo>
<mn>1</mn>
</mrow>
</msup>
<msup>
<mover>
<msub>
<mi>H</mi>
<mi>k</mi>
</msub>
<mo>&OverBar;</mo>
</mover>
<msup>
<mrow>
<mo>(</mo>
<mi>f</mi>
<mo>)</mo>
</mrow>
<mi>H</mi>
</msup>
</msup>
<msup>
<mover>
<msub>
<mi>H</mi>
<mi>k</mi>
</msub>
<mo>&OverBar;</mo>
</mover>
<mrow>
<mo>(</mo>
<mi>f</mi>
<mo>)</mo>
</mrow>
</msup>
<mo>&rsqb;</mo>
</mrow>
Wherein, Wk (f)For this pre-coding matrix, K is total number of users amount, k=1,2,3 ..., K corresponding to the base station.
4. the method as described in claim 1, it is characterised in that specifically calculate what adjacent iteration twice obtained in the following way
Error between pre-coding matrix：
<mrow>
<msub>
<mi>&mu;</mi>
<mi>k</mi>
</msub>
<mo>=</mo>
<mo>|</mo>
<mo>|</mo>
<msubsup>
<mi>W</mi>
<mi>k</mi>
<mrow>
<mo>(</mo>
<mi>f</mi>
<mo>)</mo>
</mrow>
</msubsup>
<mo>-</mo>
<msubsup>
<mi>W</mi>
<mi>k</mi>
<mrow>
<mo>(</mo>
<mi>f</mi>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
</msubsup>
<mo>|</mo>
<msup>
<mo>|</mo>
<mn>2</mn>
</msup>
</mrow>
Wherein, μkError between the pre-coding matrix obtained for adjacent iteration twice, Wk (f-1)Prelisted for what last iteration obtained
Code matrix.
A kind of 5. multi-user pre-coding information determining means, it is characterised in that including：
Subscriber channel estimation module, for estimating base station and user UEkBetween channel matrix Hk；
Matrix deciding module, for believing leakage noise ratio criterion according to maximum, following iterative process is repeated to adjacent iteration twice
Error is less than predetermined threshold between obtained pre-coding matrix：Utilize HkThe decoding matrix obtained with last iteration, obtain this
Pre-coding matrix；The pre-coding matrix obtained using current iteration, obtain this decoding matrix；Wherein, first iteration when, meter
The decoding matrix that pre-coding matrix uses is calculated to pass through to HkCarry out singular value decomposition acquisition；
Terminate module, for the pre-coding matrix and decoding matrix for obtaining last time iteration, base station is respectively used to issuing
User UEkSignal precoding when use, and user UEkUsed when being decoded to data；
Wherein, the pre-coding matrix that the matrix deciding module is specifically obtained using current iteration in the following way, this is obtained
Secondary decoding matrix：
<mrow>
<msubsup>
<mi>G</mi>
<mi>k</mi>
<mrow>
<mo>(</mo>
<mi>f</mi>
<mo>)</mo>
</mrow>
</msubsup>
<mo>=</mo>
<mfrac>
<msup>
<mrow>
<mo>(</mo>
<mover>
<msub>
<mi>H</mi>
<mi>k</mi>
</msub>
<mo>&OverBar;</mo>
</mover>
<msup>
<msub>
<mi>W</mi>
<mi>k</mi>
</msub>
<mrow>
<mo>(</mo>
<mi>f</mi>
<mo>)</mo>
</mrow>
</msup>
<mo>)</mo>
</mrow>
<mi>H</mi>
</msup>
<mrow>
<mo>|</mo>
<mo>|</mo>
<mover>
<msub>
<mi>H</mi>
<mi>k</mi>
</msub>
<mo>&OverBar;</mo>
</mover>
<msup>
<msub>
<mi>W</mi>
<mi>k</mi>
</msub>
<mrow>
<mo>(</mo>
<mi>f</mi>
<mo>)</mo>
</mrow>
</msup>
<mo>|</mo>
<msup>
<mo>|</mo>
<mn>2</mn>
</msup>
</mrow>
</mfrac>
</mrow>
Wherein, Gk (f)The decoding matrix obtained for current iteration.
6. device as claimed in claim 5, it is characterised in that
The matrix deciding module is specific in the following way to HkCarry out singular value decomposition and obtain the decoding used during iteration first
Matrix：
<mrow>
<msub>
<mi>H</mi>
<mi>k</mi>
</msub>
<mo>=</mo>
<msub>
<mi>U</mi>
<mi>k</mi>
</msub>
<msub>
<mo>&Element;</mo>
<mi>k</mi>
</msub>
<msubsup>
<mi>V</mi>
<mi>k</mi>
<mi>H</mi>
</msubsup>
</mrow>
<mrow>
<mover>
<msub>
<mi>G</mi>
<mi>k</mi>
</msub>
<mo>&OverBar;</mo>
</mover>
<mo>=</mo>
<msubsup>
<mi>U</mi>
<mrow>
<mi>k</mi>
<mo>,</mo>
<mo>&lsqb;</mo>
<msub>
<mi>m</mi>
<mi>k</mi>
</msub>
<mo>&rsqb;</mo>
</mrow>
<mi>H</mi>
</msubsup>
</mrow>
Wherein, HkFor Nk× M matrix, NkFor user UEkReception antenna quantity, M be base station number of transmission antennas, UkIt is Nk
× M ties up unitary matrice, ∈k=diag (σ1, σ2..., σr), r=rank (Hk), σ1, σ2..., σrIt is HkSingular value, VkIt is M × M
Tie up unitary matrice,The decoding matrix used for iteration first,For UkPreceding mkRow, mkFor user UEkData transfer
The number of plies.
7. device as claimed in claim 5, it is characterised in that the matrix deciding module specifically utilizes H in the following wayk
The decoding matrix obtained with last iteration, obtain this pre-coding matrix：
Utilize HkThe decoding matrix obtained with last iteration, obtain this equivalent channel matrix
<mrow>
<msup>
<mover>
<msub>
<mi>H</mi>
<mi>k</mi>
</msub>
<mo>&OverBar;</mo>
</mover>
<mrow>
<mo>(</mo>
<mi>f</mi>
<mo>)</mo>
</mrow>
</msup>
<mo>=</mo>
<msup>
<msub>
<mi>G</mi>
<mi>k</mi>
</msub>
<mrow>
<mo>(</mo>
<mi>f</mi>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
</msup>
<msub>
<mi>H</mi>
<mi>k</mi>
</msub>
</mrow>
Wherein, Gk (f-1)The decoding matrix obtained for last iteration；
Leakage noise ratio criterion is believed according to maximum, utilizedObtain this pre-coding matrix：
<mrow>
<msup>
<msub>
<mi>W</mi>
<mi>k</mi>
</msub>
<mrow>
<mo>(</mo>
<mi>f</mi>
<mo>)</mo>
</mrow>
</msup>
<mo>=</mo>
<munder>
<mrow>
<mi>e</mi>
<mi>i</mi>
<mi>g</mi>
</mrow>
<msub>
<mi>m</mi>
<mi>k</mi>
</msub>
</munder>
<mo>&lsqb;</mo>
<msup>
<mrow>
<mo>(</mo>
<munderover>
<munder>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
</munder>
<mrow>
<mi>i</mi>
<mo>&NotEqual;</mo>
<mi>k</mi>
</mrow>
<mi>K</mi>
</munderover>
<msup>
<mover>
<msub>
<mi>H</mi>
<mi>k</mi>
</msub>
<mo>&OverBar;</mo>
</mover>
<msup>
<mrow>
<mo>(</mo>
<mi>f</mi>
<mo>)</mo>
</mrow>
<mi>H</mi>
</msup>
</msup>
<msup>
<mover>
<msub>
<mi>H</mi>
<mi>k</mi>
</msub>
<mo>&OverBar;</mo>
</mover>
<mrow>
<mo>(</mo>
<mi>f</mi>
<mo>)</mo>
</mrow>
</msup>
<mo>)</mo>
</mrow>
<mrow>
<mo>-</mo>
<mn>1</mn>
</mrow>
</msup>
<msup>
<mover>
<msub>
<mi>H</mi>
<mi>k</mi>
</msub>
<mo>&OverBar;</mo>
</mover>
<msup>
<mrow>
<mo>(</mo>
<mi>f</mi>
<mo>)</mo>
</mrow>
<mi>H</mi>
</msup>
</msup>
<msup>
<mover>
<msub>
<mi>H</mi>
<mi>k</mi>
</msub>
<mo>&OverBar;</mo>
</mover>
<mrow>
<mo>(</mo>
<mi>f</mi>
<mo>)</mo>
</mrow>
</msup>
<mo>&rsqb;</mo>
</mrow>
Wherein, Wk (f)For this pre-coding matrix, K is total number of users amount, k=1,2,3 ..., K corresponding to the base station.
8. device as claimed in claim 5, it is characterised in that the matrix deciding module specifically calculates phase in the following way
Error between the adjacent pre-coding matrix that iteration obtains twice：
<mrow>
<msub>
<mi>&mu;</mi>
<mi>k</mi>
</msub>
<mo>=</mo>
<mo>|</mo>
<mo>|</mo>
<msubsup>
<mi>W</mi>
<mi>k</mi>
<mrow>
<mo>(</mo>
<mi>f</mi>
<mo>)</mo>
</mrow>
</msubsup>
<mo>-</mo>
<msubsup>
<mi>W</mi>
<mi>k</mi>
<mrow>
<mo>(</mo>
<mi>f</mi>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
</msubsup>
<mo>|</mo>
<msup>
<mo>|</mo>
<mn>2</mn>
</msup>
</mrow>
Wherein, μkError between the pre-coding matrix obtained for adjacent iteration twice, Wk (f-1)Prelisted for what last iteration obtained
Code matrix.
9. the device as described in any one of claim 5~8, it is characterised in that described device is that base station or user receive and set
It is standby.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110237551.6A CN102263614B (en) | 2011-08-18 | 2011-08-18 | A kind of method for multi-user pre-coding and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110237551.6A CN102263614B (en) | 2011-08-18 | 2011-08-18 | A kind of method for multi-user pre-coding and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102263614A CN102263614A (en) | 2011-11-30 |
| CN102263614B true CN102263614B (en) | 2018-01-30 |
Family
ID=45010092
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110237551.6A Active CN102263614B (en) | 2011-08-18 | 2011-08-18 | A kind of method for multi-user pre-coding and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102263614B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108259072B (en) * | 2018-01-10 | 2020-09-15 | 杭州电子科技大学 | Method for reducing training sequence overhead for FDD large-scale MIMO downlink system |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102055563A (en) * | 2010-12-24 | 2011-05-11 | 清华大学 | Adaptive joint linear precoding method applicable to multi-base station coordination |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090323773A1 (en) * | 2008-06-30 | 2009-12-31 | Interdigital Patent Holdings, Inc. | Method and apparatus for signaling precoding vectors |
-
2011
- 2011-08-18 CN CN201110237551.6A patent/CN102263614B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102055563A (en) * | 2010-12-24 | 2011-05-11 | 清华大学 | Adaptive joint linear precoding method applicable to multi-base station coordination |
Non-Patent Citations (1)
| Title |
|---|
| "连续迭代优化SLNR准则的下行多用户MIMO预编码";高献坤等;《应用科学学报》;20110530 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102263614A (en) | 2011-11-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101378277B (en) | Multi-user pre-coding and dispatching method and realize the base station of the method | |
| Ni et al. | Optimal pilot design in massive MIMO systems based on channel estimation | |
| CN102223327B (en) | SAGE (Space-alternating Generalized Expectation-maximization) based channel estimation method in CoMP multi-user system | |
| CN105356921A (en) | Reduced complexity beam-steered MIMO OFDM system | |
| CN104202118A (en) | Pre-coding codebook and feedback expression | |
| CN103685090A (en) | Apparatus for MIMO channel performance prediction | |
| CN104702390A (en) | Pilot frequency distribution method in distributed compressive sensing (DCS) channel estimation | |
| Ngo et al. | Blind estimation of effective downlink channel gains in massive MIMO | |
| CN102227098B (en) | Selection method of bearing point of frequency domain of multi-mode MIMO-SCFDE adaptive transmission system | |
| CN104219189A (en) | Angle-time delay domain pilot frequency multiplexing broadband mass MIMO (multiple input multiple output) communication method | |
| CN103580789B (en) | Coordinated multipoint transmission recoding processing method, apparatus and system | |
| CN104852878A (en) | Downlink multiuser MIMO (Multiple-Input Multiple-Output) system pre-encoding method capable of lowering complexity based on sum mean square error minimum principle | |
| CN101854234A (en) | MIMO (Multiple Input Multiple Output) system and optimization method of downlink thereof | |
| CN103607234A (en) | Relay combination receiving method and system thereof | |
| CN102801505B (en) | Multi-user collaborative sending method, method of reseptance and communicator | |
| CN102263614B (en) | A kind of method for multi-user pre-coding and device | |
| EP2490346B1 (en) | Method for increasing quality of signals received by at least one destination device among a plurality | |
| CN103973409A (en) | Pre-coding device and transmitter with same | |
| CN103338066B (en) | A kind of multiplex data stream transmission method based on Maximizing Minimum Distance criterion | |
| Roger Varea et al. | Non-coherent MIMO communication for the 5th generation mobile: Overview and practical aspects | |
| CN105429687A (en) | Interference alignment method for minimizing interference power and dimension | |
| CN102983933A (en) | Method and device and system of signal transmission and signal decoding | |
| CN105049099A (en) | Multi-antenna self-adaptive scheduling method for LTE multi-antenna system | |
| CN102006146A (en) | User scheduling method for multiple-user multiple input multiple output (MU-MIMO) system downlink | |
| CN101252419A (en) | Capacity evaluating method using channel statistical information in multi-aerial transmission system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |