Altifigence Academy
Desain digitalGratis · Pemula

Digital Logic Circuits

Learn how digital circuits select inputs, store state and move data through concepts and hands-on RTL examples.

Combinational & sequential logicSystemVerilogWaveform analysis
Pembelajaran saya

Yang akan Anda pelajari

  • 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

Sebelum memulai

Baca konsep di peramban. Untuk praktik, siapkan proyek Desktop Digital Design Studio dan izin menjalankannya. Kode sumber dan masukan tersedia.

Instalasi dan peluncuran pertama ↗

Kurikulum

  1. Foundations of digital logic
    • Binary and hexadecimalKonsep

      Represent the same value in binary and hexadecimal.

    • Gates and truth tablesKonsep

      Compare the output rules of AND, OR, NOT and XOR.

    • Boolean algebra and De Morgan’s lawsKonsep

      Check whether different expressions produce the same output.

    • Decoders and enable signalsKonsep

      Turn a binary address into one active output.

  2. Signals and selection
    • Bits, signals and portsKonsep

      Identify inputs, outputs and the meaning of one-bit values.

    • Specify the selection with a truth tableKonsep

      List every input combination and define its expected output.

    • The MUX and its observation registerKonsep

      Distinguish a combinational output from a sampled output.

  3. Write and run the RTL
    • Describe a MUX with a conditional expressionKonsep

      Connect the select signal and data inputs in RTL.

    • MUX simulation labPraktikum

      Compare outputs using the provided source and input files.

  4. Interpret and check
    • Input changes and sampling instantsKonsep

      Track y and sampled_y before and after a clock edge.

    • Test the cases that reveal mistakesKonsep

      Choose cases that reveal reversed selection and sampling errors.

    • MUX knowledge checkKuis

      Check your understanding of selection and storage.

  5. Arithmetic circuits and state
    • Half adders and full addersKonsep

      Compute sum and carry separately, then chain them.

    • Signed values and overflowKonsep

      Interpret the same bits as unsigned and two’s complement.

    • Comparators and boundary conditionsKonsep

      Connect equality and magnitude comparisons to boundary tests.

    • Flip-flops and clock enableKonsep

      Specify the priority of reset, enable and hold.

  6. Numbers and time
    • Bit width and binary valuesKonsep

      Read the values and bit positions of a two-bit number.

    • Clock edges and stateKonsep

      Separate input changes from register updates.

    • The counter and synchronous resetKonsep

      Compute the next state from the previous state.

  7. Update state and run the lab
    • Compute the next value from the old valueKonsep

      Read nonblocking assignments and reset priority in the code.

    • Counter simulation labPraktikum

      Observe incrementing and wraparound after reset.

  8. Boundaries and debugging
    • What follows the maximum value?Konsep

      Calculate addition beyond the register width.

    • Diagnose reset and counting errorsKonsep

      Check the initial value, reset and first edge in order.

    • Counter knowledge checkKuis

      Check bit width and wraparound behavior.

  9. Bits and data flow
    • Vector direction and bit indicesKonsep

      Read q[2:0] and identify the positions selected by a slice.

    • Read a serial input over timeKonsep

      Organize a stream of one-bit inputs into a timeline.

    • State changes in a shift registerKonsep

      Move the previous bits and insert the new input.

  10. Concatenation and the lab
    • Slices and concatenationKonsep

      Trace how concatenated bits map into the new register.

    • Shift-register simulation labPraktikum

      Trace the serial input alongside q.

  11. Latency and debugging
    • Follow a bit to the outputKonsep

      Count the edges as one input bit moves through the stages.

    • Check direction, reset and input orderKonsep

      Use a single-bit pattern to expose reversed connections.

    • Shift-register knowledge checkKuis

      Compute the next state using the pre-update value.

  12. Connect and verify circuits
    • Combinational delay and timing budgetsKonsep

      Distinguish functional simulation from timing verification.

    • Design a small state machineKonsep

      Describe state, input and next state in a transition table.

    • Verification plans and failure tracesKonsep

      Define expected results for normal, boundary and reset cases.

    • Capstone: serial pattern detectorKonsep

      Design and check a state machine that detects the pattern 101.

Pilihan berlaku di peramban ini. Ubah kapan saja di bagian bawah halaman.