Skip Navigation

The Computer Journal 1990 33(4):375-380; doi:10.1093/comjnl/33.4.375
© 1990 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Miyakoshi, H.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A Literal Code Method For Minimizing Boolean Functions

H. Miyakoshi *

Atsubetsu-Higashi 2-5-4-15, Shiroishiku, Sapporo City, Hokkaido, Japan 004

This paper describes a method for deriving minimal sums of Boolean functions. The method, unlike most others, does not assign numerical values to minterms. Instead it deals with minterms and terms directly by means of literals. The use of literals lends itself to an algebraic approach. The speed and efficiency of the calculations make the method suitable for handling functions of a relatively high number of literals.

Received September 1987. revised April 1990.

* Atsubetsu–Higashi 2-5-4-15, Shiroishiku, Sapporo City, Hokkaido, Japan 004


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.