Open AccessFast decoding for RaptorQ codes using matrix dimensionality reduction
Author(s) -
Guo Xiao,
Zhang GengXin,
Tian Chang,
Zhang Lei,
Zhao WengDong
Publication year - 2014
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2014.1381
Subject(s) - decoding methods , dimensionality reduction , reduction (mathematics) , computer science , berlekamp–welch algorithm , sequential decoding , algorithm , list decoding , matrix (chemical analysis) , concatenated error correction code , mathematics , artificial intelligence , block code , materials science , geometry , composite material
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.