On the Secrecy Capacity of Fading Channels

We consider the secure transmission of information over an ergodic fading channel in the presence of an eavesdropper. Our eavesdropper can be viewed as the wireless counterpart of Wyner's wiretapper. The secrecy capacity of such a system is characterized under the assumption of asymptotically long coherence intervals. We first consider the full channel state information (CSI) case, where the transmitter has access to the channel gains of the legitimate receiver and the eavesdropper. The secrecy capacity under this full CSI assumption serves as an upper bound for the secrecy capacity when only the CSI of the legitimate receiver is known at the transmitter, which is characterized next. In each scenario, the perfect secrecy capacity is obtained along with the optimal power and rate allocation strategies. We then propose a low-complexity on/off power allocation strategy that achieves near-optimal performance with only the main channel CSI. More specifically, this scheme is shown to be asymptotically optimal as the average signal-to-noise ratio (SNR) goes to infinity, and interestingly, is shown to attain the secrecy capacity under the full CSI assumption. Overall, channel fading has a positive impact on the secrecy capacity and rate adaptation, based on the main channel CSI, is critical in facilitating secure communications over slow fading channels.      

Feedback gain in multiple antenna systems

Multiple antenna transmission and reception have been shown to significantly increase the achievable data rates of wireless systems. However, most of the existing analysis assumes perfect or no channel information at the receiver and transmitter. The performance gap between these extreme channel assumptions is large and most practical systems lie in between. Therefore, it is important to analyze multiple antenna systems in the presence of partial channel information. We upper bound the outage probability performance of multiple antenna systems with preamble-based channel estimation and quantized feedback. We design causal feedback and power control schemes to minimize this upper bound on outage probability. We consider the following practical issues in our analysis and design: (1) the channel information is imperfect both at the receiver and at the transmitter and (2) part of the total available resources for the system need to be used for estimation and feedback. Our results demonstrate that for block fading channels, sending a periodic preamble and causally receiving channel state information via a feedback channel can lead to substantial gains in the outage performance over any nonfeedback scheme. Most of the gains achieved by perfect feedback can be achieved by very few bits of feedback. Furthermore, it is demonstrated that these outage probability gains can be translated into improvements in frame error rate performance of systems using space-time codes. Thus, implementing a power control, even at the cost of reduced spectral resources for the forward channel is beneficial for block fading channels     

Isotropic fading vector broadcast Channels:The scalar upper bound and loss in degrees of freedom

We propose a scalar upper bound on the capacity region of the isotropic fading vector broadcast channel in terms of the capacity region of a scalar fading broadcast channel. The scalar upper bound is applicable to the broad class of isotropic fading broadcast channels regardless of the distribution of the users' channel magnitudes, the distribution of the additive noise experienced by each user, or the amount of channel knowledge available at the receiver. Using this upper bound, we prove the optimality of the Alamouti scheme in a broadcast setting, extend the recent results on the capacity of nondegraded, fading scalar broadcast channels to nondegraded fading vector broadcast channels, and determine the capacity region of a fading vector Gaussian broadcast channel with channel magnitude feedback. We also provide an example of a Rayleigh-fading broadcast channel with no channel state information available to the receiver (CSIR), where the bound on the capacity region obtained by a naive application of the scalar upper bound is provably loose, because it fails to account for the additional loss in degrees of freedom due to lack of channel knowledge at the receiver. A tighter upper bound is obtained by separately accounting for the loss in degrees of freedom due to lack of CSIR before applying the scalar upper bound.     

Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels

We consider a multiuser multiple-input multiple- output (MIMO) Gaussian broadcast channel (BC), where the transmitter and receivers have multiple antennas. Since the MIMO BC is in general a nondegraded BC, its capacity region remains an unsolved problem. We establish a duality between what is termed the "dirty paper" achievable region (the Caire-Shamai (see Proc. IEEE Int. Symp. Information Theory, Washington, DC, June 2001, p.322) achievable region) for the MIMO BC and the capacity region of the MIMO multiple-access channel (MAC), which is easy to compute. Using this duality, we greatly reduce the computational complexity required for obtaining the dirty paper achievable region for the MIMO BC. We also show that the dirty paper achievable region achieves the sum-rate capacity of the MIMO BC by establishing that the maximum sum rate of this region equals an upper bound on the sum rate of the MIMO BC.     

Adaptive transmit antenna selection with pragmatic space-time trellis codes

We consider the problem of selecting a subset of transmit antennas in MIMO systems to minimize error probability when only partial channel information is available at the transmitter. An upper bound for error probability of space-time coded transmit antenna selection scheme conditioned on the channel state information is presented. Based on the performance analysis, a criterion of selecting a subset of available transmit antennas to minimize the upper bound on the PEP is proposed. In contrast to other transmit antenna selection schemes for uncoded transmission or with a fixed number of antennas within the selection subset in the literature, the proposed scheme can adaptively select both a variable number of transmit antennas and their corresponding space-time codes for transmission. Furthermore, we present pragmatic space-time trellis coding schemes for slow Rayleigh fading channels. The principal advantage of the schemes is that a single encoder and decoder can be used for systems with a variable number of transmit antennas. The performance of the pragmatic space-time codes with adaptive antenna selection and the effect of the imperfect channel estimation on performance are evaluated by simulations. It is shown that the adaptive selection offers considerable antenna selection gain relative to the antenna selection system with a fixed number of antennas within the selection subset     

How Good Is PSK for Peak-Limited Fading Channels in the Low-SNR Regime?

This paper investigates the achievable information rate of phase-shift keying (PSK) over frequency nonselective Rayleigh and Rician fading channels without channel state information (CSI). The fading process exhibits general temporal correlation characterized by its spectral density function. We consider both discrete-time and continuous-time channels, and find their asymptotics at low signal-to-noise ratio (SNR). Compared to known capacity upper bounds under peak constraints, these asymptotics lead to negligible rate loss in the low-SNR regime for slowly time-varying fading channels. We further specialize to case studies of Gauss-Markov and Clarke's fading models     

Nakagami信道的中断容量分析

本文讨论了Nakagami-m衰落信道系统的中断容量性能,在发射端未知信道信息,接收端的信道估计存在误差时,给出了计算中断容量上界和下界的表达式,它们是接收端的估计误差和信道参数的函数,仿真结果表明随着估计误差的增大中断容量的上界和下界同时降低,但是中断容量的下界随着信道参数的增大而增大,上界随着信道参数的增大而减小。     

On the Achievable Rate for Wideband Channels with Estimated CSI

We consider the achievable rate for frequency-selective fading channels when the channel state information (CSI) is to be estimated at the receiver. Since the estimated CSI is not perfect, the achievable rate must be degraded from that with perfect CSI. Using the rate-distortion theory, we study an upper bound on the achievable rate and investigate how the achievable rate can be maximized through an optimization problem by allocating the resources such as degrees of freedom (the transmission time in our work or transmission power) for the exploration of CSI (i.e., the channel estimation) using pilot symbols, and the exploitation of channels to transmit data symbols. Although our study is based on some ideal assumptions, the results could help develop flexible communication systems such as software defined radio (SDR) to achieve a best performance by optimizing radio resources for unknown channels.     

State-dependent degraded broadcast channels with non-causal encoder side information

State dependent channels are used to model communication scenarios where the channel law is controlled by an external state process, for instance, wireless fading channels. Multi-user extensions of state dependent models have received considerable attention in the information theory literature. However, a complete characterization of the capacity region is unknown in most scenarios. In this paper, we consider a discrete memoryless state dependent broadcast channel, where the state process is non-causally known at the encoder. We present inner and outer bounds on the capacity region of this setup. We also give a partial characterization of the boundary of the capacity region that is tight in certain cases.     

On the capacity of MIMO relay channels

We study the capacity of multiple-input multiple- output (MIMO) relay channels. We first consider the Gaussian MIMO relay channel with fixed channel conditions, and derive upper bounds and lower bounds that can be obtained numerically by convex programming. We present algorithms to compute the bounds. Next, we generalize the study to the Rayleigh fading case. We find an upper bound and a lower bound on the ergodic capacity. It is somewhat surprising that the upper bound can meet the lower bound under certain regularity conditions (not necessarily degradedness), and therefore the capacity can be characterized exactly; previously this has been proven only for the degraded Gaussian relay channel. We investigate sufficient conditions for achieving the ergodic capacity; and in particular, for the case where all nodes have the same number of antennas, the capacity can be achieved under certain signal-to-noise ratio (SNR) conditions. Numerical results are also provided to illustrate the bounds on the ergodic capacity of the MIMO relay channel over Rayleigh fading. Finally, we present a potential application of the MIMO relay channel for cooperative communications in ad hoc networks.     

Characterizing the statistical properties of mutual information in MIMO channels

We consider Gaussian multiple-input multiple-output (MIMO) frequency-selective spatially correlated fading channels, assuming that the channel is unknown at the transmitter and perfectly known at the receiver. For Gaussian codebooks, using results from multivariate statistics, we derive an analytical expression for a tight lower bound on the ergodic capacity of such channels at any signal-to-noise ratio (SNR). We show that our bound is tighter than previously reported analytical lower bounds, and we proceed to analytically quantify the impact of spatial fading correlation on ergodic capacity. Based on a closed-form approximation of the variance of mutual information in correlated flat-fading MIMO channels, we provide insights into the multiplexing-diversity tradeoff for Gaussian code books. Furthermore, for a given total number of antennas, we consider the problem of finding the optimal (ergodic capacity maximizing) number of transmit and receive antennas, and we reveal the SNR-dependent nature of the maximization strategy. Finally, we present numerical results and comparisons between our capacity bounds and previously reported bounds.     

Capacity Analysis for Continuous Alphabet Channels With Side Information, Part II: MIMO Channels

In this second part of our two-part paper, we consider the capacity analysis for wireless mobile systems with multiple-antenna architectures. We apply the results of the first part to a commonly known baseband, discrete-time multiple-antenna system where both the transmitter and receiver know the channel's statistical law. We analyze the capacity for additive white Gaussian noise (AWGN) channels, fading channels with full channel state information (CSI) at the receiver, fading channels with no CSI, and fading channels with partial CSI at the receiver. For each type of channels, we study the capacity value as well as issues such as the existence, uniqueness, and characterization of the capacity-achieving measures for different types of moment constraints. The results are applicable to both Rayleigh and Rician fading channels in the presence of arbitrary line-of-sight and correlation profiles.     

Statistical Eigenmode Transmission Over Jointly Correlated MIMO Channels

We investigate multiple-input multiple-output (MIMO) eigenmode transmission using statistical channel state information at the transmitter. We consider a general jointly correlated MIMO channel model, which does not require separable spatial correlations at the transmitter and receiver. For this model, we first derive a closed-form tight upper bound for the ergodic capacity, which reveals a simple and interesting relationship in terms of the matrix permanent of the eigenmode channel coupling matrix and embraces many existing results in the literature as special cases. Based on this closed-form and tractable upper bound expression, we then employ convex optimization techniques to develop low-complexity power allocation solutions involving only the channel statistics. Necessary and sufficient optimality conditions are derived, from which we develop an iterative water-filling algorithm with guaranteed convergence. Simulations demonstrate the tightness of the capacity upper bound and the near-optimal performance of the proposed low-complexity transmitter optimization approach.     

Design of a Symmetric CPW-Fed Patch Antenna for WLAN/WIMAX Applications Using ANN

The upper bound capacity based on the SINR model is a very important parameter when evaluating the performance of the multi-hop wireless ad hoc networks. In this paper, a new upper bound capacity algorithm is proposed. Firstly, we analyzed the classical physics SINR model over the Rayleigh fading channels to establish the relationship between density of nodes and path outage probability. Then, we developed the closed-form expression of the upper bound transmission capacity based on the Weber model for the random networks. Finally, we evaluated effects of parameters in the communication range, density, SINR threshold and fading factors, and consequently transmission capacity of the network by sensitivity analysis. The numerical simulation showed that the optimum density of nodes was existed to obtain the upper bound transmission capacity. The capacity increased firstly and then decreased over the density of nodes increasing. It affected by channel fading factor and communication range sensitively.

     

Progressive transmission of images over fading channels using rate-compatible LDPC codes.

In this paper, we propose a combined source/channel coding scheme for transmission of images over fading channels. The proposed scheme employs rate-compatible low-density parity-check codes along with embedded image coders such as JPEG2000 and set partitioning in hierarchical trees (SPIHT). The assignment of channel coding rates to source packets is performed by a fast trellis-based algorithm. We examine the performance of the proposed scheme over correlated and uncorrelated Rayleigh flat-fading channels with and without side information. Simulation results for the expected peak signal-to-noise ratio of reconstructed images, which are within 1 dB of the capacity upper bound over a wide range of channel signal-to-noise ratios, show considerable improvement compared to existing results under similar conditions. We also study the sensitivity of the proposed scheme in the presence of channel estimation error at the transmitter and demonstrate that under most conditions our scheme is more robust compared to existing schemes.     

The capacity of discrete-time memoryless Rayleigh-fading channels

We consider transmission over a discrete-time Rayleigh fading channel, in which successive symbols face independent fading, and where neither the transmitter nor the receiver has channel state information. Subject to an average power constraint, we study the capacity-achieving distribution of this channel and prove it to be discrete with a finite number of mass points, one of them located at the origin. We numerically compute the capacity and the corresponding optimal distribution as a function of the signal-to-noise ratio (SNR). The behavior of the channel at low SNR is studied and finally a comparison is drawn with the ideal additive white Gaussian noise channel     

On multilevel coded MPSK for the Rayleigh fading channel

This paper presents a new upper bound on the pair-wise error probability of MPSK sequences for the Rayleigh fading channel when channel state information (CSI) is unavailable. This bound is derived by adding weight factors in computing symbol metrics. Simulation results show that the weight factors which optimize the upper bound likely optimize the error rate as well. Multilevel coded MPSK schemes for the Rayleigh fading channel are also devised. Results show that the added weight factors improve the error performance of these schemes in the case that CSI is unavailable     

Performance analysis of adaptive loading OFDM under Rayleigh fading

In this paper, we investigate the performance of adaptive loading orthogonal frequency-division multiplexing (OFDM) under Rayleigh fading with maximal ratio-combining (MRC) diversity at the receiver. We assume that channel-state information is available at both the transmitter and the receiver. Closed-form expressions for the lower bound on the average capacity of OFDM transmission under Rayleigh fading are provided for ideal MRC diversity. Simple approximate expressions for the average capacity of the Rayleigh-fading channel are also provided for the high signal-to-noise ratio (SNR) case. In the second part of this paper, a maximum-rate adaptive-loading strategy is derived for uncoded quadrature-amplitude-modulation modulated OFDM. Simple lower bound expressions and high-SNR approximations are provided for the average spectral efficiency of the maximum-rate adaptive-loaded uncoded OFDM under Rayleigh-fading channel conditions. According to the results, the performance of the uncoded adaptive-loading OFDM is about 8.5 dB inferior to the capacity bound at 10/sup -5/ symbol error probability under frequency-selective Rayleigh fading.     

Communication over fading channels with delay constraints

We consider a user communicating over a fading channel with perfect channel state information. Data are assumed to arrive from some higher layer application and are stored in a buffer until transmitted. We study adapting the user's transmission rate and power based on the channel state information as well as the buffer occupancy; the objectives are to regulate both the long-term average transmission power and the average buffer delay incurred by the traffic. Two models for this situation are discussed; one corresponding to fixed-length/variable-rate codewords and one corresponding to variable-length codewords. The tradeoff between the average delay and the average transmission power required for reliable communication is analyzed. A dynamic programming formulation is given to find all Pareto optimal power/delay operating points. We then quantify the behavior of this tradeoff in the regime of asymptotically large delay. In this regime, we characterize simple buffer control policies which exhibit optimal characteristics. Connections to the delay-limited capacity and the expected capacity of fading channels are also discussed     

Error probability of coded STBC systems in block fading environments

In this letter, a union bound on the error probability of coded multi-antenna systems over block fading channels is derived. The bound is based on uniform interleaving of the coded sequence prior to transmission over the channel. Using this argument the distribution of error bits over the fading blocks is computed and the corresponding pair wise error probability (PEP) is derived. We consider coded systems that concatenate a binary code with a space-time block code (STBC). Coherent detection is assumed with perfect and imperfect channel state information (CSI) at the receiver, where imperfect CSI is obtained using pilot-aided estimation. Under channel estimation environments, the tradeoff between channel diversity and channel estimation is investigated and the optimal channel memory is approximated analytically. Results show that the performance degradation due to channel memory decreases as the number of transmit antennas is increased. Moreover, the optimal channel memory increases with increasing the number of transmit antennas.