Abstract
A new algorithm is proposed that enables the realisation of a discrete Hartley transform with the lowest number of multiplications yet reported. This algorithm also achieves the minimum number of additions compared with the reported algorithms achieving the same minimum number of multiplications.
Original language | English |
---|---|
Pages (from-to) | 347-349 |
Number of pages | 3 |
Journal | Electronics Letters |
Volume | 27 |
Issue number | 4 |
DOIs | |
Publication status | Published - 14 Feb 1991 |
Keywords
- Algorithms
- Transforms
ASJC Scopus subject areas
- Electrical and Electronic Engineering