Algoritmo de Booth en operaciones de suma y resta de enteros

Abstract

espanolEl algoritmo dado por Andrew Donald Booth en 1950 (Booth, 1951) para la multiplicacion es considerablemente potente como para limitar su uso unicamente a dicha operacion, se puede aplicar a cualquier operacion algebraica que se construya como una sucesion de computos de otra operacion que la compone (Ayuso 2015, pp. 113-119). De ahi que en el presente documento, se proponga una implementacion fisica de suma y resta de numeros enteros basado en dicho concepto. Se vera una alternativa al hardware tradicional basado en celdas FULL-ADDER y FULL-SUBTRACTOR, describiendo un nuevo tipo de celdas, que seran designados como FULL-SUCCESSOR y FULL-PREDECESSOR, fruto de llevarnos a nivel fisico la tecnica de Booth para implementar la suma o resta de 2 numeros enteros. EnglishThe algorithm given by Andrew Donald Booth in 1950 (Booth, 1951) for multiplication is considerably powerful to limit its use to only one operation of the word, any operation can be applied that is constructed as a succession of computations of another operation that the compone (Ayuso 2015, pp. 113-119). Hence, in this paper, a physical implementation of addition and subtraction of integers based on this concept is proposed. You will see an alternative to traditional hardware based on FULL-ADDER and FULL-SUBTRACTOR cells, describing a new type of cells, which have been designated as FULL-SUCCESSOR and FULL-PREDECESSOR, the result of carrying out a physical level of Booth's technique for implement the addition or subtraction of 2 integers.