Fractional Fourier, Hartley, cosine and sine number-theoretic transforms based on matrix functions

DOI10.1007/s00034-016-0447-8zbMath1371.94472OpenAlexW2546883973MaRDI QIDQ2405466

Paulo Hugo E. S. Lima, Ricardo M. Campello de Souza, Juliano B. Lima

Publication date: 25 September 2017

Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00034-016-0447-8

zbMATH Keywords

matrix functionsimage encryptionfractional transformsnumber-theoretic transforms

Mathematics Subject Classification ID

Cryptography (94A60) Application of orthogonal and other special functions (94A11)

Related Items

A novel approach for defining a Hilbert number transform

Uses Software

• mftoolbox

Cites Work

• Unnamed Item
• Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem
• Finite field trigonometric transforms
• The eigenstructure of finite field trigonometric transforms
• Schur rings and non-symmetric association schemes on 64 vertices
• Fractional cosine and sine transforms over finite fields
• Discrete fractional Hartley and Fourier transforms
• The discrete fractional Fourier transform
• Explicit Hermite-type Eigenvectors of the Discrete Fourier Transform
• Fast Algorithms for Signal Processing
• The Fractional Order Fourier Transform and its Application to Quantum Mechanics
• Watermarking in the space/spatial-frequency domain using two-dimensional Radon-Wigner distribution
• Closed-Form Orthogonal Number Theoretic Transform Eigenvectors and the Fast Fractional NTT
• The discrete fractional cosine and sine transforms
• Fractional cosine, sine, and Hartley transforms
• Functions of Matrices
• The Fast Fourier Transform in a Finite Field
• Immersion of the Fourier Transform in a Continuous Group of Functional Transformations