By Topic

Improved approximate decoding based on position information matrix

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

3 Author(s)
Minhae Kwon ; Multimedia Commun. & Networking Lab., Ewha Womans Univ., Seoul, South Korea ; Hyunggon Park ; Frossard, P.

This paper proposes a robust decoding algorithm in delivery of network coded data which is in particular correlated and delay-sensitive. We consider ad-hoc sensor network topologies, where a correlated data is delivered based on network coding techniques in conjunction with approximate decoding algorithm in order for efficient and robust data delivery. The approximate decoding algorithm has been developed as a decoding solution to ill-posed problems for network coded correlated data sources. In this paper, we improve the performance of approximate decoding algorithm by explicitly considering more information, which is used to additionally refine the recovered data. The information includes potential results that are from finite field operations and the set of such information is referred to as position information matrix in this paper. We deploy the position information matrix into approximate decoding algorithm and investigate its corresponding properties. We then analytically show that this improves the performance of approximate decoding algorithm. Our simulation results confirm the properties of the proposed approximate decoding algorithm with position information matrix and improved performance.

Published in:

Computers and Communications (ISCC), 2012 IEEE Symposium on

Date of Conference:

1-4 July 2012