Showing papers on "Fading published in 2010"

Noncooperative Cellular Wireless with Unlimited Numbers of Base Station Antennas

Abstract: A cellular base station serves a multiplicity of single-antenna terminals over the same time-frequency interval. Time-division duplex operation combined with reverse-link pilots enables the base station to estimate the reciprocal forward- and reverse-link channels. The conjugate-transpose of the channel estimates are used as a linear precoder and combiner respectively on the forward and reverse links. Propagation, unknown to both terminals and base station, comprises fast fading, log-normal shadow fading, and geometric attenuation. In the limit of an infinite number of antennas a complete multi-cellular analysis, which accounts for inter-cellular interference and the overhead and errors associated with channel-state information, yields a number of mathematically exact conclusions and points to a desirable direction towards which cellular wireless could evolve. In particular the effects of uncorrelated noise and fast fading vanish, throughput and the number of terminals are independent of the size of the cells, spectral efficiency is independent of bandwidth, and the required transmitted energy per bit vanishes. The only remaining impairment is inter-cellular interference caused by re-use of the pilot sequences in other cells (pilot contamination) which does not vanish with unlimited number of antennas.

Secure Transmission with Multiple Antennas II: The MIMOME Wiretap Channel

Abstract: The role of multiple antennas for secure communication is investigated within the framework of Wyner's wiretap channel. We characterize the secrecy capacity in terms of generalized eigenvalues when the sender and eavesdropper have multiple antennas, the intended receiver has a single antenna, and the channel matrices are fixed and known to all the terminals, and show that a beamforming strategy is capacity-achieving. In addition, we show that in the high signal-to-noise (SNR) ratio regime the penalty for not knowing eavesdropper's channel is small--a simple ``secure space-time code'' that can be thought of as masked beamforming and radiates power isotropically attains near-optimal performance. In the limit of large number of antennas, we obtain a realization-independent characterization of the secrecy capacity as a function of the number $\beta$: the number of eavesdropper antennas per sender antenna. We show that the eavesdropper is comparatively ineffective when $\beta<1$, but that for $\beta\ge2$ the eavesdropper can drive the secrecy capacity to zero, thereby blocking secure communication to the intended receiver. Extensions to ergodic fading channels are also provided.

Predictable 802.11 packet delivery from wireless channel measurements

Abstract: RSSI is known to be a fickle indicator of whether a wireless link will work, for many reasons. This greatly complicates operation because it requires testing and adaptation to find the best rate, transmit power or other parameter that is tuned to boost performance. We show that, for the first time, wireless packet delivery can be accurately predicted for commodity 802.11 NICs from only the channel measurements that they provide. Our model uses 802.11n Channel State Information measurements as input to an OFDM receiver model we develop by using the concept of effective SNR. It is simple, easy to deploy, broadly useful, and accurate. It makes packet delivery predictions for 802.11a/g SISO rates and 802.11n MIMO rates, plus choices of transmit power and antennas. We report testbed experiments that show narrow transition regions (

Multiuser MIMO Achievable Rates With Downlink Training and Channel State Feedback

Abstract: In this paper, we consider a multiple-input-multiple-output (MIMO) fading broadcast channel and compute achievable ergodic rates when channel state information (CSI) is acquired at the receivers via downlink training and it is provided to the transmitter by channel state feedback. Unquantized (analog) and quantized (digital) channel state feedback schemes are analyzed and compared under various assumptions. Digital feedback is shown to be potentially superior when the feedback channel uses per channel state coefficient is larger than 1. Also, we show that by proper design of the digital feedback link, errors in the feedback have a minor effect even if simple uncoded modulation is used on the feedback channel. We discuss first the case of an unfaded additive white Gaussian noise (AWGN) feedback channel with orthogonal access and then the case of fading MIMO multiple access (MIMO-MAC). We show that by exploiting the MIMO-MAC nature of the uplink channel, a much better scaling of the feedback channel resource with the number of base station (BS) antennas can be achieved. Finally, for the case of delayed feedback, we show that in the realistic case where the fading process has (normalized) maximum Doppler frequency shift 0 ? F < 1/2, a fraction 1 - 2F of the optimal multiplexing gain is achievable. The general conclusion of this work is that very significant downlink throughput is achievable with simple and efficient channel state feedback, provided that the feedback link is properly designed.

System Level Simulation of LTE Networks

Abstract: In order to evaluate the performance of new mobile network technologies, system level simulations are crucial. They aim at determining whether, and at which level predicted link level gains impact network performance. In this paper we present a MATLAB computationally efficient LTE system level simulator. The simulator is offered for free under an academic, noncommercial use license, a first to the authors' knowledge. The simulator is capable of evaluating the performance of the Downlink Shared Channel of LTE SISO and MIMO networks using Open Loop Spatial Multiplexing and Transmission Diversity transmit modes. The physical layer model is based on the postequalization SINR and provides the simulation pre-calculated "fading parameters" representing each of the individual interference terms. This structure allows the fading parameters to be pregenerated offline, vastly reducing computational complexity at run-time.

Secure Transmission With Artificial Noise Over Fading Channels: Achievable Rate and Optimal Power Allocation

Abstract: We consider the problem of secure communication with multiantenna transmission in fading channels. The transmitter simultaneously transmits an information-bearing signal to the intended receiver and artificial noise to the eavesdroppers. We obtain an analytical closed-form expression of an achievable secrecy rate and use it as the objective function to optimize the transmit power allocation between the information signal and the artificial noise. Our analytical and numerical results show that equal power allocation is a simple yet near-optimal strategy for the case of noncolluding eavesdroppers. When the number of colluding eavesdroppers increases, more power should be used to generate the artificial noise. We also provide an upper bound on the SNR, above which, the achievable secrecy rate is positive and shows that the bound is tight at low SNR. Furthermore, we consider the impact of imperfect channel state information (CSI) at both the transmitter and the receiver and find that it is wise to create more artificial noise to confuse the eavesdroppers than to increase the signal strength for the intended receiver if the CSI is not accurately obtained.

A primer on spatial modeling and analysis in wireless networks

Abstract: The performance of wireless networks depends critically on their spatial configuration, because received signal power and interference depend critically on the distances between numerous transmitters and receivers. This is particularly true in emerging network paradigms that may include femtocells, hotspots, relays, white space harvesters, and meshing approaches, which are often overlaid with traditional cellular networks. These heterogeneous approaches to providing high-capacity network access are characterized by randomly located nodes, irregularly deployed infrastructure, and uncertain spatial configurations due to factors like mobility and unplanned user-installed access points. This major shift is just beginning, and it requires new design approaches that are robust to spatial randomness, just as wireless links have long been designed to be robust to fading. The objective of this article is to illustrate the power of spatial models and analytical techniques in the design of wireless networks, and to provide an entry-level tutorial.

Secure Transmission with Artificial Noise over Fading Channels: Achievable Rate and Optimal Power Allocation

Abstract: We consider the problem of secure communication with multi-antenna transmission in fading channels. The transmitter simultaneously transmits an information bearing signal to the intended receiver and artificial noise to the eavesdroppers. We obtain an analytical closed-form expression of an achievable secrecy rate, and use it as the objective function to optimize the transmit power allocation between the information signal and the artificial noise. Our analytical and numerical results show that equal power allocation is a simple yet near optimal strategy for the case of non-colluding eavesdroppers. When the number of colluding eavesdroppers increases, more power should be used to generate the artificial noise. We also provide an upper bound on the signal-to-noise ratio (SNR) above which the achievable secrecy rate is positive and show that the bound is tight at low SNR. Furthermore, we consider the impact of imperfect channel state information (CSI) at both the transmitter and the receiver and find that it is wise to create more artificial noise to confuse the eavesdroppers than to increase the signal strength for the intended receiver if the CSI is not accurately obtained.

Information-Theoretically Secret Key Generation for Fading Wireless Channels

Abstract: The multipath-rich wireless environment associated with typical wireless usage scenarios is characterized by a fading channel response that is time-varying, location-sensitive, and uniquely shared by a given transmitter-receiver pair. The complexity associated with a richly scattering environment implies that the short-term fading process is inherently hard to predict and best modeled stochastically, with rapid decorrelation properties in space, time, and frequency. In this paper, we demonstrate how the channel state between a wireless transmitter and receiver can be used as the basis for building practical secret key generation protocols between two entities. We begin by presenting a scheme based on level crossings of the fading process, which is well-suited for the Rayleigh and Rician fading models associated with a richly scattering environment. Our level crossing algorithm is simple, and incorporates a self-authenticating mechanism to prevent adversarial manipulation of message exchanges during the protocol. Since the level crossing algorithm is best suited for fading processes that exhibit symmetry in their underlying distribution, we present a second and more powerful approach that is suited for more general channel state distributions. This second approach is motivated by observations from quantizing jointly Gaussian processes, but exploits empirical measurements to set quantization boundaries and a heuristic log likelihood ratio estimate to achieve an improved secret key generation rate. We validate both proposed protocols through experimentations using a customized 802.11a platform, and show for the typical WiFi channel that reliable secret key establishment can be accomplished at rates on the order of 10 b/s.

An Overview of the Transmission Capacity of Wireless Networks

Abstract: This paper surveys and unifies a number of recent contributions that have collectively developed a metric for decentralized wireless network analysis known as transmission capacity. Although it is notoriously difficult to derive general end-to-end capacity results for multi-terminal or adhoc networks, the transmission capacity (TC) framework allows for quantification of achievable single-hop rates by focusing on a simplified physical/MAC-layer model. By using stochastic geometry to quantify the multi-user interference in the network, the relationship between the optimal spatial density and success probability of transmissions in the network can be determined, and expressed-often fairly simply-in terms of the key network parameters. The basic model and analytical tools are first discussed and applied to a simple network with path loss only and we present tight upper and lower bounds on transmission capacity (via lower and upper bounds on outage probability). We then introduce random channels (fading/shadowing) and give TC and outage approximations for an arbitrary channel distribution, as well as exact results for the special cases of Rayleigh and Nakagami fading. We then apply these results to show how TC can be used to better understand scheduling, power control, and the deployment of multiple antennas in a decentralized network. The paper closes by discussing shortcomings in the model as well as future research directions.

An Adaptive Cooperation Diversity Scheme With Best-Relay Selection in Cognitive Radio Networks

Abstract: In this correspondence, an adaptive cooperation diversity scheme with best-relay selection is proposed for multiple-relay cognitive radio networks to improve the performance of secondary transmissions while ensuring the quality of service (QoS) of primary transmissions. Exact closed-form expressions of the outage probability of secondary transmissions, referred to as secondary outage probability, are derived under the constraint of satisfying a required outage probability of primary transmissions (primary outage probability) for both the traditional non-cooperation and the proposed adaptive cooperation schemes over Rayleigh fading channels. Numerical and simulation results show that, with a guaranteed primary outage probability, a floor of the secondary outage probability occurs in high signal-to-noise ratio (SNR) regions. Moreover, the outage probability floor of the adaptive cooperation scheme is lower than that of the non-cooperation scenario, which illustrates the advantage of the proposed scheme. In addition, we generalize the traditional definition of the diversity gain, which can not be applied directly in cognitive radio networks since mutual interference between the primary and secondary users should be considered. We derive the generalized diversity gain and show that, with a guaranteed primary outage probability, the full diversity order is achieved using the proposed adaptive cooperation scheme.

Performance analysis of adaptive decode-and-forward cooperative diversity networks with best-relay selection

Abstract: Cooperative diversity is a relatively new technique that can be used to improve the performance of the wireless networks. The main advantage of this technique is that the diversity gain can be achieved without the need to install multiple antennas at the transmitter or the receiver. In this paper, we investigate the performance of the best-relay selection scheme where the "best" relay only participates in the relaying. Therefore, two channels only are needed in this case (one for the direct link and the other one for the best indirect link) regardless of the number of relays (M). The best relay is selected as the relay node that can achieve the highest signal-to-noise ratio at the destination node. A general mathematical probability model is developed to study the outage performance of the best-relay selection adaptive decode-and-forward cooperative networks. In particular, closed-form expressions for the outage probability and average channel capacity are derived. Results show that the best-relay selection not only reduces the amount of required resources but also can maintain a full diversity order.

A useful lemma for capacity analysis of fading interference channels

Abstract: This paper presents a simple new expression for the exact evaluation of averages of the form E [ln (1+x1+...xN/y1+...+yM+1)], where x1,..., xN, y1..., yM are arbitrary non-negative random variables, in terms of the joint moment generating functions of these random variables. Application examples are given for the ergodic capacity evaluation of some multiuser wireless communication systems which are difficult to solve by the known classical methods.

A Framework for Training-Based Estimation in Arbitrarily Correlated Rician MIMO Channels With Rician Disturbance

Abstract: In this paper, we create a framework for training-based channel estimation under different channel and interference statistics. The minimum mean square error (MMSE) estimator for channel matrix estimation in Rician fading multi-antenna systems is analyzed, and especially the design of mean square error (MSE) minimizing training sequences. By considering Kronecker-structured systems with a combination of noise and interference and arbitrary training sequence length, we collect and generalize several previous results in the framework. We clarify the conditions for achieving the optimal training sequence structure and show when the spatial training power allocation can be solved explicitly. We also prove that spatial correlation improves the estimation performance and establish how it determines the optimal training sequence length. The analytic results for Kronecker-structured systems are used to derive a heuristic training sequence under general unstructured statistics. The MMSE estimator of the squared Frobenius norm of the channel matrix is also derived and shown to provide far better gain estimates than other approaches. It is shown under which conditions training sequences that minimize the non-convex MSE can be derived explicitly or with low complexity. Numerical examples are used to evaluate the performance of the two estimators for different training sequences and system statistics. We also illustrate how the optimal length of the training sequence often can be shorter than the number of transmit antennas.

Coherent and Differential Space-Time Shift Keying: A Dispersion Matrix Approach

Abstract: Motivated by the recent concept of Spatial Modulation (SM), we propose a novel Space-Time Shift Keying (STSK) modulation scheme for Multiple-Input Multiple-Output (MIMO) communication systems, where the concept of SM is extended to include both the space and time dimensions, in order to provide a general shift-keying framework. More specifically, in the proposed STSK scheme one out of Q dispersion matrices is activated during each transmitted block, which enables us to strike a flexible diversity and multiplexing tradeoff. This is achieved by optimizing both the space-time block duration as well as the number of the dispersion matrices in addition to the number of transmit and receive antennas. We will demonstrate that the resultant equivalent system model does not impose any Inter-Channel Interference (ICI), and hence the employment of single-stream Maximum Likelihood (ML) detection becomes realistic at a low-complexity. Furthermore, we propose a Differential STSK (DSTSK) scheme, assisted by the Cayley unitary transform, which does not require any Channel State Information (CSI) at the receiver. Here, the usual error-doubling, caused by the differential decoding, gives rise to 3-dB performance penalty in comparison to Coherent STSK (CSTSK). Additionally, we introduce an enhanced CSTSK scheme, which avoids the requirement of Inter-Antenna Synchronization (IAS) between the RF chains associated with the transmit Antenna Elements (AEs) by imposing a certain constraint on the dispersion matrix design, where each column of the dispersion matrices includes only a single non-zero component. Moreover, according to the turbo-coding principle, the proposed CSTSK and DSTSK schemes are combined with multiple serially concatenated codes and an iterative bit-to-symbol soft-demapper. More specifically, the associated STSK parameters are optimized with the aid of Extrinsic Information Transfer (EXIT) charts, for the sake of achieving a near-capacity performance.

Exploiting Multiple-Antenna Diversity for Shared Secret Key Generation in Wireless Networks

Abstract: Generating a secret key between two parties by extracting the shared randomness in the wireless fading channel is an emerging area of research. Previous works focus mainly on single-antenna systems. Multiple-antenna devices have the potential to provide more randomness for key generation than single-antenna ones. However, the performance of key generation using multiple-antenna devices in a real environment remains unknown. Different from the previous theoretical work on multiple-antenna key generation, we propose and implement a shared secret key generation protocol, Multiple-Antenna KEy generator (MAKE) using off-the-shelf 802.11n multiple-antenna devices. We also conduct extensive experiments and analysis in real indoor and outdoor mobile environments. Using the shared randomness extracted from measured Received Signal Strength Indicator (RSSI) to generate keys, our experimental results show that using laptops with three antennas, MAKE can increase the bit generation rate by more than four times over single-antenna systems. Our experiments validate the effectiveness of using multi-level quantization when there is enough mutual information in the channel. Our results also show the trade-off between bit generation rate and bit agreement ratio when using multi-level quantization. We further find that even if an eavesdropper has multiple antennas, she cannot gain much more information about the legitimate channel.

Dual-hop systems with noisy relay and interference-limited destination

Abstract: In this letter, we analyze the outage performance of a dual-hop relay fading channel in an interference-limited environment. We first derive closed-form expressions for the outage probability of both the amplify-and-forward (AF) and the decode-and-forward (DF) relay channels, based on which, the diversity analysis is conducted. In addition, we show that in terms of the outage probability performance, the worst scenario appears to be the case with equal received-power interferers, for a given total received interference power.

Channel modeling and analysis for wireless networks in underground mines and road tunnels

Abstract: Wireless networks can greatly facilitate the communication in underground mines and road/subway tunnels, where the propagation characteristics of electromagnetic (EM) waves are significantly different from those in terrestrial environments. According to the structure of underground mines and road tunnels, two types of channel models can be utilized, namely, tunnel and room/pillar channel models. However, there exists no theoretical model for room-and-pillar channel in underground mines to date, and current existing tunnel channel models do not provide an analytical solution for both near and far regions of the sources. In this paper, the multimode model is proposed, which provides an analytical expression for the received power and the power delay profile at any position in a tunnel.Moreover, the multimode model is extended to characterize the room-and-pillar channel in the underground mines after combining it with the shadow fading model. The theoretical models are validated by experimental measurements. Based on the proposed channel models, the effects of various factors on the signal propagation are analyzed. The factors include: the operating frequency, the size of the tunnel or underground mine room, the antenna position and polarization, and the electrical parameters.

Trellis Coded Spatial Modulation

Abstract: Trellis coded modulation (TCM) is a well known scheme that reduces power requirements without any bandwidth expansion. In TCM, only certain sequences of successive constellation points are allowed (mapping by set partitioning). The novel idea in this paper is to apply the TCM concept to the antenna constellation points of spatial modulation (SM). The aim is to enhance SM performance in correlated channel conditions. SM considers the multiple transmit antennas as additional constellation points and maps a first part of a block of information bits to the transmit antenna indices. Therefore, spatial multiplexing gains are retained and spectral efficiency is boosted. The second part of the block of information bits is mapped to a complex symbol using conventional digital modulation schemes. At any particular time instant, only one antenna is active. The receiver estimates the transmitted symbol and the active antenna index and uses the two estimates to retrieve the original block of data bits. In this paper, TCM partitions the entire set of transmit antennas into sub-sets such that the spacing between antennas within a particular sub-set is maximized. The scheme is called trellis coded spatial modulation (TCSM). Tight analytical performance bounds over correlated fading channels are proposed in this paper. In addition, the performance and complexity of TCSM is compared to the performance of SM, coded V-BLAST (vertical Bell Labs layered space-time) applying near optimum sphere decoder algorithm, and Alamouti scheme combined with TCM. Also, the performance of all schemes with turbo coded modulation is presented. It is shown that under the same spectral efficiency, TCSM exhibits significant performance enhancements in the presence of realistic channel conditions such as Rician fading and spatial correlation (SC). In addition, the complexity of the proposed scheme is shown to be 80% less than the V-BLAST complexity.

On the approximation of the generalized-Κ distribution by a gamma distribution for modeling composite fading channels

Abstract: In wireless channels, multipath fading and shadowing occur simultaneously leading to the phenomenon referred to as composite fading. The use of the Nakagami probability density function (PDF) to model multipath fading and the Gamma PDF to model shadowing has led to the generalized-K model for composite fading. However, further derivations using the generalized K PDF are quite involved due to the computational and analytical difficulties associated with the arising special functions. In this paper, the approximation of the generalized-K PDF by a Gamma PDF using the moment matching method is explored. Subsequently, an adjustable form of the expressions obtained by matching the first two positive moments, to overcome the arising numerical and/or analytical limitations of higher order moment matching, is proposed. The optimal values of the adjustment factor for different integer and non-integer values of the multipath fading and shadowing parameters are given. Moreover, the approach introduced in this paper can be used to well-approximate the distribution of the sum of independent generalized-K random variables by a gamma distribution; the need for such results arises in various emerging distributed communication technologies and systems such as coordinated multipoint transmission and reception schemes including distributed antenna systems and cooperative relay networks.

Performance of hybrid-ARQ in block-fading channels: A fixed outage probability analysis

Abstract: This paper studies the performance of hybrid-ARQ (automatic repeat request) in Rayleigh block-fading channels. The long-term average transmitted rate is analyzed in a fast-fading scenario where the transmitter only has knowledge of channel statistics, and, consistent with contemporary wireless systems, rate adaptation is performed such that a target outage probability (after a maximum number of H-ARQ rounds) is maintained. H-ARQ allows for early termination once decoding is possible, and thus is a coarse, and implicit, mechanism for rate adaptation to the instantaneous channel quality. Although the rate with H-ARQ is not as large as the ergodic capacity, which is achievable with rate adaptation to the instantaneous channel conditions, even a few rounds of H-ARQ make the gap to ergodic capacity reasonably small for operating points of interest. Furthermore, the rate with H-ARQ provides a significant advantage compared to systems that do not use H-ARQ and only adapt rate based on the channel statistics.

Performance Analysis of Two Hop Amplify-and-Forward Systems with Interference at the Relay

Abstract: We analyze the performance of a two hop channel state information (CSI)-assisted amplify-and-forward system, with co-channel interference at the relay. The system's outage probability and the average bit error rate (BER) in the presence of Rayleigh faded multiple interferers are investigated. We derive an exact expression for the outage probability and an accurate bound for the system's average BER. Simulation results show the validity of the analysis and point out the effect of interference.

Access Strategies for Spectrum Sharing in Fading Environment: Overlay, Underlay, and Mixed

Abstract: In this paper, we analyze the achievable capacity of the secondary service for overlay and underlay access strategies. We then propose a novel mixed access strategy in which in contrast to the underlay strategy, the secondary service transmits during the idle periods without considering the interference threshold constraint. In contrast to the overlay strategy, mixed strategy makes transmission during the busy periods with a probability p_a subject to satisfying the interference threshold constraint. Parameter p_a is a secondary service parameter, which can be adjusted based on the spectrum status. Moreover, we show that the secondary service can adjust p_a to select appropriate access strategy with the objective of maximizing the achieved capacity based on the interference at the secondary service receiver, I, imposed by the primary service transmitter. The proposed spectrum-sharing technique developed in this paper based on I significantly reduces the system complexity comparing to the system in which for spectrum sharing, the imposed interference at the primary receiver is required. We further suggest a simple power allocation scheme for the mixed strategy that its achieved capacity is very close to the maximum achievable capacity of the secondary service.

Multiple-User Cooperative Communications Based on Linear Network Coding

Abstract: We propose a new scheme for cooperative wireless networking based on linear network codes. The network consists of multiple (M ≥ 2) users having independent information to be transmitted to a common basestation (BS), assuming block-fading channels with independent fading for different codewords. The users collaborate in relaying messages. Because of potential transmission errors in links, resulting in erasures, the network topology is dynamic. To efficiently exploit the diversity available by cooperation and time-varying fading, we propose the use of diversity network codes (DNCs) over finite fields. These codes are designed such that the BS is able to rebuild the user information from a minimum possible set of coded blocks conveyed through the dynamic network. We show the existence of deterministic DNCs. We also show that the resulting diversity order using the proposed DNCs is 2 M - 1, which is higher than schemes without network coding or with binary network coding. Numerical results from simulations also show substantial improvement by the proposed DNCs over the benchmark schemes. We also propose simplified versions of the DNCs, which have much lower design complexity and still achieve the diversity order 2 M - 1.

Simulating the Multipath Channel With a Reverberation Chamber: Application to Bit Error Rate Measurements

Abstract: We illustrate the use of the reverberation chamber to simulate fixed wireless propagation environments including effects such as narrowband fading and Doppler spread. These effects have a strong impact on the quality of the wireless channel and the ability of a receiver to decode a digitally modulated signal. Different channel characteristics such as power delay profile and RMS delay spread are varied inside the chamber by incorporating various amounts of absorbing material. In order to illustrate the impact of the chamber configuration on the quality of a wireless communication channel, bit error rate measurements are performed inside the reverberation chamber for different loadings, symbol rates, and paddle speeds; the results are discussed. Measured results acquired inside a chamber are compared with those obtained both in an actual industrial environment and in an office.

Performance of an Energy Detector over Channels with Both Multipath Fading and Shadowing

Abstract: This paper analyzes the performance of an energy detector over wireless channels with composite multipath fading and shadowing effects. These effects are modeled by using the K and K_G channel models. Closed-form average detection probabilities are derived for both K and K_G channel models for the no-diversity reception case. A simple approximation is also derived for large values of energy threshold in the energy detector. The analysis is then extended to cases with diversity receptions including maximal ratio combining (MRC) and selection combining (SC). Analytical results are verified by Monte Carlo simulation and by numerical methods. Receiver operating characteristic (ROC) curves are presented for different degrees of multipath fading and shadowing. Finally, the Rayleigh-lognormal distribution and the K distribution are numerically compared, and the validity of the K channel model for representing the impact of shadowing on the performance of energy detection is affirmed.

A General Framework for Performance Analysis of Space Shift Keying (SSK) Modulation for MISO Correlated Nakagami-m Fading Channels

Abstract: In this paper, we offer an accurate framework for analyzing the performance of wireless communication systems adopting the recently proposed Space Shift Keying (SSK) modulation scheme. More specifically, we study the performance of a Nt x 1 MISO (Multiple-Input-Single-Output) system setup with Maximum-Likelihood (ML) detection and full Channel State Information (CSI) at the receiver. The exact Average Bit Error Probability (ABEP) over generically correlated and non-identically distributed Nakagami-m fading channels is computed in closed-form when Nt=2, while very accurate and asymptotically tight upper bounds are proposed to compute the ABEP when Nt > 2. With respect to current literature, our contribution is threefold: i) the ABEP is computed in closed-form without resorting to Monte Carlo numerical simulations, which, besides being computationally intensive, only yield limited insights about the system performance and cannot be exploited for a systematic optimization of it, ii) the framework accounts for arbitrary fading conditions and is not restricted to identically distributed fading channels, thus offering a comprehensive understanding of the performance of SSK modulation over generalized fading channels, and iii) the analytical framework could be readily adapted to study the performance over generalized fading channels with arbitrary fading distributions, since the Nakagami-m distribution is a very flexible fading model, which either includes or can closely approximate several other fading models. Numerical results show that the performance of SSK modulation is significantly affected by the characteristics of fading channels, {e.g.}, channel correlation, fading severity, and power imbalance among the Nt transmit-receive wireless links. Analytical frameworks and theoretical findings are also substantiated via Monte Carlo simulations.

Analysis of area under the ROC curve of energy detection

Abstract: A simple figure of merit to describe the performance of an energy detector is desirable. The area under the receiver operating characteristic (ROC) curve, denoted (AUC), is such a measure, which varies between 1/2 and 1. If the detector's performance is no better than flipping a coin, then the AUC is 1/2 , and it increases to one as the detector performance improves. However, in the wireless literature, the AUC measure has gone unnoticed. In this paper, to address this gap, we comprehensively analyze the AUC of an energy detector with no-diversity reception and with several popular diversity schemes. The channel model is assumed to be Nakagami-m fading. First, the average AUC is derived for the case of no-diversity reception. Second, the average AUC is derived for diversity reception cases including maximal ratio combining (MRC), square-law combining (SLC) and selection combining (SC). Further, for Rayleigh fading channels, the impacts of channel estimation errors and fading correlations are analyzed. High SNR (signal-to-noise ratio) approximations and the detection diversity gain are also derived. The analytical results are verified by numerical computations and by Monte-Carlo simulations.

Filter-and-Forward Distributed Beamforming in Relay Networks With Frequency Selective Fading

Abstract: A new approach to distributed cooperative beamforming in relay networks with frequency selective fading is proposed. It is assumed that all the relay nodes are equipped with finite impulse response (FIR) filters and use a filter-and-forward (FF) strategy to compensate for the transmitter-to-relay and relay-to-destination channels. Three relevant half-duplex distributed beamforming problems are considered. The first problem amounts to minimizing the total relay transmitted power subject to the destination quality-of-service (QoS) constraint. In the second and third problems, the destination QoS is maximized subject to the total and individual relay transmitted power constraints, respectively. For the first and second problems, closed-form solutions are obtained, whereas the third problem is solved using convex optimization. The latter convex optimization technique can be also directly extended to the case when the individual and total power constraints should be jointly taken into account. Simulation results demonstrate that in the frequency selective fading case, the proposed FF approach provides substantial performance improvements as compared to the commonly used amplify-and-forward (AF) relay beamforming strategy.

Outage performance of relay-assisted cognitive-radio system under spectrum-sharing constraints

Abstract: Investigated is the outage performance of cognitive wireless relay networks in a fading environment, where the secondary users including the source and relays may take advantage of a frequency band of a licensed (primary) user by opportunistically transmitting with high power as long as the interference it incurs is not deemed harmful by the licensee. The relation between the secondary channel performance and the interference inflicted on the primary user is quantified.