Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Manhattan wiring

Known as: Right-angle wiring, Right angle wiring, Manhattan (disambiguation) 
Manhattan wiring (also known as right-angle wiring) is a technique for laying out circuits in computer engineering. Inputs to a circuit (specifically… Expand
Wikipedia

Related topics

Related topics

3 relations
Computer engineeringProgrammable logic arrayTaxicab geometry

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
LiDAR Point Clouds to 3-D Urban Models$:$ A Review
Three-dimensional (3-D) urban models are an integral part of numerous applications, such as urban planning and performance… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table II
2014
2014
Structure-aware time-domain finite-element method for efficient simulation of VLSI circuits
A fast linear-complexity time-domain finite-element algorithm is developed to preserve the matrix structure, resulting from the… Expand
  • figure 2
  • figure 1
  • figure 3
2008
2008
CLCP – A Distributed Cross-Layer Commit Protocol for Mobile Ad Hoc Networks
Transaction processing in mobile ad hoc networks must take network problems like node disconnection, message loss, and network… Expand
  • table 1
  • table 2
  • table 3
  • figure 1
  • figure 2
2005
2005
Layout verification for mixed-domain integrated MEMS
As design of integrated microelectromechanical systems (MEMS) mature, there is an increasing need for verification tools for such… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 1.5
1999
1999
A DRC-based algorithm for extraction of critical areas for opens in large VLSI circuits
This paper describes an algorithm for the extraction of the critical area for opens. The presented algorithm allows for the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
1991
1991
Novel routing schemes for IC layout part I: two-layer channel routing
  • D. Wang
  • 28th ACM/IEEE Design Automation Conference
  • 1991
    • Corpus ID: 6039586
We present new channel routing algorithms and theory that consider the characteristic of net crossings. ‘llte routing strategy is… Expand
  • figure 4
  • figure 5
  • figure 8
  • figure 17
  • table 1
1991
1991
Parallel algorithms for VLSI circuit extraction
The authors propose parallel algorithms to speedup the VLSI circuit extraction task. Given a VLSI layout as input, the problem of… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
1987
1987
KAHLUA: A Hierarchical Circuit Disassembler
  • B. Lin, A. Newton
  • 24th ACM/IEEE Design Automation Conference
  • 1987
    • Corpus ID: 1391493
A new tool called a circuit disassembler has been developed to transform a mask level layout into an equivalent symbolic layout… Expand
  • figure 2.2
  • figure 2.1
  • figure 2.3
  • figure 3.1
  • figure 4.1
Highly Cited
1986
Highly Cited
1986
Efficient Algorithms for Geometric Graph Search Problems
In this paper, we show that many graph search problems can be solved quite efficiently for a geometric intersection graph of… Expand
  • figure 1.1
  • figure 2.1
  • figure 3.2
  • figure 3.3
  • figure 3.4
1986
1986
An integer based hierarchical representation for VLSI
Geometries with 45° line segments are often used in integrated circuit layouts, since they can save considerable area. In the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE