Abstract
This paper presents two optimized design approaches of two’s complement large size squarers using embedded multipliers in FPGAs. The realization of one of the approaches is based on Baugh–Wooley’s algorithm and the other one is a new sign-extension technique. To achieve efficient implementation, a set of optimized schemes for the realization of multi-level additions of the partial products is proposed. The squarers are implemented for operands of sizes ranging from 20 to 128 bits targeting Xilinx’ Spartan-3 using the ISE 8.1 synthesis and implementation tool, and from 38 to 128 bits targeting Altera’s Stratix II using the Quartus II 6.0 synthesis and implementation tool. The comparisons indicate that our proposed approaches offer substantial area savings and delay reduction. Using the Baugh–Wooley-based approach, the average saving in LUTs is close to 50% with an average delay reduction in the range of 13% to 20%. With the new sign extension approach, the area saving ranges from 54% to 70%, while the delay is reduced by approximately 25%. Embedded block usage for both approaches with different tools is reduced by 38% compared with the standard schemes.













Similar content being viewed by others
References
Ming-Hwa, S., & Su-Hon, L. (2002). Fast Compensative Design Approach of the Approximate Squaring Function. IEEE Journal of Solid-state Circuits, 37(1), 95–97, Jan.
Langlois, J. M. P., & Al-Khalili, D. (2006). Carry-free approximate squaring functions with O(n) complexity and O(1) delay. IEEE Transactions on Circuits and Systems, 53(5), 374–378. doi:10.1109/TCSII.2006.873364.
Hiasat, A. A., & Abdel-Aty-Zohdy, H. S. (1999). Combinational logic approach for implementing an improved approximate squaring function. IEEE Journal of Solid-state Circuits, 34(2), 236–240. doi:10.1109/4.743786.
Parhami, B. (2000). Computer Arithmetic Algorithms and Hardware Designs. New York, Oxford: Oxford University Press.
Altera Corporation (2006). Staratix III Device Handbook (vol. 1). San Jose: Altera.
Xilinx Inc. (2006). XilinxDSP Design Considerations, XtremeDSP for Virtex-4 FPGAs, UG073 (vol. 2.2). San Jose: Xilinx.
Lee, B. R., & Burgess, N. (2003). Improved small multiplier based multiplication, squaring and division. Proc. of the 11th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM’03), April, 91–97.
Nedjah, N., & Mourelle, L. (2003). A reconfigurable recursive and efficient hardware for Karatsuba Ofman’s multiplication algorithm. IEEE Proceeding of the CCA 2003 Conference on Control Applications, 2, 1067–1081, 23–25 June.
Gao, S., Chabini, N., Al-Khalili, D., & Langlois, J. M. P. (2006). An optimized design approach for squaring large integers using embedded hardwired multipliers. Proceedings of IEEE Conference on Computer Systems and Applications, March, 248–254.
Gao, S., Chabini, N., Al-Khalili, D., & Langlois, P. (2007). Optimized realizations of large integer multipliers and squarers using embedded blocks. Journal IET Computers & Digital Techniques, 1(1), 9–16, January.
Baugh, C. R., & Wooley, B. A. (1973). A two’s complement parallel array multiplication algorithm. IEEE Transactions on Computers, C-22(12), 1045–1047.
Xilinx Inc: [On line]: http://www.xilinx.com.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gao, S., Chabini, N., Al-Khalili, D. et al. FPGA-Based Efficient Design Approaches for Large Size Two’s Complement Squarers. J Sign Process Syst Sign Image Video Technol 58, 3–15 (2010). https://doi.org/10.1007/s11265-008-0275-6
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11265-008-0275-6