Search

Next-generation satellite systems targeting multi-Terabit-per-second throughput require surmounting layers of design challenges. For feeder links, extremely high frequency (EHF) band is desired to overcome spectrum limitations and reduce equipment size. Multiple gateways are utilized to aggregate their bandwidths and serve as site diversity, mitigating the increased susceptibility of the EHF band to atmospheric attenuation. Toward this, multiple-input multiple-output (MIMO) technology is well suited for feeder links that share the same time, frequency, and polarization resources. This paper provides novel extension of MIMO-enabled feeder links when clustering more than two gateways and mounting more than two antennas onboard geostationary multibeam satellite, exploiting line-of-sight MIMO on uplinks and downlinks. Arsenal of countermeasures against inter-antenna interference and weather impairments is designed to maximize gains in signal-to-noise ratio, spatial multiplexing, and spatial diversity. Comparisons between offered sum rates and theoretical MIMO capacity are provided when gateway clusters form linear versus circular patterns. Methodology for gateway diversity is developed and analyzed when deploying redundant MIMO feeder links that handle rerouted traffic. Algorithms for ground-based channel state information (CSI) acquisition are designed and implemented in receiver architecture that tackles strong practical impairments. Numerical studies reveal that MIMO-enabled feeder links offer greatly enhanced overall network availability compared with state-of-the-art single-input single-output (SISO) solutions. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicle (UAV)-enabled communications have been proposed as a critical part of the beyond fifth-generation (5G) cellular networks. This type of communications is frequently characterized by line-of-sight (LoS) and dynamic propagation conditions. However, in various scenarios, the presence of large obstacles in the LoS path is unavoidable, resulting in shadowed fading environments. In this paper, a new channel model is proposed, in which the effects of mobility and shadowing are simultaneously considered. In particular, the performance of a UAV-based communication system operating in a shadowed double-scattering channel is analyzed. The new channel model is generic, since it models various fading/shadowing conditions, while it is in terms of easy-to-evaluate mathematical functions. Moreover, a low complexity UAV selection policy is proposed, which exploits shadowing-related information. The proposed scheme offers a reduction of the signal processing complexity, without any important degradation on the performance, as compared to alternatives approaches. In this context, a new analytical framework has been developed for investigating the performance of the new strategy. Finally, the main outcomes of this paper are also validated by empirical data, collected in an air-to-ground measurement campaign. [ABSTRACT FROM AUTHOR]

Intelligent reflecting surface (IRS) is deemed as a promising solution to improve the spectral and energy efficiency of wireless communications cost-effectively. In this paper, we consider a wireless network where multiple base stations (BSs) serve their respective users with the aid of distributed IRSs in the downlink communication. Specifically, each IRS assists in the transmission from its associated BS to user via passive beamforming, while in the meantime, it also randomly scatters the signals from other co-channel BSs, thus resulting in additional signal as well as interference paths in the network. As such, a new IRS-user/BS association problem arises pertaining to optimally balance the passive beamforming gains from all IRSs among different BS-user communication links. To address this new problem, we first derive a tractable lower bound of the average signal-to-interference-plus-noise ratio (SINR) at the receiver of each user, termed average-signal-to-average-interference-plus-noise ratio (ASAINR), based on which two ASAINR balancing problems are formulated to maximize the minimum ASAINR among all users by optimizing the IRS-user associations without and with BS transmit power control, respectively. We also characterize the scaling behavior of user ASAINRs with the increasing number of IRS reflecting elements to investigate the different effects of IRS-reflected signal versus interference power. Moreover, to solve the two ASAINR balancing problems that are both non-convex optimization problems, we propose an optimal solution to the problem without BS power control and low-complexity suboptimal solutions to both problems by applying the branch-and-bound method and exploiting new properties of the IRS-user associations, respectively. Numerical results verify our performance analysis and also demonstrate significant performance gains of the proposed solutions over benchmark schemes. [ABSTRACT FROM AUTHOR]

In this paper, we investigate a coordinated multipoint (CoMP) beamforming and power control problem for base stations (BSs) with a massive number of antenna arrays under coarse quantization at low-resolution analog-to-digital converters (ADCs) and digital-to-analog converter (DACs). Unlike high-resolution ADC and DAC systems, non-negligible quantization noise that needs to be considered in CoMP design makes the problem more challenging. We first formulate total power minimization problems of both uplink (UL) and downlink (DL) systems subject to signal-to-interference-and-noise ratio (SINR) constraints. We then derive strong duality for the UL and DL problems under coarse quantization systems. Leveraging the duality, we propose a framework that is directed toward a twofold aim: to discover the optimal transmit powers in UL by developing iterative algorithm in a distributed manner and to obtain the optimal precoder in DL as a scaled instance of UL combiner. Under homogeneous transmit power and SINR constraints per cell, we further derive a deterministic solution for the UL CoMP problem by analyzing the lower bound of the SINR. Lastly, we extend the derived result to wideband orthogonal frequency-division multiplexing systems to optimize transmit power and beamformer for all subcarriers. Simulation results validate the theoretical results and proposed algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we investigate energy efficient transmission for a satellite-aerial-terrestrial network (SATN), where a multi-antenna unmanned aerial vehicle (UAV) is employed as a relay to assist the satellite signal delivery. By considering total power constraint (TPC) or per-antenna power constraint (PPC) at the UAV, we first formulate an optimization problem to maximize the energy efficiency of the SATN, which is defined as ratio of the ergodic capacity to the total power consumption for communication at UAV. Then, by jointly exploiting array signal processing with the Dinkelbach’s method, two new beamforming (BF) schemes, namely, TPC-BF and PPC-BF are proposed to solve the non-convex energy efficiency maximization problem. The main advantage of our method is that only angular information-based channel state information is used to obtain BF weight vectors so that a low implementation complexity is achieved. Furthermore, by assuming that the satellite-UAV link undergoes correlated Shadowed-Rician fading while the UAV-terminal link experiences correlated Rician fading, closed-form expressions for the statistics of the equivalent output signal-to-noise ratio are derived and, thus energy efficiency for the considered SATN with BF schemes is analytically presented. Finally, simulation results corroborate the derived expressions and confirm the effectiveness of the proposed BF schemes. [ABSTRACT FROM AUTHOR]

A typical wireless sensor network (WSN) has multiple sensors, each of which obtains noisy observation of one common physical event and sends the observation to a fusion center (FC) for post-processing. This paper provides a comprehensive research on robust linear transceiver design in the presence of imperfect channel-state information (CSI) in multi-input multi-output (MIMO) WSNs. For the CSI uncertainty, the classical ellipsoid model is assumed, where channel estimation errors live in an ellipsoid. Two robust beamforming problems are considered: 1) the worst-case mean-square-error (MSE) minimization with limited power and 2) sum-power minimization with guaranteed worst-case MSE. For both problems, centralized and decentralized solutions are developed. Moreover, an interesting fundamental relation between the metrics of signal-to-noise ratio (SNR) and MSE has been presented, which extends our proposed solutions to handle the transceiver design when SNR is considered. Extensive numerical results are presented to confirm our findings. [ABSTRACT FROM AUTHOR]

In this paper, we investigate secure transmission in a massive multiple-input multiple-output system adopting low-resolution digital-to-analog converters (DACs). Artificial noise (AN) is deliberately transmitted simultaneously with the confidential signals to degrade the eavesdropper’s channel quality. By applying the Bussgang theorem, a DAC quantization model is developed which facilitates the analysis of the asymptotic achievable secrecy rate. Interestingly, for a fixed power allocation factor $\phi $ , low-resolution DACs typically result in a secrecy rate loss, but in certain cases, they provide superior performance, e.g., at low signal-to-noise ratio (SNR). Specifically, we derive a closed-form SNR threshold which determines whether low-resolution or high-resolution DACs are preferable for improving the secrecy rate. Furthermore, a closed-form expression for the optimal $\phi $ is derived. With AN generated in the null-space of the user channel and the optimal $\phi $ , low-resolution DACs inevitably cause secrecy rate loss. On the other hand, for random AN with the optimal $\phi $ , the secrecy rate is hardly affected by the DAC resolution because the negative impact of the quantization noise can be compensated by reducing the AN power. All the derived analytical results are verified by numerical simulations. [ABSTRACT FROM AUTHOR]

This paper investigates a user-fairness relay selection (RS) problem for decode-and-forward (DF) full-duplex (FD) relay networks, where multiple users cooperate with multiple relays in each coherence time. We consider two residual self-interference (RSI) models with or without direct links. We propose a sub-optimal relay selection (SRS) scheme which requires only the instantaneous channel state information (CSI) of source-to-relay and relay-to-destination links. To evaluate the performance, the outage probability of SRS is derived for different scenarios depending on RSI models and the availability of direct links. To further investigate, asymptotic expressions are derived for the high-transmit power regime. For comparison purposes, 1) the average throughputs of the FD and half-duplex (HD) modes are derived; 2) non-orthogonal transmission is considered and its performance is discussed with approximations; and 3) the impact of imperfect CSI is investigated with the aid of analysis. While simulation results are provided to verify the analytical results, they reveal interesting fundamental trends. It turns out that a significant throughput degradation occurs with FD mode over HD mode when self-interference is fully proportional to the transmit power. Since all users can communicate in the same coherence time with the FD mode, these joint RS schemes are useful for user-fairness low-latency applications. [ABSTRACT FROM AUTHOR]

This paper studies the combination of practical trellis and convolution codes with Tomlinson-Harashima precoding (THP) for the presubtraction of multiuser interference that is known at the transmitter but not known at the receiver. It is well known that a straightforward application of THP suffers power, modulo, and shaping losses. This paper proposes generalizations of THP that recover some of these losses. At a high signal-to-noise ratio (SNR), the precoding loss is dominated by the shaping loss, which is about 1.53 dB. To recover shaping loss, a trellis-shaping technique is developed that takes into account the knowledge of a noncausal interfering sequence, rather than just the instantaneous interference. At rates of 2 and 3 bits per transmission, trellis shaping is shown to be able to recover almost all of the 1.53-dB shaping loss. At a low SNR, the precoding loss is dominated by power and modulo losses, which can be as large as 3-4 dB. To recover these losses, a technique that incorporates partial interference presubtraction (PIP) within convolutional decoding is developed. At rates of 0.5 and 0.25 bits per transmission, PIP is able to recover 1-1.5 dB of the power loss. For intermediate SNR channels, a combination of the two schemes is shown to recover both power and shaping losses. [ABSTRACT FROM AUTHOR]

This paper investigates the effect of imperfect channel state information (CSI) on the outage performance of cooperative distributed beamforming (DBF). The acquisition of perfect CSI is disturbed by outdated CSI and channel estimation errors. Decode-and-forward relays are considered with individual power constraints at each relay. Considering a training-and-feedback strategy to acquire CSI, a closed-form approximate expression for outage probability and the achievable diversity gain are first provided under Rayleigh fading channels. Numerical observations verify that the approximation is very tight. It is shown that outdated CSI seriously degrades the performance, and therefore, the outage probability is bounded and no diversity is achieved. Conversely, channel estimation errors cause slight performance degradation, and full diversity order is still achievable. However, even when CSI is outdated, it is shown that the asymptotic outage decreases as the number of relays $K$ increases, where the logarithm of the outage probability decreases at the rate of $K\log K$. This paper shows that, when the destination re-estimates the current CSI for decoding, the effect of outdated CSI is greatly mitigated and consequently achieves a diversity gain of one. To re-estimate the current CSI with small overhead, the beamformed training sequence (BFTS) strategy is proposed, in which a new closed-form formula for minimum-mean-square-error estimation is presented using Gaussian approximation. Numerical results verify that the outage performance with the proposed BFTS scheme is close to that of a perfect estimation. A closed-form outage expression of DBF with the proposed BFTS scheme is also presented under an assumption of high-signal-to-noise ratio (SNR), but the expression is very tight even in low-to-moderate SNR regimes. [ABSTRACT FROM AUTHOR]

This paper investigates the throughput-reliability tradeoff (TRT) for dual-hop amplify-and-forward relay systems with one source, one destination, and multiple relays, and its relationship with the diversity-multiplexing tradeoff (DMT). The TRT was proposed in the context of MIMO block fading channels to reveal the interplay between the signal-to-noise ratio (SNR), rate R, and outage probability that are not accessible through the DMT. The contributions of this paper include the calculation of the TRT expressions for two classes of amplify-and-forward protocols: the slotted amplify-and-forward and the non-orthogonal amplify-and-forward. Based on the derived expressions, relationships between the SNR, rate and outage probability are explored. The relationship between the TRT and the DMT is investigated. One of the goals of the TRT is to predict the slope and offset of the outage vs. SNR set of curves parameterized by different rates. We verify the accuracy of the TRT predictions in the context of amplify-and-forward relays. [ABSTRACT FROM AUTHOR]

This paper considers the application of non-orthogonal multiple access (NOMA) to a multi-user network with mixed multicasting and unicasting traffic. The proposed design of beamforming and power allocation ensures that the unicasting performance is improved while maintaining the reception reliability of multicasting. Both analytical and simulation results are provided to demonstrate that the use of the NOMA assisted multicast-unicast scheme yields a significant improvement in spectral efficiency compared with orthogonal multiple access (OMA) schemes which realize multicasting and unicasting services separately. Since unicast messages are broadcast to all the users, how the use of NOMA can prevent those multicast receivers intercepting the unicasting messages is also investigated, where it is shown that the secrecy unicasting rate achieved by NOMA is always larger than or equal to that of OMA. Simulation results are provided to verify the developed analytical results and demonstrate the superior performance of the proposed NOMA scheme. [ABSTRACT FROM PUBLISHER]

In this paper, we propose a scheme for the detection of digital amplitude-phase modulated signals in flat fading channels with non-Gaussian noise. The additive noise is modeled by a symmetric alpha-stable distribution, a well-known model of man-made and natural noise that appears in various environments. A major challenge in the design of signal detection schemes is that detectors typically operate without knowledge of the transmitted data, channel state, and noise statistics. The design becomes especially difficult for the considered noise model since conventional signal processing approaches are not applicable. For this reason, we propose a five-stage signal detection scheme that is based on the use of a matched myriad filter. An important contribution of this paper is the development of new algorithms for the estimation of noise distribution parameters in the presence of an unknown signal. Results are presented which show that the proposed detector outperforms a zero-memory non-linearity-based scheme. [ABSTRACT FROM AUTHOR]

In this paper, we present a joint antenna beamforming and power allocation technique to maximize the multiuser sum rate in an underlying microcellular system which reuses the same spectrum of a macrocellular system. One challenge in this kind of hierarchical cognitive radio (HCR) systems is to manage the interference between the macrocell and the microcell. The key contribution of this paper is to develop an optimization technique for antenna beamforming that can maximize the achievable sum rate of the underlying cognitive radio (CR) microcellular system and control the interference between the macrocell and the microcell with a satisfaction level. The proposed technique optimizes the sum rate performance by maximizing its lower bound and transfers the original non-convex problem into a convex optimization problem by introducing auxiliary variables to confine the intra-user interference power among the secondary system. Next, an iterative sum rate maximization (ISM) algorithm is developed to find the beamforming weights and the allocated power for each secondary user to simultaneously maximize system sum rate, coverage, and concurrent multiuser transmission probability in the HCR system. The developed joint design methodology provides valuable insights into the design of an optimal HCR system for various numbers of users as well as cell coverage, and can quantitatively optimize the performance tradeoffs in the hierarchical multiuser CR systems for current and future wireless communication applications. [ABSTRACT FROM PUBLISHER]

This paper proposes an efficient beamforming scheme which attains optimality as singular value decomposition (SVD) based systems with low complexity utilizing transmit maximum-ratio combining (TMRC) techniques. The TMRC scheme is the optimum structure for single beamforming systems in terms of received signal-to-noise ratio (SNR) in multiple-input single-output (MISO) channels. In this paper, we generalize the TMRC scheme to multiple beamforming multiple-input multiple- output (MIMO) systems which support more than one data stream in coded systems. We express each beamforming vector as a linear combination of TMRC vectors whose coefficients are optimized in a successive manner. Optimization of the beamforming vector is followed by the decorrelation process. All TMRC vectors used as a basis of the remaining beamforming vectors are made orthogonal to previously computed beamforming vectors. Exploiting the concept of the gradient ascent algorithm, we propose a simple non-iterative method of computing the precoder which obtains the near optimal performance. Also we derive a closed form expression of the output SNR distribution for the proposed scheme. Simulation results demonstrate that the proposed scheme achieves the almost identical link performance as the SVD-based system for arbitrary configurations with reduced complexity. [ABSTRACT FROM AUTHOR]

The integration of cooperative transmission into satellite networks is regarded as an effective strategy to increase the energy efficiency as well as the coverage of satellite communications. This paper investigates the performance of an amplify-and-forward (AF) hybrid satellite-terrestrial relay network (HSTRN), where the links of the two hops undergo Shadowed-Rician and Rayleigh fading distributions, respectively. By assuming that a single antenna relay is used to assist the signal transmission between the multi-antenna satellite and multi-antenna mobile terminal, and multiple interferers corrupt both the relay and destination, we first obtain the equivalent end-to-end signal-to-interference-plus-noise ratio (SINR) of the system. Then, an approximate yet very accurate closed-form expression for the ergodic capacity of the HSTRN is derived. The analytical lower bound expressions are also obtained to efficiently evaluate the outage probability (OP) and average symbol error rate (ASER) of the system. Furthermore, the asymptotic OP and ASER expressions are developed at high signal-to-noise ratio (SNR) to reveal the achievable diversity order and array gain of the considered HSTRN. Finally, simulation results are provided to validate of the analytical results, and show the impact of various parameters on the system performance. [ABSTRACT FROM AUTHOR]

Convolutional lattice codes, also known as signal codes, have been proposed as a technique to generate structured codes that have good performance. While in principle optimal decoding can be achieved using the Viterbi Algorithm, in practice due to Tomlinson-Harashima precoding, the size of the state space is too large, and one must resort to suboptimal techniques such as sequential decoding. In this paper, we take an alternate approach. By employing a judicious selection of tap coefficients and in combination with precoding, we show that the state space can be constrained to a relatively small set such that Viterbi decoding is practical. The performance of such codes still exhibits a large gap to capacity, and we further propose a parallel concatenation similar to that of turbo codes, resulting in a “turbo signal code.” Due to the relatively small state space, iterative decoding based on the BCJR algorithm is now possible. The gaps between the SNR for a frame error rate of 1% and the optimal performance theoretically achievable for a code of the same rate over an AWGN channel are found by simulation to be within 0.75–0.85 dB with a block length of 8192. [ABSTRACT FROM PUBLISHER]

In cellular network models, the base stations are usually assumed to form a lattice or a Poisson point process (PPP). In reality, however, they are deployed neither fully regularly nor completely randomly. Accordingly, in this paper, we consider the very general class of motion-invariant models and analyze the behavior of the outage probability (the probability that the signal-to-interference-plus-noise-ratio (SINR) is smaller than a threshold) as the threshold goes to zero. We show that, remarkably, the slope of the outage probability (in dB) as a function of the threshold (also in dB) is the same for essentially all motion-invariant point processes. The slope merely depends on the fading statistics. Using this result, we introduce the notion of the asymptotic deployment gain (ADG), which characterizes the horizontal gap between the success probabilities of the PPP and another point process in the high-reliability regime (where the success probability is near 1). To demonstrate the usefulness of the ADG for the characterization of the SINR distribution, we investigate the outage probabilities and the ADGs for different point processes and fading statistics by simulations. [ABSTRACT FROM PUBLISHER]

In this paper, the effects of interference on composite fading environments, where multipath fading coexists with shadowing, are investigated. Based on some mathematical convenient expressions for the sum of squared \cal K -distributed random variables, which are derived for the first time, important statistical metrics for the signal to interference and noise ratio (SINR) are studied for various cases including non identical, identical and fully correlated statistics. Furthermore, our analysis is extended to multi-channel receivers and in particular to selection diversity (SD) receivers, investigating two distinct cases, namely, signal-to-noise ratio based and SINR-based SD. For all scenarios, simplified expressions are also provided for the interference limited case, where the influence of thermal noise is ignored. The derived expressions are used to analyze the performance, in terms of the average bit error probability (ABEP) and the outage probability (OP) , of such systems operating over composite fading environments. A high SNR analysis is also presented for the OP and the ABEP, giving a clear physical insight of the system's performance in terms of the diversity and coding gains. The analysis is accompanied by numerical evaluated results, clearly demonstrating the usefulness of the proposed theoretical framework. [ABSTRACT FROM PUBLISHER]

The newly emerging wireless powered communication networks (WPCNs) have recently drawn significant attention, where radio signals are used to power wireless terminals for information transmission. In this paper, we study a WPCN where one multi-antenna access point (AP) coordinates energy transfer and information transfer to/from a set of single-antenna users. A harvest-then-transmit protocol is assumed where the AP first broadcasts wireless power to all users via energy beamforming in the downlink (DL), and then, the users send their independent information to the AP simultaneously in the uplink (UL) using their harvested energy. To optimize the users' throughput and yet guarantee their rate fairness, we maximize the minimum throughput among all users by a joint design of the DL–UL time allocation, the DL energy beamforming, and the UL transmit power allocation, as well as receive beamforming. We solve this nonconvex problem optimally by two steps. First, we fix the DL–UL time allocation and obtain the optimal DL energy beamforming, UL power allocation, and receive beamforming to maximize the minimum signal-to-interference-plus-noise ratio of all users. This problem is shown to be still nonconvex; however, we convert it equivalently to a spectral radius minimization problem, which can be solved efficiently by applying the alternating optimization based on the nonnegative matrix theory. Then, the optimal time allocation is found by a one-dimensional search to maximize the minimum rate of all users. Furthermore, two suboptimal designs of lower complexity are also proposed, and their throughput performance is compared against that of the optimal solution. [ABSTRACT FROM AUTHOR]

This paper is concerned with design problems of joint source power allocation and relay beamforming in multi-user multi-relay networks that use single-carrier frequency division multiple access (SC-FDMA) and amplify-and-forward relaying. Examined are the joint programs of (i) maximizing the minimum signal-to-interference-plus-noise ratio (SINR) under various transmitted power constraints, and (ii) minimizing the total transmitted power subject to prescribed SINR thresholds of users. Although these optimization problems are highly nonconvex and have large dimensions, by exploiting their partial convexities and making elegant nonlinear variable changes, they are recast as d.c. (difference of two convex) programs. Efficient d.c. iterative procedures are then developed to find the solutions. Simplified joint programs under the two cases of equal source power and equal relay beamforming weights, respectively, are also considered. Branch-and-bound algorithms of deterministic global optimization are then proposed for solving the simplified joint programs. Simulation results confirm the excellent performance and computational efficiency of all the proposed solutions. [ABSTRACT FROM PUBLISHER]

Beamforming design for multi-user wireless relay networks under the criterion of maximin information throughput is an important but also very hard optimization problem due to its nonconvex nature. The existing approach to reformulate the design as a matrix rank-one constrained optimization problem is highly inefficient. This paper exploits the d.c. difference of two convex functions) structure of the objective function and the convex structure of the constraints in such a global optimization problem to develop efficient iterative algorithms of very low complexity to find the solutions. Both cases of concurrent and orthogonal transmissions from sources to relays are considered. Numerical results indicate that the proposed algorithms provide solutions that are very close to the upper bound on the solution of the non-orthogonal source transmissions case and are almost equal to the optimal solution of the orthogonal source transmissions case. This demonstrates the ability of the developed algorithms to locate approximations close to the global optimal solutions in a few iterations. Moreover, the proposed methods are superior to other methods in both performance and computation complexity. [ABSTRACT FROM AUTHOR]

In this paper, we start by investigating the impact of joint transmit-receive I/Q imbalance on the performance of direct-conversion beamforming OFDM transceivers. We derive a new analytical expression for the average subcarrier SINR of the I/Q imbalance-ignorant beamformer in terms of the I/Q imbalance level at both the transmit and receive sides, the size of the beamforming array, and the input SNR level. This expression motivates the need for I/Q imbalance compensation and provides valuable design insights when examining several special and limiting cases. Next, we derive the throughput-maximizing multiple beamforming transmit/receive coefficients under a general system model with an asymmetric frequency-dependent (FD) joint transmit-receive I/Q imbalance. In addition, we propose a low-complexity pilot-aided scheme for the estimation of the channel and I/Q imbalance parameters. Our simulation results demonstrate that the proposed generalized multiple beamforming scheme is highly effective in mitigating I/Q imbalance effects at practical complexity levels. [ABSTRACT FROM AUTHOR]

In this paper exact closed-form expressions are derived for the outage probability (OP) in scenarios where the signal of interest (SoI) experiences η-μ or κ-μ fading, the interfering signals are subject to η-μ fading and the background noise can be neglected. With the only assumption that the μ parameter is a positive integer number for the interfering signals, the derived expressions when the SoI is either η-μ or κ-μ distributed are given in elementary terms for maximal ratio combining (MRC) with independent branches. If the pre-combining SoI power signals are η-μ distributed with their corresponding μ parameters being positive integer or half-integer numbers, the previous analysis is extended for spatially correlated MRC at the receiver. [ABSTRACT FROM PUBLISHER]

In this paper, we introduce the Inverse Gaussian (IG) fading distribution to model the envelope and the power of the received signal in radio propagation fading channels and free-space optical (FSO) channels. The joint distribution of the IG process and its derivative and the marginal distribution of the derivative are developed. The obtained formulas are then used to derive the second-order statistics of the received signal envelope and the channel capacity under IG and Nakagami-IG (NIG) fading distributions. Numerical results sustaining our analysis are provided, and the impacts of various parameters on the system performance are investigated. [ABSTRACT FROM AUTHOR]

The signal to interference plus noise ratio (SINR) feedback has been utilized in random beamforming (RBF) to select users for multiple-input multiple-output (MIMO) systems where a large number of users are required to obtain a multi-user diversity gain. However, if the number of users is not large enough, it may be difficult to obtain the performance gain and be easy to have a performance degradation conversely. To resolve this problem, it is necessary to find orthogonal random beams close to the channel matrix of selected users. In this paper, we present RBF using a non-orthogonal beamforming matrix (RBF NOBM), demonstrating an efficient search of random beams correlated with the channel matrix of selected users over a small number of users. For single user RBF using NOBM (SU-RBF NOBM) with two transmit antennas, the beamforming matrix for user data service is obtained through closed form expressions, and SU-RBF NOBM is then expanded to more than two transmit antennas. We also propose user selection algorithms for SU-RBF NOBM and multi-user RBF using NOBM (MU-RBF NOBM). Via simulation results, we demonstrate that the performances of RBF NOBM represent significant improvements compared to conventional beamforming schemes. [ABSTRACT FROM PUBLISHER]

The probability of a miss in the detection of a signal in an optical communications system through the turbulent atmosphere using intensity modulation is studied. The turbulence of the atmosphere causes scintillation of the received signal intensity which is treated as a log normal random process. The received background radiation and electronic noise in the receiver is treated as additive white Gaussian noise (AWGN). A Chernoff bound is derived for the lognormal sum distribution. An approximation for the lognormal sum distribution is investigated for its utility in calculating the probability of miss. For practical values of the signal-to-noise power ratio (SNR), a series solution for the characteristic function of the lognormal random variable is used to find the probability of miss. Simulation results agree with theoretical results. The method developed in this paper can be used by the system designer to choose the proper signal length and meet the system specifications for signal detection. [ABSTRACT FROM AUTHOR]

Near-capacity performance of turbo codes is generally achieved with a large number of decoding iterations. Various iteration stopping rules introduced in the literature often induce performance loss. This paper proposes a novel partial decoding iteration scheme using a bit-level convergence test. We first establish decoding optimality of windowed partial iteration for non-converged bits given that convergence has been achieved on window boundaries. We next present two criteria for testing bit convergence based on cross-entropy, and propose a windowed partial iteration algorithm. The overall complexity and memory requirements of the new algorithm are evaluated and compared with known algorithms. Simulations reveal that the proposed scheme suffers essentially no performance loss compared to full iterations, while reducing the decoding complexity. We also briefly discuss possible extensions of the proposed scheme to general iterative receivers. [ABSTRACT FROM AUTHOR]

This paper studies the problem of Raptor-code design for binary-input AWGN (BIAWGN) channels using the mean-LLR-EXIT chart approach presented in [1]. We report that there exist situations where such a design approach may fail or fail to produce capacity-achieving codes, for certain ranges of channel SNR. Suggestions and discussions are provided pertaining to the design of Raptor codes for BIAWGN channels using the mean-LLR-EXIT chart. [ABSTRACT FROM AUTHOR]

A carrier offset in OFDM system simulation is generally considered to be slowly time-varying, so that, over short simulation periods, it may be considered to be a constant quantity. However, depending on system mobility, carrier frequency, and communication duration, time-varying carrier offsets caused by Doppler effects can be significant in a real physical environment. Few researchers have addressed this in their works, Of those who have addressed this, many present simplified, vague, or inaccurate time-varying carrier offset models. In this paper, we present a more realistic time-varying carrier offset model and present expressions for carrier offset correction that maximize the signal-to-interference ratio (SIR). We also provide guidelines for when the application of the time-varying carrier offset model is crucial for correct OFDM system evaluation. [ABSTRACT FROM AUTHOR]

In this paper, we first propose an optimum relay ordering algorithm for the multi-branch multi-hop cooperative diversity networks. This optimum algorithm has a high complexity that makes it hard to implement. Therefore, a suboptimum relay ordering algorithm, which considerably reduces the complexity, is then developed. Furthermore, for a cooperative network with two relays, we analytically evaluate the performance of the suboptimum algorithm by using an approximate end-to- end signal-to-noise ratio expression. Specifically, an approximate probability of wrong selection and an approximate expression of the symbol error rate are derived. The analysis and the numerical results demonstrate that the suboptimum algorithm performs very well as the optimum one at a much lower complexity. [ABSTRACT FROM AUTHOR]

In multiuser multiple-input-multiple-output (MIMO) downlink channels, zero-forcing beamforming (ZFBF), though it is simpler than dirty-paper coding (DPC), has been shown to achieve an optimal sum-capacity growth as the number of users goes to infinity. However, the result is based on the assumption that perfect channel information at the transmitter from all the users is known, which is prohibitive especially for a large number of users due to feedback congestion. In this case, wisely preventing the users with poor channel quality from sending the feedback might relieve the burdensome feedback load, which is often called quality-based channel state reporting (QBR). In this letter, we prove ZFBF with QBR also can achieve the asymptotic optimal growth. With numerical investigations, the optimality is confirmed. In addition, we numerically show how much feedback burden can be reduced by QBR at a negligible cost of the sum-capacity. [ABSTRACT FROM AUTHOR]

In this paper, a coded convolutional spreading code-division multiaccess with cyclic prefix (CS-CDMA/CP) system in conjunction with iterative receivers is proposed for synchronous downlink transmission over frequency selective fading channels and its performance is compared with the uncoded CS-CDMA/CP employing maximum-likelihood sequence estimation (MLSE) receiver as well as with the conventional coded direct sequence CDMA (DS-CDMA) employing (maximal ratio combining-) MRC-RAKE. Contrary to the uncoded CS-CDMA/CP system which suffers from performance degradation at low signal-to-noise power ratios (SNRs), it is demonstrated that the proposed scheme can attain almost the full path diversity gain over all SNRs with single-user complexity. Compared with the coded DS-CDMA system with single-user receivers, the proposed system is free from multiuser interference (MUI) whenever the multipath delay of the channel does not exceed the designed maximum delay. It is also demonstrated, moreover, that the proposed system shows a robust performance even if the channel length exceed the designed maximum delay slightly. Because of the subblock structure of CS-CDMA/CP, the proposed system can utilize time-diversity effects, when the channel subjects fast fading, and this greatly improves the resultant performance. Finally, it is shown that the receiver complexity of the proposed system is compared quite favorably with the iterative multiuser receivers for coded DS-CDMA systems of comparable performance. [ABSTRACT FROM AUTHOR]

In this paper, we consider a time-slotted MIMO point-to-multipoint network, which, for example, could represent either a cellular downlink, or a cluster in a wireless mesh network. The transmitter sends an independent data stream from each transmit antenna to communicate simultaneously to a subset of the receivers in each slot. The transmitter sends training symbols at the beginning of each slot so that each receiver can estimate the channel and determine the data rate it could potentially receive from each transmit antenna after configuring its antenna weights appropriately. For this purpose, we develop a maximum-likelihood estimator of the signal to interference plus noise ratio (SINR) from the received training symbols. The transmitter decides which receivers to serve in each slot to maximize the minimum normalized average data rate realized by each receiver. This scheduling decision is made based on estimated SINR information fed back by receivers. Through some numerical examples, we discuss some general issues with regard to exploitation of multi-user diversity in the context of imperfect channel state information. For example, the scheduler introduces a bias for positive SINR estimation errors, which is important to take into account when the receivers declare a potential data rate in each slot. [ABSTRACT FROM AUTHOR]

Approximating the sum of Log-Normal Random Variables (RVs) is a long-standing open issue and many studies in the old and recent literature resort to assume that the "power sum" can be well modeled via another Log-Normal RV. Such a Log-Normal approximation can be effectively used for accurate Outage Probability (Pout) analysis and modeling of Signal-to-(Noise+Interference) Ratio (SNIR) behaviors in the context of radio resource management in wireless systems; nevertheless, it is recognized that i) an adequate accuracy can only be obtained for a sub-range of values taken by the distribution; ii) the achievable accuracy depends on the parameters of the set of RVs; iii) Log-Normal approximation may not provide a satisfactory accuracy for estimating bit error probabilities. Moreover, all contributions in the open technical literature are referred to model the "power sum" distribution, i.e., the weighted linear combination of Log-Normal RVs with weights that may take only positive values. While this setup is consistent with typical scenarios where summands add incoherently, it has recently been shown that in some high frequency-selective multipath channels with Log-Normal distributed shadow- and fast-fading, e.g., in Impulse Radio Ultra Wide Band (IR-UWB) systems, the Signal-to-Noise Ratio (SNR) is more accurately modeled by the weighted linear combination of Log-Normal RVs with weights that may assume both positive and negative values. Motivated by the above considerations, and moving from recent results, which show that approximating the "power sum" of Log-Normal RVs can boil down to a model selection problem within the Pearson system of distributions, the specific contribution of this paper can be summarized as follows. i) We show that the Pearson Type IV distribution can not only be used to accurately approximate the Probability Density Function (PDF) of the "power sum" of Log-Normal RVs with positive weights, but it can also accurately model the scenario with both positive and negative weights, as well as the scenario with generically correlated RVs. ii) For the scenario with independent RVs, we propose a numerical technique, which is based on the Moment Generating Function (MGF) matching principle and uses a least-squares criterion, to accurately estimate the four parameters of the Pearson Type IV distribution. iii) A byproduct of this analysis is the extension of the classical Schwartz-Yeh method to estimate the third and fourth moments of the linear combination of Log-Normal RVs. iv) By relying on the proposed approximation, we develop an analytical framework to accurately estimate the performance of Rake and Transmitted-Reference (TR) receivers in IR-UWB frequency-selective multipath channels. [ABSTRACT FROM AUTHOR]

Physical impairments like IQ imbalance and phase noise can cause significant degradation in the performance of wireless communication systems. In this paper, the joint effects of IQ imbalance and phase noise on OFDM systems are analyzed, and a compensation scheme is proposed to improve the system performance in the presence of IQ imbalance and phase noise. The scheme consists of a joint estimation of channel and impairment parameters and a joint data symbol estimation algorithm. It is shown both by theory and computer simulations that the proposed scheme can effectively improve the signal-to-noise ratio at the receiver. As a result, the sensitivity of OFDM receivers to the physical impairments can be significantly lowered, simplifying the RF and analog circuitry design in terms of implementation cost, power consumption, and silicon fabrication yield. [ABSTRACT FROM AUTHOR]

A new construction of good, easily encodable, and soft-decodable codes is proposed in this paper. The construction is based on serially concatenating several simple 1+D convolutional codes as the outer code, and a rate-i 1/(1 + D) accumulate code as the inner code. These codes have very low encoding complexity and require only one shift-forward register for each encoding branch. The input-output weight enumerators of these codes are also derived. Divsalar's simple bound technique is applied to analyze the bit error rate performance, and to assess the minimal required signal-to-noise ratio (SNR) for these codes to achieve reliable communication under AWGN channel. Simulation results show that the proposed codes can provide good performance under iterative decoding. [ABSTRACT FROM AUTHOR]

In wireless packet-forwarding networks with selfish nodes, application of a repeated game can induce the nodes to forward each others' packets, so that the network performance can be improved. However, the nodes on the boundary of such networks cannot benefit from this strategy, as the other nodes do not depend on them. This problem is sometimes known as the curse of the boundary nodes. To overcome this problem, an approach based on coalition games is proposed, in which the boundary nodes can use cooperative transmission to help the backbone nodes in the middle of the network. In return, the backbone nodes are willing to forward the boundary nodes' packets. Here, the concept of core is used to study the stability of the coalitions in such games. Then three types of fairness are investigated, namely, min-max fairness using nucleolus, average fairness using the Shapley function, and a newly proposed market fairness. Based on the specific problem addressed in this paper, market fairness is a new fairness concept involving fairness between multiple backbone nodes and multiple boundary nodes. Finally, a protocol is designed using both repeated games and coalition games. Simulation results show how boundary nodes and backbone nodes form coalitions according to different fairness criteria. The proposed protocol can improve the network connectivity by about 50%, compared with pure repeated game schemes. [ABSTRACT FROM AUTHOR]

In this paper, a utility-based joint power and rate adaptive algorithm (UPRA) is proposed to alleviate the influence of channel variation by using softened signal-to-interference-and-noise ratio (SINR) requirements. The transmission power and rate of each user will be adjusted to maximize its own net-utility according to the states of channel, which results in a balance between the effective transmission rate and power consumption. Although the UPRA works based on a non-cooperative game, cooperation among users can be achieved so that the throughput of the whole network will be improved. The convergence of the algorithm has also been studied in both feasible and infeasible cases. [ABSTRACT FROM AUTHOR]

Belief propagation (BP) algorithm for decoding low- density parity-check (LDPC) codes over a binary input additive white Gaussian noise (BIAWGN) channel requires the knowledge of the signal-to-noise ratio (SNR) at the receiver to achieve its ultimate performance. An erroneous estimation or the absence of a perfect knowledge of the SNR at the decoder is referred to as "SNR mismatch". SNR mismatch can significantly degrade the performance of LDPC codes decoded by the BP algorithm. In this paper, using extrinsic information transfer (EXIT) charts, we design irregular LDPC codes that perform better (have a lower SNR threshold) in the presence of mismatch compared to the conventionally designed irregular LDPC codes that are optimized for zero mismatch. Considering that mm-sum (MS) algorithm is the limit of BP with infinite SNR over-estimation, the EXIT functions generated in this work can also be used for the efficient analysis and design of LDPC codes under the MS algorithm. [ABSTRACT FROM AUTHOR]

Multiple-input multiple-output (MIMO) system with multicode transmission can provide high speed data services by transmitting independent parallel substreams from multiple antennas and through multicode channelization. In this paper, we first introduce an iterative two-stage successive interference cancellation (SIC) detection scheme for a multicode MIMO system. The proposed technique cancels the interference signals successively in the space domain followed by the code domain. Next, we develop various transmit power allocation schemes over different data substreams for the proposed detection process to improve error rate performance. The joint transmit power allocation is derived to make the post-detection signal-to-interferenceplus-noise ratio (SINR) become the same for all substreams in both the space and code domains. As a computationally efficient scheme, we propose a two stage power allocation scheme, which allocates the total transmit power to the substreams in the code domain at the first stage, and allocates this code domain power to the substreams in the space domain at the second stage. Furthermore, variable and constant power ratio (PR) schemes are derived to reduce the feedback overhead. In particular, the constant PR scheme utilizes the transmit power ratio determined by the long-term statistical properties of the fading channel amplitudes, and achieves significantly reduced feedback rate. Numerical results show that the proposed transmit power allocation schemes for the two-stage SIC significantly outperform the equal power allocation scheme. [ABSTRACT FROM AUTHOR]

The feasible log-SIR region is defined as a set of all signal-to-interference ratios (SIR) expressed in logarithmic scale that can be supported in a wireless network by means of power control and with all users being active concurrently. Recently, the feasible log-SIR region was shown to be a convex set, which is a key ingredient in the development of some power control strategies for wireless systems. In this paper, under the assumption of a noiseless channel, we strengthen these results by proving a necessary and sufficient condition for the feasible log-SIR region to be a strictly convex set. The strict convexity property is of interest since it is closely related to the problem of the existence and uniqueness of a so-called log-SIR fair power vector. [ABSTRACT FROM AUTHOR]

In this paper, we design capacity approaching low- density parity-check (LDPC) codes in the low signal-to-noise ratio (SNR) regime for flat Rayleigh fading channels with channel side information at transmitter and receiver. We use the structure advocated by Caire et al, which uses a single codebook with dynamic power allocation. The extrinsic information transfer (EXIT) function method is used to design the LDPC codes which approach the channel capacities. We also study the EXIT function properties of various demappers. [ABSTRACT FROM AUTHOR]

This paper presents simple and exact expressions for the average bit error rate (BER) of M-ary orthogonal signals with noncoherent diversity combining in independent as well as arbitrarily correlated nonidentically distributed Nakagami-m fading channels. The expressions are given in terms of elementary functions, and they do not involve numerical integrals or complicated functional operations. In addition, they are valid for the generalized case when the channels have arbitrary average signalto-noise ratios (SNRs) as. well as nonidentical fading parameters. Simulation results are provided to validate the analytical results. [ABSTRACT FROM AUTHOR]

This paper derives exact expressions for the average error performance of M-ary orthogonal signals with noncoherent equal-gain diversity combining over nonidentical generalized Rician, Nakagami-m, Nakagami-q, and implicitly Rayleigh fading channels. The assumption of generalized distributed fading envelopes implies that the received average signal-to-noise ratios (SNRs) and/or the fading parameters can have arbitrary nonidentical values. The derived expressions are precisely given in terms of either one-fold integral or rapidly convergent infinite series, which can be readily evaluated numerically. In addition, they can be usefully used to study the impact of arbitrary correlation among diversity branches on the system average error performance. [ABSTRACT FROM AUTHOR]

This paper presents a practical implementation of the Vertical Bell Laboratories Layered Space-Time (V-BLAST) type system, in which the multiple-input multiple-output (MIMO) open-loop capacity can be approached with conventional scalar coding, using adaptive modulation with appropriate channel codes, e.g., low-density parity-check (LDPC) codes and optimum successive detection (OSD). The density evolution technique is employed to determine the maximal achievable rate of an LDPC code for each transmit antenna for a given channel realization at a given signal-to-noise ratio. Numerical results will show that the average sum rate of the adaptively modulated LDPC encoded system is quite close to the V-BLAST capacity with both rate and power adaptations. Considering the performance degradation caused by error propagation due to the imperfect feedback and relatively long decoding delay in the OSD, we use parallel interference cancellation followed by minimum mean square error filtering in the bit error rate (BER) performance simulation. Simulation results will show that a target BER of 10-5 can be achieved by the optimally designed LDPC codes. To simplify the code design, we replace the LDPC codes, optimally designed for each channel realization, with rate-compatible punctured LDPC codes, at the cost of a slight sum rate loss. If the fading process is nonergodic, the outage capacity corresponding to a given outage probability is used to measure the channel performance. As an example, we design the LDPC codes for an adaptively modulated 2 × 2 V-BLAST system to approach its outage capacity for a given outage probability. [ABSTRACT FROM AUTHOR]

In this paper, we consider the design and bit-error performance analysis of linear parallel interference cancellers (LPIC) for multicarrier (MC) direct-sequence code division multiple access (DS-CDMA) systems. We propose an LPIC scheme where we estimate and cancel the multiple access interference (MAI) based on the soft decision outputs on individual subcarriers, and the interference cancelled outputs on different subcarriers are combined to form the final decision statistic. We scale the MAI estimate on individual subcarriers by a weight before cancellation. In order to choose these weights optimally, we derive exact closed-form expressions for the bit-error rate (BER) at the output of different stages of the LPIC, which we minimize to obtain the optimum weights for the different stages. In addition, using an alternate approach involving the characteristic function of the decision variable, we derive BER expressions for the weighted LPIC scheme, matched filter (MF) detector, decorrelating detector, and minimum mean square error (MMSE) detector for the considered multicarrier DS-CDMA system. We show that the proposed BER-optimized weighted LPIC scheme performs better than the MF detector and the conventional LPIC scheme (where the weights are taken to be unity), and close to the decorrelating and MMSE detectors. [ABSTRACT FROM AUTHOR]

This paper develops a Nash game formulation for optical signal-to-noise ratio (OSNR) in distributed optical links. The starting point is a recent network OSNR model developed for optically amplified links whereby channel powers are adjusted independently only at transmitter sites. A more general case is considered here where channel powers are also adjustable at intermediary dynamic sites, specific to optical networks. For this inherent distributed configuration a nested Nash game is formulated towards minimizing channel OSNR degradation along the link. Existence and uniqueness of the Nash equilibrium solution is shown and a recursive procedure for constructing it is given. Based on this, an iterative algorithm that is distributed with respect to both channels and γ-spans is proposed. [ABSTRACT FROM AUTHOR]

Space-time block codes (STBCs) have attracted recent interest due to their ability to take advantage of both space and time diversity to reliably transmit data over a wireless fading channel. In many cases, their design is based on asymptotically tight performance criteria, such as the worst-case pairwise error probability (PEP) or the union bound. However, these quantities fail to give an accurate performance picture, especially at low signal-to-noise ratio, because the classical union bound is known to be loose in this case. This paper develops tighter performance criteria for STBCs which yield considerably better bounds. First, the union bound is developed as the average of the exact PEPs. By noting that some of the terms in the bound are redundant, a second bound is obtained by expurgation. Since this still yields a loose bound, a tighter bound, denoted as the progressive union bound (PUB), is obtained. Because the PUB cannot be computed in closed form, in its most general case, and to avoid computing a high-dimensional numerical integration, its saddlepoint approximation is developed. In addition to the significant improvement of the PUB analysis over other bounding methods, it is also shown that codes designed to optimize the PUB can perform better than those obtained by the looser criteria. [ABSTRACT FROM AUTHOR]

A vector precoding scheme has been recently proposed for the multiple-input multiple-output (MIMO) Gaussian broadcast channel. This technique minimizes the instantaneous transmitted power of linearly precoded signals, but does not take into account the peak-to-average-power ratio (PAPR). In this paper, we present a modified vector precoding scheme, where a perturbation vector is chosen in order to take into account both the instantaneous power and the instantaneous peak power of the transmitted signal. This is obtained by minimizing the p-norm of the transmitted signal for p ≥ 2. For this reason, the scheme is referred to as the p-sphere encoder. We demonstrate the performance of the proposed scheme applied to a MIMO independent, identically distributed Rayleigh fading downlink channel with simple channel inversion. We show that by choosing p ≥ 2, the proposed p-sphere encoder yields a tradeoff between power efficiency, PAPR reduction, and complexity. In particular, with eight antennas, the proposed algorithm significantly reduces the tail of the PAPR distribution, with very small degradation in terms of bit-error rate with respect to standard vector precoding. [ABSTRACT FROM AUTHOR]