Search

In this paper, we present a practical method to construct dirty paper coding (DPC) schemes using sum codes. Unlike the commonly used approach to DPC where the coding scheme involves concatenation of a channel code and a quantization code, the proposed method embodies a unified approach that emulates the binning method used in the proof of the DPC result. Auxiliary bits are used to create the desired number of code vectors in each bin. Sum codes are obtained when information sequences augmented with auxiliary bits are encoded using linear block codes. Sum-code-based DPC schemes can be implemented using any linear block code, and entail a relatively small increase in decoder complexity when compared to standard communication schemes. They can also lead to significant reduction in transmit power in comparison to standard schemes. [ABSTRACT FROM AUTHOR]

The article looks at the published studies by Nippon Telegraph and Telephone in technical journals and conferences. Topics discussed include a study on the use of transmit power control in dividing interference-aware channels, another study on wide-area centralized radio resource management applied on multihop wireless networks, and the one on the potential of bodily experience in enhancing museum exhibits.

Radio Frequency Identification (RFID) technology plays a crucial role in various Internet of Things (IoT) applications, necessitating the integration of RFID systems into dense networks. However, the presence of numerous readers leads to collisions, degrading communication between readers and tags and compromising system performance. To tackle this challenge, researchers have proposed Medium Access Control (MAC) layer protocols employing different channel access methods. In this paper, we present a novel solution, the Distributed Time Slot Anti-Collision protocol (DTS-AC), which employs a new TDMA notification system to address Reader-to-Reader Interference (RRI), while incorporating FDMA-based frequency resource management to resolve Reader-to-Tag Interference (RTI) collision issues. Simulation results demonstrate that DTS-AC significantly improves performance in dense RFID networks by enhancing read rates, with scalability benefits based on the number of readers, channels, and Time Slots (TSs). Moreover, the cost-effectiveness of DTS-AC facilitates efficient deployment in RFID networks, emphasizing considerations of time delay and data sensitivity. [ABSTRACT FROM AUTHOR]

This paper studies the effectiveness of relaying for interference mitigation in an interference-limited communication scenario. We are motivated by the observation that in a cellular network, a relay node placed at the cell edge observes a combination of intended signal and inter-cell interference that is correlated with the received signal at a nearby destination, so a relaying link can effectively allow the antennas at the relay and at the destination to be pooled together for both signal enhancement and interference mitigation. We model this scenario by a multiple-input multiple-output (MIMO) Gaussian relay channel with a digital relay-to-destination link of finite capacity, and with correlated noise across the relay and destination antennas. Assuming a compress-and-forward strategy with Gaussian input distribution and quantization noise, we propose a coordinate ascent algorithm for obtaining a stationary point of the non-convex joint optimization of the transmit and quantization covariance matrices. For fixed input distribution, the globally optimum quantization noise covariance matrix can be found in closed-form using a transformation for the relay’s observation that simultaneously diagonalizes two conditional covariance matrices by congruence. For fixed quantization, the globally optimum transmit covariance matrix can be found via convex optimization. This paper further shows that such an optimized achievable rate is within a constant additive gap of the MIMO relay channel capacity. The optimal structure of the quantization noise covariance enables a characterization of the slope of the achievable rate as a function of the relaying link capacity. Moreover, this paper shows that the improvement in spatial degrees of freedom by MIMO relaying in the presence of noise correlation is related to the aforementioned slope via a connection to the deterministic relay channel. [ABSTRACT FROM AUTHOR]

The state-dependent Gaussian interference channel (IC) and Z-IC are investigated, in which two receivers are corrupted by the same but differently scaled states. The state sequence is noncausally known at both transmitters, but not known at either receiver. Three interference regimes are studied, i.e., the very strong, strong, and weak regimes. In the very strong regime, the capacity region is characterized under certain channel parameters by designing a cooperative dirty paper coding between the two transmitters to fully cancel the state. In the strong regime, points on the capacity region boundary are characterized under certain channel parameters by designing an achievable scheme based on rate splitting, layered dirty paper coding, and successive state cancellation. In the weak regime, the sum capacity is obtained by independent dirty paper coding at two transmitters. For all the above regimes, the capacity achieves that of the IC/Z-IC without state. Comparison between the state-dependent regular IC and the Z-IC suggests that even with one interference-free link, the Z-IC does not necessarily perform better, because dirty paper coded interference in the regular IC facilitates to cancel the state through the cooperative dirty paper coding between the transmitters. [ABSTRACT FROM AUTHOR]

The emergence of interference alignment (IA) as a degrees-of-freedom optimal strategy motivates the need to investigate whether IA can be leveraged to aid conventional network utility maximization algorithms, which are typically only capable of finding locally optimal solutions. To test the usefulness of IA in this context, this paper proposes a two-stage optimization framework for the downlink of a $G$ -cell multi-antenna network with $K$ users/cell. The first stage of the proposed framework focuses on nulling interference from a set of dominant interferers using IA, while the second stage optimizes transmit and receive beamformers to maximize a network-wide utility using the IA solution as the initial condition. Further, this paper establishes a set of new feasibility results for partial IA that can be used to guide the number of dominant interferers to be nulled in the first stage. Through simulations on specific topologies of a cluster of base stations, it is observed that the impact of IA depends on the choice of the utility function and the presence of out-of-cluster interference. In the absence of out-of-cluster interference, the proposed framework outperforms straightforward optimization when maximizing the minimum rate, while providing marginal gains when maximizing sum rate. However, the benefit of IA is greatly diminished in the presence of significant out-of-cluster interference. [ABSTRACT FROM AUTHOR]

The trend in wireless communications systems is the enhancement of the network infrastructure with the introduction of small cells, where a specific geographical area is served by low-range, low-power access points. The result is the creation of a heterogeneous topology where macrocells coexist with a variety of small-cell types. In this editorial article we briefly summarize the recent technical advances in the design and deployment of future heterogeneous networks addressed in the papers that compose this special issue. In particular the following aspects are considered: the design of interference and radio resource management algorithms, the analysis of the energy efficiency and power control issues in heterogeneous networks, the concept of coordination in small cell networks, key backhaul aspects of HetNets, deployment issues and overall management strategies. [ABSTRACT FROM AUTHOR]

This paper considers the detection of a distributed target in a partial observation scenario. A distributed targetmodel is usually adopted when the target size is larger than the range bin, for example, in some high-resolution radars. Based on the distributed target model, joint processing of several consecutive range bins can be adopted to achieve performance improvement with respect to processing just one range bin. In applications in complex electromagnetic environments, the radars may miss some of their observations, a phenomenon that usually caused by interference, spectrum sharing, and so on. This partial observation problem leads to degradation of the estimation accuracy for the disturbance (clutter plus noise) covariance matrix and target amplitude vector, which results in decline of the target detection performance. In this paper, a scheme is proposed by using the low-rank priori knowledge of clutter covariance matrix to estimate the detector's unknown parameters. Specifically, the target amplitude vector is obtained by maximizing the likelihood function, and the disturbance covariance matrix is reconstructed by solving an optimization that considers both the likelihood maximization and low-rank property of the clutter covariance matrix. The simulation results indicate that this algorithm improves the estimation accuracy, and achieves a better detection performance in the partial observation scenarios. [ABSTRACT FROM AUTHOR]

This paper proposes a new framework for the design of transmit and receive beamformers for interference alignment (IA) without symbol extensions in multi-antenna cellular networks. We consider IA in a G cell network with K users/cell, N antennas at each base station (BS) and M antennas at each user. The proposed framework is developed by recasting the conditions for IA as two sets of rank constraints, one on the rank of interference matrices, and the other on the transmit beamformers in the uplink. The interference matrix consists of all the interfering vectors received at a BS from the out-of-cell users in the uplink. Using these conditions and the crucial observation that the rank of interference matrices under alignment can be determined beforehand, this paper develops two sets of algorithms for IA. The first part of this paper develops rank minimization algorithms for IA by iteratively minimizing a weighted matrix norm of the interference matrix. Different choices of matrix norms lead to reweighted nuclear norm minimization (RNNM) or reweighted Frobenius norm minimization (RFNM) algorithms with significantly different per-iteration complexities. Alternately, the second part of this paper devises an alternating minimization (AM) algorithm where the rank-deficient interference matrices are expressed as a product of two lower-dimensional matrices that are then alternately optimized. Simulation results indicate that RNNM, which has a per-iteration complexity of a semidefinite program, is effective in designing aligned beamformers for proper-feasible systems with or without redundant antennas, while RFNM and AM, which have a per-iteration complexity of a quadratic program, are better suited for systems with redundant antennas. [ABSTRACT FROM PUBLISHER]

The millimeter-wave (mmWave) frequency band is seen as a key enabler of multigigabit wireless access in future cellular networks. In order to overcome the propagation challenges, mmWave systems use a large number of antenna elements both at the base station and at the user equipment, which leads to high directivity gains, fully directional communications, and possible noise-limited operations. The fundamental differences between mmWave networks and traditional ones challenge the classical design constraints, objectives, and available degrees of freedom. This paper addresses the implications that highly directional communication has on the design of an efficient medium access control (MAC) layer. The paper discusses key MAC layer issues, such as synchronization, random access, handover, channelization, interference management, scheduling, and association. This paper provides an integrated view on MAC layer issues for cellular networks, identifies new challenges and tradeoffs, and provides novel insights and solution approaches. [ABSTRACT FROM PUBLISHER]

Spectrum access and interference management are amongst the most challenging issues in device-to-device (D2D) cellular networks. In order to address these issues, this paper introduces spatial spectrum sensing (SSS) for D2D cellular networks to facilitate cellular spectrum sharing by D2D users while providing a quality of service guarantee for cellular users. In order to assess the performance of the proposed scheme, we adopt a stochastic geometry approach in which the locations of base stations and D2D devices are modeled as independent Poisson point processes (PPPs). Assuming that the locations of the active cellular transmitters form another independent PPP, we characterize the area spectral efficiency of D2D networks under cellular users’ outage probability constraint. The use of SSS prohibits D2D transmissions around the active cellular users because of which the locations of the active D2D transmitters are modeled as a Poisson hole process driven by the PPP of active cellular user locations. Our analysis carefully accounts for this spatial separation between active cellular users and active D2D devices. Extensive simulation and numerical results are presented to verify our analysis and demonstrate the advantages of SSS-based D2D cellular networks. [ABSTRACT FROM AUTHOR]

Analog least mean square (ALMS) loop is a promising method to cancel self-interference (SI) in in-band full-duplex (IBFD) systems. In this paper, the steady state analyses of the residual SI powers in both analog and digital domains are firstly derived. The eigenvalue decomposition is then utilized to investigate the frequency domain characteristics of the ALMS loop. Our frequency domain analyses prove that the ALMS loop has an effect of amplifying the frequency components of the residual SI at the edges of the signal spectrum in the analog domain. However, the matched filter in the receiver chain will reduce this effect, resulting in a significant improvement of the interference suppression ratio (ISR). It means that the SI will be significantly suppressed in the digital domain before information data detection. This paper also derives the lower bounds of ISRs given by the ALMS loop in both analog and digital domains. These lower bounds are joint effects of the loop gain, tap delay, number of taps, and transmitted signal properties. The discovered relationship among these parameters allows the flexibility in choosing appropriate parameters when designing the IBFD systems under given constraints. [ABSTRACT FROM AUTHOR]

In this paper, an interference channel with a cognitive relay (IFC-CR) is considered to achieve spectrum sharing between a licensed primary user and an unlicensed secondary user. The CR assists both users in relaying their messages to the respective receivers, under the constraint that the performance of the legacy primary user is not degraded. Without requiring any non-causal knowledge, the CR uses a successive interference cancellation to first decode the primary and secondary messages after a transmission phase. A power allocation is then performed to forward a linear weighted combination of the processed signals in the relaying phase. Closed-form expressions of the end-to-end outage probability are derived for both primary and secondary users under the proposed approach. Furthermore, by exploiting the decoded primary and secondary messages in the first phase, we propose the use of dirty paper coding (DPC) at CR to pre-cancel the interference seen at the secondary (or primary) receiver in the second phase, which results in a performance upper bound for the secondary (or primary) user without affecting the other user. Simulation results demonstrate that with a joint consideration of the power control at the secondary transmitter and the power allocation at CR, performance gains can be achieved for both primary and secondary users. [ABSTRACT FROM AUTHOR]

This paper investigates the symmetric degrees of freedom (DoF) of multiple-input multiple-output (MIMO) cellular networks with $G$ cells and $K$ users per cell, having $N$ antennas at each base station and $M$ antennas at each user. In particular, we investigate techniques for achievability that are based on either decomposition with asymptotic interference alignment or linear beamforming schemes and show that there are distinct regimes of $(G,K,M,N)$ , where one outperforms the other. We first note that both one-sided and two-sided decomposition with asymptotic interference alignment achieve the same DoF. We then establish specific antenna configurations under which the DoF achieved using decomposition-based schemes is optimal by deriving a set of outer bounds on the symmetric DoF. Using these results, we completely characterize the optimal DoF of any $G$ -cell network with single-antenna users. For linear beamforming schemes, we first focus on small networks and propose a structured approach to linear beamforming based on a notion called packing ratios. Packing ratio describes the interference footprint or shadow cast by a set of transmit beamformers and enables us to identify the underlying structures for aligning interference. Such a structured beamforming design can be shown to achieve the optimal spatially normalized DoF (sDoF) of two-cell two-user/cell network and the two-cell three-user/cell network. For larger networks, we develop an unstructured approach to linear interference alignment, where transmit beamformers are designed to satisfy conditions for interference alignment without explicitly identifying the underlying structures for interference alignment. The main numerical insight of this paper is that such an approach appears to be capable of achieving the optimal sDoF for MIMO cellular networks in regimes where linear beamforming dominates asymptotic decomposition, and a significant portion of sDoF elsewhere. Remarkably, polynomial identity test appears to play a key role in identifying the boundary of the achievable sDoF region in the former case. [ABSTRACT FROM AUTHOR]

This paper investigates a new beamforming approach for interference exploitation, which has recently attracted interest as an alternative to conventional interference-avoidance beamforming for the downlink of multiple-input multiple-output systems. Contrary to existing interference exploitation approaches that focus on signal-to-noise ratio performance, we adopt an approach based on the detection region of the signal constellation. Focusing on quality of service, we then formulate the optimization for minimizing the error probability (EP) for the worst user, subject to power constraints. We do this by employing the knowledge of channel state information at the transmitter, along with all downlink users’ data that are readily available at the base station during downlink transmission. In this context, we also show that the detection-region-based beamforming and the worst user EP downlink beamforming are equivalent problems. Finally, we further propose a sum EPs approach and provide an analytic bound of average symbol error rate performance. Our simulations verify that the proposed techniques provide significantly improved performance over conventional downlink beamforming techniques. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a new full-duplex wireless communication system, named ReflectFX, that relies on backscatter modulation. This paper offers a new concept for two-way wireless communication: rather than avoiding self-interference as in half-duplex, or combatting self-interference as in conventional full-duplex, nodes will re-use the received interfering radio-carrier waves to transfer information. The electromagnetic waves are modulated and reflected by the same antenna that receives them. We consider two nodes, a base-station and an end-user, that wish to exchange data over a wireless Rayleigh fading channel with additive white Gaussian noise. With ReflectFX, the end-user receives a self-interference free signal. We improve the transmission range of ReflectFX by adding negative resistance to the end-user load. We derive an expression for the overall achievable throughput and ergodic capacity of ReflectFX. Simulation results show that ReflectFX outperforms both conventional full-duplex and half-duplex. [ABSTRACT FROM PUBLISHER]

This paper investigates low-complexity joint interference avoidance and desired link improvement for single-channel allocation in multiuser multiantenna access points (APs) for open-access small cells. It is considered that an active user is equipped with an antenna array that can be used to suppress interference sources but not to provide spatial diversity. On the other hand, the operation of APs can be coordinated to meet design requirements, where each of which can unconditionally utilize assigned physical channels. Moreover, each AP is equipped with uncorrelated antennas that can be reused simultaneously to serve many active users. The analysis provides new approaches to exploit physical channels, transmit antennas, and APs to mitigate interference, while providing the best possible link gain to an active user through the most suitable interference-free channel. The event of concurrent service requests placed by active users on a specific interference-free channel is discussed for either interference avoidance through identifying unshared channels or desired link improvement via multiuser scheduling. The applicability of the approaches to balance downlink loads is explained, and practical scenarios due to imperfect identification of interference-free channels and/or the scheduled user are thoroughly investigated. The developed results are applicable for any statistical and geometric models of the allocated channel to an active user, as well as channel conditions of interference users. They can be used to study various performance measures. Numerical and simulation results are presented to explain some outcomes of this paper. [ABSTRACT FROM PUBLISHER]

This paper considers a K-user multiple-input multiple-output (MIMO) interference channel (IC) where 1) the channel state information obtained by the transmitters (CSIT) is completely outdated and 2) the number of transmit antennas at each transmitter, i.e., M is greater than the number of receive antennas at each user, i.e., N. The usefulness of the delayed CSIT was first identified in a K-phase retrospective interference alignment (RIA) scheme proposed by Maddah-Ali and Tse for the multiple-input single-output broadcast channel, but the extension to the MIMO IC is a non-trivial step as each transmitter only has the message intended for the corresponding user. Recently, Abdoli et al. focused on a single-input single-output IC and solved such bottleneck by inventing a K-phase RIA with distributed overheard interference retransmission. In this paper, we propose two K-phase RIA schemes suitable for the MIMO IC by generalizing and integrating some key features of both Abdoli's and Maddah-Ali's works. The two schemes jointly yield the best known sum degrees-of-freedom (DoF) performance so far. For the case (M/N)≥K, the achieved sum DoF is asymptotically given by (64/15)N when K→∞. [ABSTRACT FROM PUBLISHER]

This paper studies the two-user causal cognitive interference channel (CCIC), where two transmitters aim to communicate independent messages to two different receivers via a common channel. One source, referred to as the cognitive, is capable of overhearing the other source, referred to as the primary, through a noisy in-band link and thus can assist in sending the primary’s data. The authors of this paper recently characterized to within a constant gap the capacity of the symmetric Gaussian CCIC in: 1) the strong interference regime and 2) for a subset of the weak interference regime when the cooperation link is larger than a given threshold. This paper characterizes to within a constant gap the capacity for the symmetric Gaussian CCIC in the regime that was still open. To this end, two novel outer bounds of the types 2 R\mathsf {p}+ R\mathsf {c} and R\mathsf {p}+2 R\mathsf {c} are derived for the class of injective semideterministic CCICs, where the noises at the different source-destination pairs are independent. These outer bounds, as well as an achievable rate region based on Gelfand-Pinsker binning, superposition coding, and simultaneous decoding at the receivers, are then specialized to the Gaussian noise case. It is shown that the novel outer bounds are necessary to characterize the capacity within a constant gap when the cooperation link is weaker than the direct links, that is, in this regime unilateral cooperation leaves some system resources underutilized. [ABSTRACT FROM PUBLISHER]

In this paper, two major multiple-input-multiple-output (MIMO) transmission techniques such as spatial modulation (SM) and spatial multiplexing (SMX) are considered. In particular, the focus is on an interference scenario, where an SM MIMO system interferes with a conventional SMX MIMO system. The interference caused by SM has a peculiar behavior. In SMX MIMO networks, the interference subspace is fixed in a given coherence time interval. It can be estimated accurately, and interference suppression techniques can be applied accordingly. However, the interference caused by an SM system has no fixed interference subspace, and it changes in every single channel use. Therefore, SM interference could pose some unique challenges to SMX MIMO systems in some scenarios. In this paper, the effect of SM interference on SMX MIMO systems and methods to overcome/reduce the adverse effects caused by SM interference are studied. Furthermore, the effect of SMX interference on SM MIMO systems is also studied. [ABSTRACT FROM AUTHOR]

This paper investigates a disintegrated channel estimation technique required to accomplish the spatial diversity supported by cooperative relays. The relaying strategy considered herein is a filter-and-forward (FF) relaying method with superimposed training sequences for separately estimating the backhaul and access channels. To reduce inter-relay interference, a generalized filtering technique is proposed and investigated thoroughly. Unlike the interference suppression method commonly used in the conventional FF relay networks, the generalized filtering matrix essentially multiplexes the superimposed training sequences from different relays to the destination by time-division multiplexing, frequency-division multiplexing, and code-division multiplexing methods. The Bayesian Cramér–Rao lower bounds (BCRBs) for this channel estimation problem are derived as the estimation performance benchmarks. The mean square errors (MSEs) of the disintegrated channel estimates are also derived. Finally, the improvements offered by the proposed technique are verified by comprehensive computer simulations in conjunction with the calculations of the BCRBs and the MSEs derived in this paper. [ABSTRACT FROM AUTHOR]

Two key traits of 5G cellular networks are much higher base station (BS) densities—especially in the case of low-power BSs—and the use of massive MIMO at these BSs. This paper explores how massive MIMO can be used to jointly maximize the offloading gains and minimize the interference challenges arising from adding small cells. We consider two interference management approaches: joint transmission (JT) with local precoding, where users are served simultaneously by multiple BSs without requiring channel state information exchanges among cooperating BSs, and resource blanking, where some macro BS resources are left blank to reduce the interference in the small cell downlink. A key advantage offered by massive MIMO is channel hardening, which enables to predict instantaneous rates a priori. This allows us to develop a unified framework, where resource allocation is cast as a network utility maximization (NUM) problem, and to demonstrate large gains in cell-edge rates based on the NUM solution. We propose an efficient dual subgradient based algorithm, which converges towards the NUM solution. A scheduling scheme is also proposed to approach the NUM solution. Simulations illustrate more than 2x rate gain for 10th percentile users vs. an optimal association without interference management. [ABSTRACT FROM PUBLISHER]

This paper concerns the uplink of multicell multiuser multiple-input multiple-output (MIMO) systems. To tackle the effect of pilot contamination that is generally viewed as a bottleneck in previous work, this paper presents a superimposed pilot (SP)-aided uplink channel estimation scheme and mathematically characterizes the impact that an SP has on the performance of such a very large MIMO system. It is shown that there are two types of interference components that do not vanish, even when the number of antennas $M$ grows to infinity. The first type, which is referred to as cross-contamination, is due to the correlation between the SP and data among different cells. The second type, which is referred to as self-contamination, is due to the dependence between channel estimation and estimation error. Cross-contamination is, in principle, similar to pilot contamination in a conventional pilot-based multicell MIMO system, whereas self-contamination is unique for the SP-aided scheme. Both theoretical and simulation results demonstrate that the SP-aided scheme can effectively reduce the estimation contamination by increasing the data frame size and, in turn, achieve a significant improvement over the spectral efficiency, in comparison with conventional pilot-based methods. [ABSTRACT FROM AUTHOR]

Full-duplex transmission is a promising technique to enhance the capacity of relay communications. In this paper, we investigate the power and location optimization for full-duplex decode-and-forward (DF) relaying systems. The outage probability is adopted as the optimization criterion and a two-dimensional (2D) optimization problem is formulated for systems with and without the direct source–destination link. Analytical and numerical results are provided to demonstrate advantages of the power and location optimization. More interestingly, the effect of residual self-interference (RSI) introduced by full-duplex transmission is investigated in terms of the optimal power allocation and relay location deployment and the outage probability performance improvement. Furthermore, we show that the minimal outage probability can be achieved via joint power-location optimization. The effect of power optimization on the outage performance is also compared between full-duplex and half-duplex relaying. [ABSTRACT FROM AUTHOR]

This paper investigates methods to achieve high-rate data transmission through metallic barriers using ultrasound. Multiple-input-multiple-output-orthogonal frequency division multiplexing (MIMO-OFDM) is employed in conjunction with interference mitigation techniques to reduce throughput-limiting crosstalk. Several crosstalk mitigation strategies are investigated and their theoretical and practical bit-loaded data rates are determined for the general case of $A$ transmitters and $A$ receivers ($A \times A$ MIMO). A physical MIMO acoustic-electric channel array is formed using a 40 mm (1.575 in) thick steel barrier with seven pairs of 4 MHz nominal resonant frequency piezoelectric disk transducers, each with 10 mm (0.394 in) diameter. To investigate the effects of crosstalk, the transducers are closely spaced, and each transmitter–receiver pair is coaxially aligned on opposing sides of the metallic barrier. It is shown that, with the use of crosstalk mitigation techniques, the aggregate multichannel theoretical capacity performance scales linearly with the number of channels. This paper also investigates the use of novel power allocation techniques in a MIMO-OFDM acoustic-electric channel, which show significant throughput performance gains over conventional bit-loading and greedy bit-filling techniques. Finally, this paper presents a study on the effects of transducer misalignment on the multichannel theoretical capacity and achievable data transmission rates using bit-loading techniques. [ABSTRACT FROM AUTHOR]

Driven by 5G requirements, research on alternatives to the popular cyclic-prefix orthogonal frequency division multiplexing (CP-OFDM) waveform recently arose. In particular, non-orthogonal circularly filtered waveforms such as generalized frequency division multiplexing (GFDM) were proposed due to flexibility and robustness. Applying multiple-input multiple-output (MIMO) techniques for future wireless networks are unquestionable and thereby compulsory for any alternative waveform. Despite advancements in accurate MIMO detection algorithms for GFDM, compared with CP-OFDM their complexity still exhibited a higher order of magnitude, impeding an energy-efficient implementation. In this paper, we propose a low-complexity formulation for iterative minimum mean squared error with parallel interference cancellation (MMSE-PIC) detection for non-orthogonal waveforms with localized inter-carrier interference, where we focus on the application to MIMO-GFDM. The proposal achieves complexity similar to CP-OFDM and we evaluate its performance under realistic channel conditions with imperfect channel state information, where we obtain up to 2-dB gain of GFDM compared with OFDM. We confirm our findings by analyzing the measured extrinsic information transfer charts and show that the proposal achieves the performance of optimal maximum likelihood detection. The results point out the MMSE-PIC algorithm as a viable technique for iterative MIMO receiver implementations for non-orthogonal waveforms. [ABSTRACT FROM AUTHOR]

To cope with the interference problem in three-cell wireless relay systems, this paper proposes two schemes that perform interference suppression and multiuser detection. The proposed schemes do not require channel state information (CSI) feedback, and their computational complexity is much less than that of the maximum likelihood detection (MLD), which is considered in the optimal detection scheme. Of the two proposed schemes, the minimum mean-square error (MMSE)-based scheme estimates the weight coefficients for the interference suppression under the MMSE criterion. The other proposed scheme, the recursive least squares (RLS)-based scheme, directly estimates the weight coefficients using the RLS algorithm. The RLS-based scheme only requires two preamble sequences, whereas both the MMSE-based schemes and the MLD require the knowledge of all the three preamble sequences. Therefore, the RLS-based scheme can be considered more feasible. Moreover, computer simulations results and theoretical average bit error rate (BER) upper bounds of orthogonal frequency-division multiplexing transmission under three-cell and frequency-selective fading conditions were provided. It was observed that simulation results are consistent with theoretical upper bounds and that the RLS-based scheme achieves a BER performance that is identical to that of the MMSE-based scheme with perfect CSI while requiring much less computational complexity than the MLD. [ABSTRACT FROM AUTHOR]

Filtered orthogonal frequency division multiplexing (F-OFDM) system is a promising waveform for 5G and beyond to enable the multi-service system and spectrum efficient network slicing. However, the performance for F-OFDM systems has not been systematically analyzed in the literature. In this paper, we first establish a mathematical model for an F-OFDM system and derive the conditions to achieve the interference-free one-tap channel equalization. In the practical cases (e.g., insufficient guard interval, asynchronous transmission, and so on), the analytical expressions for inter-symbol interference, inter-carrier interference, and adjacent-carrier interference are derived, where the last term is considered as one of the key factors for asynchronous transmissions. Based on the framework, an optimal power compensation matrix is derived to make all of the subcarriers having the same ergodic performance. Another key contribution of this paper is that we propose a multi-rate F-OFDM system to enable low-complexity low-cost communication scenarios, such as narrow-band Internet of Things, at the cost of generating inter-subband interference (ISubBI). Low computational complexity algorithms are proposed to cancel the ISubBI. The result shows that the derived analytical expressions match the simulation results, and the proposed ISubBI cancelation algorithms can significantly save the original F-OFDM complexity (up to 100 times) without significant performance loss. [ABSTRACT FROM PUBLISHER]

This paper characterizes the performance in terms of queueing stability of a network composed of multiple MIMO transmitter-receiver pairs taking into account the dynamic traffic pattern and the probing/feedback cost. We adopt a centralized scheduling scheme that selects a number of active pairs in each time-slot. We consider that the transmitters apply interference alignment (IA) technique if two or more pairs are active, whereas in the special case where one pair is active point-to-point MIMO singular value decomposition (SVD) is used. We consider a time-division duplex (TDD) system where transmitters acquire their channel state information (CSI) by decoding the pilot sequences sent by the receivers. Since global CSI knowledge is required for IA, the transmitters have also to exchange their estimated CSIs over a backhaul of limited capacity (i.e. imperfect case). Under this setting, we characterize in this paper the stability region of the system under both the imperfect and perfect (i.e. unlimited backhaul) cases, then we examine the gap between these two resulting regions. Further, under each case we provide a centralized probing policy that achieves the max stability region. These stability regions and scheduling policies are given for the symmetric system, where all the path loss coefficients are equal to each other, as well as for the general system. For the symmetric system, we provide the conditions under which IA yields a queueing stability gain compared to SVD. Under the general system, the adopted scheduling policy is of a high computational complexity for moderate numbers of pairs, consequently we propose an approximate policy that has a reduced complexity but that achieves only a fraction of the system stability region. A characterization of this fraction is provided. [ABSTRACT FROM PUBLISHER]

Statistical characterization of the signal-to-interference-plus-noise ratio (SINR) via its cumulative distri- bution function is ubiquitous in a vast majority of technical contributions in the area of cellular networks, since it boils down to averaging the Laplace transform of the aggregate interference, a benefit accorded at the expense of confinement to the simplistic Rayleigh fading. In this paper, to capture diverse fading channels that arise in realistic outdoor/indoor wireless communication scenarios, we tackle the problem differently. By exploiting the moment generating function of the SINR, we succeed in analytically assessing cellular networks performance over the shadowed $\kappa$ – $\mu$ , $\kappa$ – $\mu$ , and $\eta$ – $\mu$ fading models. These channel models offer high flexibility by capturing diverse fading channels, including Rayleigh, Nakagami- $m$ , Rician, and Rician shadow fading distributions. These channel models have been recently promoted for their capability to accurately model dense urban environments, future femtocells, and device-to-device shadowed channels. In addition to unifying the analysis for different channel models, this paper integrates the coverage, the achievable rate, and the bit error probability, which are largely treated separately in the literature. The developed model and analysis are validated over a broad range of simulation setups and parameters. [ABSTRACT FROM PUBLISHER]

This paper investigates nonlinear transceiver design for full-duplex multiple-input multiple-output (FD-MIMO) relay systems. A dual-hop amplify-and-forward relaying protocol is considered. At the destination, nonlinear successive-interference-cancellation (SIC) is used for signal detection. The goal is to find the source and relay precoders such that the symbol-vector error rate (SVER) can be minimized. Due to the loop interference (LI), optimizing the relay precoder in FD systems is much more involved. In this paper, we propose novel designs to solve this problem. Starting from the QR-SIC receiver, we theoretically show that the relay precoder can be solved with a closed-form expression even when the system incurs LI. Then, we consider the system with a minimum mean-squared-error SIC receiver, where the relay precoder design entails a different problem formulation and introduces new challenges. We propose a novel iterative method, with closed-form solutions in each iteration, to solve this problem. Simulations show that our designs can significantly improve the SVER performance for FD-MIMO relay systems. [ABSTRACT FROM AUTHOR]

It is known that superposition signaling in Gaussian interference networks is capable of improving the achievable rate region. However, the problem of maximizing the rate gain offered by superposition signaling is computationally prohibitive, even in the simplest case of two-user single-input single-output interference networks. This paper examines superposition signaling for the general multiple-input multiple-output broadcast Gaussian interference networks. The problem of maximizing either the sum rate or the minimal user’s rate under superposition signaling and dirty paper coding is solved by a computationally efficient path-following procedure, which requires only a convex quadratic program for each iteration but ensures convergence at least to a locally optimal solution. Numerical results demonstrate the substantial performance advantage of the proposed approach. [ABSTRACT FROM AUTHOR]

This paper studies the fundamental tradeoff between storage and latency in a general wireless interference network with caches equipped at all transmitters and receivers. The tradeoff is characterized by an information-theoretic metric, normalized delivery time (NDT), which is the worst case delivery time of the actual traffic load at a transmission rate specified by degrees of freedom of a given channel. We obtain both an achievable upper bound and a theoretical lower bound of the minimum NDT for any number of transmitters, any number of receivers, and any feasible cache size tuple. We show that the achievable NDT is exactly optimal in certain cache size regions, and is within a bounded multiplicative gap to the theoretical lower bound in other regions. In the achievability analysis, we first propose a novel cooperative transmitter/receiver coded caching strategy. It offers the freedom to adjust file splitting ratios for NDT minimization. We then propose a delivery strategy that transforms the considered interference network into a new class of cooperative X-multicast channels. It leverages local caching gain, coded multicasting gain, and transmitter cooperation gain (via interference alignment and interference neutralization) opportunistically. Finally, the achievable NDT is obtained by solving a linear programming problem. This paper reveals that with caching at both transmitter and receiver sides, the network can benefit simultaneously from traffic load reduction and transmission rate enhancement, thereby effectively reducing the content delivery latency. [ABSTRACT FROM PUBLISHER]

In this paper, we propose a channel transformation technique for joint decoding of desired and interfering signals in an interference alignment scenario consisting of $K$ users with multiple antennas. Our technique, i.e., pseudo-lattice treatment, is based on the compute-and-forward framework. Our technique can be implemented to provide decoding gains with low complexity for subspace aligned interference signals. We evaluate the performance of the system through simulations that show the performance gain attained by using our pseudo-lattice method over subspace decoding techniques for interference alignment in low- and medium-SNR conditions. [ABSTRACT FROM AUTHOR]

This paper examines the impact of system parameters such as access point density and bandwidth partitioning on the performance of randomly deployed, interference-limited, dense wireless networks. While much progress has been achieved in analyzing randomly deployed networks via tools from stochastic geometry, most existing works either assume a very large user density compared to that of access points, which does not hold in a dense network, and/or consider only the user signal-to-interference-ratio as the system figure of merit, which provides only partial insight on user rate as the effect of multiple access is ignored. In this paper, the user rate distribution is obtained analytically, taking into account the effects of multiple access as well as the SIR outage. It is shown that user rate outage probability is dependent on the number of bandwidth partitions (subchannels) and the way they are utilized by the multiple access scheme. The optimal number of partitions is lower bounded for the case of large access point density. In addition, an upper bound of the minimum access point density required to provide an asymptotically small rate outage probability is provided in closed form. [ABSTRACT FROM AUTHOR]

To efficiently trade off system sum rate and link fairness, power allocation in wireless spectrum-sharing networks often concentrates upon proportional fairness. The corresponding problem has been proved to be convex for a single tone but NP-hard for more than two tones. However, in the two-tone case, the complexity of the problem for achieving proportional fairness has not been addressed yet. In this paper, we prove that the issue of proportional-fairness optimization for the two-tone situation is NP-hard by reducing the problem of finding the maximum independent set in an undirected graph to it. Moreover, a computationally efficient algorithm is proposed to provide an efficient suboptimal solution. Simulation results are presented to illustrate the effectiveness of our proposal. [ABSTRACT FROM PUBLISHER]

In this paper, we consider a general centralized feedback model for interference alignment (IA) algorithms of which precoders and decoders are designed with quantized channel state information (CSI) at a central unit and then fed back to corresponding transmitters and receivers via finite-rate links. The significant difference of this model from existing models is that all the realizations of channels, precoders, and decoders are fed back by finite rates. The signal-to-interference-plus-noise ratio (SINR) characteristic of this model is analyzed, which helps derive an upper bound of average throughput loss relative to perfect IA. The upper bound is shown to be tight by simulation, particularly in the high-feedback regime. Based on this result, the scaling laws of feedback bits for channels, precoding, and decoding vectors to obtain full degree of freedom are derived, which are backward compatible to the existing results for quantized CSI only or quantized precoder only. Simulation results show that the system is interference limited at a high signal-to-noise ratio (SNR) if the three scaling laws are not simultaneously satisfied, and the throughput performance is dominantly limited by the worst feedback links among the channels, precoders, and decoders. [ABSTRACT FROM PUBLISHER]

In this paper, we consider nonregenerative multipair two-way relaying systems, where a relay node supports $K$ pairs of two-way communications in the presence of imperfect channel state information (CSI). We employ a stochastic approach to model the channel uncertainties and study a robust beamforming design at the relay. It is shown that the proposed beamformer provides a reduction in the computational complexity, as well as good robustness against channel errors, compared with conventional designs. To reduce the estimation overhead at the users, we also suggest an efficient downlink training method to inform the users of the channel-dependent self-interference cancellation (SIC) parameters. With the training method, the additive noise may incur a malfunction of the SIC. To address this issue, we develop an intelligent selection criterion that decides whether the SIC should be adopted or not. Finally, from simulation results, we demonstrate the efficiency of our proposed schemes. [ABSTRACT FROM PUBLISHER]

The theory of compressed sensing (CS) asserts that an unknown signal x\in \mathbb R ^p can be accurately recovered from an underdetermined set of n linear measurements with n\ll p provided that x is sufficiently sparse. However, in applications, the degree of sparsity is typically unknown, and the problem of directly estimating \|x\|_{0} has been a longstanding gap between theory and practice. A closely related issue is that \|x\|_{0} is a highly idealized measure of sparsity, and for real signals with entries not equal to 0, the value \|x\|0=p is not a useful description of compressibility. In our previous conference paper [1] that examined these problems, we considered an alternative measure of soft sparsity, \|x\|1^{2}/\|x\|2^{2} , and designed a procedure to estimate \|x\|1^{2}/\|x\|2^{2} that does not rely on sparsity assumptions. This paper offers a new deconvolution-based method for estimating unknown sparsity, which has wider applicability and sharper theoretical guarantees. In particular, we introduce a family of entropy-based sparsity measures sq(x)=\big ({\|x\|q}/{\|x\|1}\big )^{({q}/{1-q})} parameterized by q\in [0,\infty ] . This family interpolates between \|x\|_{0}=s_{0}(x) and \|x\|_{1}^{2}/\|x\|_{2}^{2}=s_{2}(x) as q ranges over [0, 2]. For any q\in (0,2]\setminus \{1\} , we propose an estimator \hat {s}_{q}(x) whose relative error converges at the dimension-free rate of 1/\sqrt n , even when p/n\to \infty . Our main results also describe the limiting distribution of \hat sq(x) , as well as some connections to basis pursuit denosing, the Lasso, deterministic measurement matrices, and inference problems in CS. [ABSTRACT FROM PUBLISHER]

Multipath interference commonly exists in wireless communication, navigation and radar systems, which may cause severe signal fading and bit error rate (BER) performance degradation. Therefore the detection of multipath interference is urgently needed. This paper proposes a high order statistics (HOS) based multipath interference detection method, since the HOS of the received signal show distinct difference when multipath interference exists. Moreover, the generalized theoretical values of the moments and cumulants, which release the demand for prior knowledge of timing information and symbol period, are deduced in this paper. It makes the proposed HOS features based detection method robust in blind environment. Computer simulations are performed to verify the proposed method. [ABSTRACT FROM AUTHOR]

Coordinated multipoint joint transmission (JT) is a vital technique of the fifth-generation (5G) networks to increase throughput but causes a significant burden on network backhaul because the same user data must distribute to multiple base stations, called a JT cluster. Thus, many studies have explored how to reduce backhaul data traffic using caching user data at base stations. Millimeter wave (mmWave) mesh backhaul is a promising architecture for small cells to exchange cache data over 5G networks. However, this paper observes that inappropriate JT clusters and routing paths will result in unnecessary mmWave mesh backhaul bandwidth consumption such that the performance gain of the JT will be reduced. Therefore, in this paper, we study the JT clustering problem with the consideration of caches at base stations and mmWave mesh backhaul. The objective is to minimize total backhaul traffic while satisfying the data rate requirement of each user under limited radio resource units. We propose a two-stage algorithm based on dynamic programming approach to solve the problem. We prove that the dynamic programming algorithm can find an optimal solution for our subproblem. The simulation results provide several insights and show that compared with two baseline algorithms, our proposed algorithm can significantly reduce more backhaul bandwidth consumption. [ABSTRACT FROM AUTHOR]

Multi-hop device-to-device (D2D) communications play an important role in expanding D2D coverage. In this paper, we study a relay-based and network-coding-assisted (in particular, XOR coding) multi-hop D2D communication system. In the system, toward jointly considering the impact of interference and network traffic conditions on the quality of D2D communications, various channel fading models and traffic models are investigated, and the packet loss probability of D2D links is meticulously computed using these models. With the packet loss probability of D2D links, the general closed-form expressions of end-to-end packet loss probability (E2EPLP) of the system with the presence (or absence) of XOR coding are subsequently derived. Our experiments reveal that both the number of relays and the mechanism of XOR coding can affect the system performance. Specifically, the increase in the number of relays will lower the overall system performance (e.g., an increase in the E2EPLP and end-to-end completion time, and a decrease of the end-to-end rate may follow as a result). On the other hand, although the presence of XOR coding unfortunately raises the system E2EPLP, it can effectively improve the end-to-end completion time and end-to-end rate. It is our belief that the analytical approach proposed in this paper and the results found in our work can be useful to peer studies in the context of applying network coding in multi-hop D2D networks. [ABSTRACT FROM AUTHOR]

In this paper, a new transmission scheme, signal space cognitive cooperation, is introduced by applying the idea of signal space diversity in an underlay spectrum sharing decode-and-forward multirelay cooperative network. In the proposed structure, the secondary source signal is rotated by a certain angle and then the source and the secondary best relay transmit the in-phase and the quadrature components of the rotated signal. As a consequence, two source signals, rather than one, are transmitted in two-time slots which improves data rates considerably, compared to the conventional cognitive cooperative schemes. In this paper, proactive relaying mode is used in which the best relay is selected based on the max–min selection criterion before executing the transmission. Considering both statistical and the instantaneous channel state information of the feedback channel between the primary receiver and the secondary network, two power allocation methods are adopted at the source. For both methods, closed-form expressions of error probability are derived. Moreover, asymptotic analysis is performed and diversity gain is obtained to provide further insights about the system performance. Finally, analytical expressions are verified by Monte Carlo simulations. [ABSTRACT FROM AUTHOR]

In this paper, the problem of downlink non-orthogonal multiple access (NOMA) over slow fading channels is studied. Full-channel state information (CSI) is assumed at the receivers, while only the statistical CSI is assumed to be available at the transmitter. A novel lattice-partition-based scheme is proposed which, according to statistical CSI, employs discrete inputs from appropriately designed constellations carved from a lattice, rather than continuous Gaussian inputs as used in most existing works. Theoretical analysis shows that for any outage probability smaller than 63.21%, which covers almost all the cases of practical interest, the proposed scheme with single-user decoding, i.e., without successive interference cancellation (SIC) is able to approach the NOMA outage capacity region within a constant gap, independent of the signal-to-noise ratio, and the number of users. Simulation results fortify the effectiveness of the proposed scheme by showing that the approach without SIC can achieve outage rates that are very close to the outage capacity region and the gap becomes even smaller when SIC is employed. [ABSTRACT FROM AUTHOR]

This paper investigates the performance of a dual-hop decode-and-forward (DF) relaying-aided land mobile satellite communication over Shadowed-Rician (SR) fading channels. A practical model for the satellite relaying system is first developed, where the impacts of satellite multi-beam antenna, radio propagation loss, and random shadowing are taken into account. Next, by assuming that the multi-beam satellite suffers from hardware impairments (HIs) and is perturbed by interference signals, we derive an equivalent end-to-end signal-to-interference-plus-noise-and-distortion-ratio of the system, and justify that the maximum ratio transmission at the source and the maximum ratio combining at the destination are the optimal transmit-receive beamforming schemes on the proposed HIs model. Then, closed-form expressions for the probability density function (PDF) of the sum of independent and identically distributed (i.i.d) squared SR random variables in the case of integer and rational Nakagami- $m$ fading parameters are derived. Based on the derived PDF, new analytical expressions for the outage probability (OP) and average throughput are obtained in the presence of HIs and interference. Moreover, the asymptotic OP and average throughput at high signal-to-noise ratio are investigated to reveal the achievable diversity order of the system. Finally, Monte Carlo simulation results are provided to corroborate the analytical results. [ABSTRACT FROM AUTHOR]

The existing proactive caching policies are designed by assuming that all users request contents with identical activity level at uniformly distributed or known locations, among which most of the policies are optimized by assuming that user preference is identical to content popularity. However, these assumptions are not true based on the recent data analysis. In this paper, we investigate what happens without these assumptions. To this end, we establish a framework to optimize caching policy for base stations exploiting heterogeneous user preference, activity level, and spatial locality. We derive success probability and average rate of each user as utility function, respectively, and obtain the optimal caching policy maximizing a weighted sum of average utility (reflecting network performance) and minimal utility of users (reflecting user fairness). To investigate the intertwined impact of individual user request behavior on caching, we provide an algorithm to synthesize user preference from given content popularity and activity level with controlled preference similarity and validate the algorithm with the real datasets. Analysis and simulation results show that exploiting individual user behavior can improve both network performance and user fairness, and the gain increases with the skewness of spatial locality, and the heterogeneity of user preference and activity level. [ABSTRACT FROM AUTHOR]

This paper analyzes the network connectivity in vehicular networks with slight traffic interference, i.e., small-scale traffic accident. In this paper, we develop an analytical model for highway scenarios or sparse urban scenarios, where the slight traffic interference can make the vehicles slow down rather than block the traffic flow. When a traffic accident occurs, it is necessary to inform the nearby vehicles to slow down in order to reduce congestion at the accident location. Once they pass by, they can return to the normal value. Consequently, we can divide an entire road into two or three subsections, which helps us to analyze the connectivity performance. In addition, we analyze the impact of several key parameters on connectivity probability, including vehicle arrival rate, vehicle communication range, length of road, vehicle normal speed, and safe speed. All analytical results are verified through Monte Carlo simulation experiments. The simulation results are very close to analytical results, which means that the analytical results are accurate and the analytical model we propose is effective. [ABSTRACT FROM AUTHOR]

Electronically scanned phased-array antennas need to function in an interference-rich environment as an integral part of millimeter-wave 5G networks. In these scenarios, multiple interferers’ incident from different directions can create intermodulation products that can severely degrade the system sensitivity. This paper first presents the theoretical analysis of intermodulation effects in a receive-mode phased array and then shows the detailed experimental verification of multiple interferer effects on a 28-GHz 5G phased array. It is shown that the third-order intermodulation products generated by the interferers peak at certain predictable scan angles depending on the interferer directions of arrival and can limit the sensitivity of the phased array. The interferers degrade the system sensitivity even if incident in the direction of pattern nulls. Two scan-angle-dependent third-order input intercept point (IIP3) definitions are given for a phased array and their implications are discussed. It is shown that while a phased array does result in an input P1dB improvement as the number of elements increases (handles more incident power than a single channel), it does not result in an IIP3 improvement over a single channel as the number of elements increases. Theoretical predictions are also verified by extensive numerical simulations and measurement results for multiple interferers from different directions. Finally, the IIP3 degradation in mechanically scanned antennas is analyzed and it is shown that such antennas are much more robust than phased arrays for wide angle interferers. [ABSTRACT FROM AUTHOR]

A base-station (BS) equipped with multiple antennas can use its spatial dimensions in three different ways: 1) to serve multiple users, thereby achieving a multiplexing gain; 2) to provide spatial diversity in order to improve user rates; and 3) to null interference in neighboring cells. This paper answers the following question: What is the optimal balance between these three competing benefits? We answer this question in the context of the downlink of a cellular network, where multi-antenna BSs serve multiple single-antenna users using zero-forcing beamforming with equal power assignment, while nulling interference at a subset of out-of-cell users. Any remaining spatial dimensions provide transmit diversity for the scheduled users. Utilizing tools from stochastic geometry, we show that, surprisingly, to maximize the per-BS ergodic sum rate, with an optimal allocation of spatial resources, interference nulling does not provide a tangible benefit. The strategy of avoiding inter-cell interference nulling, reserving some fraction of spatial resources for multiplexing, and using the rest to provide diversity, is already close-to-optimal in terms of the sum-rate. However, interference nulling does bring significant benefit to cell-edge users, particularly when adopting a range-adaptive nulling strategy where the size of the cooperating BS cluster is increased for cell-edge users. [ABSTRACT FROM AUTHOR]

A fractional frequency reuse (FFR) system is an inter-cell interference coordination scheme used in cellular networks. In FFR systems, the available bandwidth is partitioned into orthogonal subbands such that the users near the cell center adopt subbands of a frequency reuse (FR) factor equal to one (i.e., Full FR), and the users near the cell edge adopt the subbands of an FR factor greater than one (i.e., Partial FR). The proper design of Full FR coverage, which is used to distinguish Full FR regions from Partial FR regions, plays a critical role in FFR system performance. This paper studies the optimal Full FR coverage that maximizes system throughput in the downlink in multiple-input multiple-output (MIMO) cellular networks. For MIMO systems, orthogonal space–time block codes are considered. We analytically compare the outage probabilities of Full FR and Partial FR for a given user’s location, where the outage probability is evaluated through small-scale multipath fading. By doing so, subject to the constraint that a given target outage probability (quality-of-service) is satisfied, the optimal Full FR coverage is analyzed as a function of base station (BS) power. We prove that the optimal Full FR coverage is a non-increasing function of BS power when the powers of all BSs in the network are scaled up or down at the same rate. This result offers insight into the design of Full FR coverage in relation to BS power; we gain insight into the complicated relationship between crucial FFR design parameters. [ABSTRACT FROM AUTHOR]