Files in this item
|(no description provided)|
|Title:||Encoding Problems in Controller Synthesis|
|Author(s):||Binger, David Mark|
|Doctoral Committee Chair(s):||Knapp, D.,|
|Department / Program:||Computer Science|
|Degree Granting Institution:||University of Illinois at Urbana-Champaign|
|Subject(s):||Engineering, Electronics and Electrical
|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.
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1992.
|Date Available in IDEALS:||2014-12-17|