2005 Asia-Pacific Conference on Applied Electromagnetics, 2005
ABSTRACT Optimized standard CMOS-domino logic to a low cost logic and high speed design is presen... more ABSTRACT Optimized standard CMOS-domino logic to a low cost logic and high speed design is presented. This paper combines a footless dynamic circuit with a robust self-timed inverted clocking scheme, a serial transistor is removed and capacitances at the output node are reduced in the new structures. This can be highly upgrade the operation speed of the circuit with very low power dissipation. Parametric simulation in Microwind 2 shows that over 20% performances enhancement is achieved. However, there are always the tradeoffs in designing high speed CMOS circuit and certain design issues need to be catered. CMOS-domino logic has been believed to gain its popularity in application of desktop computer and mobile devices in near future.
International Journal of Computer Science, Engineering and Applications, 2014
Although DNA computing has emerged as a new computing paradigm with its massive parallel computin... more Although DNA computing has emerged as a new computing paradigm with its massive parallel computing capabilities, the large number of DNA required for larger size of computational problems still remain as a stumbling block to its development as practical computing. In this paper, we propose a modification to implement a physical experimentation of two Boolean matrices multiplication problem with DNA computing. The Truncated Matrices reduces the number of DNA sequences and lengths utilized to compute the problem with DNA computing.
In this paper, we introduce an adaptive DNA computing algorithm by using polymerase chain reactio... more In this paper, we introduce an adaptive DNA computing algorithm by using polymerase chain reaction (PCR) and restriction enzyme. The adaptive algorithm is designed based on Adleman-Lipton paradigm[3] of DNA computing. In this work, however, unlike the Adleman- Lipton architecture a cutting operation has been introduced to the algorithm and the mechanism in which the molecules used by computation were feedback to the next cycle devised. Moreover, the amplification by PCR is performed in the molecule used by feedback and the difference concentration arisen in the base sequence can be used again. By this operation the molecules which serve as a solution candidate can be reduced down and the optimal solution is carried out in the shortest path problem. The validity of the proposed adaptive algorithm is considered with the logical simulation and finally we go on to propose applying adaptive algorithm to the chemical experiment which used the actual DNA molecules for solving an optimal network problem.
This paper presents a new approach to solve Boolean matrix multiplication using a bio-inspired ev... more This paper presents a new approach to solve Boolean matrix multiplication using a bio-inspired evolutionary method with DNA computing. While there are many papers proposing the use of DNA for actual computation, very few of these theories are realized in laboratory experiments and those which are successfully implemented are mostly based on protocols introduced in Adleman-Lipton architecture. The use of restriction enzymes in Adleman-Lipton protocols is a limiting factor for the number of synthesizable unique sequences in DNA computing. Synthesized primers are needed to initially generate possible solutions, increasing the complexity and becoming a hurdle for DNA computing to be used for larger computations despite its massive parallel processing characteristics. The hybridization-ligation method used as initial pool generation also has its drawbacks in terms of generation speed and material consumption. In this paper, we introduce a method to implement Boolean matrix multiplication with DNA computing which is less time consuming and less complexities in its designs by eliminating the use of restriction enzymes and by using parallel overlap assembly (POA) method as initial pool generation replacing hybridization-ligation method.
2005 Asia-Pacific Conference on Applied Electromagnetics, 2005
ABSTRACT Optimized standard CMOS-domino logic to a low cost logic and high speed design is presen... more ABSTRACT Optimized standard CMOS-domino logic to a low cost logic and high speed design is presented. This paper combines a footless dynamic circuit with a robust self-timed inverted clocking scheme, a serial transistor is removed and capacitances at the output node are reduced in the new structures. This can be highly upgrade the operation speed of the circuit with very low power dissipation. Parametric simulation in Microwind 2 shows that over 20% performances enhancement is achieved. However, there are always the tradeoffs in designing high speed CMOS circuit and certain design issues need to be catered. CMOS-domino logic has been believed to gain its popularity in application of desktop computer and mobile devices in near future.
International Journal of Computer Science, Engineering and Applications, 2014
Although DNA computing has emerged as a new computing paradigm with its massive parallel computin... more Although DNA computing has emerged as a new computing paradigm with its massive parallel computing capabilities, the large number of DNA required for larger size of computational problems still remain as a stumbling block to its development as practical computing. In this paper, we propose a modification to implement a physical experimentation of two Boolean matrices multiplication problem with DNA computing. The Truncated Matrices reduces the number of DNA sequences and lengths utilized to compute the problem with DNA computing.
In this paper, we introduce an adaptive DNA computing algorithm by using polymerase chain reactio... more In this paper, we introduce an adaptive DNA computing algorithm by using polymerase chain reaction (PCR) and restriction enzyme. The adaptive algorithm is designed based on Adleman-Lipton paradigm[3] of DNA computing. In this work, however, unlike the Adleman- Lipton architecture a cutting operation has been introduced to the algorithm and the mechanism in which the molecules used by computation were feedback to the next cycle devised. Moreover, the amplification by PCR is performed in the molecule used by feedback and the difference concentration arisen in the base sequence can be used again. By this operation the molecules which serve as a solution candidate can be reduced down and the optimal solution is carried out in the shortest path problem. The validity of the proposed adaptive algorithm is considered with the logical simulation and finally we go on to propose applying adaptive algorithm to the chemical experiment which used the actual DNA molecules for solving an optimal network problem.
This paper presents a new approach to solve Boolean matrix multiplication using a bio-inspired ev... more This paper presents a new approach to solve Boolean matrix multiplication using a bio-inspired evolutionary method with DNA computing. While there are many papers proposing the use of DNA for actual computation, very few of these theories are realized in laboratory experiments and those which are successfully implemented are mostly based on protocols introduced in Adleman-Lipton architecture. The use of restriction enzymes in Adleman-Lipton protocols is a limiting factor for the number of synthesizable unique sequences in DNA computing. Synthesized primers are needed to initially generate possible solutions, increasing the complexity and becoming a hurdle for DNA computing to be used for larger computations despite its massive parallel processing characteristics. The hybridization-ligation method used as initial pool generation also has its drawbacks in terms of generation speed and material consumption. In this paper, we introduce a method to implement Boolean matrix multiplication with DNA computing which is less time consuming and less complexities in its designs by eliminating the use of restriction enzymes and by using parallel overlap assembly (POA) method as initial pool generation replacing hybridization-ligation method.
Uploads
Papers by Nordiana Rajaee