Prime-factor algorithms for generalised discrete Hartley transform

Guoan Bi; Chao Lu

doi:10.1049/el:19991208

Prime-factor algorithms for generalised discrete Hartley transform

Guoan Bi
, Chao Lu

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

3 Citations (Scopus)

Abstract

A prime factor fast algorithm for the type-II generalised discrete Hartley transform is presented. In addition to reducing the number of arithmetic operations and achieving a regular computational structure, a simple index mapping method is proposed to minimise the overall implementation complexity.

Original language	English
Pages (from-to)	1708-1710
Number of pages	3
Journal	Electronics Letters
Volume	35
Issue number	20
DOIs	https://doi.org/10.1049/el:19991208
Publication status	Published - 1 Jan 1999
Externally published	Yes

ASJC Scopus subject areas

Electrical and Electronic Engineering

More information

10.1049/el:19991208

Cite this

@article{bef07162a9e1405f896b96fc3d9fda38,

title = "Prime-factor algorithms for generalised discrete Hartley transform",

abstract = "A prime factor fast algorithm for the type-II generalised discrete Hartley transform is presented. In addition to reducing the number of arithmetic operations and achieving a regular computational structure, a simple index mapping method is proposed to minimise the overall implementation complexity.",

author = "Guoan Bi and Chao Lu",

year = "1999",

month = jan,

day = "1",

doi = "10.1049/el:19991208",

language = "English",

volume = "35",

pages = "1708--1710",

journal = "Electronics Letters",

issn = "0013-5194",

publisher = "John Wiley \& Sons Inc.",

number = "20",

}

TY - JOUR

T1 - Prime-factor algorithms for generalised discrete Hartley transform

AU - Bi, Guoan

AU - Lu, Chao

PY - 1999/1/1

Y1 - 1999/1/1

N2 - A prime factor fast algorithm for the type-II generalised discrete Hartley transform is presented. In addition to reducing the number of arithmetic operations and achieving a regular computational structure, a simple index mapping method is proposed to minimise the overall implementation complexity.

AB - A prime factor fast algorithm for the type-II generalised discrete Hartley transform is presented. In addition to reducing the number of arithmetic operations and achieving a regular computational structure, a simple index mapping method is proposed to minimise the overall implementation complexity.

UR - https://www.scopus.com/pages/publications/0033195459

U2 - 10.1049/el:19991208

DO - 10.1049/el:19991208

M3 - Journal article

SN - 0013-5194

VL - 35

SP - 1708

EP - 1710

JO - Electronics Letters

JF - Electronics Letters

IS - 20

ER -

Prime-factor algorithms for generalised discrete Hartley transform

Abstract

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this