[KNIHA][B] Reconfigurable computing: the theory and practice of FPGA-based computation
Reconfigurable Computing marks a revolutionary and hot topic that bridges the gap
between the separate worlds of hardware and software design—the key feature of …
between the separate worlds of hardware and software design—the key feature of …
Recent research development in PCB layout
T Yan, MDF Wong - 2010 IEEE/ACM International Conference …, 2010 - ieeexplore.ieee.org
The increasing complexity of electronic systems has made PCB layout a difficult problem. A
large amount of research efforts are dedicated to the study of this problem. In this paper, we …
large amount of research efforts are dedicated to the study of this problem. In this paper, we …
Mathematical methods for physical layout of printed circuit boards: an overview
Mathematical methods for physical layout of printed circuit boards: an overview Page 1 OR
Spectrum (2008) 30:453–468 DOI 10.1007/s00291-007-0080-9 REGULAR ARTICLE …
Spectrum (2008) 30:453–468 DOI 10.1007/s00291-007-0080-9 REGULAR ARTICLE …
Preemption points placement for sporadic task sets
Limited preemption scheduling has been introduced as a viable alternative to non-
preemptive and fully preemptive scheduling when reduced blocking times need to coexist …
preemptive and fully preemptive scheduling when reduced blocking times need to coexist …
A negotiated congestion based router for simultaneous escape routing
The negotiated congestion based routing scheme finds success in FPGA routing and IC
global routing. However, its application in simultaneous escape routing, a key problem in …
global routing. However, its application in simultaneous escape routing, a key problem in …
Correctly modeling the diagonal capacity in escape routing
T Yan, MDF Wong - … Transactions on Computer-Aided Design of …, 2012 - ieeexplore.ieee.org
Escape routing for packages and printed circuit boards (PCBs) has been studied extensively
in the past. Network flow is pervasively used to model this problem. However, none of the …
in the past. Network flow is pervasively used to model this problem. However, none of the …
B-Escape: A simultaneous escape routing algorithm based on boundary routing
Simultaneous escape routing on dense circuit boards is a very challenging task and great
amount of manual effort is still needed in order to achieve high routability. In this paper, we …
amount of manual effort is still needed in order to achieve high routability. In this paper, we …
Simultaneous escape-routing algorithms for via minimization of high-speed boards
Shrinking transistor sizes, increasing circuit complexities, and high clock frequencies bring
new board-routing challenges that cannot be handled effectively by traditional routing …
new board-routing challenges that cannot be handled effectively by traditional routing …
Constraint driven I/O planning and placement for chip-package co-design
System-on-chip and system-in-package result in increased number of I/O cells and
complicated constraints for both chip designs and package designs. This renders the …
complicated constraints for both chip designs and package designs. This renders the …
Advances in PCB routing
The increasing complexity of electronic systems has made PCB routing a difficult problem. A
large amount of research effort has been dedicated to the study of this problem. In this …
large amount of research effort has been dedicated to the study of this problem. In this …