Partial-product generation and addition for multiplication in FPGAS with 6-input LUTs

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

5 Citations (Scopus)

Abstract

Multiplication is the dominant operation for many applications implemented on field-programmable gate arrays (FPGAs). Although most current FPGA families have embedded hard multipliers, soft multipliers using lookup tables (LUTs) in the logic fabric remain important. This paper presents a novel circuit that combines radix-4 partial-product generation with addition (patent pending) and shows how it can be used to implement two's-complement multipliers. Single-cycle and pipelined designs for 8×8, 10×10, 12×12, 14×14 and 16×16 multipliers are compared to Xilinx LogiCORE IP multipliers. Proposed single-cycle parallel-tree multipliers use 35% to 45% fewer LUTs and have 9% to 22% less delay than LogiCORE IP multipliers. Proposed pipelined parallel-tree multipliers use 32% to 40% fewer LUTs than LogiCORE IP multipliers. Proposed parallel-array multipliers use even fewer LUTs than parallel-tree multipliers at the expense of increased delay.

Original languageEnglish (US)
Title of host publicationConference Record of the 48th Asilomar Conference on Signals, Systems and Computers
EditorsMichael B. Matthews
PublisherIEEE Computer Society
Pages1247-1251
Number of pages5
Volume2015-April
ISBN (Electronic)9781479982974
DOIs
StatePublished - Apr 24 2015
Event48th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015 - Pacific Grove, United States
Duration: Nov 2 2014Nov 5 2014

Other

Other48th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015
CountryUnited States
CityPacific Grove
Period11/2/1411/5/14

Fingerprint

Table lookup
Field programmable gate arrays (FPGA)
Networks (circuits)

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Networks and Communications

Cite this

Walters, III, E. G. (2015). Partial-product generation and addition for multiplication in FPGAS with 6-input LUTs. In M. B. Matthews (Ed.), Conference Record of the 48th Asilomar Conference on Signals, Systems and Computers (Vol. 2015-April, pp. 1247-1251). [7094659] IEEE Computer Society. https://doi.org/10.1109/ACSSC.2014.7094659
Walters, III, Eugene George. / Partial-product generation and addition for multiplication in FPGAS with 6-input LUTs. Conference Record of the 48th Asilomar Conference on Signals, Systems and Computers. editor / Michael B. Matthews. Vol. 2015-April IEEE Computer Society, 2015. pp. 1247-1251
@inproceedings{280e49a7052b476489adca33598d6d19,
title = "Partial-product generation and addition for multiplication in FPGAS with 6-input LUTs",
abstract = "Multiplication is the dominant operation for many applications implemented on field-programmable gate arrays (FPGAs). Although most current FPGA families have embedded hard multipliers, soft multipliers using lookup tables (LUTs) in the logic fabric remain important. This paper presents a novel circuit that combines radix-4 partial-product generation with addition (patent pending) and shows how it can be used to implement two's-complement multipliers. Single-cycle and pipelined designs for 8×8, 10×10, 12×12, 14×14 and 16×16 multipliers are compared to Xilinx LogiCORE IP multipliers. Proposed single-cycle parallel-tree multipliers use 35{\%} to 45{\%} fewer LUTs and have 9{\%} to 22{\%} less delay than LogiCORE IP multipliers. Proposed pipelined parallel-tree multipliers use 32{\%} to 40{\%} fewer LUTs than LogiCORE IP multipliers. Proposed parallel-array multipliers use even fewer LUTs than parallel-tree multipliers at the expense of increased delay.",
author = "{Walters, III}, {Eugene George}",
year = "2015",
month = "4",
day = "24",
doi = "10.1109/ACSSC.2014.7094659",
language = "English (US)",
volume = "2015-April",
pages = "1247--1251",
editor = "Matthews, {Michael B.}",
booktitle = "Conference Record of the 48th Asilomar Conference on Signals, Systems and Computers",
publisher = "IEEE Computer Society",
address = "United States",

}

Walters, III, EG 2015, Partial-product generation and addition for multiplication in FPGAS with 6-input LUTs. in MB Matthews (ed.), Conference Record of the 48th Asilomar Conference on Signals, Systems and Computers. vol. 2015-April, 7094659, IEEE Computer Society, pp. 1247-1251, 48th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015, Pacific Grove, United States, 11/2/14. https://doi.org/10.1109/ACSSC.2014.7094659

Partial-product generation and addition for multiplication in FPGAS with 6-input LUTs. / Walters, III, Eugene George.

Conference Record of the 48th Asilomar Conference on Signals, Systems and Computers. ed. / Michael B. Matthews. Vol. 2015-April IEEE Computer Society, 2015. p. 1247-1251 7094659.

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

TY - GEN

T1 - Partial-product generation and addition for multiplication in FPGAS with 6-input LUTs

AU - Walters, III, Eugene George

PY - 2015/4/24

Y1 - 2015/4/24

N2 - Multiplication is the dominant operation for many applications implemented on field-programmable gate arrays (FPGAs). Although most current FPGA families have embedded hard multipliers, soft multipliers using lookup tables (LUTs) in the logic fabric remain important. This paper presents a novel circuit that combines radix-4 partial-product generation with addition (patent pending) and shows how it can be used to implement two's-complement multipliers. Single-cycle and pipelined designs for 8×8, 10×10, 12×12, 14×14 and 16×16 multipliers are compared to Xilinx LogiCORE IP multipliers. Proposed single-cycle parallel-tree multipliers use 35% to 45% fewer LUTs and have 9% to 22% less delay than LogiCORE IP multipliers. Proposed pipelined parallel-tree multipliers use 32% to 40% fewer LUTs than LogiCORE IP multipliers. Proposed parallel-array multipliers use even fewer LUTs than parallel-tree multipliers at the expense of increased delay.

AB - Multiplication is the dominant operation for many applications implemented on field-programmable gate arrays (FPGAs). Although most current FPGA families have embedded hard multipliers, soft multipliers using lookup tables (LUTs) in the logic fabric remain important. This paper presents a novel circuit that combines radix-4 partial-product generation with addition (patent pending) and shows how it can be used to implement two's-complement multipliers. Single-cycle and pipelined designs for 8×8, 10×10, 12×12, 14×14 and 16×16 multipliers are compared to Xilinx LogiCORE IP multipliers. Proposed single-cycle parallel-tree multipliers use 35% to 45% fewer LUTs and have 9% to 22% less delay than LogiCORE IP multipliers. Proposed pipelined parallel-tree multipliers use 32% to 40% fewer LUTs than LogiCORE IP multipliers. Proposed parallel-array multipliers use even fewer LUTs than parallel-tree multipliers at the expense of increased delay.

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

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

U2 - 10.1109/ACSSC.2014.7094659

DO - 10.1109/ACSSC.2014.7094659

M3 - Conference contribution

AN - SCOPUS:84940480471

VL - 2015-April

SP - 1247

EP - 1251

BT - Conference Record of the 48th Asilomar Conference on Signals, Systems and Computers

A2 - Matthews, Michael B.

PB - IEEE Computer Society

ER -

Walters, III EG. Partial-product generation and addition for multiplication in FPGAS with 6-input LUTs. In Matthews MB, editor, Conference Record of the 48th Asilomar Conference on Signals, Systems and Computers. Vol. 2015-April. IEEE Computer Society. 2015. p. 1247-1251. 7094659 https://doi.org/10.1109/ACSSC.2014.7094659