In this paper, the multipleconstantmultiplication is implemented using the difference based adder graph. The experiments carried with the developed algorithm using Matlab, show that difference based adder graph prov...
详细信息
ISBN:
(纸本)9781728176680
In this paper, the multipleconstantmultiplication is implemented using the difference based adder graph. The experiments carried with the developed algorithm using Matlab, show that difference based adder graph provides low adder depth at the expense of having more adder cost, especially dealing with sets of many small constants or large constants. For such cases, results show an adder depth reduction up to 17% while an adder cost increase up to 11% compared to a recent adder graph algorithm known as FREYR in the state-of-art algorithms.
In a recent work, we have introduced a new multipleconstantmultiplication (MCM) algorithm, denoted as RADIX-2(r). The latter exhibits the best results in speed and power, comparatively with the most prominent algori...
详细信息
In a recent work, we have introduced a new multipleconstantmultiplication (MCM) algorithm, denoted as RADIX-2(r). The latter exhibits the best results in speed and power, comparatively with the most prominent algorithms. In this paper, the area aspect of RADIX-2(r) is more specially investigated. RADIX-2(r) is confronted to area efficient algorithms, notably to the cumulative benefit heuristic (Hcub) known for its lowest adder-cost. A number of benchmark FIR filters of growing complexity served for comparison. The results showed that RADIX-2(r) is better than Hcub in area, especially for high order filters where the saving ranges from 1.50% up to 3.46%. This advantage is analytically proved and experimentally confirmed using a 65nm CMOS technology. Area efficiency is achieved along with important savings in speed and power, ranging from 6.37% up to 38.01% and from 9.30% up to 25.85%, respectively. When MCM blocks are implemented alone, the savings are higher: 10.18%, 47.24%, and 41.27% in area, speed, and power, respectively. Most importantly, we prove that MCM heuristics using similar addition pattern (A-operation with the same shift spans) as Hcub yield excessive bit-adder overhead in MCM problems of high complexity. As such, they are not competitive to RADIX-2(r) in high order filters.
暂无评论