Search
Now showing items 1-10 of 45
On-chip signature checking for embedded memories
(1998)
The multiple on-chip signature checking architecture proposed by the authors previously is an effective BIST architecture for testing the functional units in modern VLSI circuits. It is characterized by low aliasing, low ...
Scheduling algorithms for bounded delay service in virtual networks
(1999)
With their widespread deployment, the need to provide QoS in virtual networks is being realized. We show that traditional scheduling algorithms like WFQ are incapable of providing a bounded delay service in a virtual ...
Mobility models for cellular systems: cell topography and handoff probability
(1999)
In this paper we develop models that incorporate general mobility patterns that are induced by the cell topography (e.g., road layout, street orientation, density of intersections). In particular, we study the effect of ...
Optimal clock period for synthesized data paths
(1997)
For technologies with significant interconnection delays, optimal clock period selection before/during high-level synthesis is not practical. In our approach, we start with a synthesized RTL data path structure, perform ...
A novel reconfigurable co-processor architecture
(1997)
Back-end processors have been conventionally used for speeding up of only a specific set of compute intensive functions. Such co-processors are, generally, “hardwired” and cannot be used for a new function. In this paper, ...
Efficient implementation of multiple on-chip signature checking
(1997)
Detection latency in a BIST scheme is the delay between the time instant at which a faulty response appears and the time instant at which the fault is detected. Conventional BILBO-BIST schemes suffer from long detection ...
Object recognition based on indexing in 2D environment
(1991)
Model-based objact recognition has attracted considerable attention in the vision community over the last twenty years. This paper prasents a model -based two dimensional object recognition system using feature indexing ...
Scalable classifiers with dynamic pruning
(1998)
The paper presents an algorithm to solve the problem of classification for data mining applications. This is a decision tree classifier which uses modified gini index as the partitioning criteria. A pre-sorting technique ...
Multiobjective search based algorithms for circuit partitioning problem for acceleration of logic simulation
(1997)
Speeding up logic simulation is important to reduce design time of complex systems. Hardware emulation through reconfigurable systems (RS) built using FPGA's offer an cheap and efficient method to achieve the required ...
Object tracking using affine structure for point correspondences
(1997)
A new object tracking algorithm based on affine structure has been developed and it is shown that its performance is better than that of a Kalman filter based correlation tracker. The algorithm is fast, reliable, viewpoint ...