Optimal choice of Reed-Solomon codes to protect against queuing losses in wireless networks  

作　　者：Claus Bauer 

机构地区：[1]Dolby Laboratories 100 Potrero Avenue,San Francisco

出　　处：《The Journal of China Universities of Posts and Telecommunications》2009年第3期71-83,共13页中国邮电高校学报（英文版）

摘　　要：This article proposes algorithms to determine an optimal choice of the Reed-Solomon forward error correction （FEC） code parameters （n,k） to mitigate the effects of packet loss on multimedia traffic caused by buffer overflow at a wireless base station. A network model is developed that takes into account traffic arrival rates, channel loss characteristics, the capacity of the buffer at the base station, and FEC parameters. For Poisson distributed traffic, the theory of recurrent linear equations is applied to develop a new closed form solution of low complexity of the Markov model for the buffer occupancy. For constant bit rate （CBR） traffic, an iterative procedure is developed to compute the packet loss probabilities after FEC recovery.This article proposes algorithms to determine an optimal choice of the Reed-Solomon forward error correction （FEC） code parameters （n,k） to mitigate the effects of packet loss on multimedia traffic caused by buffer overflow at a wireless base station. A network model is developed that takes into account traffic arrival rates, channel loss characteristics, the capacity of the buffer at the base station, and FEC parameters. For Poisson distributed traffic, the theory of recurrent linear equations is applied to develop a new closed form solution of low complexity of the Markov model for the buffer occupancy. For constant bit rate （CBR） traffic, an iterative procedure is developed to compute the packet loss probabilities after FEC recovery.

关 键 词：FEC packet loss buffer occupancy Markov model 

分 类 号：TN929.5[电子电信—通信与信息系统]