Fast Bit-Parallel Binary Multipliers Based on Type-I Pentanomials
From MaRDI portal
Publication:5375293
DOI10.1109/TC.2017.2778730zbMATH Open1397.65333OpenAlexW2775673945MaRDI QIDQ5375293FDOQ5375293
Authors: José Luis Imaña
Publication date: 14 September 2018
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.2017.2778730
Recommendations
- An Efficient CRT-Based Bit-Parallel Multiplier for Special Pentanomials
- Efficient Bit-Parallel GF(2^m) Multiplier for a Large Class of Irreducible Pentanomials
- Fast parallel algorithms for binary multiplication and their implementation on systolic architectures
- Low complexity bit-parallel multipliers for a class of finite fields
- Fast binary multiplication by performing dot counting and complement recoding
- Low complexity bit parallel multiplier for \(GF(2^m)\) generated by equally-spaced trinomials
- Efficient ASIC and FPGA implementation of binary-coded decimal digit multipliers
- Parallel multipliers based on special irreducible pentanomials
- Low-Latency High-Throughput Systolic Multipliers Over <formula formulatype="inline"><tex Notation="TeX">$GF(2^{m})$</tex> </formula> for NIST Recommended Pentanomials
Mathematical problems of computer architecture (68M07) Numerical algorithms for computer arithmetic, etc. (65Y04)
Cited In (1)
This page was built for publication: Fast Bit-Parallel Binary Multipliers Based on Type-I Pentanomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375293)