Convolution: Quadratic Time Complexity

Convolution: Quadratic Time Complexity

m Truncation of impulse responses not possible in

general

m Computation time increases as square of simulation

length

Ô fast for few time-points

Ô inefficient for many time-points

m Is simulation possible in linear time without

sacrificing accuracy or approximating impulse

responses?

Previous slide Next slide Back to the first slide View Graphic Version