Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Fast transform procedure for the generation of near-minimal covers of Boolean functions

Fast transform procedure for the generation of near-minimal covers of Boolean functions

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings E (Computers and Digital Techniques) — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Electrical Engineers
Published
Errata or comment

A new and efficient technique for the generation of near-minimal covers of Boolean functions is described. For the identification of all prime implicants covering a particular minterm, use is made of a fast in-place transformation. Crucial points in such covering procedures are the decision which of the minterms to process next and which of its prime implicants to use in the near-minimal cover. Both these problems are handled by a weighting transformation. A computer program QUAMIN, implementing the method, has been compared to other programs. It is shown that the new method performs well with respect to accuracy, computer time and storage requirements.

Inspec keywords: Boolean functions

Other keywords: near-minimal covers; Boolean functions; QUAMIN; identification; weighting transformation

Subjects: Formal logic

References

    1. 1)
      • S.J. Hong , R.G. Cain , D.L. Ostapko . MINI: A heuristic approach for logic minimization. IBM J. Res. & Dev. , 443 - 458
    2. 2)
      • Besslich, Ph.W.: `A WHT method for generation and processing of subsumed and averaged data', Paper presented at the 1980 IEEE International EMC symposium, Baltimore, MD, USA.
    3. 3)
      • Shiva, S.G., Nagle, H.T.: `A computer aided procedure for complete design of sequential machines', AU-T-26, Project THEMIS report, 1973.
    4. 4)
      • R.J. Lechner , A. Mukhopadhyay . (1971) Harmonic analysis of switching functions, Recent developments in switching theory.
    5. 5)
      • P.S. Noe , V.T. Rhyne , S. Suraratrungsi . Comments on ‘Weighting method for the determination fo the irredundant set of prime implicants’. IEEE Trans.
    6. 6)
      • P.W. Besslich . Anatomy of Boolean-function simplification. IEE J. Comput. & Digital Tech. , 1 , 7 - 12
    7. 7)
      • R.S. Michalski , Z. Kulpa . A system of programs for the synthesis of switching circuits using the method of disjoint stars. Inf. Process. Lett. , 61 - 65
    8. 8)
      • H.T. Nagle , B.D. Carrol , D.J. Irwin . (1975) , An introduction to computer logic.
    9. 9)
      • V. Bubenik . Weighting method for the determination of the irredundant set of prime implicants. IEEE Trans. , 1449 - 1451
    10. 10)
      • Pichlbauer, P.: `Vergleich verschiedener Verfahren zur Minimierung Boolescher Funktionen unter besonderer Berücksichtigung eines Transformations-Verfahrens', 1981, Diplom-Arbeit Master thesis, University of Bremen.
    11. 11)
      • B. Dunham , R. Fridshal . The problem of simplifying logical expressions. J. Symbol. Logic , 17 - 19
    12. 12)
      • Z. Arevalo , J.G. Bredeson . A method to simplify a Boolean function into a near minimal sum-of-products for programmable logic arrays. IEEE Trans. , 1028 - 1039
    13. 13)
      • P.W. Besslich . On the Walsh-Handamard transform and prime implicant extraction. IEEE Trans. , 516 - 519
    14. 14)
      • N.N. Necula . An algorithm for the automatic approximate minimization of Boolean functions. IEEE Trans. , 770 - 7782
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-e.1981.0049
Loading

Related content

content/journals/10.1049/ip-e.1981.0049
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Errata
An Erratum has been published for this content:
Erratum: Fast transform procedure for the generation of near-minimal covers of Boolean functions
Print this page
This is a required field
Please enter a valid email address