论文信息 - Fast algorithms for calculation of Gibbs derivatives on finite groups

Fast algorithms for calculation of Gibbs derivatives on finite groups

In this paper we discuss the definition of Gibbs derivatives on finite, not necessarily Abelian, groups in terms of the partial Gibbs derivatives. We consider the matrix representation of Gibbs derivatives defined in this way, which enables us to disclose FFT-like algorithms for the calculation of the values of Gibbs derivatives of functions on finite groups into fields admitting the existence of a Fourier transform on groups.

R. S. Stankovic

[1] R. Stankovic. A note on differential operators on finite non-abelian groups , 1986 .

[2] Mark G. Karpovsky,et al. Fast Fourier Transforms on Finite Non-Abelian Groups , 1977, IEEE Transactions on Computers.

[3] P. Butzer,et al. Walsh-fourier series and the concept of a derivative † , 1973 .

[4] J. E. Gibbs,et al. Harmonic differential calculus and filtering in Galois fields , 1976, ICASSP.

[5] H. Nussbaumer. Fast Fourier transform and convolution algorithms , 1981 .

[6] C. W. Onneweer. Fractional differentiation on the group of integers of ap-adic orp-series field , 1977 .

[7] He Zelin,et al. The derivatives and integrals of fractional order in Walsh-Fourier analysis, with applications to approximation theory , 1983 .

[8] Radomir S. Stankovic. A note on differential operators on finite Abelian groups , 1987 .

[9] Mark G. Karpovsky,et al. Fourier Transform over Finite Groups for Error Detection and Error Correction in Computation Channels , 1979, Inf. Control..