Efficient computations in Galois fields
| dc.contributor.author | Hasan, Mohammed Anwarul | |
| dc.contributor.supervisor | Bhargava, Vijay K. | |
| dc.date.accessioned | 2018-06-28T18:52:20Z | |
| dc.date.available | 2018-06-28T18:52:20Z | |
| dc.date.copyright | 1992 | en_US |
| dc.date.issued | 2018-06-28 | |
| dc.degree.department | Department of Electrical and Computer Engineering | en_US |
| dc.degree.level | Doctor of Philosophy Ph.D. | en_US |
| dc.description.abstract | In this dissertation some algorithms and related hardware structures for computing division and multiplication over finite or Galois fields are presented. The structures are regular, which is important for hardware realization, particularly for large finite fields. The concept of supporting elements is introduced which leads to efficient algorithms for computing divisions and multiplications in finite fields. A relationship between systems of linear equations over GF(q) and division in GF [special characters omitted] is established. Using this relationship, a division algorithm valid for any irreducible polynomial or any field basis is presented. It is also proved that if the elements are represented with respect to a canonical basis, then division over GF [special characters omitted] can be performed by solving a discrete time Wiener-Hopf equation over GF(q). A bit-serial systolic divider for finite fields of the form GF [special characters omitted] is presented. The divider structure does not depend on the irreducible polynomial defining the field and requires no global data communications. Moreover, the time step duration is independent of the value of m, which is important for large finite fields. By exploiting the structure of a Toeplitz matrix, a bit-serial multiplier applicable to any irreducible polynomial defining the field is presented. The multiplier is efficient in the sense that it requires, in general, less circuitry compared to equivalent existing multipliers. Finite fields GF [special characters omitted] generated by irreducible all one polynomials (AOP) and equally space polynomials (ESP) are considered. Algorithms and structures are presented for parallel computation of multiplications in these fields. It is shown that if for a certain degree both an irreducible AOP and ESP exist, it is advantageous to use an ESP based parallel multiplier. Moreover, it is shown that parallel multipliers based on ESP can be obtained by using modules of a corresponding AOP based multiplier. Finally, as an application of the efficient bit-serial multiplication algorithm, a Reed-Solomon encoder structure is presented. The structure features simple basis transformation circuitry and supports a variable code rate. | en_US |
| dc.description.scholarlevel | Graduate | en_US |
| dc.identifier.uri | http://hdl.handle.net/1828/9548 | |
| dc.language | English | eng |
| dc.language.iso | en | en_US |
| dc.rights | Available to the World Wide Web | en_US |
| dc.subject | Finite fields (Algebra) | en_US |
| dc.subject | Galois theory | en_US |
| dc.title | Efficient computations in Galois fields | en_US |
| dc.type | Thesis | en_US |