Topic

# Pairwise error probability

About: Pairwise error probability is a(n) research topic. Over the lifetime, 1150 publication(s) have been published within this topic receiving 30639 citation(s).

##### Papers

More filters

••

01 Nov 1999

Abstract: We investigate the use of multiple transmitting and/or receiving antennas for single user communications over the additive Gaussian channel with and without fading. We derive formulas for the capacities and error exponents of such channels, and describe computational procedures to evaluate such formulas. We show that the potential gains of such multi-antenna systems over single-antenna systems is rather large under independenceassumptions for the fades and noises at different receiving antennas.

12,396 citations

••

TL;DR: The idea of space-time coding devised for multiple-antenna systems to the problem of communications over a wireless relay network with Rayleigh fading channels is applied and it is shown that for high SNR, the pairwise error probability (PEP) behaves as (logP/P)min{TH}, with T the coherence interval.

Abstract: We apply the idea of space-time coding devised for multiple-antenna systems to the problem of communications over a wireless relay network with Rayleigh fading channels. We use a two-stage protocol, where in one stage the transmitter sends information and in the other, the relays encode their received signals into a "distributed" linear dispersion (LD) code, and then transmit the coded signals to the receive node. We show that for high SNR, the pairwise error probability (PEP) behaves as (logP/P)min{TH}, with T the coherence interval, that is, the number of symbol periods during which the channels keep constant, R the number of relay nodes, and P the total transmit power. Thus, apart from the log P factor, the system has the same diversity as a multiple-antenna system with R transmit antennas, which is the same as assuming that the R relays can fully cooperate and have full knowledge of the transmitted signal. We further show that for a network with a large number of relays and a fixed total transmit power across the entire network, the optimal power allocation is for the transmitter to expend half the power and for the relays to collectively expend the other half. We also show that at low and high SNR, the coding gain is the same as that of a multiple-antenna system with R antennas. However, at intermediate SNR, it can be quite different, which has implications for the design of distributed space-time codes

1,046 citations

••

TL;DR: New exponential bounds for the Gaussian Q function and its inverse are presented and a quite accurate and simple approximate expression given by the sum of two exponential functions is reported for the general problem of evaluating the average error probability in fading channels.

Abstract: We present new exponential bounds for the Gaussian Q function (one- and two-dimensional) and its inverse, and for M-ary phase-shift-keying (MPSK), M-ary differential phase-shift-keying (MDPSK) error probabilities over additive white Gaussian noise channels. More precisely, the new bounds are in the form of the sum of exponential functions that, in the limit, approach the exact value. Then, a quite accurate and simple approximate expression given by the sum of two exponential functions is reported. The results are applied to the general problem of evaluating the average error probability in fading channels. Some examples of applications are also presented for the computation of the pairwise error probability of space-time codes and the average error probability of MPSK and MDPSK in fading channels.

731 citations

••

27 Jan 2005

TL;DR: This chapter will focus on evaluating the pairwise error probability with and without CSI, and how the results of these evaluations can be used via the transfer bound approach to evaluate average BEP of coded modulation transmitted over the fading channel.

Abstract: In studying the performance of coded communications over memoryless channels (with or without fading), the results are given as upper bounds on the average bit error probability (BEP). In principle, there are three different approaches to arriving at these bounds, all of which employ obtaining the so-called pairwise error probability , or the probability of choosing one symbol sequence over another for a given pair of possible transmitted symbol sequences, followed by a weighted summation over all pairwise events. In this chapter, we will focus on the results obtained from the third approach since these provide the tightest upper bounds on the true performance. The first emphasis will be placed on evaluating the pairwise error probability with and without CSI, following which we shall discuss how the results of these evaluations can be used via the transfer bound approach to evaluate average BEP of coded modulation transmitted over the fading channel.

647 citations

••

TL;DR: It is shown via computer simulations that the proposed OFDM with index modulation scheme achieves significantly better error performance than classical OFDM due to the information bits carried in the spatial domain by the indices of OFDM subcarriers.

Abstract: In this paper, a novel orthogonal frequency division multiplexing (OFDM) scheme, called OFDM with index modulation (OFDM-IM), is proposed for operation over frequency-selective and rapidly time-varying fading channels In this scheme, the information is conveyed not only by M-ary signal constellations as in classical OFDM, but also by the indices of the subcarriers, which are activated according to the incoming bit stream Different low complexity transceiver structures based on maximum likelihood detection or log-likelihood ratio calculation are proposed and a theoretical error performance analysis is provided for the new scheme operating under ideal channel conditions Then, the proposed scheme is adapted to realistic channel conditions such as imperfect channel state information and very high mobility cases by modifying the receiver structure The approximate pairwise error probability of OFDM-IM is derived under channel estimation errors For the mobility case, several interference unaware/aware detection methods are proposed for the new scheme It is shown via computer simulations that the proposed scheme achieves significantly better error performance than classical OFDM due to the information bits carried by the indices of OFDM subcarriers under both ideal and realistic channel conditions

612 citations