Sciweavers

10 search results - page 1 / 2
» Allocation of FIFO Structures in RTL Data Paths
Sort
View
VLSID
1997
IEEE
116views VLSI» more  VLSID 1997»
13 years 9 months ago
Allocation of FIFO Structures in RTL Data Paths
Heman Khanna, M. Balakrishnan
DAC
1995
ACM
13 years 8 months ago
Data Path Allocation for Synthesizing RTL Designs with Low BIST Area Overhead
Ishwar Parulkar, Sandeep K. Gupta, Melvin A. Breue...
VLSID
2004
IEEE
135views VLSI» more  VLSID 2004»
14 years 5 months ago
Integrating Self Testability with Design Space Exploration by a Controller based Estimation Technique
Recent research for testable designs has focussed on inserting test structures by re-arranging an Register-TransferLevel (RTL) data path generated from a behavioural description t...
M. S. Gaur, Mark Zwolinski
ISCA
2008
IEEE
136views Hardware» more  ISCA 2008»
13 years 4 months ago
A Randomized Queueless Algorithm for Breadth-First Search
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
K. Subramani, Kamesh Madduri
IPSN
2005
Springer
13 years 10 months ago
Lossy network correlated data gathering with high-resolution coding
— We consider a sensor network measuring correlated data, where the task is to gather all data from the network nodes to a sink. We consider the case where data at nodes is lossy...
Razvan Cristescu, Baltasar Beferull-Lozano