A Variable-Order Discrete Model for the Fading Channel

  • Fulvio Babich
  • Owen E. Kelly
  • Giancarlo Lombardi


Fading on the mobile propagation channel is modeled as a Markov chain with unspecified state space and order. State space and memory are selected via the context tree pruning (CTP) algorithm that has provable optimality in fitting Markov models of unknown order. CTP provides a hierarchy of models of increasing dimension each of which may be considered the “best” approximation of the fading channel among Markov models of that dimension. A particular model may then be selected by a criterion appropriate for the task that the discrete model will perform. An example herein considers the model’s ability to faithfully mimic statistics of sojourn times in each channel state. That criterion choice is relevant for simulation of channel access and use schemes that exploit channel memory.


Fading Channel Channel State Sojourn Time Training Sequence Context Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Andrea J. Goldsmith and Pravin P. Varaiya. Capacity, mutual information, and coding for finite-state Markov channels. IEEE Trans. Info. Theory, 42 (3): 868–886, May 1996.zbMATHCrossRefGoogle Scholar
  2. 2.
    E.N. Gilbert. Capacity of a Burst-Noise Channel. Bell System Technical Journal, 39: 1253–1266, Sep 1960.MathSciNetGoogle Scholar
  3. 3.
    E.O. Elliott. Estimates of Error Rates for Codes on Burst-Noise Channels. Bell System Technical Journal, 42: 1977–1997, Sep 1963.Google Scholar
  4. 4.
    H.S. Wang. On verifying the first-order Markovian assumption for a Rayleigh fading channel model. In Proc. ICUPC ′94, pages 160–164, San Diego, CA, Sep. 1994.Google Scholar
  5. 5.
    H.S. Wang and N. Moayeri. Finite-state Markov channel: A useful model for radio communication channels. IEEE Trans. Veh. Technol., 44 (1): 163–171, Feb 1995.CrossRefGoogle Scholar
  6. 6.
    M. Zorzi, R.R. Rao, and L.B. Milstein. On the accuracy of a first-order Markov model for data transmission on fading channels. In Proc. IEEE ICUPC ′95, pages 211–215, Tokyo, Japan, Nov. 1995.Google Scholar
  7. 7.
    M. Zorzi, R.R. Rao, and L.B. Milstein. A Markov Model for Block Erorrs on Fading Channel. In Proc. PIMRC ′96, Taiwan, Oct. 1996.Google Scholar
  8. 8.
    R.H. Clarke. A statistical theory of mobile-radio reception. Bell System Technical Journal, 47: 957–1000, 1968.Google Scholar
  9. 9.
    F. Babich and G. Lombardi. A Measurement Based Markov Model for the Indoor Propagation Channel. In Proceedings of IEEE VTC ′97, Phoenix, AZ, May 5–7, 1997.Google Scholar
  10. 10.
    M.J. Weinberger, J.J. Rissanen, and M.J. Feder. A universal finite memory source. IEEE Trans. Info. Theory, 41 (3): 643–652, May 1995.zbMATHCrossRefGoogle Scholar
  11. 11.
    Jorma Rissanen. Stochastic Complexity in Statistical Inquiry, volume 15 of Series in Computer Science. World Scientific, 1989.Google Scholar
  12. 12.
    Bertrand S. Clarke and Andrew R. Barron. Jeffreys prior is asymptotically least favorable under entropy risk. J. Statist. Plann. Inference, 41 (l): 37–60, 1994.MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    Gerardo Rubino and Bruno Sericola. Sojourn times in finite Markov processes. J. Appl. Prob., 27: 744–756, 1989.MathSciNetCrossRefGoogle Scholar
  14. 14.
    Attila Csenki. The joint distribution of sojourn times in finite Markov processes. Adv. in Appl. Probab., 24(1):141–160, 1992.MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
    Patrick Billingsley. Statistical methods in Markov chains. Ann. Math. Stat., 32: 12–40, 1961.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag London Limited 1998

Authors and Affiliations

  • Fulvio Babich
    • 1
  • Owen E. Kelly
    • 2
  • Giancarlo Lombardi
    • 1
  1. 1.Dipartimento di Elettrotecnica, Elettronica ed InformaticaUniversità di TriesteTriesteItaly
  2. 2.Wireless Information Network Laboratory (WINLAB)Rutgers UniversityPiscatawayUSA

Personalised recommendations