Abstract
In recent years, substantial advancements have been made in VLSI technology. With the introduction of CMOL(Cmos\nanowire\MOLecular Hybrid), higher circuit densities are possible. In CMOL there is an additional layer of nanofabricon top of CMOS stack. Nanodevices that lie between overlapping nanowires are programmable and can implement anycombinational logic using a netlist of NOR gates. The limitation on the length of nanowires put a constraint on theconnectivity domain of a circuit. The gates connected to each other must be within a connectivity radius; otherwise an extrabuffer is inserted to connect them. Particle swarm optimization (PSO) has been used in a variety of problems that are NPhard.PSO compared to the other iterative heuristic techniques is simpler to implement. Besides, it delivers comparableresults. In this paper, a hybrid of PSO and simulated annealing (SA) for solving the cell assignment in CMOL, an NP-hardproblem, is proposed. The proposed method takes advantage of the exploration and exploitation factors of PSO and theintrinsic hill climbing feature of SA to reduce the number of buffers to be inserted. Experiments conducted on ISCAS’89benchmark circuits and a comparison with other heuristic techniques, are presented. Results showed that the proposedhybrid algorithm achieved better solution in terms of buffer count in reasonable time.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.