
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Hafizur Rahaman, Jimson Mathew, Dhiraj K. Pradhan, Abusaleh M. Jabir, "Derivation of Reduced Test Vectors for BitParallel Multipliers over GF(2^m)," IEEE Transactions on Computers, vol. 57, no. 9, pp. 12891294, September, 2008.  
BibTex  x  
@article{ 10.1109/TC.2008.63, author = {Hafizur Rahaman and Jimson Mathew and Dhiraj K. Pradhan and Abusaleh M. Jabir}, title = {Derivation of Reduced Test Vectors for BitParallel Multipliers over GF(2^m)}, journal ={IEEE Transactions on Computers}, volume = {57}, number = {9}, issn = {00189340}, year = {2008}, pages = {12891294}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2008.63}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Derivation of Reduced Test Vectors for BitParallel Multipliers over GF(2^m) IS  9 SN  00189340 SP1289 EP1294 EPD  12891294 A1  Hafizur Rahaman, A1  Jimson Mathew, A1  Dhiraj K. Pradhan, A1  Abusaleh M. Jabir, PY  2008 KW  Testing KW  stuckat fault KW  Test generation KW  Finite fields KW  Polynomial basis VL  57 JA  IEEE Transactions on Computers ER   
[1] T.A. Gulliver, M. Serra, and V.K. Bhargava, “The Generation of Primitive Polynomials in $GF(2^{m})$ with Independent Roots and Their Application for Power Residue Codes, VLSI Testing and FiniteField Multipliers Using Normal Bases,” Int'l J. Electronics, vol. 71, no. 4, pp. 559576, 1991.
[2] Y. Wu and M.I. Adham, “ScanBased BIST Fault Diagnosis,” IEEE Trans. ComputerAided Design of Integrated Circuits and Systems, vol. 18, no. 2, pp.203211, 1999.
[3] C.H. Wu, C.M. Wu, M.D. Sheih, and Y.T. Hwang, “HighSpeed, LowComplexity Systolic Design of Novel Iterative Division Algorithm in $GF(2^{m})$ ,” IEEE Trans. Computers, vol. 53, no. 3, pp. 375380, Mar. 2004.
[4] R.E. Blahut, Fast Algorithms for Digital Signal Processing. AddisonWesley, 1985.
[5] R. Lidl and H. Niederreiter, Introduction to Finite Fields and Their Applications. Cambridge Univ. Press, 1994.
[6] I.S. Reed and X. Chen, ErrorControl Coding for Data Networks. Kluwer Academic, 1999.
[7] G.B. Agnew, T. Beth, R.C. Mullin, and S.A. Vanstone, “Arithmetic Operations in $GF(2^{m})$ ,” J. Cryptology, vol. 6, pp. 313, 1993.
[8] P.A. Scott, S.J. Simmons, S.E. Tavares, and L.E. Peppard, “Architectures for Exponentiation in $GF(2^{m})$ ,” IEEE J. Selected Areas in Comm., vol. 6, no. 3, pp.578586, Apr. 1988.
[9] H. Wu and M.A. Hasan, “Efficient Exponentiation of a Primitive Root in $GF(2^{m})$ ,” IEEE Trans. Computers, vol. 46, no. 2, pp. 162172, Feb. 1997.
[10] J.H. Guo and C.L. Wang, “Systolic Array Implementation of Euclid's Algorithm for Inversion and Division in $GF(2^{m})$ ,” IEEE Trans. Computers, vol. 47, no. 10, pp. 11611167, Oct. 1998.
[11] A. ReyhaniMasoleh and M.A. Hasan, “Low Complexity Bit Parallel Architectures for Polynomial Basis Multiplication over $GF(2^{m})$ ,” IEEE Trans. Computers, vol. 53, no. 8, pp. 945959, Aug. 2004.
[12] T.C. Bartee and D.I. Schneider, “Computation with Finite Fields,” Information and Computers, vol. 6, pp. 7998, Mar. 1963.
[13] E.D. Mastrovito, “VLSI Designs for Multiplication over Finite Fields $GF(2^{m})$ ,” Proc. Sixth Int'l Conf. Applied Algebra, Algebraic Algorithms and ErrorCorrecting Codes, pp. 297309, July 1988.
[14] E.D. Mastrovito, “VLSI Architectures for Computation in Galois Fields,” PhD dissertation, Linkoping Univ., 1991.
[15] B. Sunar and Ç.K. Koç, “Mastrovito Multiplier for All Trinomials,” IEEE Trans. Computers, vol. 48, no. 5, pp. 522527, May 1999.
[16] A. Halbutogullari and C.K. Koc, “Mastrovito Multiplier for General Irreducible Polynomials,” IEEE Trans. Computers, vol. 49, no. 5, pp. 503518, May 2000.
[17] D.K. Pradhan, “A Theory of Galois Switching Functions,” IEEE Trans. Computers, vol. 27, no. 3, pp. 239248, Mar. 1978.
[18] H. Rahaman, D.K. Das, and B.B. Bhattacharya, “Easily Testable Realization of GRM and ESOP Networks for Detecting Stuckat and Bridging Faults,” Proc. 17th Int'l Conf. VLSI Design, Jan. 2004.
[19] H. Rahaman, D.K. Das, and B.B. Bhattacharya, “Testable Design of GRM Network with EXORTree for Detecting Stuckat and Bridging Faults,” Proc. Conf. Asia South Pacific Design Automation: Electronic Design and Solution Fair, pp. 224229, 2004.
[20] H. Fujiwara, “On Closedness and Test Complexity of Logic Circuits,” IEEE Trans. Computers, vol. 30, no. 8, pp. 556562, Aug. 1981.
[21] T. Sasao, “Easily Testable Realizations for Generalized ReedMuller Expressions,” IEEE Trans. Computers, vol. 46, no. 6, pp. 709716, June 1997.
[22] H. Rahaman, J. Mathew, A.M. Jabir, and D.K. Pradhan, “Easily Testable Implementation for Bit Parallel Multipliers in ${\rm GF}(2^{\rm m})$ ,” Proc. 11th IEEE Int'l HighLevel Design Validation and Test Workshop, 2006.
[23] E.M. Sentovich et al., “SIS: A Sequential System for Sequential Circuit Synthesis,” Technical Report UCB/ERL m92/41, Electronic Research Laboratory, Univ. of California, Berkeley, May 1992.
[24] A. ReyhaniMasoleh and M. Anwar Hasan, “Fault Detection Architectures for Field Multiplication Using Polynomial Bases,” IEEE Trans. Computers, vol. 55, no. 9, Sept. 2006.