Comparison Among Booth’s and Pekmestzi’s Algorithms for the Multiplication of Two Numbers

Cargando...
Miniatura

Fecha

2003

Autores

Rojas-Laguna, Roberto
Villalón-Turrubiates, Iván E.
Serrano-Arellano, Santiago
Alvarado-Méndez, Edgar
Estudillo-Ayala, Juan M.
Vite-Chávez, Osvaldo

Título de la revista

ISSN de la revista

Título del volumen

Editor

Institute of Electrical and Electronics Engineers

Resumen

Descripción

A comparison between two different methods of multiplication of two 8-bit numbers is presented. This methods are the Booth’s algorithm and the algorithm proposed by Kiamal Z. Pekmestzi [1]. The general objective is to show the benefits and the advantages obtained if it’s used one of this algorithms over the other. This multipliers have low circuit complexity permitting high-speed operations and the interconnections of the cells are regular. This is the reason why the results shown was obtained using VHDL realization on a FPGA XC4010XL by Xilinx.

Palabras clave

Pekmestzi, Booth, Digital Multiplication

Citación

Iván E. Villalón-Turrubiates et al., “Comparison Among Booth’s and Pekmestzi’s Algorithms for the Multiplication of Two Numbers”, en Proceedings of the International Conference on Devices, Circuits and Systems (CIDCSVER), Veracruz México, 2003.