Premium
A discrete Hartley transform based on Simpson's rule
Author(s) -
Singh P.,
Singh V.
Publication year - 2015
Publication title -
mathematical methods in the applied sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.719
H-Index - 65
eISSN - 1099-1476
pISSN - 0170-4214
DOI - 10.1002/mma.3384
Subject(s) - hartley transform , discrete hartley transform , mathematics , discrete fourier transform (general) , fractional fourier transform , s transform , discrete sine transform , convolution (computer science) , two sided laplace transform , fourier transform , discrete time fourier transform , integral transform , non uniform discrete fourier transform , mathematical analysis , fourier analysis , discrete wavelet transform , computer science , artificial intelligence , wavelet transform , artificial neural network , wavelet
The Hartley transform is an integral transformation that maps a real valued function into a real valued frequency function via the Hartley kernel, thereby avoiding complex arithmetic as opposed to the Fourier transform. Approximation of the Hartley integral by the trapezoidal quadrature results in the discrete Hartley transform, which has proven a contender to the discrete Fourier transform because of its involutory nature. In this paper, a discrete transform is proposed as a real transform with a convolution property and is an alternative to the discrete Hartley transform. Copyright © 2015 John Wiley & Sons, Ltd.