Importance Sampling for Coded-Modulation Error Probability Estimation

This paper proposes an efficient simulation method based on importance sampling to estimate the random-coding error probability of coded modulation. The technique is valid for complex-valued modulations over Gaussian channels, channels with memory, and naturally extends to fading channels. The simulation method is built on two nested importance samplers to respectively estimate the pairwise error probability and generate the channel input and output. The effect of the respective number of samples on the overall bias and variance of the estimate of the error probability is characterized. For a memoryless channel, the estimator is shown to be consistent and with a small variance, growing with the square root of the code length, rather than the exponential growth of a standard Monte Carlo estimator.This work has been funded in part by the European Research Council under ERC grant agreement 725411, and by the Spanish Ministry of Economy and Competitiveness under grant TEC2016-78434-C3-1-R

Concentration of Random-Coding Error Exponents

This paper studies the error exponent of i.i.d. randomly generated codes used for transmission over discrete memoryless channels with maximum likelihood decoding. Specifically, this paper shows that the error exponent of a code, defined as the negative normalized logarithm of the probability of error, converges in probability to the typical error exponent. For high rates, the result is a consequence of the fact that the random-coding error exponent and the sphere-packing error exponent coincide. For low rates, instead, the proof of convergence is based on the fact that the union bound accurately characterizes the probability of error

Second-order rate region of constant-composition codes for the multiple-access channel

This paper studies the second-order asymptotics of coding rates for the discrete memoryless multiple-access channel with a fixed target error probability. Using constant-composition random coding, coded time-sharing, and a variant of Hoeffding's combinatorial central limit theorem, an inner bound on the set of locally achievable second-order coding rates is given for each point on the boundary of the capacity region. It is shown that the inner bound for constant-composition random coding includes that recovered by i.i.d. random coding, and that the inclusion may be strict. The inner bound is extended to the Gaussian multiple-access channel via an increasingly fine quantization of the inputs.Comment: (v2) Results/proofs given in matrix notation, det(V)=0 handled more rigorously, Berry-Esseen derivation given. (v3) Gaussian case added (v4) Significant change of presentation; added local dispersion results; added new method to obtain non-standard tangent vector terms using coded time-sharing; (v5) Final version (IEEE Transactions on Information Theory

Codes for channels with segmented edits

We consider insertion and deletion channels with the additional assumption that the channel input sequence is implicitly divided into segments such that at most one edit can occur within a segment. We further assume that there are no segment markers in the received sequence. We propose code constructions for the segmented deletion, segmented insertion, and segmented insertion-deletion channels based on subsets of VT codes chosen with pre-determined prefixes and/or suffixes. The proposed codes are zero-error, can be decoded segment-by-segment, and their rate scaling as the segment length increases is the same as that of the maximal code.This work has been funded in part by the European Research Council under ERC grant agreement 259663 and by the Spanish Ministry of Economy and Competitiveness under grant TEC2016-78434-C3-1-R

GMI and mismatched-CSI outage exponents in MIMO block-fading channels

We study transmission over multiple-antenna blockfading channels with imperfect channel state information at both the transmitter and receiver. Specifically, we investigate achievable rates based on the generalized mutual information. We then analyze the corresponding outage probability in the high signal-to-noise ratio regime. © 2013 IEEE

Outage probability of the free space optical channel with doubly stochastic scintillation

We study the asymptotic outage probability of multiple-input multiple-output free-space optical communication with pulse-position modulation. In particular, we consider doubly stochastic scintillation models, lognormal-Rice and I-K distributions. First we consider the case when channel state information is available at the receiver only. Then we consider the case when it is also available at the transmitter

New space-time trellis codes for two-antenna quasi-static channels

New space-time trellis codes with four- and eight-level phase-shift keying (PSK) and 16-phase quadrature amplitude modulation (QAM) for two transmit antennas in slow-fading channels are presented in this paper. Unlike most of the codes that are reported in the literature, the proposed codes are specifically designed to minimize the frame error probability from a union-bound perspective. The performance of the proposed codes with various memory orders and receive antennas is evaluated by simulation. It is shown that the proposed codes outperform previously known codes in all studied cases