Open AccessAlgorithm of efficient computation of generalised discrete Hartley transform based on cyclic convolutions
Author(s) -
Prots'ko Ihor
Publication year - 2014
Publication title -
iet signal processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.384
H-Index - 42
ISSN - 1751-9683
DOI - 10.1049/iet-spr.2013.0204
Subject(s) - discrete hartley transform , hartley transform , computation , basis (linear algebra) , hash function , algorithm , hankel transform , mathematics , discrete fourier transform (general) , block (permutation group theory) , computer science , fourier transform , fractional fourier transform , combinatorics , mathematical analysis , fourier analysis , geometry , computer security
A general method for efficient computation of four types of discrete Hartley transform using cyclic convolutions is considered. Forming hashing arrays on the basis of simplified arguments of basis transform for synthesis of efficient algorithm is analysed. The hashing arrays in the algorithm define partitioning of the harmonic basis into Hankel submatrices. The examples of four types of discrete Hartley transforms using the proposed method are presented.