The Regularized Fast Hartley Transform
Low-Complexity Parallel Computation of the FHT in One and Multiple Dimensions
Buch in deiner Nähe kaufen
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 innature, has thus been to seek solutions that best match the actual problem needing to be solved.
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.
Describes solutions to 1-D and m-D versions of the FHT and the real-data FFT targeted at applications Achieves the computational density of the most advanced commercially-available solutions for greatly reduced silicon resources Presents simple design variations that enable one to optimize the use of the available silicon resources
Autor*in
Keith John Jones
Themen in »The Regularized Fast Hartley Transform«
Fourier transform discrete Fourier transform fast Fourier transform (FFT) Algorithms for Fast Fourier and Hartley Transforms Real-Data Discrete Fourier Transform Regularized Fast Hartley Transform Algorithm Design for Hardware-Based Computing Technologies Parallel Computation