© The Institution of Engineering and Technology
A very fast decoding algorithm using matrix dimensionality reduction for RaptorQ codes is proposed. The algorithm exploits a pre-calculated inverse matrix to achieve dimensionality reduction for the received code constraint matrix. As a result, the decoding complexity is decreased significantly, whereas the failure-overhead curve is still identical to that of conventional approaches. Simulations show that the decoding speed of the proposed algorithm can be as fast as 17.5 times the state-of-the-art algorithm when the erasure probability is relatively low.
References
-
-
1)
-
4. Mladenov, T., Nooshabadi, S., Kim, K.: ‘Efficient GF(256) raptor code decoding for multimedia broadcast/multicast services and consumer terminals’, IEEE Trans. Consum. Electron., 2012, 58, (2), pp. 578–580 (doi: 10.1109/TCE.2012.6227434).
-
2)
-
2. Shokrollahi, A., Luby, M.: ‘Raptor codes’, Found. Trends Commun. Inf. Theory, 2011, 6, (3–4), pp. 213–322 (doi: 10.1561/0100000060).
-
3)
-
7. Mladenov, T., Nooshabadi, S., Kim, K.: ‘MBMS raptor codes design trade-off for IPTV’, IEEE Trans. Consum. Electron., 2010, 56, (3), pp. 1264–1269 (doi: 10.1109/TCE.2010.5606257).
-
4)
-
3. Shokrollahi, A.: ‘Raptor codes’, IEEE Trans. Inf. Theory, 2005, 52, (6), pp. 2552–2567.
-
5)
-
5. Luby, M.: ‘LT codes’. Proc. 43rd Annual IEEE Symp. Foundations of Computer Science, Vancouver, BC, Canada, November 2002, pp. 271–280.
-
6)
-
6. Kim, S., Ko, K., Chung, S.-Y.: ‘Incremental Gaussian elimination decoding of raptor codes over BEC’, IEEE Commun. Lett., 2008, 12, (4), pp. 307–309 (doi: 10.1109/LCOMM.2008.072141).
-
7)
-
1. IETF RFC 6330(2011): ‘RaptorQ forward error correction scheme for object delivery’. IETF Proposed Standard, August 2011.
http://iet.metastore.ingenta.com/content/journals/10.1049/el.2014.1381
Related content
content/journals/10.1049/el.2014.1381
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Fast decoding for RaptorQ codes using matrix dimensionality reduction