We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Enumeration of Markov chains and burst error statistics for finite state channel models

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Pimentel, C. ; Commun. Res. Group-CODEC, Fed. Univ. Pernambuco, Recife, Brazil ; Blake, I.F.

The analysis of a communication system operating over finite state channel (FSC) models includes the calculation of the probability of subsets of error sequences. These probabilities are known as burst error statistics. The study of the statistical description of the error process has immediate applications in the modeling of real channels and in the design of coding schemes for channels with memory. We present a method to derive analytic expressions for burst error statistics of FSC models with an arbitrary number of states. We follow the theory of enumeration of constrained sequences to obtain an expression for the generating series which enumerates all permissible error sequences that constitute the burst event of interest. We will show that the probability of this event is obtained by acting on the generating series with a linear mapping. Such an approach allows the derivation of various burst error statistics used in the design of a coded system for FSC models

Published in:

Vehicular Technology, IEEE Transactions on  (Volume:48 ,  Issue: 2 )