Data Centers

Simplification of Boolean Algebra Through DNA Computing

Date Added: Aug 2010
Format: PDF

DNA Computing utilizes the properties of DNA for performing the computations. The computations include arithmetic and logical operations such as simplification of Boolean expression to its simplest form. Boolean function can be built from ANDs, ORs, and NOTs using minterm expansion. However, a practicing computer engineer will very rarely be satisfied with a minterm expansion, because as a rule, it requires more gates than necessary. The laws and identities of Boolean algebra will almost always allow one to simplify a minterm expansion. The efficiency of a logic circuit is high when the number of logic gates used to build it is small.