Skip to main content
Erschienen in: Cluster Computing 5/2019

12.09.2017

Energy efficient parallel hybrid adder architecture for 3X generation in radix-8 booth encoding

verfasst von: R. Nirmaladevi, R. Seshasayanan

Erschienen in: Cluster Computing | Sonderheft 5/2019

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

The need for hard (3X) multiple generation in radix-8 booth encoding increases the complexity of partial product generation and the latency of the multiplier. The source of delay is primarily the propagation of carry signals. A variety of carry propagate adder architectures have been studied to overcome this drawback. In this paper, we propose a hybrid adder architecture that precomputes the simultaneous generation of pseudo carry signals by exploiting the symmetry of 3X multiple and the final carry generation using Ling prefix network. As the Ling adder in the carry path reduces the complexity, the proposed adder results in significant improvement in the power delay product (\({\sim }\)25–55%) compared to state of the art 64 bit adders. This adder decreases the number of logic gates in the critical path, leading to a reduction in static power consumption. As a design metric, it is necessary to minimize the energy dissipation of logic modules, the results indicate that the proposed hybrid adder would fulfil the requirements of processors in deep sub-micron VLSI technology.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
3.
Zurück zum Zitat Madrid, P.E., Millar, B., Swartzlander Jr., E.E.: Modified Booth algorithm for high radix fixed point multiplication. IEEE Trans. VLSI Syst. 1, 164–167 (1993)CrossRef Madrid, P.E., Millar, B., Swartzlander Jr., E.E.: Modified Booth algorithm for high radix fixed point multiplication. IEEE Trans. VLSI Syst. 1, 164–167 (1993)CrossRef
4.
Zurück zum Zitat Dawoud, D.S.: Modified Booth algorithm for higher radix fixed-point multiplication. In: Proceedings of South African Symposium on Communications and Signal Processing, pp. 95–100 (1997) Dawoud, D.S.: Modified Booth algorithm for higher radix fixed-point multiplication. In: Proceedings of South African Symposium on Communications and Signal Processing, pp. 95–100 (1997)
5.
Zurück zum Zitat Parhani, B.: Computer Arithmetic Algorithms and Hardware Designs. Oxford University Press, New York (2000) Parhani, B.: Computer Arithmetic Algorithms and Hardware Designs. Oxford University Press, New York (2000)
6.
Zurück zum Zitat Kogge, P.M., Stone, H.S.: A parallel algorithm for the efficient solution of a general class of recurrence equations. IEEE Trans. Comput. 22(8), 786–792 (1973)MathSciNetCrossRef Kogge, P.M., Stone, H.S.: A parallel algorithm for the efficient solution of a general class of recurrence equations. IEEE Trans. Comput. 22(8), 786–792 (1973)MathSciNetCrossRef
7.
Zurück zum Zitat Ruiz, G.A., Granda, M.: An area-efficient static CMOS carry-select adder based on a compact carry look-ahead unit. Microelectron. J. 35(12), 939–944 (2004)CrossRef Ruiz, G.A., Granda, M.: An area-efficient static CMOS carry-select adder based on a compact carry look-ahead unit. Microelectron. J. 35(12), 939–944 (2004)CrossRef
9.
10.
Zurück zum Zitat Han, T., Carlson, D.: Fast area-efficient VLSI adders. In: Proceedings of IEEE Symposium on Compuer Arithmetic, pp. 49–56 (1987) Han, T., Carlson, D.: Fast area-efficient VLSI adders. In: Proceedings of IEEE Symposium on Compuer Arithmetic, pp. 49–56 (1987)
11.
Zurück zum Zitat Knowles, S.: A family of adders. In: Proceedings of the 14th IEEE Symposium on Computer Arithmetic, pp. 30–34 (1999) Knowles, S.: A family of adders. In: Proceedings of the 14th IEEE Symposium on Computer Arithmetic, pp. 30–34 (1999)
13.
Zurück zum Zitat Becker, B., Kolla, R.: On the construction of optimal time adders. In: Proceedings of the 5th Annual Symposium on Theoretical Aspects of Computer Science (STACS’88), pp. 18–28. Springer, New York (1988) Becker, B., Kolla, R.: On the construction of optimal time adders. In: Proceedings of the 5th Annual Symposium on Theoretical Aspects of Computer Science (STACS’88), pp. 18–28. Springer, New York (1988)
14.
Zurück zum Zitat Lo, Jien-Chung: A fast binary adder with conditional carry generation. IEEE Trans. Comput. 46, 248–253 (1997)CrossRef Lo, Jien-Chung: A fast binary adder with conditional carry generation. IEEE Trans. Comput. 46, 248–253 (1997)CrossRef
15.
Zurück zum Zitat Cheng, K.-H., Cheng, Shun-wen: Improved 32 bit conditional sum adder for low-power high speed applications. J. Inf. Sci. Eng. 22, 975–989 (2006) Cheng, K.-H., Cheng, Shun-wen: Improved 32 bit conditional sum adder for low-power high speed applications. J. Inf. Sci. Eng. 22, 975–989 (2006)
16.
Zurück zum Zitat Ruiz, G.A., Granda, M.: Efficient implementation of 3X for radix-8 encoding. Microelectron. J. 39(1), 152–159 (2008)CrossRef Ruiz, G.A., Granda, M.: Efficient implementation of 3X for radix-8 encoding. Microelectron. J. 39(1), 152–159 (2008)CrossRef
17.
Zurück zum Zitat Bewick, G., Flynn, M.J.: Binary Multiplication Using Partially Redundant Multiples. CSLTR-92-528. Computer Systems Laboratory, Stanford University, Stanford (1992) Bewick, G., Flynn, M.J.: Binary Multiplication Using Partially Redundant Multiples. CSLTR-92-528. Computer Systems Laboratory, Stanford University, Stanford (1992)
18.
Zurück zum Zitat Pettenghi, H., Pratas, F., Sousa, L.: Method for designing efficient mixed radix multipliers. Circ. Syst. Signal Process. 33, 3165–3193 (2014)CrossRef Pettenghi, H., Pratas, F., Sousa, L.: Method for designing efficient mixed radix multipliers. Circ. Syst. Signal Process. 33, 3165–3193 (2014)CrossRef
19.
20.
Zurück zum Zitat Dimitrakopoulos, G., Nikolos, D.: High-speed parallel-prefix VLSI ling adders. IEEE Trans. Comput. 54(2), 225–231 (2005)CrossRef Dimitrakopoulos, G., Nikolos, D.: High-speed parallel-prefix VLSI ling adders. IEEE Trans. Comput. 54(2), 225–231 (2005)CrossRef
21.
Zurück zum Zitat Grad, J., Stine, J.E.: A hybrid ling carry select adder. In: Conference record of 38th Asilomar Conference on Signals, Systems, and Computers, vol. 2, pp. 1363–1367 (2004) Grad, J., Stine, J.E.: A hybrid ling carry select adder. In: Conference record of 38th Asilomar Conference on Signals, Systems, and Computers, vol. 2, pp. 1363–1367 (2004)
22.
23.
Zurück zum Zitat Vazquez, A., Antelo, E.: New insights on ling adders. In: International Conference on Application—Specific Systems, Architectures and Processors, pp. 227–232 (2008) Vazquez, A., Antelo, E.: New insights on ling adders. In: International Conference on Application—Specific Systems, Architectures and Processors, pp. 227–232 (2008)
24.
Zurück zum Zitat Burgess, N.: Implementation of recursive Ling adders in CMOS VLSI. In: Proceedings of 43rd Asilomar Conference on Signals, Systems, and Computers, pp. 1777–1781 (2009) Burgess, N.: Implementation of recursive Ling adders in CMOS VLSI. In: Proceedings of 43rd Asilomar Conference on Signals, Systems, and Computers, pp. 1777–1781 (2009)
25.
Zurück zum Zitat Juang, T.-B., Meher, P.K., Kuan, C.-C.: Area-efficient parallel-prefix Ling adders. In: Proceedings of IEEE Asia Pacific Conference on Circuits and Systems (APCCAS), pp. 736–739 (2010) Juang, T.-B., Meher, P.K., Kuan, C.-C.: Area-efficient parallel-prefix Ling adders. In: Proceedings of IEEE Asia Pacific Conference on Circuits and Systems (APCCAS), pp. 736–739 (2010)
26.
Zurück zum Zitat Bart, R., Zeydel, D.B., Oklobdzija, V.G.: Energy-efficient design methodologies: high-performance VLSI adders. IEEE J. Solid State Circ. 45(1), 1220–1233 (2010) Bart, R., Zeydel, D.B., Oklobdzija, V.G.: Energy-efficient design methodologies: high-performance VLSI adders. IEEE J. Solid State Circ. 45(1), 1220–1233 (2010)
27.
Zurück zum Zitat Wang, L., Song, W., Liu, P.: Link the remote sensing big data to the image features via wavelet transformation. Cluster Comput. 19(2), 793–810 (2016)CrossRef Wang, L., Song, W., Liu, P.: Link the remote sensing big data to the image features via wavelet transformation. Cluster Comput. 19(2), 793–810 (2016)CrossRef
28.
Zurück zum Zitat Yang, C., Chi, P., Song, X., Lin, Yu., Li, B.H., Chai, X.: An efficient approach to collaborative simulation of variable structure systems on multi-core machines. Cluster Comput. 19(1), 29–46 (2016)CrossRef Yang, C., Chi, P., Song, X., Lin, Yu., Li, B.H., Chai, X.: An efficient approach to collaborative simulation of variable structure systems on multi-core machines. Cluster Comput. 19(1), 29–46 (2016)CrossRef
Metadaten
Titel
Energy efficient parallel hybrid adder architecture for 3X generation in radix-8 booth encoding
verfasst von
R. Nirmaladevi
R. Seshasayanan
Publikationsdatum
12.09.2017
Verlag
Springer US
Erschienen in
Cluster Computing / Ausgabe Sonderheft 5/2019
Print ISSN: 1386-7857
Elektronische ISSN: 1573-7543
DOI
https://doi.org/10.1007/s10586-017-1162-3

Weitere Artikel der Sonderheft 5/2019

Cluster Computing 5/2019 Zur Ausgabe