Multiple Constant Multiplication Algorithm for High-Speed and Low-Power Design

—In this paper, radix-2r arithmetic is applied to the multiple constant multiplication (MCM) problem. Given a number M of nonnegative constants with a bit-length N, we determine the analytic formulas for the maximum number of additions, the average number of additions, and the maximum number of cascaded additions forming the critical path. We get the first proved bounds known so far for MCM. In addition of being fully-predictable with respect to the problem size (M, N), the RADIX-2r MCM heuristic exhibits a sublinear runtimecomplexity O(M×N/r), where r is a function of (M, N). For highcomplexity problems, it is most likely the only one that is even feasible to run. Another merit is that it has the shortest adderdepth in comparison to the best published MCM algorithms.

• Type: Journal
• Year: 2016
• Where: TCAS
• Authors: Abdelkrim Kamel Oudjida, Ahmed Liacha, Mohammed Bakiri, Nicolas Chaillet
• Keywords: TCAS 2016