Directed search minimization of multiple-output networks

Simple item page
dc.contributor.authorSerra, Micaelaen_US
dc.date.accessioned2024-08-15T18:21:29Z
dc.date.available2024-08-15T18:21:29Z
dc.date.copyright1984en_US
dc.date.issued1984
dc.degree.departmentDepartment of Computer Science
dc.degree.levelMaster of Science M.Sc.en
dc.description.abstractGiven a switching function, a two-level sum-of-products ex­pression is often a useful representation for it. A defini­tion for a minimal cost of realization for a circuit can be agreed upon and techniques exist to produce a minimal or quasi-minimal expression. Often several switching functions of the same input variables have to be realized in a network. Most of the time the· simultaneous synthesis of all the outputs yields more economical results than their separate designs, since the sharing of gates can reduce costs considerably. While there are numerous techniques to minimize single-output functions, few are feasible for extension to multiple-output problems of any size. A new method for single functions was introduced by Rhyne, Noe, McKinney and Pooch in 1976,-called DSA, for Directed Search Algorithm. It has the considerable advantage of not needing to generate all possible prime implicants of a function before being able to choose the essential ones for the coverage.
dc.format.extent164 pages
dc.identifier.urihttps://hdl.handle.net/1828/19634
dc.rightsAvailable to the World Wide Weben_US
dc.titleDirected search minimization of multiple-output networksen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
SERRA_MICAELA_MSc_1984_144694.pdf
Size:
8.57 MB
Format:
Adobe Portable Document Format
Download

Collections

Electronic Theses and Dissertations (ETD)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.