论文信息 - Matrix-Vector Multiplication via Erasure Decoding

Matrix-Vector Multiplication via Erasure Decoding

The problem of fast evaluation of a matrix-vector product over GF (2) is considered. The problem is reduced to erasure decoding of a linear error-correcting code. A large set of redundant parity check equations for this code is generated. The multiplication algorithm is derived by tracking the execution of the message-passing algorithm on the obtained set of parity check equations. The obtained algorithms outperform the classical ones.

Peter Trifonov | P. Trifonov

[1] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[2] Peter Trifonov,et al. A Method for Fast Computation of the Fourier Transform over a Finite Field , 2003, Probl. Inf. Transm..

[3] Anne Canteaut,et al. A New Algorithm for Finding Minimum-Weight Words in a Linear Code: Application to McEliece’s Cryptosystem and to Narrow-Sense BCH Codes of Length , 1998 .

[4] I. Gohberg,et al. Complexity of multiplication with vectors for structured matrices , 1994 .

[5] J. Cocke. Global common subexpression elimination , 1970, Symposium on Compiler Optimization.

[6] Bane V. Vasic,et al. Iterative decoding of linear block codes: a parity-check orthogonalization approach , 2005, IEEE Transactions on Information Theory.

[7] R. Gregory Taylor,et al. Modern computer algebra , 2002, SIGA.

[8] Alexander Vardy,et al. On the stopping distance and the stopping redundancy of codes , 2006, IEEE Transactions on Information Theory.

[9] Daniel A. Spielman,et al. Efficient erasure correcting codes , 2001, IEEE Trans. Inf. Theory.

[10] Rüdiger L. Urbanke,et al. Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[11] P. Vontobel,et al. Graph-covers and iterative decoding of nite length codes , 2003 .

[12] Allan O. Steinhardt,et al. Fast algorithms for digital signal processing , 1986, Proceedings of the IEEE.