ASPDAC
2006
ACM
13 years 10 months ago
2006
ACM
— In this paper, we give the necessary and sufficient condition that all nets can be connected by monotonic routes when a net consists of a finger and a ball and fingers are on...
ASPDAC
2006
ACM
13 years 10 months ago
2006
ACM
Abstract— Many of today’s data-intensive applications manipulate disk-resident data sets. As a result, their overall behavior is tightly coupled with their disk performance. Un...
ASPDAC
2006
ACM
13 years 10 months ago
2006
ACM
Abstract— In the UDSM era, crosstalk is an area of considerable concern for designers, as it can have a considerable impact on the yield, both in terms of functionality and opera...
ASPDAC
2006
ACM
13 years 10 months ago
2006
ACM
- We propose a near optimal hardware architecture for deblocking filter in H.264/MPEG-4 AVC. We propose a novel filtering order and a data reuse strategy that result in significant...
ASPDAC
2006
ACM
13 years 10 months ago
2006
ACM
ASPDAC
2006
ACM
13 years 10 months ago
2006
ACM
– In this paper we present three efficient DVS techniques for an MPEG decoder. Their energy reduction is comparable to that of the optimal solution. A workload prediction model i...
ASPDAC
2006
ACM
13 years 10 months ago
2006
ACM
—For nanoscale interconnection, the scattering effect will soon become prominent due to scaling. It will increase the effective resistivity and thus interconnection delay signifi...
ASPDAC
2006
ACM
13 years 10 months ago
2006
ACM
Abstract— Routing tree construction is a fundamental problem in modern VLSI design. In this paper we propose CDCTree, an Obstacle-Avoiding Rectilinear Steiner Minimum Tree (OARSM...
ASPDAC
2006
ACM
13 years 10 months ago
2006
ACM
To get efficient HW management in 2D Reconfigurable Systems, heuristics are needed to select the best place to locate each arriving task. We propose a technique that locates the ta...
ASPDAC
2006
ACM
13 years 10 months ago
2006
ACM
