Multiway Splitting Method for Toeplitz Matrix Vector Product

Anwar Hasan 1 Christophe Negre 2, 3
2 DALI - Digits, Architectures et Logiciels Informatiques
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, UPVD - Université de Perpignan Via Domitia
Abstract : Computing the product of a Toeplitz matrix and a vector arises in various applications including cryptography. In this paper, we consider Toeplitz matrices and vectors with entries in $({hbox{rlap{I}kern 2.0pt{hbox{F}}}}_2)$. For improved efficiency in such computations, large Toeplitz matrices and vectors are recursively split and special formulas with subquadratic arithmetic complexity are applied. To this end, we first present a formula for the five-way splitting and then provide a generalization for the $(k)$-way splitting, where $(k)$ is an arbitrary integer. These formulas can be used to compute a Toeplitz matrix-vector product (TMVP) of size $(n)$ with an arithmetic complexity of $(O(n^{log_k(k(k+1)/2)}))$.
Type de document :
Article dans une revue
IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2013, 62 (7), pp.1467-1471. 〈10.1109/TC.2012.95〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00839952
Contributeur : Christophe Negre <>
Soumis le : lundi 1 juillet 2013 - 11:32:46
Dernière modification le : mardi 10 octobre 2017 - 11:07:40

Identifiants

Collections

Citation

Anwar Hasan, Christophe Negre. Multiway Splitting Method for Toeplitz Matrix Vector Product. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2013, 62 (7), pp.1467-1471. 〈10.1109/TC.2012.95〉. 〈hal-00839952〉

Partager

Métriques

Consultations de la notice

93