Efficient multiplier based on hybrid approach for Toeplitz matrix-vector product

DOI10.1016/J.IPL.2017.11.006zbMath1423.68615OpenAlexW2770068877MaRDI QIDQ1685022

Changho Seo, Ku-Young Chang, Sun-Mi Park, Dowon Hong

Publication date: 13 December 2017

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2017.11.006

zbMATH Keywords

computational complexityhybrid multiplierparallel multipliersubquadratic space complexity multiplierToeplitz matrix-vector product

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Cites Work

• A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields
• Fast Bit Parallel-Shifted Polynomial Basis Multipliers in <formula formulatype="inline"><tex>$GF(2^{n})$</tex></formula>
• Improved Area-Time Tradeoffs for Field Multiplication Using Optimal Normal Bases
• Block Recombination Approach for Subquadratic Space Complexity Binary Field Multiplication Based on Toeplitz Matrix-Vector Product
• Efficient FPGA-Based Karatsuba Multipliers for Polynomials over ${\mathbb F}_{2}$

This page was built for publication: Efficient multiplier based on hybrid approach for Toeplitz matrix-vector product