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 with CMOS
  • Minimization
    • Karnaugh map
    • Using interface to espresso
    • Getting the best solution: It’s a $1,000,000 problem
  • Getting a solution: Avoid the $475,000,000 mistake
  • An aside
    • Learning VLSI in the distant past
    • Inverter on page 4
    • Lots of NORs in NMOS
    • Lynn Conway
• Finite State Machines
  • FSM are the simplest automata — Take CSCI 344, Theory of Computation next Fall
    • FSM in CSCI 255
    • JavaScript regular expressions
  • Flip-flops store the state
• Affordable implementations for today
  • Microcontrollers
    • Use the $2 ATmega328P found in the Arduino
    • Use a $1 8-bit PIC12LF1822 processor
    • Use a $4 32-bit PIC32MX250F128 processor
• The FPGA, such as the Cyclone V
  • 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