One-Hot Validation

Part of the RTL Design & Verification section of Coddy's Verilog journey. Lesson 3 of 38.

One-hot data has exactly one asserted bit. A decoder generates such data, while validation checks incoming data before using it. For known binary values, a nonzero value is one-hot when bits & (bits - 1) is zero. This section does not use that shortcut to classify X or Z.

Relevant excerpt; surrounding declarations and connections are supplied in the challenge.

assign one_hot = (bits != 0) && ((bits & (bits - 1)) == 0);

The nonzero check excludes idle; the bit trick rejects multiple set bits.

Distinguish zero, exactly one set bit and multiple set bits when validating requests.

Challenge

Medium

For known 4-bit input bits, set valid only when exactly one bit is high. Use the nonzero check together with bits & (bits - 1). Output columns: valid. All stimulus values are known binary values.

Complete design.v and preserve its module names and ports. The locked testbench.v supplies input changes and prints the outputs after they settle. It chooses a scenario using a simulator argument such as +CASE=1; no standard input is required. Do not add printing, delays or simulation termination to the design. Expected output is one row of decimal values per observation, separated by one space and ending with a newline.

Try it yourself

module dut (input [3:0] bits, output valid);
    // Replace this placeholder with your design.
    assign valid = 0;
endmodule

Test yourself

This lesson includes a short quiz. Start the lesson to answer it and track your progress.

All lessons in RTL Design & Verification

1Reliable Combinational RTL

Defaults Prevent Latches Priority EncodersOne-Hot ValidationSafe Case Decoding Recap - Request Router

4Controlled Sequential RTL

Reset and Enable Priority Saturating Counters Pipelining Data and Valid Detecting Sampled Edges Recap - Event Counter

7Project - Sample Monitor

Accumulate Samples Accept Enabled Samples

Clear the Current Window

Count Accepted Samples

Raise a Threshold Alarm

2Widths and Signed Arithmetic

Preserving Carry Bits Signed Comparisons Arithmetic Right Shifts Overflow and Saturation Recap - Signed Difference

5Memory and Lookup Tables

Combinational ROM Tables Register Array Storage Registered Read Ports Read-Write Forwarding Recap - Dual Read Bank

8Final Challenges

Challenge - Parity Pipeline Challenge - Pattern Events Challenge - Bounded Sum

3Reusable RTL

Combinational Functions Width-Safe Parameters Generate Loops Conditional Generate Recap - Reusable Bit Mask

6Self-Checking Testbenches

Four-State Checks Reusable Checker Tasks Reference Models and Scores Boundary and Control Coverage Recap - Adder Audit

Practice on your own: Online Verilog compiler