loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
21st International Conference on VLSI Design (VLSI Design 2008)
Design of Reversible Finite Field Arithmetic Circuits with Error Detection
Hyderabad, India
January 04-January 08
ISBN: 0-7695-3083-4
we present a systematic method for the designing reversible arithmetic circuits for finite field or Galois fields of form GF(2?). It is shown that an adder over GF(2?) can be designed with m garbage bits and that of a PB multiplier with 2m garbage bits. To tackle the problem of errors in computation, we also extend the circuit with error detection feature. Gate count and technology oriented cost metrics are used for evaluation. The expression for the upper bound for gate size is also derived for special primitive polynomials. Our technique, when compared with existing CAD tool gives the same gate size and quantum cost.
Citation:
Jimson Mathew, Hafizur Rahaman, Babita R. Jose, Dhiraj K. Pradhan, "Design of Reversible Finite Field Arithmetic Circuits with Error Detection," vlsid, pp.453-459, 21st International Conference on VLSI Design (VLSI Design 2008), 2008
Usage of this product signifies your acceptance of the Terms of Use.