This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Cooperative 3D Beamforming for Small-Cell and Cell-Free 6G Systems

Sarath Gopi, Sheetal Kalyani, and Lajos Hanzo, Fellow, IEEE
Abstract

Three dimensional (3D) resource reuse is an important design requirement for the prospective sixth generation (6G) wireless communication systems. Hence, we propose a cooperative 3D beamformer for use in 3D space. Explicitly, we harness multiple base station antennas for joint zero forcing transmit pre-coding for beaming the transmit signals in specific 3D directions. The technique advocated is judiciously configured for use in both cell-based and cell-free wireless architectures. We evaluate the performance of the proposed scheme using the metric of Volumetric Spectral Efficiency (VSE). We also characterized the performance of the scheme in terms of its spectral efficiency (SE) and Bit Error Rate (BER) through extensive simulation studies.

I Introduction

Industrial as well as academic research groups and standard bodies have embarked on studying the technical requirements of 6G systems. In contrast to 5G, 6G is expected to connect “intelligence", rather than just “things", while satisfying more stringent energy efficiency, latency and rate targets. Diverse technologies, such as Terahertz solutions, cell free massive multiple input multiple output (MIMO), 3D spatial modulation as well as the Internet of “nano and bio things", have been recommended for use in 6G systems [1, 2, 3, 4, 5].

Given the recent advances of non-terrestrial communication relying on unmanned aerial vehicles (UAVs) such as drones, airships and balloons, 6G is expected to harness them for enhancing both the coverage quality and capacity [6, 7, 8, 9]. Explicitly, when mmWave and Terahertz frequencies are used, only Line-of-Sight (LOS) communication is feasible owing to the high probability of blockage. Hence, the assistance of UAVs will become inevitable to provide services to users, where conventional terrestrial network is unavailable. These UAVs may play the role of both user equipment (UE) and of aerial base stations (BS). These air-born UEs coexist with terrestrial ground users and are often termed as cellular-connected UAVs, which have been harnessed in applications such as remote sensing [10, 11], package delivery [12], surveillance [13] etc. A direct consequence of this new paradigm is that the UEs and BSs are going to co-exist in 3D space, where many of these have to engage in simultaneous communications.

Therefore, in 6G systems, the provision of services for aerial users at different altitude is also expected to become a requirement. In this context, both the volumetric spectral-efficiency and energy-efficiency become important performance metrics. Hence, the 3D reuse of communication resources is expected to become an important differentiator between 5G and 6G [14]. In support of the associated 3D resource allocation, we propose a novel 3D beamforming technique, which is capable of beneficially focussing the transmit signal in 3D space so that the spectral resources can be efficiently reused without excessive interference. Even though the authors of [15, 8] and a few other references do indeed allude to 3D cellular structure, they do not recommend specific solutions for transmission to two or more users, who have the same angular locations with respect to a base station antenna using the same resources such as frequency, time, code etc. Our proposal is the first step towards this. Explicitly, this is a transmit precoding technique, which may be combined with other techniques envisaged for meeting the challenging requirements of 6G systems [16].

Our Scheme [8] [17] [18] [19] [20]
3D Model \checkmark \checkmark \checkmark
3D Beamforming \checkmark \checkmark \checkmark
3D Spatial Utilization \checkmark
Channel unaware precoding \checkmark
Cellular (CL)/Cell-free Both CL CL CL Both
Rician channel \checkmark
Theoretical Volume Spectral SINR,
expressions Efficiency (VSE) Latency BER VSE
TABLE I: Contrasting the proposed scheme to the existing solutions.

A typical communication scenario showing the differences between the proposed beamforming techniques and the conventional 2D and 3D beamforming is portrayed in Fig 1, where:

  • The UEs UE1UE1, UE2UE2 and UE5UE5 are terrestrial users, while UE3UE3 and UE4UE4 are aerial users.

  • With respect to the antenna array (AA) A1A1, the UEs UE1UE1, UE3UE3 and UE5UE5 have the same azimuth angle, while UE2UE2 and UE4UE4 are located at a different, but between them identical azimuth angle. Hence, even a conventional 2D beamformer will be able to distinguish UE1UE1, UE3UE3 and UE5UE5 from UE2UE2 and UE4UE4.

  • However, simultaneous communication with UE1UE1, UE3UE3 and UE5UE5 is not possible using a 2D beamformer based precoder. Similar statement is valid for UE2UE2 and UE4UE4.

  • UE1UE1 and UE3UE3 have the same elevation angle with respect to AA A1A1, which is however different from that of UE5UE5. Hence, a 3D beamformer [21, 22, 17, 23], which jointly uses the elevation angle along with the azimuth angle for precoding is indeed capable of distinguishing UE5UE5 from UE1UE1 and UE3UE3.

  • However, the pairs UE1UE1 and UE3UE3, and UE2UE2 and UE4UE4 cannot be differentiated even using only 3D beamformer, since they have the same elevation and azimuth angles with respect to AA A1A1.

Hence, we propose cooperative bamforming, which exploits a pair of AAs, namely A1A1 and A2A2 seen at the right of Fig. 1 so that each fraction of the 3D space can be uniquely targeted. Therefore, all five UEs of Fig. 1 can simultaneously communicate using cooperative 3D beamforming.

Refer to caption
Figure 1: Difference between conventional 2D & 3D beamformer and the proposed cooperative 3D beamformer.

In addition to the UAV assisted scenario of Fig.1, the proposed scheme may also be readily used for supporting Internet of Things (IoT). The evolution of IoT extended the application of wireless communications from smartphones and tablets to smart wearable, live health monitoring systems and diverse other sensors, which have new applications in agriculture, water supply and the smart grid [24, 25, 26, 27]. These applications support users in 3D space, especially in dense multi-story buildings of an urban scenario, while requiring a high data rate and ultra-low latency. Hence, our cooperative 3D beamforming technique becomes beneficial in such a scenario.

A compelling technology for next generation wireless communication systems is constituted by massive multiple-input multiple-output (Massive MIMO) systems, where both the base station and the users have numerous antennas [28, 29], hence exhibiting much improved throughput, energy efficiency, and reduced interference [30]. We can have either co-located or distributed massive MIMO architectures. It has been shown in [31] that a distributed MIMO scheme achieves better coverage quality than its co-located counterpart owing to its improved diversity gain. A distributed architecture, where the antennas are geographically separated, acts as a MIMO network and it is also termed as a virtual MIMO or distributed antenna system (DAS) [32, 33, 34, 35, 36]. For exploiting the advantages of distributed systems, a cell-free architecture has been proposed in [20, 37] for next generation wireless communication, because it has been shown to outperform the maturing small-cell systems. To weigh up the associated pros and cons, we consider our proposed scheme in both small-cell and cell-free architectures.

Our main contributions are:

  • We propose a cooperative 3D beamforming (CBF) technique, relying on position based transmit beamforming (PBTBF). As demonstrated in Fig. 1, this is quite different from the conventional 3D cooperative beamforming, where a single AA is used for forming a sharp transmit beam in some specific azimuth and elevation angle pair [18, 38, 39, 40]. We may also refer to our cooperative 3D beamforming scheme as joint transmit precoding (TPC) relying on a pair of AAs to focus the transmit signal into the specified 3D region and thereby to assist in simultaneously serving the user in any 3D space, which is one of the 6G design requirements. Since 6G itself is in its planning phase, we believe that our proposal is the first of its kind.

  • We exploit the metric termed as the average Volumetric Spectral Efficiency (VSE) for quantifying the performance of the proposed scheme. Explicitly, the VSE is defined as the sum of the maximum average number of bps/Hz/km3km^{3} [19]. This is the 3D dual pair of the average Area Spectral Efficiency (ASE) metric of Alouni and Goldsmith [41], which has been widely used as a performance metric in terrestrial communication [42, 43, 44, 45]. Similarly to the 2D ASE of conventional cellular systems, the 3D VSE captures the trade-off between the frequency reuse factor and the resultant link quality offered to the users. Hence, it will assist in the optimal allocation of resources in 6G systems.

  • The proposed CBF technique may rely on both collocated AAs and on distributed antennas, hence it is beneficial for both small-cell and cell-free architectures. We demonstrate how to make this 3D resource reuse possible in both cell-free as well as small-cell architectures and study the impact of these architectures in the context of VSE.

  • We derive the mathematical expression for the VSE of the proposed scheme and compare the same with extensive simulation results.

In Table I, we provide a bold summary and contrast our new contributions to the seminal literature. The proposed scheme can also be used both at mmWave and the Terahertz frequencies, hence it is beneficial for 6G systems. A significant advantage of our proposed scheme is that the transmitter does not have to rely on any channel knowledge for pre-coding, rather it simply relies on the user positions. In Section II, we develop the proposed CBF technique. The performance metric VSE is defined and derived in Section III. Our simulation results are detailed in Section IV, and the paper is concluded in Section V.

II Proposed Scheme

The basic idea of the proposed scheme is discussed using Fig. 2. Let us assume having a pair of AAs A1A1 and A2A2, each having MM elements, where A1A1 and A2A2 are separated in 3D space and the users are spatially distributed in 3D all around these AAs. It is assumed that each UE has a single antenna. Let us assume that UE0UE0 is the user of interest, located at the 3D angles of θL0\theta_{L0} and θR0\theta_{R0} with respect AAs A1A1 and A2A2, respectively. Here θL0=(θL0H,θL0V)\theta_{L0}=\left(\theta_{L0}^{H},\theta_{L0}^{V}\right) is the azimuth-elevation angle pair of A1A1 and similarly θR0=(θR0H,θR0V)\theta_{R0}=\left(\theta_{R0}^{H},\theta_{R0}^{V}\right) is that of A2A2. UE0UE0 is shown to be an aerial user in Fig. 2 with XOYX^{\prime}O^{\prime}Y^{\prime} being a horizontal plane parallel to the ground plane XOYXOY. We consider the case, where there are many interferers and these can be located anywhere in space. However, we specifically consider the pair of interferers UE1UE1 and UE2UE2 in Fig. 2. Here, UE1UE1 has the same 3D angle as that of UE0UE0, i.e., θL0\theta_{L0} with respect to A1A1, whereas the 3D angle of UE2UE2 with respect to A2A2 is θR0\theta_{R0}, which is the same as that of UE0UE0. Hence, a conventional 3D beamformer using either A1A1 or A2A2 fails to simultaneously communicate with these three users. However, the interference emanating from users, who do not have the same 3D angle as that of the desired user can be readily eliminated using conventional 3D beamforming or zero-forcing TPC by a single AA [46, 47, 48, 49]. For example, in Fig. 2 transmission to both UE1UE1 and UE0UE0 can be arranged simultaneously using conventional 3D beamforming at AA A2A2. However, our 3D CBF technique is required for simultaneous transmission to all of UE0UE0, UE1UE1 and UE2UE2 in Fig.2.

In order to elaborate further on the proposed 3D CBF scheme, we make the following assumptions:

  1. a1)

    Each AA knows the locations of the other AA and all users. Furthermore, they know the information to be transmitted to the user.

  2. a2)

    Perfect synchronization exists between two AAs.

  3. a3)

    Each user has the perfect knowledge of its channel spanning from both AAs. Note that this is a common requirement of any coherent communication system. Existing techniques may be adopted for channel estimation [50]. However, note that only the user needs the channel information for decoding, whereas the AAs only require location information for precoding.

  4. a4)

    A strong line-of-sight (LOS) path exists between each and every user, hence we have Rician channels between the AA and the user.

Note that the above assumptions may indeed be satisfied in practise. For example, a base station controlling the two antenna arrays can share information among them and synchronize them. A fibre link between the AAs can also be used to achieve this. In any communication system, the channel information is essential for detecting the symbols and can be acquired by channel estimation. However, in our case, the users have to estimate two channels, namely between themselves and the pair of AAs. Finally, it is widely recognized that a strong LOS path is necessary for reliable communication at mmWave and Terahertz frequencies [51, 52, 2]. In the proposed scheme, we use antenna arrays to form beams towards the user and thereby rely on a LOS path. Let us now detail the proposed 3D CBF scheme.

Refer to caption
Figure 2: The 3D geometry considered.

Let s0s_{0} be the desired signal to be transmitted to UE0UE0. Let us assume furthermore that this signal is transmitted from both AAs A1A1 and A2A2 by the TPC vector 𝐞0{\mathbf{e}}_{0} of dimension M×1M\times 1. The channel between A1A1 and UE0UE0 is denoted by 𝐡L0{\mathbf{h}}_{L0} and that between A2A2 and UE0UE0 as 𝐡R0{\mathbf{h}}_{R0}. Note that the dimension of the channel vectors is M×1M\times 1. As stated in assumption (a4), both 𝐡L0{\mathbf{h}}_{L0} and 𝐡R0{\mathbf{h}}_{R0} are represented by Rician channels. Then the signal received at UE0UE0 in the absence of any other user is given by:

y0=(𝐡L0+𝐡R0)H𝐞0s0+w0.\displaystyle y_{0}=\left({\mathbf{h}}_{L0}+{\mathbf{h}}_{R0}\right)^{H}{\mathbf{e}}_{0}s_{0}+w_{0}. (1)

Let us assume that there are NN interferers, with sn,1nNs_{n},1\leq n\leq N being the symbols to be transmitted to the nthn^{th} UEUE and let 𝐞n{\mathbf{e}}_{n} be the corresponding TPC vector. Hence, the received signal of UE0UE0 is given by:

y0=(𝐡L0+𝐡R0)H(n=0N𝐞nsn)+w0,\displaystyle y_{0}=\left({\mathbf{h}}_{L0}+{\mathbf{h}}_{R0}\right)^{H}\left(\sum_{n=0}^{N}{\mathbf{e}}_{n}s_{n}\right)+w_{0}, (2)

where n=0n=0 corresponds to the terms related to the desired user and w0𝒞𝒩(0,σ2)w_{0}\sim{\mathcal{CN}}(0,\sigma^{2}) is the AWGN component. Let 𝐞Ln{\mathbf{e}}_{Ln} and 𝐞Rn{\mathbf{e}}_{Rn} represent the position-based steering vectors of the nthn^{th} UE with respect to AAs A1A1 and A2A2, respectively. Explicitly, 𝐞Ln{\mathbf{e}}_{Ln} and 𝐞Rn{\mathbf{e}}_{Rn} are M×1M\times 1 vectors, whose ithi^{th} entry is of the form exp[j2πλ(xiψnx+yiψny+ziψnz)]exp\left[j\frac{2\pi}{\lambda}\left(x_{i}\psi_{n}^{x}+y_{i}\psi_{n}^{y}+z_{i}\psi_{n}^{z}\right)\right]. Here, for 𝐞Ln{\mathbf{e}}_{Ln}, we have ψnx=sinθLnVcosθLnH\psi_{n}^{x}=\sin\theta_{Ln}^{V}\cos\theta_{Ln}^{H}, ψny=sinθLnVsinθLnH\psi_{n}^{y}=\sin\theta_{Ln}^{V}\sin\theta_{Ln}^{H} and ψnz=cosθLnV\psi_{n}^{z}=\cos\theta_{Ln}^{V}. Similarly, for 𝐞Rn{\mathbf{e}}_{Rn}, the corresponding values are ψnx=sinθRnVcosθRnH\psi_{n}^{x}=\sin\theta_{Rn}^{V}\cos\theta_{Rn}^{H}, ψny=sinθRnVsinθRnH\psi_{n}^{y}=\sin\theta_{Rn}^{V}\sin\theta_{Rn}^{H} and ψnz=cosθRnV\psi_{n}^{z}=\cos\theta_{Rn}^{V}, where (xi,yi,zi)(x_{i},y_{i},z_{i}) represents the corresponding coordinate of the ithi^{th} element in A1A1 and A2A2 respectively, for 𝐞Ln{\mathbf{e}}_{Ln} and 𝐞Rn{\mathbf{e}}_{Rn}. Therefore, 𝐡L0{\mathbf{h}}_{L0} and 𝐡R0{\mathbf{h}}_{R0} can be written under the Rician channel model as [53]:

𝐡L0=KK+1𝐞L0+1K+1𝐡L\displaystyle{\mathbf{h}}_{L0}=\sqrt{\frac{K}{K+1}}{\mathbf{e}}_{L0}+\sqrt{\frac{1}{K+1}}{\mathbf{h}}_{L} (3)

and

𝐡R0=KK+1𝐞R0+1K+1𝐡R,\displaystyle{\mathbf{h}}_{R0}=\sqrt{\frac{K}{K+1}}{\mathbf{e}}_{R0}+\sqrt{\frac{1}{K+1}}{\mathbf{h}}_{R}, (4)

where the first term at the RHS of (3) and (4) is the LOS component, while 𝐡L{\mathbf{h}}_{L} and 𝐡R{\mathbf{h}}_{R} represent the nonLOS components. Furthermore it is assumed that each entry of 𝐡L{\mathbf{h}}_{L} and 𝐡R{\mathbf{h}}_{R} is an i.i.d zero mean complex Gaussian random variable. Let 𝐡0=𝐡L0+𝐡R0{\mathbf{h}}_{0}={\mathbf{h}}_{L0}+{\mathbf{h}}_{R0}. We need to find out a precoding vector such that users in each 3D locations are uniquely communicated from the BS. Explicitly, this is an interference cancellation problem, for which we are proposing the following different solutions.

II-A Proposed Solutions

II-A1 Zero Forcing Precoder (ZFP)

In the zero forcing precoder, we propose to select the position-based joint TPC (JTPC) vector 𝐞0{\mathbf{e}}_{0} as the solution of the following optimization problem.

min𝐞0\displaystyle\underset{{\mathbf{e}}_{0}}{\min}~{} 𝐞0(𝐞L0+𝐞R0)2\displaystyle\|{\mathbf{e}}_{0}-\left({\mathbf{e}}_{L0}+{\mathbf{e}}_{R0}\right)\|^{2}~{}
such that 𝐞0H(𝐞Ln+𝐞Rn)=0\displaystyle{\mathbf{e}}_{0}^{H}\left({\mathbf{e}}_{Ln}+{\mathbf{e}}_{Rn}\right)=0
for each interferern=1,2,,N.\displaystyle~{}~{}~{}~{}~{}~{}\text{for each interferer}~{}n=1,2,...,N. (5)

The solution of (5) is [54, pp. 169]:

𝐞0=(𝐄0(𝐄0H𝐄0)1𝐄0H)(𝐞L0+𝐞R0),\displaystyle{\mathbf{e}}_{0}=\left({\mathcal{I}}-{\mathbf{E}}_{0}\left({\mathbf{E}}_{0}^{H}{\mathbf{E}}_{0}\right)^{-1}{\mathbf{E}}_{0}^{H}\right)\left({\mathbf{e}}_{L0}+{\mathbf{e}}_{R0}\right), (6)

where 𝐄0{\mathbf{E}}_{0} is the matrix whose columns are (𝐞Ln+𝐞Rn),n=1,,N\left({\mathbf{e}}_{Ln}+{\mathbf{e}}_{Rn}\right),n=1,...,N. Note that the solution of (5) is the zero-forcing JTPC vector for the space spanned by (𝐞L0+𝐞R0)\left({\mathbf{e}}_{L0}+{\mathbf{e}}_{R0}\right), whose response is zero in the space spanned by (𝐞Ln+𝐞Rn)\left({\mathbf{e}}_{Ln}+{\mathbf{e}}_{Rn}\right) for n0n\neq 0. Similarly, the JTPC vector for each user may also be readily computed. Note that the JTPC vector 𝐞0{\mathbf{e}}_{0} of (6) completely cancels the contributions of all LOS components of the interferers.

Additional derivative constraints can be added to (5) in order to make the solution robust against position errors [54, 3.7.2]. Explicitly, we add the following first-order derivative constraints:

𝐞¯na=θna(𝐞Ln+𝐞Rn)\displaystyle\bar{{\mathbf{e}}}_{n}^{a}=\frac{\partial}{\partial\theta_{n}^{a}}\left({\mathbf{e}}_{Ln}+{\mathbf{e}}_{Rn}\right) =0,n=0,1,,N\displaystyle=0,~{}n=0,1,...,N
𝐞¯nz=θnz(𝐞Ln+𝐞Rn)\displaystyle\bar{{\mathbf{e}}}_{n}^{z}=\frac{\partial}{\partial\theta_{n}^{z}}\left({\mathbf{e}}_{Ln}+{\mathbf{e}}_{Rn}\right) =0,n=0,1,,N.\displaystyle=0,~{}n=0,1,...,N. (7)

The solution will have the same form as that of (6), except that 𝐄0{\mathbf{E}}_{0} is replaced by 𝐄^0\hat{\mathbf{E}}_{0}, where 𝐄^0=𝐄0{𝐞¯0a𝐞¯0z}\hat{\mathbf{E}}_{0}={\mathbf{E}}_{0}\cup\{\bar{{\mathbf{e}}}_{0}^{a}~{}\bar{{\mathbf{e}}}_{0}^{z}\}. We name this solution as ZFP-D. Note that adding these additional constraints may result in degrading the condition number of (𝐄^0H𝐄^0)\left(\hat{\mathbf{E}}_{0}^{H}\hat{\mathbf{E}}_{0}\right), if the number of antenna elements is not sufficient. In such a case, the particular singular value decomposition (SVD) based scheme may be adopted to determine the inverse of (𝐄^0H𝐄^0)1\left(\hat{\mathbf{E}}_{0}^{H}\hat{\mathbf{E}}_{0}\right)^{-1} [55, pp. 423].

II-A2 Minimum Power Distortionless Response (MPDR) Precoder

Another precoding solution could be based on the MPDR beamformer, where the total output power is minimized subject to a distortionless constraint [54]. Mathematically, it is given as:

min𝐞0𝐞0H𝐄~02such that𝐞0H(𝐞L0+𝐞R0)=𝟏,\displaystyle\underset{{\mathbf{e}}_{0}}{\min}~{}\|{\mathbf{e}}_{0}^{H}\tilde{\mathbf{E}}_{0}\|^{2}~{}\text{such that}~{}{\mathbf{e}}_{0}^{H}\left({\mathbf{e}}_{L0}+{\mathbf{e}}_{R0}\right)=\bm{1}, (8)

where 𝐄~=𝐄0(𝐞L0+𝐞R0)\tilde{\mathbf{E}}={\mathbf{E}}_{0}\cup\left({\mathbf{e}}_{L0}+{\mathbf{e}}_{R0}\right). The precoding vector obtained by solving the optimization problem (8) is [54]:

𝐞0=[𝐄~0𝐄~0H]1(𝐞L0+𝐞R0)(𝐞L0+𝐞R0)H[𝐄~0𝐄~0H]1(𝐞L0+𝐞R0).{\mathbf{e}}_{0}=\frac{\left[\tilde{\mathbf{E}}_{0}\tilde{\mathbf{E}}_{0}^{H}\right]^{-1}\left({\mathbf{e}}_{L0}+{\mathbf{e}}_{R0}\right)}{\left({\mathbf{e}}_{L0}+{\mathbf{e}}_{R0}\right)^{H}\left[\tilde{\mathbf{E}}_{0}\tilde{\mathbf{E}}_{0}^{H}\right]^{-1}\left({\mathbf{e}}_{L0}+{\mathbf{e}}_{R0}\right)}. (9)

However, when the number of antenna elements and users results in an ill conditioned matrix (𝐄~0𝐄~0H)\left(\tilde{\mathbf{E}}_{0}\tilde{\mathbf{E}}_{0}^{H}\right), then the method adopted in [49, (13)] may be used to get (9).

II-B General Case

The channel model of (3) and (4) has the same Rician factor for both the channel impinging from first and second antenna arrays. However, it may indeed happen that they are not the same. In such a scenario, we have the following optimization problem:

min𝐞0\displaystyle\underset{{\mathbf{e}}_{0}}{\min}~{} 𝐞0𝐞L02+𝐞0𝐞R02\displaystyle\|{\mathbf{e}}_{0}-{\mathbf{e}}_{L0}\|^{2}+\|{\mathbf{e}}_{0}-{\mathbf{e}}_{R0}\|^{2}~{}
such that 𝐞0H𝐞Ln=0,n=1,2,,N\displaystyle{\mathbf{e}}_{0}^{H}{\mathbf{e}}_{Ln}=0,~{}n=1,2,...,N
𝐞0H𝐞Rn=0,n=1,2,,N.\displaystyle{\mathbf{e}}_{0}^{H}{\mathbf{e}}_{Rn}=0,~{}n=1,2,...,N. (10)

The solution of (10) will have the same form as that of (6), except that 𝐄0{\mathbf{E}}_{0} is replaced by 𝐄¯0\bar{{\mathbf{E}}}_{0} given below:

𝐄¯0=[𝐞L1𝐞R1𝐞L2𝐞R2𝐞LN𝐞RN].\displaystyle\bar{{\mathbf{E}}}_{0}=\left[{\mathbf{e}}_{L1}~{}{\mathbf{e}}_{R1}~{}{\mathbf{e}}_{L2}~{}{\mathbf{e}}_{R2}~{}...~{}{\mathbf{e}}_{LN}~{}{\mathbf{e}}_{RN}\right]. (11)

Note that in (10), there are (2N)(2N) constraints, whereas in our original problem (5), there are only NN constraints. Hence, when the number of interferers is high, (10) may require more elements in the AAs to find a feasible solution. Therefore, whenever the Rician factors in (3) and (4) are the same, it is better to use the formulation in (5). Now in Section II-C and II-D, the specific small-cell and cell-free scenarios are discussed.

II-C Small-Cell Architecture

In small-cell based systems, the AAs A1A1 and A2A2 of Fig. 2 can be a pair of cooperating BSs, each equipped with MM-element AAs. However, the concept is not restricted to a twin BS configurations, it can also work for more complex BS configurations. For example, a single BS having two antennas, which are sufficiently separated can also be used. Another option is to have a single transmit antenna cooperating with a pair of Reconfigurable Intelligent Surfaces (RIS) controlled by a BS. Explicitly, a RIS is an array of passive reflecting elements relying on low-complexity integrated electronics for introducing a beneficial phase shift to the incident waves [56, 57, 58]. This has been advocated as a low-cost, energy-efficient solution for a diversity of applications [59, 60, 61, 62, 63, 64, 65, 66, 67] and can be used to provide the necessary phase shifts for the proposed scheme.

Fig. 3 shows the example of a 3D cellular structure. The AAs A1A1 and A2A2 are intended to serve a large volume, which can be considered as a 3D macro-cell. The size of the macro-cell is limited by the maximum communication range of the AAs. This is partitioned into many small cells, termed as micro-cells, which are represented using different colours. The specific micro-cells having the same colours use the same resources. Similar to the case of existing cellular networks, the resources are shared by ensuring the same spectral resources are not used in the nearby micro-cells. In Fig. 3, the micro-cells are of cuboid shape, but can be of different shapes, such as hexagonal prisms, truncated octahedrons, rhombic dodecahedrons and so on [15]. The truncated octahedron is the closest approximation of a sphere and the number of polygons required for completely filling the 3D space is known to be the lowest for this particular structure [15, 8]. Finally, as detailed in Section II, by beneficially adjusting the phase shifts in A1A1 and A2A2, any user in the macro-cell can be served with minimal interference from other users exploiting the same resources. For example, the users UE1UE1 and UE2UE2 seen in Fig. 3, who have the same 3D angle as that of the AA A1A1 can be simultaneously served. Similar is the case of UE3UE3 and UE4UE4, which are located in the same cone of AA A2A2.

Refer to caption
Figure 3: Proposed architecture for small-cell system.

II-D Cell-Free Architecture

We model our cell-free architecture as shown in Fig. 4, which is based on the one proposed in [20] subject to some changes. In contrast to the small-cell based architecture, here the elements of the antenna arrays A1A1 and A2A2 are distributed throughout the cells. Specifically, the access points (APs) in Fig. 4 act as the elements in A1A1 and A2A2. In contrast to [20], the proposed cell-free architecture has the following differences.

  • There are two Central Processing Units (CPU), one supporting each of the distributed antenna arrays A1A1 and A2A2.

  • The antenna at the APs has more than one element. In principle, the spacing between the elements in an AA should be arranged to be less than or equal to half the wavelength of the maximum operating frequency. This condition avoids grating lobes, hence pointing the signal in the desired direction [54]. Since the APs host the geometrically separated elements of AAs, their half-wavelength spacing cannot be ensured in the distributed architecture. Hence, it is proposed to use a small AA in each of the APs, where the spacing is fixed to less than or equal to half the wavelength. Hence, in the cell-free architecture, the AAs A1A1 and A2A2 circumvent the grating lobe problem.

Refer to caption
Figure 4: Proposed architecture for cell-free system.

The entire set of APs is partitioned into two groups, each of which is associated with one of the CPUs. Note that the number of APs associated with each CPU can be the same or different. The angle pairs θL\theta_{L} and θR\theta_{R} of the users are defined with respect to the two CPUs. In addition to the users’ location, each AP should know the location of its respective CPU. The phase shifts to be applied at the elements of the AP to the transmit signal are calculated based on the relative positions of the corresponding CPU and the users. The basic principle is the same as that in the small-cell based architecture, except that the distributed APs act as AA A1A1 and A2A2. Note that the flexible selection of two CPUs can be dynamically updated in such a way that the desired user is in the cell-centre, which is one of the key features of cell-free systems. Methods suggested for ensuring this in conventional cell-free applications may be appropriately modified for the proposed scenario, which may form part of our future work.

The cell-free architecture is more suitable for UAV specific applications, since there may be numerous UAVs spread across the volume considered, some of which can act as APs. Now, in Section III, we will first define and then deriving the Volumetric Spectral Efficiency (VSE) of the proposed scheme.

III Volumetric Spectral Efficiency

We define the average VSE as:

VSE=C¯V,\displaystyle VSE=\frac{\bar{C}}{V}, (12)

where C¯=𝔼{log(1+η)}\bar{C}={\mathbb{E}}\{\log\left(1+\eta\right)\} is the average normalized channel capacity per Hertz with η\eta being the Signal to Interference plus Noise Ratio (SINR) and VV is the volume. Note that (12) is similar to the ASE equation [41, (8)], except that the denominator is the volume instead of the area.

Recall that the conventional terrestrial cellular structure tends to rely on perfectly tessellated hexagonal cells, which are often approximated by circles. However, in our case, the base station has to serve users in space. Hence, we propose to extend the circles to the third dimension so that the resultant spherical cellular structure covers the entire 3D user space. Hence, in this case, a BS serves the users spanned in a sphere. This can be considered as a macro-cell. Now, we partition each macro-cell into small spherical micro-cells, where the users in a micro-cell are provided with orthogonal resources. However, the same resource can be shared by the users in different micro-cells of the same macro-cell. This makes it possible to reuse the resources in a macro-cell. Let dd be the diameter of the micro-cell and NRN_{R} be the reuse factor in the small-cell structure. Then the volume VV is:

V=NR43π(d/2)3.\displaystyle V=N_{R}\frac{4}{3}\pi\left(d/2\right)^{3}. (13)

Note that for cell-free architectures, the denominator in (12) should be the volume of the region, where the average capacity C¯\bar{C} is estimated divided by the number of users sharing the same resources in that region. Assuming unity power for the transmitted symbols, the instantaneous SINR can be written from (1) as:

η=Pr𝐡0H𝐞0s02Pr𝐡0Hn=1N𝐞nsn+w02,\displaystyle\eta=\frac{P_{r}\|{\mathbf{h}}_{0}^{H}{\mathbf{e}}_{0}s_{0}\|^{2}}{\|\sqrt{P_{r}}{\mathbf{h}}_{0}^{H}\sum_{n=1}^{N}{\mathbf{e}}_{n}s_{n}+w_{0}\|^{2}}, (14)

where PrP_{r} is the received signal power. We now derive the average channel capacity of the system in Theorem 1 given below.

Theorem 1.

Given that the channel statistics and the desired as well as interfering users’ locations are fixed, the average channel capacity per unit bandwidth for the zero forcing precoding is:

C¯h,u=1log2(log(cσks2)Ei(ks2)+ζ\displaystyle\bar{C}_{h,u}=\frac{1}{\log 2}\left(\log\left(c_{\sigma}k_{s}^{2}\right)-Ei(k_{s}^{2})+\zeta\right.
+ecσks2cσ1cσ1(Ei(cσks2cσ1)Ei(ks2cσ1)))\displaystyle~{}~{}~{}\left.+\frac{e^{-\frac{c_{\sigma}k_{s}^{2}}{c_{\sigma}-1}}}{c_{\sigma}-1}\left(Ei\left(\frac{c_{\sigma}k_{s}^{2}}{c_{\sigma}-1}\right)-Ei\left(\frac{k_{s}^{2}}{c_{\sigma}-1}\right)\right)\right) (15)

where ks=|μs|σsk_{s}=\frac{|\mu_{s}|}{\sigma_{s}} is the ratio of the absolute value of the average signal amplitude and its standard deviation, while cσ=σs2σI2c_{\sigma}=\frac{\sigma_{s}^{2}}{\sigma_{I}^{2}} is the ratio of the variances of the signal and of the interference plus noise components. Furthermore, in (15) are Ei[x]=xett𝑑tEi[x]=-\int_{x}^{\infty}\frac{e^{-t}}{t}dt represents the Exponential integral with ζ0.577\zeta\approx 0.577 being the Euler-Mascheroni constant [68, p. 278].

Proof.

See Appendix A for proof. ∎

Now, we will consider the case, where the transmitted symbols are chosen from an equally likely zero mean constellation. In this case, the channel capacity per unit bandwidth is given in Theorem 2 below.

Theorem 2.

When the transmitted symbols are chosen from an equally probable and zero mean constellation, the average channel capacity per unit bandwidth in (15) can be written as:

C¯h,u=cσcσ1log2cσ\displaystyle\bar{C}_{h,u}=\frac{c_{\sigma}}{c_{\sigma}-1}\log_{2}c_{\sigma} (16)
Proof.

See Appendix B for proof. ∎

In a wide range of applications, the transmitted symbols are chosen from an MM-ary QAM constellation, where the conditions of Theorem 2 are satisfied and hence (16) can be used for estimating C¯h,u\bar{C}_{h,u}. Finally, the average capacity per unit bandwidth can be found by integrating (15) or (16) over all possible user and interference locations (uu) and is formulated as:

C¯=C¯h,ufu(u)𝑑u,\displaystyle\bar{C}=\int\bar{C}_{h,u}f_{u}(u)du, (17)

where fu(u)f_{u}(u) is the distribution of the desired and interfering users’ location and C¯h,u\bar{C}_{h,u} is given by either (15) or (16), which is a function of cσ=σs2σI2c_{\sigma}=\frac{\sigma_{s}^{2}}{\sigma_{I}^{2}} with σs2\sigma_{s}^{2} and σI2\sigma_{I}^{2} are given by (36) and (37), respectively. Hence, C¯h,u\bar{C}_{h,u} is a function of the precoding vector 𝐞nn=0,1,,N{\mathbf{e}}_{n}~{}\forall~{}n=0,1,...,N, which inherently depends on the desired user’s and interferers’ locations through the steering vectors 𝐞Ln{\mathbf{e}}_{Ln} and 𝐞Rn{\mathbf{e}}_{Rn}. Therefore, (17) represents a multi-dimensional integral over all the possible desired and interfering user locations. The integral in (17) cannot be solved analytically, but it can be evaluated by using Monte Carlo simulations. Finally, substituting (17) into (12) will give the average VSE of the proposed scheme.

Note that C¯\bar{C} increases with cσc_{\sigma}, which is a measure of the signal to interference plus noise ratio. It becomes clear from (36) and (37) that for each desired user, cσc_{\sigma} increases as a function of its precoding vector magnitude of 0th0^{th} user, i.e., |𝐞0||{\mathbf{e}}_{0}|. However, this will reduce the SINR for another user. Hence, it is best to have equal strength for each users’ precoding vector and this will be maximum, if the steering vectors for each users are orthogonal to each other. The grade of orthogonality between the steering vectors can be readily increased by incorporating more elements into the transmit AAs. Similarly, given the number of elements in the AAs and a specific spatial volume, there is a particular maximum number of users, who can have orthogonal steering vectors. Hence, increasing the number of users to these values will increase the channel’s utility. However, any further increase in the number of users may erode the capacity. In Section IV, the VSE obtained through simulations is compared against the theoretical VSE of (12).

IV Simulation Results

The proposed 3D CBF technique has been evaluated through extensive simulation studies. We characterized these techniques in terms of its average VSE in bps/Hz/km3bps/Hz/km^{3}, its spectral efficiency (SE) in bps/Hzbps/Hz and its Bit Error Rate (BER). Even though the VSE and SE are computed from the same quantity, they have different implications. For example, for a given number of users, the SE is increased as the volume is increased due to the reduction of the interference, while the VSE may increase or decrease. The VSE may be conveniently used for determining the optimal number of users in a given volume or the optimal volume for a given number of users. On the other hand, the SE quantifies the maximum total information rate in a given scenario. Therefore, the SE is useful for comparing two schemes, once the frequency-reuse topology is fixed, whereas the VSE is critical for determining the resource-reuse topology. Fig. 5 and Fig.  6 show the results of the proposed scheme for our small-cell based architecture, whereas Fig. 7-Fig. 9 characterize the cell-free architecture. Finally, in Fig. 11-Fig. 13, we compare the small-cell and cell-free architecture relying on the proposed scheme. The figures are shown for 10610^{6} Monte-Carlo runs, except for the BER plot, where it is 10810^{8}.

We consider a 500m×500m×120m500~{}m\times 500~{}m\times 120~{}m space for all simulation studies. The height is fixed to 120m120~{}m, which is the maximum allowable height for UAVs without any permit in many of the countries [7]. The simulations are carried out at millimeter wave frequencies and the parameters are chosen from [69, 70, 71, 72, 52], which are reproduced below in Table II. The path loss is governed by the equation PL=32.4+20logd+20logfPL=32.4+20\log d+20\log f, where dd is the distance and ff is the carrier frequency in GHzGHz [73]. The transmitter antenna gain is fixed to 10logM10\log M, where MM is the total number of elements in the antenna [74, (6-49)].

Parameter Value
Frequency (GHz)(GHz) 73.573.5
Bandwidth (GHz)(GHz) 55
TxPower (dBm)(dBm) 14.614.6
Other Loss (dB)(dB) 12.712.7
Rx Gain (dBi)(dBi) 2727
Rx NF (dBm)(dBm) 77
Rx Noise (dB)(dB) 76.8-76.8
Modulation 64QAM64QAM
TABLE II: Simulation parameters

We consider a spherical 3D cellular structure for evaluating the performance of the small-cell architecture. The BS’s pair of transmit AAs have been placed at 120m120~{}m height separated by 120m120~{}m distance. Both these AAs have planar layout in the xyx-y plane looking downwards. We considered both 15×1515\times 15 and 30×3030\times 30 AAs. The radius of the micro-cell is varied from 15m15~{}m to 40m40~{}m. The macro-cells are grouped in such a way that two cells sharing the resources are located at least a distance of four times the micro-cell radius. Hence, the number of interfering users is fixed based on the macro-cell radius. The positions of desired user and interferers are randomly selected in the respective micro-cell. However, the azimuth and elevation angles of one of the interferer with respect to AA1AA1 is deliberately made within 202^{0} same as that of the desired user. This is done to highlight the advantage of the proposed scheme over the conventional 3D beamformer. The performance measures are plotted against the cell radius in Fig 5 and Fig. 6.

Refer to caption
Figure 5: Average VSE vs Cell Radius.

Fig. 5 shows the VSE of the system, where the simulation results are compared against the theoretically obtained values. Explicitly, for estimating the theoretical VSE value, we evaluated (19) theoretically and the integral in (17) is evaluated through Monte Carlo runs for various user locations. We have to bear in mind that while estimating the average VSE, the volume should be multiplied by the reuse factor in order to account for the resource reuse. Observe that the values obtained through simulations and those from theory are closely matching. It can be seen that as the cell radius increases, the average VSE decreases. As a further dominant trend, the VSE is improved as the Rician factor (KK) is increased and the general VSE trend versus these parameters are as expected. Similarly, when the number of elements in the BS AA is increased, this improves the interference rejection capability, hence improving the VSE.

Refer to caption
Figure 6: Average SE vs Cell Radius.

In Fig. 6, the average spectral efficiency (SE) in bps/Hzbps/Hz is plotted against the cell radius, which is calculated using (17). The theoretical values are compared against those obtained through the simulations and it can be seen that these values exhibits similar trends. In contrast to the VSE, the SE is increased with cell radius and it is improved both with KK and with the number of elements in the BS AAs. Note that we have approximated a Gaussian mixture distribution using a single Gaussian distribution to derive the theoretical values of VSE and SE. This approximation introduces the gap between the theory and simulations in both Fig. 5 and Fig. 6.

Refer to caption
Figure 7: Average VSE vs No of APs.

Next, the performance of the proposed scheme quantified in the cell-free architecture is considered. The users are randomly located in the 500×500×120m500\times 500\times 120~{}m space specified. Note that here all users have access to all resources. The performance is studied for different number of access points (NA), number of elements per access points (NE) and number of users (NU).

Refer to caption
Figure 8: Average SE vs No of APs.

In Fig. 7, the average VSE is plotted against the NA, whereas the corresponding average SE vs. NA is shown in Fig.  8 for various Rician factors and NE. It can be seen that both the average VSE and the average SE increases with the NA and NE. This is clear from the fact that as either NA or NE increases, the transmission nulls created towards the sources of interferences become deeper, thereby improving the SINR. The average VSE and the average SE have been plotted vs. NU in Fig.  9 and Fig. 10, respectively for the Rician factor of K=10dBK=10~{}dB. The curves are shown for different NA and NE. Observe that the average SE is reduced upon increasing NU, since the SINR is reduced as the number of users is increased. However, in contrast to the average SE, the average VSE initially increases with NU and beyond its maximum it reduces. This is because the reuse factor is increased with NU. Hence, even though the SINR is reduced with NU, the combined effect of the reuse factor and NU results in an increase of the average VSE upto a certain maximum. If however the NU is increased further, the SINR reduction becomes the dominant factor, thereby reducing the average VSE. Similar to the small-cell architecture, a gap can be seen between the theory and simulations in cell-free structure also, which is resulted from the single Gaussian approximation of Gaussian mixture distribution in deriving the theoretical expression.

Refer to caption
Figure 9: Average VSE vs No of Users.
Refer to caption
Figure 10: Average SE vs No of Users.

Fig. 11-Fig. 13 compare the performance of the cell-based and cell-free architectures in the context of the proposed 3D CBF technique vs. Rician factor KK. We consider a pair of 16×1616\times 16 element arrays for the small cell based structure. The radius of the macro-cell is fixed to 20m20~{}m and 30m30~{}m, corresponding to 50 and 20 users, respectively. As for the cell-free architecture, the number of APs is fixed to 16, i.e., NA=32NA=32 so that 16 APs contributing to each of the CPU. Each AP is constituted by a 4×44\times 4-element array, i.e., NE=4×4NE=4\times 4. It may be noted that the array structure of the small-cell configuration as well as of the NANA and NENE in the cell-free configuration are chosen in such a way that the number of elements per antenna is 256 in both cases. As in the case of the small-cell configuration, in cell-free architecture, the number of users (NUNU) is set to 50 and 20. Fig. 11, Fig. 12 and Fig. 13 show the average VSE, average SE and average BER vs. the Rician factor, respectively. It can be seen that the performance of the small-cell based architecture is better than that of the cell-free configuration for all the three parameters. The performance difference between the two architectures can be explained by considering the specific antenna structures. In the small-cell configuration, the elements of each antenna are arranged using half-wave-length spacing. By contrast, for the cell-free configuration, the elements are distributed randomly in space, with separations more than half the wavelength. Hence, in the cell-free case, the beampattern is irregular and may have grating lobes, which decreases the SINR.

Refer to caption
Figure 11: Average VSE vs Rician Factor K (dB). SCSC and CFCF represent small-cell and cell-free configurations, respectively.
Refer to caption
Figure 12: Average SE vs Rician Factor K (dB). SCSC and CFCF represent small-cell and cell-free configurations, respectively.
Refer to caption
Figure 13: BER vs Rician Factor K (dB). SCSC and CFCF represent small-cell and cell-free configurations, respectively.

Fig. 14 compares the performance of various transmit precoding (TPC) schemes detailed in Section II-A,viz. ZFP, ZFP-D and MPDR in small-cell scenarios in terms of the average VSE. It also shows the performance of the TPC schemes in the presence of position estimation errors. The errors in position estimation are introduced by adding zero mean complex Gaussian random variables with 1m1~{}m variance to the actual locations of all users. These erroneous positions are used for deriving the TPC vector. It can be readily seen that among the three schemes, ZFP outperforms the other schemes, when there are no position estimation errors. However, the performance of ZFP-D is more robust against position errors than the other two schemes, where there is less than 25%25\% degradation in average VSE even at 1m1~{}m position errors. The performance of MPDR is worst. This is because, the optimization of the MPDR solution aims for minimizing the interferences, while retaining a distortionless response in the desired direction. By contrast, the other two schemes try to introduce nulls in the known interferers’ directions, which makes them more efficient in terms of interference rejection.

In Fig. 15, the comparison of various schemes and the effect of position errors is shown for cell-free architecture. In contrast to the small-cell architecture, the performance is very sensitive to position errors and the performance degrades to less than 10%10\% with 1m1~{}m position errors. This trend is explained in the last paragraph of this section.

Refer to caption
Figure 14: Comparison of different schemes with and without position errors in small-cell architecture. Er represents error variance in position estimation.
Refer to caption
Figure 15: Comparison of different schemes with and without position errors in cell-free architecture. Er represents error variance in position estimation.

The proposed scheme is compared against the conventional 3D beamformer using a single antenna array for both the small-cell and the cell-free architecture in Fig. 16. It can be seen that for the small-cell architecture, there is a large gap between the proposed and the conventional single antenna array based 3D beamformer, whereas in the cell-free architecture this gap is small. This trend is explained as follows.

In the cell-free architecture, the elements in each antenna array, except for those in the same APs, are randomly located in space at much more than half-wavelength spacing. By contrast, in the small-cell architecture, they are placed exactly at half-wavelength distance. Since, the frequency is inversely proportional to the wavelength, the antenna arrays of the small-cell architecture can be considered to be designed for much lower frequency. It may be noted that the beamwidth of an antenna array is proportional to the ratio of the operating wavelength and the element spacing [54, pp. 47]. In other words, it is proportional to the ratio of the designed and the operating frequencies. In small-cell architectures, the system is operating at the designed frequency itself, whereas in cell-free architecture, it is operating at higher frequency, which makes the beamwidth very narrow in the cell-free case. Because of this very narrow beamwidth, even the scheme using a single antenna array is capable of separating two users, which are as close as 2 degrees in terms of their angular separation. However, this narrow beamwidth makes the performance highly sensitive to the position errors, which causes the degradation in performance in the face of position errors as seen in Fig. 15. The effect of position errors on the performance can be reduced by keeping more elements in the APs and thereby reducing the beamwidth. Note that, in this case, the performance gap between the proposed scheme and the conventional 3D beamformer using a single antenna array will further increase and our scheme will become better and better.

Refer to caption
Figure 16: Comparison of proposed scheme and conventional 3D beamformer using single antenna array with zero-forcing precoding.

V Conclusions

A novel CBF strategy has been proposed for supporting 3D users, which is a 6G system design requirement. The proposed scheme is suitable for numerous applications, especially those related to UAVs and IoT. The proposed technique has been characterized both in small-cell and cell-free wireless topologies. We semi-analytically evaluated the VSE and SE of the proposed scheme and compared them against our simulation results. Furthermore, we also evaluated the BER performance of the proposed scheme. Even though the simulations have been conducted for millimeter wave frequencies, the methodology is readily applicable for Terahertz (THz) frequencies. Furthermore, we compared the VSE of both the cell-free and the small-cell based architectures and observed that the small-cell based architectures attain better VSE. Also, it is less sensitive to position estimation errors.

Again, we have considered zero forcing JTPC relying on a 3D CBF scheme. An advantage of our PBTBF is that the JTPC vector can be easily computed based on the relative positions of UEs as well as BSs and it dispenses with the channel estimation requirements. Hence, this is eminently suitable for UAV based applications, where the UEs and BSs may be in perpetual movement. An interesting future work item may be to consider the mobility aspects of our scheme, where one has to consider the choice of a suitable modulation scheme, optimal movement trajectory to maximize the performance and so on. Another promising future work item is to incorporate the 3D CBF techniques in airplane aided communication systems, which has been proposed as a potential technology for improving the coverage probability of 6G systems [75, 49]. In this case, the minimum safety distance between two airplanes, the cooperation strategy among them and many other questions have to be addressed and will be a challenging problem to consider.

Appendix A Proof of Theorem 1

Under the conditions of Theorem 1, the average capacity per unit bandwidth can be expressed as:

C¯h,u=0log2(1+η)fη(η)𝑑η,\displaystyle\bar{C}_{h,u}=\int_{0}^{\infty}\log_{2}\left(1+\eta\right)f_{\eta}(\eta)d\eta, (18)

where fη(η)f_{\eta}(\eta) is the distribution of η\eta given in Lemma 1 of Appendix C.

Let cσ=σs2σI2c_{\sigma}=\frac{\sigma_{s}^{2}}{\sigma_{I}^{2}}. Now, make a change of variable z=cση+cσz=\frac{c_{\sigma}}{\eta+c_{\sigma}} in (43) and substitute it into (18). Then we will get:

C¯h,u\displaystyle\bar{C}_{h,u} =(1+ks2)log2I,\displaystyle=\frac{\left(1+k_{s}^{2}\right)}{\log 2}I, (19)

where the integral II is:

I\displaystyle I =01log(1cσ+cσz)(1ks21+ks2z)eks2z𝑑z\displaystyle=\int_{0}^{1}\log\left(1-c_{\sigma}+\frac{c_{\sigma}}{z}\right)\left(1-\frac{k_{s}^{2}}{1+k_{s}^{2}}z\right)e^{-k_{s}^{2}z}dz
=I1I2+I3,\displaystyle=I_{1}-I_{2}+I_{3}, (20)

where the terms I1I_{1}, I2I_{2} and I3I_{3} are evaluated below:

I1\displaystyle I_{1} =logcσ01(1ks21+ks2z)eks2z𝑑z\displaystyle=\log c_{\sigma}\int_{0}^{1}\left(1-\frac{k_{s}^{2}}{1+k_{s}^{2}}z\right)e^{-k_{s}^{2}z}dz
=11+ks2logcσ.\displaystyle=\frac{1}{1+k_{s}^{2}}\log c_{\sigma}. (21)

(21) is obtained using integration by parts as:

I2\displaystyle I_{2} =01(1ks21+ks2z)logzeks2zdz\displaystyle=\int_{0}^{1}\left(1-\frac{k_{s}^{2}}{1+k_{s}^{2}}z\right)\log ze^{-k_{s}^{2}z}dz
=(I21I22),\displaystyle=\left(I_{21}-I_{22}\right), (22)

where I21I_{21} is evaluated using [76, (4.331)] and [76, (8.212)] as:

I21\displaystyle I_{21} =01logzeks2zdz=1ks201eks2z1z𝑑z\displaystyle=\int_{0}^{1}\log ze^{-k_{s}^{2}z}dz=\frac{1}{k_{s}^{2}}\int_{0}^{1}\frac{e^{-k_{s}^{2}z}-1}{z}dz
=1ks2(Ei(ks2)logks2ζ).\displaystyle=\frac{1}{k_{s}^{2}}\left(Ei(-k_{s}^{2})-\log k_{s}^{2}-\zeta\right). (23)

Now I22I_{22} is obtained using integration by parts considering zlogzz\log z as the first term and is given below:

I22\displaystyle I_{22} =ks21+ks201zlogzeks2zdz\displaystyle=\frac{k_{s}^{2}}{1+k_{s}^{2}}\int_{0}^{1}z\log ze^{-k_{s}^{2}z}dz
=1ks2(1+ks2)(1eks2)+11+ks2I21.\displaystyle=\frac{1}{k_{s}^{2}\left(1+k_{s}^{2}\right)}\left(1-e^{-k_{s}^{2}}\right)+\frac{1}{1+k_{s}^{2}}I_{21}. (24)

Hence,

I2=1(1+ks2)(Ei(ks2)logks2ζ)(1eks2)ks2(1+ks2).\displaystyle I_{2}=\frac{1}{\left(1+k_{s}^{2}\right)}\left(Ei(-k_{s}^{2})-\log k_{s}^{2}-\zeta\right)-\frac{\left(1-e^{-k_{s}^{2}}\right)}{k_{s}^{2}\left(1+k_{s}^{2}\right)}. (25)

Now, I3I_{3} can be found out as follows:

I3\displaystyle I_{3} =01log(1+(1cσ)zcσ)(1ks21+ks2z)eks2z𝑑z\displaystyle=\int_{0}^{1}\log\left(1+\frac{\left(1-c_{\sigma}\right)z}{c_{\sigma}}\right)\left(1-\frac{k_{s}^{2}}{1+k_{s}^{2}}z\right)e^{-k_{s}^{2}z}dz
=01n=1(1)n1n((1cσ)zcσ)n(1ks21+ks2z)eks2zdz\displaystyle=\int_{0}^{1}\sum_{n=1}^{\infty}\frac{(-1)^{n-1}}{n}\left(\frac{\left(1-c_{\sigma}\right)z}{c_{\sigma}}\right)^{n}\left(1-\frac{k_{s}^{2}}{1+k_{s}^{2}}z\right)e^{-k_{s}^{2}z}dz
=n=11n(1)n1(1cσcσ)n(I31ks21+ks2I32).\displaystyle=\sum_{n=1}^{\infty}\frac{1}{n}(-1)^{n-1}\left(\frac{1-c_{\sigma}}{c_{\sigma}}\right)^{n}\left(I_{31}-\frac{k_{s}^{2}}{1+k_{s}^{2}}I_{32}\right). (26)

(26) is obtained changing the order of summation and integration and rearranging the terms. Now, the integrals I31I_{31} is obtained using [76, (3.351)] as:

I31\displaystyle I_{31} =01zneks2z𝑑z\displaystyle=\int_{0}^{1}z^{n}e^{-k_{s}^{2}z}dz
=(ks2)(n+1)γ(n+1,ks2),\displaystyle=\left(k_{s}^{2}\right)^{-(n+1)}\gamma\left(n+1,k_{s}^{2}\right), (27)

where γ(.,.)\gamma(.,.) is the incomplete Gamma function. Similarly I32I_{32} can also be obtained. Now combining I31I_{31} and I32I_{32} and using the relation γ(s+1,x)=sγ(s,x)xsex\gamma\left(s+1,x\right)=s\gamma(s,x)-x^{s}e^{-x} [76, (8.356(1))], I3I_{3} can be simplified as:

I3\displaystyle I_{3} =n=11n(1)n1(1cσcσ)n(ks2)(n+1)(γ(n+1,ks2)\displaystyle=\sum_{n=1}^{\infty}\frac{1}{n}(-1)^{n-1}\left(\frac{1-c_{\sigma}}{c_{\sigma}}\right)^{n}\left(k_{s}^{2}\right)^{-(n+1)}\left(\gamma\left(n+1,k_{s}^{2}\right)\right.
n+11+ks2γ(n+1,ks2)+(ks2)n+11+ks2eks2)\displaystyle~{}~{}~{}~{}~{}~{}\left.-\frac{n+1}{1+k_{s}^{2}}\gamma\left(n+1,k_{s}^{2}\right)+\frac{\left(k_{s}^{2}\right)^{n+1}}{1+k_{s}^{2}}e^{-k_{s}^{2}}\right)
=11+ks2n=1(1)n1n(ks2n)(ks2)(n+1)(1cσcσ)nγ(n+1,ks2)\displaystyle=\frac{1}{1+k_{s}^{2}}\sum_{n=1}^{\infty}\frac{(-1)^{n-1}}{n}\frac{\left(k_{s}^{2}-n\right)}{\left(k_{s}^{2}\right)^{(n+1)}}\left(\frac{1-c_{\sigma}}{c_{\sigma}}\right)^{n}\gamma\left(n+1,k_{s}^{2}\right)
eks21+ks2log(cσ)\displaystyle~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}-\frac{e^{-k_{s}^{2}}}{1+k_{s}^{2}}\log\left(c_{\sigma}\right)
=11+ks2n=1(1)n(1cσcσ)n(ks2)(n+1)γ(n+1,ks2)\displaystyle=\frac{1}{1+k_{s}^{2}}\sum_{n=1}^{\infty}(-1)^{n}\left(\frac{1-c_{\sigma}}{c_{\sigma}}\right)^{n}\left(k_{s}^{2}\right)^{-(n+1)}\gamma\left(n+1,k_{s}^{2}\right)
+11+ks2n=1(1)n1(1cσcσ)n(ks2)nγ(n,ks2)\displaystyle~{}+\frac{1}{1+k_{s}^{2}}\sum_{n=1}^{\infty}(-1)^{n-1}\left(\frac{1-c_{\sigma}}{c_{\sigma}}\right)^{n}\left(k_{s}^{2}\right)^{-n}\gamma\left(n,k_{s}^{2}\right)
+11+ks2n=1(1)n1n(1cσcσ)neks2eks21+ks2log(cσ)\displaystyle~{}+\frac{1}{1+k_{s}^{2}}\sum_{n=1}^{\infty}(-1)^{n}\frac{1}{n}\left(\frac{1-c_{\sigma}}{c_{\sigma}}\right)^{n}e^{-k_{s}^{2}}-\frac{e^{-k_{s}^{2}}}{1+k_{s}^{2}}\log\left(c_{\sigma}\right)
=11+ks2n=1(cσ1cσks2)n(γ(n+1,ks2)ks2γ(n,ks2)).\displaystyle=\frac{1}{1+k_{s}^{2}}\sum_{n=1}^{\infty}\left(\frac{c_{\sigma}-1}{c_{\sigma}k_{s}^{2}}\right)^{n}\left(\frac{\gamma\left(n+1,k_{s}^{2}\right)}{k_{s}^{2}}-\gamma\left(n,k_{s}^{2}\right)\right). (28)

Expanding the infinite summation in (28) (represented by IT1I_{T1}) and combining common terms, we will get:

IT1\displaystyle I_{T1} =(cσ1cσks2)[γ(2,ks2)γ(1,ks2)]\displaystyle=\left(\frac{c_{\sigma}-1}{c_{\sigma}k_{s}^{2}}\right)\left[\gamma(2,k_{s}^{2})-\gamma(1,k_{s}^{2})\right]
+(cσ1cσks2)2[(ks2)1γ(3,ks2)γ(2,ks2)]+\displaystyle+\left(\frac{c_{\sigma}-1}{c_{\sigma}k_{s}^{2}}\right)^{2}\left[\left(k_{s}^{2}\right)^{-1}\gamma(3,k_{s}^{2})-\gamma(2,k_{s}^{2})\right]+...
=1cσn=1(cσ1cσ)n(ks2)(n+1)γ(n+1,ks2)\displaystyle=\frac{1}{c_{\sigma}}\sum_{n=1}^{\infty}\left(\frac{c_{\sigma}-1}{c_{\sigma}}\right)^{n}\left(k_{s}^{2}\right)^{-(n+1)}\gamma\left(n+1,k_{s}^{2}\right)
+(ks2)1(1cσcσ)(1eks2).\displaystyle~{}~{}~{}~{}~{}~{}~{}~{}+\left(k_{s}^{2}\right)^{-1}\left(\frac{1-c_{\sigma}}{c_{\sigma}}\right)(1-e^{-k_{s}^{2}}). (29)

We used the relation γ(1,ks2)=(1eks2)\gamma(1,k_{s}^{2})=(1-e^{-k_{s}^{2}}) [76, (8.352)] for obtaining the last term of (29). Now for all z>0z>0, i.e. ks2k_{s}^{2}, γ(n,ks2)=1n(ks2)nF11(n,n+1,ks2)=1n(ks2)np=0(n+1)p(n+2)p(ks2)pp!\gamma(n,k_{s}^{2})=\frac{1}{n}\left(k_{s}^{2}\right)^{n}{}_{1}F_{1}\left(n,n+1,-k_{s}^{2}\right)=\frac{1}{n}\left(k_{s}^{2}\right)^{n}\sum_{p=0}^{\infty}\frac{(n+1)_{p}}{(n+2)_{p}}\frac{(-k_{s}^{2})^{p}}{p!} [77, (4.4.6)]. Hence, the first term in RHS of (29) (represented by IT2I_{T2}) can be written as:

IT2\displaystyle I_{T2} =1cσn=1p=0(n+1)p(n+2)p(ks2)pp!1n+1(cσ1cσ)n\displaystyle=\frac{1}{c_{\sigma}}\sum_{n=1}^{\infty}\sum_{p=0}^{\infty}\frac{(n+1)_{p}}{(n+2)_{p}}\frac{(-k_{s}^{2})^{p}}{p!}\frac{1}{n+1}\left(\frac{c_{\sigma}-1}{c_{\sigma}}\right)^{n}
=1cσn=0p=0(n+1)p(n+2)p(ks2)pp!1n+1(cσ1cσ)n\displaystyle=\frac{1}{c_{\sigma}}\sum_{n=0}^{\infty}\sum_{p=0}^{\infty}\frac{(n+1)_{p}}{(n+2)_{p}}\frac{(-k_{s}^{2})^{p}}{p!}\frac{1}{n+1}\left(\frac{c_{\sigma}-1}{c_{\sigma}}\right)^{n}
1cσp=0(1)p(2)p(ks2)pp!\displaystyle~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}-\frac{1}{c_{\sigma}}\sum_{p=0}^{\infty}\frac{(1)_{p}}{(2)_{p}}\frac{(-k_{s}^{2})^{p}}{p!}
=1cσn=0p=0(n+1)p(n+2)pn!n+1(cσ1cσ)nn!(ks2)pp!\displaystyle=\frac{1}{c_{\sigma}}\sum_{n=0}^{\infty}\sum_{p=0}^{\infty}\frac{(n+1)_{p}}{(n+2)_{p}}\frac{n!}{n+1}\frac{\left(\frac{c_{\sigma}-1}{c_{\sigma}}\right)^{n}}{n!}\frac{(-k_{s}^{2})^{p}}{p!}
1cσks2(1eks2)\displaystyle~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}-\frac{1}{c_{\sigma}k_{s}^{2}}\left(1-e^{-k_{s}^{2}}\right)
=1cσn=0p=01n+p+1(1)n(cσ1cσ)nn!(ks2)pp!\displaystyle=\frac{1}{c_{\sigma}}\sum_{n=0}^{\infty}\sum_{p=0}^{\infty}\frac{1}{n+p+1}(1)_{n}\frac{\left(\frac{c_{\sigma}-1}{c_{\sigma}}\right)^{n}}{n!}\frac{(-k_{s}^{2})^{p}}{p!}
1cσks2(1eks2)\displaystyle~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}-\frac{1}{c_{\sigma}k_{s}^{2}}\left(1-e^{-k_{s}^{2}}\right)
=1cσn=0p=0(1)n+p(1)n(2)n+p+1(cσ1cσ)nn!(ks2)pp!\displaystyle=\frac{1}{c_{\sigma}}\sum_{n=0}^{\infty}\sum_{p=0}^{\infty}\frac{(1)_{n+p}(1)_{n}}{(2)_{n+p+1}}\frac{\left(\frac{c_{\sigma}-1}{c_{\sigma}}\right)^{n}}{n!}\frac{(-k_{s}^{2})^{p}}{p!}
1cσks2(1eks2)\displaystyle~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}-\frac{1}{c_{\sigma}k_{s}^{2}}\left(1-e^{-k_{s}^{2}}\right)
=1cσϕ1(1,1,2;cσ1cσ,ks2)1cσks2(1eks2),\displaystyle=\frac{1}{c_{\sigma}}\phi_{1}\left(1,1,2;\frac{c_{\sigma}-1}{c_{\sigma}},-k_{s}^{2}\right)-\frac{1}{c_{\sigma}k_{s}^{2}}\left(1-e^{-k_{s}^{2}}\right), (30)

where ϕ1(.,.,.;.,.)\phi_{1}(.,.,.;.,.) is the Confluent Hypergeometric function of two variables [78, (A.38, pp. 212)]. Now using [79, (Eq. 8)] and further exploiting [76, (3.352(5), 3.352(6)), pp. 341], one can write:

ϕ1(1,1,2;cσ1cσ,ks2)=01(1ucσ1cσ)1eks2u𝑑u\displaystyle\phi_{1}\left(1,1,2;\frac{c_{\sigma}-1}{c_{\sigma}},-k_{s}^{2}\right)=\int_{0}^{1}\left(1-u\frac{c_{\sigma}-1}{c_{\sigma}}\right)^{-1}e^{-k_{s}^{2}u}du
=cσcσ1ecσks2cσ1(Ei(cσks2cσ1)Ei(ks2cσ1)).\displaystyle~{}~{}~{}=\frac{c_{\sigma}}{c_{\sigma}-1}e^{-\frac{c_{\sigma}k_{s}^{2}}{c_{\sigma}-1}}\left(Ei\left(\frac{c_{\sigma}k_{s}^{2}}{c_{\sigma}-1}\right)-Ei\left(\frac{k_{s}^{2}}{c_{\sigma}-1}\right)\right). (31)

Finally combining (21), (25), (28), (29), (30) and (31) and substituting in (19) will result in (15).

Appendix B Proof of Theorem 2

When selected constellation s(m),m{1,2,,M}s(m),m\in\{1,2,...,M\} is symmetrically spaced around zero, m=11s(m)=0\sum_{m=1}^{1}s(m)=0 and since they are equally likely, p(m)=1M,mp(m)=\frac{1}{M},~{}\forall~{}m. Hence, μ(m)\mu(m) in (35) is zero, which make the approximated complex Gaussian distribution for both the signal, i.e. xsx_{s} and the interference plus noise, i.e., xIx_{I} zero mean. Therefore, both xs2\|x_{s}\|^{2} and xI2\|x_{I}\|^{2} are exponentially distributed with parameters 1σs2\frac{1}{\sigma_{s}^{2}} and 1σI2\frac{1}{\sigma_{I}^{2}}, respectively. Hence, the distribution of η=xs2xI2\eta=\frac{\|x_{s}\|^{2}}{\|x_{I}\|^{2}} is given below:

fη(η)=cσ(η+cσ)2,η>0,\displaystyle f_{\eta}(\eta)=\frac{c_{\sigma}}{\left(\eta+c_{\sigma}\right)^{2}},~{}\eta>0, (32)

where cσ=σs2σI2c_{\sigma}=\frac{\sigma_{s}^{2}}{\sigma_{I}^{2}}. Hence,

C¯h,u\displaystyle\bar{C}_{h,u} =0log2(1+η)cσ(η+cσ)2𝑑η\displaystyle=\int_{0}^{\infty}\log_{2}\left(1+\eta\right)\frac{c_{\sigma}}{\left(\eta+c_{\sigma}\right)^{2}}d\eta
=(a)1log2([log(1+η)cση+cσ]0\displaystyle\overset{(a)}{=}\frac{1}{\log 2}\left(\left[-\log\left(1+\eta\right)\frac{c_{\sigma}}{\eta+c_{\sigma}}\right]_{0}^{\infty}\right.
+0cσ(η+1)(η+cσ)dη)\displaystyle~{}~{}~{}~{}\left.+\int_{0}^{\infty}\frac{c_{\sigma}}{(\eta+1)(\eta+c_{\sigma})}d\eta\right)
=cσcσ1[log2(η+1η+cσ)]0,\displaystyle=\frac{c_{\sigma}}{c_{\sigma}-1}\left[\log_{2}\left(\frac{\eta+1}{\eta+c_{\sigma}}\right)\right]_{0}^{\infty}, (33)

where (a) is obtained using integration by parts. The first term of RHS of (a) is zero, which can be obtained using L’Hosptials’ rule [80]. Finally, evaluating the limits in (33) will result in (16), which proves the Theorem.

Appendix C Distribution of η\eta

Lemma 1.

Let the transmitted symbols sn,n{0,1,,N}s_{n},~{}\forall~{}n\in\left\{0,1,...,N\right\} be chosen from an MM-ary constellation s(m),m{0,1,,M1}s(m),m\in\left\{0,1,...,M-1\right\} having probability p(m)p(m). Then the distribution of η\eta given in (14) can be approximated as:

fη(η)=k~eηks2η+σs2σI2(η+σs2σI2(1+ks2)(η+σs2σI2)3),η>0,\displaystyle f_{\eta}(\eta)=\tilde{k}e^{\frac{\eta k_{s}^{2}}{\eta+\frac{\sigma_{s}^{2}}{\sigma_{I}^{2}}}}\left(\frac{\eta+\frac{\sigma_{s}^{2}}{\sigma_{I}^{2}\left(1+k_{s}^{2}\right)}}{\left(\eta+\frac{\sigma_{s}^{2}}{\sigma_{I}^{2}}\right)^{3}}\right),~{}\eta>0, (34)

where k~=eks2(1+ks2)σs2σI2\tilde{k}=e^{-k_{s}^{2}}\left(1+k_{s}^{2}\right)\frac{\sigma_{s}^{2}}{\sigma_{I}^{2}} is a constant with ks=|μs|σsk_{s}=\frac{|\mu_{s}|}{\sigma_{s}}. Here, μs\mu_{s} and σs2\sigma_{s}^{2} are the mean and variance of signal component, respectively and σI2\sigma_{I}^{2} is the variance of interference plus noise component and are given by:

μs=m=0M1p(m)μ(m),\displaystyle\mu_{s}=\sum_{m=0}^{M-1}p(m)\mu(m), (35)

where μ(m)=PrKK+1(𝐞L0+𝐞R0)H𝐞0s(m)\mu(m)=\sqrt{\frac{P_{r}K}{K+1}}\left({\mathbf{e}}_{L0}+{\mathbf{e}}_{R0}\right)^{H}{\mathbf{e}}_{0}s(m).

σs2=m=0M1p(m)(2Pr|s(m)|2K+1𝐞02+|μ(m)μs|2).\displaystyle\sigma_{s}^{2}=\sum_{m=0}^{M-1}p(m)\left(\frac{2P_{r}|s(m)|^{2}}{K+1}\|{\mathbf{e}}_{0}\|^{2}+\left|\mu(m)-\mu_{s}\right|^{2}\right). (36)
σI2=m=0M1p(m)2Pr|s(m)|2K+1n=1N𝐞n2+σ2.\displaystyle\sigma_{I}^{2}=\sum_{m=0}^{M-1}p(m)\frac{2P_{r}|s(m)|^{2}}{K+1}\left\|\sum_{n=1}^{N}{\mathbf{e}}_{n}\right\|^{2}+\sigma^{2}. (37)
Proof.

The signal and interference plus noise components are

xs=Pr𝐡0𝐞0s0\displaystyle x_{s}=\sqrt{P_{r}}{\mathbf{h}}_{0}{\mathbf{e}}_{0}s_{0} (38)

and

xI=Pr𝐡0n=1N𝐞nsn+n0,\displaystyle x_{I}=\sqrt{P_{r}}{\mathbf{h}}_{0}\sum_{n=1}^{N}{\mathbf{e}}_{n}s_{n}+n_{0}, (39)

respectively. Since both 𝐡L{\mathbf{h}}_{L} in (3) and 𝐡R{\mathbf{h}}_{R} in (4) are distributed as 𝒞𝒩(0,){\mathcal{CN}}(0,{\mathcal{I}}), we have 𝐡L+𝐡R𝒞𝒩(0,2){\mathbf{h}}_{L}+{\mathbf{h}}_{R}\sim{\mathcal{CN}}(0,2{\mathcal{I}}). Now, note that,

(𝐞L0+𝐞R0)H𝐞i0,i0,\displaystyle\left({\mathbf{e}}_{L0}+{\mathbf{e}}_{R0}\right)^{H}{\mathbf{e}}_{i}\approx 0,\forall~{}i\neq 0, (40)

which is a direct consequence of zero-forcing precoding. Hence, it can be deduced that for a given sn=s~n,n{0,1,,N}s_{n}=\tilde{s}_{n},~{}n\in\{0,1,...,N\}, xsx_{s} and xIx_{I} are distributed as 𝒞𝒩(μ~s,σ~s2){\mathcal{CN}}(\tilde{\mu}_{s},\tilde{\sigma}_{s}^{2}) and 𝒞𝒩(0,σ~I2){\mathcal{CN}}(0,\tilde{\sigma}_{I}^{2}), respectively, where μ~s=PrKK+1(𝐞L0+𝐞R0)H𝐞0s~0\tilde{\mu}_{s}=\sqrt{\frac{P_{r}K}{K+1}}\left({\mathbf{e}}_{L0}+{\mathbf{e}}_{R0}\right)^{H}{\mathbf{e}}_{0}\tilde{s}_{0}, σ~s2=2Pr|s~0|2K+1𝐞02\tilde{\sigma}_{s}^{2}=\frac{2P_{r}|\tilde{s}_{0}|^{2}}{K+1}\|{\mathbf{e}}_{0}\|^{2} and σ~I2=2PrK+1n=1N𝐞ns~n2+σ2\tilde{\sigma}_{I}^{2}=\frac{2P_{r}}{K+1}\|\sum_{n=1}^{N}{\mathbf{e}}_{n}\tilde{s}_{n}\|^{2}+\sigma^{2}.

Note that the transmitted symbols are chosen from an MM-ary constellation, where the probability of occurrence of mthm^{th} symbol is p(m)p(m). Hence, the unconditional distribution of xsx_{s} and xIx_{I} are mixture of complex Gaussian and are m=1Mp(m)𝒞𝒩(μ~s(m),σ~s2(m))\sum_{m=1}^{M}p(m){\mathcal{CN}}(\tilde{\mu}_{s}(m),\tilde{\sigma}_{s}^{2}(m)) and m=1Mp(m)𝒞𝒩(0,σ~I2(m))\sum_{m=1}^{M}p(m){\mathcal{CN}}(0,\tilde{\sigma}_{I}^{2}(m)), respectively. Here, μ~s(m)=PrKK+1(𝐞L0+𝐞R0)H𝐞0s(m)\tilde{\mu}_{s}(m)=\sqrt{\frac{P_{r}K}{K+1}}\left({\mathbf{e}}_{L0}+{\mathbf{e}}_{R0}\right)^{H}{\mathbf{e}}_{0}s(m), σ~s2(m)=2Pr|s(m)|2K+1𝐞02\tilde{\sigma}_{s}^{2}(m)=\frac{2P_{r}|s(m)|^{2}}{K+1}\|{\mathbf{e}}_{0}\|^{2} and σ~I2=2PrK+1n=1N𝐞ns(m)2+σ2\tilde{\sigma}_{I}^{2}=\frac{2P_{r}}{K+1}\|\sum_{n=1}^{N}{\mathbf{e}}_{n}s(m)\|^{2}+\sigma^{2}. Now, for computational tractability, we will approximate these mixture distributions by a pair of complex Gaussian distributions, having the same first-order and second-order moments. It can be deduced that the mean and variance of approximated complex Gaussian distribution of xsx_{s} are given by (35) and (36), respectively and xIx_{I} is a zero mean random variable with variance given by (37) [81].

Now, based on the approximated complex Gaussian distributions of xsx_{s} and xIx_{I}, the distribution of x=|xsxI|x=\left|\frac{x_{s}}{x_{I}}\right| can be obtained from [82, (7)] as:

fx(x)=2xeks2σs2σI2cx2F11(2,1;x2ks2σs2cx),x>0,\displaystyle f_{x}(x)=\frac{2xe^{-k_{s}^{2}}}{\sigma_{s}^{2}\sigma_{I}^{2}c_{x}^{2}}~{}{}_{1}F_{1}\left(2,1;\frac{x^{2}k_{s}^{2}}{\sigma_{s}^{2}c_{x}}\right),~{}x>0, (41)

where we have cx=x2σs2+1σI2c_{x}=\frac{x^{2}}{\sigma_{s}^{2}}+\frac{1}{\sigma_{I}^{2}}. Hence, η=x2,x>0\eta=x^{2},x>0 is distributed as fη(η)=12ηfx(η)f_{\eta}(\eta)=\frac{1}{2\sqrt{\eta}}f_{x}(\sqrt{\eta}) and is given by:

fη(η)=eks2σs2σI2cη2F11(2,1;ηks2σs2cη),η>0,\displaystyle f_{\eta}(\eta)=\frac{e^{-k_{s}^{2}}}{\sigma_{s}^{2}\sigma_{I}^{2}c_{\eta}^{2}}~{}{}_{1}F_{1}\left(2,1;\frac{\eta k_{s}^{2}}{\sigma_{s}^{2}c_{\eta}}\right),~{}\eta>0, (42)

where cη=ησs2+1σI2c_{\eta}=\frac{\eta}{\sigma_{s}^{2}}+\frac{1}{\sigma_{I}^{2}}. However using [83], we have F11(2,1;z)=ez(1+z){}_{1}F_{1}(2,1;z)=e^{z}(1+z). Therefore, (42) becomes:

fη(η)=eks2σs2σI2eηks2σs2cηcη2(1+ηks2σs2cη),\displaystyle f_{\eta}(\eta)=\frac{e^{-k_{s}^{2}}}{\sigma_{s}^{2}\sigma_{I}^{2}}\frac{e^{\frac{\eta k_{s}^{2}}{\sigma_{s}^{2}c_{\eta}}}}{c_{\eta}^{2}}\left(1+\frac{\eta k_{s}^{2}}{\sigma_{s}^{2}c_{\eta}}\right), (43)

which will reduces to (34). ∎

References

  • [1] K. B. Letaief, W. Chen, Y. Shi, J. Zhang, and Y.-J. A. Zhang, “The roadmap to 6G: AI empowered wireless networks,” IEEE Communications Magazine, vol. 57, no. 8, pp. 84–90, 2019.
  • [2] T. S. Rappaport, Y. Xing, O. Kanhere, S. Ju, A. Madanayake, S. Mandal, A. Alkhateeb, and G. C. Trichopoulos, “Wireless communications and applications above 100 GHz: Opportunities and challenges for 6G and beyond,” IEEE Access, vol. 7, pp. 78729–78757, 2019.
  • [3] I. F. Akyildiz, A. Kak, and S. Nie, “6G and beyond: The future of wireless communications systems,” IEEE Access, vol. 8, pp. 133995–134030, 2020.
  • [4] M. H. Alsharif, A. H. Kelechi, M. A. Albreem, S. A. Chaudhry, M. S. Zia, and S. Kim, “Sixth Generation (6G) Wireless Networks: Vision, Research Activities, Challenges and Potential Solutions,” Symmetry, vol. 12, no. 4, p. 676, 2020.
  • [5] S. Dang, O. Amin, B. Shihada, and M.-S. Alouini, “What should 6G be?,” Nature Electronics, vol. 3, no. 1, pp. 20–29, 2020.
  • [6] I. Bucaille, S. Héthuin, A. Munari, R. Hermenier, T. Rasheed, and S. Allsopp, “Rapidly deployable network for tactical applications: Aerial base station with opportunistic links for unattended and temporary events absolute example,” in MILCOM 2013-2013 IEEE military communications conference, pp. 1116–1120, IEEE, 2013.
  • [7] M. Mozaffari, W. Saad, M. Bennis, Y.-H. Nam, and M. Debbah, “A tutorial on UAVs for wireless networks: Applications, challenges, and open problems,” IEEE Communications Surveys & Tutorials, vol. 21, no. 3, pp. 2334–2360, 2019.
  • [8] M. Mozaffari, A. T. Z. Kasgari, W. Saad, M. Bennis, and M. Debbah, “Beyond 5G with UAVs: Foundations of a 3D wireless cellular network,” IEEE Transactions on Wireless Communications, vol. 18, no. 1, pp. 357–372, 2018.
  • [9] B. Li, Z. Fei, and Y. Zhang, “UAV communications for 5G and beyond: Recent advances and future trends,” IEEE Internet of Things Journal, vol. 6, no. 2, pp. 2241–2263, 2018.
  • [10] T.-Z. Xiang, G.-S. Xia, and L. Zhang, “Mini-unmanned aerial vehicle-based remote sensing: techniques, applications, and prospects,” IEEE Geoscience and Remote Sensing Magazine, vol. 7, no. 3, pp. 29–63, 2019.
  • [11] P. Partsinevelos, D. Chatziparaschis, D. Trigkakis, and A. Tripolitsiotis, “A novel UAV-assisted positioning system for GNSS-denied environments,” Remote Sensing, vol. 12, no. 7, p. 1080, 2020.
  • [12] D. Bamburry, “Drones: Designed for product delivery,” Design Management Review, vol. 26, no. 1, pp. 40–48, 2015.
  • [13] S. Hosseinalipour, A. Rahmati, H. Dai, et al., “Energy-aware stochastic UAV-assisted surveillance,” IEEE Transactions on Wireless Communications, 2020.
  • [14] W. Saad, M. Bennis, and M. Chen, “A vision of 6G wireless systems: Applications, trends, technologies, and open research problems,” IEEE network, vol. 34, no. 3, pp. 134–142, 2019.
  • [15] S. N. Alam and Z. J. Haas, “Coverage and connectivity in three-dimensional networks,” in Proceedings of the 12th annual international conference on Mobile computing and networking, pp. 346–357, 2006.
  • [16] X. Chen, D. W. K. Ng, W. Yu, E. G. Larsson, N. Al-Dhahir, and R. Schober, “Massive access for 5G and beyond,” IEEE Journal on Selected Areas in Communications, vol. 39, no. 3, pp. 615–637, 2020.
  • [17] Q.-U.-A. Nadeem, A. Kammoun, and M.-S. Alouini, “Elevation Beamforming With Full Dimension MIMO Architectures in 5G Systems: A Tutorial,” IEEE Communications Surveys Tutorials, vol. 21, no. 4, pp. 3238–3273, 2019.
  • [18] A. Afana, V. Asghari, A. Ghrayeb, and S. Affes, “On the performance of cooperative relaying spectrum-sharing systems with collaborative distributed beamforming,” IEEE Transactions on Communications, vol. 62, no. 3, pp. 857–871, 2014.
  • [19] D. Xiong, L. Dai, and X. Zeng, “Research on area spectrum efficiency and energy efficiency in 3-tier ultra-dense heterogeneous cellular networks,” in 2020 IEEE 6th International Conference on Computer and Communications (ICCC), pp. 256–261, IEEE, 2020.
  • [20] H. Q. Ngo, A. Ashikhmin, H. Yang, E. G. Larsson, and T. L. Marzetta, “Cell-free massive MIMO versus small cells,” IEEE Transactions on Wireless Communications, vol. 16, no. 3, pp. 1834–1850, 2017.
  • [21] S. M. Razavizadeh, M. Ahn, and I. Lee, “Three-dimensional beamforming: A new enabling technology for 5G wireless networks,” IEEE Signal Processing Magazine, vol. 31, no. 6, pp. 94–101, 2014.
  • [22] W. H. Chin, Z. Fan, and R. Haines, “Emerging technologies and research challenges for 5G wireless networks,” IEEE Wireless Communications, vol. 21, no. 2, pp. 106–112, 2014.
  • [23] G. Xu, W. Ma, Y. Ren, K. Zhang, X. Su, and S. Chen, “Three dimensional beamforming and limited feedback precoding for future lte-advanced systems with large-scale antenna arrays,” in 2015 IEEE 81st Vehicular Technology Conference (VTC Spring), pp. 1–6, 2015.
  • [24] A. Zanella, N. Bui, A. Castellani, L. Vangelista, and M. Zorzi, “Internet of things for smart cities,” IEEE Internet of Things journal, vol. 1, no. 1, pp. 22–32, 2014.
  • [25] J. Gubbi, R. Buyya, S. Marusic, and M. Palaniswami, “Internet of Things (IoT): A vision, architectural elements, and future directions,” Future Generation Computer Systems, vol. 29, no. 7, pp. 1645–1660, 2013.
  • [26] Z. Dawy, W. Saad, A. Ghosh, J. G. Andrews, and E. Yaacoub, “Toward massive machine type cellular communications,” IEEE Wireless Communications, vol. 24, no. 1, pp. 120–128, 2016.
  • [27] S.-Y. Lien, K.-C. Chen, and Y. Lin, “Toward ubiquitous massive accesses in 3GPP machine-to-machine communications,” IEEE Communications Magazine, vol. 49, no. 4, pp. 66–74, 2011.
  • [28] L. Lu, G. Y. Li, A. L. Swindlehurst, A. Ashikhmin, and R. Zhang, “An overview of massive MIMO: Benefits and challenges,” IEEE journal of selected topics in signal processing, vol. 8, no. 5, pp. 742–758, 2014.
  • [29] X. Gao, O. Edfors, F. Rusek, and F. Tufvesson, “Massive MIMO performance evaluation based on measured propagation data,” IEEE Transactions on Wireless Communications, vol. 14, no. 7, pp. 3899–3911, 2015.
  • [30] E. G. Larsson, O. Edfors, F. Tufvesson, and T. L. Marzetta, “Massive MIMO for next generation wireless systems,” IEEE Communications Magazine, vol. 52, no. 2, pp. 186–195, 2014.
  • [31] S. Zhou, M. Zhao, X. Xu, J. Wang, and Y. Yao, “Distributed wireless communication system: a new architecture for future public wireless access,” IEEE Communications Magazine, vol. 41, no. 3, pp. 108–113, 2003.
  • [32] M. K. Karakayali, G. J. Foschini, and R. A. Valenzuela, “Network coordination for spectrally efficient communications in cellular systems,” IEEE Wireless Communications, vol. 13, no. 4, pp. 56–61, 2006.
  • [33] W. Choi and J. G. Andrews, “Downlink performance and capacity of distributed antenna systems in a multicell environment,” IEEE Transactions on Wireless Communications, vol. 6, no. 1, pp. 69–73, 2007.
  • [34] R. Irmer, H. Droste, P. Marsch, M. Grieger, G. Fettweis, S. Brueck, H.-P. Mayer, L. Thiele, and V. Jungnickel, “Coordinated multipoint: Concepts, performance, and field trial results,” IEEE Communications Magazine, vol. 49, no. 2, pp. 102–111, 2011.
  • [35] X. Hong, Y. Jie, C.-X. Wang, J. Shi, and X. Ge, “Energy-spectral efficiency trade-off in virtual MIMO cellular systems,” IEEE Journal on Selected Areas in Communications, vol. 31, no. 10, pp. 2128–2140, 2013.
  • [36] D. Castanheira and A. Gameiro, “Distributed antenna system capacity scaling [coordinated and distributed MIMO],” IEEE Wireless Communications, vol. 17, no. 3, pp. 68–75, 2010.
  • [37] Ö. T. Demir, E. Björnson, and L. Sanguinetti, “Foundations of user-centric cell-free massive MIMO,” arXiv preprint arXiv:2108.02541, 2021.
  • [38] S. Jayaprakasam, S. K. A. Rahim, and C. Y. Leow, “Distributed and collaborative beamforming in wireless sensor networks: Classifications, trends, and research directions,” IEEE Communications Surveys & Tutorials, vol. 19, no. 4, pp. 2092–2116, 2017.
  • [39] M. Abolfath Beigi and S. Mohammad Razavizadeh, “Cooperative beamforming in cognitive radio networks,” in 2009 2nd IFIP Wireless Days (WD), pp. 1–5, 2009.
  • [40] L. Dong, A. P. Petropulu, and H. V. Poor, “Cooperative beamforming for wireless ad hoc networks,” in IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference, pp. 2957–2961, 2007.
  • [41] M.-S. Alouini and A. J. Goldsmith, “Area spectral efficiency of cellular mobile radio systems,” IEEE Transactions on Vehicular Technology, vol. 48, no. 4, pp. 1047–1066, 1999.
  • [42] C. Li, J. Zhang, J. G. Andrews, and K. B. Letaief, “Success probability and area spectral efficiency in multiuser MIMO HetNets,” IEEE Transactions on Communications, vol. 64, no. 4, pp. 1544–1556, 2016.
  • [43] M. Ding, D. López-Pérez, G. Mao, P. Wang, and Z. Lin, “Will the area spectral efficiency monotonically grow as small cells go dense?,” in 2015 IEEE Global Communications Conference (GLOBECOM), pp. 1–7, IEEE, 2015.
  • [44] Y. Xin, D. Wang, J. Li, H. Zhu, J. Wang, and X. You, “Area spectral efficiency and area energy efficiency of massive MIMO cellular systems,” IEEE Transactions on Vehicular Technology, vol. 65, no. 5, pp. 3243–3254, 2015.
  • [45] L. Zhang, H.-C. Yang, and M. O. Hasna, “Generalized area spectral efficiency: An effective performance metric for green wireless communications,” IEEE Transactions on Communications, vol. 62, no. 2, pp. 747–757, 2014.
  • [46] M. R. Rahaman Khan and V. Tuzlukov, “Null-steering beamforming for cancellation of co-channel interference in CDMA wireless communication system,” in 2010 4th International Conference on Signal Processing and Communication Systems, pp. 1–5, IEEE, 2010.
  • [47] J. Litva and T. K. Lo, Digital beamforming in wireless communications. Artech House, Inc., 1996.
  • [48] S. Yoo, S. Kim, D. H. Youn, and C. Lee, “Multipath mitigation technique using null-steering beamformer for positioning system,” in The 57th IEEE Semiannual Vehicular Technology Conference, 2003. VTC 2003-Spring., vol. 1, pp. 602–605, IEEE, 2003.
  • [49] M. Srinivasan, S. Gopi, S. Kalyani, X. Huang, and L. Hanzo, “Airplane-aided integrated next-generation networking,” IEEE Transactions on Vehicular Technology, pp. 1–1, 2021.
  • [50] L. Zhao, D. W. K. Ng, and J. Yuan, “Multi-user precoding and channel estimation for hybrid millimeter wave systems,” IEEE Journal on Selected Areas in Communications, vol. 35, no. 7, pp. 1576–1590, 2017.
  • [51] P. Liu, M. Di Renzo, and A. Springer, “Line-of-sight spatial modulation for indoor mmwave communication at 60 GHz,” IEEE Transactions on Wireless Communications, vol. 15, no. 11, pp. 7373–7389, 2016.
  • [52] T. S. Rappaport, G. R. MacCartney, M. K. Samimi, and S. Sun, “Wideband millimeter-wave propagation measurements and channel models for future wireless communication system design,” IEEE Transactions on Communications, vol. 63, no. 9, pp. 3029–3056, 2015.
  • [53] R. Xu, Z. Zhong, and J.-M. Chen, “Approximation to the capacity of Rician fading MIMO channels,” in VTC Spring 2009-IEEE 69th Vehicular Technology Conference, pp. 1–5, IEEE, 2009.
  • [54] H. L. Van Trees, Optimum array processing: Part IV of detection, estimation, and modulation theory. John Wiley & Sons, 2004.
  • [55] C. D. Meyer, Matrix analysis and applied linear algebra, vol. 71. Siam, 2000.
  • [56] W. Qingqing and Z. Rui, “Towards smart and reconfigurable environment: Intelligent reflecting surface aided wireless network,” arXiv preprint arXiv:1905.00152, 2019.
  • [57] L. Dai, B. Wang, M. Wang, X. Yang, J. Tan, S. Bi, S. Xu, F. Yang, Z. Chen, M. Di Renzo, C.-B. Chae, and L. Hanzo, “Reconfigurable intelligent surface-based wireless communications: Antenna design, prototyping, and experimental results,” IEEE Access, vol. 8, pp. 45913–45923, 2020.
  • [58] M. Di Renzo, M. Debbah, D.-T. Phan-Huy, A. Zappone, M.-S. Alouini, C. Yuen, V. Sciancalepore, G. C. Alexandropoulos, J. Hoydis, H. Gacanin, J. d. Rosny, A. Bounceur, G. Lerosey, and M. Fink, “Smart radio environments empowered by reconfigurable AI meta-surfaces: an idea whose time has come,” EURASIP Journal on Wireless Communications and Networking, vol. 2019, no. 1, pp. 1–20, 2019.
  • [59] W. Yan, X. Yuan, and X. Kuai, “Passive beamforming and information transfer via large intelligent surface,” IEEE Wireless Communications Letters, vol. 9, no. 4, pp. 533–537, 2019.
  • [60] X. Yu, D. Xu, and R. Schober, “MISO wireless communication systems via intelligent reflecting surfaces : (Invited paper),” in 2019 IEEE/CIC International Conference on Communications in China (ICCC), pp. 735–740, Aug 2019.
  • [61] Y. Han, W. Tang, S. Jin, C. Wen, and X. Ma, “Large intelligent surface-assisted wireless communication exploiting statistical CSI,” IEEE Transactions on Vehicular Technology, vol. 68, pp. 8238–8242, Aug 2019.
  • [62] C. Huang, A. Zappone, G. C. Alexandropoulos, M. Debbah, and C. Yuen, “Reconfigurable intelligent surfaces for energy efficiency in wireless communication,” IEEE Transactions on Wireless Communications, vol. 18, pp. 4157–4170, Aug 2019.
  • [63] C. Huang, G. C. Alexandropoulos, A. Zappone, M. Debbah, and C. Yuen, “Energy efficient multi-user MISO communication using low resolution large intelligent surfaces,” in 2018 IEEE Globecom Workshops (GC Wkshps), pp. 1–6, IEEE, 2018.
  • [64] J. Chen, Y. Liang, Y. Pei, and H. Guo, “Intelligent reflecting surface: A programmable wireless environment for physical layer security,” IEEE Access, vol. 7, pp. 82599–82612, 2019.
  • [65] C. Pan, H. Ren, K. Wang, W. Xu, M. Elkashlan, A. Nallanathan, and L. Hanzo, “Multicell MIMO communications relying on intelligent reflecting surfaces,” IEEE Transactions on Wireless Communications, vol. 19, no. 8, pp. 5218–5233, 2020.
  • [66] E. Basar, “Reconfigurable intelligent surface-based index modulation: A new beyond MIMO paradigm for 6G,” IEEE Transactions on Communications, vol. 68, no. 5, pp. 3187–3196, 2020.
  • [67] S. Gopi, S. Kalyani, and L. Hanzo, “Intelligent reflecting surface assisted beam index-modulation for millimeter wave communication,” IEEE Transactions on Wireless Communications, pp. 1–1, 2020.
  • [68] R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete mathematics: a foundation for computer science. Addison-Wesley, 2 ed., 1994.
  • [69] H. Yan, S. Ramesh, T. Gallagher, C. Ling, and D. Cabric, “Performance, power, and area design trade-offs in millimeter-wave transmitter beamforming architectures,” IEEE Circuits and Systems Magazine, vol. 19, no. 2, pp. 33–58, 2019.
  • [70] S. Nie, G. R. MacCartney, S. Sun, and T. S. Rappaport, “28 GHz and 73 GHz signal outage study for millimeter wave cellular and backhaul communications,” in 2014 IEEE International Conference on Communications (ICC), pp. 4856–4861, IEEE, 2014.
  • [71] S. A. Rao, N. Kumar, et al., “Modeling and link budget estimation of directional mmwave outdoor environment for 5G,” in 2019 European Conference on Networks and Communications (EuCNC), pp. 106–111, IEEE, 2019.
  • [72] G. R. MacCartney and T. S. Rappaport, “73 GHz millimeter wave propagation measurements for outdoor urban mobile and backhaul communications in New York City,” in 2014 IEEE International Conference on Communications (ICC), pp. 4862–4867, IEEE, 2014.
  • [73] G. R. MacCartney and T. S. Rappaport, “Rural macrocell path loss models for millimeter wave wireless communications,” IEEE Journal on selected areas in communications, vol. 35, no. 7, pp. 1663–1677, 2017.
  • [74] C. A. Balanis, Antenna theory: analysis and design. John wiley & sons, 2016.
  • [75] X. Huang, J. A. Zhang, R. P. Liu, Y. J. Guo, and L. Hanzo, “Airplane-Aided Integrated Networking for 6G Wireless: Will It Work?,” IEEE Vehicular Technology Magazine, vol. 14, no. 3, pp. 84–91, 2019.
  • [76] I. S. Gradshteyn and I. M. Ryzhik, Table of integrals, series, and products. Academic press, 2014.
  • [77] G.-C. Rota, Encyclopedia of Mathematics and its Applications. Addison-Wesley, 1976.
  • [78] A. M. Mathai, R. K. Saxena, and H. J. Haubold, The H-function: theory and applications. Springer Science & Business Media, 2009.
  • [79] A. W. Kemp, “New discrete appell and humbert distributions with relevance to bivariate accident data,” Journal of multivariate analysis, vol. 113, pp. 2–6, 2013.
  • [80] E. Kreyszig, K. Stroud, and G. Stephenson, “Advanced engineering mathematics,” Integration, vol. 9, p. 4, 2008.
  • [81] U. Orguner and M. Demirekler, “Analysis of single gaussian approximation of gaussian mixtures in bayesian filtering applied to mixed multiple-model estimation,” International Journal of Control, vol. 80, no. 6, pp. 952–967, 2007.
  • [82] S. Nadarajah and H. S. Kwong, “A note on “On the ratio of independent complex Gaussian random variables”,” Multidimensional Systems and Signal Processing, vol. 29, no. 4, pp. 1839–1843, 2018.
  • [83] Wolfram Research, “Hypergeometric1f1.” [Online]. Available: http://functions.wolfram.com/HypergeometricFunctions/Hypergeometric1F1/03/02/10/0015/. Last visited on 17/9/2020.