New fast discrete hartley transform algorithm

Yuk Hee Chan; W. C. Siu

doi:10.1049/el:19910220

New fast discrete hartley transform algorithm

Yuk Hee Chan, W. C. Siu

The Hong Kong Polytechnic University

Research output: Journal article publication › Journal article › Academic research › peer-review

10 Citations (Scopus)

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	https://doi.org/10.1049/el:19910220
Publication status	Published - 14 Feb 1991

Keywords

Algorithms
Transforms

ASJC Scopus subject areas

Electrical and Electronic Engineering

More information

10.1049/el:19910220

Cite this

@article{410a0a5df0fd470fa2565b8cdde9f4b7,

title = "New fast discrete hartley transform algorithm",

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.",

keywords = "Algorithms, Transforms",

author = "Chan, {Yuk Hee} and Siu, {W. C.}",

year = "1991",

month = feb,

day = "14",

doi = "10.1049/el:19910220",

language = "English",

volume = "27",

pages = "347--349",

journal = "Electronics Letters",

issn = "0013-5194",

publisher = "John Wiley & Sons Inc.",

number = "4",

}

TY - JOUR

T1 - New fast discrete hartley transform algorithm

AU - Chan, Yuk Hee

AU - Siu, W. C.

PY - 1991/2/14

Y1 - 1991/2/14

N2 - 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.

AB - 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.

KW - Algorithms

KW - Transforms

UR - http://www.scopus.com/inward/record.url?scp=0026103399&partnerID=8YFLogxK

U2 - 10.1049/el:19910220

DO - 10.1049/el:19910220

M3 - Journal article

SN - 0013-5194

VL - 27

SP - 347

EP - 349

JO - Electronics Letters

JF - Electronics Letters

IS - 4

ER -

New fast discrete hartley transform algorithm

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this