Fast computation of the discrete Hartley transform-Reference-Cited by-同舟云学术

Fast computation of the discrete Hartley transform

Published:2009 Issue: Volume: Page:n/a-n/a
ISSN:0098-9886
Container-title:International Journal of Circuit Theory and Applications
language:en
Short-container-title:Int. J. Circ. Theor. Appl.

Author:

Jain Priyanka,Kumar Balbir,Jain S. B.

Publisher

Wiley

Subject

Applied Mathematics,Electrical and Electronic Engineering,Computer Science Applications,Electronic, Optical and Magnetic Materials

Link

http://onlinelibrary.wiley.com/wol1/doi/10.1002/cta.574/fullpdf

Reference38 articles.

1. The fast Hartley transform;Bracewell;Proceedings of the IEEE,1984

2. High-throughput memory-based architecture for DHT using a new convolutional formulation;Meher;IEEE Transactions on Circuits and Systems-II: Express Briefs,2007

3. Cheng L-Z, Tong L, Jiang ZR. Real transform algorithm for computing discrete circular deconvolution. Proceedings of the 3rd IEEE International Conference on Signal Processing, vol. 1, Beijing, China, October 1996; 166-169.

4. Improved Fourier and Hartley transform algorithms: application to cyclic convolution of real data;Duhamel;IEEE Transactions,1987

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A fast realization of new Mersenne number transformation and its applications;International Journal of Circuit Theory and Applications;2019-02-18

2. Multiplier-less VLSI architectures for radix-22folded pipelined complex FFT core;International Journal of Circuit Theory and Applications;2014-10-23

3. Algorithm of efficient computation of generalised discrete Hartley transform based on cyclic convolutions;IET Signal Processing;2014-06