VLSI implementation of controllers for communication protocols fromtheir Petri net models

Petri nets are popular in the communication protocol community for modelling and analysis purposes. This paper gives a procedure for extraction and implementation of controllers of protocols from their Petri net model. It adds another dimension to the use of Petri nets and is suited for network, transport and data link protocol

VLSI implementation of controllers for communication protocols fromtheir Petri net models

Petri nets are popular in the communication protocol community for modelling and analysis purposes. This paper gives a procedure for extraction and implementation of controllers of protocols from their Petri net model. It adds another dimension to the use of Petri nets and is suited for network, transport and data link protocol

A novel technique for fast multiplication

In this paper we present the design of a new high speed multiplication unit. The design is based on non-overlapped scanning of 3-bit fields of the multiplier. In this algorithm the partial products of the multiplicand and three bits of the multiplier are pre-calculated using only hardwired shifts. These partial products are then added using a tree of carry-save-adders, and finally the sum and carry vectors are added using a carry-look-ahead adder. In case of 2's complement multiplication the tree of carry-save-adders also receives a correction output produced in parallel with the partial products. The algorithms is modeled in a hardware description language and its VLSI chip implemented. The performance of the new design is compared with other recent ones proposed in literatur

High level synthesis of controllers for communication protocols

A method for implementing communication protocols in hardware is presented. A design automation system that accepts Petri net models of digital systems and produces VLSI layouts is proposed. It is assumed that the composite Petri net model of the protocol is available. A procedure for automatically detecting the entities of the communication protocol is given. This procedure has exponential complexity as it uses a reachability graph. No restrictions have been put on the Petri net mode