<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article article-type="brief-report" dtd-version="2.3" xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Comms. Net</journal-id>
<journal-title>Frontiers in Communications and Networks</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Comms. Net</abbrev-journal-title>
<issn pub-type="epub">2673-530X</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">1125924</article-id>
<article-id pub-id-type="doi">10.3389/frcmn.2023.1125924</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Communications and Networks</subject>
<subj-group>
<subject>Perspective</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Perspective method for reconfigurable intelligent surface design for NOMA transmission: Theoretical study</article-title>
<alt-title alt-title-type="left-running-head">Kontorovich</alt-title>
<alt-title alt-title-type="right-running-head">
<ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3389/frcmn.2023.1125924">10.3389/frcmn.2023.1125924</ext-link>
</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Kontorovich</surname>
<given-names>V.</given-names>
</name>
<xref ref-type="corresp" rid="c001">&#x2a;</xref>
<uri xlink:href="https://loop.frontiersin.org/people/2142862/overview"/>
</contrib>
</contrib-group>
<aff>
<institution>Centro de Investigaciones y Estudios Avanzados</institution>, <institution>Instituto Polit&#xe9;cnico Nacional de M&#xe9;xico (CINVESTAV)</institution>, <addr-line>M&#xe9;xico City</addr-line>, <country>Mexico</country>
</aff>
<author-notes>
<fn fn-type="edited-by">
<p>
<bold>Edited by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1984546/overview">Hao Xu</ext-link>, Huawei Technologies (China), China</p>
</fn>
<fn fn-type="edited-by">
<p>
<bold>Reviewed by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/976847/overview">Sang Hyun Lee</ext-link>, Korea University, Republic of Korea</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1987172/overview">Xidong Mu</ext-link>, Queen Mary University of London, United Kingdom</p>
</fn>
<corresp id="c001">&#x2a;Correspondence: V. Kontorovich, <email>valeri@cinvestav.mx</email>
</corresp>
<fn fn-type="other">
<p>This article was submitted to Wireless Communications, a section of the journal Frontiers in Communications and Networks</p>
</fn>
</author-notes>
<pub-date pub-type="epub">
<day>06</day>
<month>03</month>
<year>2023</year>
</pub-date>
<pub-date pub-type="collection">
<year>2023</year>
</pub-date>
<volume>4</volume>
<elocation-id>1125924</elocation-id>
<history>
<date date-type="received">
<day>16</day>
<month>12</month>
<year>2022</year>
</date>
<date date-type="accepted">
<day>01</day>
<month>02</month>
<year>2023</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2023 Kontorovich.</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Kontorovich</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p>
</license>
</permissions>
<abstract>
<p>The method (paradigm) presented here was inspired by two basic ideas: the assumption of the MIMO-RIS-NOMA communication channel as a dispersive channel with fading, and the representation of the latter by means of the generalized Kronecker channel model (GKCM), applying the &#x201c;orthogonalization approach&#x201d; based on utilization of the &#x201c;universal&#x201d; eigen basis in the form of prolate spheroidal wave functions (PSWFs). In other words, the essence of the approach is representing the MIMO-RIS-NOMA channel by means of a finite set of artificially created orthogonal trajectories for wave propagation, which are connected by the coupling matrix (CM) of the RIS. The goal for RIS (through the selection of specific CM elements) is to provide a decoding system for the NOMA users with the required SNR values for each user to guarantee successful decoding processing. A theoretical analysis of this paradigm is presented.</p>
</abstract>
<kwd-group>
<kwd>dispersive channel</kwd>
<kwd>fading</kwd>
<kwd>reconfigurable intelligent surface (RIS)</kwd>
<kwd>wireless communication</kwd>
<kwd>orthogonalization</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<title>1 Introduction</title>
<p>In the transmission system design process, the professional community faces a well-known problem: the need to increase the spectrum efficiency of the system according to the drastically growing user demand and associated content. To satisfy those demands, there has been the development of the Internet of Everything, Intelligent Cities, <italic>etc.</italic>, together with progress in technology in general. There are also several opportunistic ideas proposed, including the shift from OMA to NOMA, MIMO (massive MIMO), and blockchain radio access network (B-RAN), among others<italic>.</italic> Great interest has recently been devoted to the RIS-NOMA design.</p>
<p>Essentially, RIS-NOMA is based on the idea of intelligent reconfiguration of the propagation environment to provide the best conditions for NOMA <bold>user decoding</bold> and minimize multiuser interference (MAI) or, more generally, to adapt the system structure to allow the best use of its potential spectrum abilities. Comprehensive surveys of the results obtained thus far in RIS-NOMA have been published (<xref ref-type="bibr" rid="B3">Ding et al., 2022</xref>; <xref ref-type="bibr" rid="B5">Hou et al., 2019</xref>; and <xref ref-type="bibr" rid="B13">Yang et al., 2021</xref>, see also references therein). Based on these studies, the combination of RIS-NOMA seems to be rather opportunistic and is able to significantly improve the transmission&#x2019;s throughput. Moreover, it provides improved security, automation of network control with AI-deep learning, <italic>etc.</italic> However, the idea of the artificial influence on the propagation environment of the communication channel to improve the characteristics of information transmission is not new. In this regard, it is reasonable to invoke the ideas of the &#x201c;West Ford&#x201d; project (Kennedy, 1969). The West Ford project was proposed by R. Kennedy (MIT) in the late 1950s and early 1960s as an artificially created &#x201c;wave guide&#x201d; for the improvement of very long-distance (overseas) HF communications.</p>
<p>From fundamental analogies, RIS might be considered a &#x201c;replica&#x201d; of the West Ford idea, adapted to mobile wireless communications. In some sense, RIS is an aggregate of the properly &#x201c;tuned&#x201d; set of partial &#x201c;West Ford&#x2019;s&#x201d; reflectors in order to finally provide the optimum decoding conditions for all NOMA users.</p>
<p>In the next section, how the ideas of <xref ref-type="bibr" rid="B9">Kennedy (1969</xref>) can be theoretically adopted and developed as a new paradigm for RIS-NOMA design will be discussed; it is assumed that, for user decoding, the ideas from <xref ref-type="bibr" rid="B10">Kontorovich (2022</xref>) are applied.</p>
<p>The paper is organized as follows: <xref ref-type="sec" rid="s2">Section 2</xref> is dedicated to a description of the idea behind the RIS-NOMA design paradigm. In <xref ref-type="sec" rid="s3">Section 3</xref>, the sketch of the calculus of the elements of the coupling matrix (CM) for RIS control is outlined. <xref ref-type="sec" rid="s4">Section 4</xref> is dedicated to the calculus of the principal characteristics of noise immunity and spectrum efficiency of information transmission with the application of the proposed paradigm for RIS design. The conclusions appear in <xref ref-type="sec" rid="s5">Section 5</xref>.</p>
</sec>
<sec id="s2">
<title>2 Description of the main idea</title>
<p>Prior studies indicate that RIS-NOMA transmission systems have been analyzed for many, and very important, cases (<xref ref-type="bibr" rid="B3">Ding et al., 2022</xref>; <xref ref-type="bibr" rid="B5">Hou et al., 2019</xref>; <xref ref-type="bibr" rid="B13">Yang et al., 2021</xref>; <italic>etc.</italic>); however, the analysis has been mainly limited to special cases of system design, such as SISO-RIS-NOMA and MISO-RIS-NOMA. The MIMO-RIS-NOMA case has rarely been investigated (see references).</p>
<p>In this section, the general case of MIMO-RIS-NOMA<xref ref-type="fn" rid="fn1">
<sup>1</sup>
</xref> is analyzed following ideas from <xref ref-type="bibr" rid="B9">Kennedy (1969</xref>) and applying space&#x2013;time channel orthogonalizations (<xref ref-type="bibr" rid="B2">Alcocer-Ochoa et al., 2006</xref>; <xref ref-type="bibr" rid="B11">Kontorovich et al., 2008</xref>; <xref ref-type="bibr" rid="B12">Parra-Michel et al., 2009</xref>, <italic>etc.</italic>, and references therein). In this regard, and in order to be &#x201c;consequent,&#x201d; the MIMO-RIS-NOMA system can be considered a MIMO system (or, more concretely, a MIMO analog channel) with fading and dispersion applied for power NOMA transmission.</p>
<p>It is considered natural to model this MIMO channel with the help of the generalized Kronecker channel model (GKCM), as proposed in prior studies (<xref ref-type="bibr" rid="B2">Alcocer-Ochoa et al., 2006</xref>; <xref ref-type="bibr" rid="B11">Kontorovich et al., 2008</xref>; <xref ref-type="bibr" rid="B12">Parra-Michel et al., 2009</xref>; see also references therein). Moreover, the &#x201c;angle model&#x201d; described in <xref ref-type="bibr" rid="B12">Parra-Michel et al. (2009</xref>) might be used as well.</p>
<p>Next, as mentioned in <xref ref-type="bibr" rid="B3">Ding et al. (2022</xref>), &#x201c;secondary&#x201d; users for NOMA transmission are usually located in small clusters surrounding each RIS of the MIMO-RIS-NOMA; therefore, it is reasonable to suppose that users (members of a cluster) may initially operate in different transmission power regimes or with similar transmission powers. In any case, propagation conditions for all may be assumed as physically &#x201c;sparse&#x201d; and RIS has to support the optimum conditions for their &#x201c;decoding&#x201d; (identification) at the receiving terminal.</p>
<p>RIS provides a &#x201c;passive beamforming&#x201d; for those users (<xref ref-type="bibr" rid="B5">Hou et al., 2019</xref>; <xref ref-type="bibr" rid="B6">Hou et al., 2020</xref>; <xref ref-type="bibr" rid="B13">Yang et al., 2021</xref>; <xref ref-type="bibr" rid="B8">Imene et al., 2022</xref>) as well, but, physically, its modeling depends on the wave reflection mechanism of RIS. If the number of RIS reflectors is large (<xref ref-type="bibr" rid="B3">Ding et al., 2022</xref>; <xref ref-type="bibr" rid="B5">Hou et al., 2019</xref>; <xref ref-type="bibr" rid="B13">Yang et al., 2021</xref>) and the number of propagation trajectories is large as well, then the &#x201c;angle model&#x201d; from <xref ref-type="bibr" rid="B12">Parra-Michel et al. (2009</xref>) becomes difficult to apply, even though it is reasonable to invoke the more general GKCM model (<xref ref-type="bibr" rid="B2">Alcocer-Ochoa et al., 2006</xref>; <xref ref-type="bibr" rid="B11">Kontorovich et al., 2008</xref>), which has an efficiency that follows from the limited number of &#x201c;non-physical&#x201d; or artificial trajectories for practical application (<xref ref-type="bibr" rid="B2">Alcocer-Ochoa et al., 2006</xref>; <xref ref-type="bibr" rid="B11">Kontorovich et al., 2008</xref>; <xref ref-type="bibr" rid="B12">Parra-Michel et al., 2009</xref>; and references therein). According to the &#x201c;structure&#x201d; of the GKCM, the idea of &#x201c;passive beamforming&#x201d; might be implemented from the CM of the GKCM (see next section), which provides the &#x201c;propagation tracks&#x201d; for each NOMA transmission user.</p>
<p>The GKCM is essentially a model of the generic Gaussian channel based on the space&#x2013;time orthogonalization principle, using a limited set of two-dimensional <bold>separable</bold> PSWFs with envelope PDFs as eigenfunctions (as Rayleigh, Rice, and Nakagami, <italic>etc.</italic>) for each partial artificial trajectory (eigenfunction) <italic>(see block diagram for MIMO from</italic> <xref ref-type="bibr" rid="B2">Alcocer-Ochoa et al., 2006</xref>
<italic>).</italic>
</p>
<p>The RIS algorithm is a synthesis of the <bold>predefined</bold> &#x201c;connections&#x201d; between eigenfunctions at the transmission and reception terminals in order to provide the required conditions for a power NOMA user&#x2019;s decoding. Therefore, the outgoing material might be considered a synthesis of the CM (refer to the following paragraph ) of RIS for the power NOMA-MIMO transmission system and the theoretical basis for passive beamforming for artificial trajectories.</p>
<p>It must be stressed that the theoretical synthesis of the CM of the GKCM is not the final step in the MIMO-RIS-NOMA design. In fact, RIS is mainly implemented as a block of many reflectors (analog to passive &#x201c;MIMO&#x201d; antennas), which are controlled by the specific RIS controller (<xref ref-type="bibr" rid="B3">Ding et al., 2022</xref>; <xref ref-type="bibr" rid="B5">Hou et al., 2019</xref>; <xref ref-type="bibr" rid="B13">Yang et al., 2021</xref>; <italic>etc.</italic>). This controller adapts the RIS processing to the propagation conditions (environment) to support the final goal, which is &#x201c;best decoding&#x201d; for all users. The latter is a specific &#x201c;replica&#x201d; of an attempt to generalize the implementation of &#x201c;reflectors&#x201d; for the artificial trajectory&#x2019;s propagation scenario.</p>
<p>Moreover, the implementation of reflectors is clearly not a unique way to implement RIS. A different approach to implementing RIS might be based on the synthesis of inhomogeneous surfaces with reflecting properties that are adequate to the CM and can be adaptively controlled by AI by means of metamaterials (<xref ref-type="bibr" rid="B7">IEEE Staff, 2022</xref>). Detailed comments related to RIS implementation are not included here; future discussion and development of a &#x201c;bridge&#x201d; between a synthesized CM and an implementation of RIS are needed.</p>
</sec>
<sec id="s3">
<title>3 Sketch for the calculus of the elements of the coupling matrix design</title>
<p>Let us assume the existence of <inline-formula id="inf1">
<mml:math id="m1">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mover accent="true">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:math>
</inline-formula> RIS located in different sites (which are associated with a MIMO transmission system); each site is assigned to several users <inline-formula id="inf2">
<mml:math id="m2">
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mover accent="true">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>m</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:math>
</inline-formula>. Each user at the location requires a fixed SIR (<italic>h</italic>
<sup>2</sup>) at the receiving terminal of the SICs of the MIMO systems in order to be properly identified as a NOMA user. A graphical interpretation of this is provided in <xref ref-type="bibr" rid="B1">Abrardo et al. (2021)</xref>.</p>
<p>To avoid any future confusion, a selected site notation for <inline-formula id="inf3">
<mml:math id="m3">
<mml:mrow>
<mml:msubsup>
<mml:mi>h</mml:mi>
<mml:mi>j</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> that forms a variation series will be used:<disp-formula id="e1">
<mml:math id="m4">
<mml:mrow>
<mml:msubsup>
<mml:mi>h</mml:mi>
<mml:mn>1</mml:mn>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mo>&#x3c;</mml:mo>
<mml:msubsup>
<mml:mi>h</mml:mi>
<mml:mn>2</mml:mn>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mo>&#x3c;</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>&#x3c;</mml:mo>
<mml:msubsup>
<mml:mi>h</mml:mi>
<mml:msub>
<mml:mi>m</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
<label>(1)</label>
</disp-formula>
</p>
<p>If the members of the series are rather &#x201c;sparse,&#x201d; i.e., {<inline-formula id="inf4">
<mml:math id="m5">
<mml:mrow>
<mml:msubsup>
<mml:mi>h</mml:mi>
<mml:mi>j</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>} are rather close at (1), then conditions for power NOMA are unacceptable (see, for example, evaluations provided by <xref ref-type="bibr" rid="B10">Kontorovich (2022</xref>) and the references therein).</p>
<p>Then, an &#x201c;interleaving&#x201d; principle (or analog to it) might be applied to form the series (1) from <bold>different sites</bold> associated with <inline-formula id="inf5">
<mml:math id="m6">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mover accent="true">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:math>
</inline-formula> RISs, which requires an additional &#x201c;deciphering&#x201d; procedure at the MIMO receiving terminal (to form a set of users&#x2019; SIRs). In order to make the outgoing material more &#x201c;friendly,&#x201d; let us consider (1) as an initial point for the analysis.</p>
<p>Next, let us assume that those <inline-formula id="inf6">
<mml:math id="m7">
<mml:mrow>
<mml:msubsup>
<mml:mi>h</mml:mi>
<mml:mi>j</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> from (1) provide a satisfactory identification of the users of the site by any known methods (<xref ref-type="bibr" rid="B10">Kontorovich, 2022</xref>; <italic>etc.</italic>) and that it is true for all users from any site. Also, it is assumed in the following that the set of signals from all &#x201c;<italic>k</italic>&#x201d; RIS are <bold>orthogonal</bold> between themselves, which is a first approximation for simplification of the MIMO processing algorithms. Neglecting the orthogonality of the signal sets from &#x201c;different&#x201d; RIS dramatically increases the system&#x2019;s complexity.</p>
<p>At this point, it is time to invoke the GKCM model for the MIMO transmission with RIS from one of the previously selected sites. When MIMO deals with &#x201c;N&#x201d; transmitting and &#x201c;M&#x201d; receiving antennas (<italic>N</italic>
<sub>
<italic>T</italic>
</sub>, <italic>N</italic>
<sub>
<italic>R</italic>
</sub>) representing the &#x201c;N&#x201d; transmitting and &#x201c;M&#x201d; receiving SISO broadband channels (in general), the channel Matrix <bold>
<italic>H</italic>
</bold> (<italic>t</italic>,&#x3c4;) (<xref ref-type="bibr" rid="B2">Alcocer-Ochoa et al., 2006</xref>; <xref ref-type="bibr" rid="B11">Kontorovich et al., 2008</xref>) is:<disp-formula id="e2">
<mml:math id="m8">
<mml:mrow>
<mml:mi mathvariant="bold-italic">H</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>&#x3c4;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo>&#x222b;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>&#x221e;</mml:mi>
</mml:mrow>
<mml:mi>&#x221e;</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:mi mathvariant="bold-italic">H</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>exp</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mn>2</mml:mn>
<mml:mi>&#x3c0;</mml:mi>
<mml:mi>f</mml:mi>
<mml:mi>&#x3c4;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>f</mml:mi>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(2)</label>
</disp-formula>where <italic>t</italic>, &#x3c4;, and <italic>f</italic> are time, delay, and frequency, respectively; matrixes <bold>
<italic>H</italic>
</bold> (<italic>t</italic>,&#x3c4;) and <bold>
<italic>H</italic>
</bold> (<italic>t</italic>, <italic>f</italic>) are of size N x M.</p>
<p>The impulse response matrix <bold>
<italic>H</italic>
</bold> (<italic>t</italic>,&#x3c4;) is assumed to have its complex elements as samples of scalar Gaussian random fields, which are adequate (with an arbitrary set of means and variances) for Rayleigh, Rice, and Nakagami, <italic>etc.</italic>, channel fading.</p>
<p>Also, based on prior studies (<xref ref-type="bibr" rid="B2">Alcocer-Ochoa et al., 2006</xref>; <xref ref-type="bibr" rid="B11">Kontorovich et al., 2008</xref>), it follows that, at both transmitting and receiving terminals, the assumption of PA can be successfully approximated by the statistically equivalent (in a covariance sense) n-ULA arrays (where n is the number of arrays).</p>
<p>Taking the latter into account, the matrix <bold>
<italic>H</italic>
</bold> (<italic>t</italic>,&#x3c4;) in (2) can be represented in the following way (<xref ref-type="bibr" rid="B2">Alcocer-Ochoa et al., 2006</xref>; <xref ref-type="bibr" rid="B11">Kontorovich et al., 2008</xref>):<disp-formula id="e3">
<mml:math id="m9">
<mml:mrow>
<mml:mi mathvariant="bold-italic">H</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>&#x3c4;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi mathvariant="bold-italic">V</mml:mi>
<mml:mtext>Tx</mml:mtext>
</mml:msub>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mover accent="true">
<mml:mi mathvariant="bold">&#x3a9;</mml:mi>
<mml:mo>&#x223c;</mml:mo>
</mml:mover>
<mml:mo>&#x22c5;</mml:mo>
<mml:mi mathvariant="bold-italic">G</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>&#x3c4;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">V</mml:mi>
<mml:mrow>
<mml:mi>R</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
<mml:mi>H</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(3)</label>
</disp-formula>where super index <bold>
<italic>H</italic>
</bold> indicates the Hermitian transpose of the matrix, <inline-formula id="inf7">
<mml:math id="m10">
<mml:mrow>
<mml:mover accent="true">
<mml:mi mathvariant="bold">&#x3a9;</mml:mi>
<mml:mo>&#x223c;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:math>
</inline-formula> is the element-wise square root of the <bold>coupling matrix &#x3a9;</bold>, which physically represents how the eigenmodes of the transmit and receive correlation matrix (in this case PSWF) are connected through the scattering environment of the RIS, and <bold>
<italic>V</italic>
</bold>s with certain indexes are &#x201c;orthogonalization matrixes.&#x201d;</p>
<p>As a first approximation, <bold>&#x3a9;</bold> might be considered a <bold>diagonal</bold> with elements:<disp-formula id="e4">
<mml:math id="m11">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="normal">&#x3a9;</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#x3c;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mfenced open="|" close="|" separators="|">
<mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">V</mml:mi>
<mml:mrow>
<mml:mi>T</mml:mi>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mi>H</mml:mi>
</mml:msubsup>
<mml:mi mathvariant="normal">&#x3b8;</mml:mi>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">V</mml:mi>
<mml:mrow>
<mml:mi>R</mml:mi>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>&#x2a;</mml:mo>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:mo>&#x3e;</mml:mo>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(4)</label>
</disp-formula>where <italic>n</italic> is an index of {PSWF} associated with the <italic>n</italic>th user and &#x3b8; might be associated with power azimuth spectrum (PAS)&#x2014;directions on RIS, or mutual &#x201c;losses&#x201d; of the connected eigenmodes (<xref ref-type="bibr" rid="B7">IEEE Staff, 2022</xref>).</p>
<p>The coupling matrix <bold>&#x3a9;</bold> shows how the eigenmodes of <italic>Tx</italic> and <italic>Rx</italic> are connected through RIS. From the n-ULA approximation for <italic>Tx</italic> and <italic>Rx</italic> with the assumption of a rectangular aperture in an angular domain for each array (see also (11) and (12) from <xref ref-type="bibr" rid="B11">Kontorovich et al. (2008</xref>)), one can see that evaluation of PSWF parameters and eigenvalues is well-known and might be obtained <italic>a priori</italic>.</p>
<p>For a first approximation, the &#x3a9;<sub>
<italic>nn</italic>
</sub> can be calculated as:<disp-formula id="e5">
<mml:math id="m12">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="normal">&#x3a9;</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2245;</mml:mo>
<mml:msubsup>
<mml:mi>&#x3bb;</mml:mi>
<mml:mi>n</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mo>&#x3c;</mml:mo>
<mml:msubsup>
<mml:mi>&#x3d5;</mml:mi>
<mml:msub>
<mml:mi>n</mml:mi>
<mml:mrow>
<mml:mi>T</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:msubsup>
<mml:mi>&#x3d5;</mml:mi>
<mml:msub>
<mml:mi>n</mml:mi>
<mml:mrow>
<mml:mi>R</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mo>&#x3e;</mml:mo>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(5)</label>
</disp-formula>where &#x3c6;<sub>
<italic>n</italic>
</sub> (&#x2219;) are PSWFs.</p>
<p>Then, assuming (5) and that the <italic>n</italic>th user from (1) belongs only to <italic>n</italic>th eigenfunctions from both the <italic>Rx</italic> and <italic>Tx</italic> sides, then <inline-formula id="inf8">
<mml:math id="m13">
<mml:mrow>
<mml:msubsup>
<mml:mi>h</mml:mi>
<mml:mi>n</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>:<disp-formula id="e6">
<mml:math id="m14">
<mml:mrow>
<mml:msubsup>
<mml:mi>h</mml:mi>
<mml:mi>n</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:msubsup>
<mml:mover accent="true">
<mml:mi>&#x3d5;</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
<mml:msub>
<mml:mi>n</mml:mi>
<mml:mrow>
<mml:mi>T</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:msubsup>
<mml:mover accent="true">
<mml:mi>&#x3d5;</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
<mml:msub>
<mml:mi>n</mml:mi>
<mml:mrow>
<mml:mi>R</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:msub>
<mml:mi mathvariant="normal">&#x3a9;</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msubsup>
<mml:mi>&#x3bb;</mml:mi>
<mml:mi>n</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
<label>(6)</label>
</disp-formula>
</p>
<p>From the required <inline-formula id="inf9">
<mml:math id="m15">
<mml:mrow>
<mml:msubsup>
<mml:mi>h</mml:mi>
<mml:mi>n</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>, one can easily find &#x3a9;<sub>
<italic>nn</italic>
</sub>, which is the aim of the RIS controller algorithm. From <xref ref-type="bibr" rid="B10">Kontorovich (2022</xref>) and from (6), the required SNR for the users has to be around 13&#x2013;15&#xa0;dB in order to maintain good decoding at SIC, as well as signal/interference for undesired users.</p>
<p>Briefly, the general view or the &#x201c;paradigm&#x201d; of the reconfigurable MIMO-RIS-NOMA transmission might be formulated as the calculus of &#x201c;passive beamforming&#x201d; weights based on orthogonalized artificial trajectories (PSWF) of the MIMO channel model and its CM.</p>
</sec>
<sec id="s4">
<title>4 MIMO-RIS-NOMA evaluation based on <xref ref-type="bibr" rid="B9">Kennedy (1969</xref>)</title>
<p>For the evaluation of RIS-NOMA-MIMO paradigm characteristics, it might be reasonable to accept the approach for evaluation of the (upper and lower) boundaries for certain &#x201c;global&#x201d; characteristics of the information transmission, as exact analytical solutions might be cumbersome (<xref ref-type="bibr" rid="B1">Abrardo et al., 2021</xref>; <xref ref-type="bibr" rid="B4">Do et al., 2021</xref>). For evaluation of the boundaries, it might be adequate to take the fundamental information-theoretic approach, based on the results of Shannon, Fano, <italic>etc.</italic>, first applied in (<xref ref-type="bibr" rid="B9">Kennedy, 1969</xref>).</p>
<p>First, one can assume that OMA &#x2b; NOMA transmission applying RIS-MIMO (when the number of users and antennas in MIMO is relatively large) accounts for channel fading and dispersion as an aggregate <bold>equivalent Gaussian channel</bold> modeled by GKCM. This aggregate equivalent channel from the information theory point of view might be characterized by average transmission rate and noise immunity boundaries (<xref ref-type="bibr" rid="B9">Kennedy, 1969</xref>), as presented hereafter.</p>
<p>Second, for this channel, the <bold>average</bold> transmission rate is well-known:<disp-formula id="e7">
<mml:math id="m16">
<mml:mrow>
<mml:mi>R</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>s</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfrac>
<mml:msub>
<mml:mi mathvariant="italic">log</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#x2061;</mml:mo>
<mml:mi>m</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi mathvariant="normal">b</mml:mi>
<mml:mo>/</mml:mo>
<mml:mi mathvariant="normal">s</mml:mi>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(7)</label>
</disp-formula>where <italic>T</italic>
<sub>
<italic>s</italic>
</sub> is the average (for all users) symbol interval and the same for <italic>m</italic> as modulation order<italic>.</italic> This channel (&#x201c;equivalent&#x201d; for the whole system) is purely hypothetical, but it might be useful for first approximation evaluations.</p>
<p>Third, for RIS-NOMA-MIMO, the transmission rate (for independent transmission for all users) grows asymptotically up to:<disp-formula id="e8">
<mml:math id="m17">
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi mathvariant="normal">&#x3a3;</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
</mml:mstyle>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(8)</label>
</disp-formula>where {<italic>R</italic>
<sub>
<italic>k</italic>
</sub>} are individual user rates and <italic>n</italic> is the number of users.</p>
<p>If the &#x201c;equivalent&#x201d; <italic>T</italic>
<sub>
<italic>s</italic>
</sub> in (7) (with <italic>m</italic>&#x2013;fixed) is diminishing drastically, the average SNR <inline-formula id="inf10">
<mml:math id="m18">
<mml:mrow>
<mml:mover accent="true">
<mml:msup>
<mml:mi>h</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:math>
</inline-formula> and noise immunity are decreasing as well.</p>
<p>Then, according to <xref ref-type="bibr" rid="B9">Kennedy (1969</xref>), one can obtain two different, but rather close, boundaries BER or <italic>P</italic>
<sub>
<italic>err</italic>
</sub>:<disp-formula id="e9">
<mml:math id="m19">
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2264;</mml:mo>
<mml:msub>
<mml:mi>K</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#x2061;</mml:mo>
<mml:mi>exp</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:msup>
<mml:mi>h</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:mi>E</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(9)</label>
</disp-formula>
<disp-formula id="e10">
<mml:math id="m20">
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2265;</mml:mo>
<mml:msub>
<mml:mi>K</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>&#x2061;</mml:mo>
<mml:mi>exp</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>s</mml:mi>
</mml:msub>
<mml:mi>C</mml:mi>
<mml:mi>E</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(10)</label>
</disp-formula>where C is the Shannon channel capacity (see 13), and <italic>K</italic>
<sub>1</sub> and <italic>K</italic>
<sub>2</sub> are approximation coefficients (<xref ref-type="bibr" rid="B9">Kennedy, 1969</xref>).</p>
<p>One might consider that (9) and (10) have the same sense, as do the well-known Chernoff boundaries, but it is not the case. In contrast to the Chernoff boundaries, the inequalities of (9) and (10) were obtained, not through statistical limits, but through fundamental properties of information transmission that might be more relevant to the case presented here.</p>
<p>For (9) and (10), the approximation parameters and coefficients are:<disp-formula id="e11">
<mml:math id="m21">
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>E</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi mathvariant="normal">&#x3a3;</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:mi>C</mml:mi>
</mml:mrow>
</mml:mfrac>
<mml:mo>,</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi mathvariant="normal">&#x3a3;</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:mi>C</mml:mi>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x2264;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mn>4</mml:mn>
</mml:mrow>
</mml:mfrac>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>E</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msqrt>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi mathvariant="normal">&#x3a3;</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:mi>C</mml:mi>
</mml:mrow>
</mml:mfrac>
</mml:msqrt>
<mml:mo>,</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mn>4</mml:mn>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x3c;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi mathvariant="normal">&#x3a3;</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:mi>C</mml:mi>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x2264;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>K</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:msqrt>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mi>&#x3c0;</mml:mi>
<mml:mover accent="true">
<mml:msup>
<mml:mi>h</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:msqrt>
</mml:mrow>
</mml:mfrac>
<mml:mo>,</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi mathvariant="normal">&#x3a3;</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:mi>C</mml:mi>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x2264;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mn>4</mml:mn>
</mml:mrow>
</mml:mfrac>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>K</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:msqrt>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mi>&#x3c0;</mml:mi>
<mml:mover accent="true">
<mml:msup>
<mml:mi>h</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:msqrt>
</mml:mrow>
</mml:mfrac>
<mml:mrow>
<mml:mfenced open="{" close="}" separators="|">
<mml:mrow>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msqrt>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi mathvariant="normal">&#x3a3;</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:mi>C</mml:mi>
</mml:mrow>
</mml:mfrac>
</mml:msqrt>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x2b;</mml:mo>
<mml:mfrac>
<mml:msqrt>
<mml:mfrac bevelled="true">
<mml:mrow>
<mml:mi>C</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mo>&#x2211;</mml:mo>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:msqrt>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:msqrt>
<mml:mrow>
<mml:mi>&#x3c0;</mml:mi>
<mml:mover accent="true">
<mml:msup>
<mml:mi>h</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:msqrt>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:msqrt>
<mml:mrow>
<mml:mi>&#x3c0;</mml:mi>
<mml:mover accent="true">
<mml:msup>
<mml:mi>h</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:msqrt>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:msqrt>
<mml:mfrac bevelled="true">
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mo>&#x2211;</mml:mo>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:mi>C</mml:mi>
</mml:mrow>
</mml:mfrac>
</mml:msqrt>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mn>4</mml:mn>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x3c;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi mathvariant="normal">&#x3a3;</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:mi>C</mml:mi>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x2264;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:math>
<label>(11)</label>
</disp-formula>
<disp-formula id="e12">
<mml:math id="m22">
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>K</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mn>4</mml:mn>
<mml:mi>&#x3c0;</mml:mi>
<mml:mover accent="true">
<mml:msup>
<mml:mi>h</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:mfrac>
<mml:msup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mover accent="true">
<mml:msup>
<mml:mi>h</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi mathvariant="normal">&#x3a3;</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:mi>C</mml:mi>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x2264;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mn>4</mml:mn>
</mml:mrow>
</mml:mfrac>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>K</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mn>16</mml:mn>
<mml:mi>&#x3c0;</mml:mi>
<mml:mover accent="true">
<mml:msup>
<mml:mi>h</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:mfrac>
<mml:mfrac>
<mml:msqrt>
<mml:mfrac bevelled="true">
<mml:mrow>
<mml:mi>C</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mo>&#x2211;</mml:mo>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:msqrt>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msqrt>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi mathvariant="normal">&#x3a3;</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:mi>C</mml:mi>
</mml:mrow>
</mml:mfrac>
</mml:msqrt>
</mml:mrow>
</mml:mfrac>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mover accent="true">
<mml:msup>
<mml:mi>h</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:mfrac>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:mi>C</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi mathvariant="normal">&#x3a3;</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mover accent="true">
<mml:msup>
<mml:mi>h</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
<mml:msup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msqrt>
<mml:mfrac bevelled="true">
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mo>&#x2211;</mml:mo>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:mi>C</mml:mi>
</mml:mrow>
</mml:mfrac>
</mml:msqrt>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mn>4</mml:mn>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x3c;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi mathvariant="normal">&#x3a3;</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:mi>C</mml:mi>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x2264;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:math>
<label>(12)</label>
</disp-formula>
</p>
<p>For the calculation of the Shannon channel capacity in the previous formulas, there might be two options.<list list-type="simple">
<list-item>
<p>- for the equivalent channel (<xref ref-type="bibr" rid="B9">Kennedy, 1969</xref>): <inline-formula id="inf11">
<mml:math id="m23">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1.44</mml:mn>
<mml:mfrac>
<mml:mrow>
<mml:mover accent="true">
<mml:msup>
<mml:mi>h</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>s</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
</inline-formula>, or more precisely:</p>
</list-item>
<list-item>
<p>- the well-known channel capacity for the MIMO channel is:</p>
</list-item>
</list>
<disp-formula id="e13">
<mml:math id="m24">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi mathvariant="italic">log</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mi>det</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">I</mml:mi>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mi>R</mml:mi>
</mml:msub>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mover accent="true">
<mml:msup>
<mml:mi>h</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mi>T</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfrac>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="bold-italic">H</mml:mi>
<mml:mi mathvariant="bold-italic">H</mml:mi>
</mml:mrow>
<mml:mi>H</mml:mi>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(13)</label>
</disp-formula>
</p>
<p>where (&#x2219;)<sup>
<italic>H</italic>
</sup> represents, as before, the Hermitian transpose, <inline-formula id="inf12">
<mml:math id="m25">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">I</mml:mi>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mi>R</mml:mi>
</mml:msub>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is an identity matrix of <italic>N</italic>
<sub>
<italic>R</italic>
</sub> order, <italic>N</italic>
<sub>
<italic>R</italic>
</sub>, <italic>N</italic>
<sub>
<italic>T</italic>
</sub> are the numbers of antenna arrays at the receiving and transmitting terminals, and <bold>
<italic>H</italic>
</bold> corresponds to (3) with the coupling matrix <bold>&#x3a9;</bold>, which was obtained by means of the RIS design (see (4) and so on). Thus, the noise immunity and spectrum efficiency evaluations are completed (in the average sense) and it can provide the &#x201c;order&#x201d; of certain figures to &#x201c;backup&#x201d; further simulation results.</p>
<p>Finally, to illustrate whether the presented method can be considered as &#x201c;prospective,&#x201d; one can obtain upper boundaries for BER (<italic>P</italic>
<sub>
<italic>err</italic>
</sub>) and BPCU (see <xref ref-type="bibr" rid="B3">Ding et al., 2022</xref>; the bit rate achieved for channel use) for the GKCM Gaussian equivalent channel for the MIMO- RIS-NOMA system.</p>
<p>Assuming average SNR, as shown in <xref ref-type="bibr" rid="B10">Kontorovich (2022</xref>): <inline-formula id="inf13">
<mml:math id="m26">
<mml:mrow>
<mml:mover accent="true">
<mml:msup>
<mml:mi>h</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:math>
</inline-formula> as 12&#x2013;15&#xa0;dB, R/C close to 1 (for prospective 6G), and applying (9), it is easy to obtain an average <italic>P</italic>
<sub>
<italic>err</italic>
</sub> less than 10<sup>&#x2013;2</sup> and BPCU more than 20, which is rather optimistic.</p>
</sec>
<sec sec-type="conclusion" id="s5">
<title>5 Conclusion</title>
<p>The presented material might be a prospective paradigm for MIMO-NOMA RIS design transmission systems, based on the original ideas published previously (<xref ref-type="bibr" rid="B9">Kennedy, 1969</xref>; <xref ref-type="bibr" rid="B2">Alcocer-Ochoa et al., 2006</xref>; <xref ref-type="bibr" rid="B11">Kontorovich et al., 2008</xref>; <xref ref-type="bibr" rid="B12">Parra-Michel et al., 2009</xref>. Proposed solutions for RIS design are mainly based on the RIS reflectors &#x201c;tuning&#x201d; to the propagation scenario, with one exception found in <xref ref-type="bibr" rid="B14">Yigit et al. (2022</xref>), but it seems completely different compared to this material. The approach presented previously provides an artificially &#x201c;created&#x201d; MIMO channel for the successful final separation of the NOMA users at the receiving terminal of the MIMO system.</p>
</sec>
</body>
<back>
<sec sec-type="data-availability" id="s6">
<title>Data availability statement</title>
<p>The original contributions presented in the study are included in the article/Supplementary Material; further inquiries can be directed to the corresponding author.</p>
</sec>
<sec id="s7">
<title>Author contributions</title>
<p>The author listed has made substantial, direct, and intellectual contributions to the work and approved it for publication.</p>
</sec>
<ack>
<p>The author is deeply grateful to Fernando Ramos-Alarcon for his help in the preparation of this material.</p>
</ack>
<sec sec-type="COI-statement" id="s8">
<title>Conflict of interest</title>
<p>The author declares that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="disclaimer" id="s9">
<title>Publisher&#x2019;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<fn-group>
<fn id="fn1">
<label>1</label>
<p>See <xref ref-type="bibr" rid="B3">Ding et al. (2022</xref>), MIMO-RIS-NOMA can be considered when each node is equipped with multiple antennas, or there are multiple RISs; see <xref ref-type="bibr" rid="B1">Abrardo et al. (2021</xref>) for an example.</p>
</fn>
</fn-group>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Abrardo</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Dardari</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Renzo</surname>
<given-names>M. D.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>MIMO interference channels assisted by reconfigurable Intelligent Surfaces: Mutual coupling aware sum-rate optimization based on a mutual impedance channel model</article-title>. <source>IEEE WC Lett.</source> <volume>10</volume>, <fpage>2024</fpage>&#x2013;<lpage>2029</lpage>. <pub-id pub-id-type="doi">10.1109/LWC.2021.3109017</pub-id>
</citation>
</ref>
<ref id="B2">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Alcocer-Ochoa</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Parra-Michel</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Kontorovich</surname>
<given-names>V.</given-names>
</name>
</person-group> (<year>2006</year>). <source>A MIMO channel simulator applying the Universal Basis</source>. <publisher-loc>Montreal, QC</publisher-loc>: <publisher-name>IEEE VTC Fall 2006</publisher-name>.</citation>
</ref>
<ref id="B3">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Ding</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Lu</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Fang</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Dobre</surname>
<given-names>O. A.</given-names>
</name>
<name>
<surname>Karagiannidis</surname>
<given-names>G. K.</given-names>
</name>
<name>
<surname>Al-Dhahir</surname>
<given-names>N.</given-names>
</name>
<etal/>
</person-group> (<year>2022</year>). &#x201c;<article-title>State-of-the-art survey on reconfigurable intelligent surface-assisted non-orthogonal multiple access networks</article-title>,&#x201d; in <conf-name>Proceedings of the IEEE (Early Access)</conf-name>, <conf-date>May, 2022</conf-date> (<publisher-name>IEEE</publisher-name>) <volume>110</volume> (<issue>9</issue>), <fpage>1358</fpage>&#x2013;<lpage>1379</lpage>. <pub-id pub-id-type="doi">10.1109/JPROC.2022.3174140</pub-id>
</citation>
</ref>
<ref id="B4">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Do</surname>
<given-names>T. N.</given-names>
</name>
<name>
<surname>Kaddoum</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Nguyen</surname>
<given-names>T. L.</given-names>
</name>
<name>
<surname>da Costa</surname>
<given-names>D. B.</given-names>
</name>
<name>
<surname>Hass</surname>
<given-names>Z. J.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Multi-RIS aided wireless systems: Statistical characterization and performance analysis</article-title>. <source>IEEE Trans. Commun.</source> <volume>69</volume> (<issue>12</issue>), <fpage>8641</fpage>&#x2013;<lpage>8658</lpage>. <pub-id pub-id-type="doi">10.48550/arXiv.2104.01912</pub-id>
</citation>
</ref>
<ref id="B5">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hou</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Song</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Sun</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Hanzo</surname>
<given-names>L.</given-names>
</name>
<etal/>
</person-group> (<year>2019</year>). <article-title>Reconfigurable intelligent surface aided NOMA networks</article-title>. <comment>arXiv:1912.10044v1</comment>.</citation>
</ref>
<ref id="B6">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hou</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Song</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Sun</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>MIMO-NOMA networks relying on reconfigurable intelligent surface: A signal cancellation based design</article-title>. <comment>arXiv 2003.o2.117</comment>. <pub-id pub-id-type="doi">10.1109/TCOMM.2020.3018179</pub-id>
</citation>
</ref>
<ref id="B7">
<citation citation-type="book">
<collab>IEEE Staff</collab> (<year>2022</year>). <source>Ieee int. Conference on sensing, communication and networking; workshop</source>. <publisher-name>IEEE</publisher-name>.</citation>
</ref>
<ref id="B8">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Imene</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Ajib</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Zhu</surname>
<given-names>W. P.</given-names>
</name>
<name>
<surname>Renzo</surname>
<given-names>M. D.</given-names>
</name>
</person-group> (<year>2022</year>). &#x201c;<article-title>Performance evaluation and diversity analysis of RIS-Assisted communications over generalized fading channels in the presence of phase noise</article-title>,&#x201d; in <conf-name>IEEE Open Journal of the Communications Society</conf-name>, <conf-date>March, 2022</conf-date> (<publisher-name>IEEE</publisher-name>) <volume>3</volume>, <fpage>593</fpage>&#x2013;<lpage>607</lpage>. <pub-id pub-id-type="doi">10.1109/OJCOMS.2022.3160722</pub-id>
</citation>
</ref>
<ref id="B9">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Kennedy</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>1969</year>). <source>Fading dispersive communication channels&#x201d;</source>. <publisher-loc>New York, NY</publisher-loc>: <publisher-name>John Wiley and Sons</publisher-name>.</citation>
</ref>
<ref id="B10">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kontorovich</surname>
<given-names>V.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Comments on SIC design for SISO-NOMA systems over doubly selective channels</article-title>. <source>IEEE open J. VT</source> <volume>3</volume>, <fpage>111</fpage>&#x2013;<lpage>119</lpage>. <pub-id pub-id-type="doi">10.1109/ojvt.2022.3162136</pub-id>
</citation>
</ref>
<ref id="B11">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kontorovich</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Primak</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Alcocer-Ochoa</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Parra-Michel</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>2008</year>). <article-title>MIMO channel orthogonalisations applying universal eigenbasis</article-title>. <source>IET signal Process.</source> <volume>2</volume> (<issue>2</issue>), <fpage>87</fpage>&#x2013;<lpage>96</lpage>. <pub-id pub-id-type="doi">10.1049/iet-spr:20070126</pub-id>
</citation>
</ref>
<ref id="B12">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Parra-Michel</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Alcocer-Ochoa</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Sanchez-Hernandez</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Kontorovich</surname>
<given-names>V.</given-names>
</name>
</person-group> (<year>2009</year>). &#x201c;<article-title>MIMO modeling and simulation</article-title>,&#x201d; in <source>Recent advances in signal processing</source> (<publisher-loc>London, United Kingdom</publisher-loc>: <publisher-name>Intechopen</publisher-name>).</citation>
</ref>
<ref id="B13">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yang</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Xinyue</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Liang</surname>
<given-names>Y. C.</given-names>
</name>
<name>
<surname>Renzo</surname>
<given-names>M. D.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Reconfigurable intelligent surface-assisted non-orthogonal multiple access</article-title>. <source>IEEE Trans. WC</source> <volume>20</volume> (<issue>5</issue>), <fpage>3137</fpage>&#x2013;<lpage>3151</lpage>. <pub-id pub-id-type="doi">10.1109/twc.2020.3047632</pub-id>
</citation>
</ref>
<ref id="B14">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yigit</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Basar</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Altunbas</surname>
<given-names>I.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Over-the-Air beamforming with reconfigurable intelligent surfaces</article-title>. <source>Front. Commun. Netw.</source> <volume>3</volume>, <fpage>1016270</fpage>. <pub-id pub-id-type="doi">10.3389/frcmn.2022.1016270</pub-id>
</citation>
</ref>
</ref-list>
</back>
</article>