By Topic

Validating families of latency insensitive protocols

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Suhaib, S. ; FERMAT Lab, Virginia Tech, Blacksburg, VA, USA ; Mathaikutty, D. ; Shukla, S. ; Berner, D.

With increasing clock frequencies, the signal delay on some interconnects in an system on chip (SoC) often exceeds the clock period, which necessitates latency insensitive protocols (LIPs). Correctness of a system composed of synchronous blocks communicating via LIPs is established by showing latency equivalence between a completely synchronous composition of the blocks, and the LIP based composition. Every time an LIP is conceived, they need to be debugged and then proven correct. Mathematical theorems to establish correctness, though elegant, are error prone, and tedious to create for every new variant of LIPs. In this work, we present validation frameworks for families of LIPs, both for dynamic validation, useful for early debug cycles, and formal verification for formal proof of correctness. This can be a useful framework in the hands of designers trying to create new LIPs or to optimize existing ones for design convergence.

Published in:

High-Level Design Validation and Test Workshop, 2005. Tenth IEEE International

Date of Conference:

30 Nov.-2 Dec. 2005