Efficient algorithmic decomposition of transistor groups into series, bridge, and parallel combinations

DOI10.1109/31.81852zbMATH Open0739.94025OpenAlexW2105978786MaRDI QIDQ3986954

Michel Dagenais

Publication date: 28 June 1992

Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/31.81852

zbMATH Keywords

MOS transistor groupsMOS VLSI digital circuitspass-transistor subgroups

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Efficient parallel circuits and algorithms for division 👍 👎
• Efficient parallel solutions of linear algebraic circuits 👍 👎
• Input mapping algorithm for parallel transistor structures 👍 👎
• Decomposition of Asynchronous Sequential Switching Circuits 👍 👎
• Parallel algorithms for power circuits and the word problem of the Baumslag group 👍 👎
• Parallel Algorithms for Power Circuits and the Word Problem of the Baumslag Group. 👍 👎

This page was built for publication: Efficient algorithmic decomposition of transistor groups into series, bridge, and parallel combinations

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