FPGA是一種可讓使用者編寫程式的數位裝置，並能夠提供數位電路有效且靈活的實現。
FPGA由配置邏輯塊組成且被路由網路包圍與限制在I/O腳的區域中。
FPGA為許多不同傳統半導體製的應用提供了一個價格更低的解決方案。
隨著單通量量子(SFQ)技術發展迅速，使用SFQ技術的FPGA將變得非常的有用。
先前的研究著重介紹了第一個高效能使用磁性SFQ技術的FPGA，這個FPGA有望以高頻低能耗的狀態下運行。
在這個論文中，我們提出一個全新的布局演算法，不同於CMOS製的FPGA，高效能磁性RSFQ的FPGA能夠滿足所有SFQ的限制。
我們準確地研究了RSFQ FPGA布局與布線問題，並且開發出了一套新穎的針對超導體FPGA的布局演算法，這個演算法旨在利用減少相連的邏輯塊的距離以最小化整體的布局面積與切換盒的擁擠狀況。
這個演算法的主要屬性是「單元分組」、「全域布局」與「細部布局」，目的是在符合超導電子與RSFQ的限制下提供一個最佳的合法布局結果。
我們將我們的布局結果與基準系統的結果進行比較，成功的減少成本(HPWL)約27%及布局區域大約20%。

FPGAs are user-programmable digital devices that provide efficient, yet flexible, implementations of digital circuits. FPGAs consist of configurational logic blocks surrounded by routing network and bounded on a grid by I/O pins. FPGAs provide a significantly cheaper solution for various applications of traditional semiconductor electronics. Single flux quantum (SFQ) technologies are developing rapidly and the availability of SFQ-specific FPGA will be very useful. Prior research highlights a first energy-efficient magnetic SFQ specific FPGA which promises to operate at very high frequency with low power dissipation. In this paper, we propose a new innovative placement algorithm Energy Efficient magnetic RSFQ FPGA complying all the SFQ constraints in the design unlike CMOS FPGAs. We have explored placement and routing problems in RSFQ FPGA precisely and developed a novel Placement Algorithm for Superconducting FPGA which aims to minimize overall placement area and congestion on switch boxes by reducing distance between connected logic blocks. The main attributes of the algorithm are - Cell Grouping, Global Placement and Detailed Placement which aims to provide best legal placement solution complying all the rules of Superconducting Electronics and RSFQ constraints. We compared our placement results with a baseline system and were able to reduce cost (HPWL) and placement area approximately by 27% and 20% respectively.

Acknowledgement.....................................i
Abstract............................................ii
Introduction1.......................................1
Related Works.......................................5
Superconducting FPGA: Architecture and CAD..........7
RSFQ FPGA Placement.................................16
Proposed Method.....................................21
Experimental Results................................31
Conclusion..........................................35
References..........................................36

[1] N. K. Katam, O. A. Mukhanov, and M. Pedram, “Superconducting magnetic fieldprogrammable gate array,”IEEE Transactions on Applied Superconductivity, vol. 28,no. 2, pp. 1–12, 2018.

[2] A. G. Ye, J. Rose, and D. Lewis,Field-programmable gate array architectures andalgorithms optimized for implementing datapath circuits. Citeseer, 2004.

[3] S. N. Shahsavani, A. Shafaei, and M. Pedram, “A placement algorithm for supercon-ducting logic circuits based on cell grouping and super-cell placement,” in2018 De-sign, Automation&Test in Europe Conference&Exhibition (DATE), pp. 1465–1468,IEEE, 2018

[4] D. K. Brock, “Rsfq technology: Circuits and systems,”International journal of highspeed electronics and systems, vol. 11, no. 01, pp. 307–362, 2001.

[5] H. Bian, A. C. Ling, A. Choong, and J. Zhu, “Towards scalable placement for fpgas,”inProceedings of the 18th annual ACM/SIGDA international symposium on Fieldprogrammable gate arrays, pp. 147–156, 2010.

[6] C. J. Fourie and H. van Heerden, “An rsfq superconductive programmable gate array,”IEEE transactions on applied superconductivity, vol. 17, no. 2, pp. 538–541, 2007.

[7] D. Singh, “Implementing fpga design with the opencl standard,”Altera whitepaper,vol. 1, 2011.

[8] A. Cosoroaba and F. Rivoallon, “Achieving higher system performance with thevirtex-5 family of fpgas,”White Paper: Virtex-5 Family of FPGAs, Xilinx WP245(v1. 1.1), 2006.

[9] C. Maxfield,FPGAs: instant access. Elsevier, 2011.

[10] S.-C. Chen and Y.-W. Chang, “Fpga placement and routing,” in2017 IEEE/ACM In-ternational Conference on Computer-Aided Design (ICCAD), pp. 914–921, IEEE,2017.

[11] V. Betz and J. Rose, “Vpr: A new packing, placement and routing tool for fpga re-search,” inInternational Workshop on Field Programmable Logic and Applications,pp. 213–222, Springer, 1997.

[12] M. Xu, G. Gr ́ewal, and S. Areibi, “Starplace: A new analytic method for fpga place-ment,”Integration, vol. 44, no. 3, pp. 192–204, 2011.

[13] S. Areibi, G. Grewal, D. Banerji, and P. Du, “Hierarchical fpga placement,”CanadianJournal of Electrical and Computer Engineering, vol. 32, no. 1, pp. 53–64, 2007.