نتایج جستجو برای: very large
تعداد نتایج: 1567007 فیلتر نتایج به سال:
At South Dakota State University (SDSU), resources are scarce and student enrollment is limited. However, interested faculty and eager to learn students made VLSI education at SDSU a reality. The implementation of the VLSI education program, that started in 1994, is presented in this paper. Factors such as meeting needs and expectations of Industry, limited capabilities, and increasing constrai...
A Power/Area Optimal Approach to VLSI Signal Processing
ion). 13 S. Devadas and K. Keutzer, "Necessary and Sufficient Conditions for Robust Delay-Fault Testability of Logic Circuits," in the Proceedings of the Sixth MIT Conference on Advanced Research on VLSI (Cambridge: MIT Press,
The existence of bounded degree networks which can emulate the computation of any bounded degree network of the same size with logarithmic slowdown is well-known. The butterfly is an example of such a universal network. Leiserson was the first to introduce the concept of an area-universal network: a network with VLSI layout area A which can emulate any network of the same size and layout area w...
iv List of figures and tables vi
We propose the recursive grid layout scheme for deriving efficient layouts of a variety of hierarchical networks and computing upper bounds on the VLSI area of general hierarchical networks. In particular, we construct optimal VLSI layouts for butterfly networks, generalized hypercubes, and star graphs that have areas within a factor of 1+ o(1) from their lower bounds. We also derive efficient ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید