YAF

Enqueue more, dequeue smart: Build a flexible FIFO for bursty data!

PROBLEM STATEMENT:
For this problem you are asked to design a FIFO with a certain requirement that it should be able to enqueue up to N items in a single clock cycle while popping out a single item every cycle. Additionally, a priority order has been mentioned for the pop operation which says that items should be dequeued in the LSB to MSB order.

The FIFO should be able to hold no more than 64-Bytes of data

block

Interface Definition
The module consists of two interfaces

Loading the interactive workspace...