DocumentCode
3318663
Title
Debug methodology for arithmetic circuits on FPGAs
Author
Kubo, Masao ; Fujita, Masahiro
Author_Institution
Tokyo Univ., Japan
fYear
2002
fDate
16-18 Dec. 2002
Firstpage
236
Lastpage
242
Abstract
Field programmable gate arrays (FPGAs) have been widely used to realize rapid prototyping for not only control units but also arithmetic circuits. As VLSI design becomes larger and takes up much longer time, verification and debugging of logic design become the dominating part of total design period. FPGA is relatively useful in such case due to its rapid implementation. However, circuit performances are very sensitive to layout designs. Therefore minimal change of circuit structures is important. In this paper, we give a debug methodology targeting arithmetic circuits which modifies circuits locally and speeds up the total time for redesign as a result. To complete debugging, we analyze circuits, extract the erroneous parts, and replace by correct circuits.
Keywords
VLSI; digital arithmetic; field programmable gate arrays; formal verification; logic CAD; rapid prototyping (industrial); FPGAs; VLSI; arithmetic circuits; circuit performances; circuit structures; debug methodology; rapid prototyping; redesign; total design period; verification; Arithmetic; Circuit analysis; Debugging; Field programmable gate arrays; Logic circuits; Logic design; Programmable logic arrays; Prototypes; Table lookup; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Field-Programmable Technology, 2002. (FPT). Proceedings. 2002 IEEE International Conference on
Print_ISBN
0-7803-7574-2
Type
conf
DOI
10.1109/FPT.2002.1188687
Filename
1188687
Link To Document