The Regularized Fast Hartley Transform

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

By: Keith John Jones

Write A Review

Paperback | 4 September 2022 | Edition Number 2

At a Glance

Paperback
342 Pages

Edition Type
Revised

Dimensions(cm)
23.39 x 15.6 x 1.8

Paperback

$207.34

Aims to ship in 7 to 10 business days

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, has thus been to seek solutions that best match the actual problem needing to be solved.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.