1 Hit in 3.5 sec

Energy-time complexity of algorithms : modelling the trade-offs of CMOS VLSI

Brad D Bingham
Using these models, I derive lower bounds for the ETα costs of sorting, addition and multiplication, where E and T are the total energy and time, and present algorithms that meet these bounds asymptotically  ...  I propose simple models for analysing algorithms and deriving lower bounds that reflect the energy-time trade-offs and parallelism of CMOS circuits.  ...  Consider computing a brute-force DFT of N elements on a linear array (similar to the systolic array of Kung [34] ), i.e., compute X(k) = N −1 h=0 x(h)ω kh N , where ω N = e s(k) = j−1 h=0 x((k + h) mod  ... 
doi:10.14288/1.0302116 fatcat:vv6kuyzt7zhflfp5r5yswbgc2e