Table of Contents
This project is an implementation of 16-bit Kogge Stone and Brent Kung adders. The implementation was done with Verilog.
The algorithm calculates the prefix tree for the last output. Then creates inverse tree for the obtaining the rest values. This adder is not the fastest, yet it has the lowest wiring tracks and fanout, which decreases area and delay respectively. The implementation can be found in Brent_Kung.v.
Kogge Stone creates prefix tree graph for each output. This adder is considered as one of the fastest and largest (in the terms of area) adder. However in the last level, it has large amount of wiring tracks which may decrease the speed. The implementation can be found in Kogge_Stone.v.
The programming language, frameworks, and technologies used in the project are listed here:
- Verilog
Implementation of 32-bit Brent Kung Adder
Mehrdad Nourbakhsh - mehrdad.nb4@gmail.com