Portland State University
School of Engineering and Computer Science
ECE 510 - Future Computing Technologies and Systems
Course Schedule, Fall 2002
Updated January 23, 2002
Wk 
Date 
Subject 
Mandatory
Reading 
Auxiliary
Reading 
Homeworks and Projects
INTRODUCTORY MATERIAL AND REVIEW OF LOGIC SYNTHESIS.
Monday,
September 24
  1. Class organization. Grading. What is logic synthesis.
  2. Projects in general (details of this year projects are on the WWW Page and in other files). What will come in this class?
  3. Review of main design concepts and representation ideas.
  4. Review of Reed-Muller and spectral logic.
  5. Review of CMOS circuit design and low power.
  1. SLIDES: Introduction.
  1. Review of Chuang book.
HOMEWORK 1. Create your own WWW Page for this class. Write about your interests in logic synthesis, logic design, and project ideas for this class.
  1. SLIDES: .
  1. None.
    .
  1. SLIDES: PDF. Introduction to Reed-Muller Logic. Positive Polarity Reed-Muller Forms. Fixed-Polarity RM forms. Kronecker Forms. New families of complex forms.
  2. PAPER in POSTSCRIPT: (Postscript). Perkowski, Chrzanowska, Xu; Lattice Diagrams Using Reed-MUller Logic, RM'97 Lattice Diagrams that use Shannon, Positive Davio and Negative Davio expansions and inverse expansions.
  3. PAPER in PDF: Perkowski, Jeske, New generalization of Lattice Diagrams, MOPS, ICCIMA, Australia, 1998.
  4. PAPER: The same paper in Postscript.
Continue reviewing assigned literature and slides. Read about your project ideas and think.
Wednesday,
September 26
continue review none
Wk 
Date 
Subject 
Reading 
Additional Reading 
Homeworks and Projects
SPECTRAL METHODS AND DECISION DIAGRAMS. IMPLICIT ALGORITHMS.
Monday, October 19
  1. Introduction to Reed-Muller Logic.
  2. Kronecker Trees, Decision Diagrams and forms.
  3. New Families of forms.
  4. Lattice Diagrams for AND/EXOR logic.
  5. Regular Structures based on Symmetry.
  6. Symmetrization of Logic Functions.
  7. Three-Dimensional Regular Structures.
  8. Generalizations to MV logic.
  9. Linearly Independent Logic.
  1. PAPER: Perkowski, Pierzchala, Drechlser, More generalizations of Lattice Diagrams to Linearly Independent and Multiple-Valued Logic
  2. PAPER in POSTSCRIPT: Perkowski, Pierzchala,Drechsler, More generalizations of Lattice Diagrams to EXOR and MV logics. Singapur 1997
  3. SLIDES in POSTSCRIPT: Perkowski,Pierzchala,Drechsler, More generalizations of Lattice Diagrams to EXOR and MV logics.
  4. SLIDES: Families of Linearly Independent Diagrams, Forms and Circuits. Extension to Galois Fields.
  5. PAPER: Generalization of the concept of Kronecker Decision Diagrams to MV diagrams based on LI logic.
  6. POSTSCRIPT: Generalization of the concept of Kronecker Decision Diagrams to MV diagrams based on LI logic.
  7. PAPER: Generalization of the concept of Kronecker Decision Diagrams to MV diagrams based on LI logic. Hierarchy of diagrams.
  8. PAPER: "Multiple-Valued Galois Field S/D Trees for GFSOP Minimization and their Complexity.
.
  1. Applications to Image Compression.
  1. SLIDES: Applications of Linearly Independent Logic to Image Processing, especially texture analysis.
  2. SLIDES: Slides from Paper by Falkowski and Olejnicka.
  3. PDF PAPER: Paper by Falkowski and Olejnicka.
.
Wk 
Date 
Subject 
Reading 
Additional Reading 
Homeworks and Projects
REVERSIBLE CMOS LOGIC.
Monday,
October 8
Wednesday,
October 10
. HOMEWORK 3 assigned.
Wk 
Date 
Subject 
Reading 
Additional Reading 
Homeworks and Projects
DECOMPOSITION AND SYNTHESIS OF REVERSIBLE AND QUANTUM LOGIC
Monday,
October 15
  1. Quantum Computer Simulator using FPGAs
    1. Goran's Proposal about Quantum Computer Simulator using FPGAs and Verilog.
    2. Goran Negovetic Final Report.
    3. Original Goran Negovetic Page.
  2. Modified Genetic Algorithm for Synthesis of Quantum Circuits.
  3. Synthesis of Reversible Logic Circuits from Pseudo-Kronecker Decision Diagrams.
  4. Synthesis of Reversible Logic Circuits using BDDs.
Review the material. No new reading. No new homeworks. Complete past homeworks. Projects are due Sunday. The last day of finals week.
  1. none
HOMEWORK CHALLENGE: only for volunteers.
  1. homework.
Wednesday,
October 17
Reversible and Quantum Logic. . . .
REVERSIBLE AND QUANTUM LOGIC.
Monday, October 22 Presentations of quantum and reversible logic. Project ideas.
  1. 1.concepts-reversible.pdf This file presents slides about introduction to reversible logic and various reversible gates. Concepts of balanced, k*k and conservative logic. Types of reversible logic. Realizations. Optical reversible logic. Billiar Ball Model.
  2. 2.quantum-circuits.pdf This file has very elementary introduction to quantum computing from the mathematical and logic synthesis point of view. This is sufficient for project. More details will follow in part about Quantum Computing.
  3. 3.reversible-logic-synthesis.pdf This file has examples of approaches to synthesis of logic circuits with k*k reversible gates. Synthesis using PKFDDs and fDDs. Decomposition and composition. Ashenhurst-like decompositions. Technology mapping approaches. Levellized Shannon-like expansions. You have to review the respective material from previous lectures to be ready for projects.
  4. 4.fuzzy-reversible.nets.pdf The concept of fuzzy reversible logic. Attemtps at creating fuzzy reversible gates. Synthesis of symmetric and symmetrcized Boolean functions to regular structures of reversible gates called "nets".
  1. All WWW resources on Reversible Logic from March 2001.
  2. Reversible Logic, Lecture 1. SLIDES. PDF Introduction. Linear gates. Feynman gate. Feynman gate is complete.
  3. Use of Fredkin Gate to realize Reversible Symmetric Functions in Regular Structures called "Nets".
  4. PDF. SLIDES Motivation of research in reversible computing. How long will Moore's Law work and what will happen if it will not. Research Problems in Reversible and Quantum Computing. Information is physical. Overview of reversible gates. Feynman gate and linear circuits. Structures. How to build reversible adders systematically. Implications of reversibility. Fredkin Gates.
  5. PDF. Slides. From lattices to reversible regular structures. Binary and Multiple-Valued. Towards new regular structures realized in reversible logic. A collection of many new project ideas. Open research problems. Possible usages of lattice-like structures of reversible gates.
  6. PDF. Paper. First version of the paper for Euro-Micro 2001 conference. Perkowski, Kerntopf, Jeske, Mishchenko, Song, Al-Rabadi, Jozwiak, Coppola and Massey (PQLG), "Regular Realization of Symmetric Functions using Reversible Logic". This paper discusses nets realized MV Picton gate.
  7. paper for conference in Lake Tahoe, 2001. PDF. Perkowski et al. "Regularity and Symmetry as a Base for Efficient Realization of Reversible Logic Circuits". This paper is an improved variant that uses Kerntopf gates and proposes the concept of Reversible FPGAs.
  8. PAPER: Abrams and Llyod - Nonlinear quantum mechanics implies polynomial-time solution for NP-complete and #P problems.
.
. . .
Wednesday, October 24 Continuation on reversible logic synthesis ADDITONAL SLIDES WILL BE GIVEN. . .
REVERSIBLE AND QUANTUM LOGIC.
Monday, October 29 Further presentation of quantum and reversible logic and projects.
  1. SLIDES: Victor Varshavsky, Paper about logic synthesis for quantum logic.
  1. Review all reversible and quantum material. Review all other slides useful for solving exam problems. Review LISP and especially rule-based programming and recursion.
  1. nothing new. Improve your project presentations quality.
. . . .
Wednesday, October 31 Continuation on general logic synthesis problems related to reversible and quantum logic synthesis. EXAM PROBLEMS. Please return on or before Monday, November 19. Slides in PPT are preferred, but other format is OK. Word is OK. Give good explanation to each problem, it is not enough to draw a figure or write a formula, show how you derive solutions, step by step. Everybody can solve as many problems as possible. A total of 150 required for an A grade. . .
STUDENT PRESENTATIONS OF PROJECT IDEAS. LISP PROGRAMMING FOR LOGIC SYNTHESIS.
Monday, November 5 Student project presentations.
  1. Goran Negovetic.

Here are LISP lectures and examples.

ALL LISP RESOURCES
  1. Here is the paper about new ideas in Genetic Algorithms for Martin's group.
  2. Here is the thesis of Younis about reversible logic realization.
. .
Wednesday, November 7 . . .
8  
DNA CIRCUITS .
Monday, November 12
  1. Reversibility of DNA circuits.
.
Wednesday, November 14
.
Wednesday, November 21
. .
9  
QUANTUM COMPUTATIONAL LEARNING.
Monday, November 19
  1. Quantum Neuron.
  1. Quantum Associative Memories.
  2. Quantum Spectral Memories.
  3. Quantum Neural Networks.
  4. Quantum DNF Learning.
  1. Quantum Dot Automata Learning.
Continue working on project and discussing with Dr. Perkowski.
Wednesday, November 21
  1. Quantum Dot Automata Learning.
  1. Quantum Dot Automata Learning. Additional reading.
10 
QUANTUM COMPUTATIONAL LEARNING.
Monday, November 26
  1. Quantum Neuron.
  1. Quantum Associative Memories.
  2. Quantum Spectral Memories.
  3. Quantum Neural Networks.
  4. Quantum DNF Learning.
  1. Quantum Dot Automata Learning.
Continue working on project and discussing with Dr. Perkowski.
Wednesday, November 28
  1. Single Electron Transistors.
  1. Single Electron Transistors Reading List.
    1. Hideki Hasegawa. Quantum Devices and Integrated Circuits....
    2. Yu, Dutton and Kiehl, Circuit/Device Modeling at the Quantum Level.
    3. Goldhaber-Gordon et al, Overview of Nanoelectronic Devices.
    4. Hossam Aly Hassan Fahmy, Novel Digital Structures Utilizing Single Electron Devices.
    5. Research in NTT.
    6. H. Inokawa, A. Fujiwara, and Y. Takahashi, A Multiple-Valued SRAM with Combined Single-Electron and MOS Transistors, NTT Basic Research Laboratories. SET logic synthesis fundamentals. Useful for project.
    7. P. Hadley, SET Logic. SET - short overview
    8. Hiroshi Inokawa, Akira Fujiwara, and Yasuo Takahashi, A Multiple-Valued Logic with Merged Single-Electron and MOS Transistors, NTT Basic Research Laboratories, NTT Corporation
    9. Goldhaber-Gordon, Overview of Nanoelectronic Devices
    10. Henk Van Houten, The physical basis of digital computing, Philips Labs in Eindhoven.
    11. Christian Lang. PHD. thesis. Synthesis with Multi-valued gates using decomposition. Applicable to SET.
    12. Fault Tolerant Techniques for Nanocomputers Very good information about set logic synthesis for the project.
    13. D.J. Paul, Nanoelectronics. Cavendish Laboratory, Cambridge University. U.K.
    14. Adrian Thompson and Christoph Wasshuberya, Design of Single Electron Systems through Artificial Evolution
    15. Adrian Thompson, Christoph Wasshuber, Evolutionary Design of Single Electron Systems
    16. Y. Takahashi, A. Fujiwara, Y. Ono, and K. Murase, Silicon Single-Electron Devices and Their Applications, NTT Basic Research Laboratories
  1. Quantum Dot Automata Learning Projects.
Continue working on project and discussing with Dr. Perkowski.
11 
PROJECT PRESENTATIONS AND FINAL EXAM.
December 3 Presentation and discussion of projects. links to student www pages with projects. none You have to complete projects and their presentations.
How to write the project report.
no new homework. work on project report and slides. Everybody has to return 4 homeworks out of all those assigned.
. .
December 5 Student presentations. links to student www pages with projects. none .

Homeworks are due one week from their assignment, unless told otherwise.





BACK TO MAIN PAGE OF Professor Marek Perkowski.


You can reach me at
mperkows@ee.pdx.edu