6,713 research outputs found
Recommended from our members
A new partitioning approach for layout synthesis from register-transfer netlists
Most of the IC today are described and documented using heiarchical netlists. In addition to gates, latches, and flip-flops, these netlists include sliceable register-transfer components such as registers, counters, adders, ALUs, shifters, register files, and multiplexers. Usually, these components are decomposed into basic gates, latches, and flip-flops, and are laid out using standard cells. The standard cell architecture requires excessive routing area, and does not exploit the bit-sliced nature of register-transfer components. In this paper, we present a new sliced-layout architecture to alleviate the preceding problems. We also describe partitioning algorithms that are used to generate the floorplan for this layout architecture. The partitioning algorithms not only select the best suited layout style for each component, but also consider critical paths, I/O pin locations, and connections between blocks. This approach improves the overall area utilization and minimizes the total wire length
Concurrent Geometric Multicasting
We present MCFR, a multicasting concurrent face routing algorithm that uses
geometric routing to deliver a message from source to multiple targets. We
describe the algorithm's operation, prove it correct, estimate its performance
bounds and evaluate its performance using simulation. Our estimate shows that
MCFR is the first geometric multicast routing algorithm whose message delivery
latency is independent of network size and only proportional to the distance
between the source and the targets. Our simulation indicates that MCFR has
significantly better reliability than existing algorithms
Speed-Aware Routing for UAV Ad-Hoc Networks
In this paper we examine mobile ad-hoc networks (MANET) composed by unmanned
aerial vehicles (UAVs). Due to the high-mobility of the nodes, these networks
are very dynamic and the existing routing protocols partly fail to provide a
reliable communication. We present Predictive-OLSR an extension to the
Optimized Link-State Routing (OLSR) protocol: it enables efficient routing in
very dynamic conditions. The key idea is to exploit GPS information to aid the
routing protocol. Predictive-OLSR weights the expected transmission count (ETX)
metric, taking into account the relative speed between the nodes. We provide
numerical results obtained by a MAC-layer emulator that integrates a flight
simulator to reproduce realistic flight conditions. These numerical results
show that Predictive-OLSR significantly outperforms OLSR and BABEL, providing a
reliable communication even in very dynamic conditions.Comment: submitted to GlobeCom'13 Workshop - Wi-UA
Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition
A geometric graph is angle-monotone if every pair of vertices has a path
between them that---after some rotation---is - and -monotone.
Angle-monotone graphs are -spanners and they are increasing-chord
graphs. Dehkordi, Frati, and Gudmundsson introduced angle-monotone graphs in
2014 and proved that Gabriel triangulations are angle-monotone graphs. We give
a polynomial time algorithm to recognize angle-monotone geometric graphs. We
prove that every point set has a plane geometric graph that is generalized
angle-monotone---specifically, we prove that the half--graph is
generalized angle-monotone. We give a local routing algorithm for Gabriel
triangulations that finds a path from any vertex to any vertex whose
length is within times the Euclidean distance from to .
Finally, we prove some lower bounds and limits on local routing algorithms on
Gabriel triangulations.Comment: Appears in the Proceedings of the 24th International Symposium on
Graph Drawing and Network Visualization (GD 2016
- …