Cited By
View all- Silva PFormigoni RLuz LFerreira RNeto ONacif J(2022)An automatic routing approach for NML circuitsJournal of Computational Electronics10.1007/s10825-022-01960-3Online publication date: 7-Nov-2022
Toward nanometric scale integration: an automatic routing approach for NML circuits
Authors: 
Pedro Arthur R. L. Silva, Omar Paranaíba V. Neto, José Augusto M. NacifAuthors Info & Claims
Article No.: 25, Pages 1 - 6
Abstract
In recent years, many technologies have been studied to replace or complement CMOS. Some of these emerging technologies are known as Field Coupled Nanocomputing. However, these new technologies introduce the need for developing tools to perform circuit mapping, placement, and routing. Nanomagnetic Logic Circuit (NML) is one of these emergent technologies. It relies on the magnetization of nanomagnets to perform operations through majority logic. In this work, we propose an approach to map a gate-level circuit to an NML layout automatically. We use the Breadth First Search to perform the placement and the A* algorithm to transverse the circuit and build the routes for each node. To evaluate the effectiveness of our approach, we use a series of ISCAS'85 benchmarks. Our results show an area reduction varying from 20% to 60%.
References
[1]
Luca Amarú, Pierre-Emmanuel Gaillardon, and Giovanni De Micheli. 2014. Majority-inverter graph: A novel data-structure and algorithms for efficient logic optimization. In Proceedings of the 51st Annual Design Automation Conference. ACM, 1--6.
[2]
Luca Amarù, Eleonora Testa, Miguel Couceiro, Odysseas Zografos, Giovanni De Micheli, and Mathias Soeken. 2018. Majority logic synthesis. In Proceedings of the International Conference on Computer-Aided Design. ACM, 79.
[3]
F. Brglez, D. Bryan, and K. Kozminski. 1989. Combinational profiles of sequential benchmark circuits. In Circuits and Systems, 1989., IEEE International Symposium on. 1929--1934 vol.3.
[4]
F. Brglez and H. Fujiwara. 1985. A Neutral Netlist of 10 Combinational Benchmark Circuits and a Target Translator in Fortran. In Proceedings of IEEE Int'l Symposium Circuits and Systems (ISCAS 85). IEEE Press, Piscataway, N.J., 677--692.
[5]
Alan Bundy and Lincoln Wallen. 1984. Breadth-first search. In Catalogue of Artificial Intelligence Tools. Springer, 13--13.
[6]
Ralph K Cavin, Paolo Lugli, and Victor V Zhirnov. 2012. Science and engineering beyond Moore's law. Proc. IEEE 100, Special Centennial Issue (2012), 1720--1749.
[7]
RP Cowburn and ME Welland. 2000. Room temperature magnetic quantum cellular automata. Science 287, 5457 (2000), 1466--1468.
[8]
Farnoosh Farzaneh, Reza Faghih Mirzaee, and Keivan Navi. 2019. A novel 3D three/five-input majority-based full adder in nanomagnetic logic. Journal of Computational Electronics (2019), 1--10.
[9]
Geraldo Fontes, Pedro Arthur RL Silva, Jose Augusto M Nacif, Omar P Vilela Neto, and Ricardo Ferreira. 2018. Placement and Routing by Overlapping and Merging QCA Gates. In Circuits and Systems (ISCAS), 2018 IEEE International Symposium on. IEEE, 1--5.
[10]
Stèphano MM Gonçalves, Leomar S da Rosa, and Felipe de S Marques. 2017. A survey of path search algorithms for vlsi detailed routing. In 2017 IEEE International Symposium on Circuits and Systems (ISCAS). IEEE, 1--4.
[11]
Peter E Hart, Nils J Nilsson, and Bertram Raphael. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE transactions on Systems Science and Cybernetics 4, 2 (1968), 100--107.
[12]
Alexandra Imre, G Csaba, L Ji, A Orlov, GH Bernstein, and W Porod. 2006. Majority logic gate for magnetic quantum-dot cellular automata. Science 311, 5758 (2006), 205--208.
[13]
Scott Kirkpatrick, C Daniel Gelatt, and Mario P Vecchi. 1983. Optimization by simulated annealing. science 220, 4598 (1983), 671--680.
[14]
Chin Yang Lee. 1961. An algorithm for path connections and its applications. Electronic Computers, IRE Transactions on 3 (1961), 346--365.
[15]
Craig S Lent and P Douglas Tougaw. 1997. A device architecture for computing with quantum dots. Proc. IEEE 85, 4 (1997), 541--557.
[16]
Sung Kyu Lim, Ramprasad Ravichandran, and Mike Niemier. 2005. Partitioning and placement for buildable QCA circuits. ACM Journal on Emerging Technologies in Computing Systems (JETC) 1, 1 (2005), 50--72.
[17]
Tsu-Jae King Liu and Kelin Kuhn. 2015. CMOS and beyond: logic switches for terascale integrated circuits. Cambridge University Press.
[18]
Alan Mishchenko et al. 2007. ABC: A system for sequential synthesis and verification. URL http://www.eecs.berkeley.edu/alanmi/abc (2007), 17.
[19]
MT Niemier, Gary H Bernstein, G Csaba, A Dingler, XS Hu, S Kurtz, S Liu, J Nahas, W Porod, M Siddiq, et al. 2011. Nanomagnet logic: progress toward system-level integration. Journal of Physics: Condensed Matter 23, 49 (2011), 493202.
[20]
Michael T Niemier and Peter M Kogge. 2001. Problems in designing with QCAs: Layout= timing. International Journal of Circuit Theory and Applications 29, 1 (2001), 49--62.
[21]
Fabrizio Riente, Giovanna Turvani, Marco Vacca, Massimo Ruo Roch, Maurizio Zamboni, and Mariagrazia Graziano. 2017. Topolinano: a cad tool for nano magnetic logic. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 36, 7 (2017), 1061--1074.
[22]
Frank Rubin. 1974. The Lee path connection algorithm. IEEE Transactions on computers 100, 9 (1974), 907--914.
[23]
G Santoro, M Vacca, M Bollo, F Riente, M Graziano, and M Zamboni. 2018. Exploration of multilayer field-coupled nanomagnetic circuits. Microelectronics Journal 79 (2018), 46--56.
[24]
Thiago RBS Soares, João G Nizer Rahmeier, Vitor C De Lima, Lucas Lascasas, Luiz G Costa Melo, and Omar P Vilela Neto. 2018. NMLSim: a Nanomagnetic Logic (NML) circuit designer and simulation tool. Journal of Computational Electronics 17, 3 (2018), 1370--1381.
[25]
Kozo Sugiyama, Shojiro Tagawa, and Mitsuhiko Toda. 1981. Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man, and Cybernetics 11, 2 (1981), 109--125.
[26]
Frank Sill Torres, Pedro Arthur Silva, Geraldo Fontes, José Augusto Nacif, Ricardo Santos Ferreira, Omar Paranaiba Vilela Neto, Jeferson Chaves, and Rolf Drechsler. 2018. Exploration of the Synchronization Constraint in Quantum-dot Cellular Automata. In 2018 21st Euromicro Conference on Digital System Design (DSD). IEEE, 642--648.
[27]
Marcel Walter, Robert Wille, Daniel Große, Frank Sill Torres, and Rolf Drechsler. 2018. An exact method for design exploration of quantum-dot cellular automata. In Design, Automation & Test in Europe Conference & Exhibition (DATE), 2018. IEEE, 503--508.
[28]
S. Yang. 1989. Logic Synthesis and Optimization Benchmarks. Technical Report.
- Toward nanometric scale integration: an automatic routing approach for NML circuits
Recommendations
An automatic routing approach for NML circuits
AbstractNanomagnetic Logic (NML) is an emergent computation model based on the interactions between nanomagnets. However, there are several challenges and open problems in the NML design flow, where clocking schemes and routing play an essential role. We ...
CAM/TCAM - NML: (ternary) content addressable memory implemented with nanomagnetic logic
SBCCI '17: Proceedings of the 30th Symposium on Integrated Circuits and Systems Design: Chip on the SandsAmong the new technologies that have emerged in the past few years to address the limits of CMOS, Nanomagnetic Logic (NML) is one of the most promising. NML circuits are composed of nanosized elongated magnets that operate at room temperature with ultra-...
Novel designs of nanometric parity preserving reversible compressor
Reversible logic is a new field of study that has applications in optical information processing, low power CMOS design, DNA computing, bioinformatics, and nanotechnology. Low power consumption is a basic issue in VLSI circuits today. To prevent the ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
August 2019
204 pages
ISBN:9781450368445
DOI:10.1145/3338852
- General Chair:
- João Martino,
- Program Chairs:
- Marcelo Lubaszewski,
- Matteo Reorda
Copyright © 2019 ACM.
© 2019 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of a national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.
Sponsors
- SIGDA: ACM Special Interest Group on Design Automation
- IEEE Circuits & Systems Society
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 26 August 2019
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
SBCCI '19
Sponsor:
SBCCI '19: 32nd Symposium on Integrated Circuits and Systems Design
August 26 - 30, 2019
São Paulo, Brazil
Acceptance Rates
Overall Acceptance Rate 133 of 347 submissions, 38%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 60Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Oct 2024
Other Metrics
Citations
Cited By
View all- Silva PFormigoni RLuz LFerreira RNeto ONacif J(2022)An automatic routing approach for NML circuitsJournal of Computational Electronics10.1007/s10825-022-01960-3Online publication date: 7-Nov-2022
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in