A circular formulation of the prime length DHT kernel and its FPGA implementation

Srikanthan, Thambipillai; Kumar, Nishant; Jhavar, A.

doi:10.1109/icics.2003.1292452

Search citation statements

Order By: Relevance

Paper Sections

Select...

Examples Of Algorithms Of Dht I-iv On the Basis Of Cyclic Co1

Citation Types

Supporting

Mentioning

Contrasting

Publication Types

Select...

Article1

Other1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The example of DHT of size N = 14, corresponds to hashing arrays P(13) = (1,11,9) (5,13,3) (2,8,4) (6,10,12) (7), P′(13) = (1,4,2) (3,5,6) (1,4,2) (3,5,6) (7), Sk (13) = (+, −, −)(+, +, +)(−,+,+) (−, −, −)(−), leading to the computation of four three-point cyclic convolutions, but without the use of additional products, respectively [17]. Partial cases of the proposed approach are cyclic formulations proposed in [8,28] only for prime size GDHT transformations.…”

Section: Examples Of Algorithms Of Dht I-iv On the Basis Of Cyclic Comentioning

confidence: 99%

Algorithm of efficient computation of generalised discrete Hartley transform based on cyclic convolutions

Prots'ko

2014

IET signal process.

View full text Add to dashboard Cite

A general method for efficient computation of four types of discrete Hartley transform using cyclic convolutions is considered. Forming hashing arrays on the basis of simplified arguments of basis transform for synthesis of efficient algorithm is analysed. The hashing arrays in the algorithm define partitioning of the harmonic basis into Hankel submatrices. The examples of four types of discrete Hartley transforms using the proposed method are presented.

show abstract

Section: Examples Of Algorithms Of Dht I-iv On the Basis Of Cyclic Comentioning

confidence: 99%

Algorithm of efficient computation of generalised discrete Hartley transform based on cyclic convolutions

Prots'ko

2014

IET signal process.

View full text Add to dashboard Cite

show abstract

ASIC implementation of high speed processor for computing fast hartley transformation

Saha

Bhattacharyya

Kumar

et al. 2013

2013 International Conference on Advanced Electronic Systems (ICAES)

View full text Add to dashboard Cite

A circular formulation of the prime length DHT kernel and its FPGA implementation

Cited by 2 publications

References 4 publications

Algorithm of efficient computation of generalised discrete Hartley transform based on cyclic convolutions

Algorithm of efficient computation of generalised discrete Hartley transform based on cyclic convolutions

ASIC implementation of high speed processor for computing fast hartley transformation

Contact Info

Product

Resources

About