Universal decoding for memoryless Gaussian channels with a deterministic interference

Gaussian Z Channel with Intersymbol Interference

In this paper, we derive a capacity inner bound for a synchronous Gaussian Z channel with intersymbol interference (ISI) under input power constraints. This is done by converting the original channel model into an n-block memoryless circular Gaussian Z channel (n-CGZC) and successively decomposing the n-block memoryless channel into a series of independent parallel channels in the frequency dom...

Universal Decoding for Noisy Channels

A universal decoder for a parametric family of channels is a decoder that for any channel in the family attains the same random coding error exponent as the best decoder for that particular channel. The existence and structure of such decoders is demonstrated under relatively mild conditions of continuity of the channel law with respect to the parameter indexing the family. It is further shown ...

An Improved Sphere-Packing Bound for Finite-Length Codes on Symmetric Memoryless Channels

This paper derives an improved sphere-packing (ISP) bound for finite-length codes whose transmission takes place over symmetric memoryless channels. We first review classical results, i.e., the 1959 sphere-packing (SP59) bound of Shannon for the Gaussian channel, and the 1967 sphere-packing (SP67) bound of Shannon et al. for discrete memoryless channels. A recent improvement on the SP67 bound, ...

IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Universal Decoding for Gaussian Intersymbol Interference Channels

Capacity Region of the Compound Multiple Access Channels with Common Message and in the Presence of Intersymbol Interference

The capacity region of a two-user linear Gaussian compound Multiple Access Channel with common message (CMACC) and intersymbol interference (ISI) under an input power constraint is derived. To obtain the capacity region we first convert the channel to its equivalent memoryless one by defining an n-block memoryless circular Gaussian CMACC model. We then make use of the discrete Fourier transform...