I did not get around to synthesizing the example in Chapter 10 of Sutherland's book (refer to my previous post). Instead, I have some comments about the published example. Most of my time tonight was spent preparing BARF for release.
To keep this post concise, I won't post snippets. A copy of the source code can be found here.
Comment #1 : Modports TopReceive and CoreReceive are duplicated in interface Utopia. I don't understand the decision to duplicate the modports. The SVTB interface should describe the Utopia interface. The Utopia interface is a set of signals and those signals can either be seen from point-of-view of receiver or transmitter.
Comment #2: The author made an interesting decision to model the register file using interface LookupTable. I understand what he's trying to do -- DNR, do not repeat (yourself). His control logic calls a function to read or write a memory array. The function and memory array live in the interface rather than the module. If you expect the synthesis tool to infer memories from RTL code, then it's a viable option. If you need the ability to manually instantiate library cells for memory, then it's not so viable - you cannot instantiate modules within an interface. I am somewhat weary about the approach for the following reason. Yes, you can start with synthesis-inferred memory arrays, but what happens when/if you need to move to custom cells? Then, the interface may not be able to serve its original purpose.
Comment #3: Why didn't author have the main FSM use signals in interfaces rather than drive temporary signals which are then assigned to the interface nets.
bit [0:NumTx-1] Txvalid; // FSM 'drives' this
for (TxIter=0; TxIter<NumTx; TxIter+=1) begin: GenTx
assign Tx[TxIter].valid = Txvalid[TxIter] // assign to ifc
Comment #4: Combined blocking and non-blocking assignment in rx_valid_state
This example is all kinds of confusing. I had to turn to StackOverflow to understand what was going on and I'm still not entirely clear how exactly that RTL code gets translated into gates. The logic basically says to rotate the the round-robin pointer until one of the receivers has a valid cell that is ready to be processed. Then, the cell is latched and the FSM advances to the next state. It's an interesting strategy that I assume works because of SystemVerilog's always_ff.
Comment #5: What did I learn about networking?
Not much. That ATM is a very old protocol. That ATM is has nearly 10% "cell tax", meaning the header makes up that much of the total size of the cell. The purpose of the design is to take in incoming ATM cells and arbitrate among receivers. After a receiver is selected, the register file is accessed update the to-be-transmitted cell's VPI and compute it's new header error control (HEC) value. Finally, there are two state machine that receive and transmit the cells according to Utopia protocol.
Post a Comment