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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computer Principles and Design in Verilog HDL s. 63 - 110
Hlavní autoři: Li, Yamin, Tsinghua University Press
Médium: Kapitola
Jazyk:angličtina
Vydáno: Singapore Wiley 2015
John Wiley & Sons, Incorporated
John Wiley & Sons, Ltd
Témata:
binary addition algorithms
binary division algorithms
binary multiplication algorithms
binary square root algorithms
binary subtraction algorithms
carry‐lookahead adder
Verilog HDL
Wallace tree
ISBN:1118841093, 9781118841099
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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