ETRI-Knowledge Sharing Plaform



논문 검색
구분 SCI
연도 ~ 키워드


학술지 Reducing the Decoding Complexity of RaptorQ Codes for Delay Sensitive Applications using a Simplified and Scaled-down Matrix
Cited 4 time in scopus Download 5 time Share share facebook twitter linkedin kakaostory
고동엽, 구기종, 김도영
AEU - International Journal of Electronics and Communications, v.70 no.9, pp.1356-1360
Urban & Fischer
15MC7200, Giga Media 기반 Tele-experience 서비스 SW플랫폼 기술 개발, 장종현
RaptorQ codes, a class of fountain codes, are widely used as a way to achieve forward error correction at the application layer. Whereas RaptorQ codes perform impressively in terms of symbol recovery, its high computational complexity limits its applicability in demanding real-time scenarios. As a way to resolve this inefficiency, we propose using a novel matrix structure designed to reduce the decoding complexity of RaptorQ codes. Specifically, we replace Luby Transform codes and Low-density Parity Check (LDPC) codes in RaptorQ code operations using a novel binary matrix based on Kolchin's Theorem. Our proposed improvements remove the need for LDPC codes to decrease the dimension of the matrix, and it reduces the latency resulting from matrix inversions. Given that the resulting latency from this process dominates the entire RaptorQ code decoding process, our changes offer the potential for reducing the latency dramatically. Based on an extensive set of simulations using our proposed matrix structure under various configurations, we show that the proposed decoding latency is faster than that of RaptorQ codes, while maintaining an at-par decoding-failure probability.
Erasure codes, LT codes, RaptorQ codes, Rateless codes
KSP 제안 키워드
Computational complexity, Erasure Codes, Failure Probability, Forward error correction(FEC), Fountain codes, LT codes, Low density parity check (LDPC) code, Luby Transform codes, Luby transform(LT), Matrix structure, RaptorQ codes