A formal approach to designing multiple-valued arithmetic circuits

MaRDI QIDQ4583790zbMATH OpenFDO

Authors Kazuya Saito, Naofumi Homma, Takafumi Aoki

Publication date 3 September 2018

Full work available at URL http://www.oldcitypublishing.com/journals/mvlsc-home/mvlsc-issue-contents/mvlsc-volume-24-number-1-4-2015/mvlsc-24-1-4-p-21-34/

zbMATH Keywords

computer algebraarithmetic circuitsformal verificationGalois field

Mathematics Subject Classification ID

Analytic circuit theory (94C05)

Recommendations

• scientific article; zbMATH DE number 1796154
• A new architecture for a parallel finite field multiplier with low complexity based on composite fields
• Design of multiple-valued arithmetic circuits using counter tree diagrams
• scientific article; zbMATH DE number 5244190
• A Versatile Reconfigurable Bit-Serial Multiplier Architecture in Finite Fields GF(2m)

Cited in

(9)

• scientific article; zbMATH DE number 6930343 (Why is no real title available?)
• A multiple-valued logic approach to the design and verification of hardware circuits
• scientific article; zbMATH DE number 2114153 (Why is no real title available?)
• Functional verification of high performance adders in \textsc{Coq}
• Shallow circuits and concise formulae for multiple addition and multiplication
• scientific article; zbMATH DE number 1796154 (Why is no real title available?)
• Design of multiple-valued arithmetic circuits using counter tree diagrams
• Modified Redundant Representation for Designing Arithmetic Circuits with Small Complexity
• A formal verification method of error correction code processors over Galois-field arithmetic

This page was built for publication: A formal approach to designing multiple-valued arithmetic circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4583790)