MIME 4450 Lec 4 9 10 26

Overview

The class introduces Boolean digital logic as a practical foundation for PLCs, distributed control systems, and function block diagram programming, covering gates, Boolean expressions, De Morgan’s theorem, ladder logic, and Karnaugh maps. It also connects logic design to engineering practice: verify data error protection, test every circuit before startup, and prioritize working, reliable systems over unnecessary simplification.

Key takeaways

Gray-code absolute encoders change one bit per position step, limiting a misread caused by sensor timing differences to one count.
Industrial measurement data needs error protection: a scale-to-controller connection without checks can silently corrupt financial records.
De Morgan’s theorem makes negated control conditions manageable by switching AND and OR while negating each input.
A working Boolean program should still be tested circuit by circuit before startup, including every input, output, and controller response.
Practical control engineering combines programming with equipment selection, specification writing, mechanical and electrical understanding, and process planning.

Chapters

0:00 Course Schedule, First Quiz, and Lab Access

A digital logic assignment is due the following Tuesday; the first quiz is planned for the end of week three.
The approximately 20-minute, open-notes quiz is worth 50 points and covers robotics reading plus several Boolean assignment questions, not relays.
Students have card-swipe access to North Engineering 1100 and keypad access to room 2350 with code 4575#.
Room 1100 contains most robots, PLCs, and vision equipment, but its heat may require switching the order of PLC and robotics work.

6:54 Free Course Texts, Robotics Preparation, and Cross-Disciplinary Skills

Digital logic and robotics texts are available online, avoiding the need to buy books that may cost around $200.
Robotics quiz questions will be basic, such as identifying a robot from a picture; safe-mode speed is given as 250 millimeters per second.
The course combines computers with mechanical and electrical systems and manufacturing processes, so success does not depend on being an expert coder.
The planned course sequence proceeds from robotics to PLCs and vision, with later coverage of Hiwonder ROS robots and possibly databases.

12:20 Gray-Code Absolute Encoders Reduce Position-Reading Errors

A Gray-code absolute encoder changes only one bit between adjacent positions.
If one sensing LED reads slightly ahead or behind the others, the one-bit transition limits the position error to one count.
Traditional absolute encoders often used costly glass disks, while incremental encoders are presented as the more favorable alternative.

14:10 Error Protection and Engineering Ethics in Industrial Systems

A cattle-processing system transmitted scale weights to a central computer without error-code protection, risking incorrect payments to ranchers or the company.
When purchasing equipment, ask what error checks protect its data and how the supplier guarantees that measurements arrive intact.
A separate glass-plant example involved a 460-volt panel with only about 18 inches of working clearance, despite a 36-inch requirement discussed in class.
The practical response was to alert the project manager, complete the startup, and require the clearance issue to be corrected before another system was installed.

22:16 NOT Gates, Boolean Negation, and Timing Diagrams

An inverter or NOT gate flips a Boolean value: 1 becomes 0 and 0 becomes 1.
Negation can be shown with an overbar, a dot, or a bubble on a logic symbol; each represents the opposite of variable A.
A timing diagram places time on the horizontal axis and tracks a signal as it switches between zero and one.
Timing diagrams can show how signals change over seconds, milliseconds, or microseconds.

26:15 AND, OR, and Exclusive-OR Gate Behavior

An AND gate outputs 1 only when all its inputs are 1; an OR gate outputs 1 when at least one input is 1.
An exclusive-OR outputs 1 when exactly one of its two inputs is 1, not when both are 1.
The spoken words “and,” “or,” and “this or that but not both” map directly to these Boolean functions.
An AND symbol can be represented in function-block notation with an ampersand, while an OR can be represented by a greater-than-or-equal-to-one condition.

31:00 NAND, NOR, Function Blocks, and Programmable Logic Devices

A NAND is an AND followed by negation, and a NOR is an OR followed by negation.
Function Block Diagram (FBD) uses connected logic blocks and appears in PLC and Distributed Control System programming.
FBD is one of several graphical control languages, alongside ladder logic; vision-system programming can also use sequential graphical blocks.
Programmable logic arrays and PAL or GAL chips can implement logic functions, although this course focuses on computer-programmed controllers.

38:00 Boolean Variables Across Equations and Control Languages

Boolean variables such as A, B, and C represent real inputs like limit switches or valves, each treated as zero or one.
The expression A AND B AND C = D can be written with Boolean notation, words, a ladder diagram, or an FBD block.
Procedural programming languages express the same relationship with assignments such as D equals A AND B AND C.
The control platform changes the notation, but the underlying logic function remains the same.

41:03 Boolean Simplification Rules and the Practical Test of Whether Logic Works

Boolean algebra includes associative, distributive, identity, and other rules, but students are not expected to memorize the full set.
A AND 1 simplifies to A, while A AND NOT A is always zero because a signal cannot be both on and off.
The practical priority is that a control program works; if a fault appears once, investigate and fix it because the failure can recur.
Logic simplification is useful to know, but excessive rewriting is not necessary when the existing program works reliably.

49:00 De Morgan’s Theorem Converts AND and OR Under Negation

Negating an AND expression changes the operator to OR and negates each input: NOT(A AND B) equals NOT A OR NOT B.
Negating an OR expression changes the operator to AND and negates each input: NOT(A OR B) equals NOT A AND NOT B.
The working rule is to break the overbar, switch AND to OR or OR to AND, and negate each term.
This method is especially useful when a control task requires the negative of a complicated Boolean condition.

52:19 Building a Seven-Stage Traffic Signal Sequence in Ladder Logic

A chain of timer outputs T1 through T6 creates sequential time delays that can drive a simple traffic-light cycle.
Combinations such as T1 active and T2 inactive can represent individual signal phases; red can be derived as the negation of green and yellow together.
A pedestrian request adds a seventh timer for an all-red walk interval, with a seal-in circuit holding the request until the sequence resets.
De Morgan’s theorem rewrites reset conditions into ladder logic without requiring an extra intermediate variable.

59:07 Control-Programming Careers and De Morgan Logic in Practice

Control engineers may spend only 30 to 50 percent of their time programming; equipment selection, specifications, and system planning take substantial time too.
Experience with PLCs, robots, or vision systems can improve hiring prospects and pay, even when programming is not a full-time responsibility.
A student working on a truck production line faced a reported cost of $45,000 for each minute without production, illustrating the pressure of startup programming.
Complex negated ladder conditions can be transformed systematically by switching AND and OR and negating each condition.

1:03:04 Truth Tables and Complete Circuit Testing Before Startup

Truth tables enumerate input and output combinations, and feedback from an output to an input can create memory circuits.
Rather than analyzing every possible truth table as a separate exercise, startup requires checking every input, output, and program circuit.
Each circuit must be tested to confirm that field signals arrive correctly and that the controller produces the intended response.

1:05:21 Karnaugh Maps, Logic Minimization, and Assignment Wrap-Up

A Karnaugh map arranges truth-table values so groups of adjacent ones or zeros can simplify a Boolean expression.
Larger groups eliminate more variables; Karnaugh maps suit roughly three or four variables, while Quine–McCluskey methods can handle larger expressions.
Logic minimization is optional when a working design is reliable, since engineering time can be more valuable than reducing the number of Boolean terms.
The digital logic assignment is due Tuesday, and the class ends with a reminder that the current grading arrangement may not always apply.

Summary, takeaways, and chapters were generated by AI from the video's transcript and may contain errors. The video belongs to its creator, Wm_T Evans.