Compatibility relation algorithm for the folding of programmable logic arrays

DOI10.1080/00207729008910479MaRDI QIDQ3358231zbMATH OpenOpenAlexFDO

Authors Nripendra N. Biswas

Publication date 1990

Published in International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207729008910479

zbMATH Keywords

foldingprogrammable logic arraysVLSI circuits

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Suboptimal solution for PLA multiple column folding
• scientific article; zbMATH DE number 4070608
• scientific article; zbMATH DE number 139785
• Graph theoretic analysis of PLA folding heuristics
• The Complexity of Near-Optimal Programmable Logic Array Folding

Cited in

(4)

• scientific article; zbMATH DE number 139785 (Why is no real title available?)
• Array Folds Logic
• scientific article; zbMATH DE number 219249 (Why is no real title available?)
• Suboptimal solution for PLA multiple column folding

This page was built for publication: Compatibility relation algorithm for the folding of programmable logic arrays

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