Automatic verification of combinatorial and pipelined FFT circuits

DOI10.1007/3-540-48683-6_33MaRDI QIDQ4818806zbMATH OpenFDO

Authors Per Bjesse

Publication date 24 September 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48683-6_33

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Formal Methods in Computer-Aided Design
• Formal Methods in Computer-Aided Design
• Using an induction prover for verifying arithmetic circuits
• FAST: FFT ASIC automated synthesis
• Automated and scalable verification of integer multipliers

Cited in

(4)

• The formalization of discrete Fourier transform in HOL
• Formal verification based on Boolean expression diagrams
• Formal Methods in Computer-Aided Design
• Formal Methods in Computer-Aided Design

This page was built for publication: Automatic verification of combinatorial and pipelined FFT circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4818806)