The Regularized Fast Hartley Transform Low Complexity Parallel Computation of the FHT in One and Multiple Dimensions 2nd Edition by Keith John Jones 9783030682453 3030682455

The Regularized Fast Hartley Transform Low Complexity Parallel Computation of the FHT in One and Multiple Dimensions 2nd Edition Keith John Jones – Ebook PDF Instant Download/Delivery ISBN(s): 9783030682453, 3030682455

Product details:

• ISBN 10: 3030682455
• ISBN 13: 9783030682453
• Author: Keith John Jones

This book describes how a key signal/image processing algorithm – that of the fast Hartley transform (FHT) or, via a simple conversion routine between their outputs, of the real‑data version of the ubiquitous fast Fourier transform (FFT) – might best be formulated to facilitate computationally-efficient solutions. The author discusses this for both 1-D (such as required, for example, for the spectrum analysis of audio signals) and m‑D (such as required, for example, for the compression of noisy 2-D images or the watermarking of 3-D video signals) cases, but requiring few computing resources (i.e. low arithmetic/memory/power requirements, etc.). This is particularly relevant for those application areas, such as mobile communications, where the available silicon resources (as well as the battery-life) are expected to be limited. The aim of this monograph, where silicon‑based computing technology and a resource‑constrained environment is assumed and the data is real-valued in nature, hasthus been to seek solutions that best match the actual problem needing to be solved.

Table contents:

Part I. The Discrete Fourier and Hartley Transforms
1. Background to Research
2. The Real-Data Discrete Fourier Transform
3. The Discrete Hartley Transform
Part II. The Regularized Fast Hartley Transform
4. Derivation of Regularized Formulation of Fast Hartley Transform
5. Design Strategy for Silicon-Based Implementation of Regularized Fast Hartley Transform
6. Architecture for Silicon-Based Implementation of Regularized Fast Hartley Transform
7. Design of CORDIC-Based Processing Element for Regularized Fast Hartley Transform
Part III. Applications of Regularized Fast Hartley Transform
8. Derivation of Radix-2 Real-Data Fast Fourier Transform Algorithms Using Regularized Fast Hartley Transform
9. Computation of Common DSP-Based Functions Using Regularized Fast Hartley Transform
Part IV. The Multi-dimensional Discrete Hartley Transform
10. Parallel Reordering and Transfer of Data Between Partitioned Memories of Discrete Hartley Transform for 1-D and m-D Cases
11. Architectures for Silicon-Based Implementation of m-D Discrete Hartley Transform Using Regularized Fast Hartley Transform
Part V. Results of Research
12. Summary and Conclusions

People also search:

fast hartley transform

a transform fault

a transform fault boundary

hartley transform

hartley transform vs fourier transform