Sciweavers

25 search results - page 3 / 5
» VLSI Layout of Benes Networks
Sort
View
JOIN
2007
69views more  JOIN 2007»
13 years 5 months ago
Layout of an Arbitrary Permutation in a Minimal Right Triangle Area
In VLSI layout of interconnection networks, routing two-point nets in some restricted area is one of the central operations. It aims usually to minimize the layout area, while red...
Maria Artishchev-Zapolotsky, Yefim Dinitz, Shimon ...
ARVLSI
1997
IEEE
104views VLSI» more  ARVLSI 1997»
13 years 10 months ago
A High-Speed Asynchronous Decompression Circuit for Embedded Processors
This paper describes the architecture and implementation of a high-speed decompression engine for embedded processors. The engine is targeted to processors where embedded programs...
Martin Benes, Andrew Wolfe, Steven M. Nowick
DFT
2006
IEEE
122views VLSI» more  DFT 2006»
13 years 9 months ago
Efficient and Robust Delay-Insensitive QCA (Quantum-Dot Cellular Automata) Design
The concept of clocking for QCA, referred to as the four-phase clocking, is widely used. However, inherited characteristics of QCA, such as the way to hold state, the way to synch...
Minsu Choi, Myungsu Choi, Zachary D. Patitz, Nohpi...
JPDC
2006
134views more  JPDC 2006»
13 years 5 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
ICPP
1994
IEEE
13 years 10 months ago
Computational Properties of Mesh Connected Trees: Versatile Architectures for Parallel Computation
Recently, the mesh connected trees (MCT) network has been proposed as a possible architecture for parallel computers. MCT networks are obtained by combining complete binary trees ...
Kemal Efe, Antonio Fernández