• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 143
  • 46
  • 22
  • 18
  • 18
  • 18
  • 18
  • 18
  • 18
  • 6
  • 4
  • 1
  • 1
  • 1
  • Tagged with
  • 243
  • 243
  • 243
  • 243
  • 222
  • 222
  • 92
  • 70
  • 58
  • 34
  • 31
  • 26
  • 24
  • 23
  • 23
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
41

New algorithms for physical design of VLSI circuits

Lai, Minghorng 10 May 2011 (has links)
Not available / text
42

A new optimization model for VLSI placement

高雲龍, Ko, Wan-lung. January 1998 (has links)
published_or_final_version / abstract / toc / Electrical and Electronic Engineering / Master / Master of Philosophy
43

Silicon compiler for bit-serial signal processing architecture with automatic time alignment

梁迅中, Leung, Shun-chung. January 1987 (has links)
published_or_final_version / Electrical and Electronic Engineering / Master / Master of Philosophy
44

A double-track greedy algorithm for VLSI channel routing

袁志勤, Yuen, Chi-kan. January 1997 (has links)
published_or_final_version / Electrical and Electronic Engineering / Master / Master of Philosophy
45

An efficient single-latch scan-design scheme/

Panda, Uma R. January 1985 (has links)
No description available.
46

A cluster-proof approach to yield enhancement of large area binary tree architectures /

Howells, Michael C. January 1987 (has links)
No description available.
47

Timing analysis for MOSFETS, an integrated approach

Dagenais, Michel R. January 1987 (has links)
Timing and electrical verification is an essential part of the design of VLSI digital MOS circuits. It consists of determining the maximum operating frequency of a circuit, and verifying that the circuit will always produce the expected logical behavior at or under this frequency. This complex task requires considerable computer and human resources. / The classical simulation approach cannot be used to insure the timing and electrical correctness of the large circuits that are now being designed. The huge number of possible states in large circuits renders this method impractical. Worst-case analysis tools alleviate the problem by restricting the analysis to a limited set of states which correspond to the worst-case operating conditions. However, existing worst-case analysis tools for MOS circuits present several problems. Their accuracy is inherently limited since they use a switch-level model. Also, these procedures have a high computational complexity because they resort to path enumeration to find the latest path in each transistor group. Finally, they lack the ability to analyze circuits with arbitrarily complex clocking schemes. / In this text, a new procedure for circuit-level timing analysis is presented. Because it works at electronic circuit level, the procedure can detect electrical errors, and attains an accuracy that is impossible to attain by other means. Efficient algorithms, based on graph theory, have been developed to partition the circuits in a novel way, and to recognize series and parallel combinations. This enables the efficient computation of worst-case, earliest and latest, waveforms in the circuit, using specially designed algorithms. The new procedure extracts automatically the timing requirements from these waveforms and can compute the clocking parameters, including the maximum clock frequency, for arbitrarily complex clocking schemes. / A computer program was written to demonstrate the effectiveness of the new procedure and algorithms developed. It has been used to determine the clocking parameters of circuits using different clocking schemes. The accuracy obtained on these parameters is around 5 to 10% when compared with circuit-level simulations. The analysis time grows linearly with the circuit size and is approximately 0.5s per transistor, on a microVAX II computer. This makes the program suitable for VLSI circuits.
48

Approximation algorithms for VLSI routing

Măndoiu, Ion I. 08 1900 (has links)
No description available.
49

A MOS delay model for switch-level simulation /

Peckel, Marcos David. January 1985 (has links)
No description available.
50

Unsorted VLSI dictionary machines

Somani, Arun K. (Arun Kumar) January 1983 (has links)
No description available.

Page generated in 0.1646 seconds