AnsweredAssumed Answered

parallel realizations on BF561

Question asked by cm8537 on May 25, 2012

I'm trying to find the fastest way to implement y(n) = x(2n) + x(2n-1). It is basically a multirate filter with coefficients [1,1]. Can this be implemented in N/2 cycles, where N is the size of x? For now, assume x(-1) = 0 for boundary conditions.