This document discusses and compares different types of parallel prefix adders. It begins by introducing binary adders and describing the three stages of prefix addition: pre-computation, prefix-computation, and post-computation. It then describes several types of carry tree adders, including Brent-Kung, Kogge-Stone, Ladner-Fischer, and Han-Carlson adders. While Kogge-Stone and Han-Carlson adders have the fastest delay for ASIC implementation, carry chain structures on FPGAs make simple adders faster for FPGA implementation. The document proposes modifying the Kogge-Stone adder with fast carry logic to make it more suitable for FPGAs. Simulation results show that the