CN112073154A - Method for obtaining unique translatable mapping codebook in downlink multiple access system - Google Patents

Method for obtaining unique translatable mapping codebook in downlink multiple access system Download PDF

Info

Publication number
CN112073154A
CN112073154A CN202010980022.4A CN202010980022A CN112073154A CN 112073154 A CN112073154 A CN 112073154A CN 202010980022 A CN202010980022 A CN 202010980022A CN 112073154 A CN112073154 A CN 112073154A
Authority
CN
China
Prior art keywords
unique
codebook
received signal
mapping
multiple access
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
Application number
CN202010980022.4A
Other languages
Chinese (zh)
Inventor
于启月
李瑭
刘灏
王屹
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Harbin Institute of Technology
Original Assignee
Harbin Institute of Technology
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Harbin Institute of Technology filed Critical Harbin Institute of Technology
Priority to CN202010980022.4A priority Critical patent/CN112073154A/en
Publication of CN112073154A publication Critical patent/CN112073154A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045—Arrangements at the receiver end
    • H04L1/0052—Realisations of complexity reduction techniques, e.g. pipelining or use of look-up tables
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0041—Arrangements at the transmitter end
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045—Arrangements at the receiver end
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045—Arrangements at the receiver end
    • H04L1/0047—Decoding adapted to other signal detection operation
    • H04L1/0048—Decoding adapted to other signal detection operation in conjunction with detection of multiuser or interfering signals, e.g. iteration between CDMA or MIMO detector and FEC decoder
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0071—Use of interleaving
    • 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/03006—Arrangements for removing intersymbol interference

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Power Engineering (AREA)
  • Digital Transmission Methods That Use Modulated Carrier Waves (AREA)

Abstract

The invention discloses a method for acquiring a unique translatable mapping codebook in a downlink multiple access system, belongs to the technical field of communication, and aims to solve the problem that the complexity of data recovery of a receiving end cannot be reduced on the premise of ensuring access of a large number of users in the prior art. It includes: acquiring a unique translatable condition of a transmission codebook in a downlink multiple access system; acquiring a set of elements in a transmission codebook when the number of resources is 1 according to a received signal set; and calculating the amplitude of the received signal, namely obtaining a unique translatable mapping codebook, and separating unique user information from the received signal set by the receiving end according to the amplitude. The invention is used for downlink multi-user joint transmission communication.

Description

Method for obtaining unique translatable mapping codebook in downlink multiple access system
Technical Field
The invention relates to a method for acquiring a unique translatable mapping codebook, belonging to the technical field of communication.
Background
In a cellular mobile communication system, a multiple access system is a signal modulation scheme used for establishing communication links between a base station and a plurality of users in a radio broadcast channel. The multiple access mode determines the generation, transmission and reception forms of signals, plays the most critical role in the selection of key technologies of the physical layer and the higher layer of the subsequent system and the overall design of the system, and is the most core and basic technology of the whole cellular system.
In the fifth generation wireless communication system, multiple access techniques are required to support access to a large number of devices, and thus a large number of multiple access techniques have been proposed. In a downlink multiple access system, it is important how to accurately recover information of different users from a data stream, and there is no disclosure in the prior art to solve the problem of how to reduce the complexity of data recovery at a receiving end while ensuring access of a large number of users.
Disclosure of Invention
The invention aims to solve the problem that the complexity of data recovery of a receiving end cannot be reduced on the premise of ensuring the access of a large number of users in the prior art, and provides a method for acquiring a unique translatable mapping codebook in a downlink multiple access system.
The invention relates to a method for acquiring a unique translatable mapping codebook in a downlink multiple access system, which comprises the following steps:
s1, acquiring the unique interpretable condition of a transmission codebook X in a downlink multiple access system with K number of users, N code length and M number of resources;
Figure BDA0002687189120000011
wherein the element x of the m-th row and the n-th columnm,nThe modulation signal of the nth variable node on the mth resource is represented;
n＝1,2，…，N，m＝1,2，…，M；
s2, when the resource number M is 1, the transmission codebook X is [ X ═ X1,1,x1,2,…,x1,N]Let each x1,n∈1,nFrom the received signal set phi1,n；
S3、1,nWherein Q is selected from the group consisting of Q obtained in S2 when Q is 21,nCalculating a received signal r1Amplitude b oftObtaining a unique translatable mapping codebook;
said r1Representing the received signal on the 1 st path resource of the received signal set phi;
according to amplitude btThe receiver can be enabled to separate unique user information from the received signal set phi.
Preferably, the specific method for acquiring the unique interpretable condition in S1 includes:
the downlink multiple access system with the number of users K, the code length N and the number of resources M, wherein a transmission codebook X is an M multiplied by N matrix:
Figure BDA0002687189120000021
wherein the element x of the m-th row and the n-th columnm,nRepresenting the modulation signal of the nth variable node on the mth resource, and defining the mth row element as X(m)＝(xm,1,xm,2,…,xm,N) Is provided with X(m)E, psi, and | psi | is the number of elements in the set psi of vectors;
at the receiving end, the received signal r on the mth resourcemExpressed as:
Figure BDA0002687189120000022
let rmE to phi, wherein phi is the number of elements in the received signal set phi;
the only interpretable condition is then | Ψ | ═ Φ |.
Preferably, the obtaining according to the received signal set Φ at S21,nThe specific method comprises the following steps:
when the resource number M is equal to 1, the transmission codebook X is:
X＝[x1,1,x1,2,…,x1,N]；
let each x1,n∈1,n；
1,nWherein Q is an even number, and then | psi | -, Q | -, is selectedN；
1,nComprises the following steps:
Figure BDA0002687189120000023
wherein:
Figure BDA0002687189120000031
is a positive integer, and satisfy
Figure BDA0002687189120000032
Preferably, the specific method for obtaining the unique translatable mapping codebook through calculation in S3 includes:
setting received signal r1Has an amplitude of bt(1≤t≤|Φ|,btE Φ), let Φ be { β, - β }, then:
β＝{|Φ|-1,|Φ|-3,...,3,1}；
because of the unique mapping, there are:
Figure BDA0002687189120000033
when Q is 2, each user uses 2PAM modulation, i.e. the signal amplitude is only
Figure BDA0002687189120000034
And
Figure BDA0002687189120000035
when | Φ | ═ 2N；
Due to the symmetry, equation (1) can be simplified to
Figure BDA0002687189120000036
An equation, when N ≧ 3:
Figure BDA0002687189120000037
that is, the number of unknowns is less than the number of equations, the equations have unique solutions, and equation (1) is:
Figure BDA0002687189120000038
wherein:
Figure BDA0002687189120000039
the function g(s) represents the conversion of a decimal integer s into a binary number, g(s)vIndicates the number of bits v in the function g(s)
It is assumed that there are only three users,
Figure BDA00026871891200000310
the formula (2) is:
Figure BDA00026871891200000311
solving to obtain:
Figure BDA00026871891200000312
definition matrix Q(N,2PAM)Comprises the following steps:
Figure BDA0002687189120000041
then equation (2) is:
Figure BDA0002687189120000042
solving the solution of the resulting equation
Figure BDA0002687189120000043
I.e. a received signal r is obtained1Amplitude b oftI.e. a unique translatable mapping codebook is obtained.
Preferably, the downlink multiple access system includes:
at a transmitting end, joint coding and interleaving mapping are carried out on multi-user information, then the multi-user information is distributed to different resources according to a transmission codebook and is further transmitted in a channel, and under the condition of not considering noise, a signal on each path of resource is the sum of signals of a plurality of users;
at the receiving end, serial interference elimination is respectively carried out on the received signals on the multipath resources, then signal combination and processing are carried out, and finally decoding is carried out to obtain information of different users.
The invention has the advantages that: the method for acquiring the unique translatable mapping codebook in the downlink multiple access system is used for a communication scene of downlink multi-user joint transmission. At a transmitting end, multi-user joint coding and interleaving mapping are firstly carried out on multi-user information, then the multi-user information is distributed to different resources according to a transmission codebook, and then transmission is carried out. The invention designs the signal amplitude of different users in the codebook, so that the receiving end can easily separate the information of each user from the received signal in a centralized way, and the result is unique. When proper channel coding is adopted, the method can obtain good bit error rate performance.
Drawings
FIG. 1 is a diagram of a non-unique translatable mapping and a unique translatable mapping;
figure 2 is a graph of the average BER performance simulation for different NOMA systems over AWGN channels.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It should be noted that the embodiments and features of the embodiments may be combined with each other without conflict.
The first embodiment is as follows: the method for acquiring the unique translatable mapping codebook in the downlink multiple access system of the present embodiment includes: s1, acquiring the unique interpretable condition of a transmission codebook X in a downlink multiple access system with K number of users, N code length and M number of resources;
Figure BDA0002687189120000051
wherein the element x of the m-th row and the n-th columnm,nThe modulation signal of the nth variable node on the mth resource is represented;
n＝1,2，…，N，m＝1,2，…，M；
s2, when the resource number M is 1, the transmission codebook X is [ X ═ X1,1,x1,2,…,x1,N]Let each x1,n∈1,nFrom the received signal set phi1,n；
S3、1,nWherein Q is selected from the group consisting of Q obtained in S2 when Q is 21,nCalculating a received signal r1Amplitude b oftObtaining a unique translatable mapping codebook;
said r1Representing the received signal on the 1 st path resource of the received signal set phi;
according to amplitude btThe receiver can be enabled to separate unique user information from the received signal set phi.
Further, the specific method for acquiring the unique interpretable condition in S1 includes:
the downlink multiple access system with the number of users K, the code length N and the number of resources M, wherein a transmission codebook X is an M multiplied by N matrix:
Figure BDA0002687189120000052
wherein the element x of the m-th row and the n-th columnm,nRepresenting the modulation signal of the nth variable node on the mth resource, and defining the mth row element as X(m)＝(xm,1,xm,2,…,xm,N) Is provided with X(m)E, psi, and | psi | is the number of elements in the set psi of vectors;
at the receiving end, the received signal r on the mth resourcemExpressed as:
Figure BDA0002687189120000061
let rmE to phi, wherein phi is the number of elements in the received signal set phi;
the only interpretable condition is then | Ψ | ═ Φ |.
Still further, acquiring according to the received signal set Φ at S21,nThe specific method comprises the following steps:
when the resource number M is equal to 1, the transmission codebook X is:
X＝[x1,1,x1,2,…,x1,N]；
let each x1,n∈1,n；1,nDenotes x1,nA set of (a);
1,nwherein Q is an even number, and then | psi | -, Q | -, is selectedN；
1,nComprises the following steps:
Figure BDA0002687189120000062
wherein:
Figure BDA0002687189120000063
is a positive integer, and satisfy
Figure BDA0002687189120000064
In the present embodiment, as shown in fig. 1, it is assumed that M is 1 and N is 2, that is, X is [ X ]1,1,x1,2]，
Let x1,1And x1,2All using BPSK modulation, i.e. x1,1∈1,1，x1,2∈1,2，
Wherein1,1＝1,2(+1, -1), then X(1)Belongs to the set Ψ { (+1, +1), (+1, -1), (-1, +1), (-1, -1) };
received signal r1＝x1,1+x1,2Receiving a signal set phi { +2,0, -2 };
if φ is +2, x is known(1)(+1, + 1); phi denotes an element in the received signal set phi;
similarly, if φ is-2, x is known(1)＝(-1,-1)；
However, when φ is 0, it is difficult to determine x(1)(+1, -1) or x(1)＝(-1,+1)；
But if order1,1＝(+2,-2)，1,2(+1, -1), Ψ { (+2, +1), (+2, -1), (-2, +1), (-2, -1) }, and accordingly Φ { +3, +1, -1, -3}, where the receiver can uniquely determine the value of the transmitted signal according to the received signal;
thus, the only interpretable condition to implement is | Ψ ≦ | Φ |.
Since the received signal entropy is greater than the transmitted signal entropy when | Ψ | < | Φ | the useful information is fully exploited, only the | Ψ | Φ | case is considered.
Still further, the specific method for obtaining the unique translatable mapping codebook through the calculation in S3 includes:
setting received signal r1Has an amplitude of bt(1≤t≤|Φ|,btE Φ), let Φ be { β, - β }, then:
β＝{|Φ|-1,|Φ|-3,...,3,1}；
because of the unique mapping, there are:
Figure BDA0002687189120000071
when Q is 2, each user uses 2PAM modulation, i.e. the signal amplitude is only
Figure BDA0002687189120000072
And
Figure BDA0002687189120000073
when | Φ | ═ 2N；
Due to the symmetry, equation (1) can be simplified to
Figure BDA0002687189120000074
An equation, when N ≧ 3:
Figure BDA0002687189120000075
that is, the number of unknowns is less than the number of equations, the equations have unique solutions, and equation (1) is:
Figure BDA0002687189120000076
wherein:
Figure BDA0002687189120000077
the function g(s) represents the conversion of a decimal integer s into a binary number, g(s)vIndicates the number of bits v in the function g(s)
It is assumed that there are only three users,
Figure BDA0002687189120000078
the formula (2) is:
Figure BDA0002687189120000079
solving to obtain:
Figure BDA00026871891200000710
definition matrix Q(N,2PAM)Comprises the following steps:
Figure BDA0002687189120000081
then equation (2) is:
Figure BDA0002687189120000082
solving the solution of the resulting equation
Figure BDA0002687189120000083
I.e. a received signal r is obtained1Amplitude b oftI.e. a unique translatable mapping codebook is obtained.
This implementationIn this manner, since quadrature amplitude modulation and pulse amplitude modulation are essentially the same, [1j,2j(N-1)j]And also as the amplitude of the variable node.
Still further, the downlink multiple access system includes:
at a transmitting end, joint coding and interleaving mapping are carried out on multi-user information, then the multi-user information is distributed to different resources according to a transmission codebook and is further transmitted in a channel, and under the condition of not considering noise, a signal on each path of resource is the sum of signals of a plurality of users;
at the receiving end, serial interference elimination is respectively carried out on the received signals on the multipath resources, then signal combination and processing are carried out, and finally decoding is carried out to obtain information of different users.
In the invention, a (1,4) multiple access system is taken as an example, wherein four variable nodes occupy one path of resources;
if the code rate R is 1, then the bearer rate λ is 4, and ± 2, ± 1, ± 2j and ± j are allocated to the four variable nodes, then the base matrix B of the transmission codebook is transmittedXCan be written as follows:
Figure BDA0002687189120000084
if each variable node occupies two paths of resources and each node can optionally occupy two paths of resources in the corresponding column, a transmission codebook base matrix B is givenXOne design of (a) is as follows:
Figure BDA0002687189120000091
if the code rate R is 1, the bearer rate λ is 2.
In actual transmission, the sign depends on the value of the codeword, for example, if the codeword v is (10010111), and 0 is set to correspond to a positive sign, and 1 corresponds to a negative sign, the sign of the corresponding modulation signal is (++++ - - -), and if the formula (3) is used as the base matrix, the transmission codebook X is:
Figure BDA0002687189120000092
similarly, if formula (4) is used as the base matrix, X is:
Figure BDA0002687189120000093
in the present invention, in order to measure the spectrum efficiency of a multiple access system, the number of information bits that can be transmitted by each path of transmission resource is defined as a carrying rate λ, and the unit is bit/resource (or bit/symbol). Assuming that the number of users is K, the code length is N, the code rate is R, the number of resources is M, and the modulation symbols are taken from the signal set and contain Q elements, λ can be calculated by the following formula:
Figure BDA0002687189120000094
the average BER performance of different NOMA systems under AWGN channel is simulated, the simulation result is shown in fig. 2, fig. 2 shows the average BER performance of the unique translatable mapping based multiple access system proposed by the present invention under the two situations of coding and un-coding, and the average BER performance is compared by using the SCMA system and the power domain NOMA system, in the power domain NOMA system, each path of resource simultaneously serves two users, therefore λ ═ 2, different powers are allocated to the two users, and the ratio is P1/P2The BER performance of the user with large allocated power is better than that of the user with small allocated power, so that the performance of the power domain NOMA system is poorer when the average BER performance is calculated. In the SCMA system, we use the codebook given in the prior art, λ is 1.5, and it can be seen that the average BER performance of the SCMA system is better and approaches to the BPSK system. For a multiple access system based on a unique translatable mapping scheme, the system BER performance is worse than that of an SCMA system under the condition of not adopting channel coding, but can provide higher resource bearing rate, and when E adopts proper channel codingb/N0When a certain threshold value is exceeded, the system comparesThe SCMA system has better BER performance, and the BER performance is improved due to coding gain.
Although the invention herein has been described with reference to particular embodiments, it is to be understood that these embodiments are merely illustrative of the principles and applications of the present invention. It is therefore to be understood that numerous modifications may be made to the illustrative embodiments and that other arrangements may be devised without departing from the spirit and scope of the present invention as defined by the appended claims. It should be understood that features described in different dependent claims and herein may be combined in ways different from those described in the original claims. It is also to be understood that features described in connection with individual embodiments may be used in other described embodiments.

Claims (5)

1. A method for obtaining a unique translatable mapping codebook in a downlink multiple access system is characterized in that the method comprises the following steps:
s1, acquiring the unique interpretable condition of a transmission codebook X in a downlink multiple access system with K number of users, N code length and M number of resources;
Figure FDA0002687189110000011
wherein the element x of the m-th row and the n-th columnm,nThe modulation signal of the nth variable node on the mth resource is represented;
n＝1,2，…，N，m＝1,2，…，M；
s2, when the resource number M is 1, the transmission codebook X is [ X ═ X1,1,x1,2,…,x1,N]Let each x1,n∈1,nFrom the received signal set phi1,n；
S3、1,nWherein Q is selected from the group consisting of Q obtained in S2 when Q is 21,nCalculating a received signal r1Amplitude b oftObtaining a unique translatable mapping codebook;
said r1Representing the received signal on the 1 st path resource of the received signal set phi;
according to amplitude btThe receiver can be enabled to separate unique user information from the received signal set phi.
2. The method for obtaining the unique interpretable mapping codebook in the downlink multiple access system according to claim 1, wherein the specific method for obtaining the unique interpretable condition S1 includes:
the downlink multiple access system with the number of users K, the code length N and the number of resources M, wherein a transmission codebook X is an M multiplied by N matrix:
Figure FDA0002687189110000012
wherein the element x of the m-th row and the n-th columnm,nRepresenting the modulation signal of the nth variable node on the mth resource, and defining the mth row element as X(m)＝(xm,1,xm,2,…,xm,N) Is provided with X(m)E, psi, and | psi | is the number of elements in the set psi of vectors;
at the receiving end, the received signal r on the mth resourcemExpressed as:
Figure FDA0002687189110000021
let rmE to phi, wherein phi is the number of elements in the received signal set phi;
the only interpretable condition is then | Ψ | ═ Φ |.
3. The method for obtaining the unique translatable mapping codebook in a downlink multiple access system as claimed in claim 2, wherein the step S2 is performed to obtain the unique translatable mapping codebook according to the received signal set Φ1,nThe specific method comprises the following steps:
when the resource number M is equal to 1, the transmission codebook X is:
X＝[x1,1,x1,2,…,x1,N]；
let each x1,n∈1,n；
1,nTherein is provided withQ is an even number, and then | Ψ | ═ Φ | ═ QN；
1,nComprises the following steps:
Figure FDA0002687189110000022
wherein:
Figure FDA0002687189110000023
is a positive integer, and satisfy
Figure FDA0002687189110000024
4. The method as claimed in claim 3, wherein the step S3 of calculating the unique translatable mapping codebook comprises:
setting received signal r1Has an amplitude of bt(1≤t≤|Φ|,btE Φ), let Φ be { β, - β }, then:
β＝{|Φ|-1,|Φ|-3,...,3,1}；
because of the unique mapping, there are:
Figure FDA0002687189110000025
when Q is 2, each user uses 2PAM modulation, i.e. the signal amplitude is only
Figure FDA0002687189110000026
And
Figure FDA0002687189110000027
when | Φ | ═ 2N；
Due to the symmetry, equation (1) can be simplified to
Figure FDA0002687189110000028
An equation, when N ≧ 3:
Figure FDA0002687189110000029
that is, the number of unknowns is less than the number of equations, the equations have unique solutions, and equation (1) is:
Figure FDA0002687189110000031
wherein:
Figure FDA0002687189110000032
the function g(s) represents the conversion of a decimal integer s into a binary number, g(s)vIndicating that the number v in function g(s) is set to only three users,
Figure FDA0002687189110000033
the formula (2) is:
Figure FDA0002687189110000034
solving to obtain:
Figure FDA0002687189110000035
definition matrix Q(N,2PAM)Comprises the following steps:
Figure FDA0002687189110000036
then equation (2) is:
Figure FDA0002687189110000037
solving the solution of the resulting equation
Figure FDA0002687189110000038
I.e. a received signal r is obtained1Amplitude b oftI.e. a unique translatable mapping codebook is obtained.
5. The method for obtaining the unique interpretable mapping codebook in a downlink multiple access system according to any one of claims 1 to 4, wherein the downlink multiple access system comprises:
at a transmitting end, joint coding and interleaving mapping are carried out on multi-user information, then the multi-user information is distributed to different resources according to a transmission codebook and is further transmitted in a channel, and under the condition of not considering noise, a signal on each path of resource is the sum of signals of a plurality of users;
at the receiving end, serial interference elimination is respectively carried out on the received signals on the multipath resources, then signal combination and processing are carried out, and finally decoding is carried out to obtain information of different users.
CN202010980022.4A 2020-09-17 2020-09-17 Method for obtaining unique translatable mapping codebook in downlink multiple access system Pending CN112073154A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010980022.4A CN112073154A (en) 2020-09-17 2020-09-17 Method for obtaining unique translatable mapping codebook in downlink multiple access system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010980022.4A CN112073154A (en) 2020-09-17 2020-09-17 Method for obtaining unique translatable mapping codebook in downlink multiple access system

Publications (1)

Publication Number Publication Date
CN112073154A true CN112073154A (en) 2020-12-11

Family

ID=73682343

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010980022.4A Pending CN112073154A (en) 2020-09-17 2020-09-17 Method for obtaining unique translatable mapping codebook in downlink multiple access system

Country Status (1)

Country Link
CN (1) CN112073154A (en)

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100226269A1 (en) * 2009-03-03 2010-09-09 Qualcomm Incorporated 12method and system for reducing feedback information in multicarrier-based communication systems based on tiers
US20120257640A1 (en) * 2011-04-07 2012-10-11 Omid Mashayekhi Uniquely Decodable Codes And Decoder for Overloaded Synchronous CDMA Systems
CN104202129A (en) * 2014-08-29 2014-12-10 哈尔滨工业大学 Multi-antenna multiplexing method based on uniquely decodable code
CN104202117A (en) * 2014-08-25 2014-12-10 哈尔滨工业大学 Uniquely decodable code encoding method based on traversal mode
CN108462662A (en) * 2017-02-17 2018-08-28 索尼公司 Electronic equipment and communication means for the multiple access access based on non orthogonal resources
CN108521317A (en) * 2018-04-09 2018-09-11 哈尔滨工业大学 A kind of SCMA method of uplink transmission based on asynchronous detection
CN109039976A (en) * 2018-09-25 2018-12-18 哈尔滨工业大学 A kind of downlink multi-access cut-in method based on unique decodable code
CN110601796A (en) * 2019-09-19 2019-12-20 哈尔滨工业大学 Downlink multi-user joint channel coding transmitting and receiving method and system
CN110808739A (en) * 2019-10-23 2020-02-18 中国人民解放军战略支援部队航天工程大学 Binary coding method and device with unknown source symbol probability distribution
CN111226404A (en) * 2017-07-31 2020-06-02 弗劳恩霍夫应用研究促进协会 Data transmission of multiple users over shared resources based on structured superposition coding

Patent Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100226269A1 (en) * 2009-03-03 2010-09-09 Qualcomm Incorporated 12method and system for reducing feedback information in multicarrier-based communication systems based on tiers
CN102342067A (en) * 2009-03-03 2012-02-01 高通股份有限公司 Method and system for reducing feedback information in multicarrier-based communication systems based on tiers
US20120257640A1 (en) * 2011-04-07 2012-10-11 Omid Mashayekhi Uniquely Decodable Codes And Decoder for Overloaded Synchronous CDMA Systems
CN104202117A (en) * 2014-08-25 2014-12-10 哈尔滨工业大学 Uniquely decodable code encoding method based on traversal mode
CN104202129A (en) * 2014-08-29 2014-12-10 哈尔滨工业大学 Multi-antenna multiplexing method based on uniquely decodable code
CN108462662A (en) * 2017-02-17 2018-08-28 索尼公司 Electronic equipment and communication means for the multiple access access based on non orthogonal resources
CN111226404A (en) * 2017-07-31 2020-06-02 弗劳恩霍夫应用研究促进协会 Data transmission of multiple users over shared resources based on structured superposition coding
CN108521317A (en) * 2018-04-09 2018-09-11 哈尔滨工业大学 A kind of SCMA method of uplink transmission based on asynchronous detection
CN109039976A (en) * 2018-09-25 2018-12-18 哈尔滨工业大学 A kind of downlink multi-access cut-in method based on unique decodable code
CN110601796A (en) * 2019-09-19 2019-12-20 哈尔滨工业大学 Downlink multi-user joint channel coding transmitting and receiving method and system
CN110808739A (en) * 2019-10-23 2020-02-18 中国人民解放军战略支援部队航天工程大学 Binary coding method and device with unknown source symbol probability distribution

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
QI-YUE YU: "A Unified Multiuser Coding Framework for Multiple-Access Technologies", 《IEEE SYSTEMS JOURNAL》 *
郭鸣坤: "一种基于距离谱的稀疏码多址接入码本设计", 《北京邮电大学学报》 *

Similar Documents

Publication Publication Date Title
JP5123301B2 (en) Encoding and decoding method and apparatus for use in a wireless communication system
CN1906873B (en) Method for encoding sequence of blocks of input bits to be transmitted over wireless channel
CN102148669B (en) Transmit diversity method and system
RU2515537C2 (en) Method for orthogonal space-time coding in network and relay transmission system
CN1708935B (en) Data detection and demodulation for wireless communication systems
CN1103521A (en) Noncoherent receiver employing a dual-maxima metric generation process
Kulhandjian et al. Design of permutation-based sparse code multiple access system
EP1330888B1 (en) Method of space-time coding and corresponding transmitter
JP2009540653A (en) Method and apparatus for space / time / frequency coding
CN111030740B (en) Downlink SCMA codebook design method based on layered space-time structure
Lin et al. Information theory, mathematical optimization, and their crossroads in 6G system design
KR101311634B1 (en) Method for generating codeword in wireless communication system
CN109842460A (en) Data transmission method, device, storage medium and processor
CN111082842A (en) Uplink SCMA transmitting method and receiving method based on codebook multiplexing
CN112073154A (en) Method for obtaining unique translatable mapping codebook in downlink multiple access system
KR20040028444A (en) Signal transmitting/receiving apparatus and method over multiple antennas in a mobile communication system
Muto et al. Inter-code interference reduction in Walsh-Hadamard code division multiplexing for helicopter satellite communications
US20090207890A1 (en) Diversity transmitter-receiver in cdma system using space-time code, and method thereof
Kulhandjian et al. Uniquely decodable ternary codes via augmented Sylvester-Hadamard matrices
JP2987367B1 (en) Data transmission method and its transmission / reception device
CN114050853B (en) Multi-user MIMO transmission method based on joint non-orthogonal codebook and pre-coding design
CN105407061B (en) Signal coding based on channel estimation and coding/decoding method
Wei et al. Tandem Spreading Multiple Access with Successive Interference Cancellation
Archana et al. Integrated approach for efficient power consumption and resource allocation in MIMO-OFDMA
KR101036762B1 (en) Data transmission device and data receiving device for wireless communication, Data transmission method and receiving method for wireless communication

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: 20201211

RJ01 Rejection of invention patent application after publication