Digital Logic Circuits
Learn how digital circuits select inputs, store state and move data through concepts and hands-on RTL examples.
Bạn sẽ học được gì
- Explain combinational circuits using binary numbers, gates and Boolean algebra
- Calculate adder, comparator and signed arithmetic boundary cases
- Implement a MUX, counter and shift register and compare waveforms
- Complete a small design using state machines, timing constraints and a verification plan
Trước khi bắt đầu
Đọc lý thuyết trong trình duyệt. Với bài thực hành, chuẩn bị dự án Desktop của Digital Design Studio và quyền chạy. Có sẵn mã nguồn và tệp đầu vào.
Cài đặt và chạy lần đầu ↗Chương trình học
- Foundations of digital logic
- Binary and hexadecimalKhái niệm
Represent the same value in binary and hexadecimal.
- Gates and truth tablesKhái niệm
Compare the output rules of AND, OR, NOT and XOR.
- Boolean algebra and De Morgan’s lawsKhái niệm
Check whether different expressions produce the same output.
- Decoders and enable signalsKhái niệm
Turn a binary address into one active output.
- Signals and selection
- Bits, signals and portsKhái niệm
Identify inputs, outputs and the meaning of one-bit values.
- Specify the selection with a truth tableKhái niệm
List every input combination and define its expected output.
- The MUX and its observation registerKhái niệm
Distinguish a combinational output from a sampled output.
- Write and run the RTL
- Describe a MUX with a conditional expressionKhái niệm
Connect the select signal and data inputs in RTL.
- MUX simulation labThực hành
Compare outputs using the provided source and input files.
- Interpret and check
- Input changes and sampling instantsKhái niệm
Track y and sampled_y before and after a clock edge.
- Test the cases that reveal mistakesKhái niệm
Choose cases that reveal reversed selection and sampling errors.
- MUX knowledge checkKiểm tra
Check your understanding of selection and storage.
- Arithmetic circuits and state
- Half adders and full addersKhái niệm
Compute sum and carry separately, then chain them.
- Signed values and overflowKhái niệm
Interpret the same bits as unsigned and two’s complement.
- Comparators and boundary conditionsKhái niệm
Connect equality and magnitude comparisons to boundary tests.
- Flip-flops and clock enableKhái niệm
Specify the priority of reset, enable and hold.
- Numbers and time
- Bit width and binary valuesKhái niệm
Read the values and bit positions of a two-bit number.
- Clock edges and stateKhái niệm
Separate input changes from register updates.
- The counter and synchronous resetKhái niệm
Compute the next state from the previous state.
- Update state and run the lab
- Compute the next value from the old valueKhái niệm
Read nonblocking assignments and reset priority in the code.
- Counter simulation labThực hành
Observe incrementing and wraparound after reset.
- Boundaries and debugging
- What follows the maximum value?Khái niệm
Calculate addition beyond the register width.
- Diagnose reset and counting errorsKhái niệm
Check the initial value, reset and first edge in order.
- Counter knowledge checkKiểm tra
Check bit width and wraparound behavior.
- Bits and data flow
- Vector direction and bit indicesKhái niệm
Read q[2:0] and identify the positions selected by a slice.
- Read a serial input over timeKhái niệm
Organize a stream of one-bit inputs into a timeline.
- State changes in a shift registerKhái niệm
Move the previous bits and insert the new input.
- Concatenation and the lab
- Slices and concatenationKhái niệm
Trace how concatenated bits map into the new register.
- Shift-register simulation labThực hành
Trace the serial input alongside q.
- Latency and debugging
- Follow a bit to the outputKhái niệm
Count the edges as one input bit moves through the stages.
- Check direction, reset and input orderKhái niệm
Use a single-bit pattern to expose reversed connections.
- Shift-register knowledge checkKiểm tra
Compute the next state using the pre-update value.
- Connect and verify circuits
- Combinational delay and timing budgetsKhái niệm
Distinguish functional simulation from timing verification.
- Design a small state machineKhái niệm
Describe state, input and next state in a transition table.
- Verification plans and failure tracesKhái niệm
Define expected results for normal, boundary and reset cases.
- Capstone: serial pattern detectorKhái niệm
Design and check a state machine that detects the pattern 101.