Вентильная сложность обратимых схем как мера сложности четных подстановок

15 / 16

7. Shende V.V., Prasad A.K., Markov I.L. , Hayes J.P. Synthesis of Reversible Logic
Circuits // IEEE Trans. on CAD. 2003. Vol. 22. No. 6. P. 710–722.
8. Закаблуков Д.В., Жуков А.Е. Исследование схем из обратимых логических эле-
ментов // Информатика и системы управления в XXI веке: Сб. трудов моло-
дых ученых, аспирантов и студентов. № 9. М.: МГТУ им. Н.Э. Баумана, 2012.
С. 148–157.
9. Закаблуков Д.В. Быстрый алгоритм синтеза обратимых схем на основе теории
групп подстановок // Прикладная дискретная математика. 2014. № 2. С. 101–109.
10. Khlopotine A.B., Perkowski M.A., Kerntopf P. Reversible Logic Synthesis by Iterative
Compositions // International Workshop on Logic Synthesis. 2002. P. 261–266.
11. Yang G., Song X. , Hung W.N., Perkowski M.A. Fast Synthesis of Exact Minimal
Reversible Circuits Using Group Theory // ASP-DAC’05 Proceedings of the 2005
Asia and South Pacific Design Automation Conference. 2005. P. 1002–1005. DOI:
10.1145/1120725.1120777 (дата обращения: 20.04.2014).
12. Miller D.M., Maslov D.A., Dueck G.W. A Transformation Based Algorithm for
Reversible Logic Synthesis // DAC’03 Proceedings of the 40th annual Design
Automation Conference. 2003. P. 318–323. DOI: 10.1145/775832.775915 (дата
обращения: 20.04.2014).
13. Miller D.M. Spectral and Two-Place Decomposition Techniques in Reversible
Logic // MWSCAS’02 Proceedings of the 45th Midwest Symposium on Circuits
and Systems Conference. 2002. P. 493–496. DOI: 10.1109/MWSCAS.2002.1186906
(дата обращения: 20.04.2014).
14. Saeedi M., Sedighi M. , Zamani M.S. A Novel Synthesis Algorithm for Reversible
Circuits // ICCAD’07 Proceedings of International Conference on Computer-Aided
Design. 2007. P. 65–68. DOI:10.1109/ICCAD.2007.4397245 (дата обращения:
20.04.2014).
15. Yang G. , Song X., Hung W.N., Xie F., Perkowski M.A. Group Theory Based Synthesis
of Binary Reversible Circuits // TAMC’06 Proceedings of the Third international
conference on Theory and Applications of Models of Computation. 2006.
P. 365–374. DOI: 10.1007/11750321_35 (дата обращения: 20.04.2014).
REFERENCES
[1] Shannon C.E. The synthesis of two-terminal switching circuits. Bell Syst. Tech. J.,
1949, vol. 28, no. 1, pp. 59–98.
[2] Yablonskiy S.V. Vvedenie v diskretnuyu matematiku [Introduction to discrete
mathematics]. Moscow, Nauka Publ., 1986. 384 p.
[3] Interlando J.C. Toward a theory of one-way functions via gate complexity of boolean
functions. Ph. D. Dissertation, USA, Indiana, University of Notre Dame, 2006. 100 p.
[4] Feynman R. Quantum mechanical computers. Optics News , 1985, vol. 11,
no. 2, pp. 11–20. Available at: (accessed
07.05.2014).
[5] Maslov D.A. Reversible Logic Synthesis. Ph. D. Dissertation, Canada, N.B.,
University of New Brunswick Fredericton, 2003. 165 p.
[6] Zakablukov D.V. Reduction of the reversible circuits gate complexity without using
the equivalent replacement tables for the gate compositions. Jelektr. Nauchno-
Tehn. Izd. “Nauka i obrazovanie” MGTU im. N.E. Baumana [El. Sc.-Tech. Publ.
“Science and Education” of Bauman MSTU], 2014, no. 3. (in Russ.). DOI:
10.7463/0314.0699195
[7] Shende V.V., Prasad A.K., Markov I.L., Hayes J.P. Synthesis of reversible logic
circuits. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems,
2003, vol. 22, no. 6, pp. 710–722.
ISSN 0236-3933. Вестник МГТУ им. Н.Э. Баумана. Сер. “Приборостроение”. 2015. № 1 81