A simple way to near minimization of microprogram control memory

DOI10.1007/BF00996803zbMath0517.94006OpenAlexW2017489669MaRDI QIDQ3666750

Bhabani P. Sinha, Pradip K. Srimani

Publication date: 1983

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00996803

zbMATH Keywords

complexityswitching theorycontrol memory wordsmicroprogrammed digital computermicroprograms optimizationminimal cost of implementationPidgin ALGOL

Mathematics Subject Classification ID

Communication theory (94A05)

Cites Work

• Unnamed Item
• On the minimization of control memories
• The identification of parallel micro-operations
• Microprogram Optimization: A Survey
• An Approach to the Optimal Specification of Read-Only Memories in Microprogrammed Digital Computers
• Some Studies on Connected Cover Term Matrices of Switching Functions†
• An Approach for Simplifying Switching Functions by Utilizing the Cover Table Representation

This page was built for publication: A simple way to near minimization of microprogram control memory