Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Specification And Verification Of Systolic Arrays, PDF eBook

Specification And Verification Of Systolic Arrays PDF

PDF

Please note: eBooks can only be purchased with a UK issued credit card and all our eBooks (ePub and PDF) are DRM protected.

Description

Circuits and architectures have become more complex in terms of structure, interconnection topology, and data flow.

Design correctness has become increasingly significant, as errors in design may result in strenuous debugging, or even in the repetition of a costly manufacturing process.

Although circuit simulation has been used traditionally and widely as the technique for checking hardware and architectural designs, it does not guarantee the conformity of designs to specifications.

Formal methods therefore become vital in guaranteeing the correctness of designs and have thus received a significant amount of attention in the CAD industry today.This book presents a formal method for specifying and verifying the correctness of systolic array designs.

Such architectures are commonly found in the form of accelerators for digital signal, image, and video processing.

These arrays can be quite complicated in topology and data flow.

In the book, a formalism called STA is defined for these kinds of dynamic environments, with a survey of related techniques.

A framework for specification and verification is established.

Formal verification techniques to check the correctness of the systolic networks with respect to the algorithmic level specifications are explained.

The book also presents a Prolog-based formal design verifier (named VSTA), developed to automate the verification process, as using a general purpose theorem prover is usually extremely time-consuming.

Several application examples are included in the book to illustrate how formal techniques and the verifier can be used to automate proofs.

Information

Information