Novel designs of nanometric parity preserving reversible compressor

被引:9
|
作者
Shoaei, Soghra [1 ]
Haghparast, Majid [2 ]
机构
[1] Islamic Azad Univ, Tabriz Branch, Dept Comp Engn, Tabriz, Iran
[2] Islamic Azad Univ, Yadegare Imam Khomeini Branch, Dept Comp Engn, Tehran, Iran
关键词
Reversible logic; Quantum circuits; Nanometric circuits; Parity preservation; Reversible compressor; Theoretical physics; QUANTUM GATES; REALIZATION; GENERATION; ALGORITHM;
D O I
10.1007/s11128-014-0762-6
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
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 distribution of errors in the quantum circuit, the reversible logic gates must be converted into fault-tolerant quantum operations. Parity preserving is used to realize fault tolerant in this circuits. This paper proposes a new parity preserving reversible gate. We named it NPPG gate. The most significant aspect of the NPPG gate is that it can be used to produce parity preserving reversible full adder circuit. The proposed parity preserving reversible full adder using NPPG gate is more efficient than the existing designs in term of quantum cost and it is optimized in terms of number of constant inputs and garbage outputs. Compressors are of importance in VLSI and digital signal processing applications. Effective VLSI compressors reduce the impact of carry propagation of arithmetic operations. They are built from the full adder blocks. We also proposed three new approaches of parity preservation reversible 4:2 compressor circuits. The third design is better than the previous two in terms of evaluation parameters. The important contributions have been made in the literature toward the design of reversible 4:2 compressor circuits; however, there are not efforts toward the design of parity preservation reversible 4:2 compressor circuits. All the scales are in the nanometric criteria.
引用
收藏
页码:1701 / 1714
页数:14
相关论文
共 50 条
  • [1] Novel designs of nanometric parity preserving reversible compressor
    Soghra Shoaei
    Majid Haghparast
    [J]. Quantum Information Processing, 2014, 13 : 1701 - 1714
  • [2] A Novel Nanometric Parity-Preserving Reversible Carry-Lookahead Adder
    Asri, Saeedeh
    Haghparast, Majid
    [J]. IETE JOURNAL OF RESEARCH, 2017, 63 (03) : 325 - 335
  • [3] Novel Parity-Preserving Designs of Reversible 4-Bit Comparator
    Qi, Xue-mei
    Chen, Fu-long
    Wang, Hong-tao
    Sun, Yun-xiang
    Guo, Liang-min
    [J]. INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 2014, 53 (04) : 1092 - 1102
  • [4] Novel Parity-Preserving Designs of Reversible 4-Bit Comparator
    Xue-mei Qi
    Fu-long Chen
    Hong-tao Wang
    Yun-xiang Sun
    Liang-min Guo
    [J]. International Journal of Theoretical Physics, 2014, 53 : 1092 - 1102
  • [5] Reversible Logic Multipliers: Novel Low-cost Parity-Preserving Designs
    Eslami-Chalandar, F.
    Valinataj, M.
    Jazayeri, H.
    [J]. INTERNATIONAL JOURNAL OF ENGINEERING, 2019, 32 (03): : 381 - 392
  • [6] Parity Preserving Adder/Subtractor using a Novel Reversible Gate
    Khandelwal, Ragani
    Saini, Sandeep
    [J]. 2015 FIFTH INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS AND NETWORK TECHNOLOGIES (CSNT2015), 2015, : 885 - 888
  • [7] Novel Optimum Parity-Preserving Reversible Multiplier Circuits
    Ehsan PourAliAkbar
    Keivan Navi
    Majid Haghparast
    Midia Reshadi
    [J]. Circuits, Systems, and Signal Processing, 2020, 39 : 5148 - 5168
  • [8] Novel parity-preserving reversible logic array multipliers
    Valinataj, Mojtaba
    [J]. JOURNAL OF SUPERCOMPUTING, 2017, 73 (11): : 4843 - 4867
  • [9] Novel Optimum Parity-Preserving Reversible Multiplier Circuits
    PourAliAkbar, Ehsan
    Navi, Keivan
    Haghparast, Majid
    Reshadi, Midia
    [J]. CIRCUITS SYSTEMS AND SIGNAL PROCESSING, 2020, 39 (10) : 5148 - 5168
  • [10] Novel parity-preserving reversible logic array multipliers
    Mojtaba Valinataj
    [J]. The Journal of Supercomputing, 2017, 73 : 4843 - 4867