The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Cet article présente une approche formelle pour vérifier les circuits arithmétiques en utilisant le calcul formel symbolique. Notre méthode décrit des circuits arithmétiques directement avec des objets mathématiques de haut niveau basés sur des systèmes de nombres pondérés et des formules arithmétiques. Une telle description de circuit peut être vérifiée efficacement par des techniques de réduction polynomiale utilisant les bases de Grobner. Dans cet article, nous décrivons comment le calcul formel symbolique peut être utilisé pour décrire et vérifier des circuits arithmétiques. Les effets avantageux de l'approche proposée sont démontrés par la vérification expérimentale de certains circuits arithmétiques tels que le multiplicateur-accumulateur et le filtre FIR. Le résultat montre que l'approche proposée a une possibilité certaine de vérifier des circuits arithmétiques pratiques.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Yuki WATANABE, Naofumi HOMMA, Takafumi AOKI, Tatsuo HIGUCHI, "Arithmetic Circuit Verification Based on Symbolic Computer Algebra" in IEICE TRANSACTIONS on Fundamentals,
vol. E91-A, no. 10, pp. 3038-3046, October 2008, doi: 10.1093/ietfec/e91-a.10.3038.
Abstract: This paper presents a formal approach to verify arithmetic circuits using symbolic computer algebra. Our method describes arithmetic circuits directly with high-level mathematical objects based on weighted number systems and arithmetic formulae. Such circuit description can be effectively verified by polynomial reduction techniques using Grobner Bases. In this paper, we describe how the symbolic computer algebra can be used to describe and verify arithmetic circuits. The advantageous effects of the proposed approach are demonstrated through experimental verification of some arithmetic circuits such as multiply-accumulator and FIR filter. The result shows that the proposed approach has a definite possibility of verifying practical arithmetic circuits.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e91-a.10.3038/_p
Copier
@ARTICLE{e91-a_10_3038,
author={Yuki WATANABE, Naofumi HOMMA, Takafumi AOKI, Tatsuo HIGUCHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Arithmetic Circuit Verification Based on Symbolic Computer Algebra},
year={2008},
volume={E91-A},
number={10},
pages={3038-3046},
abstract={This paper presents a formal approach to verify arithmetic circuits using symbolic computer algebra. Our method describes arithmetic circuits directly with high-level mathematical objects based on weighted number systems and arithmetic formulae. Such circuit description can be effectively verified by polynomial reduction techniques using Grobner Bases. In this paper, we describe how the symbolic computer algebra can be used to describe and verify arithmetic circuits. The advantageous effects of the proposed approach are demonstrated through experimental verification of some arithmetic circuits such as multiply-accumulator and FIR filter. The result shows that the proposed approach has a definite possibility of verifying practical arithmetic circuits.},
keywords={},
doi={10.1093/ietfec/e91-a.10.3038},
ISSN={1745-1337},
month={October},}
Copier
TY - JOUR
TI - Arithmetic Circuit Verification Based on Symbolic Computer Algebra
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 3038
EP - 3046
AU - Yuki WATANABE
AU - Naofumi HOMMA
AU - Takafumi AOKI
AU - Tatsuo HIGUCHI
PY - 2008
DO - 10.1093/ietfec/e91-a.10.3038
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E91-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2008
AB - This paper presents a formal approach to verify arithmetic circuits using symbolic computer algebra. Our method describes arithmetic circuits directly with high-level mathematical objects based on weighted number systems and arithmetic formulae. Such circuit description can be effectively verified by polynomial reduction techniques using Grobner Bases. In this paper, we describe how the symbolic computer algebra can be used to describe and verify arithmetic circuits. The advantageous effects of the proposed approach are demonstrated through experimental verification of some arithmetic circuits such as multiply-accumulator and FIR filter. The result shows that the proposed approach has a definite possibility of verifying practical arithmetic circuits.
ER -