Name
Abstract | ||
|---|---|---|
In this paper, performance of finite-length batched sparse (BATS) codes with belief propagation (BP) decoding is analyzed. For fixed number of input symbols and fixed number of batches, a recursive formula is obtained to calculate the exact probability distribution of the stopping time of the BP decoder. When the number of batches follows a Poisson distribution, a recursive formula with lower computational complexity is derived. Inactivation decoding can be applied to reduce the receiving overhead of the BP decoder, where the number of inactive symbols determines the extra computation cost of inactivation decoding. Two more recursive formulas are derived to calculate the expected number of inactive symbols for fixed number of batches and for Poisson distributed number of batches, respectively. Since LT/Raptor codes are BATS codes with unit batch size, our results also provide new analytical tools for LT/Raptor codes. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/NetCod.2013.6570815 | NetCod |
Keywords | DocType | Volume |
finite-length batched sparse codes,stopping time,recursive formula,poisson distribution,poisson distributed number,bats codes,finite-length analysis,belief propagation,codecs,lt-raptor codes,computation cost,computational complexity,probability distribution,bp decoder,inactivation decoding,belief propagation decoding,decoding,bismuth,error probability,vectors,encoding,linear systems | Journal | abs/1312.4811 |
Issue | ISSN | ISBN |
null | 2374-9660 | 978-1-4799-0821-9 |
Citations | PageRank | References |
12 | 0.82 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tsz-Ching Ng | 1 | 17 | 1.69 |
| Shenghao Yang | 2 | 128 | 15.00 |