Author(s): Hatem BOUKADIDA, | Nejib HASSEN, | Zied GAFSI, | Kamel BESBES
Journal: International Journal of Engineering Science and Technology
ISSN 0975-5462
Volume: 3;
Issue: 5;
Start page: 4498;
Date: 2011;
VIEW PDF
DOWNLOAD PDF 
Original page
Keywords: Computer arithmetic | Redundant binary representation | BOOTH | BRAUN and WALLACE multiplier schemes.
ABSTRACT
A comparative study of different types of digital multipliers based on the A2 redundant binary representation is investigated in this paper. Some techniques have been proposed and implemented using different ALTERA Stratix FPGA platforms. The principle is to try to reduce the number of partial products terms to be summed with addition trees. These techniques are based on exploiting the associative and commutative properties of the addition operation. The multiplication was achieved using four schemes which are respectively the trivial scheme, the BRAUN scheme, the BOOTH scheme and finally the Carry-Save Wallace scheme. Two input A2- Natural transcoders and one output Natural-A2 transcoder are deployed to translate between the classical and the new A2 redundant binary representation. Synthesis results show that the A2-BRAUN multiplier requires lessarea than the conventional one. It was also noticed that the A2-Wallace multiplier offers better speed performance with respect to others schemes.
Journal: International Journal of Engineering Science and Technology
ISSN 0975-5462
Volume: 3;
Issue: 5;
Start page: 4498;
Date: 2011;
VIEW PDF
DOWNLOAD PDF Original pageKeywords: Computer arithmetic | Redundant binary representation | BOOTH | BRAUN and WALLACE multiplier schemes.
ABSTRACT
A comparative study of different types of digital multipliers based on the A2 redundant binary representation is investigated in this paper. Some techniques have been proposed and implemented using different ALTERA Stratix FPGA platforms. The principle is to try to reduce the number of partial products terms to be summed with addition trees. These techniques are based on exploiting the associative and commutative properties of the addition operation. The multiplication was achieved using four schemes which are respectively the trivial scheme, the BRAUN scheme, the BOOTH scheme and finally the Carry-Save Wallace scheme. Two input A2- Natural transcoders and one output Natural-A2 transcoder are deployed to translate between the classical and the new A2 redundant binary representation. Synthesis results show that the A2-BRAUN multiplier requires lessarea than the conventional one. It was also noticed that the A2-Wallace multiplier offers better speed performance with respect to others schemes.
