Abstract
An overview of the basic principles involved in the minimisation of two-level combinatorial logic functions was presented in chapter 2. It was shown that manual minimisation techniques, based on algebraic or map methods, rely on the human brain to recognise patterns in the representations of logic functions. Unfortunately, these techniques tend to be unmanageable when dealing with functions containing more than four or five variables, owing to the rapid increase in the amount of data to be processed by hand. Therefore, computer-driven algorithmic techniques must be employed to manage the increased complexity inherent in the minimisation of large functions containing twenty or more variables. An outline of pertinent techniques is presented in this chapter.
Preview
Unable to display preview. Download preview PDF.
4.6 References
Biswas, N. N. (1986). ‘Computer-aided minimisation procedure for Boolean functions’, IEEE Transactions on Computer-Aided Design, CAD-5 (2), pp. 303–304.
Brayton, R. K., Hachtel, G. D., McMullen, C. and Sangiovanni-Vincentelli, A. (1984). Logic Minimisation Algorithms for VLSI Synthesis, Kluwer Academic Publishers.
Brown, D. W. (1981). ‘A state-machine synthesiser’, 18th Design Automation Conference, pp. 301–305.
Cutler, R. B. and Muroga, S. (1987). ‘Derivation of minimal sums for completely specified functions’, IEEE Transactions on Computers, C-36 (3), pp. 277–292.
Dagenais, M. R., Agarwal, V. K. and Rumin, N. C (1986). ‘McBOOLE: a new procedure for exact logic minimisation’, IEEE Transactions on Computer-Aided Design, CAD-5 (2), pp. 229–238.
de Micheli, G. (1986). ‘Symbolic design of combinational and sequential logic circuits implemented by two-level logic macros’, IEEE Transactions on Computer-Aided Design, CAD-5 (4), pp. 597–616.
Gurunath, B. and Biswas, N. N. (1989). ‘An algorithm for multiple output minimisation’, IEEE Transactions on Computer-Aided Design, CAD-8 (9), pp. 1007–1013.
Hong, S. J. and Muroga, S. (1991). ‘Absolute minimisation of completely specified switching functions’, IEEE Transactions on Computers, 40 (1), pp. 53–65.
Hong, S. J., Cain., R. G. and Ostapko, D. L. (1974). ‘MINI: A heuristic approach for logic minimisation’, IBM Journal of Research and Development, 18, pp. 443–458.
Lewin, D. (1977). Computer-aided Design of Digital Systems, Edward Arnold, London.
Malik, A. A., Brayton, R. K., Newton, A.R. and Sangiovanni-Vincentelli, A. (1988). ‘A modified approach to two-level logic minimisation’, IEEE International Conference on Computer-Aided Design, pp. 106–109.
Miller, R. E. (1965). Switching Theory, Volume I: Combinatorial Circuits, John Wiley & Sons, New York.
Quine, W. V. (1955). ‘A way to simplify truth functions’, American Mathematics Monthly, 62, pp. 627–631.
Reusch, B. (1975). ‘Generation of prime implicants from subfunctions and a unifying approach to the covering problem’, IEEE Transactions on Computers, C-24 (9), pp. 924–930.
Roth, J. P. (1980). Computer Logic, Testing, and Verification, Pitman.
Rudell, R. L. and Sangiovanni-Vincentelli, A. (1987). ‘Multiple-valued minimisation for PLA optimisation’, IEEE Transactions on Computer-Aided Design, CAD-6(5), pp. 727–750.
Sasao, T. (1984). ‘Input variable assignment and output phase optimisation of PLAs’, IEEE Transactions on Computers, C-33 (10), pp. 879–894.
Su, S. Y. H and Cheung, P. T. (1972). ‘Computer minimization of multivalued switching functions’, IEEE Transactions on Computers, C-21 (9), pp. 995–1003.
Tison, P. (1967). ‘Generalization of consensus theory and application to the minimization of Boolean functions’, IEEE Transactions on Electronic Computers, EC-16 (4), pp. 446–456.
Author information
Authors and Affiliations
Copyright information
© 1992 M. D. Edwards
About this chapter
Cite this chapter
Edwards, M.D. (1992). Two-level Logic Minimisation. In: Automatic Logic Synthesis Techniques for Digital Systems. Macmillan New Electronics Series. Palgrave, London. https://doi.org/10.1007/978-1-349-22267-4_4
Download citation
DOI: https://doi.org/10.1007/978-1-349-22267-4_4
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-55569-9
Online ISBN: 978-1-349-22267-4
eBook Packages: EngineeringEngineering (R0)