Hidden Markov modeling of flat fading channels

Hidden Markov models (HMMs) are a powerful tool for modeling stochastic random processes. They are general enough to model with high accuracy a large variety of processes and are relatively simple allowing us to compute analytically many important parameters of the process which are very difficult to calculate for other models (such as complex Gaussian processes). Another advantage of using HMMs is the existence of powerful algorithms for fitting them to experimental data and approximating other processes. In this paper, we demonstrate that communication channel fading can be accurately modeled by HMMs, and we find closed-form solutions for the probability distribution of fade duration and the number of level crossings.

[1]  Bruce D. Fritchman,et al.  A binary channel characterization using partitioned Markov chains , 1967, IEEE Trans. Inf. Theory.

[2]  E. Gilbert Capacity of a burst-noise channel , 1960 .

[3]  Hendrik C. Ferreira,et al.  Markov characterization of channels with soft decision outputs , 1993, IEEE Trans. Commun..

[4]  C. K. Yuen,et al.  Theory and Application of Digital Signal Processing , 1978, IEEE Transactions on Systems, Man, and Cybernetics.

[5]  William Turin,et al.  Performance Analysis of Digital Transmission Systems , 1990 .

[6]  Hong Shen Wang,et al.  Finite-state Markov channel-a useful model for radio communication channels , 1995 .

[7]  S. Tsai Markov Characterization of the HF Channel , 1969 .

[8]  William Turin,et al.  Modeling Error Sources in Digital Channels , 1993, IEEE J. Sel. Areas Commun..

[9]  A.R.K. Sastry,et al.  Models for channels with memory and their applications to error control , 1978, Proceedings of the IEEE.

[10]  L. Baum,et al.  A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains , 1970 .

[11]  John G. Proakis,et al.  Digital Communications , 1983 .

[12]  W. Turin Fitting probabilistic automata via the em algorithm , 1996 .

[13]  W. C. Jakes,et al.  Microwave Mobile Communications , 1974 .

[14]  Biing-Hwang Juang,et al.  Fundamentals of speech recognition , 1993, Prentice Hall signal processing series.

[15]  William C. Y. Lee,et al.  Mobile Communications Engineering , 1982 .

[16]  S. Kullback,et al.  Information Theory and Statistics , 1959 .

[17]  Michele Zorzi,et al.  On the statistics of block errors in bursty channels , 1997, IEEE Trans. Commun..

[18]  A. Leon-Garcia,et al.  A block memory model for correlated Rayleigh fading channels , 1996, Proceedings of ICC/SUPERCOMM '96 - International Conference on Communications.

[19]  P. Billingsley,et al.  Statistical Methods in Markov Chains , 1961 .

[20]  R. Clarke A statistical theory of mobile-radio reception , 1968 .

[21]  E. O. Elliott Estimates of error rates for codes on burst-noise channels , 1963 .

[22]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

[23]  Hong Shen Wang,et al.  On verifying the first-order Markovian assumption for a Rayleigh fading channel model , 1994, Proceedings of 1994 3rd IEEE International Conference on Universal Personal Communications.

[24]  S. O. Rice,et al.  Distribution of the duration of fades in radio transmission: Gaussian noise model , 1958 .

[25]  K. Sam Shanmugan,et al.  An equivalent Markov model for burst errors in digital channels , 1995, IEEE Trans. Commun..