Computer Arithmetic Algorithms and Implementations

This chapter first introduces two types of the binary representations: unsigned number (absolute) and 2's complement representation for signed integers. It then describes the binary addition and subtraction algorithms and their implementations in Verilog HDL. A carry‐lookahead adder is also des...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computer Principles and Design in Verilog HDL S. 63 - 110
Hauptverfasser: Li, Yamin, Tsinghua University Press
Format: Buchkapitel
Sprache:Englisch
Veröffentlicht: Singapore Wiley 2015
John Wiley & Sons, Incorporated
John Wiley & Sons, Ltd
Schlagworte:
ISBN:1118841093, 9781118841099
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This chapter first introduces two types of the binary representations: unsigned number (absolute) and 2's complement representation for signed integers. It then describes the binary addition and subtraction algorithms and their implementations in Verilog HDL. A carry‐lookahead adder is also described. Next, the chapter discusses unsigned and signed binary multiplication algorithms and their implementations in Verilog HDL. The Wallace tree, which is a high‐speed multiplication circuit, is also introduced. It then introduces unsigned binary division algorithms, including the restoring algorithm, the non‐restoring algorithm, the Goldschmidt algorithm, and the Newton‐Raphson algorithm. The Verilog HDL codes that implement these algorithms and their simulation waveforms are also given. The chapter also introduces binary square root algorithms, including the restoring algorithm, the nonrestoring algorithm, the Goldschmidt algorithm, and the Newton‐Raphson algorithm. The Verilog HDL codes that implement these algorithms and their simulation waveforms are also given.
ISBN:1118841093
9781118841099
DOI:10.1002/9781118841105.ch3