Fast Fourier Transforms on Finite Non-Abelian Groups

Authors:
M. G. Karpovsky
Affiliations:
Computer Science Division, Department of Mathematics, Tel-Aviv University
Venue:
IEEE Transactions on Computers
Year:
1977

Citing 3
Cited 2

Sequential Permutation Networks

IEEE Transactions on Computers
Optimal Dyadic Models of Time-Invariant Systems

IEEE Transactions on Computers
A Generalized Technique for Spectral Analysis

IEEE Transactions on Computers

Multi-dimensional option pricing using radial basis functions and the generalized Fourier transform

Journal of Computational and Applied Mathematics
Analog scrambling by the general fast Fourier transform

Proceedings of the 1982 conference on Cryptography

Quantified Score

Hi-index	14.98

Visualization

Abstract

Recent works [1]-[9] were devoted to the properties and application of Fourier transforms over finite Abelian groups and fast Fourier transforms for calculation of the corresponding spectra. In this correspondence we describe Fourier transforms on finite non-Abelian groups and appropriate algorithms of fast Fourier transforms.