CN106685583B - Multi-user superposition transmission method and device - Google Patents
Multi-user superposition transmission method and device Download PDFInfo
- Publication number
- CN106685583B CN106685583B CN201510756526.7A CN201510756526A CN106685583B CN 106685583 B CN106685583 B CN 106685583B CN 201510756526 A CN201510756526 A CN 201510756526A CN 106685583 B CN106685583 B CN 106685583B
- Authority
- CN
- China
- Prior art keywords
- bits
- group
- bit
- exclusive
- specific
- 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
- 238000000034 method Methods 0.000 title claims abstract description 36
- 230000005540 biological transmission Effects 0.000 title claims abstract description 25
- 238000012545 processing Methods 0.000 claims abstract description 24
- 238000013507 mapping Methods 0.000 claims description 28
- 230000010363 phase shift Effects 0.000 claims description 12
- 230000002708 enhancing effect Effects 0.000 abstract description 4
- 238000013461 design Methods 0.000 abstract description 3
- 230000000694 effects Effects 0.000 abstract description 3
- 238000010586 diagram Methods 0.000 description 32
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- GQIVTWIJJVAWQR-DANDVKJOSA-N (4r,4ar,7ar,12bs)-9-methoxy-3-methyl-1,2,4,4a,5,6,7a,13-octahydro-4,12-methanobenzofuro[3,2-e]isoquinoline-7-one;(2r,3r)-2,3-dihydroxybutanedioic acid;n-(4-hydroxyphenyl)acetamide Chemical compound OC(=O)[C@H](O)[C@@H](O)C(O)=O.CC(=O)NC1=CC=C(O)C=C1.C([C@H]1[C@H](N(CC[C@@]112)C)C3)CC(=O)[C@@H]1OC1=C2C3=CC=C1OC GQIVTWIJJVAWQR-DANDVKJOSA-N 0.000 description 2
- 230000015572 biosynthetic process Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000015556 catabolic process Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000006731 degradation reaction Methods 0.000 description 1
- 238000012938 design process Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
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/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0009—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the channel coding
-
- 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
-
- 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/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0033—Systems modifying transmission characteristics according to link quality, e.g. power backoff arrangements specific to the transmitter
-
- 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/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0036—Systems modifying transmission characteristics according to link quality, e.g. power backoff arrangements specific to the receiver
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Digital Transmission Methods That Use Modulated Carrier Waves (AREA)
Abstract
The invention provides a multi-user superposition transmission method and a device, wherein the method comprises the following steps: the transmitter will sendPerforming bit operation on a group of 2m bits and a second group of 2n bits to obtain a third group of 2m bits, wherein m and n are positive integers; the transmitter makes the second group of bits 2nThe second complex symbol is obtained by the order modulation mode processing, and the third group of bits is made to be 2mProcessing the order modulation mode to obtain a third complex symbol; the transmitter uses the second complex symbol
Weighting to obtain a weighted second complex symbol, using the third complex symbol
Weighting to obtain a weighted third complex symbol; the transmitter adds the weighted second complex symbol and the weighted third complex symbol to obtain a superposed symbol; the transmitter forms the superposed symbols into a transmission signal and transmits the transmission signal. The invention can enhance the robustness of the symbol-level SIC of the receiver through simple and unique design processing, namely, the effect of enhancing the access performance under the condition of a receiver with lower complexity is achieved.
Description
Technical Field
The invention relates to the field of communication, in particular to a multi-user superposition transmission method and a multi-user superposition transmission device.
Background
The principle of non-Orthogonal Multiple Access (NOMA) is that a transmitting side performs multi-user information superposition coding, and a receiving side uses Successive Interference Cancellation (SIC).
Superposition coding, for example at the transmitting side of a broadcast system, refers to the superposition of information from multiple users, where "superposition" is usually a direct power domain addition. The transmitter transmits the superimposed information to a plurality of receivers simultaneously. Each receiver solves for the information it needs. It is noted that superposition coding techniques allow the information of each user to be transmitted over the "entire channel" and thus interfere with each other during demodulation.
Non-orthogonal multiple access techniques can be generally divided into two demodulation methods: first, each user carries interference demodulation of the other users, which is simpler to implement but at the expense of performance. The second is to use interference cancellation, i.e., multi-user detection. The following is a brief description of the SIC procedure of two users, and the SIC procedure of multiple users can be easily generalized: the information of user a is demodulated first (the a information is demodulated with the interference of user B). Then, when demodulating the user B information, it is necessary to subtract the previously demodulated a information (the code block level SIC needs to be reconstructed) and demodulate the user B information. Thus, the user B information can have no interference, so that the performance can be greatly improved. The classical literature has demonstrated that the use of superposition coding in combination with the code block level SIC technique can reach the multi-user information capacity limit.
As shown in fig. 1(a) - (c), which is a schematic diagram of superposition coding of QPSK (quadrature phase shift keying) symbol and 16QAM (quadrature amplitude modulation) symbol, a QPSK symbol (as shown in fig. 1 (a)) carrying bit information "00" and a 16QAM symbol (as shown in fig. 1 (b)) carrying bit information "1011" are directly added in the power domain to obtain a superimposed symbol (as shown in fig. 1 (c)) carrying bit information "001011".
Similarly, as shown in fig. 2(a) - (c), in addition to the situation in fig. 1, there is another situation that one QPSK symbol carrying bit information "10" (as shown in fig. 2 (a)) and one 16QAM symbol carrying bit information "0011" (as shown in fig. 2 (b)) are directly added in the power domain to obtain one symbol carrying bit information "100011" (as shown in fig. 2 (c)). All possible superposition cases result in 64 constellation points as shown by the constellation in fig. 2 (c).
As can be easily seen from fig. 2(c), two symbols are directly added, and finally, constellation points obtained by combining all possible symbols do not have Gray mapping property (bit information carried by adjacent mapped constellation points is only 1 bit different, and performance of such modulation is usually optimal), for example, "100011" and "001011" have two bits different.
The terminal may have a large degradation in demodulation performance if it demodulates the superimposed symbols using simple symbol-level SIC, and thus, in order to ensure performance, the terminal needs to use complex code-block-level SIC. However, the code block level SIC causes high implementation complexity, power consumption and delay for the terminal, which are sometimes unacceptable for the terminal.
Hierarchical modulation (Hierarchical modulation) can also be considered as a variant of superposition coding. Hierarchical modulation refers to passing a combination of a high priority bit stream and a low priority bit stream, which are then mapped into a constellation. Although hierarchical modulation can also combine constellations with Gray mapping properties, hierarchical modulation is not flexible to allocate different power to different data streams and is also complex to implement. And performing different power allocations on different data streams is a necessary means for achieving the downlink multi-user channel capacity.
In summary, the multi-user information in the related art is superposition-encoded at the transmitter, and correspondingly, if the receiver demodulates the superposed symbols by using the simple symbol stage SIC, the demodulation performance is greatly degraded.
Disclosure of Invention
The invention provides a multi-user superposition transmission method and a device, which at least solve the problem that the demodulation performance of a receiver is greatly reduced if the receiver demodulates a superposition symbol by using a simple symbol-level SIC when multi-user information is subjected to superposition coding in a transmitter in the related technology.
According to an embodiment of the present invention, there is provided a multi-user superposition transmission method, including:
the transmitter performs bit operation on a first group of bits a (0) a (1) … a (2m-1) to be transmitted and a second group of bits b (0) b (1) … b (2n-1) to obtain a third group of bits c (0) c (1) … c (2m-1), wherein m and n are positive integers;
the transmitter makes the second group of bits 2nProcessing the order modulation mode to obtain a second complex symbol, and making the third group of bits into 2mProcessing the order modulation mode to obtain a third complex symbol;
the transmitter uses the second complex symbol as the square root of the power factor
Weighting to obtain a weighted second complex symbol, using said third complex symbol
Weighting to obtain a weighted third complex symbol;
the transmitter adds the weighted second complex symbol and the weighted third complex symbol to obtain a superposed symbol;
the transmitter forms a transmitting signal by the superposed symbol and transmits the transmitting signal;
wherein the bit operations comprise:
performing an exclusive-or operation on a specific bit in the second group of bits and a specific bit in the first group of bits to obtain the third group of bits;
or,
performing exclusive OR operation on part of bits in the second group of bits to obtain an exclusive OR operation result, and performing exclusive OR operation on the exclusive OR operation result and specific bits in the first group of bits to obtain the third group of bits;
or,
the third set of bits consists of two parts: the first part is obtained by carrying out XOR operation on specific bits in the second group of bits and specific bits in the first group of bits; the second part is obtained by keeping bits except the specific bit of the first group of bits unchanged;
or,
the third set of bits consists of two parts: the first part is obtained by performing exclusive OR operation on part of bits in the second group of bits to obtain an exclusive OR operation result, and then performing exclusive OR operation on the exclusive OR operation result and specific bits in the first group of bits; the second part is obtained by keeping bits except the specific bit of the first group of bits unchanged;
wherein a particular bit of the first set of bits determines a quadrant of a mapped constellation point corresponding to the first set of bits.
Alternatively, ⊕ represents an exclusive-OR operation and ⊙ represents an exclusive-OR operation, then
When m is 1 and n is 1, the bit operation is expressed as:
c(0)＝a(0)⊕b(0)，
c(1)＝a(1)⊕b(1)；
when m is 1, n >1, the bit operation is expressed as:
c(0)＝a(0)⊕(b(0)⊙b(2)⊙…b(2n-2))，
c(1)＝a(1)⊕(b(1)⊙b(3)⊙…b(2n-1))；
when m >1, n is 1, the bit operation is expressed as:
c(0)＝a(0)⊕b(0)，
c(1)＝a(1)⊕b(1)，
c(k)＝a(k)，(k＝2,3…2m-1，m>1)；
when m >1, n >1, the bit operation is expressed as:
c(0)＝a(0)⊕(b(0)⊙b(2)⊙…b(2n-2))，
c(1)＝a(1)⊕(b(1)⊙b(3)⊙…b(2n-1))，
c(k)＝a(k)，(k＝2,3…2m-1，m>1)。
alternatively,
when m is 1, a 1 st bit c (0) and a 2 nd bit c (1) of the third group of bits are obtained by the bit operation,
when m >1, the 1 st bit c (0) and the 2 nd bit c (1) of the third group of bits are obtained by the bit operation, and the other bits c (2) c (3) … c (2m-1) are obtained by a (2) a (3) … a (2m-1) being kept unchanged.
Alternatively,
when n is 1, the bit operation does not include an exclusive-nor operation between the second set of bits;
when n >1, the bit operation comprises an exclusive-nor operation on all odd bits in the second group of bits, and an exclusive-or operation on all even bits in the second group of bits.
Alternatively,
a specific bit a (0) a (1) in the first group of bits determines a quadrant of a mapped constellation point corresponding to the first group of bits.
Alternatively,
2 is describednThe order modulation mode comprises at least one of the following modes: quadrature phase shift keying QPSK, quadrature amplitude modulation 16QAM, quadrature amplitude modulation 64 QAM;
2 is describedmThe order modulation mode comprises at least one of the following modes: quadrature phase shift keying QPSK, quadrature amplitude modulation 16QAM, quadrature amplitude modulation 64 QAM.
Optionally, the mapping constellation of the superimposed symbols has a gray mapping property.
According to another embodiment of the present invention, there is provided a multi-user superposition transmission apparatus, provided in a transmitter, including:
the operation module is used for carrying out bit operation on a first group of bits a (0) a (1) … a (2m-1) to be transmitted and a second group of bits b (0) b (1) … b (2n-1) to obtain a third group of bits c (0) c (1) … c (2 m-1); wherein m and n are positive integers;
a modulation module for making the second group of bits into 2nProcessing the order modulation mode to obtain a second complex symbol, and making the third group of bits into 2mProcessing the order modulation mode to obtain a third complex symbol;
a superposition module for adding the weighted second complex symbol and the weighted third complex symbol to obtain a superposed symbol, wherein the weighted second complex symbol is the square root of the power factor
Weighting, said weighted third complex symbol being used
Obtaining the weight;
the transmitting module is used for forming a transmitting signal by the superposed symbol and transmitting the transmitting signal;
wherein the bit operations comprise:
performing an exclusive-or operation on a specific bit in the second group of bits and a specific bit in the first group of bits to obtain the third group of bits;
or,
performing exclusive OR operation on part of bits in the second group of bits to obtain an exclusive OR operation result, and performing exclusive OR operation on the exclusive OR operation result and specific bits in the first group of bits to obtain the third group of bits;
or,
the third set of bits consists of two parts: the first part is obtained by carrying out XOR operation on specific bits in the second group of bits and specific bits in the first group of bits; the second part is obtained by keeping bits except the specific bit of the first group of bits unchanged;
or,
the third set of bits consists of two parts: the first part is obtained by performing exclusive OR operation on part of bits in the second group of bits to obtain an exclusive OR operation result, and then performing exclusive OR operation on the exclusive OR operation result and specific bits in the first group of bits; the second part is obtained by keeping bits except the specific bit of the first group of bits unchanged;
wherein a particular bit of the first set of bits determines a quadrant of a mapped constellation point corresponding to the first set of bits.
Alternatively, ⊕ represents an exclusive-OR operation and ⊙ represents an exclusive-OR operation, then
When m is 1 and n is 1, the bit operation is expressed as:
c(0)＝a(0)⊕b(0)，
c(1)＝a(1)⊕b(1)；
when m is 1, n >1, the bit operation is expressed as:
c(0)＝a(0)⊕(b(0)⊙b(2)⊙…b(2n-2))，
c(1)＝a(1)⊕(b(1)⊙b(3)⊙…b(2n-1))；
when m >1, n is 1, the bit operation is expressed as:
c(0)＝a(0)⊕b(0)，
c(1)＝a(1)⊕b(1)，
c(k)＝a(k)，(k＝2,3…2m-1，m>1)；
when m >1, n >1, the bit operation is expressed as:
c(0)＝a(0)⊕(b(0)⊙b(2)⊙…b(2n-2))，
c(1)＝a(1)⊕(b(1)⊙b(3)⊙…b(2n-1))，
c(k)＝a(k)，(k＝2,3…2m-1，m>1)。
alternatively,
when m is 1, a 1 st bit c (0) and a 2 nd bit c (1) of the third group of bits are obtained by the bit operation,
when m >1, the 1 st bit c (0) and the 2 nd bit c (1) of the third group of bits are obtained by the bit operation, and the other bits c (2) c (3) … c (2m-1) are obtained by a (2) a (3) … a (2m-1) being kept unchanged.
Alternatively,
when n is 1, the bit operation does not include an exclusive-nor operation between the second set of bits;
when n >1, the bit operation comprises an exclusive-nor operation on all odd bits in the second group of bits, and an exclusive-or operation on all even bits in the second group of bits.
Alternatively,
a specific bit a (0) a (1) in the first group of bits determines a quadrant of a mapped constellation point corresponding to the first group of bits.
Alternatively,
2 is describednThe order modulation mode comprises at least one of the following modes: quadrature phase shift keying QPSK, quadrature amplitude modulation 16QAM, quadrature amplitude modulation 64 QAM;
2 is describedmThe order modulation mode comprises at least one of the following modes: quadrature phase shift keying QPSK, quadrature amplitude modulation 16QAM, quadrature amplitude modulation 64 QAM.
Optionally, the mapping constellation of the superimposed symbols has a gray mapping property.
According to the invention, a transmitter is adopted to carry out bit operation on a first group of bits a (0) a (1) … a (2m-1) to be transmitted and a second group of bits b (0) b (1) … b (2n-1) to obtain a third group of bits c (0) c (1) … c (2m-1), wherein m and n are positive integers; the transmitter willThe second set of bits is made 2nProcessing the order modulation mode to obtain a second complex symbol, and making the third group of bits into 2mProcessing the order modulation mode to obtain a third complex symbol; the transmitter uses the second complex symbol as the square root of the power factor
Weighting to obtain a weighted second complex symbol, using said third complex symbol
Weighting to obtain a weighted third complex symbol; the transmitter adds the weighted second complex symbol and the weighted third complex symbol to obtain a superposed symbol; the transmitter forms a transmitting signal by the superposed symbol and transmits the transmitting signal; wherein the bit operations comprise: performing an exclusive-or operation on a specific bit in the second group of bits and a specific bit in the first group of bits to obtain the third group of bits; or, performing exclusive or operation on a part of bits in the second group of bits to obtain an exclusive or operation result, and then performing exclusive or operation on the exclusive or operation result and specific bits in the first group of bits to obtain the third group of bits; alternatively, the third set of bits consists of two parts: the first part is obtained by carrying out XOR operation on specific bits in the second group of bits and specific bits in the first group of bits; the second part is obtained by keeping bits except the specific bit of the first group of bits unchanged; alternatively, the third set of bits consists of two parts: the first part is obtained by performing exclusive OR operation on part of bits in the second group of bits to obtain an exclusive OR operation result, and then performing exclusive OR operation on the exclusive OR operation result and specific bits in the first group of bits; the second part is obtained by keeping bits except the specific bit of the first group of bits unchanged; wherein, the specific bit in the first group of bits determines the mode of the quadrant of the mapping constellation point corresponding to the first group of bits, which solves the problem that if the receiver uses simple symbol stage SIC to demodulate the superposed symbol when the transmitter performs superposed coding on the multi-user information in the related art,the demodulation performance of the method can be greatly reduced, and the robustness of the receiver as a symbol-level SIC can be enhanced through simple and unique design processing, namely the effect of enhancing the access performance under the condition of a receiver with lower complexity is achieved.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the invention and together with the description serve to explain the invention without limiting the invention. In the drawings:
fig. 1(a) is a diagram of a QPSK symbol and a 16QAM symbol superposition coding according to the related art;
fig. 1(b) is a diagram of a QPSK symbol and a 16QAM symbol superposition coding according to the related art;
fig. 1(c) is a diagram of a QPSK symbol and a 16QAM symbol superposition coding according to the related art;
fig. 2(a) is a diagram two (a) of QPSK symbol and 16QAM symbol superposition coding according to the related art;
fig. 2(b) is a diagram two (b) of QPSK symbol and 16QAM symbol superposition coding according to the related art;
fig. 2(c) is a diagram two (c) of QPSK symbol and 16QAM symbol superposition coding according to the related art;
fig. 3 is a flow chart of a multi-user superposition transmission method according to an embodiment of the invention;
fig. 4 is a block diagram of a multi-user superposition transmission apparatus according to an embodiment of the present invention;
FIG. 5 is a diagram illustrating a process of multi-user information processing at a transmitter according to an embodiment of the present invention;
fig. 6 is a schematic diagram of constellation mapping for a second set of bits in accordance with an exemplary embodiment of the present invention;
fig. 7 is a schematic diagram of constellation mapping for a first set of bits in accordance with an exemplary embodiment of the present invention;
FIG. 8 is a diagram illustrating the formation of a third set of bits in the first case of the second embodiment of the present invention;
fig. 9 is a schematic diagram of constellation mapping of third bit information in an example two according to the present invention;
FIG. 10 is a diagram illustrating the formation of a third set of bits in a second case in accordance with an embodiment of the present invention;
FIG. 11(a) is a superimposed schematic diagram (a) of the first case in the second example of implementation of the invention;
FIG. 11(b) is a superimposed schematic diagram (b) of the first case in the second example of implementation of the invention;
FIG. 11(c) is a superimposed schematic diagram (c) of the first case in the second example of implementation of the invention;
FIG. 12(a) is a superimposed schematic diagram (a) of a second case in a second example of implementation of the invention;
FIG. 12(b) is a superimposed schematic diagram (b) of a second case in the second example of implementation according to the invention;
FIG. 12(c) is a superimposed schematic diagram (c) of a second case in the second example of implementation of the invention;
fig. 13 is a comparison of the superimposition results of the first and second cases in the second embodiment according to the present invention.
Detailed Description
The invention will be described in detail hereinafter with reference to the accompanying drawings in conjunction with embodiments. It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict.
It should be noted that, if not conflicting, the embodiments of the present invention and the features of the embodiments may be combined with each other within the scope of protection of the present invention. Additionally, while a logical order is shown in the flow diagrams, in some cases, the steps shown or described may be performed in an order different than here.
It should be noted that the terms "first," "second," and the like in the description and claims of the present invention and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order.
In this embodiment, a multi-user superposition transmission method is provided, and fig. 3 is a flowchart of the multi-user superposition transmission method according to the embodiment of the present invention, as shown in fig. 3, the flowchart includes the following steps:
step S302, the transmitter performs bit operation on a first group of bits a (0) a (1) … a (2m-1) to be transmitted and a second group of bits b (0) b (1) … b (2n-1) to obtain a third group of bits c (0) c (1) … c (2m-1), wherein m and n are positive integers;
wherein the bit operations comprise:
performing an exclusive-or operation on a specific bit in the second group of bits and a specific bit in the first group of bits to obtain the third group of bits;
or, performing exclusive or operation on a part of bits in the second group of bits to obtain an exclusive or operation result, and then performing exclusive or operation on the exclusive or operation result and specific bits in the first group of bits to obtain the third group of bits;
alternatively, the third set of bits consists of two parts: the first part is obtained by carrying out XOR operation on specific bits in the second group of bits and specific bits in the first group of bits; the second part is obtained by keeping bits except the specific bit of the first group of bits unchanged;
alternatively, the third set of bits consists of two parts: the first part is obtained by performing exclusive OR operation on part of bits in the second group of bits to obtain an exclusive OR operation result, and then performing exclusive OR operation on the exclusive OR operation result and specific bits in the first group of bits; the second part is obtained by keeping bits except the specific bit of the first group of bits unchanged;
step S304, the transmitter makes the second group of bits 2nProcessing the order modulation mode to obtain a second complex symbol, and making the third group of bits into 2mProcessing the order modulation mode to obtain a third complex symbol;
step S306, the transmitter uses the second complex symbol as the square root of power factor α
Weighting to obtain a weighted second complex symbol, using said third complex symbol
Weighting to obtain a weighted third complex symbol;
step S308, the transmitter adds the weighted second complex symbol and the weighted third complex symbol to obtain a superimposed symbol;
and step S310, the transmitter forms the superposed symbols into transmission signals and transmits the transmission signals.
Wherein a particular bit of the first set of bits determines a quadrant of a mapped constellation point corresponding to the first set of bits. The particular bits of the second set of bits may be selected based on the corresponding third set of bits, e.g., all odd bits of the second set of bits may be selected as the particular bits when computing odd bits of the third set of bits, and all even bits of the second set of bits may be selected as the particular bits when computing even bits of the third set of bits.
Through the steps, the transmitter acquires the superposed symbol by adopting the unique processing mode and forms the superposed symbol into a transmitting signal for transmitting, so that the robustness of the receiver when the receiver is used for symbol-level SIC is improved, the problem that the demodulation performance of the receiver is greatly reduced if the receiver demodulates the superposed symbol by using the simple symbol-level SIC when multi-user information in the related technology is subjected to superposition coding by the transmitter is solved, and the effect of enhancing the robustness of the receiver when the receiver is used for symbol-level SIC through simple and unique design processing, namely enhancing the access performance under the condition of a receiver with lower complexity is further achieved.
Alternatively, ⊕ represents an exclusive-OR operation and ⊙ represents an exclusive-OR operation, then
When m is 1 and n is 1, the bit operation can be expressed as:
c(0)＝a(0)⊕b(0)，
c(1)＝a(1)⊕b(1)；
when m is 1, n >1, the bit operation can be expressed as:
c(0)＝a(0)⊕(b(0)⊙b(2)⊙…b(2n-2))，
c(1)＝a(1)⊕(b(1)⊙b(3)⊙…b(2n-1))；
when m >1, n is 1, the bit operation can be expressed as:
c(0)＝a(0)⊕b(0)，
c(1)＝a(1)⊕b(1)，
c(k)＝a(k)，(k＝2,3…2m-1，m>1)；
when m >1, n >1, the bit operation can be expressed as:
c(0)＝a(0)⊕(b(0)⊙b(2)⊙…b(2n-2))，
c(1)＝a(1)⊕(b(1)⊙b(3)⊙…b(2n-1))，
c(k)＝a(k)，(k＝2,3…2m-1，m>1)。
it should be noted that, for those skilled in the art, there may be a variation of the calculation of exclusive or and the exclusive or, for example, the exclusive or calculation is performed first, and then the result is exclusive or calculated with the following bits, but the obtained results are the same as the above formula. Therefore, all the modifications of changing the operation sequence should fall within the protection scope of the present application, and the same description is omitted hereinafter.
Optionally, when m is 1, the 1 st bit c (0) and the 2 nd bit c (1) of the third group of bits are obtained through the bit operation, when m >1, the 1 st bit c (0) and the 2 nd bit c (1) of the third group of bits are obtained through the bit operation, and the other bits c (2) c (3) … c (2m-1) are obtained by a (2) a (3) … a (2m-1) in a constant manner.
Optionally, when n >1, the bit operation includes ⊙ (exclusive nor operation) between bits of the second group b (0) b (1) … b (2n-1), wherein the exclusive nor operation between bits of the second group includes exclusive nor operation of bits of all odd-numbered bits in the second group and exclusive nor operation of bits of all even-numbered bits in the second group.
Optionally, a specific bit a (0) a (1) in the first group of bits determines a quadrant of the mapped constellation point corresponding to the first group of bits a (0) a (1) … a (2 n-1).
Optionally using2nModulating the second group of bits by an order modulation scheme using 2mThe third set of bits is modulated by an order modulation scheme. 2nThe order modulation mode comprises at least one of the following modes: quadrature phase shift keying QPSK, quadrature amplitude modulation 16QAM, quadrature amplitude modulation 64 QAM. 2mThe order modulation modes include quadrature phase shift keying QPSK, quadrature amplitude modulation 16QAM, and quadrature amplitude modulation 64 QAM.
Optionally, the mapping constellation of the superimposed symbols has a gray mapping property.
In this embodiment, a multi-user superposition transmission apparatus is further provided, and the apparatus is used to implement the foregoing embodiments and preferred embodiments, and the description of which has been already made is omitted. As used below, the term "module" may be a combination of software and/or hardware that implements a predetermined function. Although the means described in the embodiments below are preferably implemented in software, an implementation in hardware, or a combination of software and hardware is also possible and contemplated.
An embodiment of the present invention further provides a multi-user superposition transmission apparatus, which is disposed in a transmitter, and fig. 4 is a block diagram of a structure of the multi-user superposition transmission apparatus according to the embodiment of the present invention, and as shown in fig. 4, the apparatus includes:
an operation module 42, configured to perform a bit operation on a first group of bits a (0) a (1) … a (2m-1) to be sent and a second group of bits b (0) b (1) … b (2n-1) to obtain a third group of bits c (0) c (1) … c (2 m-1); wherein m and n are positive integers;
a modulation module 44 for making the second group of bits to 2nProcessing the order modulation mode to obtain a second complex symbol, and making the third group of bits into 2mProcessing the order modulation mode to obtain a third complex symbol;
a superposition module 46, configured to add the weighted second complex symbol and the weighted third complex symbol to obtain a superposed symbol, where the weighted second complex symbol is obtained by weighting with a square root of the power factor, and the weighted third complex symbol is obtained by weighting;
a transmitting module 48, configured to form a transmitting signal from the superimposed symbol and transmit the transmitting signal;
wherein the bit operations comprise:
performing an exclusive-or operation on a specific bit in the second group of bits and a specific bit in the first group of bits to obtain the third group of bits;
or,
performing exclusive OR operation on part of bits in the second group of bits to obtain an exclusive OR operation result, and performing exclusive OR operation on the exclusive OR operation result and specific bits in the first group of bits to obtain the third group of bits;
or,
the third set of bits consists of two parts: the first part is obtained by carrying out XOR operation on specific bits in the second group of bits and specific bits in the first group of bits; the second part is obtained by keeping bits except the specific bit of the first group of bits unchanged;
or,
the third set of bits consists of two parts: the first part is obtained by performing exclusive OR operation on part of bits in the second group of bits to obtain an exclusive OR operation result, and then performing exclusive OR operation on the exclusive OR operation result and specific bits in the first group of bits; the second part is obtained by keeping bits other than the specific bit of the first group of bits unchanged.
Wherein a particular bit of the first set of bits determines a quadrant of a mapped constellation point corresponding to the first set of bits. The particular bits of the second set of bits may be selected based on the corresponding third set of bits, e.g., all odd bits of the second set of bits may be selected as the particular bits when computing odd bits of the third set of bits, and all even bits of the second set of bits may be selected as the particular bits when computing even bits of the third set of bits.
Alternatively, ⊕ represents an exclusive-OR operation and ⊙ represents an exclusive-OR operation, then
When m is 1 and n is 1, the bit operation can be expressed as:
c(0)＝a(0)⊕b(0)，
c(1)＝a(1)⊕b(1)；
when m is 1, n >1, the bit operation can be expressed as:
c(0)＝a(0)⊕(b(0)⊙b(2)⊙…b(2n-2))，
c(1)＝a(1)⊕(b(1)⊙b(3)⊙…b(2n-1))；
when m >1, n is 1, the bit operation can be expressed as:
c(0)＝a(0)⊕b(0)，
c(1)＝a(1)⊕b(1)，
c(k)＝a(k)，(k＝2,3…2m-1，m>1)；
when m >1, n >1, the bit operation can be expressed as:
c(0)＝a(0)⊕(b(0)⊙b(2)⊙…b(2n-2))，
c(1)＝a(1)⊕(b(1)⊙b(3)⊙…b(2n-1))，
c(k)＝a(k)，(k＝2,3…2m-1，m>1)。
alternatively,
when m is 1, a 1 st bit c (0) and a 2 nd bit c (1) of the third group of bits are obtained by the bit operation,
when m >1, the 1 st bit c (0) and the 2 nd bit c (1) of the third group of bits are obtained by the bit operation, and the other bits c (2) c (3) … c (2m-1) are obtained by a (2) a (3) … a (2m-1) being kept unchanged.
Alternatively,
when n is 1, the bit operation does not include an exclusive-nor operation between the second set of bits;
when n >1, the bit operation comprises an exclusive-nor operation on all odd bits in the second group of bits, and an exclusive-or operation on all even bits in the second group of bits.
Alternatively,
a specific bit a (0) a (1) in the first group of bits determines a quadrant of a mapped constellation point corresponding to the first group of bits.
Alternatively,
2 is describednThe order modulation mode comprises at least one of the following modes: QPSK, quadrature amplitude modulation 16QAM, quadrature amplitude modulation 64 QAM;
2 is describedmThe order modulation mode comprises at least one of the following modes: quadrature phase shift keying QPSK, quadrature amplitude modulation 16QAM, quadrature amplitude modulation 64 QAM.
Optionally, the mapping constellation of the superimposed symbols has a gray mapping property.
It should be noted that, the above modules may be implemented by software or hardware, and for the latter, the following may be implemented, but not limited to: the modules are all positioned in the same processor; alternatively, the modules are respectively located in a plurality of processors.
In a specific example of the multi-user superposition transmission method provided in the embodiment of the present invention, a specific bit in the second group of bits is subjected to an exclusive or operation with all bits in the first group of bits to obtain an exclusive or bit, the obtained exclusive or bit is combined with bits other than the specific bit in the second group of bits to obtain a third group of bits, the first and second complex symbols obtained by processing the first group of bits and the third group of bits are superposed to obtain a superposed symbol, and the superposed symbol forms a transmission signal to be transmitted. By adopting the embodiment of the invention, the system receiver can obtain better SIC robustness and enhance the access performance under the condition of a receiver with lower complexity.
To emphasize the characteristics of the embodiments of the present invention, the following preferred exemplary examples further illustrate the embodiments of the present invention.
Example of implementation
After the transmitter is processed, the multiuser information is sent to both receivers simultaneously, e.g., the transmitter transmits a first set of bits to the central user receiver UE1 and a second set of bits to the edge user receiver UE2 simultaneously. The two groups of bits are sent out by superposition after being processed by the transmitter. Corresponding to the receiver UE1, the receiver UE2 demodulates the information needed by itself from the superimposed information of the received two groups of bits, as shown in fig. 5, which is the processing procedure of the multi-user information at the transmitter.
As shown in fig. 5, first, 1 bits of information of the UE are coded to obtain a first group of bits, and 2 bits of information of the UE are coded to obtain a second group of bits, where the coding may be according to a coding method adopted by an existing standard, such as Turbo coding. In this embodiment, encoding is an optional step, and the application may not include the encoding step, that is, the first group of bits may be directly referred to as UE1 bit information, and the second group of bits may be directly referred to as UE2 bit information.
Then, the second group of bits are directly modulated to obtain a modulation symbol with a certain power (i.e. a weighted second complex symbol), and the first group of bits and the second group of bits are subjected to bit operation to obtain a third group of bits and then are modulated to obtain a modulation symbol with a certain power (i.e. a weighted third complex symbol), wherein the modulation of the second group of bits can be according to a modulation method adopted by the existing standard, for example: QPSK, 16 QAM; the modulation of the third set of bits may employ QPSK, 16QAM, etc.
Wherein the third group of bits is composed of two parts, one part is obtained by operating a specific bit in the second group of bits and a specific bit in the first group of bits, and the other part is obtained by keeping the bits except the specific bit in the second group of bits unchanged. For example, the second set of bits is "10" and the first set of bits is "1100" where the first two bits "11" are the particular 2 bits. The resulting third group of bits is "0100" where the first two bits "01" are the exclusive or of the second group of bits "10" and the first group of bits, specifically 2 bits "11":
0＝1⊕1，
1＝0⊕1，
and the last two bits are left unchanged by the bits "00" in the first group of bits except for the specific bit.
And finally, respectively modulating the '10' and the '0100', respectively multiplying the modulated signals by corresponding power adjustment factors, then superposing the modulated signals to obtain superposed symbols, and forming the superposed symbols into transmitting signals to be transmitted.
Example II
Two groups of bits are sent to two user receivers after being processed at the transmitter. More specifically, first, the second group of bits is two bits, as shown in fig. 6, indicating the mapping of the two bits on the constellation diagram, for example, when it is "10", on the constellation points indicated by the filled circles in fig. 6. The first set of four bits, as shown in fig. 7, represents its mapping on the constellation diagram, e.g., when it is "1011", to the constellation points represented by the filled circles in fig. 7. The 16QAM constellation used here is an LTE standard 16QAM constellation, and the 1 st and 2 nd bit of the four bits are important bits, that is, the bits for determining the positive and negative of the I-path Q-path component, that is, the 1 st bit "1" and the 2 nd bit "0" of "1011" are important bits.
Then, the second group of bits is directly modulated by QPSK to obtain a modulation symbol with a certain power (i.e. weighted second complex symbol), the second group of bits and the first group of bits are firstly subjected to bit operation to obtain a third group of bits, and the third group of bits is modulated by 16QAM mode made by LTE standard to obtain a modulation symbol with a certain power (i.e. weighted third complex symbol).
More specifically, in fig. 8, the second group of bits is "10", the first group of bits is "1011", the 1 st and 2 nd bits are "10" and the 2 nd bits are the specific 2 bits, the third group of bits is "0011", the 1 st and 2 nd bits are "00" and the 1 st and 2 nd bits are obtained by xoring the second group of bits "10" with the specific 2 bits "10" of the first group of bits, which are represented as "10" ⊕ "10" in fig. 8, and the other two bits are obtained by the first group of bits except for the specific bits "11" and keeping the same.
As shown in fig. 9, is the mapping of 4 bits of the third group of bits on the constellation diagram. Comparing the second bit information constellation mapping with the third group of bit constellation mapping makes it easy to find that the constellation point is changed to a position symmetrical to the virtual axis of the constellation. Another possible case is that, as shown in fig. 10, the second bit information is "00", the first bit information is "1011", and the third group of bits is "1011", where the first bit "1" and the second bit "0" are obtained by performing xor on the 1 st bit "1", the 2 nd bit "0" in the first bit information and the "00" in the second bit information, respectively, and the 3 rd bit and the 4 th bit "11" are obtained by keeping the 3 rd bit and the 4 th bit in the first bit information unchanged; it is the same as the first bit information and so the mapping in the constellation is the same.
And after the two possible situations respectively obtain the complex symbols, overlapping to obtain the superposed symbols. It is easily understood that the QPSK modulation symbol has 4 possible constellation points in the constellation diagram, and the 16QAM modulation symbol has 16 possible constellation points in the constellation diagram, so that the superimposed symbol of two complex symbols has 64 possible constellation points in the constellation diagram, just as the superimposed coding introduced in the technical background. Here we focus on the two cases described above: the first method comprises the following steps: the second bit information is "10", and the first bit information is "1011"; and the second method comprises the following steps: the second bit information is "00" and the first bit information is "1011".
Fig. 11(a) - (c) show a superposition schematic diagram of a first case, where fig. 11(a) is a constellation point of a second group of bits in the first case, fig. 11(b) is a constellation point mapped by a third group of bits in the first case, where the third group of bits 0011 is obtained by changing from the first group of bits 1011, and fig. 11(c) is a constellation point after superposition in the first case. Fig. 12(a) - (c) show a superposition schematic diagram of a second case, where fig. 12(a) is a constellation point of a second group of bits in the second case, and fig. 12(b) is a constellation point to which a third group of bits is mapped in the second case, where a third group of bits 1011 is obtained by changing the first group of bits 1011, and fig. 12(c) is a constellation point after superposition in the second case.
The figure indicates that two specific cases are randomly taken for illustration, the first: the 16QAM symbols at QPSK symbol "1011" at "10" are superimposed to obtain a symbol at "101011". And the second method comprises the following steps: the QPSK symbol at "00" and the 16QAM symbol at "1011" are optimally superimposed to obtain a symbol at "001011". The superposed symbols obtained in the two cases are put into one constellation diagram, and a superposed symbol constellation diagram of two symbols is shown in fig. 13.
It is easy to see and to infer that the mapping constellation of all possible superimposed symbols has a gray mapping property from fig. 13.
Finally, the superposed symbols form a transmitting signal and the transmitting signal is sent to two user receivers.
It should be noted that, with the simple and unique design process of the embodiment of the present invention, even if the QPSK symbol is misjudged at the receiver due to noise, the correct demodulation of the 16QAM symbol is not affected. The robustness of the receiver in symbol-level SIC is enhanced, i.e. the access performance is enhanced at lower complexity receiver conditions.
Example III
Table 1 shows combinations of m and n with different values, which may be 2nModulating the second group of bits by an order modulation scheme using 2mThe third set of bits is modulated by an order modulation scheme.
When n or m is 1, QPSK modulation is performed, when n or m is 2, 16QAM modulation is performed, and when n or m is 3, 64QAM modulation is performed.
TABLE 1 third set of bit calculations for different cases
TABLE 2 Power factor ranges for different cases
Through the above description of the embodiments, those skilled in the art can clearly understand that the method according to the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but the former is a better implementation mode in many cases. Based on such understanding, the technical solutions of the present invention may be embodied in the form of a software product, which is stored in a storage medium (e.g., ROM/RAM, magnetic disk, optical disk) and includes instructions for enabling a terminal device (e.g., a mobile phone, a computer, a server, or a network device) to execute the method according to the embodiments of the present invention.
Through the above description of the embodiments, those skilled in the art can clearly understand that the method according to the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but the former is a better implementation mode in many cases. Based on such understanding, the technical solutions of the present invention may be embodied in the form of a software product, which is stored in a storage medium (e.g., ROM/RAM, magnetic disk, optical disk) and includes instructions for enabling a terminal device (e.g., a mobile phone, a computer, a server, or a network device) to execute the method according to the embodiments of the present invention.
The embodiment of the invention also provides a storage medium. Alternatively, in the present embodiment, the storage medium may be configured to store program codes for performing the following steps:
step S1, the transmitter performs bit operation on a first group of bits a (0) a (1) … a (2m-1) to be transmitted and a second group of bits b (0) b (1) … b (2n-1) to obtain a third group of bits c (0) c (1) … c (2m-1), wherein m and n are positive integers;
wherein the bit operations comprise:
performing an exclusive-or operation on a specific bit in the second group of bits and a specific bit in the first group of bits to obtain the third group of bits;
or, performing exclusive or operation on a part of bits in the second group of bits to obtain an exclusive or operation result, and then performing exclusive or operation on the exclusive or operation result and specific bits in the first group of bits to obtain the third group of bits;
alternatively, the third set of bits consists of two parts: the first part is obtained by carrying out XOR operation on specific bits in the second group of bits and specific bits in the first group of bits; the second part is obtained by keeping bits except the specific bit of the first group of bits unchanged;
alternatively, the third set of bits consists of two parts: the first part is obtained by performing exclusive OR operation on part of bits in the second group of bits to obtain an exclusive OR operation result, and then performing exclusive OR operation on the exclusive OR operation result and specific bits in the first group of bits; the second part is obtained by keeping bits except the specific bit of the first group of bits unchanged;
step S2, the transmitter makes the second group of bits 2nProcessing the order modulation mode to obtain a second complex symbol, and making the third group of bits into 2mProcessing the order modulation mode to obtain a third complex symbol;
step S3, the transmitter uses the square root of the power factor for the second complex symbol
Weighting to obtain a weighted second complex symbol, using said third complex symbol
Weighting to obtain a weighted third complex symbol;
step S4, the transmitter adds the weighted second complex symbol and the weighted third complex symbol to obtain a superimposed symbol;
and step S5, the transmitter forms the superposed symbols into a transmission signal and transmits the signal.
Optionally, in this embodiment, the storage medium may include, but is not limited to: a U-disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic or optical disk, and other various media capable of storing program codes.
Optionally, in this embodiment, the processor executes the above-mentioned multi-user superposition transmission method according to a program code stored in a storage medium.
Optionally, the specific examples in this embodiment may refer to the examples described in the above embodiments and optional implementation manners, and this embodiment is not described herein again.
It will be apparent to those skilled in the art that the modules or steps of the present invention described above may be implemented by a general purpose computing device, they may be centralized on a single computing device or distributed across a network of multiple computing devices, and alternatively, they may be implemented by program code executable by a computing device, such that they may be stored in a storage device and executed by a computing device, and in some cases, the steps shown or described may be performed in an order different than that described herein, or they may be separately fabricated into individual integrated circuit modules, or multiple ones of them may be fabricated into a single integrated circuit module. Thus, the present invention is not limited to any specific combination of hardware and software.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (12)
1. A multi-user superposition transmission method, comprising:
the transmitter performs bit operation on a first group of bits a (0) a (1) … a (2m-1) to be transmitted and a second group of bits b (0) b (1) … b (2n-1) to obtain a third group of bits c (0) c (1) … c (2m-1), wherein m and n are positive integers;
the transmitter makes the second group of bits 2nProcessing the order modulation mode to obtain a second complex symbol, and making the third group of bits into 2mProcessing the order modulation mode to obtain a third complex symbol;
the transmitter uses the second complex symbol as the square root of the power factor
Weighting to obtain a weighted second complex symbol, using said third complex symbol
Weighting to obtain a weighted third complex symbol;
the transmitter adds the weighted second complex symbol and the weighted third complex symbol to obtain a superposed symbol;
the transmitter forms a transmitting signal by the superposed symbol and transmits the transmitting signal;
wherein the bit operations comprise:
performing an exclusive-or operation on a specific bit in the second group of bits and a specific bit in the first group of bits to obtain the third group of bits;
or,
performing exclusive OR operation on part of bits in the second group of bits to obtain an exclusive OR operation result, and performing exclusive OR operation on the exclusive OR operation result and specific bits in the first group of bits to obtain the third group of bits;
or,
the third set of bits consists of two parts: the first part is obtained by carrying out XOR operation on specific bits in the second group of bits and specific bits in the first group of bits; the second part is obtained by keeping bits except the specific bit of the first group of bits unchanged;
or,
the third set of bits consists of two parts: the first part is obtained by performing exclusive OR operation on part of bits in the second group of bits to obtain an exclusive OR operation result, and then performing exclusive OR operation on the exclusive OR operation result and specific bits in the first group of bits; the second part is obtained by keeping bits except the specific bit of the first group of bits unchanged;
wherein a specific bit in the first group of bits determines a quadrant of a mapping constellation point corresponding to the first group of bits;
wherein ⊕ represents XOR operation, ⊙ represents XNOR operation, then
When m is 1 and n is 1, the bit operation is expressed as:
c(0)＝a(0)⊕b(0)，
c(1)＝a(1)⊕b(1)；
when m is 1, n >1, the bit operation is expressed as:
c(0)＝a(0)⊕(b(0)⊙b(2)⊙…b(2n-2))，
c(1)＝a(1)⊕(b(1)⊙b(3)⊙…b(2n-1))；
when m >1, n is 1, the bit operation is expressed as:
c(0)＝a(0)⊕b(0)，
c(1)＝a(1)⊕b(1)，
c(k)＝a(k)，(k＝2,3…2m-1，m>1)；
when m >1, n >1, the bit operation is expressed as:
c(0)＝a(0)⊕(b(0)⊙b(2)⊙…b(2n-2))，
c(1)＝a(1)⊕(b(1)⊙b(3)⊙…b(2n-1))，
c(k)＝a(k)，(k＝2,3…2m-1，m>1)。
2. the method of claim 1,
when m is 1, a 1 st bit c (0) and a 2 nd bit c (1) of the third group of bits are obtained by the bit operation,
when m >1, the 1 st bit c (0) and the 2 nd bit c (1) of the third group of bits are obtained by the bit operation, and the other bits c (2) c (3) … c (2m-1) are obtained by a (2) a (3) … a (2m-1) being kept unchanged.
3. The method of claim 1,
when n is 1, the bit operation does not include an exclusive-nor operation between the second set of bits;
when n >1, the bit operation comprises an exclusive-nor operation on all odd bits in the second group of bits, and an exclusive-or operation on all even bits in the second group of bits.
4. The method of claim 1,
a specific bit a (0) a (1) in the first group of bits determines a quadrant of a mapped constellation point corresponding to the first group of bits.
5. The method of claim 1,
2 is describednThe order modulation mode comprises at least one of the following modes: quadrature phase shift keying QPSK, quadrature amplitude modulation 16QAM, quadrature amplitude modulation 64 QAM;
2 is describedmThe order modulation mode comprises at least one of the following modes: quadrature phase shift keying QPSK, quadrature amplitude modulation 16QAM, quadrature amplitude modulation 64 QAM.
6. The method of claim 1, wherein the mapping constellation of the superimposed symbols has a gray mapping property.
7. A multi-user superposition transmission apparatus provided in a transmitter, comprising:
the operation module is used for carrying out bit operation on a first group of bits a (0) a (1) … a (2m-1) to be transmitted and a second group of bits b (0) b (1) … b (2n-1) to obtain a third group of bits c (0) c (1) … c (2 m-1); wherein m and n are positive integers;
a modulation module for making the second group of bits into 2nProcessing the order modulation mode to obtain a second complex symbol, and making the third group of bits into 2mProcessing the order modulation mode to obtain a third complex symbol;
a superposition module for adding the weighted second complex symbol and the weighted third complex symbol to obtain a superposed symbol, wherein the weighted second complex symbol is the square root of the power factor
Weighting, said weighted third complex symbol being used
Obtaining the weight;
the transmitting module is used for forming a transmitting signal by the superposed symbol and transmitting the transmitting signal;
wherein the bit operations comprise:
performing an exclusive-or operation on a specific bit in the second group of bits and a specific bit in the first group of bits to obtain the third group of bits;
or,
performing exclusive OR operation on part of bits in the second group of bits to obtain an exclusive OR operation result, and performing exclusive OR operation on the exclusive OR operation result and specific bits in the first group of bits to obtain the third group of bits;
or,
the third set of bits consists of two parts: the first part is obtained by carrying out XOR operation on specific bits in the second group of bits and specific bits in the first group of bits; the second part is obtained by keeping bits except the specific bit of the first group of bits unchanged;
or,
the third set of bits consists of two parts: the first part is obtained by performing exclusive OR operation on part of bits in the second group of bits to obtain an exclusive OR operation result, and then performing exclusive OR operation on the exclusive OR operation result and specific bits in the first group of bits; the second part is obtained by keeping bits except the specific bit of the first group of bits unchanged;
wherein a specific bit in the first group of bits determines a quadrant of a mapping constellation point corresponding to the first group of bits;
wherein ⊕ represents XOR operation, ⊙ represents XNOR operation, then
When m is 1 and n is 1, the bit operation is expressed as:
c(0)＝a(0)⊕b(0)，
c(1)＝a(1)⊕b(1)；
when m is 1, n >1, the bit operation is expressed as:
c(0)＝a(0)⊕(b(0)⊙b(2)⊙…b(2n-2))，
c(1)＝a(1)⊕(b(1)⊙b(3)⊙…b(2n-1))；
when m >1, n is 1, the bit operation is expressed as:
c(0)＝a(0)⊕b(0)，
c(1)＝a(1)⊕b(1)，
c(k)＝a(k)，(k＝2,3…2m-1，m>1)；
when m >1, n >1, the bit operation is expressed as:
c(0)＝a(0)⊕(b(0)⊙b(2)⊙…b(2n-2))，
c(1)＝a(1)⊕(b(1)⊙b(3)⊙…b(2n-1))，
c(k)＝a(k)，(k＝2,3…2m-1，m>1)。
8. the apparatus of claim 7,
when m is 1, a 1 st bit c (0) and a 2 nd bit c (1) of the third group of bits are obtained by the bit operation,
when m >1, the 1 st bit c (0) and the 2 nd bit c (1) of the third group of bits are obtained by the bit operation, and the other bits c (2) c (3) … c (2m-1) are obtained by a (2) a (3) … a (2m-1) being kept unchanged.
9. The apparatus of claim 7,
when n is 1, the bit operation does not include an exclusive-nor operation between the second set of bits;
when n >1, the bit operation comprises an exclusive-nor operation on all odd bits in the second group of bits, and an exclusive-or operation on all even bits in the second group of bits.
10. The apparatus of claim 7,
a specific bit a (0) a (1) in the first group of bits determines a quadrant of a mapped constellation point corresponding to the first group of bits.
11. The apparatus of claim 7,
2 is describednThe order modulation mode comprises at least one of the following modes: quadrature phase shift keying QPSK, quadrature amplitude modulation 16QAM, quadrature amplitude modulation 64 QAM;
2 is describedmThe order modulation mode comprises at least one of the following modes: quadrature phase shift keying QPSKQuadrature amplitude modulation 16QAM and quadrature amplitude modulation 64 QAM.
12. The apparatus of claim 7, wherein the mapping constellation of the superimposed symbols has a gray mapping property.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510756526.7A CN106685583B (en) | 2015-11-07 | 2015-11-07 | Multi-user superposition transmission method and device |
| PCT/CN2016/103433 WO2017076207A1 (en) | 2015-11-07 | 2016-10-26 | Multi-user superimposed transmission method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510756526.7A CN106685583B (en) | 2015-11-07 | 2015-11-07 | Multi-user superposition transmission method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106685583A CN106685583A (en) | 2017-05-17 |
| CN106685583B true CN106685583B (en) | 2020-07-07 |
Family
ID=58661798
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510756526.7A Active CN106685583B (en) | 2015-11-07 | 2015-11-07 | Multi-user superposition transmission method and device |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN106685583B (en) |
| WO (1) | WO2017076207A1 (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101040540A (en) * | 2004-12-21 | 2007-09-19 | 中兴通讯股份有限公司 | Code modulation and demodulation system and signal transmitting and receiving method thereof |
| CN102387106A (en) * | 2010-08-30 | 2012-03-21 | 华为技术有限公司 | Method and device for performing data modulation in multi-user multi-input multi-output (MU-MIMO) communication system |
| CN103327532A (en) * | 2009-09-24 | 2013-09-25 | 北京理工大学 | Method and device for downlink multi-cell multi-user combined transmission |
| CN104486035A (en) * | 2014-12-08 | 2015-04-01 | 清华大学 | Superposition coding and orthogonal multiplexing combined downlink multiuser transmission method |
| CN104901915A (en) * | 2015-05-07 | 2015-09-09 | 北京邮电大学 | Communication method and device supporting multiple users |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100450764B1 (en) * | 2002-10-10 | 2004-10-01 | 한국전자통신연구원 | Apparatus and method for constellation mapping |
| US20100046644A1 (en) * | 2008-08-19 | 2010-02-25 | Motorola, Inc. | Superposition coding |
| EP2359664A1 (en) * | 2008-11-21 | 2011-08-24 | Pin-Han Ho | System, method, and computer program for superposition coded multicast with a single modulation scheme |
| CN106160936B (en) * | 2015-04-15 | 2020-01-17 | 中兴通讯股份有限公司 | Multi-user information processing method and device |
-
2015
- 2015-11-07 CN CN201510756526.7A patent/CN106685583B/en active Active
-
2016
- 2016-10-26 WO PCT/CN2016/103433 patent/WO2017076207A1/en active Application Filing
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101040540A (en) * | 2004-12-21 | 2007-09-19 | 中兴通讯股份有限公司 | Code modulation and demodulation system and signal transmitting and receiving method thereof |
| CN103327532A (en) * | 2009-09-24 | 2013-09-25 | 北京理工大学 | Method and device for downlink multi-cell multi-user combined transmission |
| CN102387106A (en) * | 2010-08-30 | 2012-03-21 | 华为技术有限公司 | Method and device for performing data modulation in multi-user multi-input multi-output (MU-MIMO) communication system |
| CN104486035A (en) * | 2014-12-08 | 2015-04-01 | 清华大学 | Superposition coding and orthogonal multiplexing combined downlink multiuser transmission method |
| CN104901915A (en) * | 2015-05-07 | 2015-09-09 | 北京邮电大学 | Communication method and device supporting multiple users |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2017076207A1 (en) | 2017-05-11 |
| CN106685583A (en) | 2017-05-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10587380B2 (en) | Frequency diversity modulation system and method | |
| JP6692807B2 (en) | Method and apparatus for superposing and demodulating multi-user information transmission | |
| WO2017016342A1 (en) | Modulation method, demodulation method, and apparatus for multi-user information transmission | |
| CN106160787B (en) | A kind of data transmission method and device | |
| WO2016169414A1 (en) | Multiuser information processing method and apparatus | |
| CN105703877B (en) | superposition coding and decoding method and device, transmitter and receiver | |
| CN106160936B (en) | Multi-user information processing method and device | |
| CN106302299B (en) | Multi-user access method and device | |
| US10432356B2 (en) | Data transmitting or receiving method and device for dual TBs, transmitter and receiver | |
| CN110011948B (en) | Data transmission method and device, storage medium and electronic device | |
| CN106685583B (en) | Multi-user superposition transmission method and device | |
| US10979263B2 (en) | Data processing method and device | |
| JP2014165830A (en) | Transmitter, receiver, and transmission method | |
| CN106998313A (en) | A kind of information modulation method and device | |
| JP5662955B2 (en) | Receiving apparatus and receiving method | |
| WO2019136741A1 (en) | Methods and computing device for facilitating multiple access in a wireless communication network | |
| KR100717682B1 (en) | Apparatus and method for generating signal according to ifdma, and apparatus for receiving signal | |
| CN107370708B (en) | Information modulation method and device | |
| Lin et al. | On the modulation and signalling design for a transform domain communication system | |
| JP4637721B2 (en) | Multiple access method | |
| CN108463957A (en) | Information transferring method, device and communication system suitable for non-orthogonal multiple access | |
| CN107707496B (en) | Method and device for processing modulation symbols | |
| CN109274458A (en) | A kind of method and device for realizing decoding processing | |
| CN108322415B (en) | Multi-carrier frequency-amplitude combined modulation and demodulation method | |
| JP2018532339A (en) | Multi-carrier modulation apparatus, multi-carrier demodulation apparatus, method and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |