Mayukh Sarkar

Reversible circuit synthesis using ACO and SA based Quine-McCluskey method

With the tremendous growth in VLSI technology in recent years, the Integration density of the transistors has reached billions causing the scaling of transistors to touch the subatomic dimension in deep submicron regime where laws of classical physics can not survive. Due to inherent information loss and other factors associated with irreversible computing, reversible circuits are becoming more and more important in terms of computing for present and future days. However, due to several factors, known synthesis approaches of classical Boolean logic like Karnaugh Map and Quine-McCluskey method cannot be applied directly to synthesize a reversible logic. In this paper, we propose a stochastic procedure to synthesize a reversible circuit. This procedure is based on a modified version of classical Quine-McCluskey method and is being used under the wrapper of two intelligent stochastic search techniques, Simulated Annealing and Ant Colony Optimization. The experimental results are quite encouraging.

Implementing Data Structure Using DNA: An Alternative in Post CMOS Computing

DNA computing has attracted the eyes of many researchers in recent years to solve NP-complete problems. It over-performs conventional computers due to its inherent massively parallelism nature. But to make it generally applicable, problems those are very much implement able on conventional computers, should also be implement able on a DNA computer. To implement those problems, data structures are unavoidable. In this work, possible implementations of several data structures viz stack, queue, list with insertions and deletions at random indexes have been presented. Additionally, maps and possible operations on them have been proposed. Proposed implementations are kept extremely simple, and can be practically implemented quite easily. This work is expected to serve as an important step towards the applicability of a DNA computer and to prove its efficacy as a promising alternative in tomorrows post CMOS computing paradigm.

Minimal reversible circuit synthesis on a DNA computer

DNA computing has attracted the attention of many a researcher in recent years for its applicability to solve computationally hard problems. It can over-perform conventional computers with its inherent massively parallelism nature. On the other hand, proper synthesis of reversible circuit is a well researched computing problem in recent days for its extremely low power consumption (ideally zero) and inherent reversible nature of reversible logic. Minimum synthesis of a reversible truth table means finding the reversible circuit made up of reversible gates satisfying given truth table with minimum cost. But none of the approaches running on conventional computers can perform minimum synthesis till date without using brute-force DFS tree search. On the other hand, DFS tree-search approach can not be reasonably implemented for larger circuits as searching a DFS tree is extremely costly on a conventional computer. In this paper, first, a procedure to search a DFS tree in constant time has been proposed to run on a DNA computer. Second, another procedure has also been proposed to apply a reversible gate on a reversible truth table in linear time that can be used to generate a DFS tree library. Finally, the generated library can then be searched in constant time to get minimum reversible circuit given a reversible truth table. An analytical feasibility study has been done and a novel methodology has been developed that can extend enormous scope of future research in this area. To the best of authors’ knowledge this is a pioneering approach to bridge reversible computing and DNA computing.

Computing in Ribosomes: Performing Boolean Logic Using mRNA-Ribosome System

Continuous increase in bottlenecks with silicon-based conventional computers inspired researchers around the world to search for a non-conventional computing alternative that led to the development of DNA Computing, Quantum Computing etc. Each computing technologies came with their own advantages and disadvantages. Biology has inspired the computing through the pathway of DNA Computing. Since its inception it has been proven to be a powerful approach to solve computationally hard problems. But to solve otherwise general problems it needs mathematical ability. It lacks this ability in the sense that several manual interventions are required here. Moreover, the biomolecular operations in the DNA Labs are also slow to perform. To overcome this another molecule residing in the cell viz. ribosome can be used. Its automated procedure of translation can be used to perform the required operation. Recent development of artificial ribosome and the possibility of mutations in rRNAs residing in the ribosome has enabled the pathway of computation without any manual interventions. It can operate automatically at the speed of natural operations getting performed inside a living cell. This work has proposed a pathway to perform logic operations using the ribosomes.