Bounds on the Information Rate for Sparse Channels with Long Memory and I.u.d. Inputs
In this paper the authors propose new bounds on the achievable information rate for discrete-time Gaussian channels with Inter-Symbol Interference (ISI) and independent and uniformly distributed (i.u.d.) channel input symbols drawn from finite-order modulation alphabets. Specifically, they are interested in developing new bounds on the achievable rates for sparse channels with long memory. They obtain a lower bound which can be achieved by practical receivers, based on MMSE channel shortening and suboptimal symbol detection for a reduced-state channel.