Date Added: Jun 2011
This paper presents the method of extending from the evolution of a simple 1-bit adder and its simulation statistics to evolve 2-bit multiplier using modification genotype selection resulting in the reduction of appreciable computational efforts compared to conventional genotypes. The proposed method is also useful to have faster evolution which is one of the major bottlenecks of intrinsic evolution. For a 1-bit adder the number of generations required to get best fit gene is obtained using proposed novel Cartesian genetic algorithm as 171 for 100 runs of 1000 generations assuming highest fitness as 16. The results of this basic element using modified genotype are extended to 2-bit multiplier for the comparison of computational efforts obtained with conventional genotype.