Complexity Reduction of Constant Matrix Computations over the Binary Field

In this work an algorithm for realizing a multiplication of a vector by a constant matrix over the binary field with few two-input XOR-gates is proposed. This type of problem occurs in, e.g., Galois field computations, syndrome computation for linear error correcting codes, cyclic redundancy checks (CRCs), linear feedback shift-registers (LFSRs), and implementations of the Advanced Encryption Standard (AES) algorithm. As the proposed algorithm can utilize cancellation of terms it outperforms in general previously proposed algorithms based on sub-expression sharing.

[1]  Chip-Hong Chang,et al.  Contention resolution algorithm for common subexpression elimination in digital filter design , 2005, IEEE Trans. Circuits Syst. II Express Briefs.

[2]  Christof Paar,et al.  Optimized arithmetic for Reed-Solomon encoders , 1997, Proceedings of IEEE International Symposium on Information Theory.

[3]  David Bull,et al.  Primitive operator digital filters , 1991 .

[4]  Paulo F. Flores,et al.  An exact algorithm for the maximal sharing of partial terms in multiple constant multiplications , 2005, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..

[5]  Christof Paar,et al.  A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Fields , 1996, IEEE Trans. Computers.

[6]  A. Gemant,et al.  Ion formation and inhibition in hydrocarbons , 1956 .

[7]  Mikael Olofsson,et al.  VLSI Aspects on Inversion in Finite Fields , 2002 .

[8]  R. McEliece.  Finite Fields for Computer Scientists and Engineers , 1986 .

[9]  Charles A. Zukowski,et al.  High-speed parallel CRC circuits in VLSI , 1992, IEEE Trans. Commun..

[10]  Keshab K. Parhi,et al.  Implementation approaches for the Advanced Encryption Standard algorithm , 2002 .

[11]  Rudolf Lide,et al.  Finite fields , 1983 .

[12]  Keshab K. Parhi,et al.  High-Speed Parallel CRC Implementation Based on Unfolding, Pipelining, and Retiming , 2006, IEEE Transactions on Circuits and Systems II: Express Briefs.

[13]  Jun Zhang,et al.  Low complexity parallel Chien search architecture for RS decoder , 2005, 2005 IEEE International Symposium on Circuits and Systems.

[14]  Harald Niederreiter,et al.  Finite fields: Author Index , 1996 .

[15]  R. Hartley.  Subexpression sharing in filters using canonic signed digit multipliers , 1996 .

[16]  Lars Wanhammar,et al.  ILP modelling of the common subexpression sharing problem , 2002, 9th International Conference on Electronics, Circuits and Systems.

[17]  Keshab K. Parhi,et al.  Small area parallel Chien search architectures for long BCH codes , 2004, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[18]  J. Bordewijk.  Inter-reciprocity applied to electrical networks , 1957 .

[19]  Miodrag Potkonjak,et al.  Multiple constant multiplications: efficient and versatile framework and algorithms for exploring common subexpression elimination , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[20]  Patrick Schaumont,et al.  A new algorithm for elimination of common subexpressions , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..