𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast computation of the discrete Hartley transform

✍ Scribed by Priyanka Jain; Balbir Kumar; S. B. Jain

Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
143 KB
Volume
38
Category
Article
ISSN
0098-9886

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Methods for Fast Computation of Integral
Methods for Fast Computation of Integral Transforms
✍ Shay Gueron πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 394 KB

This paper is concerned with two aspects of the numerical calculation of integral transforms. The first is finding a necessary and sufficient condition that enables converting an integral transform into a correlation (convolution) form. The condition and the transformation that implements it are gen

A discrete wavelet transform (DWT)-based
A discrete wavelet transform (DWT)-based far-field computation using the FDTD method
✍ Guillaume Carat; RaphaΓ«l Gillard; Jacques Citerne; Joe Wiart πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 116 KB πŸ‘ 1 views

A new wa¨elet-based technique to calculate radiating patterns by the FDTD method is presented. This technique has been applied to the study of a microstrip patch antenna. Results show a substantial gain both in memory storage and CPU time, while maintaining the same accuracy as the classical computa

Fast Computation of the Biquadratic Resi
Fast Computation of the Biquadratic Residue Symbol
✍ AndrΓ© Weilert πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 189 KB

This article describes an asymptotically fast algorithm for the computation of the biquadratic residue symbol. The algorithm achieves a running time of Oðnðlog nÞ 2 log log nÞ for Gaussian integers bounded by 2 n in the norm. Our algorithm is related to an asymptotically fast GCD computation in Z½i