NOMA scheme
10608862 ยท 2020-03-31
Assignee
Inventors
Cpc classification
Y02D30/70
GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
H04L27/3405
ELECTRICITY
International classification
H04L5/12
ELECTRICITY
H04L27/34
ELECTRICITY
Abstract
A method of transmission for increasing communication channel capacity comprising superposing a first signal on a portion of a second signal to form a combined signal, wherein the first signal comprises a repetition coded signal, and transmitting the combined signal. Also disclosed is a method of receiving a combined signal for increasing communication channel capacity comprising performing threshold detection on the combined signal wherein the combined signal comprises a first signal comprising a repetition coded signal superposed on a portion of a second signal and the threshold detection enables derivation of the second signal and the first signal prior to repetition coding.
Claims
1. A method of transmission for increasing communication channel capacity comprising: superposing a first signal on a portion of a second signal to form a combined signal, wherein: the first signal comprises a repetition coded signal; a plurality of subcarriers is used to transmit the second signal; a portion of the plurality of subcarriers is used to transmit the portion of the second signal, the portion of the plurality of subcarriers comprising multiple ones of the plurality of subcarriers; and superposing the first signal on the portion of the second signal comprises spreading the first signal over the portion of the plurality of subcarriers used to transmit the portion of the second signal; and transmitting the combined signal.
2. The method of claim 1 wherein the portion of the second signal comprises a portion of the symbol durations of the second signal.
3. The method of claim 1 wherein the first signal is amplitude scaled prior to superposing.
4. The method of claim 1 wherein the first signal is phase rotated prior to superposing.
5. The method of claim 3 wherein the amplitude scaling preserves the symbol energy and minimum Euclidian distance of the original symbol streams.
6. The method of claim 1 wherein the repetition code length defines the portion of the second signal that the first signal is superposed on.
7. The method of claim 6 wherein the portion comprises a number of symbols of the second signal.
8. The method of claim 1 wherein the second signal and the first signal are manipulated in the frequency domain.
9. The method of claim 1 wherein the second signal and the first signal are manipulated in the time domain.
10. The method of claim 1 wherein only a single symbol of the first signal is superposed on the portion of the second signal.
11. A non-transitory computer readable medium comprising computer readable instructions that when executed by a processor, cause the processor to perform the method according to claim 1.
Description
BRIEF DESCRIPTION OF THE DRAWINGS
(1) Embodiments will now be described, by way of example only, and with reference to the drawings in which:
(2)
(3)
(4)
(5)
(6) In the figures, like elements are indicated by like reference numerals throughout.
DETAILED DESCRIPTION
(7) Overview
(8) In general, NOMA can be considered to be a channel overloading technique. That is to say that the data rate and/or the number of users is increased with respect to standard OFDMA transmission. The following disclosed new technique comprises a new transmission scheme to combine signals for transmission and a new receive scheme to derive the combined signals at a receiver.
(9) Turning to
(10) The second signal may comprise QAM modulation such as 16, 32, 64QAM or higher. The first signal may comprise QPSK modulation.
(11) As would be understood, it can be assumed that the first row of the Hadamard matrix, i.e., the sequence (1, 1, 1, . . . , 1) is used for symbol spreading so that the spreading process comprises repetition coding. That is to say that a repetition coding length x results in an overlap of x subcarriers of the second signal 21. With a spread length of 4, and assuming that QPSK modulation is used for the first signal (MC-CDMA symbol), the data rate on the channel is increased by 0.5 bits per OFDMA subcarrier. This is because a QPSK symbol (20, 22) superposed (combined) with an OFDMA symbols carries 2 bits. Since, in
(12) Amplitude scaling may be used to preserve the symbol energy and the minimum Euclidean distance of the original symbol stream:
(13) Denoting the OFDMA symbols by a.sub.n, 1nN where n is the subcarrier index, the MC-CDMA symbols by b.sub.m with 1mM and the WH (Walsh Hadamard) sequences used for frequency-domain signal spreading by W.sub.m=(w.sub.1,m, w.sub.m,2, . . . , w.sub.m,N) for m=1, 2, . . . , M, the transmitted second signal on carrier n can be written as:
(14)
(15) for n=1, 2, . . . , N. The components of the WH sequences are 1. The division by {square root over (N)} in this equation is to preserve the symbol energy during the spectral spreading process.
(16) As would be understood, WH sequences are rows of the Hadamard matrix given by:
(17)
(18) The matrix H.sub.4 is given by:
(19)
(20) The first WH sequence is the first row of this matrix, which is: W.sub.1=[+1 +1 +1 +1]. Spreading of a symbol with this sequence corresponds to a repetition code of length 4.
(21) The transmission scheme as shown in
(22) As would be understood, exhaustive-search implementation of a Maximum-Likelihood (ML) receiver is very complex to implement in relation to processing power and general resources required. At a corresponding receiver for the above transmission scheme, threshold detection is performed as illustrated in
(23) In the following, 16QAM modulation is assumed for the second (preferably OFDMA) signal 21, and QPSK modulation with amplitude scaling and repetition code length 4, for the first signal 20, 22 that is superposed to the second signal.
(24) Consider a symbol block ak,k=1, 2, . . . (21) taking its values from the 16QAM signal constellation. Each one of these symbols is transmitted at one subcarrier (for k=1, 2, . . . , N, symbol a.sub.k is transmitted on the kth subcarrier).
(25) The set of N subcarriers of the second signal 21 is split into N/4 groups of 4 subcarriers each (e.g. 21A, 21B). Focusing on the first group (portion) 21A, the transmitted symbols (one per subcarrier of portion 21A) are denoted {a.sub.1, a.sub.2, a.sub.3, a.sub.4}. By adding the repetition-coded QPSK symbol (denoted b), the signals transmitted on these four carriers can be written as:
x.sub.1=a.sub.1+b/2
x.sub.2=a.sub.2+b/2
x.sub.3=a.sub.3+b/2
x.sub.4=a.sub.4+b/2
(26) As can be seen, each subcarrier of second signal portion 21A transmits a different (OFDMA) symbol of the second signal 21 but the same (QPSK) symbol of the first signal 20.
(27) As shown in
(28) The crosses (30) represent 16QAM modulation used for second signal (OFDMA) users. The minimum distance is .sub.0=2. The addition of a QPSK symbol (32A, 32B, 32C, 32D) to a 16-QAM symbol leads to a 64QAM constellation formed of all of the circular points of
.sub.2.sup.2=.sub.1.sup.2+.sub.1.sup.2+.sub.1.sup.2+.sub.1.sup.2=4.sub.1.sup.2+.sub.0.sup.2
(29) This shows that the minimum distance is as in the original 16QAM (second) signal constellation. In other words, the repetition code recovers the 6 dB loss due to the superposition of QPSK symbols.
(30) Regarding transmit power, if the power of the 16QAM symbols (second signal) is 10 and the power of the QPSK symbols (first signal) is 2, the power of the x.sub.k symbols is 10.5, and this means that the cost of adding 0.5 bits to each 16QAM symbol is only:
10.Math.log.sub.10(10.5/10)=0.2 dB.
(31) Taking an ideal maximum-likelihood receiver, the received combined signal on subcarrier k is r.sub.k=x.sub.k+n.sub.k, where n.sub.k represents additive white Gaussian noise (AWGN). The received signal block (r.sub.1, r.sub.2, r.sub.3, r.sub.4) is used to jointly detect the block of 5 symbols (a.sub.1, a.sub.2, a.sub.3, a.sub.4, b), which represents (a4k3,a4k2,a4k1,a4k,bk), where k is the index of the transmitted symbols. The ML receiver minimizes the following metric:
Min{|r.sub.1a.sub.1b/2|.sup.2+|r.sub.2a.sub.2b/2|.sup.2+|r.sub.3a.sub.3b/2|.sup.2+|r.sub.4a.sub.4b/2|.sup.2}
(32) where the minimization is performed over all possible values of the symbol block (a.sub.1, a.sub.2, a.sub.3, a.sub.4, b) i.e. (a4k3,a4k2,a4k1,a4k,bk). Exhaustive search involves the computation of 4(M).sup.4 metrics and their comparisons, where M is the number of points of the QAM signal constellation (M=16 for 16QAM). As can be seen, the sum of four squares has to be calculated. This is too complex. The following simplified receiver is proposed which uses threshold detection scheme.
(33) The simplified receiver comprises a plurality of steps, the number of steps corresponding to the repetition code length of a first signal superposed on a portion of a second signal, the first and second signals being used in the creation of a received combined signal. Each step of the simplified receiver scheme comprises threshold detection of the (16QAM) symbol block of the portion of the second signal that is superposed by the symbol of the (QPSK) first signal (4 subcarriers as we have a repetition code length 4 in the first signal, denoted by (a.sub.1, a.sub.2, a.sub.3, a.sub.4) in the below) conditional on the 4 values of the (QPSK) symbol of the first signal (denoted by b in the below).
(34) Taking the example of a 16QAM second signal and a QPSK first signal comprising repetition code length 4 (the first signal is superposed onto a 4 subcarrier symbol block of the second signal):
(35) The solid lines (34) denote the thresholds (2.0, 0.0, +2.0) for a 16QAM constellation as would be understood.
(36) In
(37) In each step there are 4 different decisions made to determine the 4 subcarriers (symbols) of the first signal and the symbol of the second signal. The steps are labelled 1, 2, 3, 4. However, the steps may be performed in any order.
(38) Step 1:
(39) In this step, threshold detection conditional on b=1+j (32A) takes place. Received symbol block (r.sub.1, r.sub.2, r.sub.3, r.sub.4) is sent to a threshold detector. The thresholds for the 16QAM second signal are shifted upwards by 0.5 in both the horizontal and vertical directions (real and imaginary) due to the 0.5 amplitude scaling of the first (QPSK) signal.
(40) The thresholds for the second signal for this step become (1.5, +0.5, +2.5) as shown by 35 and 37 on
(41) Step 2:
(42) In this step, threshold detection conditional on b=1j (32B) takes place. Received symbol block (r.sub.1, r.sub.2, r.sub.3, r.sub.4) is sent to a threshold detector. The thresholds for the 16QAM second signal are shifted upwards by 0.5 in the horizontal (real) direction and downwards by 0.5 in the vertical (imaginary) direction due to the 0.5 amplitude scaling of the first (QPSK) signal.
(43) The thresholds for the real parts (horizontal direction) of the second signal for this step become (1.5, +0.5, +2.5) as shown by 37 on
(44) Step 3:
(45) In this step, threshold detection conditional on b=1j (32C) takes place. Received symbol block (r.sub.1, r.sub.2, r.sub.3, r.sub.4) is sent to a threshold detector. The thresholds for the 16QAM second signal are shifted downwards by 0.5 in both the horizontal and vertical (real and imaginary) directions due to the 0.5 amplitude scaling of the second (QPSK) signal.
(46) The thresholds for the second signal for this step become (2.5, 0.5, +1.5) as shown by 36 and 38 on
(47) Step 4:
(48) In this step, threshold detection conditional on b=1+j (32D) takes place. Received symbol block (r.sub.1, r.sub.2, r.sub.3, r.sub.4) is sent to a threshold detector. The thresholds for the 16QAM second signal are shifted downwards by 0.5 in the horizontal (real) direction and upwards by 0.5 in the vertical (imaginary) direction due to the 0.5 amplitude scaling of the first (QPSK) signal.
(49) The thresholds for the real parts of the second signal for this step become
(50) (2.5, 0.5, +1.5) as shown by 38 on
(51) Additionally, in each step above, an error signal is computed which is the difference between the threshold detector input and output corresponding to each of the decisions made in each step. Accordingly, an error signal block is derived (e.sub.1.sup.i, e.sub.2.sup.i, e.sub.3.sup.i, e.sub.4.sup.i) where i is the step index and e.sub.k.sup.i=r.sub.k.sub.k.sup.ib.sub.i where b.sub.i represents the QPSK symbol value corresponding to that step.
(52) Subsequent to each step being completed, and the corresponding error signal block being derived, the decision on the transmitted block is made by evaluating the metric {|e.sub.1.sup.i|.sup.2+|e.sub.2.sup.i|.sup.2+|e.sub.3.sup.i|.sup.2+|e.sub.4.sup.i|.sup.2} for i=1, 2, 3, 4 and selecting the i index, which minimizes this metric. When we know the i index, we have the first signal values, and the value of b as provided by the step in question.
(53) In alternative embodiments, with a repetition code of length 8, the number of 16QAM symbols per block would be 8, say (a.sub.1, a.sub.2, a.sub.3, a.sub.4,a.sub.5, a.sub.6, a.sub.7, a.sub.8) and the metric evaluated will be of the form {|e.sub.1.sup.i|.sup.2+|e.sub.2.sup.i|.sup.2+|e.sub.3.sup.i|.sup.2+|e.sub.4.sup.i|.sup.2+|e.sub.5.sup.i|.sup.2+|e.sub.6.sup.i|.sup.2+|e.sub.7.sup.i|.sup.2+|e.sub.8.sup.i|.sup.2}, where i=1, 2, 3, 4 is the step index in the detector as discussed above. If the repetition coded symbol is not a QPSK symbol, but let us say a 16QAM symbol, the i index would take 16 values instead of 4.
(54) Alternatively, or additionally to amplitude scaling, a rotation (phase) function may be applied to the second signal. This is another way of ensuring that the minimum Euclidian distance is retained. As would be understood, there is no energy change when phase rotation occurs.
(55) Turning to
(56)
(57) This property is particularly important when the NOMA scheme is used for the uplink. It is well known that single-carrier signals have a smaller peak-to-average power ratio (PAPR) than multi-carrier signals, and the transmit power amplifier in the user device can be used more efficiently in this case.
(58) An advantage of time domain spreading is that single carrier is affected less by relevant power amplifier non-linearities as would be understood.
(59) In the time domain, instead of spreading over, for example, 4 or 8 subcarriers of the second signal in the frequency domain, spreading is done over, for example, 4 or 8 symbol durations of the second signal in the time domain. In this instance, the above equations:
x.sub.1=a.sub.1+b/2
x.sub.2=a.sub.2+b/2
x.sub.3=a.sub.3+b/2
x.sub.4=a.sub.4+b/2
(60) represent the signals transmitted at 4 consecutive symbol periods on a given subcarrier of the second signal instead of signals transmitted on 4 different subcarriers at a given symbol period of the second signal. The rest of the new technique operates in the same manner as above as described in relation to the frequency domain.
(61) As has been shown, only one symbol (MC-CDMA) of the first signal need be superposed to a portion of the symbols (OFDMA) of the second signal. This allows a simplified receiver to achieve maximum likelihood performance using threshold detection with a relatively small number of computations and comparisons. This further provides reduced sensitivity to frequency selective fading.
(62) Conversely, the previous scheme of superposing a plurality of MC-CDMA signals that are spread over the entire band onto OFDMA signals such that each MC-CDMA signal interferes with all OFDMA signals. This results in sensitivity to frequency selective fading. This also requires a relatively large number of MC-CDMA symbols to be superposed to achieve a significant channel overload performance (capacity increase). Further, with such a scheme, the use of a maximum-likelihood receiver is very resource heavy which results in iterative cancellation receivers being used instead. These receivers are suboptimum because iterative receivers based on interference cancellations will always leave some interference even after all iterations are complete.
(63) The various methods described above may be implemented by a computer program product. The computer program product may include computer code arranged to instruct a computer or processor to perform the functions of one or more of the various methods described above. The computer program and/or the code for performing such methods may be provided to an apparatus, such as a computer or a processor, on a computer readable medium or computer program product. The computer readable medium may be transitory or non-transitory. The computer readable medium could be, for example, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, or a propagation medium for data transmission, for example for downloading the code over the Internet. Alternatively, the computer readable medium could take the form of a physical computer readable medium such as semiconductor or solid state memory, magnetic tape, a removable computer diskette, a random access memory (RAM), a read-only memory (ROM), a rigid magnetic disc, and an optical disk, such as a CD-ROM, CD-R/W or DVD.
(64) An apparatus such as a computer or processor may be configured in accordance with such code to perform one or more processes in accordance with the various methods discussed herein. Such an apparatus may take the form of a data processing system. Such a data processing system may be a distributed system. For example, such a data processing system may be distributed across a network.