Packet-level Reed-Solomon codes over burst-loss channels

Author

Che Hui ; Bai Yong ; Chunkang Feng

Author_Institution

Coll. of Inf. Sci. & Technol., Hainan Univ., Haikou, China

fYear

2012

fDate

9-11 Nov. 2012

Firstpage

180

Lastpage

185

Abstract

The packet-level Reed-Solomon (PRS) code can help to recover burst loss packets for VoIP service over wireless networks. A detailed study on PRS code over a burst loss channel is carried out by means of simulation in this paper. The Gilbert model based on a two-state Markov chain is established for the burst-loss channel. The encoding and decoding algorithms of the PRScode including the truncated code are given. The performance of different PRS codes with three burst-loss channel parameters is obtainedand the relationship between the improved performance and the PRS codes over burst-loss channels is discussed. Based on our study, a method of choosing the suitable PRS codes over burst-loss channel is advised at the end of the paper.

Keywords

Internet telephony; Markov processes; Reed-Solomon codes; channel coding; decoding; wireless channels; Gilbert model; PRS code; VoIP service; burst loss packet; burst-loss channel parameter; decoding algorithm; encoding algorithm; packet-level Reed-Solomon code; truncated code; two-state Markov chain; wireless network; Burst-loss channel; Reed-Solomon code;

fLanguage

English

Publisher

ieee

Conference_Titel

Communication Technology (ICCT), 2012 IEEE 14th International Conference on

Conference_Location

Chengdu

Print_ISBN

978-1-4673-2100-6

Type

conf

DOI

10.1109/ICCT.2012.6511211

Filename

6511211