Toeplitz Hash Algorithm ======================= The Toeplitz Hash Algorithm describes hash functions that compute hash values through matrix multiplication of the key with a suitable Toeplitz matrix. The Toeplitz Hash Algorithm is used in many network interface controllers for receive side scaling. As an example, with the Toeplitz matrix T the key k results in a hash h as follows: : h = T\cdot k = \begin{pmatrix}1 & 1 & 0 & 1 \\0 & 1 & 1 & 0 \\1 & 0 & 1 & 1 \\\end{pmatrix} \cdot \begin{pmatrix}1\\1\\0\\0\\\end{pmatrix} = \begin{pmatrix}0 \\1 \\1 \\\end{pmatrix} where the entries are bits and all operations are modulo 2. In implementations the highly redundant matrix is not necessarily explicitly stored. The Toeplitz Hash Algorithm describes hash functions that compute hash values through matrix multiplication of the key with a suitable Toeplitz matrix. The Toeplitz Hash Algorithm is used in many network interface controllers for receive side scaling. As an example, with the Toeplitz matrix T the key k results in a hash h as follows: h = T\cdot k = \begin{pmatrix}1 & 1 & 0 & 1 \\0 & 1 & 1 & 0 \\1 & 0 & 1 & 1 \\\end{pmatrix} \cdot \begin{pmatrix}1\\1\\0\\0\\\end{pmatrix} = \begin{pmatrix}0 \\1 \\1 \\\end{pmatrix} where the entries are bits and all operations are modulo 2. In implementations the highly redundant matrix is not necessarily explicitly stored. ==References== REFERENCES ---------- BIBLIOGRAPHY (BibTeX) -------------------- @article{ref0, title = {Toeplitz Hash Algorithm}, url = {https://encyclopegia.org/a/toeplitz-hash-algorithm} } BIBLIOGRAPHY (RIS) ------------------- TY - JOUR TI - Toeplitz Hash Algorithm UR - https://encyclopegia.org/a/toeplitz-hash-algorithm ER - CITE THIS ARTICLE ---------------- Cite this article: Toeplitz Hash Algorithm Derived from: https://en.wikipedia.org/w/index.php?oldid=1289814034 Licence: CC BY-SA 4.0 Snapshot: enwiki-001289814034 Permalink: /a/toeplitz-hash-algorithm