Sec. 11.2 Sufficiency Theorems for Finite-Length Sequences 785 3. Compute X[k] using the DFS analysis equation Nol RA = So ene HOA" = elk + XK. (11.40) =o In contrast to the general causal case discussed in Section 11.1, the procedure just outlined can be implemented on a computer, since Eqs. (11.39) and (11.40) can be evaluated accurately and efficiently using an FFT algorithm. To obtain an explicit relation between Xq{K], and X;(k], we can carry out the procedure analytically. From Eq. (11.37) and Eq. (8.34), it follows that XK) = Xalkl + (XK) to (11.41) =5 YS Falm|O vik — m); nb ie., X[k] is the periodic convolution of Xe{k], the DFS of ¥[n], with U y[k] the DFS of izy{n). The DFS of ay{si] can be shown to be (see Problem 11.22) _ nN, k=0, On{k] = ¢ —j2cot(xk/N), kodd, (11.42) keven. If we define 714) . { ~i2eot(rk/N), kodd, then Eq. (11.41) can be expressed as = . 1 a ~ XA = Xall + 5 YS Xalen| Valk — om. (11.44) mo Therefore, > 1 — ~ iki = wD, Paleo (11.45) which is the desired relation between the real and imaginary parts of the DFS of a periodically causal periodic sequence. Similarly, beginning with Eq. (11.38) we can show that w. i Ye Kifer lk — m] + 20] + (-1)'5[N/2]. (11.46) 4 Equations (11.45) and (11.46) relate the real and imaginary parts of the DFS representation of the periodic sequence ¥{n}. If ¥[n] is thought of as the periodic