Multiplication is one of the most commonly used arithmetic operations. Multipliers have a significant impact on the speed and power dissipation of arithmetic circuits. However, in many applications precise results are not always required. Error-tolerant algorithms and applications encouraged the development of approximate multipliers because in this way the resource requirements are reduced. The thesis focuses on the implementation and comparison of some basic approximate multipliers in the logarithmic number system.
The following multipliers are implemented: Mitchell's algorithm based multiplier (MA), Operand decomposition Mitchell-based algorithm (OD-MA) multiplier, 2-region algorithm multiplier (2-region) and 3-region algorithm multiplier (3-region).
According to the criteria of approximation error and implementation complexity, a comparison of implementations of multipliers is made.
|
