Codiode

Stack with Peek Function

MediumVerilog / SystemVerilogBuild

Parsers often need to look at the top of the stack before deciding whether to pop it. A peek port shows the top entry without removing it.

The module maintains a 4-element deep, 8-bit wide stack. It supports synchronous push and pop operations. A dedicated combinational peek_data port continuously outputs the value at the top of the stack without modifying the internal pointer. Combinational empty and full flags indicate the current boundary state of the memory.

Timing and reset behaviour:

  • Clock edge: Positive edge of clk
  • Reset type: Asynchronous, active-low (rst_n)
  • Reset behaviour: The internal stack pointer clears to 0; empty asserts to 1; full and peek_data clear to 0
  • Priority rules: If push and pop are asserted simultaneously, they cancel each other out and the state remains unchanged
  • Boundary rules: Pushing to a full stack or popping from an empty stack must be ignored

Cycle-by-cycle trace:
Cycle 1: rst_n=0, push=0, pop=0, data_in=0 • empty=1, full=0, peek_data=0
Cycle 2: rst_n=1, push=1, pop=0, data_in=10 • empty=1, full=0, peek_data=0
Cycle 3: rst_n=1, push=1, pop=0, data_in=20 • empty=0, full=0, peek_data=10
Cycle 4: rst_n=1, push=1, pop=0, data_in=30 • empty=0, full=0, peek_data=20
Cycle 5: rst_n=1, push=1, pop=0, data_in=40 • empty=0, full=0, peek_data=30
Cycle 6: rst_n=1, push=0, pop=0, data_in=0 • empty=0, full=1, peek_data=40
Cycle 7: rst_n=1, push=0, pop=1, data_in=0 • empty=0, full=1, peek_data=40
Cycle 8: rst_n=1, push=0, pop=0, data_in=0 • empty=0, full=0, peek_data=30

Signal Direction Width Description
clk input 1 Positive-edge triggered clock
rst_n input 1 Asynchronous active-low reset; clears pointer to 0
push input 1 Push enable; writes data_in to stack on posedge clk
pop input 1 Pop enable; removes top element on posedge clk
data_in input 8 Data to be pushed onto the stack
peek_data output 8 Combinational output of current top element; 8'h00 if empty
empty output 1 Combinational flag asserted when stack holds 0 elements
full output 1 Combinational flag asserted when stack holds 4 elements

Constraints

  • The stack depth is exactly 4 elements.
  • peek_data, empty, and full must be combinational outputs reflecting the current state before the clock edge.
  • If empty is asserted, peek_data must strictly output 8'h00.
  • If push and pop are asserted simultaneously, they cancel out resulting in no state change.
  • Pushing to a full stack or popping from an empty stack must not modify the pointer or memory.
  • Data inside the memory array does not need to be zeroed out on pop or reset; only the pointer state dictates valid data.

Topics

MemoryCombinational LogicSynchronousStack

Solve this problem

Write the module in Verilog, SystemVerilog or VHDL. Your submission is compiled and simulated against the problem's testbench. You get the waveform back, not a stored answer.

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

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.

Part of Memory and Storage

Problem 24 of 26 in the Memory and Storage track.

Related problems

Browse all problems · Verilog practice problems · Learning tracks

Solve this on a laptopSend yourself the link and continue there.