ECEC 511 Combinational Circuit Design 3.0 Credits
Representing arithmetic. Logic and syntax data for machine processing. Switching algebra: Boolean and multiple values. Identification and classification of functions. Realizing completely specified and incompletely specified Boolean functions. Issues in designing large communication/control Boolean functions. Fault and testing of Boolean function.
Repeat Status: Not repeatable for credit