Achievable information rates for channels with insertions, deletions, and intersymbol interference with i.i.d. inputs

—We propose to use various trellis structures to characterize different types of insertion and deletion channels. We start with binary independent and identically distributed (i.i.d.) insertion or deletion channels, propose a trellis representation and develop a simulation based algorithm to estimate the corresponding information rates with independent and uniformly distributed inputs. This approach is then generalized to other cases, including channels with additive white Gaussian noise, channels with both insertions and deletions, and channels with intersymbol interference (ISI) where the latter model is motivated by the recent developments on bit-patterned media recording. We demonstrate that the proposed algorithm is an efficient and flexible technique to closely estimate the achievable information rates for channels with insertions and/or deletions with or without intersymbol interference when i.i.d. inputs are employed while we also provide some notes on the achievable inform...

• Type: Journal
• Year: 2010
• Where: TCOM
• Authors: Jun Hu, Tolga M. Duman, M. Fatih Erden, Aleksandar Kavcic
• Keywords: Achievable Information Rates, Deletion Channels, Information Rates, TCOM 2010