Cart (Loading....) | Create Account
Close category search window
 

Recovery of small bursts of voice packets using RS erasure code with low decoding delay

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jharee, S. ; Univ. of Mauritius, Reduit ; Soyjaudah, K.M.S.

It is well known that packet losses in the networks are mainly due to congestion because of the finite buffer capacity of queues in routers. Forward error correction (FEC) can recover from losses without retransmissions of lost packets. However, FEC faces with two main drawbacks: firstly, the redundancy generated by the sender increases the overall load of the network resulting in an increase of loss rate and secondly, waiting for redundant information to be able to recover lost packets results in additional delay. In this paper we employ the Reed Solomon erasure (RSE (7, 4)) code to recover lost packets. We apply the adaptive differential pulse code modulation (ADPCM) compression technique to make room for the redundant packets and thus reduce the additional load due to redundancy. We further modify the recovery scheme to bring down the decoding delay from a maximum of 6 packets to a maximum of 3 packets. Results of informal mean opinion score (MOS) listening test show that the modified RSE code is capable of correcting any burst of two packets and provides a tradeoff between quality, network load and decoding delay.

Published in:

AFRICON 2007

Date of Conference:

26-28 Sept. 2007

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.