Code Assignment Algorithm for Highly Parallel Multiple-Valued k-Ary Operation Circuits Using Partition Theory.

DOI10.4036/IIS.1997.13MaRDI QIDQ4244848zbMATH OpenOpenAlexFDO

Authors Michitaka Kameyama, Saneaki Tamaki

Publication date 31 May 1999

Published in Interdisciplinary Information Sciences (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4036/iis.1997.13

zbMATH Keywords

VLSI systems

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Computer system organization (68M99)

Recommendations

• Parallel evaluation of arithmetic circuits
• Bit serial addition trees and their applications
• Multiple Operand Addition and Multiplication
• Systolic synthesis algorithms for arithmetic polynomial forms of \(k\)-valued functions of Boolean algebra

This page was built for publication: Code Assignment Algorithm for Highly Parallel Multiple-Valued k-Ary Operation Circuits Using Partition Theory.

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