Matlab Demonstrations of Algorithms used in Class

These are matlab programs written by Yu Hen Hu to demonstrate some algorithms used in ECE 556 Design Automations for Digital Systems. These are copy-righted materials belong to the board of regent of University of Wisconsin Systems. You are welcome to use these program for non-commercial purposes as long as the copy-right notices in the program are kept and proper acknowledgement (URL: http://homepages.cae.wisc.edu/~ece556/matlab/) is given. The author will not be responsible for technical support. However, improvement of these programs as well as correction notices will be gratefully accepted.

• bingreedy.m -- Demonstration of the four greedy approximation algorithms: first fit (FF), best fit (BF), first fit decreasing (FFD), and best fit decreasing (BFD) for the one- dimensional bin-packing problem.
• kldemo.m -- Demonstration of the Kernighan-Lin bi-partition heuristic algorithm using two circuit examples.
• fmdemo.m -- Demonstration of the Fiduccia-Mattheyses Heuristic Multi-terminal net Bi-partition Algorithm.
  netlist.m: netlist of Figure 2.8, pp. 60 in the text book that is also used as the demonstration example.

Back to the homepage