Combined multiplication and sum-of-squares units

Michael J. Schulte, Louis Marquette, Shankar Krithivasan, E. George Walters, John Glossner

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

Multiplication and squaring are important operations in digital signal processing and multimedia applications. We present designs for units that implement either multiplication, A×B, or sum-of-squares computations, A2+B2, based on an input control signal. Compared to conventional parallel multipliers, these units have a modest increase in area and delay, but allow either multiplication or sum-of-squares computations to be performed. Combined multiplication and sum-of-squares units for unsigned and two's complement operands are presented, along with integrated designs that can operate on either unsigned or two's complement operands. The designs can also be extended to work with a third accumulator operand to compute either Z+A×B or Z+A2+B2/. Synthesis results indicate that a combined multiplication and sum-of-squares unit for 32-bit two's complement operands can be implemented with roughly 15% more area and nearly the same worst case delay as a conventional 32-bit two's complement multiplier.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE International Conference on Application-Specific Systems, Architectures, and Processors, ASAP 2003
EditorsEd Deprettere, Shuvra Bhattacharyya, Lothar Thiele, Joseph Cavallaro, Alain Darte
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages204-214
Number of pages11
ISBN (Electronic)076951992X
DOIs
StatePublished - Jan 1 2003
EventIEEE International Conference on Application-Specific Systems, Architectures, and Processors, ASAP 2003 - The Hague, Netherlands
Duration: Jun 24 2003Jun 26 2003

Publication series

NameProceedings of the International Conference on Application-Specific Systems, Architectures and Processors
Volume2003-January
ISSN (Print)1063-6862

Other

OtherIEEE International Conference on Application-Specific Systems, Architectures, and Processors, ASAP 2003
CountryNetherlands
CityThe Hague
Period6/24/036/26/03

Fingerprint

Digital signal processing

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Schulte, M. J., Marquette, L., Krithivasan, S., Walters, E. G., & Glossner, J. (2003). Combined multiplication and sum-of-squares units. In E. Deprettere, S. Bhattacharyya, L. Thiele, J. Cavallaro, & A. Darte (Eds.), Proceedings - IEEE International Conference on Application-Specific Systems, Architectures, and Processors, ASAP 2003 (pp. 204-214). [1212844] (Proceedings of the International Conference on Application-Specific Systems, Architectures and Processors; Vol. 2003-January). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ASAP.2003.1212844
Schulte, Michael J. ; Marquette, Louis ; Krithivasan, Shankar ; Walters, E. George ; Glossner, John. / Combined multiplication and sum-of-squares units. Proceedings - IEEE International Conference on Application-Specific Systems, Architectures, and Processors, ASAP 2003. editor / Ed Deprettere ; Shuvra Bhattacharyya ; Lothar Thiele ; Joseph Cavallaro ; Alain Darte. Institute of Electrical and Electronics Engineers Inc., 2003. pp. 204-214 (Proceedings of the International Conference on Application-Specific Systems, Architectures and Processors).
@inproceedings{18b5ad8da3ca41ff8cd95bea98a09c5a,
title = "Combined multiplication and sum-of-squares units",
abstract = "Multiplication and squaring are important operations in digital signal processing and multimedia applications. We present designs for units that implement either multiplication, A×B, or sum-of-squares computations, A2+B2, based on an input control signal. Compared to conventional parallel multipliers, these units have a modest increase in area and delay, but allow either multiplication or sum-of-squares computations to be performed. Combined multiplication and sum-of-squares units for unsigned and two's complement operands are presented, along with integrated designs that can operate on either unsigned or two's complement operands. The designs can also be extended to work with a third accumulator operand to compute either Z+A×B or Z+A2+B2/. Synthesis results indicate that a combined multiplication and sum-of-squares unit for 32-bit two's complement operands can be implemented with roughly 15{\%} more area and nearly the same worst case delay as a conventional 32-bit two's complement multiplier.",
author = "Schulte, {Michael J.} and Louis Marquette and Shankar Krithivasan and Walters, {E. George} and John Glossner",
year = "2003",
month = "1",
day = "1",
doi = "10.1109/ASAP.2003.1212844",
language = "English (US)",
series = "Proceedings of the International Conference on Application-Specific Systems, Architectures and Processors",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "204--214",
editor = "Ed Deprettere and Shuvra Bhattacharyya and Lothar Thiele and Joseph Cavallaro and Alain Darte",
booktitle = "Proceedings - IEEE International Conference on Application-Specific Systems, Architectures, and Processors, ASAP 2003",
address = "United States",

}

Schulte, MJ, Marquette, L, Krithivasan, S, Walters, EG & Glossner, J 2003, Combined multiplication and sum-of-squares units. in E Deprettere, S Bhattacharyya, L Thiele, J Cavallaro & A Darte (eds), Proceedings - IEEE International Conference on Application-Specific Systems, Architectures, and Processors, ASAP 2003., 1212844, Proceedings of the International Conference on Application-Specific Systems, Architectures and Processors, vol. 2003-January, Institute of Electrical and Electronics Engineers Inc., pp. 204-214, IEEE International Conference on Application-Specific Systems, Architectures, and Processors, ASAP 2003, The Hague, Netherlands, 6/24/03. https://doi.org/10.1109/ASAP.2003.1212844

Combined multiplication and sum-of-squares units. / Schulte, Michael J.; Marquette, Louis; Krithivasan, Shankar; Walters, E. George; Glossner, John.

Proceedings - IEEE International Conference on Application-Specific Systems, Architectures, and Processors, ASAP 2003. ed. / Ed Deprettere; Shuvra Bhattacharyya; Lothar Thiele; Joseph Cavallaro; Alain Darte. Institute of Electrical and Electronics Engineers Inc., 2003. p. 204-214 1212844 (Proceedings of the International Conference on Application-Specific Systems, Architectures and Processors; Vol. 2003-January).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Combined multiplication and sum-of-squares units

AU - Schulte, Michael J.

AU - Marquette, Louis

AU - Krithivasan, Shankar

AU - Walters, E. George

AU - Glossner, John

PY - 2003/1/1

Y1 - 2003/1/1

N2 - Multiplication and squaring are important operations in digital signal processing and multimedia applications. We present designs for units that implement either multiplication, A×B, or sum-of-squares computations, A2+B2, based on an input control signal. Compared to conventional parallel multipliers, these units have a modest increase in area and delay, but allow either multiplication or sum-of-squares computations to be performed. Combined multiplication and sum-of-squares units for unsigned and two's complement operands are presented, along with integrated designs that can operate on either unsigned or two's complement operands. The designs can also be extended to work with a third accumulator operand to compute either Z+A×B or Z+A2+B2/. Synthesis results indicate that a combined multiplication and sum-of-squares unit for 32-bit two's complement operands can be implemented with roughly 15% more area and nearly the same worst case delay as a conventional 32-bit two's complement multiplier.

AB - Multiplication and squaring are important operations in digital signal processing and multimedia applications. We present designs for units that implement either multiplication, A×B, or sum-of-squares computations, A2+B2, based on an input control signal. Compared to conventional parallel multipliers, these units have a modest increase in area and delay, but allow either multiplication or sum-of-squares computations to be performed. Combined multiplication and sum-of-squares units for unsigned and two's complement operands are presented, along with integrated designs that can operate on either unsigned or two's complement operands. The designs can also be extended to work with a third accumulator operand to compute either Z+A×B or Z+A2+B2/. Synthesis results indicate that a combined multiplication and sum-of-squares unit for 32-bit two's complement operands can be implemented with roughly 15% more area and nearly the same worst case delay as a conventional 32-bit two's complement multiplier.

UR - http://www.scopus.com/inward/record.url?scp=4544366998&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=4544366998&partnerID=8YFLogxK

U2 - 10.1109/ASAP.2003.1212844

DO - 10.1109/ASAP.2003.1212844

M3 - Conference contribution

AN - SCOPUS:4544366998

T3 - Proceedings of the International Conference on Application-Specific Systems, Architectures and Processors

SP - 204

EP - 214

BT - Proceedings - IEEE International Conference on Application-Specific Systems, Architectures, and Processors, ASAP 2003

A2 - Deprettere, Ed

A2 - Bhattacharyya, Shuvra

A2 - Thiele, Lothar

A2 - Cavallaro, Joseph

A2 - Darte, Alain

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Schulte MJ, Marquette L, Krithivasan S, Walters EG, Glossner J. Combined multiplication and sum-of-squares units. In Deprettere E, Bhattacharyya S, Thiele L, Cavallaro J, Darte A, editors, Proceedings - IEEE International Conference on Application-Specific Systems, Architectures, and Processors, ASAP 2003. Institute of Electrical and Electronics Engineers Inc. 2003. p. 204-214. 1212844. (Proceedings of the International Conference on Application-Specific Systems, Architectures and Processors). https://doi.org/10.1109/ASAP.2003.1212844