Matrix identities of the fast fourier transform

Let A_n(ω) be the nxn matrix A_n(ω)=(a_ij with a_ij=ω^ij, 0?i,j?n?1, ωⁿ=1. For n=rs we show

$\text{A}{}_{\mathrm{n}}\text{(w)P}{}_{\mathrm{s}}{}^{\mathrm{r}}\text{P}{}_{\mathrm{r}}{}^{\mathrm{s}}\text{∵}\text{0}\text{s?1}\text{A}{}_{\mathrm{r}}\text{(w}{}^{\mathrm{s}}\text{)}\text{P}{}_{\mathrm{s}}{}^{\mathrm{r}}\text{{T}{}_{\mathrm{r}}{}^{\mathrm{s}}\text{(w)}}\text{∵}\text{0}\text{r?1}\text{A}{}_{\mathrm{s}}\text{(w}{}^{\mathrm{r}}\text{)}$

=(A_r?I_s)T^s_r(I_r?A_s). When r and s are relatively prime this identity implies a wide class of identities of the form PA_n(ω)Q^T=A_r(ω^αs)?A_s(ω^βr). The matrices P^s_r, P^r_s, P, and Q are permutation matrices corresponding to the “data shuffling” required in a computer implementation of the FFT, and T^s_r is a diagonal matrix whose nonzeros are called “twiddle factors.” We establish these identities and discuss their algorithmic significance.