Reversible Logic Synthesis Benchmarks Page

you are in... Main\gf2^9mult

Function gf2^9mult finds product of two elements of a field GF(29), a=a0+a1x+a2x2+a3x3+a4x4+a5x5+a6x6+a7x7+a8x8 and b=b0+b1x+b2x2+b3x3+b4x4+b5x5+b6x6+b7x7+b8x8 with the output, ab=c=c0+c1x+c2x2+c3x3+c4x4+c5x5+c6x6+c7x7+c8x8 written on the last 9 bits. Inputs a and b must remain unchanged.
Primitive polynomial Picture Machine-readable version Model Garbage Gate count Quantum cost Author(s) Date
x9+x4+1 here here CNT 18 89 413 D. Cheung, D. Maslov, J. Mathew, and D. K. Pradhan July, 2010
m - the number is shown to be minimal