The Regularized Fast Hartley Transform (PDF)
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
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 innature, has thus been to seek solutions that best match the actual problem needing to be solved.
- Autor: Keith John Jones
- 2021, 2nd ed. 2022, 320 Seiten, Englisch
- Verlag: Springer International Publishing
- ISBN-10: 3030682455
- ISBN-13: 9783030682453
- Erscheinungsdatum: 03.09.2021
Abhängig von Bildschirmgröße und eingestellter Schriftgröße kann die Seitenzahl auf Ihrem Lesegerät variieren.
- Dateiformat: PDF
- Größe: 7.76 MB
- Ohne Kopierschutz
- Vorlesefunktion
Schreiben Sie einen Kommentar zu "The Regularized Fast Hartley Transform".
Kommentar verfassen