Computer arithmetic algorithms / Israel Koren
Tipo de material: TextoDetalles de publicación: Natick : AK Peters, 2001 Edición: 2nd ed.Descripción: XV, 281 p. : il. ; 25 cmISBN: 1568811608Tema(s): Algoritmos computacionales | Estructuras de datos (Informática)Resumen: This text explains the fundamental principles of algorithms available for performing arithmetic operations on digital computers. These include basic arithmetic operations like addition, subtraction, multiplication, and division in fixed-point and floating-point number systems as well as more complex operations such as square root extraction and evaluation of exponential, logarithmic, and trigonometric functions. The algorithms described are independent of the particular technology employed for their implementation. Numerical examples illustrate the working of the algorithms presented and explain the concepts behind the algorithms without relying on gate diagrams. This new edition includes sections on floating-point adders, floating-point exceptions, general carry-look-ahead adders, prefix adders, Ling adders, and fused multiply-add units. New algorithms and implementations have been added to almost all chapters.Tipo de ítem | Biblioteca de origen | Signatura | URL | Estado | Fecha de vencimiento | Código de barras | Reserva de ítems |
---|---|---|---|---|---|---|---|
Monografías | 03. BIBLIOTECA INGENIERÍA PUERTO REAL | 681.3/KOR/com (Navegar estantería(Abre debajo)) | Texto completo | Disponible Ubicación en estantería | Bibliomaps® | 374137731X |
Indice
Bibliografía
This text explains the fundamental principles of algorithms available for performing arithmetic operations on digital computers. These include basic arithmetic operations like addition, subtraction, multiplication, and division in fixed-point and floating-point number systems as well as more complex operations such as square root extraction and evaluation of exponential, logarithmic, and trigonometric functions. The algorithms described are independent of the particular technology employed for their implementation. Numerical examples illustrate the working of the algorithms presented and explain the concepts behind the algorithms without relying on gate diagrams. This new edition includes sections on floating-point adders, floating-point exceptions, general carry-look-ahead adders, prefix adders, Ling adders, and fused multiply-add units. New algorithms and implementations have been added to almost all chapters.
No hay comentarios en este titulo.