Satyaki Das

• Vellore Institute of Technology University

Background: Respiratory illnesses in children form a substantial disease burden in emergency care, outpatients and hospitalised patients. Studies exploring the pattern of emergency room visits and hospitalization for individuals with respiratory complaints could inform decisions regarding the effective organisation and planning of health services.M...

Background: Congenital coronary anomalies may be isolated, or they may accompany other congenital heart defects, such as Fallot's tetralogy, transposition of the great arteries or pulmonary atresia. The most common cause of acquired abnormalities of the coronary vessels in children is kawasaki disease (KD). The aim of this study was to find the bes...

Objective: Early diagnosis and treatment decreases the mortality and morbidity of neonatal sepsis(NS). The aim of this study was to find out the level of different inflammatory markers in neonatal sepsis. Methods: Forty two term neonates with non-sepsis (n = 17), clinical (n = 10) and proven (n = 15) sepsis were evaluated. Blood cultures were obtai...

Within a system comprising a plurality of processors and a memory, a method of determining routing information for a circuit design for implementation within a programmable integrated circuit can include determining that nets of the circuit design comprise overlap and unrouting nets comprising overlap. A congestion picture can be determined that co...

Small gates, such as AND2, XOR2, and MUX2, have been mixed with lookup tables (LUTs) inside programmable logic blocks (PLBs) to reduce area and power and increase performance in FPGAs. However, it is unclear whether incorporating macrogates with wide inputs inside PLBs is beneficial. In this paper, we first develop a methodology to extract a small...

Small gates, such as AND2, XOR2 and MUX2, have been mixed with lookup tables (LUTs) inside the. programmable logic block (PLB) to reduce area and power and increase performance in FP-GAs. However, it is unclear whether incorporating macro-gates with wide inputs inside PLBs is beneficial. In this paper, we first propose a methodology to extract a sm...

Programmable logic devices such as field-programmable gate arrays (FPGAs) are useful for a wide range of applications. However, FPGAs are not commonly used in battery-powered applications because they consume more power than application-specified integrated circuits and lack power management features. In this paper, we describe the design and imple...

In this study, we present a design methodology to determine the granularity of power gating for field programmable gate arrays (FPGAs). Fine-grain power gating is more effective than coarse-grain power gating to reduce the active leakage power of unused logic and interconnection resources. However, the area overhead in fine-grain power gating is hi...

Programmable logic devices such as FPGAs are useful for a wide range of applications. However, FPGAs are not commonly used in battery-powered applications because they consume more power than ASICs and lack power management features. In this paper, we describe the design and implementation of Pika, a low-power FPGA core targeting battery-powered ap...

In this study, we present design techniques to implement low power FPGA routing architecture by combining fast and slow routing resources, where the circuit design of slow resource is optimized to reduce leakage power. Timing-driven placement and routing experiments along with power modeling are used to identify the type and percentage of resources...

Predicate abstraction is an automatic technique that can be used to find abstract models of large or infinite-state systems. In tools like Slam, where predicate abstraction is applied to software model checking, a number of heuristic approximations must be used to improve the performance of computing an abstraction from a set of predicates. For thi...

The application of predicate abstraction to parameterized systems requires the use of quantified predicates. These predicates cannot be found automatically by existing techniques and are tedious for the user to provide. In this work we demonstrate a method of discovering most of these predicates automatically by analyzing spurious abstract counter-...

Given current design practices, practical verification of microprocessor designs requires checking

Recently, we have improved the efficiency of the predicate abstraction scheme presented by Das, Dill and Park (1999). As a result, the number of validity checks needed to prove the necessary verification condition has been reduced. The key idea is to refine an approximate abstract transition relation based on the counter-example generated. The syst...

Aggregation abstraction is a way of defining a desired correspondence between an implementation of a transaction-oriented protocol and a much simpler idealized version of the same protocol. This relationship can be formally verified to prove the correctness of the implementation. We present a technique for checking aggregation abstractions automati...

This reports some experiences with a recently-implemented prototype system for verification using predicate abstraction, based on the method of Graf and Saïdi [9]. Systems are described using a language of iterated guarded commands, called Murø -- (since it is a simplified version of our Murø protocol description language). The system makes use of...

This reports some experiences with a recently-implemented prototype system for verification using predicate abstraction, based on the method of Graf and Saïdi [9]. Systems are described using a language of iterated guarded commands, called MurΦ-- (since it is a simplified version of our MurΦ protocol description language). The system makes use of t...