Abstract—A new approach to model a fading process (e.g., as generated by Jakes’ simulator) is proposed and investigated. This is based on a finite-state Markov chain, with two-dimensional state given by the quantized values of the amplitude and its speed of variation. This results in better accuracy with respect to the classical one-dimensional schemes. The validity of the proposed approach is shown by first comparing the auto-correlation func- tion of the resulting process with that of the simulated process. Furthermore, a simple Go back N protocol has been used for the same purpose, in order to verify the impact of modeling accuracy on upper layers. Some investigations have also been performed to evaluate the sensitivity to the parameter selection. Finally, the widely used model with only two values of the envelope ampli- tude has been studied, both in case of one-dimensional and two- dimensional Markov chain state.
An Improved Markov Chain Description for Fading Processes
BERGAMO, PIERPAOLO;MANIEZZO, Daniela;GIOVANARDI, Alessandra;MAZZINI, Gianluca;ZORZI, Michele
2002
Abstract
Abstract—A new approach to model a fading process (e.g., as generated by Jakes’ simulator) is proposed and investigated. This is based on a finite-state Markov chain, with two-dimensional state given by the quantized values of the amplitude and its speed of variation. This results in better accuracy with respect to the classical one-dimensional schemes. The validity of the proposed approach is shown by first comparing the auto-correlation func- tion of the resulting process with that of the simulated process. Furthermore, a simple Go back N protocol has been used for the same purpose, in order to verify the impact of modeling accuracy on upper layers. Some investigations have also been performed to evaluate the sensitivity to the parameter selection. Finally, the widely used model with only two values of the envelope ampli- tude has been studied, both in case of one-dimensional and two- dimensional Markov chain state.I documenti in SFERA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.