Finite-state Markov modeling of fading channels - a survey of principles and applications

This article's goal is to provide an in-depth understanding of the principles of FSMC modeling of fading channels with its applications in wireless communication systems. While the emphasis is on frequency nonselective or flat-fading channels, this understanding will be useful for future generalizations of FSMC models for frequency-selective fading channels. The target audience of this article include both theory- and practice-oriented researchers who would like to design accurate channel models for evaluating the performance of wireless communication systems in the physical or media access control layers, or those who would like to develop more efficient and reliable transceivers that take advantage of the inherent memory in fading channels. Both FSMC models and flat-fading channels will be formally introduced. FSMC models are particulary suitable to represent and estimate the relatively fast flat-fading channel gain in each subcarrier.

[1]  D. A. Bell,et al.  Information Theory and Reliable Communication , 1969 .

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

[3]  Vikram Krishnamurthy,et al.  V-BLAST Power and Rate Control under Delay Constraints in Markovian Fading Channels - Optimality of Monotonic Policies , 2006, 2006 IEEE International Symposium on Information Theory.

[4]  N. Moayeri,et al.  Modeling, capacity, and joint source/channel coding for Rayleigh fading channels , 1993, IEEE 43rd Vehicular Technology Conference.

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

[6]  Fulvio Babich,et al.  Generalized Markov modeling for flat fading , 2000, IEEE Trans. Commun..

[7]  Wayne E. Stark,et al.  On the design of Markov models for fading channels , 1999, Gateway to 21st Century Communications Village. VTC 1999-Fall. IEEE VTS 50th Vehicular Technology Conference (Cat. No.99CH36324).

[8]  Fulvio Babich,et al.  A context-tree based model for quantized fading , 1999, IEEE Communications Letters.

[9]  John G. Proakis,et al.  Probability, random variables and stochastic processes , 1985, IEEE Trans. Acoust. Speech Signal Process..

[10]  Jean-Yves Chouinard,et al.  Characterization of error sequences in UHF digital mobile radio channels , 1991 .

[11]  Teng Li,et al.  Successive Decoding for Finite State Markov Modelled Flat Fading Channels , 2006, 2006 IEEE International Symposium on Information Theory.

[12]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[13]  Andrea J. Goldsmith,et al.  Capacity of Finite State Channels Based on Lyapunov Exponents of Random Matrices , 2006, IEEE Transactions on Information Theory.

[14]  William Turin,et al.  Hidden Markov modeling of flat fading channels , 1998, IEEE J. Sel. Areas Commun..

[15]  Hans-Andrea Loeliger,et al.  A Generalization of the Blahut–Arimoto Algorithm to Finite-State Channels , 2008, IEEE Transactions on Information Theory.

[16]  Hans-Andrea Loeliger,et al.  On the information rate of binary-input channels with memory , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[17]  Fulvio Babich,et al.  A Markov model for the mobile propagation channel , 2000, IEEE Trans. Veh. Technol..

[18]  J.E. Mazo,et al.  Digital communications , 1985, Proceedings of the IEEE.

[19]  Claude E. Shannon,et al.  Certain Results in Coding Theory for Noisy Channels , 1957, Inf. Control..

[20]  Saleem A. Kassam,et al.  Finite-state Markov model for Rayleigh fading channels , 1999, IEEE Trans. Commun..

[21]  Frank R. Kschischang,et al.  On Designing Good LDPC Codes for Markov Channels , 2007, IEEE Transactions on Information Theory.

[22]  Harish Viswanathan.  Capacity of Markov Channels with Receiver CSI and Delayed Feedback , 1999, IEEE Trans. Inf. Theory.

[23]  PROCEssIng magazInE.  IEEE Signal Processing Magazine , 2004 .

[24]  Vijay K. Bhargava,et al.  Optimal and suboptimal packet scheduling over correlated time varying flat fading channels , 2006, IEEE Transactions on Wireless Communications.

[25]  John D. Villasenor,et al.  Turbo decoding of Gilbert-Elliot channels , 2002, IEEE Trans. Commun..

[26]  Richard H. McCullough.  The binary regenerative channel , 1968 .

[27]  Mehul Motani,et al.  Buffer and channel adaptive transmission over fading channels with imperfect channel state information , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[28]  Javier Garcia-Frías,et al.  Decoding of low-density parity-check codes over finite-state binary Markov channels , 2004, IEEE Transactions on Communications.

[29]  P. Sadeghi,et al.  Implicit and explicit receiver training in flat fading channels modeled as finite state Markov processes , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

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

[31]  Pravin Varaiya,et al.  Capacity, mutual information, and coding for finite-state Markov channels , 1996, IEEE Trans. Inf. Theory.

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

[33]  Kareem E. Baddour,et al.  Autoregressive modeling for fading channel simulation , 2005, IEEE Transactions on Wireless Communications.

[34]  V. Sharma,et al.  Entropy and channel capacity in the regenerative setup with applications to Markov channels , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[35]  Paul H. Siegel,et al.  On the achievable information rates of finite state ISI channels , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[36]  Pradeepa Yahampath,et al.  Joint source-channel decoding in vector quantization over finite-state Markov channels and wireless channels , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[37]  L. F. Turner,et al.  Generalised fsmc model for radio channels with correlated fading , 1999 .

[38]  Frank R. Kschischang,et al.  Analysis of low-density parity-check codes for the Gilbert-Elliott channel , 2005, IEEE Transactions on Information Theory.

[39]  Vijay K. Bhargava,et al.  POMDP-Based Coding Rate Adaptation for Type-I Hybrid ARQ Systems over Fading Channels with Memory , 2006, IEEE Transactions on Wireless Communications.

[40]  Toby Berger,et al.  The capacity of finite-State Markov Channels With feedback , 2005, IEEE Transactions on Information Theory.

[41]  Wei Zeng,et al.  Simulation-Based Computation of Information Rates for Channels With Memory , 2006, IEEE Transactions on Information Theory.

[42]  Jonathan H. Manton,et al.  An Information-Theoretic Measure for the Selection of Effective Memory Order in Flat-Fading Channels , 2006 .

[43]  Kareem E. Baddour,et al.  Autoregressive models for fading channel simulation , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[44]  Andrea J. Goldsmith,et al.  Capacity of Finite-State Channels with Time-Invariant Deterministic Feedback , 2006, ISIT.

[45]  Jinho Choi,et al.  Channel Prediction Using Lumpable Finite-State Markov Channels in OFDMA Systems , 2006, 2006 IEEE 63rd Vehicular Technology Conference.

[46]  Vikram Krishnamurthy,et al.  Opportunistic file transfer over a fading channel: A POMDP search theory formulation with optimal threshold policies , 2006, IEEE Transactions on Wireless Communications.

[47]  Andrea J. Goldsmith,et al.  Low-complexity maximum-likelihood detection of coded signals sent over finite-state Markov channels , 2002, IEEE Trans. Commun..

[48]  D. Blackwell,et al.  Proof of Shannon's Transmission Theorem for Finite-State Indecomposable Channels , 1958 .

[49]  Lawrence R. Rabiner,et al.  A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.

[50]  Israel Bar-David,et al.  Capacity and coding for the Gilbert-Elliot channels , 1989, IEEE Trans. Inf. Theory.

[51]  Parastoo Sadeghi,et al.  Optimizing Information Rate Bounds for Channels with Memory , 2007, 2007 IEEE International Symposium on Information Theory.

[52]  P. Takis Mathiopoulos,et al.  Fast simulation of diversity Nakagami fading channels using finite-state Markov models , 2003, IEEE Trans. Broadcast..

[53]  Pao-Chi Chang,et al.  On verifying the first-order Markovian assumption for a Rayleigh fading channel model , 1996 .

[54]  Lars K. Rasmussen,et al.  Linear interference cancellation in CDMA based on iterative techniques for linear equation systems , 2000, IEEE Trans. Commun..

[55]  Cecilio Pimentel,et al.  Finite-state Markov modeling of correlated Rician-fading channels , 2004, IEEE Transactions on Vehicular Technology.

[56]  Heng Wang,et al.  Opportunistic file transfer over a fading channel under energy and delay constraints , 2005, IEEE Transactions on Communications.

[57]  Norman C. Beaulieu,et al.  On first-order Markov modeling for the Rayleigh fading channel , 2000, IEEE Trans. Commun..

[58]  Richard D. Wesel,et al.  Joint iterative channel estimation and decoding in flat correlated Rayleigh fading , 2001, IEEE J. Sel. Areas Commun..

[59]  Sekhar Tatikonda,et al.  Feedback capacity of finite-state machine channels , 2005, IEEE Transactions on Information Theory.

[60]  Bruno O. Shubert,et al.  Random variables and stochastic processes , 1979 .

[61]  Paul H. Siegel,et al.  Markov Processes Asymptotically Achieve the Capacity of Finite-State Intersymbol Interference Channels , 2004, IEEE Transactions on Information Theory.

[62]  Parastoo Sadeghi,et al.  Comparison of receiver training methods in joint iterative channel estimation and decoding in flat fading channels , 2003, 14th IEEE Proceedings on Personal, Indoor and Mobile Radio Communications, 2003. PIMRC 2003..

[63]  E. Shwedyk,et al.  Communication receivers based on Markov models of the fading channel , 2002, IEEE CCECE2002. Canadian Conference on Electrical and Computer Engineering. Conference Proceedings (Cat. No.02CH37373).

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

[65]  Mario Rafael Hueda.  On first-order Markov modeling for block errors on fading channels , 2002, Vehicular Technology Conference. IEEE 55th Vehicular Technology Conference. VTC Spring 2002 (Cat. No.02CH37367).

[66]  Edward A. Ratzer.  Low-density parity-check codes on Markov channels , 2002 .

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

[68]  Emre Telatar,et al.  Mismatched decoding revisited: General alphabets, channels with memory, and the wide-band limit , 2000, IEEE Trans. Inf. Theory.

[69]  Laurence B. Milstein,et al.  Performance of a wireless access protocol on correlated Rayleigh-fading channels with capture , 1998, IEEE Trans. Commun..

[70]  Shiduan Cheng,et al.  A joint adaptive packet size and modulation scheme combined with SR-ARQ over correlated fading channels , 2005, Proceedings. 2005 International Conference on Wireless Communications, Networking and Mobile Computing, 2005..

[71]  Parastoo Sadeghi,et al.  Capacity analysis for finite-state Markov mapping of flat-fading channels , 2005, IEEE Transactions on Communications.

[72]  P. Krishnamurthy,et al.  A study of different partitioning schemes in first order Markovian models for Rayleigh fading channels , 2002, The 5th International Symposium on Wireless Personal Multimedia Communications.

[73]  Lawrence R. Rabiner,et al.  A tutorial on Hidden Markov Models , 1986 .

[74]  Rodney A. Kennedy,et al.  Optimal implicit channel estimation for finite state Markov communication channels , 2006, 2006 IEEE International Symposium on Information Theory.

[75]  L. B. Milstein,et al.  ARQ error control for fading mobile radio channels , 1997 .

[76]  Branka Vucetic,et al.  An adaptive coding scheme for time-varying channels , 1991, IEEE Trans. Commun..

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

[78]  H. Kong,et al.  Sequence detection and channel state estimation over finite state Markov channels , 1999 .