Functional verification of large-integers circuits using a cosimulation-based approach

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Cryptography and computational algebra designs are complex systems based on modular arithmetic and build on multi-level modules where bit-width is generally larger than 64-bit. Because of their particularity, such designs pose a real challenge for verification, in part because large-integer's functions are not supported in actual hardware description languages (HDLs), therefore limiting the HDL testbench utility. In another hand, high-level verification approach proved its efficiency in the last decade over HDL testbench technique by raising the latter at a higher abstraction level. In this work, we propose a high-level platform to verify such designs, by leveraging the capabilities of a popular tool (Matlab/Simulink) to meet the requirements of a cycle accurate verification without bit-size restrictions and in multi-level inside the design architecture. The proposed high-level platform is augmented by an assertion-based verification to complete the verification coverage. The platform experimental results of the testcase provided good evidence of its performance and re-usability.

Cite

CITATION STYLE

APA

Alimi, N., Lahbib, Y., Machhout, M., & Tourki, R. (2017). Functional verification of large-integers circuits using a cosimulation-based approach. International Journal of Electrical and Computer Engineering, 7(4), 2192–2205. https://doi.org/10.11591/ijece.v7i4.pp2192-2205

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free