CN106789781A - The interference elimination method of block diagonalization precoding is converted based on Givens - Google Patents
The interference elimination method of block diagonalization precoding is converted based on Givens Download PDFInfo
- Publication number
- CN106789781A CN106789781A CN201710021845.2A CN201710021845A CN106789781A CN 106789781 A CN106789781 A CN 106789781A CN 201710021845 A CN201710021845 A CN 201710021845A CN 106789781 A CN106789781 A CN 106789781A
- Authority
- CN
- China
- Prior art keywords
- matrix
- user
- channel matrix
- selected user
- federated
- 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.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L25/00—Baseband systems
- H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
- H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
- H04L25/03891—Spatial equalizers
- H04L25/03898—Spatial equalizers codebook-based design
- H04L25/0391—Spatial equalizers codebook-based design construction details of matrices
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L25/00—Baseband systems
- H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
- H04L25/0202—Channel estimation
- H04L25/0204—Channel estimation of multiple channels
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Power Engineering (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The present invention discloses a kind of interference elimination method that block diagonalization precoding is converted based on Givens, and specific steps include：(1) channel matrix of participation precoding is estimated；(2) QR decomposition is carried out to the federated user channel matrix after conjugate transposition；(3) pseudoinverse of federated user channel matrix is sought；(4) first half of pre-coding matrix is constructed；(5) latter half of pre-coding matrix is constructed；(6) final joint pre-coding matrix is obtained.The present invention obtains the more preferable orthogonal matrix of orthogonality with a kind of interference elimination method that block diagonalization precoding is converted based on Givens, so as to obtain the orthonormal basis of more accurate subscriber channel matrix kernel, finally gives required joint pre-coding matrix.The present invention can be used to eliminate inter-user interference in multi-user comm, and lifting user receives the quality of signal and the stability of system.
Description
Technical field
The invention belongs to communication technical field, the one kind further related in radio communication precoding technique field is based on
Robin Givens Givens converts the interference elimination method of block diagonalization precoding.The present invention can be used in multi-user comm eliminate
Inter-user interference, lifting user receives the quality of signal and the stability of system.
Background technology
Precoding technique refers to before downlink base station end is to multiple user's broadcast transmission signals, mixed signal to be entered
Row pretreatment so that user's receiving terminal can isolate useful signal in mixing receives signal easily, reduce or eliminate user
Between disturb.Because the disposal ability of base station end is much larger than user terminal, thus precoding technique also releases the treatment pressure of user terminal
Power.
Precoding technique is generally divided into linear predictive coding and nonlinear precoding.Although nonlinear precoding can reach reason
The channel capacity thought, but too high complexity makes it difficult to apply in practice.In linear pre-coding method, block diagonalization side
Method is the most commonly used, and it is based on ZF thought, block diagonalization treatment is carried out by channel matrix, by multi-input multi-ouput channel etc.
Multiple parallel independent spatial sub-channels are imitated into, to eliminate multi-user interference.However, traditional block diagonalization method is used each
Family will carry out singular value decomposition twice, because the complexity of singular value decomposition is higher, cause the overall complexity of method too high.
At the same time, too high complexity does not bring more preferable error performance income but, therefore, reduce complexity or the bit error rate just into
It is the key studied in precoding technique.
Paper " the Generalized Design of Low-Complexity Block that Keke Zu et al. are delivered at it
Diagonalization Type Precoding Algorithms for Multiuser MIMO Systems”(IEEE
Transactions on Communications, VOL.61, NO.10, OCTOBER 2013) in propose it is a kind of based on QR points
Solution and Maximum Likelihood Detection block diagonalization algorithm.The method asks for pseudoinverse to the equivalent channel matrix of each user, and it is entered
Row QR decomposes the kernel orthogonal basis for obtaining each user's interference channel matrix.Kernel according to each user's interference channel matrix is just
Base is handed over, the Linear precoding matrix of each user is constructed.But, the weak point that the method is still present is believed user is asked
During the pseudoinverse of road matrix kernel, computation complexity is still higher.
Patented technology " a kind of block diagonalization method for precoding and device " (application number that University of Electronic Science and Technology possesses at it：
201010622175.8, authorize publication number：CN102546088B a kind of block based on gram schmidt orthogonalization is disclosed in)
Diagonalization method for precoding.The method determines total subscriber channel matrix according to the down channel matrix of each user in system, and
QR decomposition is carried out to its associate matrix, the product of orthogonal matrix and upper triangular matrix is obtained.Again by total subscriber channel square
Matrix representation is the product of lower triangular matrix and Orthogonal Conjugate transposed matrix, and carries out inversion calculation to the lower triangular matrix, obtains
To the kernel orthogonal basis of each user's interference channel matrix.According to the kernel orthogonal basis of each user's interference channel matrix, pass through
The Linear precoding matrix of each user is constructed based on gram schmidt orthogonalization, using the Linear precoding matrix pair of construction
The transmission signal of each user carries out linear predictive coding.Due to only being decomposed to overall channel matrix, the method is further reduced
The complexity of precoding, improves code efficiency.But, the weak point that the method is still present is that user believes in system
Number the bit error rate it is still higher, signal receiving quality is not good when especially under low signal-to-noise ratio scene.
The content of the invention
The purpose of the present invention is to overcome above-mentioned the deficiencies in the prior art, there is provided one kind is pre- based on Givens conversion block diagonalizations
The interference elimination method of coding, eliminates inter-user interference in multi-user comm, and reduces the bit error rate, improves user and receives letter
Number quality, the stability of strengthening system.
Realizing thinking of the invention is：Decomposed using the QR converted based on Givens and replace height in conventional block diagonalization
The singular value decomposition operation of complexity, or replace the gram in the block diagonalization method based on gram schmidt orthogonalization to apply
Close special orthogonalization, so as to obtain the more preferable orthogonal matrix of orthogonality, and then obtains more accurate user's interference channel matrix
The orthonormal basis of kernel, obtains final pre-coding matrix, inter-user interference is eliminated, while also reducing multi-user's multi input
The bit error rate in multiple output system.
Realize comprising the following steps that for the object of the invention：
(1) channel matrix of participation precoding is estimated：
(1a) uses channel estimation methods, estimates the down channel matrix of all users for participating in precoding, composition joint
Subscriber channel matrix；
(1b) carries out conjugate transposition to federated user channel matrix, obtains the federated user channel matrix after conjugate transposition；
(2) QR decomposition is carried out to the federated user channel matrix after conjugate transposition：
QR decomposition is carried out to the federated user channel matrix after conjugate transposition, is obtained for representing federated user channel matrix
Orthogonal matrix and upper triangular matrix；
(3) pseudoinverse of federated user channel matrix is sought：
(3a) to being inverted after upper triangular matrix conjugate transposition, the lower triangular matrix after being inverted；
With orthogonal matrix be multiplied lower triangular matrix after inverting by (3b), obtains the pseudoinverse of federated user channel matrix；
(4) first half of pre-coding matrix is constructed：
The upper triangular matrix of federated user channel matrix is divided into the several submatrixs equal with number of users by (4a),
Upper triangular matrix of the submatrix that will be obtained as each user；
(4b) optional untreated user in the user of all participation precodings, to upper three angular moment of selected user
Battle array seeks the inverse of conjugate transposition, obtains the lower triangular matrix after selected user is inverted；
Lower triangular matrix after (4c) inverts selected user is multiplied with the orthogonal matrix of federated user channel matrix, obtains
The pseudoinverse of selected user channel matrix kernel；
(4d) is decomposed using the QR based on Givens conversion, and the pseudoinverse to selected user channel matrix kernel is decomposed, and is obtained
To orthogonal matrix and upper triangular matrix that selected user is decomposed；
(4e) judges whether all users have traveled through, if so, then performing step (4f), otherwise, performs step (4b)；
(4f) extracts the orthogonal matrix of each user decomposition, blocking diagonalizable matrix, using block diagonalization matrix as connection
Close the first half of pre-coding matrix；
(5) latter half of pre-coding matrix is constructed：
(5a) optional untreated user in the user of all participation precodings, by the orthogonal of selected user decomposition
Matrix and the down channel matrix multiple of selected user, obtain the equivalent single user channel matrix of selected user；
(5b) carries out singular value decomposition to the equivalent single user channel matrix of selected user, obtains the left tenth of the twelve Earthly Branches square of selected user
Battle array and the right unitary matrice of selected user；
(5c) by the preceding x right singular vector of the right unitary matrice of selected user, after selected user pre-coding matrix
Half part, the conjugate transposition of the left unitary matrice of selected user as selected user receiving matrix, x represents the equivalent of selected user
The order of single user channel matrix；
(5d) judges whether to have traveled through all users, if so, then performing step (5e), otherwise, performs step (5a)；
(5e) latter half of each user's pre-coding matrix is constituted the latter half of joint pre-coding matrix；
(6) final joint pre-coding matrix is obtained：
The first half for combining pre-coding matrix is multiplied with the latter half for combining pre-coding matrix, is finally combined
Pre-coding matrix.
The present invention has the following advantages that compared with prior art：
First, due to present invention utilizes the QR decomposition converted based on Givens, obtaining the more preferable orthogonal matrix of orthogonality,
Overcome the bit error rate of subscriber signal in the prior art shortcoming higher so that the present invention is in multi-user comm is eliminated
The bit error rate is reduced while inter-user interference.
Second, due to seeking the inverse of conjugate transposition present invention utilizes the upper triangular matrix to user, obtain subscriber channel square
Battle array kernel pseudoinverse, overcome prior art computational complexity when the pseudoinverse of subscriber channel matrix kernel is sought it is higher lack
Point so that the present invention can reduce the computational complexity that elimination is disturbed in multi-user comm, improve multi-user communication system
The code efficiency that system interference is eliminated.
Brief description of the drawings
Fig. 1 is flow chart of the invention；
Fig. 2 is analogous diagram of the invention.
Specific embodiment
Below in conjunction with the accompanying drawings, the present invention is described in further detail.
Referring to the drawings 1, specific steps of the invention are described in further detail.
Step 1, estimates to participate in the channel matrix of precoding.
Using channel estimation methods in multiuser mimo system, the down channel matrix of each user is estimated,
Composition federated user channel matrix.
Conjugate transposition is carried out to federated user channel matrix, the federated user channel matrix after conjugate transposition is obtained.
Step 2, QR decomposition is carried out to the federated user channel matrix after conjugate transposition.
QR decomposition is carried out to the federated user channel matrix after conjugate transposition, is obtained for representing federated user channel matrix
Orthogonal matrix and upper triangular matrix.
Step 3, seeks the pseudoinverse of federated user channel matrix.
To being inverted after upper triangular matrix conjugate transposition, the lower triangular matrix after being inverted.
Lower triangular matrix after inverting is multiplied with orthogonal matrix, the pseudoinverse of federated user channel matrix is obtained.
Step 4, constructs the first half of pre-coding matrix.
1st step, by the upper triangular matrix of federated user channel matrix, is divided into the several sub- square equal with number of users
Battle array, upper triangular matrix of the submatrix that will be obtained as each user.
2nd step, an optional untreated user in the user of all participation precodings, to the upper triangle of selected user
Matrix Calculating conjugate transposition it is inverse, obtain the lower triangular matrix after selected user is inverted.
3rd step, the lower triangular matrix after selected user is inverted is multiplied with the orthogonal matrix of federated user channel matrix, obtains
To the pseudoinverse of selected user channel matrix kernel.
4th step, is decomposed using the QR converted based on Givens, and the pseudoinverse to selected user channel matrix kernel is decomposed,
Obtain the orthogonal matrix and upper triangular matrix of selected user decomposition.
The formula that the QR based on Givens conversion is decomposed is as follows：
Wherein, QLkThe pseudoinverse of the channel matrix kernel of k-th selected user is represented,Represent to selected k-th
User carries out the QR based on Givens conversion and decomposes the orthogonal matrix for obtaining,Expression is based on to k-th selected user
The QR of Givens conversion decomposes the upper triangular matrix for obtaining.
5th step, judges whether all users have traveled through, if so, then performing the 6th step of this step, otherwise, performs this step
The 2nd rapid step.
6th step, extract each user decomposition orthogonal matrix, blocking diagonalizable matrix, using block diagonalization matrix as
The first half of joint pre-coding matrix.
Described to extract the orthogonal matrix that each user decomposes, the expression formula of blocking diagonalizable matrix is as follows：
Wherein, WoBlock diagonalization matrix is represented,The orthogonal matrix that extracted nth user decomposes is represented, N represents use
Family sum.
Step 5, constructs the latter half of pre-coding matrix.
1st step, an optional untreated user in the user of all participation precodings, selected user is decomposed just
The down channel matrix multiple of matrix and selected user is handed over, the equivalent single user channel matrix of selected user is obtained.
2nd step, the equivalent single user channel matrix to selected user carries out singular value decomposition, obtains the left tenth of the twelve Earthly Branches of selected user
The right unitary matrice of matrix and selected user.
3rd step, by the preceding x right singular vector of the right unitary matrice of selected user, as selected user pre-coding matrix
Latter half, the conjugate transposition of the left unitary matrice of selected user as selected user receiving matrix, x represent selected user etc.
Imitate the order of single user channel matrix.
4th step, judges whether to have traveled through all users, if so, then performing the 5th step of this step, otherwise, performs this step
The 1st step.
5th step, the latter half of each user's pre-coding matrix is constituted the latter half of joint pre-coding matrix.
Step 6, obtains final joint pre-coding matrix.
The first half for combining pre-coding matrix is multiplied with the latter half for combining pre-coding matrix, is finally combined
Pre-coding matrix.
2 analogous diagram, is described in further detail to effect of the invention referring to the drawings.
(1) simulated conditions：
It in hardware environment is Intel (R) Core (TM) i3-4170 CPU@3.70GHz that emulation experiment of the invention is, soft
Part environment is to carry out under conditions of 64 Windows operating systems.Simulation parameter is set to：Using Matlab softwares produce with
Machine input signal, per the bit of frame 180, transmits 100000 frames altogether；Modulated using QPSK, channel matrix element is independent same distribution zero
The multiple Gauss stochastic variable of average unit variance.Apply respectively to conventional block diagonalization of the prior art, based on gram
The block diagonalization method and method proposed by the present invention of close special orthogonalization carry out BER Simulation.
(2) emulation content and interpretation of result：
Fig. 2 (a) gives transmitting antenna number for 6, and number of users is 3, under per user antenna number being 2 scene, using this hair
Bright method and block diagonalization method and the mistake of conventional block diagonalization in the prior art based on gram schmidt orthogonalization
Code check is emulated.Abscissa represents signal to noise ratio in Fig. 2 (a), and ordinate represents the bit error rate, the curve table indicated with rhombus in Fig. 2 (a)
Show the curve for using the bit error rate obtained by the inventive method and signal to noise ratio change, the curve indicated with square is represented to use and is based on
The curve that the bit error rate obtained by the block diagonalization method of gram schmidt orthogonalization changes with signal to noise ratio, with the song of circular sign
Line represents the curve with signal to noise ratio change using the bit error rate obtained by conventional block diagonalization.Be can be seen that from Fig. 2 (a)
The block diagonalization method bit error rate based on gram schmidt orthogonalization is equal with the conventional block diagonalization bit error rate, and this hair
The bit error rate of bright method is than the block diagonalization method bit error rate and conventional block diagonalization based on gram schmidt orthogonalization
Low 2-4 dB of the bit error rate or so.
Fig. 2 (b) gives transmitting antenna number for 18, and number of users is 6, under per user antenna number being 3 scene, using this hair
Bright method and block diagonalization method and the mistake of conventional block diagonalization in the prior art based on gram schmidt orthogonalization
Code check is emulated.Abscissa represents signal to noise ratio in Fig. 2 (b), and ordinate represents the bit error rate, the curve table indicated with rhombus in Fig. 2 (b)
Show the curve for using the bit error rate obtained by the inventive method and signal to noise ratio change, the curve indicated with square is represented to use and is based on
The curve that the bit error rate obtained by the block diagonalization method of gram schmidt orthogonalization changes with signal to noise ratio, with the song of circular sign
Line represents the curve with signal to noise ratio change using the bit error rate obtained by conventional block diagonalization.The error code emulation knot from Fig. 2 (b)
Fruit is as can be seen that the bit error rate of the bit error rate less than the block diagonalization method based on gram schmidt orthogonalization of the inventive method
And 3-5 dB of the bit error rate of conventional block diagonalization or so.With reference to Fig. 2 (a) and Fig. 2 (b) as can be seen that with number of antennas
With the increase of number of users, it is more that the bit error rate of the inventive method is also reduced.
In sum, the inventive method can be reduced and miss on the basis of inter-user interference in eliminating multi-user comm
Code check and computational complexity, improve user's received signal quality, the stability of strengthening system.With number of antennas and number of users
Increase, it is more that the bit error rate of the inventive method is also reduced.
Claims (3)
1. a kind of interference elimination method that block diagonalization precoding is converted based on Givens, is comprised the following steps：
(1) channel matrix of participation precoding is estimated：
(1a) uses channel estimation methods, estimates the down channel matrix of all users for participating in precoding, constitutes federated user
Channel matrix；
(1b) carries out conjugate transposition to federated user channel matrix, obtains the federated user channel matrix after conjugate transposition；
(2) QR decomposition is carried out to the federated user channel matrix after conjugate transposition：
QR decomposition is carried out to the federated user channel matrix after conjugate transposition, is obtained for representing federated user channel matrix just
Hand over matrix and upper triangular matrix；
(3) pseudoinverse of federated user channel matrix is sought：
(3a) to being inverted after upper triangular matrix conjugate transposition, the lower triangular matrix after being inverted；
With orthogonal matrix be multiplied lower triangular matrix after inverting by (3b), obtains the pseudoinverse of federated user channel matrix；
(4) first half of pre-coding matrix is constructed：
The upper triangular matrix of federated user channel matrix is divided into the several submatrixs equal with number of users by (4a), will
The submatrix for arriving as each user upper triangular matrix；
(4b) optional untreated user in the user of all participation precodings, the upper triangular matrix to selected user is asked
Conjugate transposition it is inverse, obtain the lower triangular matrix after selected user is inverted；
Lower triangular matrix after (4c) inverts selected user is multiplied with the orthogonal matrix of federated user channel matrix, obtains selected
The pseudoinverse of subscriber channel matrix kernel；
(4d) is decomposed using the QR based on Givens conversion, and the pseudoinverse to selected user channel matrix kernel is decomposed, and obtains institute
From orthogonal matrix and upper triangular matrix that family is decomposed；
(4e) judges whether all users have traveled through, if so, then performing step (4f), otherwise, performs step (4b)；
(4f) extracts the orthogonal matrix of each user decomposition, and blocking diagonalizable matrix is pre- using block diagonalization matrix as joint
The first half of encoder matrix；
(5) latter half of pre-coding matrix is constructed：
(5a) optional untreated user, the orthogonal matrix that selected user is decomposed in the user of all participation precodings
With the down channel matrix multiple of selected user, the equivalent single user channel matrix of selected user is obtained；
(5b) carries out singular value decomposition to the equivalent single user channel matrix of selected user, obtain the left unitary matrice of selected user with
The right unitary matrice of selected user；
(5c) by the preceding x right singular vector of the right unitary matrice of selected user, as the latter half of of selected user pre-coding matrix
Point, the conjugate transposition of the left unitary matrice of selected user as selected user receiving matrix, x represents the equivalent alone of selected user
The order of family channel matrix；
(5d) judges whether to have traveled through all users, if so, then performing step (5e), otherwise, performs step (5a)；
(5e) latter half of each user's pre-coding matrix is constituted the latter half of joint pre-coding matrix；
(6) final joint pre-coding matrix is obtained：
By the first half for combining pre-coding matrix and the latter half multiplication for combine pre-coding matrix, obtain it is final combine prelist
Code matrix.
2. the interference elimination method that block diagonalization precoding is converted based on Givens according to claim 1, its feature exists
In the formula that the QR based on Givens conversion described in step (4d) is decomposed is as follows：
Wherein, QLkThe pseudoinverse of the channel matrix kernel of k-th selected user is represented,Represent to k-th selected user
Carry out the QR based on Givens conversion and decompose the orthogonal matrix for obtaining,Expression is based on to k-th selected user
The QR of Givens conversion decomposes the upper triangular matrix for obtaining.
3. the interference elimination method that block diagonalization precoding is converted based on Givens according to claim 1, its feature exists
In, the orthogonal matrix of each user decomposition is extracted described in step (4f), the expression formula of blocking diagonalizable matrix is as follows：
Wherein, WoBlock diagonalization matrix is represented,The orthogonal matrix that extracted nth user decomposes is represented, N represents that user is total
Number.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710021845.2A CN106789781A (en) | 2017-01-12 | 2017-01-12 | The interference elimination method of block diagonalization precoding is converted based on Givens |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710021845.2A CN106789781A (en) | 2017-01-12 | 2017-01-12 | The interference elimination method of block diagonalization precoding is converted based on Givens |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106789781A true CN106789781A (en) | 2017-05-31 |
Family
ID=58947331
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710021845.2A Pending CN106789781A (en) | 2017-01-12 | 2017-01-12 | The interference elimination method of block diagonalization precoding is converted based on Givens |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106789781A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108809389A (en) * | 2018-04-20 | 2018-11-13 | 东南大学 | QR based on the multiplexing of Givens spin matrixs decomposes block diagonalization precoding implementation method |
| CN110350962A (en) * | 2019-07-01 | 2019-10-18 | 南京邮电大学 | The extensive MIMO two stages method for precoding of multiple cell based on Givens transformation |
| CN112311430A (en) * | 2019-07-23 | 2021-02-02 | 三星电子株式会社 | Method for generating precoder in multi-user multiple-input and multiple-output communication system |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102546088A (en) * | 2010-12-28 | 2012-07-04 | 电子科技大学 | BD (block diagonalization) pre-coding method and device |
| CN103957086A (en) * | 2014-04-11 | 2014-07-30 | 电子科技大学 | Achieving method for MU-MIMO precoding |
-
2017
- 2017-01-12 CN CN201710021845.2A patent/CN106789781A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102546088A (en) * | 2010-12-28 | 2012-07-04 | 电子科技大学 | BD (block diagonalization) pre-coding method and device |
| CN103957086A (en) * | 2014-04-11 | 2014-07-30 | 电子科技大学 | Achieving method for MU-MIMO precoding |
Non-Patent Citations (2)
| Title |
|---|
| 巫健: "多用户MIMO系统中基于格基规约的低复杂度预编码技术研究", 《中国优秀硕士学位论文全文数据库信息科技辑》 * |
| 许峰等: "《线性代数第2版》", 30 April 2013 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108809389A (en) * | 2018-04-20 | 2018-11-13 | 东南大学 | QR based on the multiplexing of Givens spin matrixs decomposes block diagonalization precoding implementation method |
| CN110350962A (en) * | 2019-07-01 | 2019-10-18 | 南京邮电大学 | The extensive MIMO two stages method for precoding of multiple cell based on Givens transformation |
| CN110350962B (en) * | 2019-07-01 | 2022-03-22 | 南京邮电大学 | Multi-cell large-scale MIMO two-stage precoding method based on Givens transformation |
| CN112311430A (en) * | 2019-07-23 | 2021-02-02 | 三星电子株式会社 | Method for generating precoder in multi-user multiple-input and multiple-output communication system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104618061B (en) | The detection method of multiple user signals in a kind of large-scale multi-antenna system | |
| CN110808765B (en) | Power distribution method for optimizing spectrum efficiency of large-scale MIMO system based on incomplete channel information | |
| CN101170333B (en) | Practical environment testing platform for distributed multi-input and multi-output radio communication system | |
| CN102025462B (en) | Block diagonalization precoding method used in MU-MIMO (Multiuser-Multiple Input Multiple Output) system down link | |
| CN102647259B (en) | Singular value decomposition-based method for uplink transmission of multi-user MIMO (Multiple-Input Multiple-Output) system | |
| CN102474314B (en) | Precoding method and device | |
| CN106603130A (en) | Mixed digital-analog pre-coding method for large-scale MIMO system | |
| CN101951678B (en) | Power allocation method and device in multi-user MIMO (Multiple Input Multiple Output) system | |
| CN105515625A (en) | Multi-user downlink transmission method based on spatial modulation of receiving end | |
| CN106789781A (en) | The interference elimination method of block diagonalization precoding is converted based on Givens | |
| CN105827293A (en) | Multi-user generalized space modulation system linearity zero-forcing precoding method | |
| CN105429741B (en) | Joint virtual MIMO resource allocation methods based on dynamic subscriber's pairing | |
| de Araújo et al. | Semi-blind joint channel and symbol estimation in IRS-assisted multiuser MIMO networks | |
| CN102710390B (en) | The method and apparatus of precoding in a kind of multi-user MIMO system | |
| CN106533521B (en) | A kind of extensive mimo system method for precoding of LR-RZF based on truncation series expansion | |
| CN104065462B (en) | There is the process of signal transmission method of diversity gain under relaying interference channel | |
| CN103607234B (en) | A kind of relaying merges method of reseptance and system | |
| CN109361438B (en) | Signal-to-leakage-and-noise ratio pre-coding method for continuously optimizing and matching leakage weighting | |
| CN106130938A (en) | TDD extensive mimo system multi-user association channel estimation methods | |
| CN102130753B (en) | Method and system for processing signal | |
| CN106301634A (en) | A kind of large-scale antenna array relay transmission method using numerical model analysis to detect | |
| CN107733487B (en) | Signal detection method and device for large-scale multi-input multi-output system | |
| CN114301742B (en) | Channel estimation method and device | |
| CN102006146A (en) | User scheduling method for multiple-user multiple input multiple output (MU-MIMO) system downlink | |
| CN102104879A (en) | Multi-cell cooperative transmission method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170531 |
|
| RJ01 | Rejection of invention patent application after publication |