The mismatch capacity of a channel is the highest rate at which reliable communication is possible over the channel with a given (possibly suboptimal) decoding rule. This quantity has been studied extensively for single-letter decoding rules over discrete memoryless channels (DMCs). Here we extend the study to memoryless channels with general alphabets and to channels with memory with possibly ...

We present a new and simple method which consists to apply constellation shaping to bit-interleaved turbo-coded modulation (BICTM) over additive white Gaussian noise channels. By assuming the example of a 3-bit/dim 16-PAM BITCM, it is shown that this technique can provide shaping gain of 0.79dB.

Abstract: In this paper we consider a random variable Y contamined by an independent additive noise Z. We assume that Z has known distribution. Our purpose is to test the distribution of the unobserved random variable Y . We propose a data driven statistic based on a development of the density of Y + Z, which is valid in the discrete case and in the continuous case. The test is illustrated in b...

The construction of optimal non-uniform mappings for discrete input memoryless channels (DIMCs) is investigated. An efficient algorithm to find optimal mappings is proposed and the rate by which a target distribution is approached is investigated. The results are applied to non-uniform mappings for additive white Gaussian noise (AWGN) channels with finite signal constellations. The mappings fou...

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 for mulas We show that the potential gains of such multi antenna systems over single antenna systems is...

In this work, we take an information theoretic approach to analyze the watermark communication problem in the presence of perceptual coding. Our effective watermark channel is modeled as a set of parallel independent zero-mean uniformly distributed additive noise channels. Energy allocation principles are identified to maximize the capacity results. Our findings are compared to the traditional ...

We study the asymptotic behavior of solutions to the stochastic strongly damped wave equation with additive noise defined on unbounded domains. We first prove the uniform estimates of solutions, and then establish the existence of a random attractor.

Over the past several years, the primary focus of investigation for speech recognition has been over the telephone or IP network. Recently more and more IP telephony has been extensively used. This paper describes the performance of a speech recognizer on noisy speech transmitted over an H.323 IP telephony network, where the minimum mean-square error log spectra amplitude (MMSE-LSA) method [1,2...

Vector Taylor Series (VTS) is a powerful technique for robust ASR but, in its standard form, it can only be applied to log-filter bank and MFCC features. In earlier work, we presented a generalised VTS (gVTS) that extends the applicability of VTS to front-ends which employ a power transformation non-linearity. gVTS was shown to provide performance improvements in both clean and additive noise c...

This paper introduces a class ofrobust lag-ksmoothersbased on simple low order Markov models for the Gaussian trend-like component of signal plus nonGaussian noise models. The kth order Markov models are of the kth difference form AkX t = €t where Llxt = Xt Xt-l and €t is a zero-mean white Gaussian noise process with variance <1;. The nominal additive noise is a zero-mean white Gaussian noise s...