CN103957086A - Achieving method for MU-MIMO precoding - Google Patents
Achieving method for MU-MIMO precoding Download PDFInfo
- Publication number
- CN103957086A CN103957086A CN201410145931.0A CN201410145931A CN103957086A CN 103957086 A CN103957086 A CN 103957086A CN 201410145931 A CN201410145931 A CN 201410145931A CN 103957086 A CN103957086 A CN 103957086A
- Authority
- CN
- China
- Prior art keywords
- overbar
- matrix
- alpha
- user
- precoding
- 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
Landscapes
- Radio Transmission System (AREA)
Abstract
The invention discloses an achieving method for MU-MIMO precoding. The method includes the detailed steps that a first precoding matrix is obtained through performing improved QR decomposition on expanding matrixes H of joint channel matrixes HS of all users to eliminate multi-user interference, precoding matrixes of all the users are determined according to a QR decomposition result, and therefore calculation complexity is reduced; then a lattice reduction method is used for obtaining a second precoding matrix better in performance. Compared with a traditional MU-MIMO precoding method, the method is lower in complexity, and meanwhile system performance is improved.
Description
Technical field
The invention belongs to mobile communication technology field, relate to multiple-input and multiple-output (Multiple Input Multiple Output, MIMO) technology wherein, be specifically related to the precoding algorithm in multiuser MIMO (multiuser MIMO, MU-MIMO) system.
Background technology
MIMO, as a kind of technology that can significantly improve wireless communication spectrum efficiency, has received increasing concern under the day by day rare background of frequency spectrum resource.Along with going deep into of multi-antenna technology research, MIMO technology has expanded to the multi-user system of point-to-multipoint from point-to-point single user system.In MU-MIMO system, base station (Base Station, BS) is simultaneously to a plurality of user's transmitted signals, because a plurality of users share same running time-frequency resource, will certainly cause inter-user interference (Multi-user Interference, MUI), greatly reduce the efficiency of transmission of system.In order to meet the requirement of next generation communication system to high data rate communication, the precoding technique that can effectively suppress MUI occurs in a large number.
In descending MU-MIMO system, the precoding algorithm of known preferred is dirty paper code (Dirty Paper Coding, DPC), but because computational complexity is too high, is difficult to use in real system.Therefore the low complex degree precoding algorithm of some suboptimums is suggested, and wherein, block diagonalization (Block Diagonalization, BD) precoding algorithm is widely used a kind of in current MU-MIMO, and the main thought of this algorithm may be summarized to be following 2 points:
Each user utilizes singular value decomposition (Singular Value Decomposition, SVD) to find the null space basis of other user's combined channel matrixes, and the pre-coding matrix that forms oneself with it, eliminates MUI with this, obtains equivalent SU-MIMO channel; Equivalent SU-MIMO channel is carried out to singular value decomposition, and utilizing SVD precoding algorithm optimization system is energy.
Therefore user's pre-coding matrix W can be divided into two parts: W=W
aw
b, respectively corresponding above-mentioned 2 points.Although traditional B D-algorithm can be eliminated MUI completely, but need to use the singular value decomposition (SVD) twice with higher computational complexity to ask for each user's pre-coding matrix, increased the complexity of algorithm itself, therefore having limited the use of algorithm in real system, a kind of GZI(Generalized ZF Channel Inversion of low complex degree) precoding algorithm is suggested.
Respectively BD and two kinds of method for precoding of GZI are carried out to brief description below.
(1), BD method for precoding
For convenience of explanation and analyze, suppose in MU-MIMO system, the number of transmit antennas of base station end is N
t, k user's reception antenna number is N
k, total number of users is K, K the total reception antenna of user received number and is
the number of transmit antennas N of base station end
tbe more than or equal to the total N of user's reception antenna
r.
To any user k, its channel matrix is H
k, interference channel matrix is
Pre-coding matrix is W
k; All K user's combined channel matrix is
Associating pre-coding matrix is W=[W
1w
2w
k].
The method comprises the following steps:
Step 1, base station obtains each user's down channel matrix H
k(k=1,2 ..., K).Under time division duplex multiplexing (TDD) pattern, user's channel information can be known by channel reciprocity in base station; Under Frequency Division Duplexing (FDD) multiplexing (FDD) pattern, its channel information can be known by the feedback of user terminal in base station.
Step 2, the interference channel matrix to any user k
Carry out SVD decomposition
Wherein,
be
left singular matrix,
be
singular value diagonal matrix,
with
be respectively
front r row and the rear (N of right singular matrix
t-r) row, r is matrix
order.From matrix theory knowledge,
be
kernel orthogonal basis,
so
can be used as the first of user k pre-coding matrix
with this, eliminate inter-user interference, obtain independently equivalent channel matrix
Concerning all K user, the first of its associating pre-coding matrix is
With this by many of MU-MIMO channel decomposing parallel equivalent SU-MIMO channels independently:
Step 3, in order to obtain the maximum precoding gain of equivalent channel matrix, carries out SVD decomposition again to equivalent SU-MIMO channel
Wherein, U
kbe
left singular matrix, Σ
kbe
singular value diagonal matrix, V
kbe
right singular matrix,
v
kfront N
krow.According to alone family SVD precoding algorithm, choose
as pre-coding matrix, can obtain the maximum precoding gain under Single User MIMO system.Therefore the second portion of the pre-coding matrix of user k is
concerning all K user, the second portion of its associating pre-coding matrix is
Step 4, obtains the pre-coding matrix of whole system: W=W
aw
b.
(2), GZI method for precoding
The method comprises the following steps:
Step 1, calculates combined channel matrix H
spseudoinverse:
wherein,
be
submatrix, dimension is N
t* N
k;
Step 2 is right
carry out QR decomposition:
wherein,
orthogonal matrix,
it is upper triangular matrix.Known according to the character of pseudoinverse
?
because
invertible matrix,
so
can be used as the first of user k pre-coding matrix
thereby obtain independently equivalent channel matrix
Concerning all K user, the first of its associating pre-coding matrix is
Step 3, in order to obtain the maximum precoding gain of equivalent channel matrix, carries out SVD decomposition again to equivalent SU-MIMO channel
Choose right singular matrix V
kfront N
krow are as the second portion of the pre-coding matrix of user k,
concerning all K user, the second portion of its associating pre-coding matrix is
Step 4, obtains the pre-coding matrix W=W of whole system
aw
b.
Although GZI method for precoding decomposes with solving pseudo-inverse operation and QR the SVD decomposition having replaced in the BD method for precoding first step, complexity decreases, but solve pseudoinverse and remain the computing that a kind of complexity is higher, and two kinds of methods all need to carry out SVD decomposition for each user's equivalent channel matrix, so the complexity of GZI method for precoding is still higher.
Summary of the invention
The problems referred to above that exist for prior art, the present invention has designed a kind of MU-MIMO method for precoding based on improved QR decomposition and lattice reduction method, and the method, when reducing traditional MU-MIMO precoding algorithm complex, has improved algorithm performance.
Concrete technical scheme of the present invention is: a kind of MU-MIMO precoding implementation method, specifically comprises the steps:
The all K of step 1. user's combined channel matrix is
To associating channel matrix H
sexpand:
Wherein, α=N
rσ
2/ P
total, σ
2the variance that represents noise, P
totalrepresent the total transmitted power of down link,
expression dimension is N
r* N
runit matrix;
Step 2. pair extended channel matrices
conjugate transpose
carry out QR decomposition:
Obtaining dimension is N
r* N
rupper triangular matrix
with dimension be (N
t+ N
r) * N
runitary matrice
and use
represent unitary matrice
front N
toK,
represent unitary matrice
rear N
roK;
Step 3. by
Obtain
And then obtain
Wherein,
be
submatrix, dimension is N
t* N
k, N
kit is k user's reception antenna number;
Step 4. is obtained
orthogonal basis P
k, the first of the pre-coding matrix of user k is arbitrarily
with this, eliminate inter-user interference, thereby obtain the equivalent channel matrix after precoding for the first time
Concerning all K user, the first of its associating pre-coding matrix is W
a=[P
1p
2p
k], with this by many of MU-MIMO channel decomposing equivalent SU-MIMO channel independently, H
sw
a=diag{H
1p
1, H
2p
2..., H
kp
k;
The equivalent channel matrix of step 5. couple any user k
transposition
carry out Ge Jiyue and subtract (LR) operation:
transformation matrix T
kfor unimodular matrix, i.e. T
kthe value of middle element is that complex integers and determinant meet det (T
k)=± 1;
According to the character of LR, after approximately subtracting, obtain the better equivalent channel matrix of orthogonality
can effectively reduce noise scale-up problem.
Equivalent channel matrix after step 6. pair approximately subtracts
expand:
Step 7. pair extended channel matrices
conjugate transpose
carry out QR decomposition:
Obtaining dimension is N
k* N
kupper triangular matrix
with dimension be (N
k+ N
k) * N
kunitary matrice
and use
represent unitary matrice
front N
koK,
represent unitary matrice
rear N
koK.
Step 8. by
Obtain
So
Step 9. couple any user k, will
as the second portion of pre-coding matrix,
Concerning all K user, the second portion of its associating pre-coding matrix is
Step 10. is obtained the pre-coding matrix W=W of whole system
aw
b.
Beneficial effect of the present invention: method of the present invention is the combined channel matrix H to all users first
sextended matrix
carry out improved QR and decompose to obtain first pre-coding matrix to eliminate multi-user interference, and according to the result of QR decomposition, determine each user's pre-coding matrix, reduced the complexity of calculating; Then utilize lattice reduction (LR) method to obtain second more excellent pre-coding matrix of performance, method of the present invention when obtaining more low complex degree, has improved systematic function than traditional MU-MIMO method for precoding.
Accompanying drawing explanation
Fig. 1 is multi-user MIMO system schematic diagram in the embodiment of the present invention.
Fig. 2 is that the complexity of the inventive method and traditional B D and GZI method compares schematic diagram.
Fig. 3 is that the complexity of the inventive method and traditional B D and GZI method compares schematic diagram.
Fig. 4 is that the power system capacity of the inventive method and traditional B D and GZI method compares schematic diagram.
Fig. 5 is that the error rate of the inventive method and traditional B D and GZI method compares schematic diagram.
Embodiment
Below in conjunction with the drawings and specific embodiments, the present invention is described further.Parameter in embodiment does not affect generality of the present invention.
With analysis method for precoding of the present invention, MU-MIMO system is done to following setting: as shown in Figure 1, transmitting antenna sum is more than or equal to the sum of all user's reception antennas, i.e. N for convenience of explanation
t>=N
r; The data fluxion that each user communicates equates with its reception antenna number, and base station end transmit power allocations adopts average power allocation.
The signal that user k receives arbitrarily can be expressed as:
In formula (1), H
kk user's N
k* N
tdimension channel matrix, H
kin element separate and to obey average be 0, the multiple Gaussian Profile that variance is 1; W
kk user's N
t* N
kdimension pre-coding matrix; s
kk user's N
kdimension transmitting symbolic vector; n
kn
kthe column vector of dimension, is k user's independent identically distributed additive white Gaussian noise, and variance is σ
k 2.
The embodiment of the present invention has been simplified combined channel matrix H
sthe process that pseudoinverse solves, and consider the impact of noise on systematic function, in conjunction with Ge Jiyue, subtract (LR) technology simultaneously, improved systematic function, reduced the complexity of computing.Concrete steps are as follows:
Step 1. pair associating channel matrix H
sexpand:
Wherein, α=N
rσ
2/ P
total, σ
2the variance that represents noise, P
totalrepresent the total transmitted power of down link,
expression dimension is N
r* N
runit matrix;
In this step, by associating channel matrix H
sexpand, based on extended matrix
the computing that solves of pseudoinverse can be expressed as:
formula (2)
From formula (2), can find out the pseudoinverse of extended matrix
upper submatrix can be used as least mean-square error (MMSE) Linear precoding matrix of having considered noise factor.
Step 2. pair extended channel matrices
conjugate transpose
carry out QR decomposition:
Obtaining dimension is N
r* N
rupper triangular matrix
with dimension be (N
t+ N
r) * N
runitary matrice
and use
represent unitary matrice
front N
toK,
represent unitary matrice
rear N
roK.
The result that in this step, QR decomposes can be to pseudoinverse
solution procedure simplify:
formula (3)
From formula (3),
least mean-square error (MMSE) Linear precoding matrix of having considered noise factor, wherein,
be
submatrix, dimension is N
t* N
k.
Step 3. pair upper triangular matrix
conjugate transpose carry out inversion operation, obtain
Wherein,
be
submatrix, dimension is N
t* N
k.
In this step, can be directly to matrix
carry out inversion operation, the result that also can utilize extended channel matrices QR to decompose is obtained
to further reduce the complexity of algorithm computing.
The formula of decomposing according to extended matrix QR:
Can find out:
Can obtain upper triangular matrix thus
contrary:
upper triangular matrix
the inverse matrix of conjugate transpose can be by
the conjugate transpose of inverse matrix obtain,
Step 4. is according to upper triangular matrix
the inverse matrix of conjugate transpose
And extended channel matrices QR decomposes and to obtain
matrix, obtains the first of pre-coding matrix.
In this step, according to upper triangular matrix
the inverse matrix of conjugate transpose
And extended channel matrices QR decomposes and to obtain
matrix, obtains
But due to wherein each submatrix
row between and non-orthogonal, also need alignment to carry out orthogonalization, as used Schimidt orthogonalization (GSO) algorithm, obtain
orthogonal basis P
k, obtained considering that the first of the pre-coding matrix of respective user k after noise factor is:
Concerning all K user, the first of its associating pre-coding matrix is W
a=[P
1p
2p
k].
Step 5. is in order to obtain the maximum precoding gain of equivalent channel matrix, the equivalent channel matrix to any user k
transposition
carry out Ge Jiyue and subtract (LR) operation:
transformation matrix T
kfor unimodular matrix, i.e. T
kthe value of middle element is that complex integers and determinant meet det (T
k)=± 1.According to the character of LR, after approximately subtracting, obtain the better equivalent channel matrix of orthogonality
can effectively reduce noise scale-up problem.
Equivalent channel matrix after step 6. pair approximately subtracts
expand:
Step 7. pair extended channel matrices
conjugate transpose
carry out QR decomposition:
Obtaining dimension is N
k* N
kupper triangular matrix
with dimension be (N
k+ N
k) * N
kunitary matrice
and use
represent unitary matrice
front N
koK,
represent unitary matrice
rear N
koK.
Step 8. by
Obtain
So
Step 9. couple any user k, will
as the second portion of pre-coding matrix,
Concerning all K user, the second portion of its associating pre-coding matrix is
Step 10. is obtained the pre-coding matrix W=W of whole system
aw
b.
Through after step 10, known according to lattice reduction (LR) method, receiving terminal only needs y to received signal to carry out simple linear transformation, just can recover transmitted signal s.
The computational complexity of traditional B D method and the inventive method is analyzed the analysis of complexity of concrete as table 1(traditional B D method below), the analysis of complexity of table 2(GZI method), show the analysis of complexity of 3(the inventive method) as shown in:
Table 1
Table 2
Table 3
Below in conjunction with Fig. 2, Fig. 3, Fig. 4, Fig. 5, complexity, volumetric properties and the error rate (BER) of method for precoding of the present invention and traditional B D and GZI method for precoding are carried out to emulation comparison.
Fig. 2 has compared the complexity of traditional B D method for precoding, GZI method for precoding and the inventive method in the situation that of different user number K.System emulation condition is: each user's reception antenna is counted N
k=2 (k=1,2 ..., K), base station transmit antennas is counted N
t=KN
k, the domain of variation K=2:10 of number of users.
Fig. 3 has compared at user's reception antenna and has counted N
kthe complexity of traditional B D method for precoding, GZI method for precoding and the inventive method in different situations.System emulation condition is: number of users K=3, base station transmit antennas is counted N
t=KN
k, the domain of variation N of each user's reception antenna number
k=2:8.Can find out, traditional BD method for precoding, owing to having used the SVD that complexity is higher to decompose, causes this algorithm complex very high, and constantly increases along with the increase of number of users.Based on pseudoinverse, solve the complexity that the GZI method for precoding decomposing with QR has reduced algorithm to a certain extent.And algorithm of the present invention is on the basis of above-mentioned two kinds of methods, in conjunction with extended matrix QR, decompose and lattice reduction (LR) technology, effectively reduce the complexity of algorithm.
Fig. 4 is under the condition of different signal to noise ratios, the volumetric properties comparison diagram of traditional B D method for precoding, GZI method for precoding and the inventive method.Simulated conditions is set as: base station transmit antennas is counted N
t=4, each user's reception antenna number is 2, and number of users K=2 can find out, the inventive method has than traditional BD and the higher power system capacity of GZI method for precoding.
Fig. 5 is under the condition of different signal to noise ratios, the error rate (BER) comparison diagram of traditional B D method for precoding, GZI method for precoding and the inventive method.Simulated conditions is set as: base station transmit antennas is counted N
t=4, each user's reception antenna number is 2, number of users K=2.Can find out, the inventive method has than traditional BD and the more excellent bit error rate performance of GZI method for precoding, has further confirmed the inventive method when reducing computational complexity, can elevator system performance.
Claims (2)
1. a MU-MIMO precoding implementation method, specifically comprises the steps:
The all K of step 1. user's combined channel matrix is
To associating channel matrix H
sexpand:
Wherein, α=N
rσ
2/ P
total, σ
2the variance that represents noise, P
totalrepresent the total transmitted power of down link,
expression dimension is N
r* N
runit matrix;
Step 2. pair extended channel matrices
conjugate transpose
carry out QR decomposition:
Obtaining dimension is N
r* N
rupper triangular matrix
with dimension be (N
t+ N
r) * N
runitary matrice
and use
represent unitary matrice
front N
toK,
represent unitary matrice
rear N
roK;
Step 3. by
Obtain
And then obtain
Wherein,
be
submatrix, dimension is N
t* N
k, N
kit is k user's reception antenna number;
Step 4. is obtained
orthogonal basis P
k, the first of the pre-coding matrix of user k is arbitrarily
thereby obtain the equivalent channel matrix after precoding for the first time
Concerning all K user, the first of its associating pre-coding matrix is W
a=[P
1p
2p
k], by MU-MIMO channel decomposing, be many independently equivalent SU-MIMO channels, H
sw
a=diag{H
1p
1, H
2p
2..., H
kp
k;
The equivalent channel matrix of step 5. couple any user k
transposition
carry out Ge Jiyue and subtract (LR) operation:
transformation matrix T wherein
kfor unimodular matrix, i.e. T
kthe value of middle element is that complex integers and determinant meet det (T
k)=± 1;
Equivalent channel matrix after step 6. pair approximately subtracts
expand:
Step 7. pair extended channel matrices
conjugate transpose
carry out QR decomposition:
Obtaining dimension is N
k* N
kupper triangular matrix
with dimension be (N
k+ N
k) * N
kunitary matrice
and use
k represents unitary matrice
front N
koK,
represent unitary matrice
rear N
koK;
Step 8. by
Obtain
So
Step 9. couple any user k, will
as the second portion of pre-coding matrix, that is:
Concerning all K user, the second portion of its associating pre-coding matrix is:
Step 10. is obtained the pre-coding matrix W=W of whole system
aw
b.
2. according to the said a kind of MU-MIMO precoding implementation method of claim 1, it is characterized in that, step 4 is specifically obtained by Schimidt orthogonalization (GSO) method
orthogonal basis P
k.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410145931.0A CN103957086B (en) | 2014-04-11 | 2014-04-11 | MU MIMO precoding implementation methods |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410145931.0A CN103957086B (en) | 2014-04-11 | 2014-04-11 | MU MIMO precoding implementation methods |
Publications (2)
Publication Number | Publication Date |
---|---|
CN103957086A true CN103957086A (en) | 2014-07-30 |
CN103957086B CN103957086B (en) | 2017-03-29 |
Family
ID=51334320
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201410145931.0A Expired - Fee Related CN103957086B (en) | 2014-04-11 | 2014-04-11 | MU MIMO precoding implementation methods |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN103957086B (en) |
Cited By (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106533521A (en) * | 2016-12-12 | 2017-03-22 | 江南大学 | Method for pre-coding LR-RZF large-scale MIMO system based on truncated series expansion |
WO2017045207A1 (en) * | 2015-09-18 | 2017-03-23 | 华为技术有限公司 | Signal processing method, apparatus and system |
CN106712822A (en) * | 2017-01-06 | 2017-05-24 | 华南理工大学 | Low-complexity precoding method based on large-scale antenna system |
CN106789781A (en) * | 2017-01-12 | 2017-05-31 | 西安电子科技大学 | The interference elimination method of block diagonalization precoding is converted based on Givens |
CN106982087A (en) * | 2017-03-31 | 2017-07-25 | 电子科技大学 | A kind of communication means for multi-input multi-output system |
CN107094124A (en) * | 2016-02-18 | 2017-08-25 | 北京信威通信技术股份有限公司 | A kind of descending multi-user multi-antenna data transmission method, apparatus and system |
WO2017152747A1 (en) * | 2016-03-11 | 2017-09-14 | 电信科学技术研究院 | Csi feedback method, precoding method, and apparatus |
CN109088664A (en) * | 2018-09-06 | 2018-12-25 | 西安电子科技大学 | Self-interference suppressing method based on block diagonalization and triangle decomposition |
CN109309517A (en) * | 2017-07-28 | 2019-02-05 | 展讯通信(上海)有限公司 | Method for transmitting signals and device, computer readable storage medium, base station |
CN111555783A (en) * | 2019-02-12 | 2020-08-18 | 北京大学 | THP optimization method for jointly suppressing interference and power loss in MU-MIMO system |
CN113225117A (en) * | 2021-04-27 | 2021-08-06 | 电子科技大学 | Multi-user Massive MIMO system signal transmitting and receiving method |
CN114342279A (en) * | 2019-07-31 | 2022-04-12 | 拉姆帕特通信股份有限公司 | Communication system and method using unitary woven split multiplexing (UBDM) with physical layer security |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB2453773A (en) * | 2007-10-18 | 2009-04-22 | Toshiba Res Europ Ltd | MIMO detector with lattice reduction means which may be switched out to leave only QR decomposition to aid decoding |
CN102546088A (en) * | 2010-12-28 | 2012-07-04 | 电子科技大学 | BD (block diagonalization) pre-coding method and device |
-
2014
- 2014-04-11 CN CN201410145931.0A patent/CN103957086B/en not_active Expired - Fee Related
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB2453773A (en) * | 2007-10-18 | 2009-04-22 | Toshiba Res Europ Ltd | MIMO detector with lattice reduction means which may be switched out to leave only QR decomposition to aid decoding |
CN102546088A (en) * | 2010-12-28 | 2012-07-04 | 电子科技大学 | BD (block diagonalization) pre-coding method and device |
Non-Patent Citations (5)
Title |
---|
D. WUBBEN,R. BOHNKE,V. KUHN,K.-D. KAMMEYER: "MMSE extension of V-BLAST based on sorted QR decomposition", 《VEHICULAR TECHNOLOGY CONFERENCE, 2003. VTC 2003-FALL. 2003 IEEE 58TH》 * |
HONGSUN AN,MANAR MOHAISEN,KYUNGHI CHANG: "Lattice reduction aided precoding for multiuser MIMO using Seysen"s", 《2009 IEEE 20TH INTERNATIONAL SYMPOSIUM ON PERSONAL,INDOOR AND MOBILE》 * |
K.ZU,R.C.DE LAMARE,M.HAARDT: "Low-complexity lattice reduction-aided channel inversion methods for large multi-user MIMO systems", 《2012 CONFERENCE RECORD OF THE FORTY SIXTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS (ASILOMAR)》 * |
YING HUNG GAN,CONG LING,WAI HO MOW: "Complex Lattice Reduction Algorithm for Low-Complexity Full-Diversity", 《IEEE TRANSACTIONS ON SIGNAL PROCESSING》 * |
杨阳: "下行MU_MIMO预编码及用户调度技术研究", 《中国优秀硕士学位论文全文数据库(信息科技辑)》 * |
Cited By (22)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108028689A (en) * | 2015-09-18 | 2018-05-11 | 华为技术有限公司 | signal processing method, device and system |
WO2017045207A1 (en) * | 2015-09-18 | 2017-03-23 | 华为技术有限公司 | Signal processing method, apparatus and system |
CN108028689B (en) * | 2015-09-18 | 2021-06-15 | 华为技术有限公司 | Signal processing method, device and system |
CN107094124B (en) * | 2016-02-18 | 2020-02-14 | 北京信威通信技术股份有限公司 | Downlink multi-user multi-antenna data transmission method, device and system |
CN107094124A (en) * | 2016-02-18 | 2017-08-25 | 北京信威通信技术股份有限公司 | A kind of descending multi-user multi-antenna data transmission method, apparatus and system |
US10505614B2 (en) | 2016-03-11 | 2019-12-10 | China Academy Of Telecommunications Technology | CSI feedback method, precoding method, and apparatus |
WO2017152747A1 (en) * | 2016-03-11 | 2017-09-14 | 电信科学技术研究院 | Csi feedback method, precoding method, and apparatus |
CN106533521B (en) * | 2016-12-12 | 2019-08-06 | 江南大学 | A kind of extensive mimo system method for precoding of LR-RZF based on truncation series expansion |
CN106533521A (en) * | 2016-12-12 | 2017-03-22 | 江南大学 | Method for pre-coding LR-RZF large-scale MIMO system based on truncated series expansion |
CN106712822A (en) * | 2017-01-06 | 2017-05-24 | 华南理工大学 | Low-complexity precoding method based on large-scale antenna system |
CN106712822B (en) * | 2017-01-06 | 2021-02-19 | 华南理工大学 | Low-complexity precoding method based on large-scale antenna system |
CN106789781A (en) * | 2017-01-12 | 2017-05-31 | 西安电子科技大学 | The interference elimination method of block diagonalization precoding is converted based on Givens |
CN106982087A (en) * | 2017-03-31 | 2017-07-25 | 电子科技大学 | A kind of communication means for multi-input multi-output system |
CN106982087B (en) * | 2017-03-31 | 2020-04-03 | 电子科技大学 | Communication method for multi-input multi-output system |
CN109309517B (en) * | 2017-07-28 | 2020-09-01 | 展讯通信(上海)有限公司 | Signal transmission method and device, computer readable storage medium, and base station |
CN109309517A (en) * | 2017-07-28 | 2019-02-05 | 展讯通信(上海)有限公司 | Method for transmitting signals and device, computer readable storage medium, base station |
CN109088664B (en) * | 2018-09-06 | 2021-02-02 | 西安电子科技大学 | Self-interference suppression method based on block diagonalization and triangular decomposition |
CN109088664A (en) * | 2018-09-06 | 2018-12-25 | 西安电子科技大学 | Self-interference suppressing method based on block diagonalization and triangle decomposition |
CN111555783A (en) * | 2019-02-12 | 2020-08-18 | 北京大学 | THP optimization method for jointly suppressing interference and power loss in MU-MIMO system |
CN111555783B (en) * | 2019-02-12 | 2021-07-06 | 北京大学 | THP optimization method for jointly suppressing interference and power loss in MU-MIMO system |
CN114342279A (en) * | 2019-07-31 | 2022-04-12 | 拉姆帕特通信股份有限公司 | Communication system and method using unitary woven split multiplexing (UBDM) with physical layer security |
CN113225117A (en) * | 2021-04-27 | 2021-08-06 | 电子科技大学 | Multi-user Massive MIMO system signal transmitting and receiving method |
Also Published As
Publication number | Publication date |
---|---|
CN103957086B (en) | 2017-03-29 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN103957086A (en) | Achieving method for MU-MIMO precoding | |
CN101984571B (en) | Pre-coding method for multi-user MIMO system | |
CN102104404B (en) | Multi-user MIMO transmission method in wireless communication system, base station and user terminal | |
CN102983934A (en) | Method and device for linear precoding in multi-user multiple input multiple output system | |
US8964869B2 (en) | Pre-coding method and apparatus | |
CN101986575B (en) | Precoding method for multi-user multiple input multiple output (MIMO) system | |
US8218668B2 (en) | Multi-user MIMO method, apparatus and communication system for transmitting signal | |
CN102025462B (en) | Block diagonalization precoding method used in MU-MIMO (Multiuser-Multiple Input Multiple Output) system down link | |
CN102510324B (en) | Signal transmission method based on network coding in multi-input and multi-output Y channel | |
CN101964695B (en) | Method and system for precoding multi-user multi-input multi-output downlink | |
US20150215009A1 (en) | System and Method for Early Termination in Iterative Null-Space Directed Singular Value Decomposition for MIMO | |
CN102684766B (en) | Low-complexity precoding method for downlink multi-user multiple-input multiple-output (MIMO) system | |
CN102970103A (en) | Inter-user interference rejection pre-coding method for multi-user joint transmission | |
CN102104451A (en) | Multi-user receiving and transmitting combined precoding method and device in multi-input multi-output system | |
Jing et al. | Linear Space-Time Interference Alignment for $ K $-User MIMO Interference Channels | |
CN102946267A (en) | QR (quadrature rectangle) decomposition-based low-complexity MIMO (multi-input multi-output) detecting algorithm | |
CN102158270B (en) | Sub-channel selecting and pre-code sending method of multi-user MIMO (Multiple Input Multiple Output) system | |
Wu et al. | QR decomposition and gram Schmidt orthogonalization based low-complexity multi-user MIMO precoding | |
CN102412933B (en) | Precoding method and matrix generating device of CoMP (coordinated multi-point) multiple-user MIMO (multiple-input multi output) system | |
CN101378282B (en) | Method and apparatus for processing signal of multi-input multi-output system | |
Neumann et al. | Rate-balancing in massive MIMO using statistical precoding | |
CN103036656B (en) | Double-codebook multi-user multiple-input multiple-output (MU-MIMO) precoding method based on Schmidt orthonormalization | |
CN105207704A (en) | Precoding-scheme-based downlink precoding method for multi-user multi-input and multi-output system | |
CN102404090B (en) | Downlink transmission method for multi-user MIMO (Multiple Input Multiple Output) system based on singular value decomposition | |
Shen et al. | User capacity of pilot-contaminated TDD massive MIMO systems |
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 | ||
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170329 Termination date: 20180411 |
|
CF01 | Termination of patent right due to non-payment of annual fee |