Efficient arithmetic sum-of-product (SOP) based multiple constant multiplication (MCM) for FFT

Authors:
Vinay Karkala;Joseph Wanstrath;Travis Lacour;Sunil P. Khatri
Affiliations:
Texas A&M University, College Station TX;Rose-Hulman Institute of Technology, Indiana;Texas A&M University, College Station TX;Texas A&M University, College Station TX
Venue:
Proceedings of the International Conference on Computer-Aided Design
Year:
2010

Citing 7
Cited 0

Digital signal processing (3rd ed.): principles, algorithms, and applications

Digital signal processing (3rd ed.): principles, algorithms, and applications
GRASP—a new search algorithm for satisfiability

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Digital filter synthesis based on minimal signed digit representation

Proceedings of the 38th annual Design Automation Conference
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
An exact algorithm for the maximal sharing of partial terms in multiple constant multiplications

ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Multiple constant multiplications: efficient and versatile framework and algorithms for exploring common subexpression elimination

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Exact and Approximate Algorithms for the Optimization of Area and Delay in Multiple Constant Multiplications

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present an arithmetic sum-of-products (SOP) based realization of the general Multiple Constant Multiplication (MCM) algorithm. We also propose an enhanced SOP based algorithm, which uses Partial Max-SAT (PMSAT) to further optimize the SOP. The enhanced algorithm attempts to reduce the number of rows (partial products) of the SOP, by i) shifting coefficients to realize other coefficients when possible, ii) exploring multiple implementations of each coefficient using a Minimal Signed Digit (MSD) format and iii) exploiting the mutual exclusiveness within certain groups of partial products. Hardware implementations of the Fast Fourier Transform (FFT) algorithm require the incoming data to be multiplied by one of several constant coefficients. We test/validate it for FFT, which is an important problem. We compare our SOP-based architectures with the best existing implementation of MCM for FFT (which utilizes a cascade of adders), and show that our approaches show a significant improvement in area and delay. Our architecture was synthesized using 65nm technology libraries.