DocumentCode
2655306
Title
Characterization of bursty channels using Markov models
Author
Srinivas, S. ; Shanmugan, K.S.
Author_Institution
Dept. of Electr. & Comput. Eng., Kansas Univ., Lawrence, KS, USA
Volume
3
fYear
1993
fDate
23-26 May 1993
Firstpage
1615
Abstract
The modeling of error burst characteristics of communication channels is considered. Two techniques, hidden Markov modeling (HMM) and Fritchman characterization, are discussed. While the Fritchman method yields a model faster, it is assumed that the error burst (and error free run) lengths are statistically independent. The HMM algorithm is computationally intensive. A modified HMM algorithm is presented. It is computationally very efficient and better suited for channel models requiring more than one bad state
Keywords
computational complexity; hidden Markov models; telecommunication channels; Fritchman characterization; communication channels; computational efficiency; error burst characteristics; error free run; hidden Markov modeling; modified HMM algorithm; Communication channels; Computer errors; Frequency; Hidden Markov models; Land mobile radio; Mobile communication; Robustness; Speech recognition; State-space methods; Wireless communication;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 1993. ICC '93 Geneva. Technical Program, Conference Record, IEEE International Conference on
Conference_Location
Geneva
Print_ISBN
0-7803-0950-2
Type
conf
DOI
10.1109/ICC.1993.397557
Filename
397557
Link To Document