This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Design of a High-Speed Square Generator
September 1998 (vol. 47 no. 9)
pp. 1021-1026

Abstract—Given a binary number N, the simplest way for evaluating its square N2 is the use of ROM look-up tables. For example, the squares of 12-bit numbers can be stored in a ROM of (212× 24) bits, which takes an area of 3.5mm2 and an access time of 9.96ns with 0.8μm CMOS process. However, the conventional ROM-table approaches are limited only for small bit-size applications due to the unmanageable increase of the ROM table size. In this paper, a novel design of square generator circuit using a folding approach is presented for high-speed performance applications. Results show that, with the same process, the proposed square generator circuit takes 12.27ns to generate the squares of 40-bit numbers with an area of about 2.88 times that of the (212× 24)-ROM, i.e., 10mm2. There exists a design trade-off between speed and area. A nested structure is also presented to achieve a 103-bit square generator with a delay of 15.82ns. The bit size can be further increased by adding more levels of the nested structure. The results are promising and thus the proposed approach is well suitable for large bit-size and high-speed applications.

[1] K. Huang, Computer Arithmetic.New York: Wiley, 1979.
[2] I. Koren, Computer Arithmetic Algorithms.Englewood Cliffs, N.J.: Prentice Hall, 1993.
[3] C.L. Wey and T.Y. Chang, "Design and Analysis of VLSI-Based Parallel Multipliers," IEE Proc. Part E, vol. 137, no. 4, pp. 328-336, July 1990.
[4] H. Ling, "An Approach to Implementing Multiplication with Small Tables," IEEE Trans. Computers, vol. 39, no. 5, pp. 717-718, May 1990.
[5] M.A. Soderstrand,W.K. Jenkins,G.A. Jullien,, and F.J. Taylor,Residue Number System Arithmetic: Modern Applicationsin Digital Signal Processing. IEEE Press, 1986.
[6] B. Vinnakota, "Implementing Multiplication with Split Read-Only Memory," IEEE Trans. Computers, vol. 44, no. 11, pp. 1,352-1,356, Nov. 1993.
[7] C.L. Wey, "On Design of Efficient Squares-Based Multipliers," Proc. IEEE Int'l Conf. Computer Design (ICCD '96), pp. 506-513,Austin, Tex., Oct. 1996.
[8] Standard Cell Library Handbook, CCL08-V1.0, Computer&Comm. Research Laboratories, Industrial Technology Research Inst., Hsinchu, Taiwan, 1995.
[9] R.L. Rivest,A. Shamir, and L.A. Adleman,"A Method for Obtaining Digital Signatures and Public Key Cryptosystems," Comm. ACM, vol. 21, pp. 120-126, 1978.

Index Terms:
Square generator, ROM table, folding approach, high-speed performance.
Citation:
Chin-Long Wey, Ming-Der Shieh, "Design of a High-Speed Square Generator," IEEE Transactions on Computers, vol. 47, no. 9, pp. 1021-1026, Sept. 1998, doi:10.1109/12.713320
Usage of this product signifies your acceptance of the Terms of Use.