CSCI 235 — Computer Engineering 0.01

Applied digital logic

It’s all links.

• Boolean logic
  • Boolean Miscellany
  • Logic gate symbols
  • The NAND (or ↑) does everything
  • Canonical forms (spreadsheet)
  • Implementation of the NAND
  • Minimization
    • Karnaugh map
    • Prime implicants in Spring 2002
    • Using interface to espresso CGI BROKEN use EE382N manual
    • Getting the best solution: It’s a $1,000,000 problem
  • Getting a solution: Avoid the $475,000,000 mistake
• Finite State Machines
  • FSM are the simplest automata — Take CSCI 344, Theory of Computation
  • FSM in CSCI 255
  • JavaScript regular expressions
  • Flip-flops store the state
• Early attempts at designing chips with programs
  • MIT 1978 course
    • Learning VLSI in the distant past
    • Inverter on page 4
    • Lots of NORs in NMOS
    • Lynn Conway
  • Magic by John Ousterhout
  • MCNC’s Vertically Integrated Symbolic Design System — used at UNC Asheville by Wayne Lang
• Implementations for today
  • Microcontrollers
    • A $1 PIC 12
    • A $2 AtMega328P as found in the Arduino
  • The FPGA, such as the Cyclone 10
    • Build your Finite State Machine in VHDL
    • SystemVerilog example from Spring 2014 CSCI 320
      • Ancient Times
      • Ancient Times testbench
    • OpenCL
    • Python based MyHDL
    • Use some open cores