PRONTO programs for product term reduction Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/xs55mh28m

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • PRONTO is a direct, one-pass heuristic method designed to shrink the size of reducible programmable logic arrays. Several people have contributed to the design, and translation to a computer program, of this attempt to produce a good solution quickly. This thesis discusses efforts to improve PRONTO's implementation in order to achieve a fast and efficient solution. The principal feature examined is the time complexity of the algorithm by which the dominant time-growth factors are identified. The execution time of PRONTO was estimated from the PLA's tangible characteristics (i.e. the number of product terms, input bits and output bits) and the size of the resulting reduced PLA. It was found that, for a small set of examples, execution time varies almost linearly with the value [Solution size * Specification size * number of output bits]. The PRONTO algorithm is built of four major parts. The first selects a base product term that is most favorable for expansion. The second finds a set of the most likely expansion directions. The third expands the base product term in those directions. The final part updates the solution and the specification arrays. Three alternative implementations were investigated for the tree search process of expanding a base product term. The tree expansion method chosen is a combination of a preorder and a level-order traversal method.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi (Monochrome) using ScandAll PRO 1.8.1 on a Fi-6770A in PDF format. CVista PdfCompressor 5.0 was used for pdf compression and textual OCR.
Replaces
Additional Information
  • description.provenance : Submitted by Kim Stowell (ksscannerosu@gmail.com) on 2013-07-02T17:09:35Z No. of bitstreams: 1 AbwehNaelN1986.pdf: 643452 bytes, checksum: c61ac9571286bdeeb17e7e840d9f7c36 (MD5)
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2013-07-02T18:45:04Z (GMT) No. of bitstreams: 1 AbwehNaelN1986.pdf: 643452 bytes, checksum: c61ac9571286bdeeb17e7e840d9f7c36 (MD5)
  • description.provenance : Made available in DSpace on 2013-07-15T16:23:08Z (GMT). No. of bitstreams: 1 AbwehNaelN1986.pdf: 643452 bytes, checksum: c61ac9571286bdeeb17e7e840d9f7c36 (MD5) Previous issue date: 1985-06-27
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2013-07-15T16:23:08Z (GMT) No. of bitstreams: 1 AbwehNaelN1986.pdf: 643452 bytes, checksum: c61ac9571286bdeeb17e7e840d9f7c36 (MD5)

Relationships

Parents:

This work has no parents.

Last modified

Downloadable Content

Download PDF

Items