CN106059970B - Sparse coding multiple access access code book design method based on maximum capacity - Google Patents
Sparse coding multiple access access code book design method based on maximum capacity Download PDFInfo
- Publication number
- CN106059970B CN106059970B CN201610496181.0A CN201610496181A CN106059970B CN 106059970 B CN106059970 B CN 106059970B CN 201610496181 A CN201610496181 A CN 201610496181A CN 106059970 B CN106059970 B CN 106059970B
- Authority
- CN
- China
- Prior art keywords
- indicate
- constellation
- user
- dimensional
- code book
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
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
-
- 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/345—Modifications of the signal space to allow the transmission of additional information
- H04L27/3461—Modifications of the signal space to allow the transmission of additional information in order to transmit a subchannel
- H04L27/3483—Modifications of the signal space to allow the transmission of additional information in order to transmit a subchannel using a modulation of the constellation points
Abstract
The sparse coding multiple access access code book design method based on maximum capacity that the present invention provides a kind of, step 1: determining SCMA codebook parameter S (J, K, F, M, N), J indicates that the maximum number of user that SCMA can be carried, F represent the SCMA mapping matrix that instruction is generated based on resource block and user, and K indicates resource block number, M indicates order of modulation, and N indicates the number of nonzero element in each code word；Step 2: one Wiki constellation collection S of building0, and it is based on the one-dimensional constellation collection S0One-dimensional multiple constellation point set S is calculatedd；Step 3: N-dimensional being constructed by one-dimensional multiple constellation point set and answers constellation collection, and selects optimal composite sequence as benchmark code word；Step 4: the code word of each user being reset according to benchmark code word, and the code word after rearrangement is assigned in oriental matrix, SCMA is generated and answers code book.The present invention introduces the thought of supercomposed coding modulation during designing multi-user's code book to improve the performance of system, and is able to maintain the power difference characteristic of N-dimensional code word.
Description
Technical field
The present invention relates to wireless communication technology fields, and in particular, to a kind of sparse coding based on maximum capacity is more
Location access code book design method.
Background technique
With the fast development of mobile Internet and Internet of Things (Internet of Things, IOT), next-generation channel radio
Letter system (5G) will face the data service sharply expanded, and the capacity of mobile communication system will face huge challenge.In order to
Cope with 5G medium-high frequency spectrum efficiency, magnanimity connects and low to facing challenges in the system performances such as time delay, non-orthogonal multiple access
Technology (Non-Orthogonal Multiple Access, NOMA) by the approval of people and is chosen as the candidate that eats dishes without rice or wine in 5G
One of technology.
Sparse coding multiple access access (Sparse Code Multiple Access, SCMA) as it is a kind of it is typical it is non-just
Access mode is handed over, a kind of more effective access mode is had proven to.In SCMA cataloged procedure, multidimensional tune
System is combined together that magnanimity is supported to connect and exempt from authorization access with low-density spread spectrum.
It is as depicted in figs. 1 and 2 respectively that SCMA uplink structure and SCMA system factor figure indicate.In SCMA uplink scene
In, each user is assigned from code book and concentrates the special code word selected, and bit stream is mapped directly into multidimensional code word to obtain
Obtain shaping gain.The code word of all users realizes multiplexing on shared orthogonal resource block (such as OFDM subcarrier).SCMA
The sparsity of code word makes Message Passing Algorithm (Message Passing Algorithm, MPA) that can be used in receiving end
Inter-user interference is eliminated, and the sparsity of code word overload system can.Therefore, codebook design proposes SCMA system performance
Vital effect is risen to.
SCMA system structure can be expressed as factor graph shown in Fig. 2.Each circle represents a user node, each
Square represents a resource node.Fig. 2 show the SCMA scene of six users, four resource blocks, and system overload rate is 150%.
Existing SCMA system codebook design method is based on the maximized criterion of minimum Eustachian distance come design codebooks.But
It is when number of users increases, the complexity of this method will steeply rise therewith.And existing method can not be by accurate theoretical
The code book for being calculated code book, but being obtained using force search, therefore its optimality can not be guaranteed.
In Next-Generation Wireless Communication Systems, service traffics will will reach 10,000,000,000 grades in thousand times of growths, connection number, etc.
Millisecond will be limited in time delay.Therefore, SCMA is considered as a kind of effective non-orthogonal multiple access way, is keeping existing
Have number of resources it is constant in the case where improve access system in number of users, lifting system capacity.Codebook design is as SCMA system
One of core technology is paid close attention to by industry, and existing method can not be generalized to because its computation complexity is too high suitable for a large number of users
Higher-dimension codebook design in.Secondly as existing code book can not meet 5G system not using power system capacity as design criteria very well
The business demand that high speed increases, therefore the problem of High Capacity SCM A codebook design is urgent need to resolve in SCMA system.The present invention
It proposes a kind of sparse coding multiple access system codebook design method based on maximum capacity, and extends to higher-dimension code book and set
Meter.
Summary of the invention
For the defects in the prior art, the object of the present invention is to provide a kind of sparse coding based on maximum capacity is more
Location access code book design method.
The sparse coding multiple access access code book design method based on maximum capacity provided according to the present invention, including it is as follows
Step:
Step 1: determining SCMA codebook parameter S (J, K, F, M, N), in which: J indicates the maximum user that SCMA can be carried
Number, F represent the SCMA mapping matrix that instruction is generated based on resource block and user, and K indicates resource block number, and M indicates order of modulation,
N indicates the number of nonzero element in each code word；
Step 2: one Wiki constellation collection of buildingAnd it is based on the Wiki constellation collectionOne-dimensional multiple constellation point set is calculated
Step 3: N-dimensional being constructed by one-dimensional multiple constellation point set and answers constellation collection, and selects optimal composite sequence as base
Quasi- code word；
Step 4: the code word of each user being reset according to benchmark code word, and the code word after rearrangement is assigned to instruction
In matrix, generates SCMA and answer code book.
Preferably, in the step 1,
In formula: dfIndicate that the number of users being multiplexed on a resource block, λ indicate the system overload factor；
Indicate combinatorial operation.
Preferably, the step 2 includes:
Step 2.1: assuming that being superimposed with d on each resource block in a SCMA systemfA user User0、User1、Each user is assigned an one-dimensional multiple constellation point setWherein:
Meet:
Wherein: Y0=S0+N0；
In formula: θdIndicate the rotation angle of d-th of one-dimensional multiple constellation point set,Indicate that base constellation concentrates theA symbol,
r1Indicate that base constellation concentrates the 1st symbol, riIndicate that base constellation concentrates i-th of symbol, Y0Indicate only hair S0When resource block on be superimposed
Reception signal after noise, I (Y0；S0) indicate that transmitting terminal sends S0Receiving end receives Y0When mutual information, N0Indicate additive Gaussian
White noise,
The calculation formula of the signal Y then received on resource block is as follows:
Then the calculation formula of achievable rate is as follows:
In formula: P indicates the power of transmitting signal,Normal Distribution,For complex norm,
Indicate multiple Gauss distribution,Indicate that transmitting terminal is sentReceiving end receives mutual trust when Y
Breath,Indicate receiving end in S0,S1,...,Sd-1Transmitting terminal sends S in known situationdIt receives
End receives mutual information when Y, and seeks all dfTotal mutual information operation of kind situation；
Step 2.2: calculating the optimal angle between each user's constellation collection；
dfConstellation collection after a user's combinationCalculation formula it is as follows:
Then mapping rule f is as follows:
In formula:Indicate the d being multiplexed on a resource blockfThe code word of a user, × indicate cartesian product, → indicate
Map operator；
When f is dijection, f is mapping rule, and receiver can be to the constellation collection after combinationUniquely decoded,
Then the calculation formula of achievable rate is as follows:
In formula:It indicatesMutual information between Y, H (Ssum) indicate SsumInformation content, p (y, ssum,i)
Indicate ssum,iWith the joint probability of y,Indicate all possible outcomes of summation operation, dfTherefore the M contrast system of a user has
Kind situation, p (y) indicate to receive the probability of signal y；
Due toSize withBetween angle be it is independent, then design following optimization problem:
In formula:Indicate the optimal rotation angle for first constellation collection that optimization problem solving comes out,Indicate that optimization is asked
Topic solves the d comefA optimal rotation angle,
Using the lower bound I of mutual informationLCarry out approximate calculation mutual information, calculation formula is as follows:
Then
In formula: ssum,iIndicate SsumIn i-th, ssum,jIndicate SsumIn jth item, | | | | expression ask norm operation.
Preferably, the step 3 includes: that N-dimensional M rank answers constellation collectionIt is made of one-dimensional multiple constellation point set,It is j-th
The code word of user；
It is that N-dimensional answers projection of the constellation on each complex plane, by rightIt is reconfigured, is obtained
To M rank constellation collection go, wherein combined mode T=(M！)(N-1)Kind.
Preferably, the step 4 includes: that the code book of J user is distributed using latin rectangle criterion, according to latin rectangle
The element of criterion, every a line and each column in matrix F does not repeat.
The communication means of the sparse coding multiple access access code book based on maximum capacity provided according to the present invention, specifically
Ground has used code book designed by the above-mentioned sparse coding multiple access access code book design method based on maximum capacity.
Compared with prior art, the present invention have it is following the utility model has the advantages that
1, the thought of supercomposed coding is introduced into SCMA codebook design: in SCMA system, multi-user on single resource block
The superposition of code word can regard a kind of superposition modulated coding as.In multi-user comm, supercomposed coding modulation can be obtained into
Type gain, therefore the present invention introduces the thought of supercomposed coding modulation during designing multi-user's code book to improve the property of system
Energy.
2, the present invention is up to target with single resource block capacity, calculates a Wiki constellation by solving optimization problem
CollectionWhen solving N-dimensional constellation, target is still up to capacity, by solving the lower bound of capacity mutual information, show that constellation projects
Between optimal rotation angleFinally by calculatingObtain N-dimensional constellation set
3, the present invention using latin rectangle criterion by constellation distribution to J user: according to latin rectangle criterion, in matrix F
Every a line and the elements of each column cannot all repeat, to keep the power difference characteristic of N-dimensional code word.
Detailed description of the invention
Upon reading the detailed description of non-limiting embodiments with reference to the following drawings, other feature of the invention,
Objects and advantages will become more apparent upon:
Fig. 1 is SCMA uplink structural schematic diagram；
Fig. 2 is SCMA system factor figure；
Fig. 3 is dfConstellation of a user on a resource block is superimposed schematic diagram；
Fig. 4 is N number of One Dimensional Projection plane combination into a N-dimensional constellation collection schematic diagram.
Specific embodiment
The present invention is described in detail combined with specific embodiments below.Following embodiment will be helpful to the technology of this field
Personnel further understand the present invention, but the invention is not limited in any way.It should be pointed out that the ordinary skill of this field
For personnel, without departing from the inventive concept of the premise, several changes and improvements can also be made.These belong to the present invention
Protection scope.
The sparse coding multiple access access code book design method based on maximum capacity provided according to the present invention, specifically,
As shown in figure 3, being superimposed with d on each resource block in a regular SCMA systemfA user User0、User1、Each user is assigned an one-dimensional multiple constellation point setWherein d=0 ..., df-1, such as Fig. 3
It is shown.The signal Y received on resource block can be indicated are as follows:WhereinIt obeys just
State distribution.According to chain rule, the achievable rate for being superimposed symbol be may be expressed as:
dfConstellation collection after a user's combination may be expressed as:
Mapping rule f may be expressed as:Wherein × indicate cartesian product.If f is dijection, receiver
It can be to the constellation collection after combinationUniquely decoded.If constellation setIt is uniquely to decode
, the expression formula of achievable rate can convert are as follows:Due to each user's
Constellation be all it is one-dimensional, unique decoding of the received superposed signal in receiving end can be obtained by user's constellation rotation.On the other hand,
Mutual informationSize withBetween angle be independent.Therefore, in order to maximize the value of mutual information,
The present invention calculates the optimal rotation angle between each user's constellation collection by solving following optimization problem,
Due to that, comprising integral, can not obtain closed solutions in above-mentioned optimization problem.Therefore, the present invention uses the lower bound of mutual information
ILCarry out approximate calculation mutual information,It is above-mentioned
Optimization problem can be exchanged into:
It can be seen that the optimization problem using approximate expression is lower compared to former problem solving complexity, especially
For larger dfThe case where.
One-dimensional constellation collectionIt is a series of Wiki constellation collection being made of M rank pulse-amplitude modulation (PAM) pointsComposition
, a Wiki constellation collectionIt can be expressed asIn the present invention, a kind of base is provided
In a Wiki constellation collection of given constellation capacityDesign criteria, be mathematically represented by following optimization problem:
Wherein, Y0=S0+N0.
As M=4,Ssum=S0+S1+S2, wherein r2=μ r1, μ expression r1And r2Between half
Diameter ratio.
Further, as shown in figure 4, N-dimensional M rank answers constellation collection χjIt is to be made of one-dimensional multiple constellation point set.It is that N-dimensional answers projection of the constellation on each complex plane.By rightIt is reconfigured, available property
The excellent M rank constellation collection of energy, as shown in Figure 4.When only a small number of or single user communicates, N number of different one-dimensional constellation collection
Reconfiguring has extremely important influence for system performance.Total combination has T=(M！)(N-1)Kind, therefore, search is complicated
Degree is exponentially increased with N.
It obtains that existing N-dimensional is answered constellation distribution to different users in next step after N-dimensional answers constellation collection.In the present invention
The code book of J user will be distributed using latin rectangle criterion, according to latin rectangle criterion, every a line in matrix F and each
The element of column cannot all repeat, to keep the power difference characteristic of N-dimensional code word.
As M=4, optimal angle is as shown in table 1 under different SNR and μ:
Optimal angle under 1 difference SNR and μ of table
By taking 4 resource blocks, 6 users as an example, following multiple code book is generated:
By taking 6 resource blocks, 15 users as an example, following code book is generated:
Specific embodiments of the present invention are described above.It is to be appreciated that the invention is not limited to above-mentioned
Particular implementation, those skilled in the art can make a variety of changes or modify within the scope of the claims, this not shadow
Ring substantive content of the invention.In the absence of conflict, the feature in embodiments herein and embodiment can any phase
Mutually combination.
Claims (5)
1. a kind of sparse coding multiple access access code book design method based on maximum capacity, which is characterized in that including walking as follows
It is rapid:
Step 1: determining SCMA codebook parameter S (J, K, F, M, N), in which: J indicates the maximum number of user that SCMA can be carried, F generation
The SCMA mapping matrix that table instruction is generated based on resource block and user, K indicate resource block number, and M indicates order of modulation, and N is indicated
The number of nonzero element in each code word；
Step 2: one Wiki constellation collection of buildingAnd it is based on the Wiki constellation collectionOne-dimensional multiple constellation point set is calculated
Step 3: N-dimensional being constructed by one-dimensional multiple constellation point set and answers constellation collection, and selects optimal composite sequence as reference number
Word；
Step 4: the code word of each user being reset according to benchmark code word, and the code word after rearrangement is assigned to oriental matrix
In, it generates SCMA and answers code book；
The step 2 includes:
Step 2.1: assuming that being superimposed with d on each resource block in a SCMA systemfA user Each user is assigned an one-dimensional multiple constellation point setWherein:
Meet:
Wherein: Y0=S0+N0；
In formula: θdIndicate the rotation angle of d-th of one-dimensional multiple constellation point set,Indicate that base constellation concentrates theA symbol, r1Table
Show that base constellation concentrates the 1st symbol, riIndicate that base constellation concentrates i-th of symbol, Y0Indicate only hair S0When resource block on superimposed noise
Reception signal afterwards, I (Y0；S0) indicate that transmitting terminal sends S0Receiving end receives Y0When mutual information, N0Indicate additive Gaussian white noise
Sound,
The calculation formula of the signal Y then received on resource block is as follows:
Then the calculation formula of achievable rate is as follows:
In formula: P indicates the power of transmitting signal,Normal Distribution,For complex norm, indicate
Multiple Gauss distribution,Indicate that transmitting terminal is sentReceiving end receives mutual information when Y,Indicate receiving end in S0,S1,...,Sd-1Transmitting terminal sends S in known situationdIt receives receiving end
Mutual information when to Y, and seek all dfTotal mutual information operation of kind situation；
Step 2.2: calculating the optimal angle between each user's constellation collection；
dfConstellation collection after a user's combinationCalculation formula it is as follows:
Then mapping rule f is as follows:
In formula:Indicate the d being multiplexed on a resource blockfThe code word of a user, × indicate cartesian product, → indicate mapping
Operator；
When f is dijection, f is mapping rule, and receiver can be to the constellation collection after combinationIt is uniquely decoded, then may be used
Calculation formula up to rate is as follows:
In formula:It indicatesMutual information between Y, H (Ssum) indicate SsumInformation content, p (y, ssum,i) indicate
ssum,iWith the joint probability of y,Indicate all possible outcomes of summation operation, dfTherefore the M contrast system of a user hasKind feelings
Condition, p (y) indicate to receive the probability of signal y；
Due toSize withBetween angle be it is independent, then design following optimization problem:
In formula: θ1 *Indicate the optimal rotation angle for first constellation collection that optimization problem solving comes out,Indicate that optimization problem is asked
The d that solution comes outfA optimal rotation angle,
Using the lower bound I of mutual informationLCarry out approximate calculation mutual information, calculation formula is as follows:
Then
In formula: ssum,iIndicate SsumIn i-th, ssum,jIndicate SsumIn jth item, | | | | expression ask norm operation.
2. the sparse coding multiple access access code book design method according to claim 1 based on maximum capacity, feature
It is, in the step 1,
In formula: dfIndicate that the number of users being multiplexed on a resource block, λ indicate the system overload factor；It indicates
Combinatorial operation.
3. the sparse coding multiple access access code book design method according to claim 1 based on maximum capacity, feature
It is, the step 3 includes: that N-dimensional M rank answers constellation collectionIt is made of one-dimensional multiple constellation point set,It is the code word of j-th of user；
It is that N-dimensional answers projection of the constellation on each complex plane, by rightIt is reconfigured, obtained M
Rank constellation collection, wherein combined mode T=(M！)(N-1)Kind.
4. the sparse coding multiple access access code book design method according to claim 1 based on maximum capacity, feature
It is, the step 4 includes: that the code book of J user is distributed using latin rectangle criterion, according to latin rectangle criterion, matrix F
In every a line and the elements of each column do not repeat.
5. a kind of communication means of the sparse coding multiple access access code book based on maximum capacity, which is characterized in that used power
Benefit requires designed by the sparse coding multiple access access code book design method described in 1 to 4 any one based on maximum capacity
Code book.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610496181.0A CN106059970B (en) | 2016-06-29 | 2016-06-29 | Sparse coding multiple access access code book design method based on maximum capacity |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610496181.0A CN106059970B (en) | 2016-06-29 | 2016-06-29 | Sparse coding multiple access access code book design method based on maximum capacity |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106059970A CN106059970A (en) | 2016-10-26 |
| CN106059970B true CN106059970B (en) | 2019-06-21 |
Family
ID=57167374
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610496181.0A Active CN106059970B (en) | 2016-06-29 | 2016-06-29 | Sparse coding multiple access access code book design method based on maximum capacity |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106059970B (en) |
Families Citing this family (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108234379B (en) * | 2016-12-21 | 2019-10-22 | 中国移动通信有限公司研究院 | A kind of data modulation method, demodulation method, base station and terminal |
| CN106878226B (en) * | 2017-02-16 | 2019-08-27 | 上海交通大学 | A kind of optimum design method and system of the sparse frequency expansion sequence of multi-user's multicarrier |
| CN107276960B (en) * | 2017-07-27 | 2020-04-17 | 重庆邮电大学 | SCMA optimization codebook design method |
| CN107635250A (en) * | 2017-08-16 | 2018-01-26 | 南京邮电大学 | The optimization method of SCMA uplink multi-address access system overload characteristics |
| CN108134641B (en) * | 2017-12-22 | 2021-05-11 | 南京邮电大学 | Base station frequency spectrum bandwidth distribution method based on SCMA (Single chip multiple Access) multiple access mechanism |
| CN110138702B (en) * | 2018-02-08 | 2021-03-05 | 中国移动通信有限公司研究院 | Data transmission method and equipment |
| CN108494437B (en) * | 2018-02-08 | 2020-04-28 | 杭州电子科技大学 | Sparse code division multiple access codebook generation method |
| CN110166385B (en) * | 2019-05-24 | 2022-02-01 | 武汉虹信科技发展有限责任公司 | Codebook generation method and device |
| CN110504996B (en) * | 2019-08-29 | 2021-02-26 | 中国电子科技集团公司第五十四研究所 | Non-orthogonal multiple access method applied to MIMO scene |
| CN111082842A (en) * | 2019-12-26 | 2020-04-28 | 上海无线通信研究中心 | Uplink SCMA transmitting method and receiving method based on codebook multiplexing |
| CN112543163B (en) * | 2020-10-29 | 2023-04-14 | 沈阳理工大学 | Constellation derivation-based SCMA (sparse code multiple access) mother codebook design method |
| CN113300993B (en) * | 2021-05-28 | 2022-08-26 | 天津大学 | Transmission method for bit field superposition pseudo-random sequence and sparse cascade coding |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104798317A (en) * | 2012-11-16 | 2015-07-22 | 华为技术有限公司 | Systems and methods for sparse code multiple access |
| CN105634712A (en) * | 2016-03-25 | 2016-06-01 | 重庆邮电大学 | SCMA (sparse code multiple access) simple codebook design method under Gauss channel |
-
2016
- 2016-06-29 CN CN201610496181.0A patent/CN106059970B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104798317A (en) * | 2012-11-16 | 2015-07-22 | 华为技术有限公司 | Systems and methods for sparse code multiple access |
| CN105634712A (en) * | 2016-03-25 | 2016-06-01 | 重庆邮电大学 | SCMA (sparse code multiple access) simple codebook design method under Gauss channel |
Non-Patent Citations (3)
| Title |
|---|
| Design and Analysis of Irregular Sparse Code Multiple Access;Shutian Zhang;《2015 International Conference on Wireless Communications & Signal Processing (WCSP)》;20151017;正文第2节 |
| Multi-Dimensional SCMA Codebook Design Based on Constellation Rotation and Interleaving;Donghong Cai;《2016 IEEE 83rd Vehicular Technology Conference (VTC Spring)》;20160518;正文第2、3节 |
| SCMA Codebook Design;Mahmoud Taherzadeh;《2014 IEEE 80th Vehicular Technology Conference (VTC2014-Fall)》;20140917;第1-5页 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106059970A (en) | 2016-10-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106059970B (en) | Sparse coding multiple access access code book design method based on maximum capacity | |
| Lakshmanan et al. | A review of wavelets for digital wireless communication | |
| Bao et al. | Spherical codes for SCMA codebook | |
| CN103957027B (en) | Based on the weighted score Fourier transform domain method for transmitting signals of multisequencing combination spread spectrum | |
| CN114079493A (en) | Channel state information measurement feedback method and related device | |
| CN106878226B (en) | A kind of optimum design method and system of the sparse frequency expansion sequence of multi-user's multicarrier | |
| Al-Nahhal et al. | Reconfigurable intelligent surface-assisted uplink sparse code multiple access | |
| CN105721123A (en) | User matching and power allocation method and apparatus | |
| CN108366036A (en) | A kind of modulation codebook design method towards Sparse Code multiple access system | |
| Kulhandjian et al. | Design of permutation-based sparse code multiple access system | |
| Liu et al. | Capacity for downlink massive MIMO MU-SCMA system | |
| CN104410487B (en) | A kind of communication means being combined using chaos and MIMO | |
| Jamali et al. | Massive coded-NOMA for low-capacity channels: A low-complexity recursive approach | |
| CN108768482A (en) | SCMA method for generating codebooks based on genetic algorithm | |
| Jamali et al. | A low-complexity recursive approach toward code-domain NOMA for massive communications | |
| CN106788626A (en) | A kind of improvement orthogonal intersection space modulation transmission method for being obtained in that second order transmitting diversity | |
| Lei et al. | A novel scheme for the construction of the SCMA codebook | |
| CN103731385B (en) | Interference alignment method for precoding and system | |
| CN111030740B (en) | Downlink SCMA codebook design method based on layered space-time structure | |
| Huang et al. | Uplink grant-free multi-codebook SCMA based on high-overload codebook grouping | |
| Soni et al. | Low complexity preprocessing approach for wireless physical layer secret key extraction based on PCA | |
| US20140280736A1 (en) | Method for providing virtual home network and device and system therefor, and computer readable recording medium | |
| CN104333439B (en) | The low complex degree method for rapidly decoding of accurate orthogonal group empirical likelihood | |
| Athisaya Anushya et al. | Group‐indexed orthogonal frequency division multiplexing index modulation aided performance trade off | |
| Yi et al. | Design Uplink SCMA Codebook by Minimizing the Upper Bound of Error Probability |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | 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 |