An Equivalent Markov Model for Burst Errors in Digital Channels

IEEE Transactions on Communications

Volumn 43, Issue 234, 1995, Pages 1347-1355

  Sivaprakasam, Srinivas ^a   Shanmugan, K Sam ^a  

^a UNIVERSITY OF KANSAS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SIMULATION; CURVE FITTING; ERROR ANALYSIS; ERRORS; ESTIMATION; MARKOV PROCESSES; PROBABILITY;

BAUM WELCH ALGORITHM; BURST ERRORS; DIGITAL CHANNELS; FRITCHMAN MODEL; HIDDEN MARKOV MODEL; MAXIMUM LIKEHOOD STATE SEQUENCE; TRANSITION MATRIX;

DIGITAL COMMUNICATION SYSTEMS;

EID: 0029255716     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.380185     Document Type: Article

References (19)

1. Srinvias Sivaprakasam, “Characterization of Bursty Channels Using Markov Models,” Ph.D. Thesis, University of Kansas, to be published.
2. William Turin and M. Mohan Sondhi, “Modeling Error Sources in Digital Channels,” IEEE Journal on Sel. Areas in Comm., Vol. II, No. 3, pp. 340–347, April 1993.
3. E. J. Gilbert, “On the Identifiability Problem for Functions of Finite Markov Chains,” Ann. Math. Stat., Vol. 30, pp. 688–697, September 1959.
4. Michel C. Jeruchim, Philip Balaban and K. Sam Shanmugan, Simulation of Communication Systems, Plenum Press, New York, 1992.
5. L. N. Kanal and A. R. K. Sastry, “Models for Channels with Memory and Their Applications to Error Control,” Proc. IEEE, Vol. 66, No. 7, July 1978.
6. Bruce D. Fritchman, “A Binary Channel Characterization Using Partitioned Markov Chains,” IEEE Transactions on Information Theory, Vol. IT-13, No. 2, pp. 221–227, April 1967.
7. Stephen Tsai, “Markov Characterization of the HF Channel,” IEEE Transactions on Communication Technology, Vol. COM-17, No. 1, pp. 24–32, February 1969.
8. Jean Yves Chouinard, Michel Lecours and Gilles Delisle, “Estimation of Gilbert's and Fritchman's Models Parameters Using the Gradient Method for Digital Mobile Radio Channels,” IEEE Trans. on Vehicular Technology, Vol. 37, No. 3, pp. 158–166, August 1988.
9. William Turin, Performance Analysis of Digital Transmission Systems, New York: Computer Science Press, 1990.
10. L. R. Rabiner and B. H. Juang, “An Introduction to Hidden Markov Models,” IEEE ASSP Magazine, January 1986, pp. 4–16.
11. S. E. Levinson, L. R. Rabiner and M. M. Sondhi, “An Introduction to the Application of the Theory of Probabilistic Functions of a Markov Process to Automatic Speech Recognition,” B. S. T. J., Vol. 62, No. 4, April 1983, pp. 1035–1074.
12. Erwin Kreyszig, Advanced Engineering Mathematics, Sixth Edition, John Wiley & Sons, Inc., New York, 1988.
13. F. R. Gantmacher, Applications of the Theory of Matrices, Interscience Publishers, Inc., New York, 1959.
14. L. E. Baum, “An Inequality and Associated Maximization Technique in Statistical Estimation for Probabilistic Functions of a Markov Process,” Inequalities, 3, pp. 1–8, 1972.
15. Jacob Ziv and Neri Merhav, “Estimating the Number of States of a Finite Source,” IEEE Transactions on Information Theory, Vol. IT-38, No. 1, pp. 61–65, January 1992.
16. Neri Merhav, Michael Gutman and Jacob Ziv, “On the Estimation of the Order of a Markov Chain and Universal Data Compression,” IEEE Transactions on Information Theory, Vol. IT-35, No. 5, pp. 1014–1019, September 1989.
17. Jacob Ziv and Abraham Lempel, Compression of Individual Sequences via Variable-Rate Coding,” IEEE Transactions on Information Theory, Vol. IT-24, No. 5, pp. 530–536, September 1978.
18. J. Rissanen, “Complexity of Strings in the Class of Markov Sources,” IEEE Transactions on Information Theory, Vol. IT-32, No. 4, pp. 526–532, July 1986.
19. William H. Press, Brian P. Flannery, Saul A. Teukolsky and William T. Vetterling, Numerical Recipes in C, Cambridge University Press, 1990.