CodiodeCodiode
Home
Problem Solving
Skill Tracks
My Assignments
Contests
Leaderboard
Community
Settings
Codiode/Problems/Sequential Logic

LFSR Sequence Trace: Non-Binary Pattern Verification

MediumLogic CircuitTiming Diagram

A 4-bit positive-edge-triggered Fibonacci Linear Feedback Shift Register (LFSR) updates its state on every LOW-to-HIGH clock transition using the feedback polynomial tap configuration D3 = Q3 XOR Q0. Five signals are shown: CLK (clock, period 2) and four state outputs Q3, Q2, Q1, and Q0. The shift register shifts right, meaning Q2 takes the value of Q3, Q1 takes Q2, and Q0 takes Q1. The initial state at time step 0 is 0001 (Q3=0, Q2=0, Q1=0, Q0=1). Trace the outputs Q3, Q2, Q1, and Q0 across all 16 time steps to verify the first 8 states of the pseudo-random sequence.

Constraints

  • The LFSR is strictly positive-edge-triggered.
  • The new bit shifted into Q3 is the XOR of the current Q3 and Q0 values evaluated immediately before the rising clock edge.
  • The register shifts right: Q3 moves to Q2, Q2 moves to Q1, and Q1 moves to Q0.

Topics

Sequential LogicCountersState MachinesLFSR

Solve this problem

Place the gates, wire them up and watch the signals settle. Every submission runs on the same simulation engine that grades it.

This problem is part of Codiode Pro. The statement above is free to read.

Sign in to solveSee what Pro unlocks

The circuit builder and code editor need a desktop screen. On a phone, read the problem here and open it on a laptop to solve.

Related problems

  • 3-bit Ripple Counter from Toggle Flip-FlopsEasy
  • D Latch from a 2:1 MUXEasy
  • 2-bit Ring CounterEasy
  • T Flip-Flop from a D Flip-FlopEasy
  • Handshake Deadlock Due to Early ResetHard
  • Reconvergence of Individually Synchronized BitsHard
  • Debug: Asynchronous Clear GlitchHard
  • Clock Gate Enable Crossing DomainsHard

Browse all problems · Learning tracks