Mikael Olofsson

Suggestions for master thesis work

Efficient decoding of error correcting codes demands the existance of efficient VLSI implementations of arithmetic operations in finite fields and rings. A finite field GF(p^m) can be seen as an m-dimensional vector space over GF(p), where p is a prime. Arithmetic operations in such extension fields can be implemented using operations in GF(p). Finite rings can be described in similar ways.

Here are some possible topics for master thesis work in this area. Hopefully, this list will grow somewhat soon.

• Calculations in prime fields based on Eisenstein integers
  Compare calculations in one or a few well chosen prime fields using different representations. Especially, representations based on Eisenstein integers should be considered.

For more information about master thesis work at Communication Systems, see the following page. That page is also only available in Swedish.

• Master thesis work at Communication Systems