Exploiting redundancies to improve performance of LT decoding

H.K. Tarus; J.M. Bush; J. Irvine; J. Dunlop

doi:10.1109/CNSR.2008.81

Exploiting redundancies to improve performance of LT decoding

H.K. Tarus, J.M. Bush, J. Irvine, J. Dunlop

Electronic And Electrical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Chapter

8 Citations (Scopus)

Abstract

Rateless codes are a class of codes without a predefined number of encoding symbols. Fountain codes are the first such codes. Luby Transform codes, designed by Michael Luby, are examples of these codes. The accepted and efficient decoding algorithm for these dense bipartite codes is the belief propagation (BP) algorithm as opposed to Gaussian elimination algorithm. LT codes are more efficient as the number of symbols grow. However for streaming purposes, the number of source symbols needs to be constrained while at the same time the probability of success be maintained. In this paper we propose a BP decoding enhancement algorithm using redundancies in the already received encoding symbols to improve the probability of performance of LT decoding. We show that in the limit our proposal achieves up to 15% performance improvement in decoding throughput with similar channel conditions. We emulate our proposal in software and the results follow that predicted by theoretical analysis.

Original language	English
Title of host publication	6th Annual Communication Networks and Services Research Conference 2008
Publisher	IEEE
Pages	198-202
Number of pages	4
ISBN (Print)	978-0-7695-3135-9
DOIs	https://doi.org/10.1109/CNSR.2008.81
Publication status	Published - May 2008

Keywords

source coding
rateless codes
erasure channel
Fountain codes

Access to Document

10.1109/CNSR.2008.81

Cite this

@inbook{e07433a49b5e4c48ba0c674783071c0c,

title = "Exploiting redundancies to improve performance of LT decoding",

abstract = "Rateless codes are a class of codes without a predefined number of encoding symbols. Fountain codes are the first such codes. Luby Transform codes, designed by Michael Luby, are examples of these codes. The accepted and efficient decoding algorithm for these dense bipartite codes is the belief propagation (BP) algorithm as opposed to Gaussian elimination algorithm. LT codes are more efficient as the number of symbols grow. However for streaming purposes, the number of source symbols needs to be constrained while at the same time the probability of success be maintained. In this paper we propose a BP decoding enhancement algorithm using redundancies in the already received encoding symbols to improve the probability of performance of LT decoding. We show that in the limit our proposal achieves up to 15% performance improvement in decoding throughput with similar channel conditions. We emulate our proposal in software and the results follow that predicted by theoretical analysis.",

keywords = "source coding, rateless codes, erasure channel, Fountain codes",

author = "H.K. Tarus and J.M. Bush and J. Irvine and J. Dunlop",

year = "2008",

month = may,

doi = "10.1109/CNSR.2008.81",

language = "English",

isbn = "978-0-7695-3135-9",

pages = "198--202",

booktitle = "6th Annual Communication Networks and Services Research Conference 2008",

publisher = "IEEE",

}

TY - CHAP

T1 - Exploiting redundancies to improve performance of LT decoding

AU - Tarus, H.K.

AU - Bush, J.M.

AU - Irvine, J.

AU - Dunlop, J.

PY - 2008/5

Y1 - 2008/5

N2 - Rateless codes are a class of codes without a predefined number of encoding symbols. Fountain codes are the first such codes. Luby Transform codes, designed by Michael Luby, are examples of these codes. The accepted and efficient decoding algorithm for these dense bipartite codes is the belief propagation (BP) algorithm as opposed to Gaussian elimination algorithm. LT codes are more efficient as the number of symbols grow. However for streaming purposes, the number of source symbols needs to be constrained while at the same time the probability of success be maintained. In this paper we propose a BP decoding enhancement algorithm using redundancies in the already received encoding symbols to improve the probability of performance of LT decoding. We show that in the limit our proposal achieves up to 15% performance improvement in decoding throughput with similar channel conditions. We emulate our proposal in software and the results follow that predicted by theoretical analysis.

AB - Rateless codes are a class of codes without a predefined number of encoding symbols. Fountain codes are the first such codes. Luby Transform codes, designed by Michael Luby, are examples of these codes. The accepted and efficient decoding algorithm for these dense bipartite codes is the belief propagation (BP) algorithm as opposed to Gaussian elimination algorithm. LT codes are more efficient as the number of symbols grow. However for streaming purposes, the number of source symbols needs to be constrained while at the same time the probability of success be maintained. In this paper we propose a BP decoding enhancement algorithm using redundancies in the already received encoding symbols to improve the probability of performance of LT decoding. We show that in the limit our proposal achieves up to 15% performance improvement in decoding throughput with similar channel conditions. We emulate our proposal in software and the results follow that predicted by theoretical analysis.

KW - source coding

KW - rateless codes

KW - erasure channel

KW - Fountain codes

UR - http://dx.doi.org/10.1109/CNSR.2008.81

U2 - 10.1109/CNSR.2008.81

DO - 10.1109/CNSR.2008.81

M3 - Chapter

SN - 978-0-7695-3135-9

SP - 198

EP - 202

BT - 6th Annual Communication Networks and Services Research Conference 2008

PB - IEEE

ER -

Exploiting redundancies to improve performance of LT decoding

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this