Besides returning answers to these two questions, you have to return the complete project description, whether the project is completed or not. All materials should be PPT presentations.

Power Point Presentations based on class material and/or additional reading.


Present not less than 10 slides for each topic. Better discuss less material but with more detail. Pay attention to practicality of examples. Each topic presentation should include examples that are created by you and not taken from my lecture, previous presentations of other students or literature. Show your creativity by proposing new ideas and formulations. Do not be afraid of crazy ideas. Try to generalize and systematize knowledge that you get in the class and in projects. You have to cite in full detail all used literature, lectures, WWW Pages, and previous student presentations. All necessary information or links to other pages are somewhere in my WWW page, either in the class material or in research sub-pages.
HUNT IN THE JUNGLE!


DO NOT COLLABORATE! EVERYBODY SOLVES ON HIS OWN. NO COMMUNICATION ABOUT THESE PROBLEMS IN ANY WAY!

  1. Nouraddin Alhagi
    1. Present realization technologies for binary digital logic. Requirements for design: power, area, speed, testability, manufacturability. Requirements for comprehensive design automation systems. PLD, PAL, standard cell, FPGA, custom design. Show examples. Describe an ideal design automation system.
    2. Characterize in uniform way Boolean and Multiple-Valued Functions: Literals, tables, diagrams. Post Literals, Generalized Literals and Universal Literals for MV logic. Show your own examples. Why we need Multi-valued Logic? How it is realized?

  2. Seyda Mohsina Afroze
    1. Describe in a uniform way the following basic Combinatorial Algorithms: Set Covering (Unate Covering), Covering/Closure (Binate Covering), Graph Coloring, and Maximum Clique. Show examples. Show reductions of one problem to another. Do not discuss algorithms, only the problem formulation and examples. Discuss applications. Why are these problems fundamental in logic design?
    2. Genetic Algorithms and their applications in digital design. Do not discuss Genetic Programming and Evolutionary Programming, only GA. Their advantages and disadvantages. Try to have your own opinion rather than take the opinion of GA advocates (Hugo De Garis, Julian Miller, Prof. Koza from Stanford) or sceptics (U.C. Berkeley, Perkowski).

  3. Xiong Wei
    1. Representation of Multiple-Valued Functions using Decision Diagrams. Do not discuss binary functions, only MV functions. Links to image processing and pattern recognition. Give examples. Describe applications.
    2. Linearly-Independent Logic and its applications in image processing. Give examples. Try to be as general as possible in your choice of spectral transforms. What is the basis mathematical fundament of these methods. Links of logic synthesis and image processing through spectral theories.

  4. Steven L. Harwood.
    1. Shannon, Positive and Negative Davio expansions. SOP and Positive Davio (Reed-Muller) Canonical forms. Shannon Trees, Positive Davio Trees. Flattening of Trees to canonical forms. Decision Diagrams. Give examples.
    2. Carry-Look-Ahead ideas. Give examples. Practical uses of such circuits. Can these ideas be generalized for another iterative circuits? How?

  5. Andrew Iverson.
    1. Combinational multipliers. Their optimization. Uses in design of system. Give practical examples.
    2. LFSR and MISR circuits and their uses. Design problems. Applications. Give practical examples.

  6. Jacob Lee Boles
    1. EPLDs and FPGAs. Xilinx, Altera, Motorola, Lattice, Atmel. Discuss briefly main families. Their advantages and disadvantages.
    2. State Assignment: based on rules and hypercubes. Based on partitions and partition pairs. The multi-line method. Examples other than given in the lecture and Friday meetings. Solve the same example using two methods and compare. Draw conclusions. You can use any book or paper, but the examples must be your own.

  7. Dipal Shah
    1. Multi-level Minimization of binary logic based on BDD-based methods and multiplexers. Show examples. Be practical.
    2. Symmetric functions and their representation. Their applications. Show examples. Layouts, circuits, notation, synthesis methods. (Kohavi, lecture, other sources in my WWW page).

  8. Anas Al-Rabadi
    1. Generalized Green/Sasao hierarchy for Multi-valued logic. There are many papers written by me (with references to previous papers) on my WWW page.
    2. Functions, relations. Tabular representation of functions and relations. Practical examples. Introduction of Labeled Rough Partitions from tables. There are many papers written by me (with references to previous papers) on my WWW page. In my papers there are some practical examples of relations. Try to find problems in robotics that would generate relations.

  9. Jim Merhout.
    1. Functional Decomposition for Machine Learning, Main problem formulation and its variants, comparison with decision trees, neural nets, SOPs and other learning methods. What is Data Mining? How is it related?
    2. Present all known to you expansions and trees for Reed-Muller Logic. Characterize them in a uniform way. How these can be applied to circuit synthesis for sub-micron technologies? Why BDDs will be not enough? Think about multipliers and other practical examples.

  10. Justin Richard Kam
    1. Machine Learning versus Self-Repair. Using knowledge from the class, try to speculate on future robots with self-repair in hostile environment. Compare learning methods in an environment that permanently damages the chip (for instance by radiation).
    2. Multi-level networks and rule-based systems. Give practical examples.

  11. Allen Taylor
    1. Variable Partitioning problem in Decomposition.
    2. Tree as a starting point to flattened canonical forms, non-canonical expressions, and Decision Diagrams. Discuss binary and multi-valued cases in a uniform way. Try to create a systematic methodology and characterization.

  12. John Crow
    1. Genetic Programming in Logic Synthesis, particularly in Multi-valued logic. Do not discuss other probabilistic methods, only Genetic Programming. Advantages and disadvantages. Can we combine GP with Decomposition? How?
    2. Boolean networks and don't cares. External and internal don't cares. Show examples.

  13. Mahendra Boopathy
    1. Reed-Muller expansions and EXOR Circuits. Basic formulas for EXOR logic. Applications.
    2. Self-repair on system level.

  14. Esteven Randall Hutsel
    1. Machine Learning for robotics, especially using Constructive Induction. Give practical examples of applications, do not take them from Anas presentation or my papers.
    2. Self Repair of Digital logic and systems. Basic ideas and applications.

  15. Ana Stefanovic
    1. Technology Mapping. Show examples.
    2. Main ideas of Machine Learning and Data Mining, especially using logic.

  16. Leonardo Lecca
    1. Trees and Diagrams: Kronecker-type, versus pseudo-Kronecker-type, versus Free, versus Lattice Expansions. Show your own examples.
    2. Multi-level networks and rule-based systems. Show your own examples.