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

被引:20
|
作者
Pimentel, C [1 ]
Blake, IF
机构
[1] Univ Fed Pernambuco, Dept Elect & Syst, Commun Res Grp CODEC, BR-50711970 Recife, PE, Brazil
[2] Hewlett Packard Labs, Palo Alto, CA 94304 USA
关键词
burst error channels; combinatorial enumeration; finite state models;
D O I
10.1109/25.752565
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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. In this paper, 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.
引用
收藏
页码:415 / 428
页数:14
相关论文
empty
未找到相关数据