编程验证[x+1]是GF(28)=GF(2)[x]/(x8+x4+x3+x+1)的本原元，并给出GF(28)=GF(2)[x]/(x8+x4+x3+x+1)中以[x+1]为底的对数表和反对数表-Program verification [x+1] is the GF (28) = GF (2) [x]/(x8+ x4+ x3+ x+1) of the primitive element, and gives GF (28) = GF (2) [x]/(x8+ x4+ x3+ x+1) in or

PSpice8 circuit simulation of log and antilog operations. In total.sch a circuit is implemented to perform Vo=Vi^(1/3).-PSpice8 circuit simulation of log and antilog operations. In total.sch a circuit is implemented to perform Vo=Vi^(1/3).

32 bit antilog coding. Completely synthesizable. Tested in spartan 3A DSP series

To perform following point processing algorithms on an image • Negative transformation • Log transformation • Power law transformation (Antilog transformation) • Bit plane slicing • Gray level slicing