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

Jun Hu, Tolga M. Duman, M. Fatih Erden, Aleksandar Kavcic

Research output: Contribution to journalArticle

25 Scopus citations

Abstract

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 information rates when Markov inputs are used. We emphasize that our method is useful for evaluating information rates for channels with insertion/deletions with additional impairments where there does not seem to be a hope of obtaining fully analytical results.

Original languageEnglish (US)
Article number5439313
Pages (from-to)1102-1111
Number of pages10
JournalIEEE Transactions on Communications
Volume58
Issue number4
DOIs
StatePublished - Apr 1 2010

    Fingerprint

Keywords

  • Bitpatterned media recording
  • Deletion channel
  • Information rates
  • Insertion channel
  • Intersymbol interference
  • Synchronization errors

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this