|
Books > Computing & IT > General theory of computing
|
Buy Now
The Regularized Fast Hartley Transform - Low-Complexity Parallel Computation of the FHT in One and Multiple Dimensions (Hardcover, 2nd ed. 2022)
Loot Price: R3,146
Discovery Miles 31 460
|
|
|
The Regularized Fast Hartley Transform - Low-Complexity Parallel Computation of the FHT in One and Multiple Dimensions (Hardcover, 2nd ed. 2022)
Expected to ship within 18 - 22 working 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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
|
You might also like..
|
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
(1)
