CN109728891A - User's matching method in MU-MIMO system based on cluster - Google Patents
User's matching method in MU-MIMO system based on cluster Download PDFInfo
- Publication number
- CN109728891A CN109728891A CN201811600741.8A CN201811600741A CN109728891A CN 109728891 A CN109728891 A CN 109728891A CN 201811600741 A CN201811600741 A CN 201811600741A CN 109728891 A CN109728891 A CN 109728891A
- Authority
- CN
- China
- Prior art keywords
- user
- resource block
- class
- group
- calculates
- 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
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses user's matching method in a kind of MU-MIMO system based on cluster, mainly solve the problems, such as that the prior art availability of frequency spectrum is low and solving complexity is high.Its technical solution is: 1., which generate resource block using partition method, decouples perfect set；2. determining number and the center of class in each resource block partition set；3. initializing the user group and resource block group in each class；4. constantly executing user's removal operation in each class and operation being added in user, until all users are assigned in class, completion user matches process.The present invention is on the basis of considering the constraint of system bit error rate, successive interference cancellation MMSE-OSIC technology of the least mean-square error-based on sequence is used in receiving end, dynamic multi-user's pairing can not only efficiently be carried out, and the availability of frequency spectrum of communication system can be maximized in the case where meeting system communication quality requirement.It can be used for matching the mobile phone user in MU-MIMO system.
Description
Technical field
The invention belongs to field of communication technology, in particular to a kind of user's matching method based on cluster can be used for being mostly used
Family-multiple-input and multiple-output-he Single Carrier-Frequency Division multiple access MU-MIMO-SC-FDMA system.
Background technique
In 4G mobile communication system of today and upcoming 5G mobile communication system, how defeated multi-user-multi input is
MU-MIMO technology occupies critically important status out.MU-MIMO technology by reasonable user match criterion, transmitting terminal will be more
The user of a only 1 antenna is combined into user pairing, by user pairing it is virtual regard one as equipped with more antennas
Entity terminal, MU-MIMO array is collectively formed in the mutiple antennas of the entity terminal and the assembly of receiving end base station side, thus aobvious
It writes and improves system spectral efficiency.In MU-MIMO system, studying a question for most critical exactly selects suitable user's matching side
Method, the superiority and inferiority for measuring user's matching method are primarily to see this index of the availability of frequency spectrum of system.
Classical user matches algorithm and has at present: random pair criterion, orthogonal users pairing algorithm, determinant are with alignment
Then, orthogonal degree of imperfection matches criterion.These basic users match algorithm, although can guarantee to a certain extent each user it
Between interfere as small as possible, but the availability of frequency spectrum of not apparent lifting system.
Paper " the Dynamic User Grouping and Joint that Xiaofeng Lu et al. is delivered at it
Resource Allocation With Multi-Cell Cooperation for Uplink Virtual MIMO
Systems”(IEEE Transactions on Wireless Communications,vol.16,no.6,pp.3854-
3869, Jun 2017.) in, for user's marriage problem in MU-MIMO system, a kind of iteration hungarian method is proposed.It should
Method comprises the concrete steps that: first by user grouping, generating complete user grouping set；Resource block is grouped again, is generated complete
Resource block grouping set；Iteration Hungary Algorithm is finally used, is obtained between optimal user grouping and resource block grouping
Combined situation and throughput of system.Shortcoming existing for this method is that complexity is higher, and the spectrum efficiency realized also compared with
It is low.
Summary of the invention
It is an object of the invention in view of the above shortcomings of the prior art, propose in a kind of MU-MIMO system based on cluster
User's matching method, to reduce complexity, and the availability of frequency spectrum of lifting system.
To achieve the above object, the technical program includes the following:
(1) it generates resource block and decouples perfect set:
Resource block all in system is split using partition method, resource block is generated and decouples perfect set, the resource block
Decoupling perfect set includes multiple resource block partition sets, includes multiple resource block groups in every kind of resource block partition set；
(2) it generates cluster number and initializes resource block group and user in each class:
The number of resource block group in each resource block partition set is defined as to the number K of class, by resource block group in K class according to
It is secondary to be defined as T1,…,Tm,…,TK, resource block group in each resource block partition set is sequentially placed into T1,…,Tm,…,TKIn, by K
User group is successively defined as Ω in a class1,…,Ωm,…,ΩK, definition user's total number is L, successively chooses K from L user
A user is put into Ω1,…,Ωm,…,ΩKIn；
(3) the successive interference cancellation MMSE-OSIC detection method and bit error rate according to least mean-square error-based on sequence
The self-adaptive modulation method of constraint calculates the center Z of each class1,…,Zm,…,ZK；
(4) it executes user and removes operation:
(4a) sets the user's number removed from a class every time as η；
(4b) chooses a class from unselected class, judges whether the number of user in such is greater than η, if so,
It executes (4c), otherwise, executes (4e)；
(4c) is by user group Ω in m-th of classmMiddle user u occupies resource block group TmEfficiency of transmission be defined asIt calculates
Distance of each user to the cluster centre is in suchThen the smallest user's removal of centre distance will be arrived should
Class, and according to the center Z of each class of (3) update1,…,Zm,…,ZK；
(4d) repeats (4c), until η user is moved out of such；
(4e) repeats (4b)-(4d), until K class is all selected；
(5) it executes user and adds operation:
(5a) sets the user's number added every time into class as λ；
(5b) chooses a user from user to be added, and the distance for calculating the user to all cluster centres isAnd the user is added to it in the corresponding class of the smallest cluster centre；
(5c) repeats (5b), until λ user is added in class；
(5d) updates the center Z of each class according to (3)1,…,Zm,…,ZK；
(6) (4) and (5) are repeated, until all L users are assigned in class, completion user matches process.
Compared with the prior art, the present invention has the following advantages:
First, since the present invention uses in the case where given system bit error rate thresholding, dynamically according to channel status
The method for carrying out multiple cell user pairing and resource allocation overcomes the prior art in resource allocation process it cannot be guaranteed that system
The problem of communication quality, enables the present invention while frequency efficiency of the system of maximization, guarantees the bit error rate of system
Under threshold value, and then improve system communication quality；
Second, since the present invention is based on least mean-square error-sequence serial interference elimination MMSE-OSIC technology using a kind of
User's clustering algorithm, by federated user pairing and resource allocation big PROBLEM DECOMPOSITION at several small subproblems come
Parallel implementation greatly reduces the search space for solving the problem, and frequency spectrum cannot be made full use of and ask by overcoming the prior art
The high problem of complexity is solved, so that the present invention improves spectrum efficiency while reducing complexity.
Detailed description of the invention
Fig. 1 is implementation flow chart of the invention；
Fig. 2 is the method for the present invention and existing method complexity simulation result；
Fig. 3 is the method for the present invention and existing method spectrum efficiency simulation result.
Specific embodiment
Below in conjunction with attached drawing, present invention is further described in detail.
Referring to Fig.1, steps are as follows for realization of the invention:
Step 1, it generates resource block and decouples perfect set.
Set resource block in multi-user-multiple-input and multiple-output-he Single Carrier-Frequency Division multiple access MU-MIMO-SC-FDMA system
Number is n, is split using partition method to resource block, generates resource block and decouples perfect set, the specific steps are as follows:
Continuous resource blocks all in MU-MIMO-SC-FDMA system are expressed as { B by (1a)1,B2,…,Bi,Bi+1,…,
BnSequence, wherein BiIndicate that i-th of resource block, i are from 1 to n, n indicates the sum of resource block；
(1b) is separated resource block sequence with n-1 horizontal line, the resource block sequence { B after being separated1,_,
B2,_,…,Bi,_,Bi+1,…,_,Bn}；
(1c) radom insertion number 0 or number 1 on n-1 horizontal line, i.e., by decimal number 1 to 2n-1It is converted into length
For the binary sequence of n-1, by 2n-1Kind binary sequence is sequentially inserted on n-1 horizontal line, obtains 2n-1Kind resource block partition set；
(1d) judges B in every kind of resource block partition setiAnd Bi+1Between horizontal line on the number be inserted into be 0 or 1:
If number 0, then use BiAnd Bi+1Form a resource block group；
If number 1, then use BiAnd Bi+1Form two different resource block groups；
(1e) is by 2n-1Kind resource block partition set forms a set, generates resource block and decouples perfect set.
Step 2, it generates cluster number and initializes resource block group and user group in each class.
(2a) chooses a resource block partition set from resource block partition perfect set, by resource block in the resource block partition set
The number of group is defined as the number K of class；
Resource block group in K class is successively defined as T by (2b)1,…,Tm,…,TK, m is from 1 to K, by resource block partition set
Middle resource block group is sequentially placed into T1,…,Tm,…,TKIn；
User group in K class is successively defined as Ω by (2c)1,…,Ωm,…,ΩK, definition user's total number is L, from L
K user is successively chosen in user is put into Ω1,…,Ωm,…,ΩKIn.
Step 3, the center of each class is calculated:
Successive interference cancellation MMSE-OSIC detection method and errored bit according to existing least mean-square error-based on sequence
The self-adaptive modulation method of rate constraint, calculates the center Z of each class1,…,Zm,…,ZK, the specific steps are as follows:
(3a) calculates m-th of user group ΩmMiddle user u occupies the Signal to Interference plus Noise Ratio of e-th of subcarrier are as follows:
Wherein, e is from 1 to | Tm|, | Tm| it is resource block group TmThe number of sub-carriers, u are from 1 to | Ωm|, | Ωm| it is
User group ΩmThe number of middle user,It is user group ΩmDetection vector of the middle user u on e-th of subcarrier,It is to use
Family group ΩmThe u of channel matrix arranges corresponding vector, σ between e-th of subcarrier2It is Gaussian noise variance；
(3b) calculates m-th of user group ΩmMiddle user u occupies the efficiency of transmission of e-th of subcarrier are as follows:
Wherein,It is that downward accept or reject operates, BERtarIt is the upper limit of the BER constraint of signal transmission；
(3c) calculates m-th of user group ΩmMiddle user u occupies resource block group TmEfficiency of transmission are as follows:
(3d) calculates m-th of user group ΩmOccupy resource block group TmEfficiency of transmission are as follows:
(3e) calculates the center of m-th of class are as follows:
Zm=Rm。
Step 4, it executes user and removes operation:
(4a) sets the user's number removed from a class every time as η；
(4b) chooses a class from unselected class, judges whether the number of user in such is greater than η, if so,
It executes (4c), otherwise, executes (4e)；
(4c) is by user group Ω in m-th of classmMiddle user u occupies resource block group TmEfficiency of transmission be defined asIt calculates
Distance of each user to the cluster centre is in suchThen the smallest user's removal of centre distance will be arrived should
Class, and according to the center Z of each class of (3) update1,…,Zm,…,ZK；
(4d) repeats (4c), until η user is moved out of such；
(4e) repeats (4b)-(4d), until K class is all selected.
Step 5, it executes user and adds operation:
(5a) sets the user's number added every time into class as λ；
(5b) chooses a user from user to be added, and the distance for calculating the user to all cluster centres isSpecific step is as follows:
(5b1) chooses a user from user to be added, and after being added to m-th of class, obtaining user group is
(5b2) calculates m-th of user groupMiddle user d occupies the efficiency of transmission of e-th of subcarrier are as follows:
Wherein,Be it is downward accept or reject operation, d be from 1 to It is user groupThe number of middle user, SINR
(d)e,m+It is user groupMiddle user d occupies the Signal to Interference plus Noise Ratio of e-th of subcarrier, BERtarIt is the upper of the BER constraint of signal transmission
Limit；
(5b3) calculates m-th of user groupMiddle user d occupies resource block group TmEfficiency of transmission are as follows:
Wherein,It is user groupMiddle user d occupies the efficiency of transmission of e-th of subcarrier；
(5b4) calculates m-th of user groupOccupy resource block group TmEfficiency of transmission are as follows:
(5b5) calculates the user of selection to the distance of m-th of cluster centre are as follows:
Wherein, ZmIt is the center of m-th of class.
User is added to it in the corresponding class of the smallest cluster centre by (5c)；
(5d) repeats (5b)-(5c), until λ user is added in class；
(5e) updates the center Z of each class according to (3)1,…,Zm,…,ZK。
Step 6, it completes user and matches process:
It repeats (4) and (5), until all L users are assigned in class, completion user matches process.
Effect of the invention can be by emulating further instruction
1. simulated conditions:
Emulation of the invention carries out in the wireless communication scene of single base station, and resource block number is 6, system bit error rate
Threshold value be 10-5, and the detection mode of emulation experiment setting signal receiver of the present invention is that least mean-square error-is based on sequence
Successive interference cancellation MMSE-OSIC detection, and assume in single time slot channel matrix be constant.Existing user is matched
Technology and method of the invention are compared in the performance of complexity and system spectral efficiency in terms of the two.
2. emulation content and interpretation of result
Emulation 1, according to above-mentioned simulated conditions, emulates the complexity of the method for the present invention and existing method, as a result such as
Fig. 2.As it is clear from fig. 2 that the method for the present invention has lower computational complexity when number of users is 10,20,30,40.
Emulation 2, according to above-mentioned simulated conditions, emulates the spectrum efficiency of the method for the present invention and existing method, ties
Fruit such as Fig. 3.
It can be seen in figure 3 that with signal-to-noise ratio continuous growth the method for the present invention and existing method spectrum efficiency all
Rising, but the spectrum efficiency slope of a curve of the method for the present invention is significantly greater than existing method slope of a curve, and no matter
It is the height in signal-to-noise ratio, the performance curve of the method for the present invention is always on existing method.Therefore institute's drawings family matching method
Spectrum efficiency can be improved fully using the frequency spectrum resource in system.
Claims (4)
1. user's matching method in a kind of MU-MIMO system based on cluster, which is characterized in that include the following:
(1) it generates resource block and decouples perfect set:
Resource block all in system is split using partition method, resource block is generated and decouples perfect set, resource block partition
Perfect set includes multiple resource block partition sets, includes multiple resource block groups in every kind of resource block partition set；
(2) it generates cluster number and initializes resource block group and user in each class:
The number of resource block group in each resource block partition set is defined as to the number K of class, resource block group in K class is successively fixed
Justice is T1,…,Tm,…,TK, resource block group in each resource block partition set is sequentially placed into T1,…,Tm,…,TKIn, by K class
Middle user group is successively defined as Ω1,…,Ωm,…,ΩK, definition user's total number is L, and K use is successively chosen from L user
Family is put into Ω1,…,Ωm,…,ΩKIn；
(3) it is constrained according to least mean-square error-based on the successive interference cancellation MMSE-OSIC detection method and bit error rate of sequence
Self-adaptive modulation method, calculate the center Z of each class1,…,Zm,…,ZK；
(4) it executes user and removes operation:
(4a) sets the user's number removed from a class every time as η；
(4b) chooses a class from unselected class, judges whether the number of user in such is greater than η, if so, executing
(4c) is otherwise executed (4e)；
(4c) is by user group Ω in m-th of classmMiddle user u occupies resource block group TmEfficiency of transmission be defined asIt calculates in such
The distance of each user to the cluster centre isThen the smallest user of centre distance will be arrived and remove such, and root
The center Z of each class is updated according to (3)1,…,Zm,…,ZK；
(4d) repeats (4c), until η user is moved out of such；
(4e) repeats (4b)-(4d), until K class is all selected；
(5) it executes user and adds operation:
(5a) sets the user's number added every time into class as λ；
(5b) chooses a user from user to be added, and the distance for calculating the user to all cluster centres is
And the user is added to it in the corresponding class of the smallest cluster centre；
(5c) repeats (5b), until λ user is added in class；
(5d) updates the center Z of each class according to (3)1,…,Zm,…,ZK；
(6) (4) and (5) are repeated, until all L users are assigned in class, completion user matches process.
2. method according to claim 1, resource block all in system is split using partition method in step (1),
It generates resource block and decouples perfect set, be accomplished by
Continuous resource blocks all in MU-MIMO-SC-FDMA system are expressed as { B by (1a)1,B2,…,Bi,Bi+1,…,BnSequence
Column, wherein BiIndicate that i-th of resource block, n indicate the sum of resource block；
(1b) is separated resource block sequence with n-1 horizontal line, the resource block sequence { B after being separated1,_,B2,_,…,
Bi,_,Bi+1,…,_,Bn}；
(1c) radom insertion number 0 or number 1 on n-1 horizontal line, i.e., by decimal number 1 to 2n-1Being converted into length is n-1
Binary sequence, by 2n-1Kind binary sequence is sequentially inserted on n-1 horizontal line, obtains 2n-1Kind resource block partition set；
(1d) judges B in every kind of resource block partition setiAnd Bi+1Between horizontal line on the number be inserted into be 0 or 1, if number
Word 0, then BiAnd Bi+1A resource block group is formed, if number 1, then BiAnd Bi+1Form two different resource block groups；
(1e) is by 2n-1Kind resource block partition set forms a set, generates resource block and decouples perfect set.
3. method according to claim 1, the successive interference cancellation in step (3) according to least mean-square error-based on sequence
The self-adaptive modulation method of MMSE-OSIC detection method and bit error rate constraint, calculates the center of each class, is accomplished by
(3a) calculates user group ΩmMiddle user u occupies the Signal to Interference plus Noise Ratio of subcarrier e are as follows:
Wherein,It is user group ΩmDetection vector of the middle user u on e-th of subcarrier,It is user group ΩmWith e-th
The u of channel matrix arranges corresponding vector between subcarrier, | Ωm| it is user group ΩmThe number of middle user, σ2It is Gaussian noise
Variance；
(3b) calculates user group ΩmMiddle user u occupies the efficiency of transmission of e-th of subcarrier are as follows:
Wherein,It is that downward accept or reject operates, BERtarIt is the upper limit of the BER constraint of signal transmission；
(3c) calculates user group ΩmMiddle user u occupies resource block group TmEfficiency of transmission are as follows:
(3d) calculates user group ΩmOccupy resource block group TmEfficiency of transmission are as follows:
(3e) calculates the center of m-th of class are as follows:
Zm=Rm。
4. method according to claim 1, choosing a user in step (5b) from user to be added, the user is calculated
To the distance of all cluster centres, it is accomplished by
(5b1) chooses a user from user to be added, and after being added to m-th of class, obtaining user group is
(5b2) calculates user groupMiddle user u occupies the efficiency of transmission of e-th of subcarrier are as follows:
Wherein,It is that downward accept or reject operates, SINR (u)e,m+It is user groupThe letter of e-th of subcarrier of middle user u occupancy is dry to make an uproar
Than BERtarIt is the upper limit of the BER constraint of signal transmission；
(5b3) calculates user groupMiddle user u occupies resource block group TmEfficiency of transmission are as follows:
Wherein,It is user groupMiddle user u occupies the efficiency of transmission of e-th of subcarrier；
(5b4) calculates user groupOccupy resource block group TmEfficiency of transmission are as follows:
(5b5) calculates the user of selection to the distance of m-th of cluster centre are as follows:
Wherein, ZmIt is the center of m-th of class.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811600741.8A CN109728891B (en) | 2018-12-26 | 2018-12-26 | Clustering-based user pairing method in MU-MIMO system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811600741.8A CN109728891B (en) | 2018-12-26 | 2018-12-26 | Clustering-based user pairing method in MU-MIMO system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109728891A true CN109728891A (en) | 2019-05-07 |
| CN109728891B CN109728891B (en) | 2021-05-18 |
Family
ID=66297157
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811600741.8A Active CN109728891B (en) | 2018-12-26 | 2018-12-26 | Clustering-based user pairing method in MU-MIMO system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109728891B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101958770A (en) * | 2010-08-30 | 2011-01-26 | 北京邮电大学 | Uplink multiuser multi-access interference elimination method and device of multi-input multi-output (MIMO) system |
| CN103024920A (en) * | 2012-12-21 | 2013-04-03 | 中国科学技术大学 | Method for pairing users in virtual multiple-input-multiple-output system |
| CN106793120A (en) * | 2016-12-23 | 2017-05-31 | 西安电子科技大学 | Fast joint resource allocation methods based on partition number in virtual MIMO system |
| US20170201976A1 (en) * | 2016-01-13 | 2017-07-13 | Futurewei Technologies, Inc. | Channel estimation in large scale mimo systems using iterative location based spatial filtering |
| CN108282888A (en) * | 2018-03-05 | 2018-07-13 | 吉林大学 | A kind of D2D resource allocation methods based on improvement fuzzy clustering |
| US20180212737A1 (en) * | 2017-01-25 | 2018-07-26 | Georgia Tech Research Corporation | Method for Slicing K-Best Detection in Multiple-Input Multiple-Output Wireless Communications System |
-
2018
- 2018-12-26 CN CN201811600741.8A patent/CN109728891B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101958770A (en) * | 2010-08-30 | 2011-01-26 | 北京邮电大学 | Uplink multiuser multi-access interference elimination method and device of multi-input multi-output (MIMO) system |
| CN103024920A (en) * | 2012-12-21 | 2013-04-03 | 中国科学技术大学 | Method for pairing users in virtual multiple-input-multiple-output system |
| US20170201976A1 (en) * | 2016-01-13 | 2017-07-13 | Futurewei Technologies, Inc. | Channel estimation in large scale mimo systems using iterative location based spatial filtering |
| CN106793120A (en) * | 2016-12-23 | 2017-05-31 | 西安电子科技大学 | Fast joint resource allocation methods based on partition number in virtual MIMO system |
| US20180212737A1 (en) * | 2017-01-25 | 2018-07-26 | Georgia Tech Research Corporation | Method for Slicing K-Best Detection in Multiple-Input Multiple-Output Wireless Communications System |
| CN108282888A (en) * | 2018-03-05 | 2018-07-13 | 吉林大学 | A kind of D2D resource allocation methods based on improvement fuzzy clustering |
Non-Patent Citations (2)
| Title |
|---|
| JUN WANG: "Soft-output MMSE OSIC MIMO detector with reduced-complexity approximations", 《2007 IEEE 8TH WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS》 * |
| 马松: "LTE上行虚拟MIMO用户配对算法研究", 《信息科技辑》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109728891B (en) | 2021-05-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110430613B (en) | Energy-efficiency-based resource allocation method for multi-carrier non-orthogonal multiple access system | |
| US12021667B2 (en) | Transmission system with channel estimation based on a neural network | |
| US11057080B2 (en) | Software-defined massive multi-input multi-output (MIMO) | |
| CN109474388B (en) | Low-complexity MIMO-NOMA system signal detection method based on improved gradient projection method | |
| CN111132264A (en) | User clustering method for downlink of multi-user MIMO-NOMA system | |
| US20120177001A1 (en) | Space division multiple access transmission method of statistical characteristic mode | |
| CN107070520B (en) | D2D communication interference alignment method based on cascade precoding and ESINR (orthogonal inverse Fourier transform) criterion | |
| CN113905443A (en) | Spectrum efficiency-based resource allocation method for multi-carrier NOMA system under imperfect CSI | |
| Jamali et al. | A low-complexity recursive approach toward code-domain NOMA for massive communications | |
| CN114423028B (en) | CoMP-NOMA cooperative clustering and power distribution method based on multi-agent deep reinforcement learning | |
| CN106231665A (en) | Resource allocation methods based on the switching of RRH dynamic mode in number energy integrated network | |
| CN110191476B (en) | Reconfigurable antenna array-based non-orthogonal multiple access method | |
| US11647468B2 (en) | Transmission power allocation method based on user clustering and reinforcement learning | |
| Hao et al. | Pilot allocation algorithm based on K-means clustering in cell-free massive MIMO systems | |
| US20220076134A1 (en) | Two-stage deep learning based secure precoder for information and artificial noise signal in non-orthogonal multiple access system | |
| CN112469113B (en) | Resource allocation method and device of multi-carrier NOMA system | |
| CN106851726A (en) | A kind of cross-layer resource allocation method based on minimum speed limit constraint | |
| CN112954806A (en) | Chord graph coloring-based joint interference alignment and resource allocation method in heterogeneous network | |
| CN109728891A (en) | User's matching method in MU-MIMO system based on cluster | |
| CN104410977B (en) | A kind of same frequency heterogeneous network broadcast channel interference management method based on cognitive learning | |
| CN109152060A (en) | Transmitter channel distribution model and method in a kind of shortwave downlink communication | |
| CN107346985B (en) | Interference alignment method combined with transmitting antenna selection technology | |
| CN116249190A (en) | Multi-user pairing transmission determining method and device | |
| CN112291828B (en) | Multi-user grouping method and system in multi-carrier NOMA system | |
| CN114389756A (en) | Uplink MIMO detection method based on grouping ML detection and parallel iteration interference cancellation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |