Unequal Error Protection Random Linear Coding Strategies for Erasure Channels

In this paper, we provide the performance analysis of unequal error protection (UEP) random linear coding (RLC) strategies designed for transmission of source messages containing packets of different importance over lossy packet erasure links. By introducing the probabilistic encoding framework, we...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications Vol. 60; no. 5; pp. 1243 - 1252
Main Authors: Vukobratovic, D., Stankovic, V.
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.05.2012
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Applied sciences
Coding
Coding, codes
Decoding
Encoding
Error correction codes
Exact sciences and technology
Forward error correction
Germanium
Information, signal and communications theory
Messages
Network coding
Packet transmission
Probabilistic logic
Probabilistic methods
Probability theory
random linear coding
Receivers
Signal and communications theory
Strategy
Studies
Switching and signalling
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
unequal error protection
Upper bound
Performance evaluation
Packet switching
Design criterion
unequal error protection
Probabilistic approach
Lossy medium
Decoding
Random coding
Optimization
random linear coding
Linear coding
Network coding
Error correction
ISSN:0090-6778, 1558-0857
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we provide the performance analysis of unequal error protection (UEP) random linear coding (RLC) strategies designed for transmission of source messages containing packets of different importance over lossy packet erasure links. By introducing the probabilistic encoding framework, we first derive the general performance limits for the packet-level UEP coding strategies that encode the packets of each importance class of the source message independently (non-overlapping windowing strategy) or jointly (expanding windowing strategy). Then, we demonstrate that the general performance limits of both strategies are achievable by the probabilistic encoding over non-overlapping and expanding windows based on RLC and the Gaussian Elimination (GE) decoding. Throughout the paper, we present a number of examples that investigate the performance and optimization of code design parameters of the expanding window RLC strategy and compare it with the non-overlapping RLC strategy selected as a reference.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2012.030712.100454