Synthesis of Arithmetic Circuits: FPGA, ASIC and Embedded Systems

Synthesis of Arithmetic Circuits: FPGA, ASIC and Embedded Systems

Volumn , Issue , 2006, Pages 1-556

  Deschamps, Jean Pierre ^a   Bioul, Géry Jean Antoine ^b,c,d   Sutter, Gustavo D ^e  

^a UNIVERSITAT ROVIRA I VIRGILI   (Spain)

^b Ministry of Health of Buenos Aires Providence   (Argentina)

^c UNIVERSIDAD NACIONAL DEL CENTRO DE LA PROVINCIA DE BUENOS AIRES   (Argentina)

^d Faculty of Engineering   (Argentina)

^e UNIVERSIDAD AUTÓNOMA DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION SPECIFIC INTEGRATED CIRCUITS; COMPUTER HARDWARE; ELECTRIC NETWORK ANALYSIS; FIELD PROGRAMMABLE GATE ARRAYS (FPGA); GENERAL PURPOSE COMPUTERS; PUBLISHING; SYSTEMS ANALYSIS; TIMING CIRCUITS;

ARITHMETIC CIRCUIT; ARITHMETIC OPERATIONS; FINITE FIELD OPERATIONS; FPGA IMPLEMENTATIONS; HARDWARE AND SOFTWARE; MATHEMATICAL ASPECTS; NUMBER REPRESENTATION; SOFTWARE AND HARDWARES;

EMBEDDED SYSTEMS;

EID: 84890615719     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/0471741426     Document Type: Book

References (162)

1. G. De Micheli, R. Ernst, and W. Wolf (eds.), Readings in Hardware/Software Co-Design, Morgan Kaufmann Publishers, San Francisco, CA, 2002.
2. D. D. Gajski, F. Vahid, S. Narayan, and J. Gong, Specification and Design of Embedded Systems, Prentice Hall, Englewood Cliffs, NJ, 1994.
3. Xilinx Inc, PicoBlaze 8-bit Microcontroller for Virtex-E and Spartan-II/IIE Devices, application note XAPP213 (v2.0), Dec. 2002; http://www.xilinx.com.
4. XSA Board V1.1, V1.2 User Manual, June 2002; http://www.xess.com.
5. T. M. Apostol, Mathematical Analysism, 2nd ed., Addison Wesley, Reading, MA, 1974.
6. H. Cohen, A Course in Computational Algebraic Number Theory, Springer-Verlag, Berlin, 1993.
7. H. Garner, The residue number system. IRE Trans. Electron. Comput., EC-8:140-147 (1959).
8. W. J. Gilbert and W. K. Nicholson, Modern Algebra with Applications, John Wiley & Sons, Hoboken, NJ, 2003.
9. I. N. Herstein, Topics in Algebra, 2nd ed., Xerox College Pub., Lexington, MA, 1975.
10. T. W. Hungerford, Algebra, Holt, Rinehart and Winston, New York, 1974.
11. N. Koblitz, A Course in Number Theory and Cryptography, Springer-Verlag, New York, 1994.
12. R. J. McCeliece, Finite Fields for Computer Scientists and Engineeers, Kluwer Academic Publishers, Boston, 1987.
13. A. J. Menezes, P.C. van Oorschot, and S. C. Vanstone, Handbook of Applied Cryptography, CRC Press, Boca Raton, FL, 1996.
14. K. H. Rosen, Elementary Number Theory and Its Applications, Addison-Wesley, Reading, MA, 1992.
15. K. H. Rosen (Editor-in-Chief), Handbook of Discrete and Combinatorial Mathematics, CRC Press, Boca Raton, FL, 2000.
16. W. Rudin, Principles of Mathematical Analysis (International Series in Pure & Applied Mathematics), McGraw-Hill Science/Engineering/Math, New York, 1976.
17. J. von zur Gathen and J. Gerhard, Modern Computer Algebra, Cambridge University Press, Cambridge, UK, 2003.
18. ANSI and IEEE, IEEE Standard for Binary Floating-Point Arithmetic, ANSI/IEEE Standard, Std 754-1985, New York, 1985.
19. A. D. Booth, A signed binary multiplication technique. Q. J. Mechanics Appl. Math., June: 236-240 (1951).
20. M. Ercegovac and T. Lang. Digital Arithmetic, Morgan Kaufmann Publishers, San Francisco, CA, 2004.
21. B. Parhami, Computer Arithmetic: Algorithms and Hardware Designs, Oxford University Press, New York, 1999.
22. R. Brent and H. T. Kung, A regular layout for parallel adders. IEEE Trans. Comput., C-31(3): 260-264 (1982).
23. T. Han and D. A. Carlson, Fast area-efficient VLSI adders. In: Proceedings of the 8th Symposium on Computer Arithmetic, 1987, pp. 49-56.
24. P. M. Kogge and H. S. Stone, A parallel algorithm for the efficient solution of a general class of recurrence equations. IEEE Trans. Comput., C-22(8): 786-793 (1973).
25. R. E. Ladner and M. J. Fischer, Parallel prefix computation. J. ACM 27(10): 831-838 (1980).
26. B. Sugla and D. Carlson, Extreme area-time tradeoffs in VLS. IEEE Trans. Comput. 39(2): 251-257 (1990).
27. C. R. Baugh and B. A. Wooley, A two's complement parallel array multiplication algorithm. IEEE Trans. Comput., C-22: 1045-1047 (1973).
28. A. D. Booth, A signed binary multiplication technique. Q. J. Mech. Appl. Math. 4: 236-240 (1951).
29. L. Dadda, Some schemes for parallel multipliers. Alta Frequenza 34: 349-356 (1965).
30. M. Davio and G. Bioul, Fast parallel multiplication. Philips Res. Rpts. 32: 44-70 (1977).
31. I. Koren, Computer Arithmetic Algorithms, Prentice Hall, Englewood Cliffs, NJ, 1993.
32. M. Nagamatsu, et al., A 15-ns 32 × 32-b CMOS multiplier with an improved parallel structure. IEEE J. Solid-State Circuits 25(2): 494-499 (1990).
33. S. F. Oberman and M. Flynn, Advanced Computer Arithmetic Design, Wiley-Interscience, Hoboken, NJ, 2001.
34. V. G. Oklobdzija, D. Villeger, and S. S. Liu, A method for speed optimized partial product reduction and generation of fast parallel multipliers using an algorithmic approach. IEEE Trans. Comput. 45(3): 294-305 (1996).
35. Behrooz Parhami, Computer Arithmetic, Algorithms and Hardware Designs, Oxford University Press, New York, 1999.
36. Z. Wang, G. A. Jullien, and W. C. Miller, A new design technique for column compression multipliers. IEEE Trans. Comput. 44(8): 962-970 (1995).
37. C. S. Wallace, A suggestion for fast multipliers. IEEE Trans. Electron. Comput. EC-13(Feb): 14-17 (1964).
38. S. F. Anderson, J. G. Earle, R. E. Goldschmidt, and D. M. Powers, The IBM System/360 Model 91: Floating-point execution unit. IBM J. Res. Dev., 11 (Jan.):34-53 (1967).
39. D. E. Atkins, Higher-radix division using estimates of the divisor and partial remainders. IEEE Trans. Comput., C-17(10): 925-934 (1968).
40. W. S. Briggs and D.W. Matula, A 17 × 69 bit multiply and add unit with redundant binary feedback and single cycle latency. In: Proceedings of the 11th IEEE Symposium on Computer Arithmetic, July 1993, pp. 163-170.
41. M. A. Cornea-Hasegan, R. A. Golliver, and P. Markstein, Correctness proofs outline for Newton-Raphson based floating-point divide and square root algorithms: In:Proceedings of the 14th IEEE Symposium on Computer Arithmetic, 1999, pp. 96-105.
42. D. DasSarma and D. W. Matula, Faithfull bipartite ROM reciprocal tables. In Proceedings of the 12th IEEE Symposium Computer Arithmetic, 1995 pp. 17-28.
43. A. Edelman, The mathematics of the Pentium division bug. SIAM Rev. 39(1):54-67 (1997).
44. M. D. Ercegovac, A higher radix division with simple selection of quotient digits. In Proceedings of the 6th IEEE Symposium Computer Arithmetic, July 1983, pp. 94-98.
45. M. D. Ercegovac and T. Lang, On-the-fly conversion of redundant into conventional representations. IEEE Trans. Comput., 36(7): 895-897 (1987).
46. M. D. Ercegovac and T. Lang, Simple radix-4 division with operands scaling. IEEE Trans. Comput., 39(9): 1204-1207 (1990).
47. M. D. Ercegovac and T. Lang, On-the-fly rounding. IEEE Trans. Comput. 41, (12):1497-1503 (1992).
48. M. D. Ercegovac and T. Lang, Digital Arithmetic, Morgan Kaufmann, San Francisco, CA, 2004.
49. G. Even, P.-M. Seidel, and W. E. Ferguson, A parametric error analysis of Goldschmidt's division algorithm. In: Proceedings of the 16th IEEE Symposium on Computer Arithmetic, June 2003.
50. J. Fandrianto, Algorithm for high-speed shared radix-8 division and radix-8 square root. In Proceedings of the Ninth IEEE Symposium on Computer Arithmetic, July 1989, pp. 68-75.
51. D. Ferrari, A division method using a parallel multiplier. IEEE Trans. Comput., 16: 224-226, (April 1967).
52. M. J. Flynn, On division by functional iteration. IEEE Trans. Comput. 19: (August 1970).
53. M. J. Flynn, Modern Research in Computer Arithmetic, Stanford Architecture and Arithmetic Group, Stanford Technical Report, 1997.
54. M. J. Flynn and S. F. Oberman, Advanced Computer Arithmetic Design, Wiley-Interscience, Hoboken, NJ, 2001.
55. C. V. Freiman, Statistical analysis of certain binary division algorithms. IRE Proc. 49: 91-103 (1961).
56. R. Goldschmidt, Applications of Division by Convergence. Master's thesis, MIT, June 1964.
57. P. Montuschi and L. Ciminiera, Radix-8 division with over-redundant digit set. J. VLSI Signal Processing 7 (3): 259-270 (1994).
58. M. Nadler, A high speed electronic arithmetic unit for automatic computing machines. Acta Tech. (Prague), 6: 464-478 (1956).
59. S. F. Oberman and M. J. Flynn, Design issues in floating point division. Technical Report No. CSL-TR-94-647, Computer Systems Laboratory, Stanford University, December 1994.
60. S. F. Oberman and M. J. Flynn, An analysis of division algorithms and implementations. Stanford Technical Report CSL-TR-95-675, July 1995.
61. S. F. Oberman and M. J. Flynn, Division algorithms and implementations. IEEE Trans. Comput. 46: 833-854 (Aug. 1997).
62. S. F. Oberman, Floating point division and square root algorithms and implementation in the AMD-K7 microprocessor. In: Proceedings of the 14th IEEE Symposium on Computer Arithmetic, April 1999, pp. 106-115.
63. B. Parhami, Computer Arithmetic, Algorithms and Hardware Designs, Oxford University Press, New York, 1999.
64. N. Quach and M. Flynn, A radix-64 floating-point divider. Technical Report CSL-TR-92-529, Computer Systems Laboratory, Stanford University, June 1992.
65. J. E. Robertson, A new class of digital division methods. IRE Trans. Electron. Comput., EC-7: 218-222 (Sept. 1958).
66. M. S. Schmookler, R. C. Agarwal, and F. G. Gustavson, Series approximation methods, for divide and square root in the Power3 Microprocessor. In: Proceedings of the 14th IEEE Symposium Computer Arithmetic, April 1999, pp. 116-123.
67. E. M. Schwarz, R.M. Smith, and C. A. Krygowski, The S/390 G5 floating point unit supporting hex and binary architectures. In: Proceedings of the 14th IEEE Symposium on Computer Arithmetic, April 1999, pp. 258-265.
68. H. Srinivas and K. Parhi, A fast radix-4 division algorithm and its architecture. IEEE Trans. Comput. 44(6): 826-831 (1995).
69. G. Sutter, G. Bioul, and J.-P. Deschamps, Comparative study of SRT-dividers in FPGA. In: Lecture Notes in Computer Science, Vol. 3203, Springer-Verlag, 2004, pp. 209-220.
70. A. Svoboda, An algorithm for division. Stroje na Zpracovani Informaci, 9: 25-34 (1963).
71. J. Cocke and D. W. Sweeney, High speed arithmetic in a parallel device. IBM Technical Report, February 1957.
72. G. S. Taylor, Radix 16 SRT dividers with overlapped quotient selection stages. In: Proceedings of the Seventh IEEE Symposium on Computer Arithmetic, June 1985, pp. 64-71.
73. T. D. Tocher, Techniques of multiplication and division for automatic binary computer. Q. J. Mech. Appl. Math., 2: 364-384 (1958).
74. J. Cao, B. W. Wei, and J. Cheng, High-performance architecture for elementary functions generation. In: Proceedings of the 15th IEEE Symposium on Computer Arithmetic, 2001, pp. 136-144.
75. T. C. Chen, Automatic computation of exponentials, logarithms, ratios, and square roots. IBM J. Res. Dev., 16: 380-388 (1972).
76. W. J. Cody and W. Waite, Software Manual for the Elementary Functions, Prentice-Hall, Englewood, Cliffs, NJ, 1980.
77. J.-M. Delosme, CORDIC algorithms, theory and extensions. SPIE Adv. Algorithms Architecture Signal Processing IV 1152: 131-145 (1989).
78. M. D. Ercegovac, A general hardware-oriented method for evaluation of functions and computations in a digital computer. IEEE Trans. Comput., 26(7): 667-680 (1977).
79. M. D. Ercegovac and T. Lang, Fast cosine/sine implementation using on-line CORDIC. In: Proceedings of the 21st Asilomar Conference on Signals, Systems, Computers, 1987, pp. 222-226.
80. M. D. Ercegovac and T. Lang, Division and Square-Root: Digit-Recurrence Algorithms and Implementations, Kluwer Academic Publishers, Norwell, MA, 1994.
81. M. D. Ercegovac, FPGA implementation of polynomial evaluation algorithms. In:Proceedings of SPIE Photonics East '95 Conference, Vol. 2607, pp. 177-188, 1995.
82. M. D. Ercegovac and T. Lang, Digital Arithmetic. Morgan Kaufmann, San Francisco, CA, 2004.
83. H. L. Garner, The residue number system. IRE Trans. Electron. Comput., EC 8:140-147 (1959).
84. C. Huang, A fully parallel mixed-radix conversion algorithm for residue number applications. IEEE Trans. Comput. 32(4): 398-402 (1983).
85. D. K. Kostopoulos, An algorithm for the computation of binary logarithms. IEEE Trans. Comput., 40(11): 1267-1270 (1991).
86. P. W. Markstein, Computations of elementary functions on IBM RISC System/6000 processor. IBM J. Res. Dev., 111-119 (1990).
87. S. F. Oberman, Floating point division and square root algorithms and implementation in the AMD-K7 microprocessor. In: Proceedings of the 14th IEEE Symposium Computer on Arithmetic, 1999, pp. 106-115.
88. V. Paliouras, K. Karagianni, and T. Stouraitis, A floating-point processor for fast and accurate sine/cosine evaluation. IEEE Trans. Circuits Systems II: Analog and Digital Signal Processing, 47 (5): pp. 441-451 (2000).
89. W. H. Specker, A class of algorithms for ln (x), exp (x), sin (x), cos (x), tan21(x) and cot21(x). IEEE Trans. Electron. Comput., EC 14: 85-86 (1965).
90. N. S. Szabo and R.I. Tanaka, Residue Arithmetic and Its Applications to Computer Technology. McGraw-Hill, New York, 1967.
91. P. K. Tang, Table look-up algorithms for elementary functions and their error analysis. In: Proceedings of the 10th IEEE Symposium on Computer Arithmetic, 1991, pp. 232-236.
92. J. E. Volder, The CORDIC trigonometric computing technique. IRE Trans. Electron. Comput., EC 8: 330-334 (1959).
93. J. E. Volder, The birth of CORDIC. J. VLSI Signal Processing Syst., 25: 101-105 (2000).
94. D. V. Bailey and C. Paar, Efficient arithmetic in finite field extensions with application in elliptic curve cryptography. J. Cryptol., 14(3): 153-176 (2001).
95. T. Itoh and S. Tsujii, A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases. Math. Computation 44(4): 519-521 (1985).
96. P. Montgomery, modular multiplication without trial division. Math. Computation 44(4): 519-521 (1985).
97. M. Rosing, Elliptic Curve Cryptography. Manning Publications, Greenwich, CT, 1999.
98. A. D. Woodbury, Elliptic curve cryptography on smart cards without coprocessors. IFIP CARDIS, 71-92 (2000).
99. P. J. Ashenden, The Designer's Guide to VHDL. Morgan Kaufmann, San Francisco, CA, 1996.
100. Celoxica Ltd, Handel-C: Software-Compiled System Design [online], [cited Sept. 2004], available from: http://www.celoxica.com/.
101. Electronic Industries Alliance (EIA), The Electronic Design Interchange Format (EDIF) Standard [online], [cited Sept. 2004], available from: http//:www.edif.org.
102. W. H. Glauert, VHDL Tutorial [online]. Universität Erlangen-Nürnberg [cited Sept. 2004], available from http://www.vhdl-online.de/.
103. JHDL Java Hardware Description Language Home Page [online]. BYU (Brigham Young University) JHDL, Open Source FPGA CAD Tools [cited Sept. 2004], available from: http://www.jhdl.org.
104. S. Mazor and P. Langstraat, A Guide to VHDL. Kluwer Academic Publishers, Norwell, MA, 1993.
105. G. E. Moore, Cramming more components onto integrated circuits. Electronics 38(8), Apr. 19(1965).
106. J. Rabaey, A. Chandrakasan, and B. Nikolic, Digital Integrated Circuits, 2nd ed. Prentice Hall, Englewood Cliffs, NJ, 2003.
107. A. Rushton, VHDL for Logic Synthesis, 2nd ed. Wiley, Hoboken, NJ, 1998.
108. M. J. S. Smith, Application-Specific Integrated Circuits. Addison-Wesley, Reading, MA, 1997.
109. Michael Smith, ASICs. . . the website [online], [cited Sept. 2004], available from http://www-ee.eng.hawaii.edu/~msmith/ASICs/HTML/ASICs.htm.
110. E. Sperling, FPGAs vs. ASICs [online]. Electronic News, Dec. 2003, available from http://www.reed-electronics.com/electronicnews/.
111. J. Van der Spiegel, VHDL Tutorial. University of Pennsylvania, Dept. of Electrical Engineering, 2001. Available from http://www.seas.upenn.edu/~ee201/vhdl/vhdl_primer.html.
112. The System-C community. Everything You Want to Know About System-C [online], [cited Sept. 2004], available from http://www.systemc.org.
113. F. Vahid and T. Givargis, Embedded System Design: A Unified Hardware/Software Introduction. Wiley, Hoboken, NJ, 2002.
114. S. E. Wahlstrom, Programmable logic arrays-cheaper by the millions. Electronics 40(25): 90-95, (Dec. 1967).
115. W. H. Wolf, Computers as Components Principles of Embedded Computing System Design. Morgan Kaufmann, XXX, 2001.
116. Xilinx, Inc., Virtex 2.5 V Field Programmable Gate Arrays, DS003-1 (v2.5), April 2001. Available from http//:www.xilinx.com.
117. Xilinx, Inc., The Web Page for Programmable Logic [online], [cited Sept. 2004], available from: http://www.xilinx.com.
118. Xilinx, Inc., Virtex-II Platform FPGAs: Complete Data Sheet, DS031 (v3.3), June 2004. Available from http//:www.xilinx.com.
119. Xilinx, Inc., Spartan-III FPGA Family: Complete Data Sheet, DS099 (v1.5), July 2004. Available from: http//:www.xilinx.com.
120. Xilinx, Inc., Spartan-II 2.5V FPGA Family: Complete Data Sheet, DS001 (v2.5), Sept. 2004. Available from http//:www.xilinx.com.
121. Xilinx, Inc., Forge Registration Instructions [online]. A Java-based design language/application that produces a synthesizable Verilog netlist [cited Sept. 2004], available from http://www.xilinx.com/ise/advanced/forge_get.htm.
122. W. Zhang, VHDL Tutorial: Learn by Example, [online]. University of California Riverside [cited Sept. 2004], available from http://www.cs.ucr.edu/content/esd/labs/tutorial/.
123. G. De Micheli, Synthesis and Optimization of Digital Circuits, McGraw-Hill, New York, 1994.
124. J.-P. Deschamps, Síntesis de circuitos digitales: un enfoque algorítmico [Synthesis of Arithmetic Circuits: An Algorithmic Approach], Thomson, Madrid, 2002 (In Spanish).
125. M. Flynn, Modern Research in Computer Arithmetic. Stanford Architecture and Arithmetic Group, 1997.
126. D. D. Gajski, F. Vahid, S. Narayan, and J. Gong, Specification and Design of Embedded Systems. Prentice Hall, Englewood Cliffs, NJ, 1994.
127. J. M. Rabaey, A. Chandrakasan, and B. Nikolic, Digital Integrated Circuits: A Design Perspective. Prentice Hall, Engle-wood Cliffs, NJ, 2003.
128. G. Bioul, J.-P. Deschamps, and G. Sutter, Efficient FPGA implementation of carry-skip adders. In: Proceedings of the 3rd Reconf. Computing and Applications (JCRA 03), UAM, Madrid, Sept. 2003, pp. 81-90.
129. R. Brent and H. T. Kung, A regular layout for parallel adders. IEEE Trans. Comput., C-31(3): 260-264 (1982).
130. T. Han and D. A. Carlson, Fast area-efficient VLSI adders. In: Proceedings of the 8th Symposium on Computer Arithmetic, 1987, pp. 49-56.
131. P. M. Kogge and H. S. Stone, A parallel algorithm for the efficient solution of a general class of recurrence equations. IEEE Trans. Comput., C-22(8), 786-793 (1973).
132. R. E. Ladner and M. J. Fischer, Parallel prefix computation. J. ACM 27: 831-838 (1980).
133. B. Sugla and D. Carlson, Extreme area-time tradeoffs in VLSI. IEEE Trans. Comput., 39(2), 251-257 (1990).
134. C. R. Baugh and B. A. Wooley, A two's complement parallel array multiplication algorithm. IEEE Trans. Comput. C-22: 1045-1047 (1973).
135. G. Bioul, J.-P. Deschamps, and G. Sutter. Spartan-II/Virtex Implementation of High Speed Adders. URJC Madrid, Technical Report, Feb. 2003.
136. A. D. Booth, A signed binary multiplication technique. Q. J. Mech. Appl. Math. 4: 236-240 (1951).
137. L. Dadda, Some schemes for parallel multipliers. Alta Frequenza 34: 349-356 (1965).
138. M. Davio and G. Bioul, Fast parallel multiplication. Philips Res. Rpts. 32:44-70 (1977).
139. C. S. Wallace, A suggestion for fast multipliers. IEEE Trans. Electron. Comput. EC-13: 14-17 (1964).
140. S. F. Anderson, J. G. Earle, R. E. Goldschmidt, and D. M. Powers, The IBM System/360 Model 91: Floating-point execution unit. IBM J. Res. Dev. 11: 34-53 (1967).
141. M. D. Ercegovac and T. Lang, On-the-fly conversion of redundant into conventional representations. IEEE Trans. Comput. 36(7): 895-897 (1987).
142. M. D. Ercegovac and T. Lang, On-the-fly rounding. IEEE Trans. Comput. 41(12):1497-1503 (1992).
143. M. D. Ercegovac and T. Lang, Division and Square-Root: Digit-Recurrence Algorithms and Implementations. Kluwer Academic Publishers, New York, 1994.
144. Intel i860 64-bit Microprocessor Programmer's Reference Manual, 1989.
145. P. W. Markstein, Computation of the elementary functions on the IBM RISC System/6000 Processor. IBM J. Res. Dev., 111-119 (1990).
146. P. Montuschi, and L. Ciminiera, Over-redundant digit sets and the design of digit-by-digit division units. IEEE Trans. Comput., 43(3): 269-277 (1994).
147. S. F. Oberman, Floating point division and square root algorithms and implementation in the AMD-K7 Microprocessor. Proceedings of the 14th IEEE Symposium on Computer Arithmetic, 106-115 (1999).
148. M. A. Cornea-Hasegan, R. A. Golliver, and P. Markstein, Correctness proofs outline for Newton-Raphson based floating-point divide and square root algorithms. Proceedings of the 14th IEEE Symposium on Computer Arithmetic, 1999, pp. 96-105.
149. D. DasSarma and D. W. Matula, Faithfull bipartite ROM reciprocal tables. Proceedings of the 12th IEEE Symposium on Computer Arithmetic, 1995, pp. 17-28.
150. H. L. Garner, The residue number system. IRE Trans. Electron. Comput., EC 8:140-147 (1959).
151. N. S. Szabo and R. I. Tanaka, Residue Arithmetic and Its Applications to Computer Technology. McGraw-Hill, New York, 1967.
152. P. K. Tang, Table look-up algorithms for elementary functions and their error analysis. Proceedings of the 10th IEEE Symposium on Computer Arithmetic, 1991, pp. 232-236.
153. G. B. Agnew, R. C. Mullin and S. A. Vanstone, An implementation of elliptic curve cryptosystems over F2 155. Cryptology, 3: 63-79 (1991).
154. J.-P. Deschamps and G. Sutter, FPGA implementation of modular multipliers. In:Proceedings of the XVII Design of Circuits and Integrated Systems Conference, Santander, Spain, November 2002, pp. 107-112.
155. J.-P. Deschamps and G. Sutter, Multiplication in a finite extension ring, In:Proceedings of the XVIII Design of Circuits and Integrated Systems Conference, Ciudad Real, Spain, November 2003, pp. 181-185.
156. C. H. Kim, S. Oh and J. Lim, A new hardware architecture for operations in GF(2n). IEEE Trans. Comput. 51(1): 90-92 (2002).
157. C. Paar, A new architecture for a parallel finite field multiplier with low complexity on composite fields. IEEE Trans. Comput., 45(7):856-861 (1996).
158. J. Ullman, Computational Aspects of VLSI, Computer Science Press, Maryland, 1984.
159. A. D. Woodbury, D. V. Bailey, and C. Paar, Elliptic curve cryptography on smart cards without coprocessors. IFIP CARDIS 71-92 (2000).
160. M. Ercegovac and T. Lang, Digital Arithmetic. Morgan Kaufmann, San Francisco, 2004.
161. S. F. Oberman and M. J. Flynn, Design issues in division and other floating-point operations. IEEE Trans. Comput., 46(2): 154-161 (1997).
162. B. Parhami, Computer Arithmetic: Algorithms and Hardware Design. Oxford University Press, New York, 2000.