Title page for etd-0712104-074200


[Back to Results | New Search]

URN etd-0712104-074200
Author Chia-Shin Tu
Author's Email Address No Public.
Statistics This thesis had been viewed 5352 times. Download 8469 times.
Department Computer Science and Engineering
Year 2003
Semester 2
Degree Master
Type of Document
Language zh-TW.Big5 Chinese
Title A Synthesizer of Constant Matrix Multipliers
in Galois Field GF(2^n)
Date of Defense 2004-07-05
Page Count 73
Keyword
  • cse
  • finite field
  • constant matrix multiplier
  • Abstract The arithmetic operations in most digital system are in the conventional binary number systems. However, the finite field arithmetic has also been widely used in applications of cryptography and communication channel coding. For example, finite field constant multiplication is applied to the advanced encryption standard (AES) and in the Reel-Solomon code. In this thesis, we develop a synthesizer that can automatically generate optimized gate-level netlists for constant matrix multiplication in Galois Field GF(2^n). The logic minimization is based on the a new common-factor elimination (CSE) algorithm that can efficiently finds the shared common factors among all the bit-level Boolean equations. Both the area and speed performance are considered during the logic optimization process. Experimental results show that the synthesized circuits have better area and/or speed performance compared with those obtained using Synopsys logic synthesis tools.
    Advisory Committee
  • Wei-Chin Hsu - chair
  • Chien-Hsing Wu - co-chair
  • Yun-Nan Chang - co-chair
  • Shiann-Rong Kuang - co-chair
  • Shen-Fu Hsiao - advisor
  • Files
  • etd-0712104-074200.pdf
  • indicate access worldwide
    Date of Submission 2004-07-12

    [Back to Results | New Search]


    Browse | Search All Available ETDs

    If you have more questions or technical problems, please contact eThesys