.png){kind=icon}
.png){kind=icon}
Return
Multiway Splitting Method for Toeplitz Matrix Vector Product
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2012.95.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 IF2. 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(logk) ((k(k+1)/2))).
Keywords:
Toeplitz matrix vector product
subquadratic complexity
parallel multiplier
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.8
Papers:
5.3K
Citations:
9.8K