Multiple constant multiplication (MCM) is the problem of realizing several constant multiplications with one data using as few additions/subtractions as possible. Almost all previously proposed MCM algorithms have been using carry-propagation adders. However, for high-speed applications carry-save adders are a better choice. Although it is possible to map carry-save adders to carry-propagation ...

In this paper, we propose a new efficient reverse converter for the 4-moduli set { 2, 2 + 1, 2 − 1, 2 − 1 } based on a modified Chinese Remainder Theorem and Mixed Radix Conversion. Additionally, the resulting architecture is further reduced to obtain a reverse converter that utilizes only carry save adders, a multiplexer and carry propagate adders. The proposed converter has an area cost of (1...

This paper introduces a design technique for coarse-grained reconfigurable architectures targeting digital signal processing (DSP) applications. The design procedure is analyzed in detail and an areatime-power efficient reconfigurable kernel architecture is presented. The proposed technique inlines flexibility into custom carry-save (CS) arithmetic datapaths exploiting a stable and canonical in...