<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article">
 <front>
  <journal-meta>
   <journal-id journal-id-type="publisher-id">
    jcc
   </journal-id>
   <journal-title-group>
    <journal-title>
     Journal of Computer and Communications
    </journal-title>
   </journal-title-group>
   <issn pub-type="epub">
    2327-5219
   </issn>
   <issn publication-format="print">
    2327-5227
   </issn>
   <publisher>
    <publisher-name>
     Scientific Research Publishing
    </publisher-name>
   </publisher>
  </journal-meta>
  <article-meta>
   <article-id pub-id-type="doi">
    10.4236/jcc.2024.127002
   </article-id>
   <article-id pub-id-type="publisher-id">
    jcc-134650
   </article-id>
   <article-categories>
    <subj-group subj-group-type="heading">
     <subject>
      Articles
     </subject>
    </subj-group>
    <subj-group subj-group-type="Discipline-v2">
     <subject>
      Computer Science 
     </subject>
     <subject>
       Communications
     </subject>
    </subj-group>
   </article-categories>
   <title-group>
    Cluster Modulation: A Generalized Modulation Scheme Leading to NOMA or Adaptive Modulation
   </title-group>
   <contrib-group>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Jamal S.
      </surname>
      <given-names>
       Rahhal
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff1"> 
      <sup>1</sup>
     </xref>
    </contrib>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Suliman J.
      </surname>
      <given-names>
       Rahhal
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff2"> 
      <sup>2</sup>
     </xref>
    </contrib>
   </contrib-group> 
   <aff id="aff1">
    <addr-line>
     aElectrical Engineering Department, The University of Jordan, Amman, Jordan
    </addr-line> 
   </aff> 
   <aff id="aff2">
    <addr-line>
     aInvenco Co., Tampa, USA
    </addr-line> 
   </aff> 
   <pub-date pub-type="epub">
    <day>
     17
    </day> 
    <month>
     07
    </month>
    <year>
     2024
    </year>
   </pub-date> 
   <volume>
    12
   </volume> 
   <issue>
    07
   </issue>
   <fpage>
    12
   </fpage>
   <lpage>
    22
   </lpage>
   <history>
    <date date-type="received">
     <day>
      7,
     </day>
     <month>
      June
     </month>
     <year>
      2024
     </year>
    </date>
    <date date-type="published">
     <day>
      16,
     </day>
     <month>
      June
     </month>
     <year>
      2024
     </year> 
    </date> 
    <date date-type="accepted">
     <day>
      16,
     </day>
     <month>
      July
     </month>
     <year>
      2024
     </year> 
    </date>
   </history>
   <permissions>
    <copyright-statement>
     © Copyright 2014 by authors and Scientific Research Publishing Inc. 
    </copyright-statement>
    <copyright-year>
     2014
    </copyright-year>
    <license>
     <license-p>
      This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/
     </license-p>
    </license>
   </permissions>
   <abstract>
    The need for higher data rate and higher systems capacity leads to several solutions including higher constellation size, spatial multiplexing, adaptive modulation and Non-Orthogonal Multiple Access (NOMA). Adaptive Modulation makes use of the user’s location from his base station, such that, closer users get bigger constellation size and hence higher data rate. A similar idea of adaptive modulation that makes use of the user’s locations is the NOMA technique. Here the base station transmits composite signals each for a different user at a different distance from the base station. The transmitted signal is formed by summing different user’s constellations with different weights. The closer the users the less average power constellation is used. This will allow the closer user to the base station to distinguish his constellation and others constellation. The far user will only distinguish his constellation and other user’s data will appear as a small interference added to his signal. In this paper, it is shown that the Adaptive modulation and the NOMA are special cases of the more general Cluster Modulation technique. Therefore, a general frame can be set to design both modulation schemes and better understanding is achieved. This leads to designing a multi-level NOMA and/or flexible adaptive modulation with combined channel coding.
   </abstract>
   <kwd-group> 
    <kwd>
     Cluster Modulation
    </kwd> 
    <kwd>
      Adaptive Modulation
    </kwd> 
    <kwd>
      NOMA
    </kwd>
   </kwd-group>
  </article-meta>
 </front>
 <body>
  <sec id="s1">
   <title>1. Introduction</title>
   <p>Current and future systems become more bandwidth demanding, since the most popular applications are multimedia communications. As well as the introduction of massive Wireless Sensor Networks arises the challenge for the communication systems capacity increase. This leads to the use of very sophisticated signal processing techniques that require good processing cores to be employed in the communications devices.</p>
   <p>The need for more transmission data rate or higher systems capacity led to several solutions including higher constellation size, spatial multiplexing, adaptive modulation and Non-Orthogonal Multiple Access (NOMA). Increasing the constellation size requires more power to compensate for the loss in SNR that maintains acceptable BER. Error control coding might be utilized to enhance the BER on the expenses of higher Band Width (BW). Spatial multiplexing implements orthogonal channels in space that can be used to transmit different user’s data at each beam using an antenna array. Space Time Codes might be implemented to form spatially multiplexed channels. This will increase the system’s capacity by reusing the same bandwidth many times in the same cell. Adaptive Modulation makes use of the user’s location from his base station, such that, closer users get bigger constellation size and hence higher data rate. A similar idea of adaptive modulation that makes use of the user’s locations is the NOMA technique. Here the base station transmits composite signals each for a different user at a different distance from the base station. The transmitted signal is formed by summing different user’s constellations with different weights. The closer the users the less average power constellation is used. This will allow the closer user to the base station to distinguish his constellation and others constellation. The far user will only distinguish his constellation and other user’s data will appear as a small interference added to his signal. With NOMA, multiple users share the same radio resources, either in time, frequency or code. It is well-known that non-orthogonal user multiplexing using superposition at the transmitter and Successive Interference Cancellation (SIC) at the receiver outperforms orthogonal multiplexing and it is optimal in the sense of achieving the capacity region <xref ref-type="bibr" rid="scirp.134650-1">
     [1]
    </xref> <xref ref-type="bibr" rid="scirp.134650-2">
     [2]
    </xref>. NOMA captures researcher’s attention as a novel and promising multiple-access scheme for future generations of cellular systems as well as for Wireless Sensor Networks (WSN) <xref ref-type="bibr" rid="scirp.134650-3">
     [3]
    </xref>-<xref ref-type="bibr" rid="scirp.134650-9">
     [9]
    </xref>. <xref ref-type="fig" rid="fig1">
     Figure 1
    </xref> shows the concept of NOMA for two users, one U1 is close to base station and the second U2 is far from base station.</p>
   <fig id="fig1" position="float">
    <label>Figure 1</label>
    <caption>
     <title>Figure 1. Two users NOMA system showing their constellations.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1732773-rId12.jpeg?20240719032232" />
   </fig>
   <p>As shown in <xref ref-type="fig" rid="fig1">
     Figure 1
    </xref>, the first user can detect both his data and the second user’s data. The second user sees the first user’s data as interference and is still capable of detecting his own data.</p>
   <p>In 1996 a Ph.D. thesis introduced the concept of what was called Cluster Modulation (CM). In CM many levels of constellation are superimposed to form the total transmitted signal from the base station. Higher levels may be used for transmitting side information data to the basic level. The extended levels can also be used to increase the data rate for the same user or use different user data. When CM is used to increase the data rate, it becomes similar to the Adaptive Modulation scheme and when used to transmit different user’s data it becomes similar to the NOMA technique <xref ref-type="bibr" rid="scirp.134650-10">
     [10]
    </xref>-<xref ref-type="bibr" rid="scirp.134650-13">
     [13]
    </xref>. The block diagram of the CM transmitter is shown in <xref ref-type="fig" rid="fig2">
     Figure 2
    </xref>. Here the transmitted signal for L levels QAM constellation can be written as:</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         Φ 
       </mi> 
       <mi>
         t 
       </mi> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         t 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <mstyle displaystyle="true"> 
       <msubsup> 
        <mo>
          ∑ 
        </mo> 
        <mrow> 
         <mi>
           l 
         </mi> 
         <mo>
           = 
         </mo> 
         <mn>
           0 
         </mn> 
        </mrow> 
        <mrow> 
         <mi>
           L 
         </mi> 
         <mo>
           − 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
       </msubsup> 
       <mrow> 
        <msub> 
         <mi>
           α 
         </mi> 
         <mi>
           l 
         </mi> 
        </msub> 
        <msub> 
         <mi>
           s 
         </mi> 
         <mi>
           l 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           t 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </mstyle> 
     </mrow> 
    </math> (1)</p>
   <p>where 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         α 
       </mi> 
       <mi>
         l 
       </mi> 
      </msub> 
     </mrow> 
    </math> is the lth level weight and 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         s 
       </mi> 
       <mi>
         l 
       </mi> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         t 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> is the complex lth user signal that represents a constellation point. And for PSK constellation:</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         Φ 
       </mi> 
       <mi>
         t 
       </mi> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         t 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <mstyle displaystyle="true"> 
       <msubsup> 
        <mo>
          ∑ 
        </mo> 
        <mrow> 
         <mi>
           l 
         </mi> 
         <mo>
           = 
         </mo> 
         <mn>
           0 
         </mn> 
        </mrow> 
        <mrow> 
         <mi>
           L 
         </mi> 
         <mo>
           − 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
       </msubsup> 
       <mrow> 
        <msub> 
         <mi>
           α 
         </mi> 
         <mi>
           l 
         </mi> 
        </msub> 
        <msub> 
         <mi>
           s 
         </mi> 
         <mi>
           l 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           t 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </mstyle> 
     </mrow> 
    </math> (2)</p>
   <p>where p(t) is the waveform shaping function.</p>
   <fig id="fig2" position="float">
    <label>Figure 2</label>
    <caption>
     <title>Figure 2. CM transmitter block diagram with example of 4-QAM constellation.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1732773-rId20.jpeg?20240719032232" />
   </fig>
   <p>The resulting constellation of 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         Φ 
       </mi> 
       <mi>
         t 
       </mi> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         t 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> will be a superposition of all levels. An example of L = 3 4 QAM signals is shown in <xref ref-type="fig" rid="fig3">
     Figure 3
    </xref>. Generally, the signals 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         s 
       </mi> 
       <mi>
         l 
       </mi> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         t 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>’s can have arbitrary different constellations.</p>
   <fig id="fig3" position="float">
    <label>Figure 3</label>
    <caption>
     <title>Figure 3. Three levels CM Constellation QAM.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1732773-rId25.jpeg?20240719032232" />
   </fig>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         s 
       </mi> 
       <mi>
         l 
       </mi> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         t 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> can be different users signal or same user data. L is the number of levels used that can be fixed or variable. The weight factors 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         α 
       </mi> 
       <mi>
         l 
       </mi> 
      </msub> 
     </mrow> 
    </math>’s usually have the following constraint:</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         α 
       </mi> 
       <mn>
         0 
       </mn> 
      </msub> 
      <mo>
        &lt; 
      </mo> 
      <msub> 
       <mi>
         α 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mo>
        &lt; 
      </mo> 
      <mo>
        ⋯ 
      </mo> 
      <mo>
        &lt; 
      </mo> 
      <msub> 
       <mi>
         α 
       </mi> 
       <mrow> 
        <mi>
          L 
        </mi> 
        <mo>
          − 
        </mo> 
        <mn>
          1 
        </mn> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> (3)</p>
   <p>In case of PSK modulation for each level, the weight factors 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         α 
       </mi> 
       <mi>
         l 
       </mi> 
      </msub> 
     </mrow> 
    </math>’s will scale the transmitted signal phases at each level. Then the constellation will be as in <xref ref-type="fig" rid="fig4">
     Figure 4
    </xref>.</p>
   <fig id="fig4" position="float">
    <label>Figure 4</label>
    <caption>
     <title>Figure 4. Three levels CM constellation PSK.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1732773-rId33.jpeg?20240719032232" />
   </fig>
   <p>The CM receiver is a sequential receiver that detects the signals from the low level up to the highest level, as shown in <xref ref-type="fig" rid="fig5">
     Figure 5
    </xref>.</p>
   <fig id="fig5" position="float">
    <label>Figure 5</label>
    <caption>
     <title>Figure 5. CM receiver block diagram.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1732773-rId34.jpeg?20240719032232" />
   </fig>
   <p>The Extractor function is to detect the signal 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         s 
       </mi> 
       <mi>
         l 
       </mi> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         t 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> using its own constellation in descending order ( 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        l 
      </mi> 
      <mo>
        = 
      </mo> 
      <mi>
        L 
      </mi> 
      <mo>
        − 
      </mo> 
      <mn>
        1 
      </mn> 
      <mo>
        , 
      </mo> 
      <mi>
        L 
      </mi> 
      <mo>
        − 
      </mo> 
      <mn>
        2 
      </mn> 
      <mo>
        , 
      </mo> 
      <mo>
        ⋯ 
      </mo> 
      <mo>
        , 
      </mo> 
      <mn>
        0 
      </mn> 
     </mrow> 
    </math>). This is done by mapping all the decision regions of the lower level into one constellation of the next level until reaching the highest level and detecting the data backward. In this paper we formulate the relation between the CM and Adaptive modulation and then between the CM and NOMA.</p>
  </sec><sec id="s2">
   <title>2. CM Leading to Adaptive Modulation</title>
   <p>Adaptive Modulation is used to provide different data rates to users as their distance from the base station. Users will get constellation size depending on their distance from base station, such that, the distance is divided into zones. Each zone will use power of 2 size reduction from the previous zone <xref ref-type="bibr" rid="scirp.134650-14">
     [14]
    </xref>-<xref ref-type="bibr" rid="scirp.134650-20">
     [20]
    </xref>. If we consider the four zones system, then the closest zone will have 64-ary constellation, the next zone will have 16-ary constellation then 4-ary and the farthest one will have binary constellation as shown in <xref ref-type="fig" rid="fig6">
     Figure 6
    </xref>. This will result in higher data rates for the closer zones.</p>
   <fig id="fig6" position="float">
    <label>Figure 6</label>
    <caption>
     <title>Figure 6. Four zones adaptive modulation scheme.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1732773-rId39.jpeg?20240719032233" />
   </fig>
   <p>For L level CM, users at distance 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         r 
       </mi> 
       <mi>
         l 
       </mi> 
      </msub> 
     </mrow> 
    </math> from base station ( 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         r 
       </mi> 
       <mn>
         0 
       </mn> 
      </msub> 
     </mrow> 
    </math> is the closest). The transmitted signal to zone 0 will use all the L levels for the same user. The next zone will use L-1 levels CM and so on. In each zone we use a complete CM constellation for the same user and if we set the following constraint, we will get exact constellation for both the CM and the Adaptive Modulation scheme.</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         α 
       </mi> 
       <mi>
         l 
       </mi> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mfrac> 
       <mrow> 
        <msub> 
         <mi>
           α 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mo>
            + 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
        </msub> 
       </mrow> 
       <mn>
         2 
       </mn> 
      </mfrac> 
      <mo>
        , 
      </mo> 
      <mi>
        l 
      </mi> 
      <mo>
        = 
      </mo> 
      <mn>
        0 
      </mn> 
      <mo>
        , 
      </mo> 
      <mn>
        1 
      </mn> 
      <mo>
        , 
      </mo> 
      <mn>
        2 
      </mn> 
      <mo>
        , 
      </mo> 
      <mo>
        ⋯ 
      </mo> 
      <mo>
        , 
      </mo> 
      <mi>
        L 
      </mi> 
      <mo>
        − 
      </mo> 
      <mn>
        2 
      </mn> 
     </mrow> 
    </math> (4)</p>
   <p>As shown in <xref ref-type="fig" rid="fig6">
     Figure 6
    </xref> the constellation for both Adaptive Modulation and 4 levels CM is identical (that is used in the closest zone). Here the CM technique can be used to generate any level of constellation size in the same way as the Adaptive Modulation and hence, the same receiver can be used to retrieve the data for all zones. In the case of CM, the transmitter will divide the user data into sub-groups of bits each sub-group is fed to a different level. In the case of 64-ary constellation we need three levels CM to form the constellation points that is three 2-bits sub-groups; this will be used in the closest zone to base station. And in the next zone we use two levels CM to form the 16-ary constellation and in the next zone one CM level with 4-ary constellation is needed finally in the last zone one level CM with a binary constellation is needed.</p>
   <p>The CM can form the Adaptive modulation scheme, but it does not cover the adaptation process, since it only describes the constellation design and implementation. The CM provides a flexible method to control the power for each level individually by controlling the values of 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         α 
       </mi> 
       <mi>
         l 
       </mi> 
      </msub> 
     </mrow> 
    </math>’s for each zone and even for each level. This will result in an unequal error protection scheme that can have better BER performance for the more important data. A comparison between 16-ary constellations for both equal and unequal error protection is shown in <xref ref-type="fig" rid="fig7">
     Figure 7
    </xref>.</p>
   <fig id="fig7" position="float">
    <label>Figure 7</label>
    <caption>
     <title>Figure 7. 16-ary constellation for equal error protection (left) and unequal error protection (right).</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1732773-rId47.jpeg?20240719032232" />
   </fig>
   <p>In this example we can see that the Euclidean distance between constellation points in level 0 is less than the Euclidean distance between constellation points in level 1. This can be written as:</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         α 
       </mi> 
       <mn>
         0 
       </mn> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mfrac> 
       <mrow> 
        <msub> 
         <mi>
           α 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
       <mi>
         p 
       </mi> 
      </mfrac> 
     </mrow> 
    </math> where 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        p 
      </mi> 
      <mo>
        ≥ 
      </mo> 
      <mn>
        2 
      </mn> 
     </mrow> 
    </math> (5)</p>
   <p>where p is a constant that specifies the amount of reduction in the Euclidean distance between the constellation points. If we have more than two levels Equation (4) becomes:</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         α 
       </mi> 
       <mi>
         l 
       </mi> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mfrac> 
       <mrow> 
        <msub> 
         <mi>
           α 
         </mi> 
         <mrow> 
          <mi>
            l 
          </mi> 
          <mo>
            + 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
        </msub> 
       </mrow> 
       <mrow> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mi>
           l 
         </mi> 
        </msub> 
       </mrow> 
      </mfrac> 
      <mo>
        , 
      </mo> 
      <mi>
        l 
      </mi> 
      <mo>
        = 
      </mo> 
      <mn>
        0 
      </mn> 
      <mo>
        , 
      </mo> 
      <mn>
        1 
      </mn> 
      <mo>
        , 
      </mo> 
      <mn>
        2 
      </mn> 
      <mo>
        , 
      </mo> 
      <mo>
        ⋯ 
      </mo> 
      <mo>
        , 
      </mo> 
      <mi>
        L 
      </mi> 
      <mo>
        − 
      </mo> 
      <mn>
        2 
      </mn> 
     </mrow> 
    </math> and 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         p 
       </mi> 
       <mi>
         l 
       </mi> 
      </msub> 
      <mo>
        ≥ 
      </mo> 
      <mn>
        2 
      </mn> 
     </mrow> 
    </math> (6)</p>
   <p>As discussed above, the CM leads to designing the same constellation used in the Adaptive Modulation and provides more flexibility to implement Unequal Error protection scheme. The adaptation can be introduced simply by controlling the P<sub>l</sub> and 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         α 
       </mi> 
       <mi>
         l 
       </mi> 
      </msub> 
     </mrow> 
    </math> factors. Next, we discuss the relation between the CM and the NOMA.</p>
  </sec><sec id="s3">
   <title>3. CM Leading to NOMA</title>
   <p>The introduction of NOMA in the 5G systems has the impact of increasing the overall systems capacity <xref ref-type="bibr" rid="scirp.134650-21">
     [21]
    </xref>-<xref ref-type="bibr" rid="scirp.134650-26">
     [26]
    </xref>. This increases the importance of using NOMA systems in current and future communications systems. For users at distance 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         r 
       </mi> 
       <mi>
         l 
       </mi> 
      </msub> 
     </mrow> 
    </math> from base station where:</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         r 
       </mi> 
       <mn>
         0 
       </mn> 
      </msub> 
      <mo>
        &lt; 
      </mo> 
      <msub> 
       <mi>
         r 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mo>
        &lt; 
      </mo> 
      <mo>
        ⋯ 
      </mo> 
      <mo>
        &lt; 
      </mo> 
      <msub> 
       <mi>
         r 
       </mi> 
       <mrow> 
        <mi>
          L 
        </mi> 
        <mo>
          − 
        </mo> 
        <mn>
          1 
        </mn> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> (7)</p>
   <p>It is assumed that the closer users have higher SNR than the far users. Therefore, Equations (1) and (6) can represent generalized NOMA constellation. For</p>
   <p>example, in 2 levels CM the transmitted signal with 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         α 
       </mi> 
       <mn>
         0 
       </mn> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mfrac> 
       <mrow> 
        <msub> 
         <mi>
           α 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
       <mn>
         2 
       </mn> 
      </mfrac> 
      <mo>
        = 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math> and 4-QAM</p>
   <p>constellation for each level, the transmitted signal can be written as:</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         Φ 
       </mi> 
       <mi>
         t 
       </mi> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         t 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <msub> 
       <mi>
         s 
       </mi> 
       <mn>
         0 
       </mn> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         t 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        + 
      </mo> 
      <mn>
        2 
      </mn> 
      <msub> 
       <mi>
         s 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         t 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> (8)</p>
   <p>where 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         s 
       </mi> 
       <mn>
         0 
       </mn> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         t 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> and 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         s 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         t 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        ∈ 
      </mo> 
      <mrow> 
       <mo>
         { 
       </mo> 
       <mrow> 
        <mn>
          1 
        </mn> 
        <mo>
          + 
        </mo> 
        <mi>
          j 
        </mi> 
        <mo>
          , 
        </mo> 
        <mo>
          − 
        </mo> 
        <mn>
          1 
        </mn> 
        <mo>
          + 
        </mo> 
        <mi>
          j 
        </mi> 
        <mo>
          , 
        </mo> 
        <mn>
          1 
        </mn> 
        <mo>
          − 
        </mo> 
        <mi>
          j 
        </mi> 
        <mo>
          , 
        </mo> 
        <mo>
          − 
        </mo> 
        <mn>
          1 
        </mn> 
        <mo>
          − 
        </mo> 
        <mi>
          j 
        </mi> 
       </mrow> 
       <mo>
         } 
       </mo> 
      </mrow> 
     </mrow> 
    </math>, This will produce constellation points as shown in <xref ref-type="fig" rid="fig8">
     Figure 8
    </xref>. The same constellation can be seen as a NOMA with two users the close user data corresponding to level 0 and the far user data corresponding to level 1.</p>
   <p>At the receiver assuming AWGN channel for simplicity, the received signal is given by:</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         Φ 
       </mi> 
       <mi>
         r 
       </mi> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         t 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <msub> 
       <mi>
         s 
       </mi> 
       <mn>
         0 
       </mn> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         t 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        + 
      </mo> 
      <mn>
        2 
      </mn> 
      <msub> 
       <mi>
         s 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         t 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        + 
      </mo> 
      <mi>
        n 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         t 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> (9)</p>
   <p>n(t) is AWGN. Here the receiver will detect level 1 signal first and will subtract it from the whole signal and then detect level 0 signal.</p>
   <p>In general, the receiver will be a successive cancellation receiver. Starting at the higher level and going down to the lower levels. Each time it will subtract the lower level from the previous signal to detect the next level.</p>
   <fig id="fig8" position="float">
    <label>Figure 8</label>
    <caption>
     <title>Figure 8. Example of two levels CM with 

      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
        <msub> 
   
         <mi>
          
    p
   
         </mi> 
   
         <mn>
          
    0
   
         </mn> 
  
        </msub> 
  
        <mo>
         
   =
  
        </mo>
  
        <mn>
         
   2
  
        </mn>
 
       </mrow>

      </math>.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1732773-rId72.jpeg?20240719032233" />
   </fig>
   <p>In CM, the extended levels might use simple repetition code to enhance their SNR such that each level l can repeat its data along 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         q 
       </mi> 
       <mi>
         l 
       </mi> 
      </msub> 
     </mrow> 
    </math> successive signaling intervals. <xref ref-type="fig" rid="fig9">
     Figure 9
    </xref> shows an example of two levels CM scheme with 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         q 
       </mi> 
       <mn>
         0 
       </mn> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mn>
        2 
      </mn> 
     </mrow> 
    </math> where we repeat twice level 0 data.</p>
   <fig id="fig9" position="float">
    <label>Figure 9</label>
    <caption>
     <title>Figure 9. Example of two levels CM with 

      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
        <msub> 
   
         <mi>
          
    p
   
         </mi> 
   
         <mn>
          
    0
   
         </mn> 
  
        </msub> 
  
        <mo>
         
   =
  
        </mo>
  
        <mn>
         
   3
  
        </mn>
 
       </mrow>

      </math> and 

      <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
        <msub> 
   
         <mi>
          
    q
   
         </mi> 
   
         <mn>
          
    0
   
         </mn> 
  
        </msub> 
  
        <mo>
         
   =
  
        </mo>
  
        <mn>
         
   2
  
        </mn>
 
       </mrow>

      </math>.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1732773-rId79.jpeg?20240719032233" />
   </fig>
   <p>The repetition code can be replaced by any error correcting code to get better performance for each level to form a Coded Modulation scheme. In the shown example the close user will detect his data as:</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         I 
       </mi> 
       <mn>
         0 
       </mn> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mtext>
        Abs 
      </mtext> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mi>
          Re 
        </mi> 
        <mrow> 
         <mo>
           { 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             Φ 
           </mi> 
           <mi>
             r 
           </mi> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mi>
             t 
           </mi> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
         <mo>
           } 
         </mo> 
        </mrow> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        − 
      </mo> 
      <msub> 
       <mi>
         α 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mtext>
          
      </mtext> 
      <mtext>
          
      </mtext> 
      <mtext>
        and 
      </mtext> 
      <mtext>
          
      </mtext> 
      <mtext>
          
      </mtext> 
      <msub> 
       <mi>
         Q 
       </mi> 
       <mn>
         0 
       </mn> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mtext>
        Abs 
      </mtext> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mi>
          Im 
        </mi> 
        <mrow> 
         <mo>
           { 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             Φ 
           </mi> 
           <mi>
             r 
           </mi> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mi>
             t 
           </mi> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
         <mo>
           } 
         </mo> 
        </mrow> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        − 
      </mo> 
      <msub> 
       <mi>
         α 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
     </mrow> 
    </math> (10)</p>
   <p>And then detecting the other level as:</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         I 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mi>
        Re 
      </mi> 
      <mrow> 
       <mo>
         { 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           Φ 
         </mi> 
         <mi>
           r 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           t 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
       <mo>
         } 
       </mo> 
      </mrow> 
      <mo>
        − 
      </mo> 
      <msub> 
       <mi>
         I 
       </mi> 
       <mn>
         0 
       </mn> 
      </msub> 
      <mtext>
          
      </mtext> 
      <mtext>
          
      </mtext> 
      <mtext>
        and 
      </mtext> 
      <mtext>
          
      </mtext> 
      <mtext>
          
      </mtext> 
      <msub> 
       <mi>
         Q 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mi>
        Im 
      </mi> 
      <mrow> 
       <mo>
         { 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           Φ 
         </mi> 
         <mi>
           r 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           t 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
       <mo>
         } 
       </mo> 
      </mrow> 
      <mo>
        − 
      </mo> 
      <msub> 
       <mi>
         Q 
       </mi> 
       <mn>
         0 
       </mn> 
      </msub> 
     </mrow> 
    </math> (11)</p>
   <p>We can see that the CM can be a more generalized form of NOMA as well as it can combine coding techniques to enhance the receiving performance.</p>
  </sec><sec id="s4">
   <title>4. Performance</title>
   <p>A MatLab simulation was conducted with an average of 2 million iterations at each SNR value for both Adaptive Modulation and NOMA using 4-ary QAM for each zone and compared with CM with two levels and no repetition code with the same constellation size.</p>
   <p>The CM performance in AWGN channel matches the performance of adaptive modulation when it uses the right parameters (i.e. for 2-levels adaptive modulation set: L = 3 and p = 2). Here, both <p class="imgGroupCss_v"><img class=" imgMarkCss lazy" data-original="https://html.scirp.org/file/1732773-rId88.jpeg?20240719032233" /></p>the adaptive modulation and the CM matches exactly and hence, there BER performance coincide as shown from MatLab simulation in <xref ref-type="fig" rid="fig10">
     Figure 10
    </xref>.</p>
   <fig id="fig10" position="float">
    <label>Figure 10</label>
    <caption>
     <title>Figure 10. CM and Adaptive modulation performance for the same parameters.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1732773-rId89.jpeg?20240719032233" />
   </fig>
   <p>Again, the CM performance in AWGN channel matches the performance of NOMA when it uses the right parameters (i.e. 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         p 
       </mi> 
       <mn>
         0 
       </mn> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mn>
        2 
      </mn> 
     </mrow> 
    </math> and 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         q 
       </mi> 
       <mn>
         0 
       </mn> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math>). Here, both the NOMA and the CM matches exactly and hence, there BER performance coincide as shown from MatLab simulation in <xref ref-type="fig" rid="fig11">
     Figure 11
    </xref>.</p>
   <p>As shown the BER performance in AWGN channel in both cases matches their counterpart. The CM has the advantage of combining a repetitive code to further enhance the higher levels data. This can be done by setting 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         q 
       </mi> 
       <mn>
         0 
       </mn> 
      </msub> 
      <mo>
        &gt; 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math>.</p>
   <fig id="fig11" position="float">
    <label>Figure 11</label>
    <caption>
     <title>Figure 11. CM and NOMA performance for the same parameters.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1732773-rId96.jpeg?20240719032233" />
   </fig>
  </sec><sec id="s5">
   <title>5. Conclusion</title>
   <p>In this paper, it is shown that the CM is a generalized modulation form that can represent adaptive modulation as well as NOMA. The CM BER performance also matches the similar adaptive modulation and NOMA constellations. The CM can also use any type of constellation to represent a multi-user modulation scheme. The CM can be implemented as an unequal error protection scheme as well as it can combine coding with modulation to further protect the different levels independently.</p>
  </sec>
 </body><back>
  <ref-list>
   <title>References</title>
   <ref id="scirp.134650-ref1">
    <label>1</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Tse, D. and Viswanath, P. (2005) Fundamentals of Wireless Communication. Cambridge University Press. &gt;https://doi.org/10.1017/cbo9780511807213
    </mixed-citation>
   </ref>
   <ref id="scirp.134650-ref2">
    <label>2</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Caire, G. and Shamai, S. (2003) On the Achievable Throughput of a Multiantenna Gaussian Broadcast Channel. IEEE Transactions on Information Theory, 49, 1691-1706. &gt;https://doi.org/10.1109/tit.2003.813523
    </mixed-citation>
   </ref>
   <ref id="scirp.134650-ref3">
    <label>3</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Higuchi, K. and Kishiyama, Y. (2012) Non-Orthogonal Access with Successive Interference Cancellation for Future Radio Access. APWCS.
    </mixed-citation>
   </ref>
   <ref id="scirp.134650-ref4">
    <label>4</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Endo, Y., Kishiyama, Y. and Higuchi, K. (2012) Uplink Non-Orthogonal Access with MMSE-SIC in the Presence of Inter-Cell Interference. 2012 International Symposium on Wireless Communication Systems (ISWCS), Paris, 28-31 August 2012, 261-265. &gt;https://doi.org/10.1109/iswcs.2012.6328370
    </mixed-citation>
   </ref>
   <ref id="scirp.134650-ref5">
    <label>5</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Benjebbour, A., Saito, Y., Kishiyama, Y., Li, A., Harada, A. and Nakamura, T. (2013) Concept and Practical Considerations of Non-Orthogonal Multiple Access (NOMA) for Future Radio Access. 2013 International Symposium on Intelligent Signal Processing and Communication Systems, Naha, 12-15 November 2013, 770-774. &gt;https://doi.org/10.1109/ispacs.2013.6704653
    </mixed-citation>
   </ref>
   <ref id="scirp.134650-ref6">
    <label>6</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Saito, Y., Benjebbour, A., Kishiyama, Y. and Nakamura, T. (2013) System-Level Performance Evaluation of Downlink Non-Orthogonal Multiple Access (NOMA). 2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC), London, 8-11 September 2013, 611-615. &gt;https://doi.org/10.1109/pimrc.2013.6666209
    </mixed-citation>
   </ref>
   <ref id="scirp.134650-ref7">
    <label>7</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Benjebbour, A., Anxin Li,, Saito, Y., Kishiyama, Y., Harada, A. and Nakamura, T. (2013) System-Level Performance of Downlink NOMA for Future LTE Enhancements. 2013 IEEE Globecom Workshops (GC Wkshps), Atlanta, 9-13 December 2013, 66-70. &gt;https://doi.org/10.1109/glocomw.2013.6824963
    </mixed-citation>
   </ref>
   <ref id="scirp.134650-ref8">
    <label>8</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Higuchi, K. and Kishiyama, Y. (2013) Non-Orthogonal Access with Random Beamforming and Intra-Beam SIC for Cellular MIMO Downlink. 2013 IEEE 78th Vehicular Technology Conference (VTC Fall), Las Vegas, 2-5 September 2013, 1-5. &gt;https://doi.org/10.1109/vtcfall.2013.6692307
    </mixed-citation>
   </ref>
   <ref id="scirp.134650-ref9">
    <label>9</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Li, A., Benjebbour, A. and Harada, A. (2014) Performance Evaluation of Non-Orthogonal Multiple Access Combined with Opportunistic Beamforming. 2014 IEEE 79th Vehicular Technology Conference (VTC Spring), Seoul, 18-21 May 2014, 1-5. &gt;https://doi.org/10.1109/vtcspring.2014.7023050
    </mixed-citation>
   </ref>
   <ref id="scirp.134650-ref10">
    <label>10</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Higuchi, K. and Benjebbour, A. (2015) Non-Orthogonal Multiple Access (NOMA) with Successive Interference Cancellation for Future Radio Access. IEICE Transactions on Communications, 98, 403-414. &gt;https://doi.org/10.1587/transcom.e98.b.403
    </mixed-citation>
   </ref>
   <ref id="scirp.134650-ref11">
    <label>11</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Rahhal, J. (1996) Cluster Modulation for Power/Bandwidth Efficient Communication. Ph.D. Thesis, Illinois Institute of Technology.
    </mixed-citation>
   </ref>
   <ref id="scirp.134650-ref12">
    <label>12</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Rahhal, J., Patel, B. and Atkin, G.E. (1994) Clustered Modulation for Bandwidth Efficient Transmission of Side Information. International Conference on Communication Technology (ICCT’94), Shanghai, 8-10 June 1994, 1121-1126.
    </mixed-citation>
   </ref>
   <ref id="scirp.134650-ref13">
    <label>13</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Rahhal, J. and Atkin, G.E. (1997) Cluster Modulation: A Constellation Expansion Technique for Bandwidth Efficient Communication. IEEE Symposium on Advances in Computers and Communications, Alexandria, 27-29 June 1997.
    </mixed-citation>
   </ref>
   <ref id="scirp.134650-ref14">
    <label>14</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Rahhal, J., Wang, Y.-L. and Atkin, G.E. (1997) PSK-Based Constellation Expansion for Fading Multipath Channels. 2nd IEEE Symposium on Computers and Communications, Alexandria, 1-3 July 1997, 685-689.
    </mixed-citation>
   </ref>
   <ref id="scirp.134650-ref15">
    <label>15</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Abdelaziz, M. and Gulliver, T.A. (2018) Triangular Constellations for Adaptive Modulation. IEEE Transactions on Communications, 66, 756-766. &gt;https://doi.org/10.1109/tcomm.2017.2762671
    </mixed-citation>
   </ref>
   <ref id="scirp.134650-ref16">
    <label>16</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Wang, Y., Liu, W. and Fang, L. (2020) Adaptive Modulation and Coding Technology in 5G System. 2020 International Wireless Communications and Mobile Computing (IWCMC), Limassol, 15-19 June 2020, 159-164. &gt;https://doi.org/10.1109/iwcmc48107.2020.9148457
    </mixed-citation>
   </ref>
   <ref id="scirp.134650-ref17">
    <label>17</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Kojima, S., Maruta, K. and Ahn, C. (2019) Adaptive Modulation and Coding Using Neural Network Based SNR Estimation. IEEE Access, 7, 183545-183553. &gt;https://doi.org/10.1109/access.2019.2946973
    </mixed-citation>
   </ref>
   <ref id="scirp.134650-ref18">
    <label>18</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Yaghubi-Namaad, M., Rahbar, A.G. and Alizadeh, B. (2018) Adaptive Modulation and Flexible Resource Allocation in Space-Division-Multiplexed Elastic Optical Networks. Journal of Optical Communications and Networking, 10, 240-251. &gt;https://doi.org/10.1364/jocn.10.000240
    </mixed-citation>
   </ref>
   <ref id="scirp.134650-ref19">
    <label>19</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Abu-Baker, A., Alshamali, A. and Shawaheen, Y. (2021) Energy-Efficient Cluster-Based Wireless Sensor Networks Using Adaptive Modulation: Performance Analysis. IEEE Access, 9, 141766-141777. &gt;https://doi.org/10.1109/access.2021.3118672
    </mixed-citation>
   </ref>
   <ref id="scirp.134650-ref20">
    <label>20</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Boulogeorgos, A.A., Papasotiriou, E.N. and Alexiou, A. (2018) A Distance and Bandwidth Dependent Adaptive Modulation Scheme for THz Communications. 2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), Kalamata, 25-28 June 2018, 1-5. &gt;https://doi.org/10.1109/spawc.2018.8445864
    </mixed-citation>
   </ref>
   <ref id="scirp.134650-ref21">
    <label>21</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Shanthi, K.G. and Manikandan, A. (2019) An Improved Adaptive Modulation and Coding for Cross Layer Design in Wireless Networks. Wireless Personal Communications, 108, 1009-1020. &gt;https://doi.org/10.1007/s11277-019-06448-1
    </mixed-citation>
   </ref>
   <ref id="scirp.134650-ref22">
    <label>22</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Benjebbour, A., Saito, K., Li, A., Kishiyama, Y. and Nakamura, T. (2015) Non-Orthogonal Multiple Access (NOMA): Concept, Performance Evaluation and Experimental Trials. 2015 International Conference on Wireless Networks and Mobile Communications (WINCOM), Marrakech, 20-23 October 2015, 1-6. &gt;https://doi.org/10.1109/wincom.2015.7381343
    </mixed-citation>
   </ref>
   <ref id="scirp.134650-ref23">
    <label>23</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Akbar, A., Jangsher, S. and Bhatti, F.A. (2021) NOMA and 5G Emerging Technologies: A Survey on Issues and Solution Techniques. Computer Networks, 190, Article ID: 107950. &gt;https://doi.org/10.1016/j.comnet.2021.107950
    </mixed-citation>
   </ref>
   <ref id="scirp.134650-ref24">
    <label>24</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Kumar, A., Kumar, K., Gupta, M.S. and Kumar, S. (2020) A Survey on NOMA Techniques for 5G Scenario. SSRN Electronic Journal. &gt;https://doi.org/10.2139/ssrn.3573579
    </mixed-citation>
   </ref>
   <ref id="scirp.134650-ref25">
    <label>25</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Zaman, N.U., Hassan, A.K., Abbas, Z.H., Abbas, G., Bilal, M. and Pack, S. (2023) Performance Analysis of NOMA Enabled Multi-User Co-Operative IoT Network with SWIPT Protocol. Journal of King Saud University-Computer and Information Sciences, 35, Article ID: 101639. &gt;https://doi.org/10.1016/j.jksuci.2023.101639
    </mixed-citation>
   </ref>
   <ref id="scirp.134650-ref26">
    <label>26</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Mounir, M., El_Mashade, M.B. and Mohamed Aboshosha, A. (2021) On the Selection of Power Allocation Strategy in Power Domain Non-Orthogonal Multiple Access (PD-NOMA) for 6G and Beyond. Transactions on Emerging Telecommunications Technologies, 33, e4289. &gt;https://doi.org/10.1002/ett.4289
    </mixed-citation>
   </ref>
  </ref-list>
 </back>
</article>