Delivery included to the United States

The Regularized Fast Hartley Transform

The Regularized Fast Hartley Transform Low-Complexity Parallel Computation of the FHT in One and Multiple Dimensions

Second Edition 2022nd edition

Hardback (03 Sep 2021)

Save $20.13

  • RRP $136.71
  • $116.58
Add to basket

Includes delivery to the United States

10+ copies available online - Usually dispatched within 7 days

Publisher's Synopsis

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.

Book information

ISBN: 9783030682446
Publisher: Springer International Publishing
Imprint: Springer
Pub date:
Edition: Second Edition 2022nd edition
Language: English
Number of pages: 320
Weight: 653g
Height: 235mm
Width: 155mm
Spine width: 21mm