Search

In wireless networks, the link connectivity may be intermittent due to shadowing, burstiness of data arrival, or uncoordinated resource allocation. In this paper, we model the intermittence of links as Bernoulli distributed random channel states, termed intermittence channel states, and study the impact of the corresponding channel state information at the transmitter (CSIT) in a two-user Gaussian broadcast channel (BC). Moreover, due to the heterogeneous timeliness of intermittence channel states, the CSIT considered in this paper is hybrid. More specifically, the CSIT of each link can be perfectly (causally or non-causally) available, delayed, or not available. When the links are connected, we adopt a general setting that the received signal-to-noise ratios can be different. Our contribution is the characterization of the capacity regions of intermittent Gaussian BC to within bounded gaps for all combinations of hybrid CSIT, except for scenario DN (delayed CSIT of receiver 1, no CSIT of receiver 2). For scenario DN, we propose an opportunistic physical layer network coding scheme that achieves a strictly larger degree-of-freedom (DoF) region than the no-CSIT DoF region. As a corollary, single-user CSIT is able to increase the sum DoF for intermittent Gaussian BC (also the capacity region for the erasure BC, as a by-product). This result is in sharp contrast to the recent negative result by Davoodi and Jafar, where it is shown that for fast-fading multiple-input single-output BC with continuous channel states, single-user CSIT does not help at all in terms of sum DoF. [ABSTRACT FROM AUTHOR]

This paper derives the asymptotic distribution of the normalized $k$ -th maximum order statistics of a sequence of non-central chi-square random variables with non-identical non-centrality parameters. We demonstrate the utility of these results in characterizing the signal-to-noise ratio in three different applications in wireless communication systems where the statistics of the $k$ -th maximum channel power over Rician fading links are of interest. Furthermore, we derive simple expressions for the asymptotic outage probability, average throughput, achievable throughput, and average bit error probability. The proposed results are validated via extensive Monte Carlo simulations. [ABSTRACT FROM AUTHOR]

In this paper, we investigate device-to-device (D2D) communication networks which are one of the key technologies for next-generation mobile communication networks and many other applications such as unmanned aerial vehicles (UAVs), vehicle-to-vehicle (V2V), and Internet of things (IoT). The overlay D2D communication networks that are considered in our study use dedicated radio resources separate from what cellular networks use and there exists co-channel interference in D2D networks without cross-channel interference between two networks. We propose a new transmission scheme for overlay D2D networks that uses a dueling deep reinforcement learning (DRL) architecture. The DRL is especially effective in environments where actions do not affect subsequent states as in wireless communication networks. The main contribution of this paper is that the proposed architecture is designed to utilize only information that each D2D devices can easily obtain by measuring channels. The proposed scheme thus enables D2D devices to train their own neural networks and to decide autonomously whether to transmit data without any intervention from infrastructures. The performance of the proposed scheme is analyzed in terms of average sum-rates and is compared to three baseline schemes. Simulation results show that the proposed scheme can achieve almost optimal sum-rates with low signal-to-noise (SNR) values without any intervention from infrastructure. [ABSTRACT FROM AUTHOR]

Symbiotic radio (SR) is a promising technology for energy- and spectrum-efficient wireless communication, which exploits passive communication for Internet-of-Things (IoT) transmission and achieves a mutualistic spectrum sharing between the passive and active transmissions. In this paper, we study an reconfigurable intelligent surface (RIS) empowered symbiotic radio over a broadcasting system, i.e., a base station (BS) broadcasts signals to multiple primary receivers (PRs) under the assistance of an RIS, while the RIS also transmits information to an IoT receiver (IR) by riding over the broadcasting signals. We formulate a problem to minimize the BS’s transmit power by jointly optimizing the BS’s active precoding and the RIS’s passive beamforming, under the signal-to-noise-ratio constraints of the primary and IoT transmissions. However, the problem is challenging to be solved optimally, since the variables are coupled and the constraints are non-convex. An iterative algorithm based on block coordinated descent (BCD) and semidefinite relaxation (SDR) techniques is first proposed, and its convergence together with complexity are analyzed. Then, to tackle the problem of high computational complexity caused by SDR technique, we further propose an alternative algorithm based on generalized power method (GPM) technique. Simulation results validate that the proposed system outperforms the traditional broadcasting system without RIS. The GPM-based algorithm achieves nearly the same transmit power performance as SDR-based algorithm, with a significantly reduced computational complexity. [ABSTRACT FROM AUTHOR]

In this paper, a mixture Gamma shadowed (MGS) model is proposed as a unified composite distribution via representing the shadowing impact by an inverse Nakagami- $m$. The exact expression and the asymptotic behaviour at high average signal-to-noise ratio (SNR) regime of the fundamental statistics of a MGS distribution are derived first. These statistics are then applied to analyze the performance of the wireless communication systems over double shadowed $\kappa$ - $\mu$ fading channels. In particular, the outage probability (OP), average bit error probability (ABEP), average channel capacity (ACC), effective capacity (EC) and average area under the receiver operating characteristics curve (AUC) of energy detection (ED) are provided. The numerical and simulation results as well as a comparison with previous exact works are presented to verify the validation of our analysis. [ABSTRACT FROM AUTHOR]

The level crossing rate (LCR) is an important second-order statistical quantity that characterizes the rate of occurrence of fading time intervals. In this paper, we investigate the LCR of multiantenna flat-fading channels in the presence of additive white Gaussian noise and cochannel interferers with unequal received powers and Doppler shifts. We first present a unified approach to derive the exact LCR of the signal-to-interference-noise ratio at a receiver, where maximum ratio combining is deployed over spatially correlated or uncorrelated systems. Through the exact LCR derivation, we identify an accurate approach to obtain a simplified approximate LCR expression in the spatially uncorrelated system case. Benefits of the LCR expressions derived in the paper are demonstrated in two important applications: 1) the packet error rate is evaluated through the finite-state Markov channel model; and 2) the optimum packet length to maximize the throughput of the system with the stop-and-wait automatic repeat request protocol is derived. The analytical results are validated by simulations. [ABSTRACT FROM PUBLISHER]

In this paper, the effective rate (ER) of wireless communication systems and the performance of energy detection (ED) based spectrum sensing over $\alpha -\eta -\kappa -\mu$ fading channels are analysed. To this end, novel mathematically tractable exact expressions of the ER, the average detection probability (ADP) and the average area under the receiver characteristics curve (AUC) are derived. The asymptotic expressions at high average signal-to-noise ratio (SNR) values are also provided. A comparison between the numerical results and Monte Carlo simulations is presented to verify the validation of our analysis. The mathematical relationship between the ER and the performance metrics of the ED which is based on the time-bandwidth product, is explained. The provided results show that the increase in the time-bandwidth product from 1 to 4 reduces the ER, the ADP, and the average AUC by nearly $\text{21}\%$ , $\text{8}\%$ , and $\text{3}\%$ , respectively, for constant average SNR at 15 dB and delay exponent at 0.1. [ABSTRACT FROM AUTHOR]

Full-duplex (FD) jamming transceivers recently have been shown to enhance the information security of wireless communication systems by simultaneously transmitting artificial noise (AN) while receiving information. In this paper, we investigate whether FD jamming can also improve the system’s secrecy energy efficiency (SEE) in terms of securely communicated bits per Joule when considering the additional power used for jamming and self-interference (SI) cancellation. Moreover, the degrading effect of the residual SI is also taken into account. In this regard, we formulate a set of SEE maximization problems for a FD multiple-input-multiple-output multiple-antenna eavesdropper (MIMOME) wiretap channel, considering both cases where exact or statistical channel state information (CSI) is available. Due to the intractable problem structure, we propose iterative solutions in each case with a proven convergence to a stationary point. Numerical simulations indicate only a marginal SEE gain, through the utilization of FD jamming, for a wide range of system conditions. However, when SI can efficiently be mitigated, the observed gain is considerable for scenarios with a small distance between the FD node and the eavesdropper, a high signal-to-noise ratio (SNR), or for a bidirectional FD communication setup. [ABSTRACT FROM AUTHOR]

Multi-channel (MC) optical wireless communication (OWC) systems employing wave-division multiplexing for outdoors free-space optical communications, or multi-user time-division multiple access for indoors visible-light communications, e.g., can be modeled as parallel channels. Multi-input multi-output OWC systems can also be transformed, possibly with some performance loss, to parallel channels using pre-/post-coding. Studying the performance of such MC-OWC systems requires characterizing the capacity of the underlying parallel channels. In this paper, upper and lower bounds on the capacity of constant parallel OWC channels with a total average intensity constraint are derived. Then, this paper focuses on finding intensity allocations that maximize the lower bounds given channel-state information at the transmitter (CSIT). Due to its nonconvexity, the Karush–Kuhn–Tucker conditions are used to describe a list of candidate allocations. Instead searching exhaustively for the best solution, low-complexity near-optimal algorithms are proposed. The resulting optimized lower bound nearly coincides with capacity at high signal-to-noise ratio (SNR). Under a quasi-static channel model and in the absence of CSIT, outage probability upper and lower bounds are derived. Those bounds also meet at high SNR, thus characterizing the outage capacity in this regime. Finally, the results are extended to a system with both average and peak intensity constraints. [ABSTRACT FROM PUBLISHER]

This paper studies interference exploitation techniques for secure beamforming design in simultaneous wireless information and power transfer in multiple-input single-output systems. In particular, multiuser interference (MUI) and artificially generated noise (AN) signals are designed as constructive to the information receivers (IRs) yet kept disruptive to potential eavesdropping by the energy receivers. The objective is to improve the received signal-to-interference and noise ratio (SINR) at the IRs by exploiting the MUI and AN power in an attempt to minimize the total transmit power. We first propose second-order cone programming-based solutions for the perfect channel state information (CSI) case by defining strong upper and lower bounds on the energy harvesting (EH) constraints. We then provide semidefinite programming-based solutions for the problems. In addition, we also solve the worst case harvested energy maximization problem under the proposed bounds. Finally, robust beamforming approaches based on the above are derived for the case of imperfect CSI. Our results demonstrate that the proposed constructive interference precoding schemes yield huge saving in transmit power over conventional interference management schemes. Most importantly, they show that, while the statistical constraints of conventional approaches may lead to instantaneous SINR as well as EH outages, the instantaneous constraints of our approaches guarantee both constraints at every symbol period. [ABSTRACT FROM AUTHOR]

This paper considers a wireless communication network consisting of multiple interfering multicast sessions. Different from a unicast system where each transmitter has only one receiver, in a multicast system, each transmitter has multiple receivers and broadcasts a common message to all of them. It is a well-known result for wireless unicast systems that the feasibility of a signal-to-interference-plus-noise power ratio (SINR) without power constraint is decided by the spectral radius of a nonnegative matrix. We generalize this result and obtain necessary and sufficient conditions for the feasibility of an SINR in a wireless multicast system with and without power constraint. The feasible SINR region and its geometric properties are studied. Besides, an iterative algorithm is proposed, which can efficiently check the feasibility condition and compute the boundary points of the feasible SINR region. [ABSTRACT FROM AUTHOR]

Visible light communication (VLC) based simultaneous positioning and orientating (SPAO), using received signal strength (RSS) measurements, is studied in this paper. RSS-based SPAO for VLCs of great challenge as it is essentially a non-convex optimization problem due to the nonlinear RSS model. To address this non-convexity challenge, a novel particle-assisted stochastic search (PASS) algorithm is proposed. The proposed PASS-based SPAO scheme does not require the knowledge of the height of receiver, the perfect alignment of transceiver orientations or inertial measurements. This is a huge technical improvement over the existing VLC localization solutions. The algorithmic convergence is established to justify the proposed PASS algorithm. In addition, a closed-form Cramer–Rao lower bound (CRLB) on localization error is derived and analyzed to gain insights into how the VLC-based SPAO performance is related to system configurations. It is shown that the receiver's position and orientation accuracy is linear with signal-to-noise ratio and direction information. In addition, the position accuracy decays with six powers of the transceiver distance, while the orientation accuracy decays with four powers of the transceiver distance. Finally, simulation results verify the performance gain of the proposed PASS algorithm for VLC-based SPAO. [ABSTRACT FROM AUTHOR]

In this paper, we propose a two-way secure communication scheme where two transceivers exchange confidential messages via a wireless-powered untrusted amplify-and-forward relay in the presence of an external jammer. We take into account both friendly jamming (FJ) and Gaussian noise jamming (GNJ) scenarios. Based on the time switching (TS) architecture at the relay, the data transmission is done in three phases. In the first phase, both the energy-starved nodes, the untrustworthy relay and the jammer, are charged by noninformation radio frequency (RF) signals from the sources. In the second phase, the two sources send their information signals and concurrently, the jammer transmits artificial noise to confuse the curious relay. Finally, the third phase is dedicated to forward a scaled version of the received signal from the relay to the sources. For the proposed secure transmission schemes, we derive new closed-form lower-bound expressions for the ergodic secrecy sum rate (ESSR) in the high signal-to-noise ratio (SNR) regime. We further analyze the asymptotic ESSR to determine the key parameters; the high SNR slope and the high SNR power offset of the jamming based scenarios. To highlight the performance advantage of the proposed FJ, we also examine the scenario of without jamming (WoJ). Finally, numerical examples and discussions are provided to acquire some engineering insights, and to demonstrate the impacts of different system parameters on the secrecy performance of the considered communication scenarios. The numerical results illustrate that the proposed FJ significantly outperforms the traditional one-way communication and the constellation rotation (CR) approach, as well as our proposed benchmarks, the two-way WoJ and GNJ scenarios. [ABSTRACT FROM AUTHOR]

In this paper, we propose an imperfect quantized feedback-based diagonal precoding scheme for generalized orthogonal space-time block codes in an $N \times 1$ multiple-input single-output (MISO) wireless communication system employing $M$ -QAM constellation. It is well known that a feedback-based precoding scheme aids channel adaptive signaling in wireless communication system and capitulates large improvements in almost all performance metrics. However, a practical feedback link is susceptible to error due to wireless channel fading and leads to wrong precoder selection. Therefore, a signal-to-noise ratio (SNR) adaptive error-tolerant weighting scheme is introduced which provides significant gain in comparison with another proposed arbitrarily fixed SNR error-tolerant weighting scheme. At first, a tight approximate closed-form expression of average symbol-error-rate (SER) and an exact analytical expression of outage probability are derived under imperfect feedback information with the help of order statistics. By minimizing the derived average SER, optimized transmit weights for the diagonal precoding matrix (based on feedback bits) are obtained. Later, a closed-form expression of the ergodic capacity with erroneous feedback bits for arbitrary MISO system is also provided by using the moment generating function approach. Further, numerical results show that the considered error-tolerant schemes outperform the uniform power allocation scheme in term of all the investigated performance metrics. [ABSTRACT FROM AUTHOR]

Enabling device-to-device (D2D) communications in millimeter-wave (mm-wave) networks is of critical importance for the next-generation mobile networks to support very high data rates (multi-gigabits-per-second) for mobile devices. In this paper, we provide a fine-grained performance analysis of the mm-wave D2D communication networks. Specifically, we first establish a general and tractable framework to investigate the performance of mm-wave D2D networks using the Poisson bipolar model integrated with several features of the mm-wave band. To show what fraction of users in the network achieve target reliability if the required signal-to-interference-plus-noise ratio (SINR) (or QoS requirement) is given, we derive the meta distributions of the SINR and the data rate. Interestingly, in mm-wave D2D networks, the standard beta approximation for the meta distribution does not work very well when highly directional antenna arrays are used or the node density is small. To resolve this issue, we provide a modified approximation by using higher moments of the conditional SINR distribution, which is shown to be closer to the exact result. On this basis, we also derive the mean local delay and spatial outage capacity to provide a comprehensive investigation on the impact of mm-wave features on the performance of D2D communication. [ABSTRACT FROM AUTHOR]

The evaluation of the coverage probability of multistream multiple-input multiple-output (MIMO) communications in HetNets subject to noise, fading, and intercell interference is undoubtedly intricate. Unfortunately, the current literature misses its comprehensive evaluation, as the effects of noise and cross-stream correlation are often overlooked. Furthermore, computationally friendly expressions of the coverage probability allowing engineering insights and adaptive system design are lacking. For multistream MIMO zero-forcing beamforming, in this paper we tackle these issues by considering scenarios where a receiver is in the coverage if all of its data-streams are successfully decoded. Assuming the max signal-to-interference-plus-noise ratio (SINR) cell association (CA), we adopt the stochastic geometry tools to provide an upper bound and an easy-to-compute closed-form lower bound on the coverage probability, while their accuracies are confirmed against extensive simulations. Our contributions are as follows. We prove that full correlation of data streams of a given link slightly reduces the coverage performance. We show that from a coverage probability perspective, the single stream communication is preferable. We exploit our analysis to explore several pertinent design issues, which have not fully discussed in the literature. Our results demonstrate tradeoffs between densification and multiplexing gains. We, further, see that by appropriately designating feedback channel with modest capacity 8 bits per frame per user, the spatial throughput grows by nearly 180 $\%$ over the conventional 1-bit feedback scenario. Finally, We present important extensions of our analysis to underlay spectrum sharing, practical aspects of the max-SINR CA, and a nonhomogeneous path loss environment. [ABSTRACT FROM PUBLISHER]

The capacity region of the $K$ -user Gaussian interference channel (GIC) is a long-standing open problem and even capacity outer bounds are little known in general. A significant progress on degrees-of-freedom (DoF) analysis, a first-order capacity approximation, for the $K$ -user GIC has provided new important insights into the problem of interest in the high signal-to-noise ratio (SNR) limit. However, such capacity approximation has been observed to have some limitations in predicting the capacity at finite SNR. In this paper, we develop a new upper-bounding technique that utilizes a new type of genie signal and applies time sharing to genie signals at $K$ receivers. Based on this technique, we derive new upper bounds on the sum capacity of the three-user GIC with constant, complex channel coefficients and then generalize to the $K$ -user case to better understand sum-rate behavior at finite SNR. We also provide closed-form expressions of our upper bounds on the capacity of the $K$ -user symmetric GIC easily computable for any $K$ . From the perspectives of our results, some sum-rate behavior at finite SNR is in line with the insights given by the known DoF results, while some others are not. In particular, the well-known $K/2$ DoF achievable for almost all constant real channel coefficients turns out to be not embodied as a substantial performance gain over a certain range of the cross-channel coefficient in the $K$ -user symmetric real case especially for large $K$ . We further investigate the impact of phase offset between the direct-channel coefficient and the cross-channel coefficients on the sum-rate upper bound for the three-user complex GIC. As a consequence, we aim to provide new findings that could not be predicted by the prior works on DoF of GICs. [ABSTRACT FROM PUBLISHER]

This paper investigates the application of simultaneous wireless information and power transfer (SWIPT) to cooperative non-orthogonal multiple access (NOMA). A new cooperative multiple-input single-output (MISO) SWIPT NOMA protocol is proposed, where a user with a strong channel condition acts as an energy-harvesting (EH) relay by adopting power splitting (PS) scheme to help a user with a poor channel condition. By jointly optimizing the PS ratio and the beamforming vectors, we aim at maximizing the data rate of the “strong user” while satisfying the QoS requirement of the “weak user”. To resolve the formulated nonconvex problem, the semidefinite relaxation (SDR) technique is applied to reformulate the original problem, by proving the rank-one optimality. And then an iterative algorithm based on successive convex approximation (SCA) is proposed for complexity reduction, which can at least attain its stationary point efficiently. In view of the potential application scenarios, e.g., Internet of Things (IoT), the single-input single-output (SISO) case is also studied. The formulated problem is proved to be strictly unimodal with respect to the PS ratio. Hence, a golden section search (GSS) based algorithm with closed-form solution at each step is proposed to find the unique global optimal solution. It is worth pointing out that the SCA method can also converge to the optimal solution in SISO cases. In the numerical simulation, the proposed algorithm is numerically shown to converge within a few iterations, and the SWIPT-aided NOMA protocol outperforms the existing transmission protocols. [ABSTRACT FROM PUBLISHER]

The capacity of multiple-input multiple-output (MIMO) Rayleigh fading channels with full knowledge of channel state information (CSI) at both the transmitter and the receiver (CSI-TR) has been shown recently to scale at low signal-to-noise ratio (SNR) essentially as SNR log(1/SNR), independently of the number of transmit and receive antennas. In this paper, we investigate the ergodic capacity of MIMO Rayleigh fading channel with estimated channel state information at the transmitter (CSI-T) and possibly imperfect channel state information at the receiver (CSI-R). Our framework can be seen as a generalization of previous works as it can capture the perfect CSI-TR as a special case when the estimation error variance goes to zero. In this paper, we mainly focus on the low SNR regime, and we show that the capacity scales as $(1-\alpha)$ SNR log(1/SNR), where $\alpha$ is the estimation error variance. This characterization shows the loss of performance due to error estimation over the perfect channel state information at both the transmitter and the receiver. As a by-product of our new analysis, we show that our framework can be also extended to characterize the capacity of MIMO Rician fading channels at low SNR with possibly imperfect CSI-T and CSI-R. [ABSTRACT FROM AUTHOR]

Consider the single-group multicast beamforming problem, where multiple users receive the same data stream simultaneously from a single transmitter. The problem is NP-hard and all existing algorithms for the problem either find suboptimal approximate or local stationary solutions. In this paper, we propose an efficient branch-and-bound algorithm for the problem that is guaranteed to find its global solution. To the best of our knowledge, our proposed algorithm is the first tailored global algorithm for the single-group multicast beamforming problem. Simulation results show that our proposed algorithm is computationally efficient (albeit its theoretical worst-case iteration complexity is exponential with respect to the number of receivers) and it significantly outperforms a state-of-the-art general-purpose global optimization solver called Baron. Our proposed algorithm provides an important benchmark for performance evaluation of existing algorithms for the same problem. By using it as the benchmark, we show that two state-of-the-art algorithms, semidefinite relaxation algorithm and successive linear approximation algorithm, work well when the problem dimension (i.e., the number of antennas at the transmitter and the number of receivers) is small but their performance deteriorates quickly as the problem dimension increases. [ABSTRACT FROM PUBLISHER]

Considering a dual-hop energy-harvesting (EH) relaying system, this paper advocates novel relaying protocols based on adaptive time-switching (TS) for amplify-and-forward and decode-and-forward modes, respectively. The optimal TS factor is first studied, which is adaptively adjusted based on the dual-hop channel state information (CSI), accumulated energy, and threshold signal-to-noise ratio (SNR), to achieve the maximum throughput efficiency per block. To reduce the CSI overhead at the EH relay, a low-complexity TS factor design is presented, which only needs single-hop CSI to determine the TS factor. Theoretical results show that, in comparison with the conventional solutions, the proposed optimal/low-complexity TS factor can achieve higher limiting throughput efficiency for sufficiently small threshold SNR. As the threshold SNR approaches infinity, the throughput efficiency of the proposed optimal/low-complexity TS factor tends to zero in a much slower pace than that of the conventional solutions. Simulation results are presented to corroborate the proposed methodology. [ABSTRACT FROM PUBLISHER]

In this paper, we study the uplink in a single-cell massive multiple-input–multiple-output system. The base station (BS) is equipped with three antenna arrays, each covering one third of the cell area. Each antenna array comprises a large yet finite number of antennas. The single-antenna users are randomly and uniformly distributed in the cell, transmitting to the BS utilizing full channel inversion power control. All users experience Rician fading. Receiver maximum-ratio-combining is performed at the BS. Under such a setting, we focus on one cell sector and analyze the intrasector interference in a realistic situation where the number of BS antennas is not extremely large compared with the user number. In particular, we show that, due to the line-of-sight (LoS) component of the channel, the interference is partially determined by the angles of arrival of the signals. We approximate the LoS component interference by a Beta mixture. The interference in Rician fading is then modeled as a noncentral chi-square distribution with a random noncentrality parameter, corresponding to the LoS component. The approximate interference distribution can be used to compute signal-to-interference-ratio-dependent metrics such as outage probability and average throughput. [ABSTRACT FROM AUTHOR]

The classical multiuser detection algorithms such as zero forcing (ZF) and minimum mean square error (MMSE) receivers are designed with the assumption that the number of active users is constant and known. When the number of the active users changes, the receiver may exhibit a serious performance loss if it does not react quickly to such variations. In this paper, we address the problem of reducing the complexity of the reevaluation of the popular ZF and MMSE detectors for multiuser multiple-input multiple-output (MU-MIMO) systems with a time-varying number of users in the channel. For each technique, we propose a detection approach with low complexity and without performance loss. The proposed algorithms avoid the direct computation of matrix inverses required by the ZF and MMSE detectors. Moreover, the performance losses, due to the use of the ZF and MMSE detectors intended for the scenario with a fixed number of active users, are evaluated with Monte Carlo simulation results. [ABSTRACT FROM PUBLISHER]

Second order cone (SOC) restrictions have been widely employed in the design of wireless communication systems to recast precoding optimizations in convex form. This paper highlights the flexibility of this framework to handle various transmit power and interference limitations also in the multistream multiple-input multiple-output broadcast channel with imperfect channel state information at the transmitter. In particular, we propose an iterative solution for mean square error (MSE) balancing with such constraints via the Lagrangian dual formulation. The MSE balancing criteria, contrary to signal-to-interference plus-noise ratio and rate criteria, exhibit an interesting property when considering different targets for the receivers. Users with low target values are strictly prioritized in comparison to users with large MSE targets that can even be switched off. Therefore, only a subset of the receivers is served at the solution with stringent limitations for the precoders. An example of such stringent limitations are small power constraints and probabilistic interference temperature constraints that set a measurable threshold on the generated interference in a cognitive radio system. We provide four different approaches to approximate these probabilistic constraints with deterministic SOC constraints, and compare their accuracy. [ABSTRACT FROM PUBLISHER]

Interference alignment (IA) is a promising technique for interference management in wireless networks. On the other hand, jamming is a potential threat to wireless communications, which can degrade the performance of IA-based networks severely. Although some excellent work has been done on IA and antijamming, these two important aspects have traditionally been addressed separately in most previous work. In this paper, we study the antijamming issues and propose two antijamming schemes for IA-based networks. In the first scheme, the jamming signal and interferences are aligned into the same subspace at each receiver, and thus, can be perfectly eliminated together. When the requirement of perfect alignment can be relaxed, the second scheme is proposed to further improve the antijamming performance by maximizing the received signal-to-interference-plus-noise ratio (SINR). We derive the proper and feasibility conditions of the proposed two schemes. Simulation results are presented to show the effectiveness of the proposed schemes in mitigating jamming signals in IA-based wireless networks. [ABSTRACT FROM PUBLISHER]

In this paper, we introduce advancements of the conventional blanking nonlinearity (BN) for orthogonal frequency-division multiplexing (OFDM)-based systems, which is referred to in the following as advanced BN. Blanking is a common measure for mitigating impulsive interference that often occurs in wireless communication systems. Although the BN removes impulsive interference reliably, it possesses various drawbacks for OFDM-based systems. In particular, the choice of the blanking threshold (BT), to decide whether a received sample is blanked, is a critical issue. We present an algorithm for determining the optimal BT to maximize the signal-to-noise-and-interference ratio (SINR) after blanking. Another drawback is that the entire received signal is discarded during a blanking interval, despite the fact that only a fraction of the spectrum of the OFDM signal might be affected by interference. We show how blanking can be limited to subcarriers that are actually affected by interference. Further, we show how these measures can be combined and how a priori information obtained in an iterative loop can be incorporated into the proposed scheme. Simulation results incorporating realistic channel and interference models demonstrate the effectiveness of the proposed scheme. [ABSTRACT FROM PUBLISHER]

Efficiency in spectrum utility has been a concern in wireless communications for a long time. Cognitive radios have been seen as a solution to occupy the gaps in the licensed spectrum through opportunistic spectrum access and simultaneous spectrum sharing techniques. For this purpose, spectrum sensing has been vital in providing accurate statistical information regarding licensed or primary user (PU) activity on its spectrum. In this paper, we design new sensing thresholds that take into account the outage caused to the PU as a consequence of cognitive or secondary users (SUs) accessing or sharing the said spectrum. With these new thresholds, we can see more protection to the PU from SU spectrum access transmissions based on missed detections, and eliminate most common assumptions made with spectrum sharing systems. Our thresholds also work with a dynamic decision-making algorithm that allows the SUs to use only the statistical sensing information to understand the network dynamics, and determine its transmission opportunities and corresponding power consumption, in a decentralized and uncooperative cross-layer network. [ABSTRACT FROM AUTHOR]

In this paper, the statistical characterizations of the sum and the maximum of independent and nonidentically distributed (i.n.d.) composite \eta-\mu/\textgamma variates are derived using a mixture gamma (MG) distribution. The statistical properties, namely, probability density function (pdf), cumulative distribution function (cdf), and moment generating function (MGF) are obtained in general unified exact analytic expressions. These statistical results are then used to analyze outage probability (OP), average bit error rate probability (ABEP), and average channel capacity (C) of maximal ratio combining (MRC) and selection combining (SC) schemes over i.n.d. composite \eta-\mu/\textgamma fading channels. The validation of our derived expressions is verified by comparing the numerical and simulation results. [ABSTRACT FROM PUBLISHER]

In this paper, we investigate the achievable coverage and the information rate of an aerial base station. The air-to-ground link is analysed by considering random fading and shadowing effects impairing the wireless transmission, together with a homogeneous spatial distribution of the terrestrial users. The distribution of the buildings in the underlying coverage region is modeled using the International Telecommunication Union-Recommendation statistical city model. For a given urban environment/region, we analytically quantify the achievable coverage probability and the information rate of users on the ground at a particular base station altitude. Furthermore, we analytically find the optimal altitude of the aerial base station to maximise the terrestrial coverage given a certain service region. Simulations are conducted to verify our analysis, and a close match between the analytical and simulation results is observed. [ABSTRACT FROM AUTHOR]

This paper investigates the impact of practical operation conditions such as channel information imperfection (CII), independent nonidentical (i.n.i) fading distributions, strict power constraints (i.e., peak transmit power constraint and primary outage constraint), and primary interference on outage performance of opportunistic relay selection (ORS) in underlay cooperative cognitive networks (UCCNs). Toward this end, the power of secondary transmitters is first established to meet strict power constraints and account for primary interference and CII. Then, exact closed-form outage probability expressions for the secondary destination employing the maximum ratio combining (MRC) and the selection combining (SC) are proposed to promptly evaluate the effect of these conditions and provide useful insights into performance limits. Numerous results illustrate significant system performance deterioration due to primary interference and CII, performance saturation phenomenon in the secondary network, performance compromise between the secondary network and the primary network, significant performance improvement with respect to the increase in the number of involved relays, a large gap between the lower outage bound (MRC's outage performance) and the upper outage bound (SC's outage performance), and the advantage of utilizing direct channel between the source and the destination. [ABSTRACT FROM PUBLISHER]

In emerging heterogeneous networks (HetNets), a wide range of the underlying performance evaluation problems is related to wireless interference characterization and can be reduced to investigating the distribution of a side length in a random triangle. In this paper, we address the task of calculating the side-length distribution in such a triangle determined by the known distributions of its two other sides and the distribution of the angle between them. No restrictions on the distributions of input random variables (RVs) are imposed except for their statistical independence. Our solution delivers a crucial building block for interference analysis in multitier and multiradio HetNets, including mobile device-to-device communication as one of the most extreme interference-limited cases. [ABSTRACT FROM AUTHOR]

The cross-layer utility maximization problem, which is subject to stability constraints for a multicommodity wireless network where all links share the same number of orthogonal channels, is considered in this paper. We assume a time-slotted network, where the channel gains randomly change from one slot to another. The optimal cross-layer network control policy can be decomposed into the folloing three subproblems: 1) flow control; 2) next-hop routing and in -node scheduling; and 3) power and rate control, which is also known as resource allocation (RA). These subproblems span the layers from the physical layer to the transport layer. In every time slot, a network controller decides the amount of each commodity data admitted to the network layer, schedules different commodities over the network's links, and controls the power and rate allocated to every link in every channel. To fully exploit the available multichannel diversity, we consider the general case, where multiple links can be activated in the same channel during the same time slot, and the interference is controlled solely through power and rate control. Unfortunately, the RA subproblem is not yet amendable to a convex formulation, and in fact, it is NP-hard. The main contribution of this paper is to develop efficient RA algorithms for multicommodity multichannel wireless networks by applying complementary geometric programming and homotopy methods to analyze the quantitative impact of gains that can be achieved at the network layer in terms of end-to-end rates and network congestion by incorporating different RA algorithms. Although the global optimality of the solution cannot be guaranteed, the numerical results show that the proposed algorithms perform close to the (exponentially complex) optimal solution methods. Moreover, they efficiently exploit the available multichannel diversity, which provides significant gains at the network layer in terms of end-to-end rates and network congestion. In addition, the assessment of the improvement in performance due to the use of multiuser detectors at the receivers is provided. [ABSTRACT FROM PUBLISHER]

We propose a statistical information-based approach to enhance the performance of the noniterative quasi-maximum-likelihood (QML) receiver (detector plus decoder) recorded at the output of the channel decoder for coded multiple-input–multiple-output (MIMO) systems. As an illustrative example, the QR decomposition with an $M$-algorithm (QRD-M)-based noniterative QML receiver is employed in this paper. We first illustrate that there is a large discrepancy between the amplitude of the raw log-likelihood ratio (LLR) generated by the complexity-constrained QRD-M detector and its reliability, particularly for LLRs with high amplitudes. The discrepancy is shown to be the main underlying cause of degraded performance in coded MIMO systems. Then, we propose a reliability-aware transformation technique, which exploits the statistical relationship between the raw LLR's amplitude and its reliability to adjust the raw LLR's amplitude to a level commensurate with its reliability. By using the proposed statistical knowledge-based technique, the performance of the receiver (detector plus decoder) recorded at the output of the channel decoder is significantly enhanced for high-order modulations. The extension of the proposed method to other QML receivers such as the list sequential (LISS) detector and list sphere detector (LSD)-based receivers is straightforward. [ABSTRACT FROM AUTHOR]

In general, an access point (AP) in wireless local area networks (WLANs) can be easily congested since all related data traffic goes through it. To satisfy the quality-of-service (QoS) requirement for its customers, a protocol-independent redundancy elimination (RE) technique can effectively mitigate the congestion at the AP by reducing redundant data traffic. In this paper, we propose an overhearing-aided RE (OARE) scheme for multirate WLANs by leveraging the broadcast nature of a wireless medium. In OARE, the AP estimates overhearing probabilities of partially sliced chunks from an incoming packet for a destination mobile terminal by considering an adaptive modulation and coding technique. Then, the original packet is encoded by means of RE to minimize its transfer time to the destination, depending on the estimated overhearing probabilities. Extensive simulation results demonstrate that OARE can reduce the packet transfer time by 7.8%–23.2%, compared with non-RE (or nonencoded) transmissions. [ABSTRACT FROM AUTHOR]

Orthogonal frequency division multiplexing with index modulation (OFDM-IM) is a recently developed transmission technique that extends the principle of spatial modulation to OFDM subcarriers. In this paper, the performance of OFDM-IM is studied in terms of the achievable rate assuming an M-ary constellation and that channel state information is available at the receiver. A closed-form lower bound is derived, based on which an interleaved grouping method is proposed for the use of subcarriers. In comparison with the existing grouping method, the proposed one can better benefit from the diversity effects over frequency-selective fading channels, especially when the spacing of any two subcarriers within a subcarrier group is larger than the coherence bandwidth. Through numerical results, it is revealed that OFDM-IM with interleaved grouping outperforms classical OFDM for small M and certain ranges of signal-to-noise ratio. Finally, the effects of modulation types on the performance of OFDM-IM are studied. It is found that the superiority of OFDM-IM over classical OFDM is greater for phase-shift keying than for quadrature amplitude modulation. [ABSTRACT FROM PUBLISHER]

Compute-and-forward (C&F) is a promising new approach to interference management, enjoying several advantages over other information-theoretic schemes. C&F usually requires channel state information (CSI) at the receivers so that an “optimal” scaling factor can be computed for the purposes of decoding. In this paper, a blind C&F scheme—i.e., one not requiring CSI—is developed. Rather than attempting to compute the optimal scaling factor, this new scheme seeks one or more “good” scalars, i.e., scalars that allow correct decoding despite possibly being suboptimal. The region of all such good scalars is characterized. To find a good scalar, a computationally efficient scheme is proposed which involves error-detection, a hierarchically organized list, as well as a use of the smoothing lemma from lattice theory. Simulation results show that our blind C&F scheme achieves—for a class of nested lattice codes—the same throughput as its CSI-enabled counterpart at the expense of, approximately, a two-fold increase in computational complexity in the high-throughput region. Moreover, our blind C&F scheme can be applied to multisource multirelay networks with a good performance/complexity tradeoff. [ABSTRACT FROM AUTHOR]

Optimal data detection of data transmitted over a linear channel can always be implemented through the Viterbi algorithm (VA). However, in many cases of interest the memory of the channel prohibits direct application of the VA. A popular and conceptually simple method in this case, studied since the early 1970s, is to first filter the received signal in order to shorten the memory of the channel, and then to apply a VA that operates with the shorter memory. We shall refer to this general concept as a channel shortening (CS) receiver. Although studied for almost four decades, an information theoretic understanding of what such a simple receiver solution is actually doing is not available. In this paper, we show that an optimized CS receiver has a direct correspondance to the chain rule of mutual information. Furthermore, we show that the tools for analyzing the ensuing achievable rates from an optimized CS receiver are precisely the same as those used for analyzing the achievable rates of a minimum mean-square-error (MMSE) receiver. [ABSTRACT FROM AUTHOR]

In this paper, we consider a spatial modulation (SM)-based multiple-input–single-output (MISO) system relying on a single radio-frequency chain equipped with a finite-rate feedback channel to provide quantized channel state information (CSI) to the transmitter. First, under the assumption of Rayleigh flat-fading channels and perfect CSI at the transmitter (CSIT), we analyze the symbol error probability (SEP) of an SM scheme, which perfectly compensates the channel phase and employs constellation rotation at the different transmit antennas (TAs). Then, we consider a more practical scenario, where scalar quantization of the channel phase angles is employed, and the quantized CSI is made available to the transmitter via a finite-rate feedback channel. We analyze the SEP reduction, i.e., Pe_L, relative to perfect CSIT, imposed by the quantized CSIT (Q-CSIT). We show that at a high feedback rate, Pe_L varies as C^\prime\mbox2^-2B, where each channel phase angle is quantized to B bits, and C^{\prime} is a constant. Furthermore, based on the rotational symmetry of the M-ary phase-shift keying ( M-PSK) signal constellation, we propose a novel feedback scheme, which requires (n_t-\mbox{1})\log_2(M) fewer bits of feedback with any performance erosion, where n_t$ is the number of TAs. We characterize the performance of the SM-MISO system with finite-rate feedback and validate our analysis through Monte Carlo simulations. [ABSTRACT FROM AUTHOR]

In this paper, we study the codebook size design strategies in the multiple-input–multiple-output (MIMO) broadcast channel (BC) systems. We adopt the nonlinear Tomlinson–Harashima precoder (THP), which is designed by the imperfect channel direction information (CDI) acquired from the random vector quantization (RVQ) feedback mechanism. Under the limitation of the total feedback rate, we flexibly allocate the size of each user's codebook so that the overall channel capacity is maximized. Since the design problem is not convex, directly finding out the optimum allocation of codebook size is not attainable. However, by sophisticatedly using the discrete majorization theory, we can derive the codebook size allocation strategies for the high- and the low-signal-to-noise-ratio (SNR) regions. Interestingly, the results show that the equal size codebook is preferable in the low-SNR region, whereas the codebook allocates the whole available codebook size to a single user in the high-SNR region. Simulations certify the theoretical result of our design. [ABSTRACT FROM PUBLISHER]

In this paper, we consider collaborative beamforming for a cooperative two-way relay spectrum-sharing system where a pair of secondary transceivers communicates via a set of secondary decode-and-forward (DF) relays in the presence of multiple primary transceivers. Among the available relays, only those that receive the signals reliably participate in the cooperative beamforming process and use network coding to simultaneously transmit the weighted signals to the transceivers. Two practical two-way relaying strategies are investigated, namely, DF- xoring and DF-superposition. The former is based on bitwise-level xoring of the detected signals at the relays, whereas the latter is based on symbolwise-level addition at the relays. For each relaying strategy, we derive general optimal beamforming vectors at the relays to keep the interference inflicted on the primary receivers to a predefined threshold. Employing zero-forcing beamforming as a special case, we present an analytical framework of the performance of the secondary system considering the effect of the primary–secondary mutual cochannel interference (CCI). In particular, we derive closed-form expressions for the outage probability, bit error rate (BER), and achievable sum rates over independent and identically distributed Rayleigh fading channels. Numerical results demonstrate the effectiveness of beamforming in compensating for the cognitive system performance loss due to CCI in addition to mitigating the interference to the primary receivers. Simulation results also show that, when the received signals at the relays are equally weighted, DF- xor always outperforms both DF-superposition and amplify-and-forward (AF) relaying. [ABSTRACT FROM PUBLISHER]

Interference alignment (IA) is a promising technique for interference management in wireless networks. However, the sum rate may fall short of the theoretical maximum, particularly at low signal-to-noise ratio (SNR) levels since IA mainly concentrates on mitigating the interference, instead of improving the quality of desired signal. Moreover, most of the previous works focused on improving spectrum efficiency, but the energy efficiency (EE) aspect is largely ignored. In this paper, an adaptive energy-efficient IA algorithm is proposed through power allocation (PA) and transmission-mode adaptation for green IA-based wireless networks. The PA problem for IA is first analyzed; then, we propose a PA scheme that optimizes the EE of IA-based wireless networks. When the SNR is low, the transmitted power of some users may become zero. Thus, the users with low transmitted power are turned into the sleep mode in our scheme to save energy. The transmitted power and transmission mode of the remaining active users are adapted again to further improve the EE of the network. To guarantee the interests of all the users, fairness among users is also considered in the proposed scheme. Simulation results are presented to show the effectiveness of the proposed algorithm in improving the EE of IA-based wireless networks. [ABSTRACT FROM PUBLISHER]

This paper studies the throughput of spectrum sharing networks utilizing rate adaptation. We use some recent results on the achievable rates of finite block-length codes to analyze the secondary user (SU) throughput with a constraint on the primary user (PU) codeword drop probability. With codewords of finite length, we derive closed-form expressions for the SU activation probability and throughput. The results are obtained in different scenarios with perfect or no channel state information at the SU transmitter. As demonstrated numerically and analytically, using finite-length codewords and rate adaptation, there is considerable potential for the data transmission of unlicensed secondary users under different quality-of-service requirements of the licensed primary users. [ABSTRACT FROM PUBLISHER]

In this paper, the spectrum efficiency of multiuser single carrier (SC) transmission is considered. In SC multiuser transmission, multiuser access can be realized by using interference suppression, e.g., SC frequency-domain adaptive antenna array (SC-FDAAA) transceiver, or by orthogonal frequency allocation among users, e.g., SC frequency-division multiple access (SC-FDMA) transceiver. To evaluate the system spectrum efficiency, the signal-to-interference-plus-noise ratio (SINR) at the output of the SC-FDAAA receiver and the SC-FDMA receiver is derived, respectively. The system spectrum efficiency is then evaluated and compared for both transceivers. It is shown that under the assumption of slow transmit power control, the system spectrum efficiency of the SC-FDMA transceiver does not change with the number of users, whereas the spectrum efficiency of the SC-FDAAA transceiver reaches its maximal value by an optimal number of users, which is determined by both the number of receive antennas and the target receive signal-to-noise ratio (SNR). With this observation, an SC-adaptive transceiver is proposed based on unorthogonal frequency allocation and frequency-domain interference suppression to improve the system spectrum efficiency, and the proposed scheme has been shown to be effective by numerical results. [ABSTRACT FROM PUBLISHER]

The composite multipath/shadowing model is key to accurate modeling of real-world wireless channels, due to the combination of the effects of both fading and shadowing. However, the fundamental limits of spectrum-sharing cognitive radio have not been studied for such propagation conditions, leaving a gap in the analysis of these systems and, hence, the communication strategies that can be built upon toward improving performance. In this paper, we consider a primary/secondary spectrum-sharing network and study the performance of the secondary's multihop link by taking the composite multipath/shadowing model, which is described by the generalized- $K$ distribution, for the radio channels. In the multihop system, communication between secondary users (SUs) is assisted by intermediate relay terminals, under coexistence constraints with the primary users (PUs) . We assess the performance of the multihop system, first by deriving the moment generating function (mgf) and the probability density function (pdf) of the upper bounded end-to-end signal-to-noise ratio in closed form. The result is then used to obtain closed-form expressions of bounds on the ergodic capacity and the average bit error rate (ABER) , under the resource sharing constraints. The theoretical results are assessed with numerical analysis for different operating conditions. [ABSTRACT FROM PUBLISHER]

Cognitive radio has emerged as an essential recipe for future high-capacity, high-coverage multitier hierarchical networks. Securing data transmission in these networks is of the utmost importance. In this paper, we consider the cognitive wiretap channel and propose multiple antennas to secure the transmission at the physical layer, where the eavesdropper overhears the transmission from the secondary transmitter to the secondary receiver. The secondary receiver and the eavesdropper are equipped with multiple antennas, and passive eavesdropping is considered where the channel state information (CSI) of the eavesdropper's channel is not available at the secondary transmitter. We present new closed-form expressions for the exact and asymptotic secrecy outage probability. Our results reveal the impact of the primary network on the secondary network in the presence of a multiantenna wiretap channel. [ABSTRACT FROM PUBLISHER]

Optimal signaling for secrecy rate maximization in Gaussian MIMO wiretap channels is considered. While this channel has attracted a significant attention recently and a number of results have been obtained, including the proof of the optimality of Gaussian signalling, an optimal transmit covariance matrix is known for some special cases only and the general case remains an open problem. An iterative custom-made algorithm to find a globally-optimal transmit covariance matrix in the general case is developed in this paper, with guaranteed convergence to a global optimum. While the original optimization problem is not convex and hence difficult to solve, its minimax reformulation can be solved via the convex optimization tools, which is exploited here. The proposed algorithm is based on the barrier method extended to deal with a minimax problem at hand. Its convergence to a global optimum is proved for the general case (degraded or not) and a bound for the optimality gap is given for each step of the barrier method. The performance of the algorithm is demonstrated via numerical examples. In particular, 20 to 40 Newton steps are already sufficient to solve the sufficient optimality conditions with very high precision (up to the machine precision level), even for large systems. Even fewer steps are required if the secrecy capacity is the only quantity of interest. The algorithm can be significantly simplified for the degraded channel case and can also be adopted to include the per-antenna power constraints (instead or in addition to the total power constraint). It also solves the dual problem of minimizing the total power subject to the secrecy rate constraint. [ABSTRACT FROM PUBLISHER]

In this paper, an energy harvesting dual-hop relaying system without/with the presence of co-channel interference (CCI) is investigated. Specifically, the energy constrained multi-antenna relay node is powered by either the information signal of the source or via the signal receiving from both the source and interferer. In particular, we first study the outage probability and ergodic capacity of an interference free system, and then extend the analysis to an interfering environment. To exploit the benefit of multiple antennas, three different linear processing schemes are investigated, namely, 1) Maximum ratio combining/maximum ratio transmission (MRC/MRT), 2) Zero-forcing/MRT (ZF/MRT) and 3) Minimum mean-square error/MRT (MMSE/MRT). For all schemes, both the systems outage probability and ergodic capacity are studied, and the achievable diversity order is also presented. In addition, the optimal power splitting ratio minimizing the outage probability is characterized. Our results show that the implementation of multiple antennas increases the energy harvesting capability, hence, significantly improves the systems performance. Moreover, it is demonstrated that the CCI could be potentially exploited to substantially boost the performance, while the choice of a linear processing scheme plays a critical role in determining how much gain could be extracted from the CCI. [ABSTRACT FROM PUBLISHER]

The cognitive radio (CR) system needs to optimally set the sensing period and sensing time, to efficiently utilize the channel while protecting a primary user (PU). The optimal sensing period for maximizing the effective throughput of the CR system depends on not only the on/off pattern of the PU and the sensing error probabilities but also the size of a data packet, the transmission rate, and the forward error correction capability. In this paper, we mathematically derive the optimal sensing period while taking all of these factors into account. On the basis of this optimal period, we design the sensing strategy under which the CR user has the breaks for sensing during a data packet transmission. With the proposed sensing strategy, the CR system can protect the PU very well while achieving the high effective throughput. [ABSTRACT FROM PUBLISHER]

Spectrum sensing is the preeminent task of both cognitive radios and next generation wireless networks. There are various spectrum sensing techniques and methods presented in the literature. Performance evaluation of these techniques and methods is an important issue from the perspective of both the receiver and system design. In this regard, experimental studies that involve implementation, measurement, and performance evaluation of these methods under realistic conditions are of paramount importance, along with the relevant theoretical work. Therefore, in this paper, a generic measurement methodology is proposed to implement various spectrum sensing techniques and evaluate their performances. Mobile and immobile scenarios; line-of-sight and non-line-of-sight conditions; and presence/absence of perfect spectral knowledge cases are all investigated for both energy detector (first-) and second-order statistical receivers. Results are presented along with relevant discussions. Future directions are outlined as well. [ABSTRACT FROM PUBLISHER]

This paper proposes a semianalytical performance prediction method for an iterative receiver that processes signals arriving through a frequency-selective multiple-input multiple-output radio channel. Earlier results provide a distribution of the signal-to-interference-plus-noise ratio at the output of a frequency domain soft interference cancellation minimum mean square error equalizer, which is used to approximate the distribution of the log-likelihood ratios (LLRs) of the demapped bits. Mutual information transfer charts establish a bijective relationship between the variance of the LLRs and the mutual information. We assume a 3rd Generation Partnership Project compliant turbo code, whose transfer charts are simulated in advance. By approximating the LLR variance distribution of the demapped equalizer output, we can evaluate the probability of an intersection between an equalizer chart associated with a random channel realization and a fixed decoder chart. This probability provides the frame error rate. Our proposed prediction method allows horizontally and vertically encoded spatial multiplexing schemes. The vertically encoded scheme is complemented by the inclusion of the Chase combining hybrid automatic repeat request protocol. The proposed method allows reasonable receive antenna correlation. [ABSTRACT FROM AUTHOR]