Back to Search
Start Over
Fast decoding for RaptorQ codes using matrix dimensionality reduction.
- Source :
-
Electronics Letters (Wiley-Blackwell) . 7/31/2014, Vol. 50 Issue 16, p1139-1141. 2p. 2 Diagrams, 1 Graph. - Publication Year :
- 2014
-
Abstract
- 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. [ABSTRACT FROM AUTHOR]
- Subjects :
- *DECODING algorithms
*MATRICES (Mathematics)
*CURVES
*GEOMETRY
*ITERATIVE decoding
Subjects
Details
- Language :
- English
- ISSN :
- 00135194
- Volume :
- 50
- Issue :
- 16
- Database :
- Academic Search Index
- Journal :
- Electronics Letters (Wiley-Blackwell)
- Publication Type :
- Academic Journal
- Accession number :
- 97587720
- Full Text :
- https://doi.org/10.1049/el.2014.1381