This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/72062
Description
Title
Encoding Problems in Controller Synthesis
Author(s)
Binger, David Mark
Issue Date
1992
Doctoral Committee Chair(s)
Knapp, D.,
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Engineering, Electronics and Electrical
Computer Science
Abstract
High-level synthesis systems design circuits that consist of a datapath and a controller. The datapath is a network of modules that is capable of performing the specified behavior. The controller is a circuit that delivers the proper sequence of control signals to the modules of the datapath. The activity in which the controller is designed is known as controller synthesis. Controller synthesis is important because controllers can take up a large fraction of the total circuit area and so contribute substantially to production cost.
Controller synthesis begins with a specification of the controller as a multiple-output multiple-valued logic function. To build the controller circuit, binary codes are selected to represent the multiple-valued logic values. The selection of representative binary codes often has a substantial impact on the quality of the final circuit. In encoding problems, the goal is to select representative binary codes for which the value of some objective function is optimal.
This thesis addresses several encoding problems that arise in controller synthesis. One encoding problem addressed in the thesis is a variation of the state assignment problem where the target circuit includes a counter. Other encoding problems considered in the thesis try to find encodings for which the results of a minimization procedure called column compaction are optimal. The thesis includes a detailed explanation of column compaction, and a novel algorithm for optimal column compaction.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
