TY - GEN
T1 - Autoregressive time-varying flat-fading channels
T2 - 2006 IEEE International Symposium on Information Theory, ISIT 2006
AU - Sadeghi, Parastoo
AU - Rapajic, Predrag
AU - Kennedy, Rodney
AU - Abhayapala, Thushara
PY - 2006
Y1 - 2006
N2 - In this paper, we study the effect of channel memory order on the information rate bounds in time-varying flat-fading (FF) channels. We model time variations of the FF channel with autoregressive (AR) processes with varying degrees of model order. We observe that in high SNR conditions (SNR ≳ 20 dB), the information rate penalty of not knowing the AR channel is a non-increasing function of the AR model order. This is expected, since the AR channel predictability cannot decrease with increasing its order. However, in low SNR conditions, the information rate penalty in low-order AR channels can be lower than those in high-order AR channels. Likewise, the intuitive and universal monotonie increase of the information rate bounds with the AR model order is only observed in almost noiseless conditions. In the low SNR regime, however, the achievable information rate bounds in low-order AR channels can be higher than those in high-order AR channels.
AB - In this paper, we study the effect of channel memory order on the information rate bounds in time-varying flat-fading (FF) channels. We model time variations of the FF channel with autoregressive (AR) processes with varying degrees of model order. We observe that in high SNR conditions (SNR ≳ 20 dB), the information rate penalty of not knowing the AR channel is a non-increasing function of the AR model order. This is expected, since the AR channel predictability cannot decrease with increasing its order. However, in low SNR conditions, the information rate penalty in low-order AR channels can be lower than those in high-order AR channels. Likewise, the intuitive and universal monotonie increase of the information rate bounds with the AR model order is only observed in almost noiseless conditions. In the low SNR regime, however, the achievable information rate bounds in low-order AR channels can be higher than those in high-order AR channels.
UR - http://www.scopus.com/inward/record.url?scp=39049154866&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2006.261890
DO - 10.1109/ISIT.2006.261890
M3 - Conference contribution
SN - 1424405041
SN - 9781424405046
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1061
EP - 1065
BT - Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006
Y2 - 9 July 2006 through 14 July 2006
ER -