Please use this identifier to cite or link to this item:
|Title:||The architecture and placement algorithm for a uni-directional routing based 3D FPGA|
|Source:||Hou, J.,Yu, H.,Ha, Y.,Liu, X. (2013). The architecture and placement algorithm for a uni-directional routing based 3D FPGA. FPT 2013 - Proceedings of the 2013 International Conference on Field Programmable Technology : 28-33. ScholarBank@NUS Repository. https://doi.org/10.1109/FPT.2013.6718325|
|Abstract:||Three-Dimensional (3D) FPGA as a promising design trend, achieves significant performance improvement over conventional 2D-based FPGA. The maturity of the uni-directional routing architecture design, which achieves 25% area saving in area-delay-product (ADP) over bi-directional routing architectures, has driven major vendors such as Xilinx and Altera to switch to such architecture in their 2D-based products. However, few studies were contributed to exploring performanceoptimal uni-directional 3D routing architectures. In this paper, we propose and evaluate a novel uni-directional 3D routing architecture named UNI-3D. Additionally, in the EDA counterpart, we also propose an improved simulated annealing (SA)-based placement algorithm that caters the unidirectional architecture, to alleviate signal propagation imbalance in the vertical channels resulted from using conventional bi-directional based SA approach. Our simulation results show that our proposed architecture is able to achieve up to 28.44% of delay reduction and 26.21% planar channel width reduction compared with the baseline 2D uni-directional architecture. At the same time, the proposed SA algorithm is able to improve the average vertical channel width up to 16% compared to state-of-the-art works. © 2013 IEEE.|
|Source Title:||FPT 2013 - Proceedings of the 2013 International Conference on Field Programmable Technology|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 15, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.