Outage error probability for space-time codes over Rayleigh fading

This paper analyzes the performance of multicarrier index modulation (MCIM) with greedy detection (GD) in a dual hop, multiple decode and forward (DF) relay network. We propose a novel partial relay selection (PRS) technique combined with index modulation and its energy detection. For performance analysis, we derive novel closed form solutions for both the average pairwise error probability (PEP) and the average symbol error probability (SEP) at the relays and destination over Nakagami-m fading channels. Unlike the information theoretical works, with presence of positive detection error in the relays, the derived expressions provide a useful insight into the error performance of PRS based MCIM in a multiple DF relay network under various fading conditions. Also, we address the impacts of both relays and different rates of sub-carrier index activation.

A closed-form upper bound is presented for the average pairwise error probabilities (PEP) of space–time codes for a keyhole channel. It is derived from the exact conditional PEP for given fading channel coefficients using a moment generating function-based approach. Simulation results are included for varying numbers of antennas that affirm that the proposed PEP serves as a tight bound for codes in a keyhole channel.

In this paper, spatial modulation (SM) is used in a cooperative decode-and-forward (DF) cognitive radio system in order to enhance the overall spectral efficiency. In particular, a multi- antenna secondary transmitter communicates with a single antenna secondary receiver with the help of DF secondary relays in the presence of multiple primary users (PUs). To study the secondary system performance, we derive a closed-form expression for the average pairwise error probability (PEP) over Rayleigh fading channels assuming limited feedback from the PUs. A tight upper bounded average bit error rate is obtained using the PEP expression. Moreover, simple approximate expressions are obtained to get insights on the system diversity and estimation errors effects. Numerical results, which match simulations, show the effectiveness of SM in improving the overall secondary performance in the presence of channel estimation errors.

Abstract-In this paper, we suggest novel criteria for pilot designs which minimize outliers for consistent carrier frequency offset (CFO) estimation in the orthogonal frequency division multiplexing (OFDM) systems. In order to derive the criteria, we first analyze the average pairwise error probability (PEP) of integer CFO (iCFO) estimation with consistent pilots in the OFDM systems where fadings among subcarriers are correlated, and address several issues based on the PEP analysis. Especially, the PEP reveals the relation between the channel and the minimum Hamming distance of the training sequence which is composed of consistent pilots. Based on the observations made from the PEP, we revise the conventional criteria to make them suitable for systems for correlated fading channels. Simulation results show that the sequence developed from the proposed criteria yields much reduced outliers compared to the conventional sequences for consistent CFO estimation.

The keyhole phenomenon, i.e., uncorrelated but rank-deficient fading, can lead to significant performance degradations in multiple-input multiple-output (MIMO) systems and has to be carefully taken into account for system design. In this paper, considering the practically important case of two transmit and an arbitrary number of receive antennas, we provide a simple closed-form expression for the asymptotic pairwise error probability (PEP) of space-time codes (STCs) in generalized keyhole fading channels including Rayleigh, Ricean, Nakagami-q, Nakagami-m, and Weibull fading. We show how the number of transmit and receive antennas as well as the fading parameters affect the diversity gain. The presented analysis provides new insights into STC design and can be used to obtain tight asymptotic upper bounds for the bit, symbol, and frame error probabilities of arbitrary STCs in keyhole fading.

In this paper, we consider a binary decision fusion problem for a wireless sensor network, with flat Rayleigh fading, where the sensors make local binary decisions on the status of a common binary phenomenon. A training-based channel estimator is used at the fusion center (FC) to estimate the complex Gausssian fading coefficients characterizing the (direct) links between sensors and FC. This (estimated) channel state information is used, by proper thresholding, to censor the sensors. On the other hand, a locally optimal decision threshold is considered for binary quantization at the sensors. The average detection error probability at the FC, under the use of a majority logic fusion rule, is selected as a qualitative measure of system performance and is evaluated by simulation. The impact of the choice of the censoring threshold on the average detection error probability, under several values of channel estimation error, channel SNR, and sensor SNR, is studied.

This paper analyzes the performance of a low complexity detector for orthogonal frequency multiplexing (OFDM) with index modulation (IM) over generalized fading channels. Novel closed-form expressions for the exact and approximate average pairwise error probability (PEP) and symbol error rate (SER) for OFDM-IM with greedy detector (GD) over κ−μ fading are derived. The moment generating function (MGF) approach is used to develop an accurate framework for a unified error performance analysis of OFDM-IM over a wide range of fading channels that describe fading conditions within classical and non-conventional propagation environments. The presented results provide a useful insight into the performance of OFDM-IM for a variety of emerging wireless machine type communication (MTC) systems including device-to-device (D2D), vehicle-to-vehicle (V2V), and body centric communication systems.

In the conventional Vertical Bell Laboratory Layered Space-Time (V-BLAST) receiver with successive interference cancellation (SIC) decoding, the diversity order for the first detected symbol is the lowest, hence its error probability dominates the overall average error probability. In this thesis, a new SIC scheme was presented, called iterative post SIC (IP-SIC) that can increase the diversity order to a fixed desired value for all symbols, thereby significantly reduce the overall average error probability. The key to the technique is that after the interference from all substreams is subtracted from the received vector (the resulting vector will be referred to as the modified received vector), the detected symbol times its channel vector is added to the modified received vector one at a time and the symbol is detected again. Important features of the proposed approach are the increase in diversity order for those symbols detected earlier and the flexibility of balancing the increase in diversity order and the suppression of remaining interference. The latter feature can be used to further reduce the average error probability. The proposed technique is applied to the V-BLAST and space-time block coded V-BLAST system and its performance and computational complexity are analyzed.

In this paper we present a local channel correlation based zero-forcing (ZF) beamforming framework for the cell edge users. Without the instantaneous CSI (ICSI) assisting, we derive the exact expression of the averaged pairwise error probability (PEP) upper bounds at both of the receivers. According to the derived PEP bounds, an multi-objective optimization problem is formulated to get the elaborate power allocation and ZF beamforming design with the knowledge of local statistical channel state information (SCSI) at the transmitter side. By factorizing each beamforming matrix as the multiplication of two matrices, we can avoid inter-user interference through column orthogonal matrix design. Moreover, the original complicated optimization problem can be further decoupled into four simple sub-optimization problems. Then utilizing the Lagrange multiplying method, we finally achieve the feasible distributed statistical ZF beamforming design, which only involves the distributed computations based on the local channel correlations. Both theoretical analysis and simulation results confirm that the multi-cell spatial diversity gain can be fully exploited with only local SCSI. For comparison, the traditional perfect ICSI based ZF beamforming is analyzed and discussed. It is shown that in the high regime of signal-to-noise ratio (SNR), the diversity gain of the proposed statistical ZF beamforming is even better than that achieved by the conventional ICSI-aided ZF beamforming.

In this paper, we study the decoding error probability of linear codes over the erasure channel under the list decoding. The notion of the $q^\ell $ -incorrigible sets of linear codes is introduced to characterize its decoding error probability under the list decoding or the maximum likelihood decoding. By calculating the $q^\ell $ -incorrigible set distributions, the decoding error probability of a linear code over the erasure channel under the list decoding or the maximum likelihood decoding is expressed by its support weight distributions. For the ensemble of all $[n,k]$ linear codes, the average decoding error probability under the maximum likelihood decoding and the average unsuccessful decoding probability under unambiguous decoding are determined. Furthermore, the error exponent of the average unsuccessful decoding probability under the unambiguous decoding is determined for the ensemble of all $[n,nR]$ linear codes.

Average error probability and outage probability for an asynchronous direct sequence spread spectrum multiple access communications through slow nonselective Nakagami fading channels are evaluated for nondiversity and diversity receptions. Using the Gauss quadrature rule, the moments of the self-interference and the multiple access interferences are used to evaluate average error probability and outage probability. Combining the diversity technique and error correcting codes, comparisons between the uncoded nondiversity DS-SSMA system and that of the coded diversity system are shown for the Gold Code of codelength 127. Using fourth-order diversity and the Reed-Solomon code, the maximum achievable number of users is 12 percent of the codelength for Rayleigh fading, when the average probability is 10?3. The corresponding outage probability is less than 5 percent. Performance comparisons between Rician and Nakagami fading channels are made. Since the system is interference limited, the performance seems to show no significant difference for the two fading channel models when the number of users is large.

In this paper, we analyze the performance of single relay selection cooperative wireless networks using decode-and-forward relaying. Under optimum relay selection, the expressions for asymptotic outage probability, average symbol error probability are derived over Nakagami-m fading channels. Then we improve the performance of the system through optimum power allocation based on asymptotic outage probability and asymptotic average symbol error probability. Our results are verified through comparison with Monte Carlo simulations.

In this paper, we consider a cooperative cognitive radio relay network (CCRRN), in which there is a pair of primary transmitter (PT) and primary receiver (PR) with each having a single antenna, a secondary transmitter (ST) equipped with two antennas and a secondary receiver (SR) having a single antenna. We assume that ST operates in a half-duplex mode with an amplify-and-forward (AF) cooperative transmission scheme adopted. For such a system, a novel transmission scheme for CCRRN based on uniquely-factorable constellation pair (UFCP) is proposed, which enables ST to transmit its own information to SR without knowing its channel links to PR and SR while assisting PT transmission. It is shown that one of significant advantages of our proposed new scheme is that in a noise-free case, PR and SR are able to decode their own signals uniquely and that in a Gaussian noise case, they are still able to reliably decode their own signals with full diversity. In addition, a tight upper bound of average pairwise error probability (PEP) for the maximum likelihood (ML) detector is derived, showing that full diversity is achieved. With this, an optimal power allocation strategy is proposed that minimizes the worst-case upper bound.

The impact of spatial temporal correlated and symbol-to-symbol variant (STCSSV) fading channel on performance of multiple-input single-output (MISO) system is studied. We assume that the receiver has perfect knowledge of the channel, and the maximum likelihood (ML) receiver is applied. Using a channel model incorporating both spatial and temporal correlation, we derive the precise close-form solution of the upper bound of the average pairwise error probability (PEP) under such condition, and point out the relation between the performance degradation and the STCSSV fading. In particular, we prove that the fading correlation has nothing to do with the diversity advantage and quantify the loss in coding advantage as a function of the correlation matrix. Finally, we provide simulation results.

We consider compound as well as arbitrarily varying classical-quantum channel models. For classical-quantum compound channels, we give an elementary proof of the direct part of the coding theorem. A weak converse under average error criterion to this statement is also established. We use this result together with the robustification and elimination technique developed by Ahlswede in order to give an alternative proof of the direct part of the coding theorem for a finite classical-quantum arbitrarily varying channels with the criterion of success being average error probability. Moreover we provide a proof of the strong converse to the random coding capacity in this setting.The notion of symmetrizability for the maximal error probability is defined and it is shown to be both necessary and sufficient for the capacity for message transmission with maximal error probability criterion to equal zero.Finally, it is shown that the connection between zero-error capacity and certain arbitrarily varying channels is, just like in the case of quantum channels, only partially valid for classical-quantum channels.Keywordsarbitrarily varying classical-quantum channelscompound classical-quantum channelszero error capacityAhlswedes dichotomyweak conversestrong converse