IEEE Transactions on Circuits & Systems II Express Briefs · 2010 · 22 citations · 18 references
ComputingComputer ScienceAlgorithmsData StructuresNumber TheoryError CorrectionSimple AdditionAdder DesignAddersLow-power Adders
In this brief, we proposed improved area-efficient weighted modulo 2 <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i> + 1 adders. This is achieved by modifying existing diminished-1 modulo 2 <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i> + 1 adders to incorporate simple correction schemes. Our proposed adders can produce modulo sums within the range {0, 2 <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i> }, which is more than the range {0, 2 <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i> - 1} produced by existing diminished-1 modulo 2 <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i> + 1 adders. We have implemented the proposed adders using 0.13-¿m CMOS technology, and the area required for our adders is lesser than previously reported weighted modulo 2 <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i> + 1 adders with the same delay constraints.
18
A Regular Layout for Parallel Adders
Brent, Kung · IEEE Transactions on Computers · 1982 · 1.1K citations
Conditional-Sum Addition Logic
Jack Sklansky · IEEE Transactions on Electronic Computers · 1960 · 567 citations