The failure of photovoltaic under typhoon conditions plays an important role in studying the influence of typhoon on power grid, so it is necessary to quantify the failure probability of PV under typhoon in order to p...
详细信息
In a recent work, we have introduced a new multiple constant multiplication (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 multiple constant multiplication (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.
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-...
详细信息
ISBN:
(纸本)9781424481927
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.
暂无评论