Hafiz M. H. Babu - Reversible and DNA Computing

Здесь есть возможность читать онлайн «Hafiz M. H. Babu - Reversible and DNA Computing» — ознакомительный отрывок электронной книги совершенно бесплатно, а после прочтения отрывка купить полную версию. В некоторых случаях можно слушать аудио, скачать через торрент в формате fb2 и присутствует краткое содержание. Жанр: unrecognised, на английском языке. Описание произведения, (предисловие) а так же отзывы посетителей доступны на портале библиотеки ЛибКат.

Reversible and DNA Computing: краткое содержание, описание и аннотация

Предлагаем к чтению аннотацию, описание, краткое содержание или предисловие (зависит от того, что написал сам автор книги «Reversible and DNA Computing»). Если вы не нашли необходимую информацию о книге — напишите в комментариях, мы постараемся отыскать её.

Master the subjects of reversible computing and DNA computing with this expert volume Reversible and DNA Computing  Reversible and DNA Computing  Advanced logic design An introduction to the fundamentals of reversible computing Advanced reversible logic synthesis Reversible fault tolerance Fundamentals of DNA computing Reversible DNA logic synthesis DNA logic design This book is perfect for undergraduate and graduate students in the physical sciences and engineering, as well as those working in the field of quantum computing. It belongs on the bookshelves of anyone with even a passing interest in nanotechnology, energy-efficient computing, and DNA computing.

Reversible and DNA Computing — читать онлайн ознакомительный отрывок

Ниже представлен текст книги, разбитый по страницам. Система сохранения места последней прочитанной страницы, позволяет с удобством читать онлайн бесплатно книгу «Reversible and DNA Computing», без необходимости каждый раз заново искать на чём Вы остановились. Поставьте закладку, и сможете в любой момент перейти на страницу, на которой закончили чтение.

Тёмная тема
Сбросить

Интервал:

Закладка:

Сделать

(1.11.1) Reversible and DNA Computing - изображение 146

where

= Quantum gate calculation complexity

= A quantum NOT gate

= A quantum CNOT gate

= A quantum controlled‐V (controlled‐) gate

Figure 16Block diagram of the reversible FRG gate Figure 17Quantum - фото 147

Figure 1.6Block diagram of the reversible FRG gate.

Figure 17Quantum representation of a reversible FRG gate Example 110 - фото 148

Figure 1.7Quantum representation of a reversible FRG gate.

Example 1.10

Figure 1.7shows the quantum representation of a reversible Fredkin (FRG) gate. The figure describes that there is only one NOT operation, four quantum CNOT operations, and three quantum controlled‐V (controlled‐ Reversible and DNA Computing - изображение 149) operations. So, the quantum gate calculation complexity of the reversible FRG gate is Reversible and DNA Computing - изображение 150.

1.12 Fan‐Out

Fan‐out is a term that defines the maximum number of inputs in which the output of a single logic gate can be fed. The fan‐out of any reversible circuit is 1.

Example 1.11

The fan‐out of any reversible circuit is 1.

1.13 Self‐Reversible

A gate is said to be self‐reversible if its dual combination is the same as itself.

Example 1.12

In Figure 1.8, there are two Toffoli gates that are in the cascading form. If the outputs of the first Toffoli gate are fed to the input of the second Toffoli gate, then the output of the second Toffoli gate is equal to the input of the first Toffoli gate. Here the outputs of first gate are P, Q , and R , where P = A , Q = B , and R = AB картинка 151 C . Then the outputs of second gate are X, V , and Z , where X = A, Y = B , and Z = AB картинка 152 AB картинка 153 C = 0 картинка 154 C = C .

1.14 Reversible Computation

In a reversible circuit, correct output is found by applying correct input instance and controlling one or more inputs if needed. Feynman gate (FG) is already presented to illustrate the idea of garbage output, Feynman gate is 2 картинка 1552 reversible gate where inputs are A, B, and corresponding functions are P = A, Q = A картинка 156 B . The Feynman gate is used here to show how to control input to produce expected output. Both the inputs A and B are used as control inputs, and their impact on output is shown below.

Figure 18Toffoli gates as selfreversible A as control input For output - фото 157

Figure 1.8Toffoli gates as self‐reversible.

A as control input:

For , output , and ,

For , output , and .

B as control input:

For , output , and .

For , output , and .

It is better to note that when B is used as control input and картинка 158, both the outputs P = B and Q = A . By controlling B , the copies of A can be created. This circuit can be easily used as a copying circuit.

1.15 Area

The area of a logic circuit is the summation of individual areas of each gate of the circuit. Suppose a reversible circuit consists of n reversible gates. Area of those n gates are Reversible and DNA Computing - изображение 159. Then by using above definition area, denoted by A , of that circuit is

Reversible and DNA Computing - изображение 160

The above definition for the area of a circuit can be calculated easily by obtaining area of each individual gate using CMOS 45 nm Open Cell Library and Synopsis Design Compiler.

Area of a gate can also be defined by the feature size. This size varies according to the number of quantum gates. As the basic quantum gates are fabricated with quantum dots with the size ranges from several to tens of nanometers ( картинка 161m) in diameter, the size of the basic quantum gates ranges from 50–300 Å. Quantum circuits can be implemented with the basic quantum gates and the number of quantum gates depends on the number of basic quantum gates needed to implement it. So, the area of a gate can be defined as follows: Area = Number of quantum gates картинка 162Size of basic quantum gates.

1.16 Design Constraints for Reversible Logic Circuits

The following are the important design constraints for reversible logic circuits:

Reversible logic gates do not allow fan‐outs.

The reversible logic circuits should have minimum number of reversible gates.

Reversible logic circuits should have minimum quantum cost.

The design can be optimized so as to produce minimum number of garbage outputs.

The reversible logic circuits must use minimum number of constant inputs.

The reversible logic circuits must use a minimum logic depth or gate levels.

Reversible logic circuits should have minimum area and power.

The reversible logic circuits must use minimum hardware complexity and minimum quantum gate calculation complexity.

1.17 Quantum Analysis of Different Reversible Logic Gates

Calculating quantum cost of reversible circuit is always an interesting one. Quantum circuits, DNA technologies, nano‐technologies and optical computing are the most common applications of quantum theory. Every reversible gate can be calculated in terms of quantum cost and hence the reversible circuits can be measured in terms of quantum cost. Reducing the quantum cost from reversible circuit is always a challenging issue and research are still going on in this area. In this section, the quantum equivalent diagram of some popular reversible gate is presented.

Читать дальше
Тёмная тема
Сбросить

Интервал:

Закладка:

Сделать

Похожие книги на «Reversible and DNA Computing»

Представляем Вашему вниманию похожие книги на «Reversible and DNA Computing» списком для выбора. Мы отобрали схожую по названию и смыслу литературу в надежде предоставить читателям больше вариантов отыскать новые, интересные, ещё непрочитанные произведения.


Отзывы о книге «Reversible and DNA Computing»

Обсуждение, отзывы о книге «Reversible and DNA Computing» и просто собственные мнения читателей. Оставьте ваши комментарии, напишите, что Вы думаете о произведении, его смысле или главных героях. Укажите что конкретно понравилось, а что нет, и почему Вы так считаете.