Comment on 'on prime factor mapping for the discrete Hartley transform'

Research output: Contribution to journalArticle

Abstract

In a recent paper, Lun and Siu describe a method of computing prime factor decomposed discrete Hartley transform (DHT) over N points with 2N less additions compared to the existing algorithms of Bracewell and Sorensen. In this correspondence, we show how the method of Lun and Siu can be extended to eliminate the 2N extra additions in the algorithms of Bracewell and Sorenson.

Original languageEnglish (US)
Pages (from-to)1551-1552
Number of pages2
JournalIEEE Transactions on Signal Processing
Volume42
Issue number6
DOIs
StatePublished - Jun 1994

Fingerprint

Mathematical transformations

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Comment on 'on prime factor mapping for the discrete Hartley transform'. / Chakrabarti, Chaitali.

In: IEEE Transactions on Signal Processing, Vol. 42, No. 6, 06.1994, p. 1551-1552.

Research output: Contribution to journalArticle

@article{62a820a32da046a9a3b4fe30d2dcfb5e,
title = "Comment on 'on prime factor mapping for the discrete Hartley transform'",
abstract = "In a recent paper, Lun and Siu describe a method of computing prime factor decomposed discrete Hartley transform (DHT) over N points with 2N less additions compared to the existing algorithms of Bracewell and Sorensen. In this correspondence, we show how the method of Lun and Siu can be extended to eliminate the 2N extra additions in the algorithms of Bracewell and Sorenson.",
author = "Chaitali Chakrabarti",
year = "1994",
month = "6",
doi = "10.1109/78.286973",
language = "English (US)",
volume = "42",
pages = "1551--1552",
journal = "IEEE Transactions on Signal Processing",
issn = "1053-587X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - Comment on 'on prime factor mapping for the discrete Hartley transform'

AU - Chakrabarti, Chaitali

PY - 1994/6

Y1 - 1994/6

N2 - In a recent paper, Lun and Siu describe a method of computing prime factor decomposed discrete Hartley transform (DHT) over N points with 2N less additions compared to the existing algorithms of Bracewell and Sorensen. In this correspondence, we show how the method of Lun and Siu can be extended to eliminate the 2N extra additions in the algorithms of Bracewell and Sorenson.

AB - In a recent paper, Lun and Siu describe a method of computing prime factor decomposed discrete Hartley transform (DHT) over N points with 2N less additions compared to the existing algorithms of Bracewell and Sorensen. In this correspondence, we show how the method of Lun and Siu can be extended to eliminate the 2N extra additions in the algorithms of Bracewell and Sorenson.

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

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

U2 - 10.1109/78.286973

DO - 10.1109/78.286973

M3 - Article

AN - SCOPUS:0028445420

VL - 42

SP - 1551

EP - 1552

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

SN - 1053-587X

IS - 6

ER -