Modeling a Fully Scalable Reed-Solomon Encoder/Decoder over GF(p^m) in SystemCMultiple-Valued Logic, 2007. ISMVL 2007. 37th International Symposium on (2007), pp. 42-42.
|
Reviews
[Write a review of this article]
There are no reviews of this article
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
AbstractIn this paper we describe how to model arithmetic circuits over GF(pm) in SystemC. An extension of a GF(2m) multiplier is presented to support GF(pm) arithmetic as well. A full integration in the simulation environment is discussed and the proposed solution can be fully synthesized down to hardware. This finds application in e.g. cryptographic systems. As a case study a Reed-Solomon encoder/decoder system was developed with full GF(pm) encoding/decoding capability. It is shown that the modeling of a HW/SW co-design system in SystemC can improve the speed of simulation by a factor of up to 17.
BibTeX record
RIS record