img Leseprobe Leseprobe

The Regularized Fast Hartley Transform

Low-Complexity Parallel Computation of the FHT in One and Multiple Dimensions

Keith John Jones

PDF
ca. 117,69 €
Amazon 80,04 € iTunes Thalia.de Weltbild.de Hugendubel Bücher.de ebook.de kobo Osiander Google Books Barnes&Noble bol.com Legimi yourbook.shop Kulturkaufhaus ebooks-center.de
* Affiliatelinks/Werbelinks
Hinweis: Affiliatelinks/Werbelinks
Links auf reinlesen.de sind sogenannte Affiliate-Links. Wenn du auf so einen Affiliate-Link klickst und über diesen Link einkaufst, bekommt reinlesen.de von dem betreffenden Online-Shop oder Anbieter eine Provision. Für dich verändert sich der Preis nicht.

Springer International Publishing img Link Publisher

Naturwissenschaften, Medizin, Informatik, Technik / Elektronik, Elektrotechnik, Nachrichtentechnik

Beschreibung

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.

Weitere Titel in dieser Kategorie

Kundenbewertungen

Schlagwörter

Regularized Fast Hartley Transform, Algorithm Design for Hardware-Based Computing Technologies, discrete Fourier transform, Fourier transform, Algorithms for Fast Fourier and Hartley Transforms, fast Fourier transform (FFT), Real-Data Discrete Fourier Transform, Parallel Computation