Andere Kunden interessierten sich auch für
![Constraint Solid Traveling Salesman Problem using Genetic Algorithm]( "Constraint Solid Traveling Salesman Problem using Genetic Algorithm")
Constraint Solid Traveling Salesman Problem using Genetic Algorithm26,99 €![Performance Analysis of Ternary Multiplier using Booth Encoding]( "Performance Analysis of Ternary Multiplier using Booth Encoding")
Performance Analysis of Ternary Multiplier using Booth Encoding26,99 €![General module to adaptive traffic lights using genetic algorithm]( "General module to adaptive traffic lights using genetic algorithm")
General module to adaptive traffic lights using genetic algorithm36,99 €![An intrusion detection system using machine learning algorithm]( "An intrusion detection system using machine learning algorithm")
An intrusion detection system using machine learning algorithm26,99 €![GENETIC ALGORITHM BASED CANNY DISTRIBUTED EDGE DETECTION USING XILINX]( "GENETIC ALGORITHM BASED CANNY DISTRIBUTED EDGE DETECTION USING XILINX")
GENETIC ALGORITHM BASED CANNY DISTRIBUTED EDGE DETECTION USING XILINX36,99 €![Data Mining of Objects Using Genetic Algorithm]( "Data Mining of Objects Using Genetic Algorithm")
Data Mining of Objects Using Genetic Algorithm26,99 €![Voice and Irish Based Automatic Moving Camera]( "Voice and Irish Based Automatic Moving Camera")
Voice and Irish Based Automatic Moving Camera26,99 €
Power dissipation is recognized as a critical parameter in modern VLSI design field. To satisfy MOORE'S law and to produce consumer electronics goods with more backup and less weight, low power VLSI design is necessary. Fast multipliers are essential parts of digital signal processing systems. The speed of multiply operation is of great importance in digital signal processing as well as in the general purpose processors today, especially since the media processing took off. In the past multiplication was generally implemented via a sequence of addition, subtraction, and shift operations. Multiplication can be considered as a series of repeated additions. The number to be added is the multiplicand, the number of times that it is added is the multiplier, and the result is the product. Each step of addition generates a partial product. In most computers, the operand usually contains the same number of bits. When the operands are interpreted as integers, the product is generally twice the length of operands in order to preserve the information content.