Speculative carry generation with prefix adder

Authors:
Youngmoon Choi;Earl E. Swartzlander
Affiliations:
Sun Microsystems, Inc., Austin, TX;Department of Electrical and Computer Engineering, The University of Texas at Austin, Austin, TX
Venue:
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Year:
2008

Citing 8
Cited 0

A Spanning Tree Carry Lookahead Adder

IEEE Transactions on Computers - Special issue on computer arithmetic
Parallel Prefix Computation

Journal of the ACM (JACM)
The Flagged Prefix Adder and its Applications in Integer Arithmetic

Journal of VLSI Signal Processing Systems
A Family of Adders

ARITH '01 Proceedings of the 15th IEEE Symposium on Computer Arithmetic
High-Speed Parallel-Prefix VLSI Ling Adders

IEEE Transactions on Computers
Parallel Prefix Adder Design with Matrix Representation

ARITH '05 Proceedings of the 17th IEEE Symposium on Computer Arithmetic
A Regular Layout for Parallel Adders

IEEE Transactions on Computers
Prenormalization rounding in IEEE floating-point operations using a flagged prefix adder

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A framework that generates formal prefix equations for speculative carry generation is presented. It is applicable to both normal carry and Ling carry adders and generates four forms of speculative carry generate prefix schemes (two forms for each carry case). For normal carry, one corresponds to an existing design and the other is newly introduced. For the Ling carry, both are newly proposed.