2013
DOI: 10.4304/jcp.8.10.2656-2663
|View full text |Cite
|
Sign up to set email alerts
|

Arbitrary-length Fast Hartley Transform without Multiplications

Abstract: Discrete Hartley transform (DHT) is an important tool in digital signal processing. In this paper, a multilierless algorithm to compute discrete Hartley transforms is proposed, which can deal with arbitrary length input signals. The proposed algorithm can be implemented by integer additions of fixed points in binary system. Besides, an efficient and regular systolic array is designed to implement the proposed method, followed by the complexity analysis. Being different to other fast Hartley transforms, our alg… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2014
2014

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 16 publications
0
1
0
Order By: Relevance
“…The experimental procedure are summarize in the above section. This part will sequentially report the dataset, verification criterion and experimental results [15].…”
Section: Resultsmentioning
confidence: 99%
“…The experimental procedure are summarize in the above section. This part will sequentially report the dataset, verification criterion and experimental results [15].…”
Section: Resultsmentioning
confidence: 99%