CN106685583A - Multiuser superposition transmission method and multiuser superposition transmission device - Google Patents
Multiuser superposition transmission method and multiuser superposition transmission device Download PDFInfo
- Publication number
- CN106685583A CN106685583A CN201510756526.7A CN201510756526A CN106685583A CN 106685583 A CN106685583 A CN 106685583A CN 201510756526 A CN201510756526 A CN 201510756526A CN 106685583 A CN106685583 A CN 106685583A
- Authority
- CN
- China
- Prior art keywords
- bit
- group
- arithmetic
- specific
- symbol
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
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 multiuser superposition transmission method and a multiuser superposition transmission device. The method comprises steps: a transmitter carries out bit operation on a first group of to-be-transmitted 2m bits and a second group of to-be-transmitted 2n bits to obtain a third group of 2m bits, wherein m and n are positive integers; the transmitter carries out 2<n>-order modulation mode processing on the second group of bits to obtain second plural symbols, and the third group of bits is subjected to processing in a 2<m>-order modulation mode to obtain third plural symbols; the transmitter uses a square root of alpha to weight the second plural symbols to obtain second weighted plural symbols, and uses a square root of 1-alpha to weight the third plural symbols to obtain third weighted plural symbols; the transmitter adds the second weighted plural symbols and the third weighted plural symbols to obtain superposition symbols; and the transmitter forms the superposition symbols into transmission signals to be transmitted. Thus, effects that the robustness of a receiver for symbol-level SIC (Successive Interference Cancellation) can be enhanced through simple and unique design processing, and the access performance is enhanced in a lower-complexity receiver condition can be achieved.
Description
Technical field
The present invention relates to the communications field, in particular to a kind of multi-user's superposed transmission method and device.
Background technology
The principle of non-orthogonal multiple technology (None Orthogonal Multiple Access, referred to as NOMA) is that emitting side is done
Multi-user information supercomposed coding, receiving side using serial interference elimination (Successive Interference Cancellation, referred to as
SIC)。
For example supercomposed coding is done in a broadcast system emitting side, referred to the information superposition of multiple users to together, " be superimposed " here
Typically power domain is directly added.Emitter sends the information after superposition to multiple receivers simultaneously.Each receiver solution comes from
The information that oneself needs.It should be noted that supercomposed coding technology makes the information of each user to be transmitted on " whole passage ",
Thus interfere between each user profile in demodulation.
Non-orthogonal multiple technology can be generally divided into two kinds of demodulation methods：The first, each user with other users interference
Demodulation, is achieved in that relatively simple, but performance damages.Secondth, it is to use interference cancellation techniques, namely multi-user's inspection
Survey technology.It is briefly described by taking the SIC processes of two users as an example below, the SIC processes of multi-user are easy to thus promote：
First demodulate the information (A information is demodulated with the interference of user B) of user A.Then, when user's B information is demodulated,
Needs first will before demodulate the A information (code block level SIC needs reconstruct) come and deduct, and re-demodulation goes out user's B information.So
Because can not interfere with, performance there may be larger lifting to user B information.Classical documents are proved to adopt supercomposed coding
Can be to reach multi-user information capacity limitation with reference to code block level SIC technology.
As shown in Fig. 1 (a)～(c), as QPSK (QPSK) symbols and 16QAM (quadrature amplitude modulation)
Symbol supercomposed coding schematic diagram, carries a QPSK symbol (as shown in Fig. 1 (a)) of bit information " 00 " and carries ratio
One 16QAM symbol (as shown in Fig. 1 (b)) of special information " 1011 " is directly added in power domain, obtains a superposition
The symbol (as shown in Fig. 1 (c)) of carrying bit information " 001011 " afterwards.
In the same manner, as shown in Fig. 2 (a)～(c), except including situation in Fig. 1, also including another kind of situation, that is, ratio is carried
One QPSK symbol (as shown in Fig. 2 (a)) of special information " 10 " and a 16QAM of carrying bit information " 0011 "
Symbol (as shown in Fig. 2 (b)) is directly added in power domain, obtains a symbol for carrying bit information " 100011 " (such as
Shown in Fig. 2 (c)).All possible superposition situation can be obtained by 64 constellation points in Fig. 2 (c) shown in constellation.
It can easily be seen that two symbols are directly added from Fig. 2 (c), the constellation point that final all symbol combinations being likely to be obtained go out
Without Gray (Gray) attribute mapping, (bit information entrained by the adjacent constellation point of mapping only exists 1 bit difference, leads to
The best performance often so modulated), such as " 100011 " and " 001011 " have dibit to differ.
If terminal demodulates superposition symbol using simple symbol level SIC, its demodulation performance can decline it is larger, thus, in order to
Ensure performance, terminal is needed using complicated code block level SIC.But, code block level SIC can cause very high realization for terminal
Complexity, power consumption and time delay, these are sometimes unacceptable for terminal.
Hierarchical modulation (Hierarchical modulation) can also regard a kind of mutation of supercomposed coding as.Hierarchical modulation refers to logical
The combination of too high Prioritized Bit stream and low Prioritized Bit stream, is then mapped in planisphere.Although hierarchical modulation can also be combined into
Constellation with Gray attribute mappings, but hierarchical modulation distributes very dumb, Er Qieqi to the different capacity that carries out of different data streams
Implementation complexity is also higher.And it is the necessary hand for reaching descending multi-user channel capacity that different data streams are carried out with different capacity distribution
Section.
In sum, the multi-user information in correlation technique does supercomposed coding in emitter, corresponding, if receiver uses letter
Demodulating superposition symbol, its demodulation performance can decline larger single symbol level SIC.
The content of the invention
The invention provides a kind of multi-user's superposed transmission method and device, is being launched with least solving multi-user information in correlation technique
When machine does supercomposed coding, if receiver demodulates superposition symbol using simple symbol level SIC, its demodulation performance can decline compared with
Big problem.
According to one embodiment of present invention, there is provided a kind of multi-user's superposed transmission method, including：
Emitter with second group of bit b (0) b (1) ... b (2n-1), carries out first group of bit a (0) a (1) ... a (2m-1) to be sent
Bit arithmetic obtains the 3rd group of bit c (0) c (1) ... c (2m-1), wherein, m, n are positive integer；
Second group of bit is done 2 by the emitternThe process of rank modulation system obtains the second complex symbol, by the 3rd group of ratio
Spy does 2mThe process of rank modulation system obtains the 3rd complex symbol；
The emitter is by the square root of the second complex symbol power factorWeighting obtains the second complex symbol for weighting,
3rd complex symbol is usedWeighting obtains the 3rd complex symbol for weighting；
Second complex symbol of the weighting is added and obtains being superimposed symbol by the emitter with the 3rd complex symbol of weighting；
The superposition symbol is formed transmission signal and is launched by the emitter；
Wherein, the bit arithmetic includes：
Specific bit in specific bit in second group of bit and first group of bit is done into XOR and obtains described
Three groups of bits；
Or,
First the partial bit in second group of bit is done into same or computing and obtain same or operation result, then by the same or computing knot
Fruit is cooked XOR and obtains the 3rd group of bit with the specific bit in first group of bit；
Or,
The 3rd group of bit is made up of two parts：Part I is by by the specific bit and described first in second group of bit
Specific bit in group bit is done XOR and is obtained；Part II is protected by the bit beyond the specific bit of first group of bit
Hold constant obtaining；
Or,
The 3rd group of bit is made up of two parts：Part I by, first by the partial bit in second group of bit do with or fortune
Calculation obtains same or operation result, then the same or operation result is done into XOR with the specific bit in first group of bit
Obtain；Part II keeps constant obtaining by the bit beyond the specific bit of first group of bit；
Wherein, the specific bit in first group of bit determines the place quadrant of the corresponding mapped constellation points of first group of bit.
Alternatively, ⊕ represents XOR, and ⊙ represents same or computing, then
Work as m=1, during n=1, the bit arithmetic is expressed as：
C (0)=a (0) ⊕ b (0),
C (1)=a (1) ⊕ b (1)；
Work as m=1, n>When 1, the bit arithmetic 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))；
Work as m>When 1, n=1, the bit arithmetic 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)；
Work as m>1, n>When 1, the bit arithmetic 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,
As m=1, the 1st bit c (0) and the 2nd bit c (1) of the 3rd group of bit are obtained by the bit arithmetic,
Work as m>When 1, the 1st bit c (0) and the 2nd bit c (1) of the 3rd group of bit are obtained by the bit arithmetic, its
His bit c (2) c (3) ... c (2m-1) is by a (2) a (3) ..., and a (2m-1) keeps constant and obtains.
Alternatively,
As n=1, the bit arithmetic does not include the same or computing between second group of bit；
Work as n>When 1, the bit arithmetic includes that the bit of all odd bits in second group of bit does same or computing, described
The bit of all even bits in second group of bit does same or computing.
Alternatively,
Specific bit a (0) a (1) in first group of bit determines the place quadrant of the corresponding mapped constellation points of first group of bit.
Alternatively,
Described 2nRank modulation system includes at least one of：QPSK QPSK, quadrature amplitude modulation 16QAM, just
Hand over Modulation and Amplitude Modulation 64QAM；
Described 2mRank modulation system includes at least one of：QPSK QPSK, quadrature amplitude modulation 16QAM, just
Hand over Modulation and Amplitude Modulation 64QAM.
Alternatively, the mapped constellation of the superposition symbol has gray mappings attribute.
According to another embodiment of the present invention, there is provided a kind of multi-user's superposed transmission device, in being arranged at emitter, including：
Computing module, for by first group of bit a (0) a (1) ... a (2m-1) to be sent, and second group of bit b (0) b (1) ... b (2n-1),
Carry out bit arithmetic and obtain the 3rd group of bit c (0) c (1) ... c (2m-1)；Wherein, m, n are positive integer；
Modulation module, for second group of bit to be done into 2nThe process of rank modulation system obtains the second complex symbol, by the described 3rd
Group bit does 2mThe process of rank modulation system obtains the 3rd complex symbol；
Laminating module, obtains being superimposed symbol for the second complex symbol of weighting to be added with the 3rd complex symbol of weighting, described to add
The square root of the second complex symbol power factor of powerWeighting is obtained, and the 3rd complex symbol of the weighting is usedPlus
Power is obtained；
Transmitter module, launches for the superposition symbol to be formed into transmission signal；
Wherein, the bit arithmetic includes：
Specific bit in specific bit in second group of bit and first group of bit is done into XOR and obtains described
Three groups of bits；
Or,
First the partial bit in second group of bit is done into same or computing and obtain same or operation result, then by the same or computing knot
Fruit is cooked XOR and obtains the 3rd group of bit with the specific bit in first group of bit；
Or,
The 3rd group of bit is made up of two parts：Part I is by by the specific bit and described first in second group of bit
Specific bit in group bit is done XOR and is obtained；Part II is protected by the bit beyond the specific bit of first group of bit
Hold constant obtaining；
Or,
The 3rd group of bit is made up of two parts：Part I by, first by the partial bit in second group of bit do with or fortune
Calculation obtains same or operation result, then the same or operation result is done into XOR with the specific bit in first group of bit
Obtain；Part II keeps constant obtaining by the bit beyond the specific bit of first group of bit；
Wherein, the specific bit in first group of bit determines the place quadrant of the corresponding mapped constellation points of first group of bit.
Alternatively, ⊕ represents XOR, and ⊙ represents same or computing, then
Work as m=1, during n=1, the bit arithmetic is expressed as：
C (0)=a (0) ⊕ b (0),
C (1)=a (1) ⊕ b (1)；
Work as m=1, n>When 1, the bit arithmetic 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))；
Work as m>When 1, n=1, the bit arithmetic 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)；
Work as m>1, n>When 1, the bit arithmetic 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,
As m=1, the 1st bit c (0) and the 2nd bit c (1) of the 3rd group of bit are obtained by the bit arithmetic,
Work as m>When 1, the 1st bit c (0) and the 2nd bit c (1) of the 3rd group of bit are obtained by the bit arithmetic, its
His bit c (2) c (3) ... c (2m-1) is by a (2) a (3) ..., and a (2m-1) keeps constant and obtains.
Alternatively,
As n=1, the bit arithmetic does not include the same or computing between second group of bit；
Work as n>When 1, the bit arithmetic includes that the bit of all odd bits in second group of bit does same or computing, described
The bit of all even bits in second group of bit does same or computing.
Alternatively,
Specific bit a (0) a (1) in first group of bit determines the place quadrant of the corresponding mapped constellation points of first group of bit.
Alternatively,
Described 2nRank modulation system includes at least one of：QPSK QPSK, quadrature amplitude modulation 16QAM, just
Hand over Modulation and Amplitude Modulation 64QAM；
Described 2mRank modulation system includes at least one of：QPSK QPSK, quadrature amplitude modulation 16QAM, just
Hand over Modulation and Amplitude Modulation 64QAM.
Alternatively, the mapped constellation of the superposition symbol has gray mappings attribute.
By the present invention, using emitter by first group of bit a (0) a (1) ... a (2m-1) to be sent, with second group of bit
B (0) b (1) ... b (2n-1), carries out bit arithmetic and obtains the 3rd group of bit c (0) c (1) ... c (2m-1), wherein, m, n are positive integer；
Second group of bit is done 2 by the emitternThe process of rank modulation system obtains the second complex symbol, and the 3rd group of bit is done
2mThe process of rank modulation system obtains the 3rd complex symbol；The emitter is by the square root of the second complex symbol power factorWeighting obtains the second complex symbol for weighting, and the 3rd complex symbol is usedWeight obtain weighting the 3rd plural
Symbol；Second complex symbol of the weighting is added and obtains being superimposed symbol by the emitter with the 3rd complex symbol of weighting；Institute
State emitter to launch the superposition symbol formation transmission signal；Wherein, the bit arithmetic includes：By described second group
Specific bit in specific bit in bit and first group of bit does XOR and obtains the 3rd group of bit；Or,
First the partial bit in second group of bit is done into same or computing and obtain same or operation result, then by the same or operation result
XOR is done with the specific bit in first group of bit obtain the 3rd group of bit；Or, the 3rd group of bit by
Two parts are constituted：Part I is by by the specific bit in the specific bit in second group of bit and first group of bit
Do XOR to obtain；Part II keeps constant obtaining by the bit beyond the specific bit of first group of bit；Or,
The 3rd group of bit is made up of two parts：Part I by, first by the partial bit in second group of bit do with or computing
Obtain with or operation result, then by it is described with or operation result and first group of bit in specific bit do XOR and obtain
Arrive；Part II keeps constant obtaining by the bit beyond the specific bit of first group of bit；Wherein, first group of ratio
Specific bit in spy determines the mode of the place quadrant of the corresponding mapped constellation points of first group of bit, solves correlation technique
In multi-user information when emitter does supercomposed coding, if receiver demodulates superposition symbol using simple symbol level SIC,
Its demodulation performance can decline larger problem, and then reached and can strengthen receiver by simple unique design treatment and do symbol
The robustness of level SIC, i.e., strengthen the effect of access performance under the conditions of more low complex degree receiver.
Description of the drawings
Accompanying drawing described herein is used for providing a further understanding of the present invention, constitutes the part of the application, and the present invention's shows
Meaning property embodiment and its illustrated for explaining the present invention, does not constitute inappropriate limitation of the present invention.In the accompanying drawings：
Fig. 1 (a) is the schematic diagram one (a) of the QPSK symbols according to correlation technique and 16QAM symbol supercomposed codings；
Fig. 1 (b) is the schematic diagram one (b) of the QPSK symbols according to correlation technique and 16QAM symbol supercomposed codings；
Fig. 1 (c) is the schematic diagram one (c) of the QPSK symbols according to correlation technique and 16QAM symbol supercomposed codings；
Fig. 2 (a) is the schematic diagram two (a) of the QPSK symbols according to correlation technique and 16QAM symbol supercomposed codings；
Fig. 2 (b) is the schematic diagram two (b) of the QPSK symbols according to correlation technique and 16QAM symbol supercomposed codings；
Fig. 2 (c) is the schematic diagram two (c) of the QPSK symbols according to correlation technique and 16QAM symbol supercomposed codings；
Fig. 3 is the flow chart of multi-user's superposed transmission method according to embodiments of the present invention；
Fig. 4 is the structured flowchart of multi-user's superposed transmission device according to embodiments of the present invention；
Fig. 5 is to implement processing procedure schematic diagram of the multi-user information in emitter in example one according to the present invention；
Fig. 6 is the constellation mapping schematic diagram for implementing second group of bit in example two according to the present invention；
Fig. 7 is the constellation mapping schematic diagram for implementing first group of bit in example two according to the present invention；
Fig. 8 is to form schematic diagram according to the 3rd group of bit in the case of the first in present invention enforcement example two；
Fig. 9 is the constellation mapping schematic diagram for implementing the 3rd bit information in example two according to the present invention；
Figure 10 is to form schematic diagram according to the 3rd group of bit in the case of of the invention enforcement second in example two；
Figure 11 (a) is superposition schematic diagram (a) for implementing the first situation in example two according to the present invention；
Figure 11 (b) is superposition schematic diagram (b) for implementing the first situation in example two according to the present invention；
Figure 11 (c) is superposition schematic diagram (c) for implementing the first situation in example two according to the present invention；
Figure 12 (a) is superposition schematic diagram (a) for implementing second situation in example two according to the present invention；
Figure 12 (b) is superposition schematic diagram (b) for implementing second situation in example two according to the present invention；
Figure 12 (c) is superposition schematic diagram (c) for implementing second situation in example two according to the present invention；
Figure 13 is that the stack result for implementing first, second kind of situation in example two according to the present invention compares.
Specific embodiment
Below with reference to accompanying drawing and in conjunction with the embodiments describing the present invention in detail.It should be noted that in the case where not conflicting,
The feature in embodiment and embodiment in the application can be mutually combined.
If it should be noted that not conflicting, each feature in the embodiment of the present invention and embodiment can be combined with each other,
Within protection scope of the present invention.In addition, though logical order is shown in flow charts, but in some cases, can
With with different from the shown or described step of order execution herein.
It should be noted that description and claims of this specification and term " first ", " second " in above-mentioned accompanying drawing etc. are to use
In the similar object of difference, without being used to describe specific order or precedence.
In the present embodiment, there is provided a kind of multi-user's superposed transmission method, Fig. 3 is that multi-user according to embodiments of the present invention folds
Plus the flow chart of transmission method, as shown in figure 3, the flow process comprises the steps：
Step S302, emitter by first group of bit a (0) a (1) ... a (2m-1) to be sent, with second group of bit
B (0) b (1) ... b (2n-1), carries out bit arithmetic and obtains the 3rd group of bit c (0) c (1) ... c (2m-1), wherein, m, n are positive integer；
Wherein, the bit arithmetic includes：
Specific bit in specific bit in second group of bit and first group of bit is done into XOR and obtains described
Three groups of bits；
Or, first by the partial bit in second group of bit do with or computing obtain with or operation result, then will it is described together or
Specific bit in operation result and first group of bit does XOR and obtains the 3rd group of bit；
Or, the 3rd group of bit is made up of two parts：Part I is by by the specific bit in second group of bit and institute
State the specific bit in first group of bit and do XOR and obtain；Beyond specific bit of the Part II by first group of bit
Bit keeps constant obtaining；
Or, the 3rd group of bit is made up of two parts：Part I is by first doing the partial bit in second group of bit
Same or computing obtains same or operation result, then the same or operation result is done into different with the specific bit in first group of bit
Or computing is obtained；Part II keeps constant obtaining by the bit beyond the specific bit of first group of bit；
Second group of bit is done 2 by step S304, the emitternThe process of rank modulation system obtains the second complex symbol, by institute
State the 3rd group of bit and do 2mThe process of rank modulation system obtains the 3rd complex symbol；
Step S306, the emitter is by the square root of the second complex symbol power exponentαWeighting obtains what is weighted
Second complex symbol, the 3rd complex symbol is usedWeighting obtains the 3rd complex symbol for weighting；
Second complex symbol of the weighting is added and is superimposed by step S308, the emitter with the 3rd complex symbol of weighting
Symbol；
The superposition symbol is formed transmission signal and is launched by step S310, the emitter.
Wherein, the specific bit in first group of bit determines the place quadrant of the corresponding mapped constellation points of first group of bit.
Specific bit in second group of bit can be selected according to corresponding 3rd group of bit, for example, in the 3rd group of bit is calculated
Odd bit when, the bit of all odd bits in second group of bit can be selected as specific bit, and calculating the 3rd group
During even bit in bit, the bit of all even bits in second group of bit can be selected as specific bit.
By above-mentioned steps, emitter gets superposition symbol using above-mentioned unique processing mode, and the superposition symbol is formed
Transmission signal is transmitted so that robustness when receiver is symbol level SIC is improved, and solves the multi-user in correlation technique
Information is when emitter does supercomposed coding, if receiver demodulates superposition symbol using simple symbol level SIC, its solution tonality
Can decline larger problem, and then reach and receiver can be strengthened by simple unique design treatment be symbol level SIC's
Robustness, i.e., strengthen the effect of access performance under the conditions of more low complex degree receiver.
Alternatively, ⊕ represents XOR, and ⊙ represents same or computing, then
Work as m=1, during n=1, the bit arithmetic can be expressed as：
C (0)=a (0) ⊕ b (0),
C (1)=a (1) ⊕ b (1)；
Work as m=1, n>When 1, the bit arithmetic 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))；
Work as m>When 1, n=1, the bit arithmetic 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)；
Work as m>1, n>When 1, the bit arithmetic 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 to those skilled in the art, change that is same or there may be change order of operation with the calculating of XOR
Shape, for example, first carries out XOR and calculates again result and bit below being done with or being calculated etc., but the result of gained with above-mentioned public affairs
Formula is identical.As can be seen here, these deformations for changing order of operation all should work as and belong within the protection domain of the application, hereinafter deposit
Repeating no more in same case.
Alternatively, as m=1, the 1st bit c (0) and the 2nd bit c (1) of the 3rd group of bit is by the bit
Computing is obtained, and works as m>When 1, the 1st bit c (0) and the 2nd bit c (1) of the 3rd group of bit are obtained by the bit arithmetic
Arrive, other bits c (2) c (3) ... c (2m-1) are by a (2) a (3) ..., and a (2m-1) keeps constant obtains.
Alternatively, as n=1, the bit arithmetic does not include the same or computing between second group of bit；Work as n>When 1,
The bit arithmetic includes the ⊙ (same or computing) between second group of bit b (0) b (1) ... b (2n-1), wherein second group of ratio here
Same or computing between spy is specifically included：The bit of all odd bits in second group of bit do with or computing, described second
The bit of all even bits in group bit does same or computing.
Alternatively, specific bit a (0) a (1) in first group of bit determines that first group of bit a (0) a (1) ... a (2n-1) is corresponding and reflects
Penetrate the place quadrant of constellation point.
Alternatively, 2 are usednRank modulation system uses 2 modulating second group of bitmRank modulation system is modulating the 3rd group of bit.2nRank
Modulation system includes at least one of：QPSK QPSK, quadrature amplitude modulation 16QAM, quadrature amplitude modulation
64QAM。2mRank modulation system includes QPSK QPSK, quadrature amplitude modulation 16QAM, quadrature amplitude modulation
64QAM。
Alternatively, the mapped constellation of the superposition symbol has gray mappings attribute.
A kind of multi-user's superposed transmission device is additionally provided in the present embodiment, and the device is used to realize above-described embodiment and preferred reality
Mode is applied, repeating no more for explanation had been carried out.As used below, term " module " can realize predetermined function
The combination of software and/or hardware.Although the device described by following examples is preferably realized with software, hardware, or
The realization of the combination of software and hardware is also may and to be contemplated.
The embodiment of the present invention additionally provides a kind of multi-user's superposed transmission device, and in being arranged at emitter, Fig. 4 is according to the present invention
The structured flowchart of multi-user's superposed transmission device of embodiment, as shown in figure 4, the device includes：
Computing module 42, for by first group of bit a (0) a (1) ... a (2m-1) to be sent, with second group of bit b (0) b (1) ...
B (2n-1), carries out bit arithmetic and obtains the 3rd group of bit c (0) c (1) ... c (2m-1)；Wherein, m, n are positive integer；
Modulation module 44, for second group of bit to be done into 2nThe process of rank modulation system obtains the second complex symbol, by described the
Three groups of bits do 2mThe process of rank modulation system obtains the 3rd complex symbol；
Laminating module 46, obtains being superimposed symbol, institute for the second complex symbol of weighting to be added with the 3rd complex symbol of weighting
The square root weighting for stating the second complex symbol power factor of weighting is obtained, and the 3rd complex symbol of the weighting is with weighting
Arrive；
Transmitter module 48, launches for the superposition symbol to be formed into transmission signal；
Wherein, the bit arithmetic includes：
Specific bit in specific bit in second group of bit and first group of bit is done into XOR and obtains described
Three groups of bits；
Or,
First the partial bit in second group of bit is done into same or computing and obtain same or operation result, then by the same or computing
As a result do XOR and obtain the 3rd group of bit with the specific bit in first group of bit；
Or,
The 3rd group of bit is made up of two parts：Part I is by by the specific bit in second group of bit and described
Specific bit in one group of bit is done XOR and is obtained；Part II is by the bit beyond the specific bit of first group of bit
Keep constant obtaining；
Or,
The 3rd group of bit is made up of two parts：Part I by, first by the partial bit in second group of bit do with or
Computing obtains same or operation result, then the same or operation result is done into XOR fortune with the specific bit in first group of bit
Obtain；Part II keeps constant obtaining by the bit beyond the specific bit of first group of bit.
Wherein, the specific bit in first group of bit determines the place quadrant of the corresponding mapped constellation points of first group of bit.
Specific bit in second group of bit can be selected according to corresponding 3rd group of bit, for example, in the 3rd group of bit is calculated
Odd bit when, the bit of all odd bits in second group of bit can be selected as specific bit, and calculating the 3rd group
During even bit in bit, the bit of all even bits in second group of bit can be selected as specific bit.
Alternatively, ⊕ represents XOR, and ⊙ represents same or computing, then
Work as m=1, during n=1, the bit arithmetic can be expressed as：
C (0)=a (0) ⊕ b (0),
C (1)=a (1) ⊕ b (1)；
Work as m=1, n>When 1, the bit arithmetic 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))；
Work as m>When 1, n=1, the bit arithmetic 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)；
Work as m>1, n>When 1, the bit arithmetic 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,
As m=1, the 1st bit c (0) and the 2nd bit c (1) of the 3rd group of bit are obtained by the bit arithmetic,
Work as m>When 1, the 1st bit c (0) and the 2nd bit c (1) of the 3rd group of bit are obtained by the bit arithmetic, its
His bit c (2) c (3) ... c (2m-1) is by a (2) a (3) ..., and a (2m-1) keeps constant and obtains.
Alternatively,
As n=1, the bit arithmetic does not include the same or computing between second group of bit；
Work as n>When 1, the bit arithmetic includes that the bit of all odd bits in second group of bit does same or computing, described
The bit of all even bits in second group of bit does same or computing.
Alternatively,
Specific bit a (0) a (1) in first group of bit determines the place quadrant of the corresponding mapped constellation points of first group of bit.
Alternatively,
Described 2nRank modulation system includes at least one of：QPSK QPSK, quadrature amplitude modulation 16QAM, just
Hand over Modulation and Amplitude Modulation 64QAM；
Described 2mRank modulation system includes at least one of：QPSK QPSK, quadrature amplitude modulation 16QAM, just
Hand over Modulation and Amplitude Modulation 64QAM.
Alternatively, the mapped constellation of the superposition symbol has gray mappings attribute.
It should be noted that above-mentioned modules can be by software or hardware to realize, for the latter, can by with
Under type is realized, but not limited to this：Above-mentioned module is respectively positioned in same processor；Or, above-mentioned module is located at respectively multiple places
In reason device.
In one specific example of multi-user's superposed transmission method provided in an embodiment of the present invention, specific bit in second group of bit
Bit after XOR is obtained with all bit XORs in first group of bit, bit is combined in second group of bit except upper after gained XOR
The bit outside specific bit is stated, the 3rd group of bit is obtained, first, that first group of bit and the 3rd group of bit process are obtained
The superposition of two complex symbols obtains being superimposed symbol, superposition symbol is formed into transmission signal and is launched.Using the embodiment of the present invention, it is
System receiver can obtain more preferable SIC robustness, and under the conditions of more low complex degree receiver access performance is strengthened.
To emphasize the characteristic of the embodiment of the present invention, below preferably typical case the embodiment of the embodiment of the present invention is done furtherly
It is bright.
Implement example one
Multi-user information is after emitter is processed, while being sent to two receivers, for example, emitter will be simultaneously by first group
Bit transfer to central user receiver UE1, and by second group of bit transfer to edge customer receiver UE2.This two groups of ratios
Special being superimposed after emitter is processed sends.Corresponding receiver UE1, receiver UE2 are from receiving two groups of bits
Overlapped information in demodulate oneself needs information, be as shown in Figure 5 processing procedure of the multi-user information in emitter.
As shown in figure 5, first, first group of bit is obtained after UE1 bit informations are encoded, UE2 bit informations are encoded
After obtain second group of bit, the coding method that coding can be adopted according to existing standard, such as Turbo codings.In this enforcement example
In, coding is optional step, the step of encoding can not be included in application, you can directly to make first group of bit as UE1 bits
Information, directly makes second group of bit be UE2 bit informations.
Then, the modulation symbol that second group of bit directly obtains certain power by modulation is (i.e.：Second complex symbol of weighting),
And first group of bit first obtains the tune of certain power by modulation again with second group of bit after bit arithmetic obtains the 3rd group of bit
Symbol processed is (i.e.：3rd complex symbol of weighting), wherein the modulation methods that the modulation of second group of bit can be adopted according to existing standard
Method, for example：QPSK、16QAM；The modulation of the 3rd group of bit can be using QPSK, 16QAM etc..
Wherein the 3rd group bit is made up of two parts, and a part is by specific in specific bit in second group of bit and first group of bit
The computing of both bits is obtained, and another part keeps constant obtaining by the bit in second group of bit in addition to above-mentioned specific bit.Example
If second group of bit is " 10 ", first group of bit is " 1100 ", wherein front dibit " 11 " is specific 2 bits.Then
The 3rd group of bit for arriving is " 0100 ", and wherein front two " 01 " is that second group of bit " 10 " and first group of bit are specific 2
Bit " 11 " XOR is obtained：
0=1 ⊕ 1,
1=0 ⊕ 1,
Then two keep constant obtaining by the bit " 00 " in first group of bit in addition to above-mentioned specific bit.
Finally respectively " 10 " and " 0100 " are modulated and are multiplied by respectively after corresponding power adjusting factor and be superimposed
Symbol, and superposition symbol is formed into transmission signal transmission.
Implement example two
Two groups of bits are sent to two receiver users after emitter is processed.More specifically, first, second group of bit is two
Individual bit, as shown in fig. 6, represent mapping of two bits in planisphere, such as when it is " 10 ", in being mapped to Fig. 6
With in the constellation point that filled circles are represented.First group of bit is four bits, as shown in fig. 7, its mapping in planisphere is represented,
For example when it is " 1011 ", it is mapped in Fig. 7 in the constellation point represented with filled circles.Here the 16QAM constellations for adopting
For LTE standard 16QAM constellation, the 1st, the 2nd bit in four bits is important bit, that is, determine I roads Q roads
The 1st " 1 " and the 2nd " 0 " in the positive and negative bit of component, i.e. " 1011 " is important bit.
Then, second group of bit is directly modulated by QPSK modes, obtains the modulation symbol of certain power (i.e.：The of weighting
Two complex symbols), and second group of bit first obtains the 3rd group of bit with first group of bit through bit arithmetic, the 3rd group of bit again by
The 16QAM modes of LTE standard are modulated and obtain the modulation symbol of certain power (i.e.：3rd complex symbol of weighting).
Wherein the 3rd group bit is made up of two parts, as shown in figure 8, a part by specific two bits in first group of bit with
Both two bits in second group of bit XORs are obtained, another part by first group of bit in addition to above-mentioned specific bit
Bit keep constant obtaining.More specifically, second group of bit is " 10 " in Fig. 8, and first group of bit is " 1011 ", wherein the
1 bit and the 2nd bit " 10 " are specific 2 bits.The 3rd group of bit for then obtaining is " 0011 ", wherein the 1st bit
Obtained by second group of bit " 10 " and specific 2 bits " 10 " XOR of first group of bit with the 2nd bit " 00 ",
Be expressed as " 10 " ⊕ " 10 "=" 00 " in Fig. 8, and other two bits by first group of bit in addition to above-mentioned specific bit
Bit " 11 " keep constant obtaining.
As shown in figure 9, being the mapping of 4 bits in planisphere of the 3rd group of bit.Contrast the second bit information constellation mapping and
3rd group of bit constellation mapping easily finds that constellation point has been changed to and the empty axisymmetric position of constellation.Alternatively possible situation,
As shown in Figure 10, make the second bit information be " 00 ", make the first bit information be " 1011 ", can obtain the 3rd group of bit is
" 1011 ", wherein the first bit " 1 " and the second bit " 0 " respectively by the 1st bit " 1 " in the first bit information, the 2nd
Bit " 0 " carries out XOR and obtains with " 00 " of the second bit information, and the 3rd, the 4th bit " 11 " is to maintain the first bit letter
In breath the 3rd, the 4th bit is constant obtains；It is as the first bit information, so the mapping in planisphere is same.
The possible situation of above two is respectively obtained after complex symbol, is done superposition and is obtained being superimposed symbol.It is easily understood that QPSK
Modulation symbol has 4 kinds of possible constellation points in planisphere, and 16QAM modulation symbols have 16 kinds of possible constellations in planisphere
Point, then the superposition symbol of two complex symbols have 64 kinds of possible constellation points in planisphere, as in technical background introduce
Supercomposed coding is the same.Here we pay close attention to two kinds of situations of foregoing description：The first：Second bit information is " 10 ", the
One bit information is " 1011 "；Second：Second bit information is " 00 ", and the first bit information is " 1011 ".
Figure 11 (a)～(c) represents the first situation superposition schematic diagram, and Figure 11 (a) is second group of bit in the first situation
Constellation point, Figure 11 (b) be in the first situation the 3rd group of bit map into constellation point, wherein the 3rd group of bit 0011 be by
First group of bit 1011 changes what is obtained, and Figure 11 (c) is the constellation point in the first situation after superposition.Figure 12 (a)～(c)
Second situation superposition schematic diagram is represented, Figure 12 (a) is the constellation point of second group of bit in second situation, and Figure 12 (b) is
In second situation the 3rd group of bit map into constellation point, wherein the 3rd group of bit 1011 is changed by first group of bit 1011
Arrive, Figure 12 (c) is the constellation point in second situation after superposition.
It is to take two kinds of concrete condition examples at random to be illustrated where indicating in figure, the first：The QPSK symbols " 1011 " at " 10 " place
The 16QAM symbols superposition at place, obtains the symbol at " 101011 " place.Second：The QPSK symbols at " 00 " place and " 1011 "
The 16QAM symbol optimization stacks at place, obtain the symbol at " 001011 " place.The superposition symbol that both of these case is obtained is put into one
It is as shown in figure 13 the superposition symbol constellation of two symbols from the point of view of in individual planisphere.
It is readily seen that and speculating that the mapped constellation for being possible to be superimposed symbol has gray mappings attribute from Figure 13.
Finally superposition symbol is formed into transmission signal and be sent to two receiver users.
It should be noted that by the simple unique design treatment of the embodiment of the present invention, even if in receiver because noise is judged by accident
QPSK symbols, nor affect on the correct demodulation to 16QAM symbols.So the robustness that receiver is symbol level SIC is enhanced,
Strengthen access performance under the conditions of more low complex degree receiver.
Implement example three
Table 1 represents that m, n take combined situation during different value, can be with 2nRank modulation system uses 2 modulating second group of bitm
Rank modulation system is modulating the 3rd group of bit.
When n or m is 1, modulated with QPSK, when n or m is 2, modulated with 16QAM, when n or m is 3, use 64QAM
Modulation.
The 3rd group of bit under the different situations of table 1 is calculated
Power factor scope under the different situations of table 2
Through the above description of the embodiments, those skilled in the art can be understood that the side according to above-described embodiment
Method can add the mode of required general hardware platform to realize by software, naturally it is also possible to by hardware, but in many cases before
Person is more preferably embodiment.Based on such understanding, technical scheme substantially to prior art makes tribute in other words
The part offered can be embodied in the form of software product, and the computer software product is stored in a storage medium (such as
ROM/RAM, magnetic disc, CD) in, including some instructions use so that a station terminal equipment (can be mobile phone, computer,
Server, or the network equipment etc.) perform method described in each embodiment of the invention.
Through the above description of the embodiments, those skilled in the art can be understood that the side according to above-described embodiment
Method can add the mode of required general hardware platform to realize by software, naturally it is also possible to by hardware, but in many cases before
Person is more preferably embodiment.Based on such understanding, technical scheme substantially to prior art makes tribute in other words
The part offered can be embodied in the form of software product, and the computer software product is stored in a storage medium (such as
ROM/RAM, magnetic disc, CD) in, including some instructions use so that a station terminal equipment (can be mobile phone, computer,
Server, or the network equipment etc.) perform method described in each embodiment of the invention.
Embodiments of the invention additionally provide a kind of storage medium.Alternatively, in the present embodiment, above-mentioned storage medium can be by
It is set to store the program code for performing following steps：
Step S1, emitter by first group of bit a (0) a (1) ... a (2m-1) to be sent, and second group of bit b (0) b (1) ... b (2n-1),
Carry out bit arithmetic and obtain the 3rd group of bit c (0) c (1) ... c (2m-1), wherein, m, n are positive integer；
Wherein, the bit arithmetic includes：
Specific bit in specific bit in second group of bit and first group of bit is done into XOR and obtains described
Three groups of bits；
Or, first by the partial bit in second group of bit do with or computing obtain with or operation result, then will it is described together or
Specific bit in operation result and first group of bit does XOR and obtains the 3rd group of bit；
Or, the 3rd group of bit is made up of two parts：Part I is by by the specific bit in second group of bit and institute
State the specific bit in first group of bit and do XOR and obtain；Beyond specific bit of the Part II by first group of bit
Bit keeps constant obtaining；
Or, the 3rd group of bit is made up of two parts：Part I is by first doing the partial bit in second group of bit
Same or computing obtains same or operation result, then the same or operation result is done into different with the specific bit in first group of bit
Or computing is obtained；Part II keeps constant obtaining by the bit beyond the specific bit of first group of bit；
Second group of bit is done 2 by step S2, the emitternThe process of rank modulation system obtains the second complex symbol, will be described
3rd group of bit does 2mThe process of rank modulation system obtains the 3rd complex symbol；
Step S3, the emitter is by the square root of the second complex symbol power factorWeighting obtains second for weighting
Complex symbol, the 3rd complex symbol is usedWeighting obtains the 3rd complex symbol for weighting；
Second complex symbol of the weighting is added and obtains superposition symbol by step S4, the emitter with the 3rd complex symbol of weighting
Number；
The superposition symbol is formed transmission signal and is launched by step S5, the emitter.
Alternatively, in the present embodiment, above-mentioned storage medium can be including but not limited to：USB flash disk, read-only storage (ROM,
Read-Only Memory), random access memory (RAM, Random Access Memory), portable hard drive, magnetic disc or
Person's CD etc. is various can be with the medium of store program codes.
Alternatively, in the present embodiment, processor performs above-mentioned multi-user's superposition according to the program code stored in storage medium
Transmission method.
Alternatively, the specific example in the present embodiment may be referred to the example described in above-described embodiment and optional embodiment,
The present embodiment will not be described here.
Obviously, those skilled in the art should be understood that above-mentioned each module of the invention or each step can be with general calculating
Realizing, they can be concentrated on single computing device device, or be distributed on the network that multiple computing devices are constituted,
Alternatively, they can be realized with the executable program code of computing device, it is thus possible to be stored in storage device
In performed by computing device, and in some cases, can be performing shown or described step different from order herein
Suddenly, each integrated circuit modules or by them is fabricated to respectively, or the multiple modules or step in them is fabricated to single
Integrated circuit modules are realizing.So, the present invention is not restricted to any specific hardware and software combination.
The preferred embodiments of the present invention are the foregoing is only, the present invention is not limited to, for those skilled in the art
For, the present invention can have various modifications and variations.All any modifications within the spirit and principles in the present invention, made, etc.
With replacement, improvement etc., should be included within the scope of the present invention.
Claims (14)
1. a kind of multi-user's superposed transmission method, it is characterised in that include：
Emitter by first group of bit a (0) a (1) ... a (2m-1) to be sent, and second group of bit b (0) b (1) ... b (2n-1),
Carry out bit arithmetic and obtain the 3rd group of bit c (0) c (1) ... c (2m-1), wherein, m, n are positive integer；
Second group of bit is done 2 by the emitternThe process of rank modulation system obtains the second complex symbol, by the described 3rd
Group bit does 2mThe process of rank modulation system obtains the 3rd complex symbol；
The emitter is by the square root of the second complex symbol power factorWeight obtain weighting second plural
Symbol, the 3rd complex symbol is usedWeighting obtains the 3rd complex symbol for weighting；
Second complex symbol of the weighting is added and obtains being superimposed symbol by the emitter with the 3rd complex symbol of weighting；
The superposition symbol is formed transmission signal and is launched by the emitter；
Wherein, the bit arithmetic includes：
Specific bit in specific bit in second group of bit and first group of bit is done into XOR and obtains institute
State the 3rd group of bit；
Or,
First by the partial bit in second group of bit do with or computing obtain with or operation result, then will it is described together or
Specific bit in operation result and first group of bit does XOR and obtains the 3rd group of bit；
Or,
The 3rd group of bit is made up of two parts：Part I is by by the specific bit in second group of bit and institute
State the specific bit in first group of bit and do XOR and obtain；Part II by the specific bit of first group of bit with
Outer bit keeps constant obtaining；
Or,
The 3rd group of bit is made up of two parts：Part I is by first doing the partial bit in second group of bit
With or computing obtain with or operation result, then by it is described with or operation result and first group of bit in specific bit
Do XOR to obtain；Part II keeps constant obtaining by the bit beyond the specific bit of first group of bit；
Wherein, the specific bit in first group of bit determines the place of the corresponding mapped constellation points of first group of bit
Quadrant.
2. method according to claim 1, it is characterised in that ⊕ represents XOR, ⊙ represent with or computing, then
Work as m=1, during n=1, the bit arithmetic is expressed as：
C (0)=a (0) ⊕ b (0),
C (1)=a (1) ⊕ b (1)；
Work as m=1, n>When 1, the bit arithmetic 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))；
Work as m>When 1, n=1, the bit arithmetic 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)；
Work as m>1, n>When 1, the bit arithmetic 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).
3. method according to claim 1, it is characterised in that
As m=1, the 1st bit c (0) and the 2nd bit c (1) of the 3rd group of bit is by the bit arithmetic
Obtain,
Work as m>When 1, the 1st bit c (0) and the 2nd bit c (1) of the 3rd group of bit are obtained by the bit arithmetic,
Other bits c (2) c (3) ... c (2m-1) are by a (2) a (3) ..., and a (2m-1) keeps constant obtains.
4. method according to claim 1, it is characterised in that
As n=1, the bit arithmetic does not include the same or computing between second group of bit；
Work as n>When 1, the bit arithmetic includes that the bit of all odd bits in second group of bit does same or computing,
The bit of all even bits in second group of bit does same or computing.
5. method according to claim 2, it is characterised in that
Specific bit a (0) a (1) in first group of bit determines the place of the corresponding mapped constellation points of first group of bit
Quadrant.
6. method according to claim 1, it is characterised in that
Described 2nRank modulation system includes at least one of：QPSK QPSK, quadrature amplitude modulation 16QAM,
Quadrature amplitude modulation 64QAM；
Described 2mRank modulation system includes at least one of：QPSK QPSK, quadrature amplitude modulation 16QAM,
Quadrature amplitude modulation 64QAM.
7. method according to claim 1, it is characterised in that the mapped constellation of the superposition symbol has gray mappings attribute.
8. a kind of multi-user's superposed transmission device, in being arranged at emitter, it is characterised in that include：
Computing module, for by first group of bit a (0) a (1) ... a (2m-1) to be sent, with second group of bit
B (0) b (1) ... b (2n-1), carries out bit arithmetic and obtains the 3rd group of bit c (0) c (1) ... c (2m-1)；Wherein, m, n are just whole
Number；
Modulation module, for second group of bit to be done into 2nThe process of rank modulation system obtains the second complex symbol, will be described
3rd group of bit does 2mThe process of rank modulation system obtains the 3rd complex symbol；
Laminating module, obtains being superimposed symbol for the second complex symbol of weighting to be added with the 3rd complex symbol of weighting,
The square root of the second complex symbol power factor of the weightingWeighting is obtained, and the 3rd complex symbol of the weighting is usedWeighting is obtained；
Transmitter module, launches for the superposition symbol to be formed into transmission signal；
Wherein, the bit arithmetic includes：
Specific bit in specific bit in second group of bit and first group of bit is done into XOR and obtains institute
State the 3rd group of bit；
Or,
First by the partial bit in second group of bit do with or computing obtain with or operation result, then will it is described together or
Specific bit in operation result and first group of bit does XOR and obtains the 3rd group of bit；
Or,
The 3rd group of bit is made up of two parts：Part I is by by the specific bit in second group of bit and institute
State the specific bit in first group of bit and do XOR and obtain；Part II by the specific bit of first group of bit with
Outer bit keeps constant obtaining；
Or,
The 3rd group of bit is made up of two parts：Part I is by first doing the partial bit in second group of bit
With or computing obtain with or operation result, then by it is described with or operation result and first group of bit in specific bit
Do XOR to obtain；Part II keeps constant obtaining by the bit beyond the specific bit of first group of bit；
Wherein, the specific bit in first group of bit determines the place of the corresponding mapped constellation points of first group of bit
Quadrant.
9. device according to claim 8, it is characterised in that ⊕ represents XOR, ⊙ represent with or computing, then
Work as m=1, during n=1, the bit arithmetic is expressed as：
C (0)=a (0) ⊕ b (0),
C (1)=a (1) ⊕ b (1)；
Work as m=1, n>When 1, the bit arithmetic 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))；
Work as m>When 1, n=1, the bit arithmetic 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)；
Work as m>1, n>When 1, the bit arithmetic 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).
10. device according to claim 8, it is characterised in that
As m=1, the 1st bit c (0) and the 2nd bit c (1) of the 3rd group of bit is by the bit arithmetic
Obtain,
Work as m>When 1, the 1st bit c (0) and the 2nd bit c (1) of the 3rd group of bit are obtained by the bit arithmetic,
Other bits c (2) c (3) ... c (2m-1) are by a (2) a (3) ..., and a (2m-1) keeps constant obtains.
11. devices according to claim 8, it is characterised in that
As n=1, the bit arithmetic does not include the same or computing between second group of bit；
Work as n>When 1, the bit arithmetic includes that the bit of all odd bits in second group of bit does same or computing,
The bit of all even bits in second group of bit does same or computing.
12. devices according to claim 9, it is characterised in that
Specific bit a (0) a (1) in first group of bit determines the place of the corresponding mapped constellation points of first group of bit
Quadrant.
13. devices according to claim 8, it is characterised in that
Described 2nRank modulation system includes at least one of：QPSK QPSK, quadrature amplitude modulation 16QAM,
Quadrature amplitude modulation 64QAM；
Described 2mRank modulation system includes at least one of：QPSK QPSK, quadrature amplitude modulation 16QAM,
Quadrature amplitude modulation 64QAM.
14. devices according to claim 8, it is characterised in that the mapped constellation of the superposition symbol has gray mappings attribute.
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 true CN106685583A (en) | 2017-05-17 |
| CN106685583B 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 (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101040540A (en) * | 2004-12-21 | 2007-09-19 | 中兴通讯股份有限公司 | Coding modulation and demodulation system and method for transmitting and receiving signal thereof |
| US20100046644A1 (en) * | 2008-08-19 | 2010-02-25 | Motorola, Inc. | Superposition coding |
| 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 (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100450764B1 (en) * | 2002-10-10 | 2004-10-01 | 한국전자통신연구원 | Apparatus and method for constellation mapping |
| KR20110099003A (en) * | 2008-11-21 | 2011-09-05 | 핀-한 호 | 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 (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101040540A (en) * | 2004-12-21 | 2007-09-19 | 中兴通讯股份有限公司 | Coding modulation and demodulation system and method for transmitting and receiving signal thereof |
| US20100046644A1 (en) * | 2008-08-19 | 2010-02-25 | Motorola, Inc. | Superposition coding |
| 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 |
|---|---|
| CN106685583B (en) | 2020-07-07 |
| WO2017076207A1 (en) | 2017-05-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107846377B (en) | Method and device for transmitting data | |
| CN104429033B (en) | Use the coding and modulating device of non-uniform constellation | |
| KR20190051018A (en) | Non-orthogonal multiple access transmission | |
| CN105634702A (en) | Multi-user information co-channel sending method and device, and multi-user information co-channel receiving method and device | |
| US20110110437A1 (en) | Identification of packet traffic transmitted by various devices operated in multiple overlapped frequency bands in packet-based ofdm systems | |
| US20170359140A1 (en) | Multi-User Code Division Multiple Access Communication Method, and Corresponding Transmitter and Receiver | |
| WO2017016342A1 (en) | Modulation method, demodulation method, and apparatus for multi-user information transmission | |
| KR20170072919A (en) | Multi-user communication method and apparatus of code division multiple access | |
| CN105703877B (en) | superposition coding and decoding method and device, transmitter and receiver | |
| CN105610480A (en) | Method and device for data transmission | |
| CN109039979A (en) | Signal processing method, communication equipment and communication system based on sequence | |
| JP2013090239A (en) | Communication device and communication system | |
| US11218355B2 (en) | Multi-dimensional signal encoding | |
| EP1897311A1 (en) | Precoder matrix for multichannel transmission | |
| JP5052639B2 (en) | Transmitter and receiver | |
| CN106160936A (en) | A kind of multi-user information processing method and device thereof | |
| US20200351019A1 (en) | Methods and computing device for facilitating multiple access in a wireless communication network | |
| CN106685583A (en) | Multiuser superposition transmission method and multiuser superposition transmission device | |
| JP6680949B2 (en) | Method and apparatus for multiple access transmission | |
| CN112534787B (en) | Wireless communication method, wireless communication device and computer readable medium | |
| US9331885B2 (en) | Modulation with fundamental group | |
| CN110831119B (en) | Multi-layer transmission data processing method and entity | |
| WO2020007263A1 (en) | Data processing method, apparatus and device | |
| CN109962751A (en) | A kind of data processing method and device | |
| WO2022055447A1 (en) | A method for embedding an artificial interference signal into the transmitted signal via multiple input multiple output with antenna number modulation and adaptive antenna selection |
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 |