Equations (13.65) and (13.68) are recursive relationships that can be used to compute the complex cepstrum when the input sequence x[n] is minimum phase and maximum phase, respectively.
(a) Use Eq. (13.65) to compute recursively the complex cepstrum of the sequence
x[n] = anu[n], where |a| < 1.
(b) Use Eq. (13.68) to compute recursively the complex cepstrum of the sequence
x[n] = δ[n] − aδ[n + 1], where |a| < 1.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.