Fast Fourier Transforms on Finite Non-Abelian Groups
暂无分享,去创建一个
[1] Kazuaki Harada. Sequential Permutation Networks , 1972, IEEE Transactions on Computers.
[2] Harry C. Andrews. B70-2 Transmission of Information by Orthogonal Functions , 1970, IEEE Transactions on Computers.
[3] V. Benes. Optimal rearrangeable multistage connecting networks , 1964 .
[4] Harry C. Andrews,et al. A Generalized Technique for Spectral Analysis , 1970, IEEE Transactions on Computers.
[5] Judea Pearl,et al. Optimal Dyadic Models of Time-Invariant Systems , 1975, IEEE Transactions on Computers.
[6] D. C. Opferman,et al. On a class of rearrangeable switching networks part I: Control algorithm , 1971 .
[7] Paul A. Wintz,et al. Calculation of Fourier transforms on finite Abelian groups (Corresp.) , 1970, IEEE Trans. Inf. Theory.
[8] Robert J. Lechner. HARMONIC ANALYSIS OF SWITCHING FUNCTIONS , 1971 .
[9] Brian L. N. Kennett. A note on the finite Walsh transform (Corresp.) , 1970, IEEE Trans. Inf. Theory.
[10] Mark G. Karpovsky,et al. Some Optimization Problems for Convolution Systems over Finite Groups , 1977, Inf. Control..