An efficient technique for obtaining unate implementation of functions through input encoding

DOI10.1016/0167-9260(94)90004-3zbMATH Open0875.68151OpenAlexW1976972527MaRDI QIDQ4332007FDOQ4332007

Sandip Kundu

Publication date: 27 February 1997

Published in: Integration (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-9260(94)90004-3

zbMATH Keywords

Author please provide

Mathematics Subject Classification ID

Computer system organization (68M99)

Cited In (2)

• Direct Implementation of Discrete and Residue-Based Functions Via Optimal Encoding: A Programmable Array Logic Approach
• Universal algorithm for synthesizing self-checking testers for constant- weight codes

   Recommendations

• Title not available (Why is that?) 👍 👎
• Direct Implementation of Discrete and Residue-Based Functions Via Optimal Encoding: A Programmable Array Logic Approach 👍 👎
• Architecture-independent approximation of functions 👍 👎
• Faster Homomorphic Function Evaluation Using Non-integral Base Encoding 👍 👎
• Coding with canonical functions 👍 👎
• Recoding-derived bounds for input encoding 👍 👎
• Title not available (Why is that?) 👍 👎
• Optimal coding of continuous functions 👍 👎
• Efficient coding of approximations of real numbers 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: An efficient technique for obtaining unate implementation of functions through input encoding

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