Читать книгу Reversible and DNA Computing - Hafiz M. H. Babu - Страница 35

1.10 Hardware Complexity

Оглавление

The hardware complexity of a reversible logic circuit specifies the total number of Ex‐OR operations, NOT operations, and AND operations used in the circuit. Consequently, the hardware complexity can be determined using the following equation:

(1.10.1)

where

  = Hardware complexity (total logical operations)

  = A two input EX‐OR gate logical operation

  = A two input AND gate logical operation

  = A NOT gate logical operation

Reversible and DNA Computing

Подняться наверх