References
- H. M. Shao, T. K. Truong, L. J. Deutsch, J. H. Yaeh and I. S. Reed, "A VLSI Design of a Pipelining Reed-Solomon Decoder," IEEE Trans. Computers, vol. C-34, pp. 393-403, May. 1985. https://doi.org/10.1109/TC.1985.1676579
-
C. C. Wang, T. K. Truong, H. M. Shao, L. J. Deutsch, J. K. Omuro, and I. S. Reed, "VLSI Architecture for Computing Multiplications and Inverses in
$GF(2^m)$ ," IEEE Trans. Computers, vol. C-34, pp. 707-717, Aug. 1985. -
P. E. Scott, S. E. Tavares, L. E. Peppard, "A Fast VLSI Multiplier for
$GF(2^m)$ ," IEEE Journal Selected Areas in Comunications, SAL-4, no. 1, pp. 62-65, Jan. 1986. -
N. Iliev, J. E. Stine and N. Jachimiec, " Parallel Programmable Finite Field
$GF(2^m)$ Multiplier," in Proc. IEEE Int. Symp. VLSI Emerging Trends in VLSI Systems Design, Sept. 2004. -
C. S. Yeh, I. S. Reed, and T. K. Truong, "Systolic Multipliers for Finite Fields
$GF(2^m)$ ," IEEE Trans. Computers, vol. 33, no. 4, pp. 357-360, Apr. 1984. -
T, Itoh and S. Tsujii, "Structure of Parallel Multipliers for a Class of Fields
$GF(2^m)$ ," Inform. Comp., vol. 83, pp. 21-40, 1989. https://doi.org/10.1016/0890-5401(89)90045-X -
C. L. Wang and J. L. Lin, "Systolic Array Implementation of Multipliers for Finite Fields
$GF(2^m)$ ," IEEE Trans. Circuits and Systems, vol. 38, no. 7, July 1991. -
S. W. Wei, "A Systolic Power-Sum Circuit for
$GF(2^m)$ ," IEEE Trans. Computers, vol. 43, no. 2, pp. 226-229, Feb. 1994. https://doi.org/10.1109/12.262128 - A. Halbutogullari and C. K. Koc, "Mastrovito Multiplier for General Irreducible Polynomials," IEEE Trans. Computers, vol. 49, no. 5, pp. 503-518, May 2000. https://doi.org/10.1109/12.859542
-
C. Y. Lee, E.H. Lu, and J. Y. Lee, "Bit Parallel Systolic Multipliers for
$GF(2^m)$ Fields Defined by All-One and Equally Spaced Polynomials," IEEE Trans. Computers, vol. 50, no. 5, pp. 385-392, May 2001. https://doi.org/10.1109/12.926154