Journals / Turkish Journal of Electrical Engineering and Computer Science / 2013 / Cilt: 21 - Sayı: 2

Design and evaluation of schemes for computing sum of squares in fixed point

Pages
500–512
Publication Date
2013-02-01
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

After hard-wire and software optimizations, it is seen that schemes with radix-4 give better results, especially in area.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Several schemes for computing the sum of squares for fixed point numbers are designed, synthesized, and evaluated in this study.
📊
Key Findings & Data:The schemes use radix-2 folding, radix-4 folding, and radix-4 dual recoding approaches for squaring.
💡
Conclusion & Impact:After hard-wire and software optimizations, it is seen that schemes with radix-4 give better results, especially in area.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Squaring · sum of squares · folding

Abstract

Several schemes for computing the sum of squares for fixed point numbers are designed, synthesized, and evaluated in this study. The schemes use radix-2 folding, radix-4 folding, and radix-4 dual recoding approaches for squaring. The schemes have been modeled in hardware description language, simulated, and synthesized using Cadence SOC81 in 45 nm and 90 nm libraries and with Mentor Graphics Leonardo Spectrum for 180 nm. We show delay and area for 16-, 24-, and 32-bit operands. After hard-wire and software optimizations, it is seen that schemes with radix-4 give better results, especially in area.

Özet

Several schemes for computing the sum of squares for fixed point numbers are designed, synthesized, and evaluated in this study. The schemes use radix-2 folding, radix-4 folding, and radix-4 dual recoding approaches for squaring. The schemes have been modeled in hardware description language, simulated, and synthesized using Cadence SOC81 in 45 nm and 90 nm libraries and with Mentor Graphics Leonardo Spectrum for 180 nm. We show delay and area for 16-, 24-, and 32-bit operands. After hard-wire and software optimizations, it is seen that schemes with radix-4 give better results, especially in area.

🔖

Cite This Article

ÖZBİLEN, M. M., ERCEGOVAC, M. D. (2013). Design and evaluation of schemes for computing sum of squares in fixed point. Turkish Journal of Electrical Engineering and Computer Science, Cilt: 21 - Sayı: 2, 500–512. https://ajindex.com/articles/188738

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (4)

  1. J. Pihl, E.J. Aas, “A multiplier and squarer generator for high performance DSP applications”, IEEE 39th Midwest Symposium on Circuits and Systems, Vol. 1, pp. 109–112, 1996.
  2. M.D. Ercegovac, T. Lang, Digital Arithmetic, San Francisco, Morgan Kaufmann, 2004.
  3. A.G.M. Strollo, D. De Caro, “Booth folding encoding for high performance squarer circuits”, IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, Vol. 50, pp. 250–254, 2003. D.W. Matula, “Higher radix squaring operations employing left-to-right dual recoding”, 19th IEEE Symposium on Computer Arithmetic, pp. 39–47, 2009. C.S. Wallace, “A suggestion for a fast multiplier”, IEEE Transactions on Electronic Computers, Vol. EC-13, pp. 14–17, 1964. L. Dadda, “Some schemes for parallel multiplier”, Alta Frequenza, Vol. 34, pp. 349–356, 1965. J. Fadavi-Ardekani, “M*N Booth encoded multiplier generator using optimized Wallace trees”, IEEE 1992 International Conference on Computer Design: VLSI in Computers and Processors, pp. 114–117, 1992.
  4. R.P. Brent, H.T. Kung, “A regular layout for parallel adders”, IEEE Transactions on Computers, Vol. C-31, pp. 260–264, 1982. J. Sklansky, “Conditional-sum addition logic”, IRE Transactions on Electronic Computers, Vol. EC-9, pp. 226–231, 19 P.M. Kogge, H.S. Stone, “A parallel algorithm for the efficient solution of a general class of recurrence equations”, IEEE Transactions on Computers, Vol. C-22, pp. 786–793, 1973.