Decoding Network Codes using the Sum-Product Algorithm

Gupta, Anindya and Rajan, Sundar B (2016) Decoding Network Codes using the Sum-Product Algorithm. In: IEEE International Conference on Communications (ICC), MAY 22-27, 2016, Kuala Lumpur, MALAYSIA.

PDF 2016_IEEE_ICC.pdf - Published Version Restricted to Registered users only Download (162kB) | Request a copy

Abstract

While feasibility and obtaining a solution of a given network coding problem are well studied, the decoding procedure and complexity have not garnered much attention. We consider the decoding problem in a network wherein the sources generate multiple messages and the sink nodes demand some or all of the source messages. We consider both linear and non-linear network codes over a finite field and propose to use the sum-product (SP) algorithm over the Boolean semiring for decoding at the sink nodes in order to reduce the computational complexity. We use traceback to further lower the computational cost incurred by SP decoding. For sinks demanding all the messages, we define fast decodability of a network code and identify a sufficient condition for the same.

Item Type:	Conference Proceedings
Series.:	IEEE International Conference on Communications
Additional Information:	Copy right for this article belongs to the IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	31 Jan 2017 08:32
Last Modified:	31 Jan 2017 08:32
URI:	http://eprints.iisc.ac.in/id/eprint/56185

Actions (login required)

View Item