Proofs of Correctness and Properties of Integer Adder Circuits

被引：8

作者：

Chen, Gang ^{[1
]}

Liu, Feng ^{[2
]}

机构：

[1] Lingcore Lab, King City, OR 97224 USA

[2] Natl Lab Parallel Distributed Proc, Changsha 410073, Hunan, Peoples R China

来源：

IEEE TRANSACTIONS ON COMPUTERS | 2010年 / 59卷 / 01期

关键词：

Formal method; computer arithmetic; adder circuits;

D O I：

10.1109/TC.2009.137

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Adder circuits have been extensively studied. Their formal properties are well known, but the proofs are either incomplete or difficult to find. This short contribution intends to integrate all formal proofs related to adders in a single place and to add the details when necessary. The presentation is accessible to general VLSI designer. Another goal of this study is to put together relevant materials for the preparation of further formal studies in computer arithmetic. The presentation is made as concise as possible.

引用

页码：134 / 136

页数：3

共 9 条

[1] [Anonymous], 2018, Computer Arithmetic Algorithms
[2] A REGULAR LAYOUT FOR PARALLEL ADDERS
BRENT, RP
KUNG, HT
[J]. IEEE TRANSACTIONS ON COMPUTERS, 1982, 31 (03) : 260 - 264
[3] Jackson R., 2004, Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers (IEEE Cat. No.04CH37592), P1350
[4] Mechanical verification of adder circuits using Rewrite Rule Laboratory
Kapur, D
Subramaniam, M
[J]. FORMAL METHODS IN SYSTEM DESIGN, 1998, 13 (02) : 127 - 158
[5] PARALLEL ALGORITHM FOR EFFICIENT SOLUTION OF A GENERAL CLASS OF RECURRENCE EQUATIONS
KOGGE, PM
STONE, HS
[J]. IEEE TRANSACTIONS ON COMPUTERS, 1973, C-22 (08) : 786 - 793
[6] PARALLEL PREFIX COMPUTATION
LADNER, RE
FISCHER, MJ
[J]. JOURNAL OF THE ACM, 1980, 27 (04) : 831 - 838
[7] A SPANNING TREE CARRY LOOKAHEAD ADDER
LYNCH, T
SWARTZLANDER, EE
[J]. IEEE TRANSACTIONS ON COMPUTERS, 1992, 41 (08) : 931 - 939
[8] ODONNELL J, 2004, J FUNCTIONAL PROGRAM, V14, P127
[9] Sheeran M, 2005, J UNIVERS COMPUT SCI, V11, P1135

← 1 →