Question

Explain folding and shifting operation on discrete sequence with input
​

Answer 1

Answer:

please mark me brainliest

Answer 2

Explanation:

They both yield different results if you have a fixed shifting block(which is usually the case). However, if the shifting block is programmable, you can achieve the same result.

For a given signal x[n]

Fold and shift : x[n] ->x[-n] -> x[-n+k] (Time advance after folding)

Shift and fold: x[n] ->x[n-k] -> x[-n+k)] (Time delay before folding)

Example:

a) x[2] ->x[-2]->x[-2+3] = x[1]

b) x[2] ->x[2-3]=x[-1]->x[1]

However, for most of the practical purposes, we use a delay block(and not an advance block), hence we prefer the shift and fold method.

Note: While doing a discrete convolution we do it as fold and shift(maybe for understanding purpose, I am not very sure though).