Campus Units

Electrical and Computer Engineering

Document Type

Conference Proceeding


2010 IEEE Global Telecommunications Conference (GLOBECOM 2010)

Publication Version

Accepted Manuscript

Link to Published Version

Publication Date


Journal or Book Title

2010 IEEE Global Telecommunications Conference (GLOBECOM 2010)



Conference Title

2010 IEEE Global Telecommunications Conference

Conference Date

December 6-10, 2010


Miami, FL


Inter-symbol interference (ISI) channels with data dependent Gauss Markov noise have been used to model read channels in magnetic recording and other data storage systems. The Viterbi algorithm can be adapted for performing maximum likelihood sequence detection in such channels. However, the problem of finding an analytical upper bound on the bit error rate of the Viterbi detector in this case has not been fully investigated. Current techniques rely on an exhaustive enumeration of short error events and determine the BER using a union bound. In this work, we consider a subset of the class of ISI channels with data dependent Gauss-Markov noise. We derive an upper bound on the pairwise error probability (PEP) between the transmitted bit sequence and the decoded bit sequence that can be expressed as a product of functions depending on current and previous states in the (incorrect) decoded sequence and the (correct) transmitted sequence. In general, the PEP is asymmetric. The average BER over all possible bit sequences is then determined using a pairwise state diagram. Simulations results which corroborate the analysis of upper bound, demonstrate that analytic bound on BER is tight in high SNR regime. In the high SNR regime, our proposed upper bound obviates the need for computationally expensive simulation.


This is a manuscript from the IEEE Global Telecommunications Conference (2010), doi:10.1109/GLOCOM.2010.5683963. Posted with permission.


Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Copyright Owner




File Format


Published Version


Article Location