PHYS 217: Digital Electronics -- Spring 2016

HH = Horowitz and Hill: The Art of Electronics
 B = Barnaal: Digital and Microprocessor Electronics for Scientific Application
AW = from http://www.physics.csbsju.edu/~awhitten/phys217.html
 P = problems.pdf
EM = http://www.physics.csbsju.edu/217/electric_measurement.pdf

Note: "thru" and "-" mean through and including, so a reading assignment of 
"12.2-12.3" means read all of both sections, including, for example, section 12.3.9

Topic Basic stuff:
EM: read all; problems 9, 10, 11, 16, 21
IF you have not completed PHYS 370:
do the pre-lab exercise described on p.8 (same as problem 20, p. 16): turn it in
before the first lab!
HH: 1.1-1.2.3, 1.6.1, 1.9.1, 1.9.4B, 1.9.5A, 1.10-1.10.1 + Appendix O

Topic: Binary/octal/hex bases and conversion:
AW: number-systems-sol.pdf (under "In-Class Activity Solutions")

HH: 10.1-10.1.3; Exercises: 10.1, 10.2, 10.3
P: 1-4

Topic: Gates:
HH: chapter 10: thru: 10.1.6

Topic: Boolean Algebra
AW: logic-applications-sol.pdf  (under "In-Class Activity Solutions")

HH: 10.3-10.3.2; Exercise: 10.13 
P: 5,10,11,12

---above due Monday 18-Jan---

Topic: Some chip details for lab1 (browse):
HH: p.706, Figures: 10.26, 10.27, 12.2, 12.3, 12.4, 12.5, 12.6, 12.7, 12.8, 12.9
important point: interconnecting different families *may* cause problems

Topic: given a truth table, express it as a simple boolean expression.
minterm=SOP, maxterm=POS
Karnaugh maps=K-map

Read HH: 10.3.2

HW:
HH Exercise: 10.14 (already done; no need to do again), 10.15 (p.724)
P: 14,45d-f, 
old exam (2014/217t1_14.pdf) 1,3

print out the file: http://www.physics.csbsju.edu/217/7segs.pdf
which shows 7 K-maps (for driving each segment a-g of a 7 segment display,
see 7-segments.html for further info) from an inputted
4-bit binary number: ABCD.  In 7segs.pdf the don't care states are 
shaded green (FYI: they correspond to unneeded binary numbers beyond 9, like 10=1010).
Directly on your hardcopy label/report what Boolean expression is
represented by each circled block of 1s.

Topic: standard packaged functions: (HH 10.3.3)
decoders, (priority) encoder
multiplexers, demultiplexers
analog switches (CMOS)
arithmetic chips: adders, comparators, floating point processors, programmable logic devices

Topic: a (very small) bit about the inside of ICs
Read: HH 12-12.1.2

P: 8

Topic: sequential logic (HH 10.4-10.5.1)
Flip FLops: SR, D, JK
edge and level triggering

problems.pdf: 51,52,17-18, 20

---above due Monday 25-Jan---

word problem to TT
P: 25

JKFF circuit (practice the TT)
HW: old exam: #6

Topic: design a circuit that follows any given state diagram
HH: 10.4.3
HW: HH: Exercises: 10.23, 10.24, old exam: #4, #5
P: 38

Topic: Some chip details for lab: tri-state, open-collector
HH: read: 10.2.4
switch bounce: HH 10.4.1.A

Topic: trick: arbitrary truth table via Mux (Mux as ROM)
P: 48

Topic: sequential logic: standard packaged functions: (HH 10.5)
registers, counters, shift registers

problems.pdf: 26,30

Topic: real problems HH 10.8

READ: HH chapter 10 review

Topic: programmable logic devices
READ: HH 10.5.4, 11-11.2, 11.4

---above due Monday 1-Feb---
problems.pdf: 21a, 27

Note: all the above is the content for the midterm exam on Feb 10
(I've given myself lots of time to grade and return the above homework before the midterm exam.)
Below we talk (mostly in theory) about computers.
Dealing with actual microcomputer hardware is the topic of PHYS 358
Dealing with programming desktop computers is the topic of many CSCI courses.
Here we deal with how a computer might be constructed "in theory"---leaving out all
of the practical details.  The aim is to see a CPU as just a super-complex version of
a JKFF: a state machine with controls.

HH has much more computer content than I intend to teach.  Below I distinguish between
READing (i.e., re-read until you understand), SKIMming (i.e., reading once with imperfect understanding),
and SS (super skim) (i.e., picking up keywords from section titles, looking at figures).

READ: 14-14.1.6
SKIM: 14.2-14.2.2
READ: two paragraphs that start 14.3
SS: 14.3.6-14.3.10 (notice the importance of the words: interrupt and DMA)
SKIM: 14.4-14.4.6
SKIM: 14.6.3-14.7.8 Note: PCI, SATA, GPIB, RS-232, SPI, I2C (play with the last two in 358)
SKIM: 14.7.13-14.7.16 Note: USB, Ethernet, CAN (play with the last in 358)
SKIM: 14.8
SKIM: chapter review

HW: computers.pdf: 1,2

P: 44 Y-g (provide a sentence defining these terms)

Topic: comparators, Schmitt triggers
HH 4.3.2A-B
SKIM: HH 12.3

P: 34

Topic: timing chips: 121 (HH 7.2.2), 555 (HH 7-7.1.3), VCO (HH 7.1.4.D)
P: 31,32,36

Topic: quartz oscillators HH 7.1.6-7

---above due Monday 8-Feb---

problems.pdf: 33,35

Topic: period and frequency meters

Topic: DAC & ADC

HH chapter 13: 13-13.2.5,  13.2.11, 13.5-13.6.1, 13.7, 13.8.2-13.8.5.2, Review: A,B,D,E,G

Topic: transducers

---above due Monday 15-Feb---

Overall Topic: Digital Signal Processing (DSP)

Topic: complex numbers

read: complex_review.pdf
HW: complex_review.pdf #2, #3

Topic: Fourier Transform

HW: FourierFun.txt

SKIM: HH Appendix I
---above due Monday 22-Feb---
Q: Assume you sampled every 0.1ms (i.e. Delta =10^-4 sec) for N=1024 total samples,
so the total time sampling was about 0.1 sec, and then made a Fourier Transform (FFT).
What is the actual frequency (in Hz) of the first non-DC FFT component, 
i.e., the one Mathematica reports in Data[[2]].

Topic: Digital Filters

read from class web site:digital_filter.pdf

HW: problems.pdf: 40-43,59