CN110048985A - The low complex degree SCMA codebook design method of suboptimum - Google Patents
The low complex degree SCMA codebook design method of suboptimum Download PDFInfo
- Publication number
- CN110048985A CN110048985A CN201910237722.1A CN201910237722A CN110048985A CN 110048985 A CN110048985 A CN 110048985A CN 201910237722 A CN201910237722 A CN 201910237722A CN 110048985 A CN110048985 A CN 110048985A
- Authority
- CN
- China
- Prior art keywords
- scma
- dimension
- word
- code word
- subcode
- 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
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
- H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
- H04B7/0413—MIMO systems
- H04B7/0456—Selection of precoding matrices or codebooks, e.g. using matrices antenna weighting
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/32—Carrier systems characterised by combinations of two or more of the types covered by groups H04L27/02, H04L27/10, H04L27/18 or H04L27/26
- H04L27/34—Amplitude- and phase-modulated carrier systems, e.g. quadrature-amplitude modulated carrier systems
- H04L27/3405—Modifications of the signal space to increase the efficiency of transmission, e.g. reduction of the bit error rate, bandwidth, or average power
- H04L27/3444—Modifications of the signal space to increase the efficiency of transmission, e.g. reduction of the bit error rate, bandwidth, or average power by applying a certain rotation to regular constellations
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention belongs to the communications fields, for the SCMA codebook design method for proposing good error bit ability, both it can guarantee that bit error rate performance was not poor, the complexity of codebook design can be greatly reduced again, the present invention, the low complex degree SCMA codebook design method of suboptimum, steps are as follows: step 1: sparse coding multiple access SCMA Optimization of Codebook problem is divided into k subproblem, in each problem dimension, the mean power of subcode word, while the minimum euclidean distance between maximum beggar's superimposed code word are constrained；Step 2: kth being tieed up into subcode word vectorization, by SCMA Optimization of Codebook problem representation at quadratically constrained quadratic programming problem；Step 3: solving the quadratically constrained quadratic programming problem using positive semidefinite relaxation method, obtain kth dimension subcode word；Step 4: according to mapping matrix, the subcode word of all k dimensions being distributed into corresponding user, obtains complete SCMA code book.Present invention is mainly applied to SCMA codebook design occasions.
Description
Technical field
The invention belongs to the communications field, sparse CDMA accesses (SCMA) technology, and in particular to the low complex degree of suboptimum
SCMA codebook design method.
Background technique
Under the driving of mobile internet service and internet of things service rapid growth, the 5th Generation Mobile Communication System is not only wanted
It system spectrum utilization rate is increased substantially, also wants bulk device can be supported to connect, these demand drivings non-orthogonal techniques hairs
Exhibition.SCMA is as a kind of novel non-orthogonal multiple access technology (NOMA), by the information superposition of system user to mutually orthogonal
It is transmitted in physical layer resources, there are non-orthogonal interferences for the information between user, need in receiving end through advanced receiving algorithm
The information for isolating each user not only increases spectrum efficiency in this way, the access capacity of system is also made to be doubled and redoubled.Mainstream
Several big non-orthogonal multiple access technologies have sparse coding multiple access (SCMA) technology, multiple users share access (MUSA), pattern point
Cut the non-orthogonal multiple access technology (PD-NOMA) of multiple access access (PDMA) and power domain.Wherein SCMA technology is code domain
Non-orthogonal multiple technology is compared with other non-orthogonal multiple access technologies, and spectrum efficiency can also utilize blind examination close to optimizing
Survey technology and SCMA collide insensitive characteristic to code word, and realization exempts to dispatch random competition access.
SCMA technology is that second the 5th third generation mobile communication network proposed by Huawei Company is completely newly eated dishes without rice or wine core technology,
It introduces sparse coding and compares book, accessed by the multiple users of realization in the multiple access of code domain to realize radio spectrum resources utilization efficiency
Promotion.The critical issue of SCMA system is codebook design.Codebook design combines low-density spread spectrum and higher-dimension QAM modulation
Come, selects the codebook set with optimum performance by operations such as conjugation, displacement, phase rotatioies, different user is using different
Code book carries out information transmission.It is to spread mode due to using low-density that code book, which has sparsity, is more effectively used to realize
Family resource allocation and higher spectrum utilization；Multidimensional simplex used by code book is modulated by amplitude and phase by the Europe of constellation point
Formula distance is pulled further away, and guarantees that being conducive to receiving end in the case that multi-user occupies resource demodulates and guarantee non-orthogonal multiplexing user
Between anti-interference ability.
Document [1] gives the design criteria of SCMA code book for the first time, and proposes based on lattice point planisphere design criteria
Codebook design schemes, document [2] propose a kind of codebook design method based on planisphere rotation operator.Document [3] proposes
A kind of planisphere design method based on Star-QAM.But these methods can not explicitly solve code book, on how to
Setting rotation angle does not indicate.Document [4] proposes a kind of codebook design based on planisphere and mapping matrix combined optimization
Scheme, but program complexity is very high, can not achieve when number of users or larger order of modulation.
[1]H.Nikopour and H.Baligh,"Sparse code multiple access,"2013 IEEE
24th Annual International Symposium on Personal,Indoor,and Mobile Radio
Communications(PIMRC),London,2013,pp.332-336.
[2]Y.Zhou,Q.Yu,W.Meng and C.Li,"SCMA codebook design based on
constellation rotation,"2017 IEEE International Conference on Communications
(ICC),Paris,2017,pp.1-6.GAO C,WANG H,ZHU F,et al.A particle swarm
optimization algorithm for controller placement problemin software defined
network[C]//International Conference on Algorithms and Architectures for
Parallel Processing.Springer International Publishing,2015:44-54
[3]T.Metkarunchit,"SCMA codebook design base on circular-QAM,"2017
Integrated Communications,Navigation and Surveillance Conference(ICNS),
Herndon,VA,2017,pp.3E1-1-3E1-8.
[4]J.Peng,W.Chen,B.Bai,X.Guo and C.Sun,"Joint Optimization of
Constellation With Mapping Matrix for SCMA Codebook Design,"in IEEE Signal
Processing Letters,vol.24,no.3,pp.264-268,March2017。
Summary of the invention
In order to overcome the deficiencies of the prior art, the present invention is directed to propose the SCMA codebook design method of good error bit ability,
Not only it can guarantee that bit error rate performance was not poor, but also the complexity of codebook design can be greatly reduced.For this purpose, the technical side that the present invention takes
Case is that the low complex degree SCMA codebook design method of suboptimum, steps are as follows:
Step 1: sparse coding multiple access SCMA Optimization of Codebook problem being divided into k subproblem, in each problem dimension, about
The mean power of beam subcode word, while the minimum euclidean distance between maximum beggar's superimposed code word；
Step 2: kth being tieed up into subcode word vectorization, SCMA Optimization of Codebook problem representation is asked at quadratically constrained quadratic programming
Topic；
Step 3: solving the quadratically constrained quadratic programming problem using positive semidefinite relaxation method, obtain kth dimension subcode word；
Step 4: according to mapping matrix, the subcode word of all k dimensions being distributed into corresponding user, is obtained complete
SCMA code book.
Further specifically:
Using the orthogonal resource block number K=4 of model, number of users J=6, the code book of each user includes M=4 code word,
And the practical number of resource blocks N=2 occupied of each code word, all possible outcomes for being superimposed code word are MJIt is a, mapping matrix F characterization
The code book of each user shows also on the same resource block to the occupancy situation of resource, there is the information phase of which user
Mutually conflict, the number of users to conflict in each resource are df=3, and mapping matrix indicates are as follows:
Assuming that vmAnd vnIt is any two superposition code word, and is K dimensional vector, then Euclidean distance d between the two is indicated
Are as follows:
D=| | vm-vn||2,m≠n,m,n∈(1,MJ)
Wherein, | | | |2Indicate 2- norm, above-mentioned distance is squared, and is further unfolded are as follows:
Wherein p (vm, k) and=vm(k) v is indicatedmKth dimension value, by the Euclidean distance of any two K superposition code word tieed up
It is separated into K dimension, the son superposition code word minimum euclidean distance of this layer is then maximized in each dimension respectively, is tieed up at k-th
Problem description on degree are as follows:
Wherein, d2Indicate square of the minimum euclidean distance between dimension superposition code word, wkIt indicates all to occupy k-th
All subcode words of the user of resource in kth dimension, wj,kIndicate subcode word of j-th of user in k-th of dimension, P indicates son
The mean power of code word；
For convenience of solution, by variable wkVector turns toAnd one-dimensional d is added, indicate Euclidean distance,
Wherein vec () indicates vectorization function, and by substitution of variable, the above problem is redescribed are as follows:
Wherein, R, Di、EjIt is Mdf+1 dimension positive semidefinite Hermitian matrix,Indicate binomial coefficient.
The above problem is a NP hard problem, obtains approximate solution by positive semidefinite relaxation (SDR).With same method
After the subcode word of k dimension is all obtained, according to mapping matrix assign them to corresponding user can be obtained it is final
SCMA code book.
The features of the present invention and beneficial effect are:
The present invention is based on SCMA codebook design problems, have done comparison to the drawbacks of existing codebook design method and have summarized, have mentioned
A kind of suboptimum codebook design method for reducing complexity is gone out.The code book that this method obtains approaches existing in terms of bit error rate performance
Code book, but existing method is significantly less than on algorithm complexity, the runing time of algorithm has been saved, large scale is able to solve
Number of users or the problem of order of modulation.
Detailed description of the invention:
Fig. 1 bit error rate performance comparison diagram.
Fig. 2 complexity comparison diagram.
Fig. 3 the method for the present invention flow chart.
Specific embodiment
The invention belongs to the communications field, sparse CDMA access (SCMA) technology is a kind of non-orthogonal multiple access access skill
Art can not only greatly improve user and access quantity, moreover it is possible to improve the availability of frequency spectrum, be one of following 5G candidate technologies.Suboptimum
Low complex degree SCMA codebook design method can be greatly lowered algorithm realization time complexity, be greatly saved program fortune
The row time, while can be realized preferable bit error rate performance.
For the frequency spectrum congestion problems for effectively solving electromagnetic environment, domestic and international researcher proposes MIMO, and millimetre-wave attenuator surpasses
The innovative techniques such as intensive networking and non-orthogonal multiple access.Non-orthogonal multiple access technology therein is by introducing controllably
A degree of user's overload can be achieved in interference, and then can promote the handling capacity and user's access quantity of mobile communication system, because
This, by designing there is the SCMA code book of good error bit ability can promote the availability of frequency spectrum, frequency spectrum congestion be effectively relieved and asks
Topic.Although presently, there are the more codebook design method based on constellation operator can preferably carry out codebook design, one
A little parameter settings are simultaneously indefinite；Although can complete codebook design there are also some Systematization methods, complexity is very high, it is difficult to real
It is existing.The invention proposes a kind of suboptimum codebook design method of dimensionality reduction, it not only ensure that bit error rate performance was not poor, but also can be greatly reduced
The complexity of codebook design.
By theory it is found that the minimum Euclideam distance maximized between communication transmitting signal is beneficial to preferably be missed
Code rate performance, therefore the present invention is under conditions of constraining code word mean power, by maximize SCMA transmitting superposition code word it
Between minimum euclidean distance realize SCMA codebook design.In the present invention, it is assumed that being used using the orthogonal resource block number K=4 of model
Amount amount J=6, the code book of each user include M=4 code word, and the practical number of resource blocks N=2 occupied of each code word, fold
Raise the price word all possible outcomes be MJIt is a.Mapping matrix F characterizes occupancy situation of the code book to resource of each user, also table
Show on the same resource block there is the information of which user to conflict with each other, being located at the number of users to conflict in each resource is df
=3, the mapping matrix that the present invention uses may be expressed as:
Assuming that vmAnd vnIt is any two superposition code word, and is K dimensional vector, then Euclidean distance d between the two can be indicated
Are as follows:
D=| | vm-vn||2,m≠n,m,n∈(1,MJ)
Wherein, | | | |2Indicate 2- norm.Above-mentioned distance can be further spread out are as follows:
Wherein p (vm, k) and=vm(k) v is indicatedmKth dimension.Due to directly maximizing between all possible superimposed code words most
Small Euclidean distance complexity is very high, because of a shared MJThe possibility of kind superposition code word.Expansion by above formula to Euclidean distance,
A kind of scheme of suboptimum can be used to realize the design of code book, that is, the K Euclidean distance for tieing up superposition code word is separated into K dimension, then
The son superposition code word minimum euclidean distance of this layer is maximized in each dimension respectively.Since each resource only has df user
It occupies, so the quantity of son superposition code word only has M in each dimensiondfIt is a.Problem in k-th of dimension can be described as:
Wherein, d2Indicate square of the minimum euclidean distance between dimension superposition code word, wkIt indicates all to occupy k-th
All subcode words of the user of resource in kth dimension, wj,kIndicate subcode word of j-th of user in k-th of dimension.P indicates son
The mean power of code word.
For convenience of solution, by variable wkVector turns toAnd one-dimensional d is added, indicate Euclidean distance,
Wherein vec () indicates vectorization function.By substitution of variable, the above problem can be redescribed are as follows:
Wherein, R, Di、EjIt is Mdf+1 dimension positive semidefinite Hermitian matrix,Indicate binomial coefficient.
The above problem is a NP hard problem, can obtain approximate solution by positive semidefinite relaxation (SDR).With same side
After method all obtains the subcode word of k dimension, according to mapping matrix assign them to corresponding user can be obtained it is final
SCMA code book.The complexity comparison diagram for emulating obtained bit error rate performance and algorithm is as shown in Figure 1.
Step 1: SCMA Optimization of Codebook problem being divided into k subproblem, in each problem dimension, constrains the flat of subcode word
Equal power, while the minimum euclidean distance between maximum beggar's superimposed code word.
Step 2: kth being tieed up into subcode word vectorization, SCMA Optimization of Codebook problem representation is asked at quadratically constrained quadratic programming
Topic.
Step 3: solving the quadratically constrained quadratic programming problem using positive semidefinite relaxation method, obtain kth dimension subcode word.
Step 4: according to mapping matrix, the subcode word of all k dimensions being distributed into corresponding user, is obtained complete
SCMA code book.
Claims (2)
1. a kind of low complex degree SCMA codebook design method of suboptimum, characterized in that steps are as follows:
Step 1: sparse coding multiple access SCMA Optimization of Codebook problem is divided into k subproblem, in each problem dimension, constraint
The mean power of code word, while the minimum euclidean distance between maximum beggar's superimposed code word；
Step 2: kth being tieed up into subcode word vectorization, by SCMA Optimization of Codebook problem representation at quadratically constrained quadratic programming problem；
Step 3: solving the quadratically constrained quadratic programming problem using positive semidefinite relaxation method, obtain kth dimension subcode word；
Step 4: according to mapping matrix, the subcode word of all k dimensions being distributed into corresponding user, obtains complete SCMA code
This.
2. the low complex degree SCMA codebook design method of suboptimum as described in claim 1, characterized in that further specifically:
Using the orthogonal resource block number K=4 of model, number of users J=6, the code book of each user includes M=4 code word, and each
The practical number of resource blocks N=2 occupied of code word, all possible outcomes for being superimposed code word are MJA, mapping matrix F characterizes each use
The code book at family shows also on the same resource block occupancy situation of resource, has the information of which user to conflict with each other,
The number of users to conflict in each resource is df=3, and mapping matrix indicates are as follows:
Assuming that vmAnd vnIt is any two superposition code word, and is K dimensional vector, then Euclidean distance d between the two is indicated are as follows:
D=| | vm-vn||2,m≠n,m,n∈(1,…MJ)
Wherein, | | | |2Indicate 2- norm, above-mentioned distance is squared, and is further unfolded are as follows:
Wherein p (vm, k) and=vm(k) v is indicatedmKth dimension value, by the separation of the Euclidean distance of any two K superposition code word tieed up
It is tieed up at K, the son superposition code word minimum euclidean distance of this layer is then maximized in each dimension respectively, in k-th of dimension
The problem of describe are as follows:
Wherein, d2Indicate square of the minimum euclidean distance between dimension superposition code word, wkIndicate k-th of resource of all occupancy
User kth dimension on all subcode words, wj,kIndicate subcode word of j-th of user in k-th of dimension, P indicates subcode word
Mean power；
For convenience of solution, by variable wkVector turns toAnd one-dimensional d is added, indicate Euclidean distance,
Wherein vec () indicates vectorization function, and by substitution of variable, the above problem is redescribed are as follows:
Wherein, R, Di、EjIt is Mdf+1 dimension positive semidefinite Hermitian matrix,Indicate binomial coefficient；
The above problem is a NP hard problem, obtains approximate solution by positive semidefinite relaxation (SDR).With same method by k
After the subcode word of dimension all obtains, assigning them to corresponding user according to mapping matrix can be obtained final SCMA code
This.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910237722.1A CN110048985A (en) | 2019-03-27 | 2019-03-27 | The low complex degree SCMA codebook design method of suboptimum |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910237722.1A CN110048985A (en) | 2019-03-27 | 2019-03-27 | The low complex degree SCMA codebook design method of suboptimum |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110048985A true CN110048985A (en) | 2019-07-23 |
Family
ID=67275390
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910237722.1A Pending CN110048985A (en) | 2019-03-27 | 2019-03-27 | The low complex degree SCMA codebook design method of suboptimum |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110048985A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112565153A (en) * | 2020-11-30 | 2021-03-26 | 沈阳理工大学 | SCMA multi-user codebook design method based on rotation mapping |
| CN114338330A (en) * | 2022-03-03 | 2022-04-12 | 南昌大学 | SCMA codebook design method and device based on visible light communication |
| CN115001929A (en) * | 2022-06-01 | 2022-09-02 | 西南交通大学 | Low-complexity SCMA codebook design method for optical fiber channel |
| CN115296739A (en) * | 2022-10-08 | 2022-11-04 | 南昌大学 | SCMA assisted quick decoding method and system for visible light communication |
| CN117176213A (en) * | 2023-11-03 | 2023-12-05 | 中国人民解放军国防科技大学 | SCMA codebook selection and power distribution method based on deep prediction Q network |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106877980A (en) * | 2017-03-08 | 2017-06-20 | 北京邮电大学 | Mixing Sparse Code multiple access method |
| CN107276960A (en) * | 2017-07-27 | 2017-10-20 | 重庆邮电大学 | A kind of SCMA optimizes codebook design method |
| CN107689859A (en) * | 2017-08-29 | 2018-02-13 | 广西大学 | SCMA systems code book and power distribution method based on game theory |
| WO2018121460A1 (en) * | 2016-12-26 | 2018-07-05 | 华为技术有限公司 | Non-orthogonal data transmission method and device |
-
2019
- 2019-03-27 CN CN201910237722.1A patent/CN110048985A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018121460A1 (en) * | 2016-12-26 | 2018-07-05 | 华为技术有限公司 | Non-orthogonal data transmission method and device |
| CN106877980A (en) * | 2017-03-08 | 2017-06-20 | 北京邮电大学 | Mixing Sparse Code multiple access method |
| CN107276960A (en) * | 2017-07-27 | 2017-10-20 | 重庆邮电大学 | A kind of SCMA optimizes codebook design method |
| CN107689859A (en) * | 2017-08-29 | 2018-02-13 | 广西大学 | SCMA systems code book and power distribution method based on game theory |
Non-Patent Citations (2)
| Title |
|---|
| JIANJUN PENG: ""Joint Optimization of Constellation With Mapping Matrix for SCMA Codebook Design"", 《IEEE SIGNAL PROCESSING LETTERS》 * |
| YONGKANG ZHOU: ""SCMA codebook design based on constellation rotation"", 《 2017 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC)》 * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112565153A (en) * | 2020-11-30 | 2021-03-26 | 沈阳理工大学 | SCMA multi-user codebook design method based on rotation mapping |
| CN112565153B (en) * | 2020-11-30 | 2023-06-09 | 沈阳理工大学 | SCMA multi-user codebook design method based on rotation mapping |
| CN114338330A (en) * | 2022-03-03 | 2022-04-12 | 南昌大学 | SCMA codebook design method and device based on visible light communication |
| CN115001929A (en) * | 2022-06-01 | 2022-09-02 | 西南交通大学 | Low-complexity SCMA codebook design method for optical fiber channel |
| CN115001929B (en) * | 2022-06-01 | 2023-07-14 | 西南交通大学 | Low-complexity SCMA codebook design method for fiber channel |
| CN115296739A (en) * | 2022-10-08 | 2022-11-04 | 南昌大学 | SCMA assisted quick decoding method and system for visible light communication |
| CN115296739B (en) * | 2022-10-08 | 2023-03-07 | 南昌大学 | SCMA assisted quick decoding method and system for visible light communication |
| CN117176213A (en) * | 2023-11-03 | 2023-12-05 | 中国人民解放军国防科技大学 | SCMA codebook selection and power distribution method based on deep prediction Q network |
| CN117176213B (en) * | 2023-11-03 | 2024-01-30 | 中国人民解放军国防科技大学 | SCMA codebook selection and power distribution method based on deep prediction Q network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110048985A (en) | The low complex degree SCMA codebook design method of suboptimum | |
| US10237769B2 (en) | Joint user clustering and power allocation method and base station using the same | |
| Alsharif et al. | How to make key 5G wireless technologies environmental friendly: A review | |
| CN106059970A (en) | Capacity maximization-based sparse code multiple access codebook design method | |
| CN103684700A (en) | 3D (three-dimensional) MU-MIMO (multiple user-multiple input multiple output) precoding method based on orthogonal joint codebook set | |
| CN106878226B (en) | A kind of optimum design method and system of the sparse frequency expansion sequence of multi-user's multicarrier | |
| CN108777855A (en) | Power distribution method, device and computer readable storage medium applied to DAS | |
| CN110062359A (en) | Based on the highly reliable low delay radio resource allocation optimization method of the short coded block transmission of NOMA in MTC | |
| CN107302766A (en) | Energy efficiency and the algorithm of spectrum efficiency balance optimization in a kind of distributing antenna system | |
| CN106911384A (en) | Suitable for the building method of the two-dimentional light address code of visible ray OCDMA communications | |
| Jamali et al. | A low-complexity recursive approach toward code-domain NOMA for massive communications | |
| CN108462975B (en) | Power and time joint distribution method in D2D wireless power supply communication network | |
| CN108352918A (en) | Receiver, multiple transmitters, from the methods of multiple transmitter receipt user data and the method for sending user data | |
| Kurniawan et al. | Low complexity MIMO-SCMA detector | |
| Li et al. | Near-field beamforming for STAR-RIS networks | |
| CN105356922B (en) | Vertical dimension codebook design method based on non-uniformly distributed load under 3D mimo channels | |
| CN110121841A (en) | A kind of wave beam generation method and base station | |
| CN104022809A (en) | MU-MIMO beamforming transmitting end interference suppression method and device | |
| CN110198182A (en) | A kind of wirelessly take can system and maximum safe rate calculation method | |
| CN101868018B (en) | Method for allocating low-bit feedback user frequencies of MIMO | |
| CN102625321B (en) | Base station from home group network system and method | |
| CN106301501B (en) | A kind of instant data transfer optimization method of combined coding modulation | |
| CN110337145B (en) | User cluster grouping method based on angle domain millimeter wave non-orthogonal multiple access system and application | |
| Lin et al. | The research of power allocation algorithm with lower computational complexity for non-orthogonal multiple access | |
| CN102404086A (en) | Multi-user scheduling method and multi-user scheduling device as well as beam forming method and beam forming device |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190723 |