0
Your cart

Your cart is empty

Browse All Departments
  • All Departments
Price
  • R2,500 - R5,000 (2)
  • -
Status
Brand

Showing 1 - 2 of 2 matches in All Departments

The Regularized Fast Hartley Transform - Low-Complexity Parallel Computation of the FHT in One and Multiple Dimensions... The Regularized Fast Hartley Transform - Low-Complexity Parallel Computation of the FHT in One and Multiple Dimensions (Paperback, 2nd ed. 2022)
Keith John Jones
R3,481 Discovery Miles 34 810 Ships in 10 - 15 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.

The Regularized Fast Hartley Transform - Low-Complexity Parallel Computation of the FHT in One and Multiple Dimensions... The Regularized Fast Hartley Transform - Low-Complexity Parallel Computation of the FHT in One and Multiple Dimensions (Hardcover, 2nd ed. 2022)
Keith John Jones
R3,514 Discovery Miles 35 140 Ships in 10 - 15 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.

Free Delivery
Pinterest Twitter Facebook Google+
You may like...
Elecstor 18W In-Line UPS (Black)
R999 R869 Discovery Miles 8 690
Chris van Wyk: Irascible Genius - A…
Kevin van Wyk Paperback R360 R255 Discovery Miles 2 550
Womens 2-Piece Fitness Gym Gloves (Pink)
R129 Discovery Miles 1 290
Aqualine Back Float (Yellow and Blue)
R277 Discovery Miles 2 770
Sizzlers - The Hate Crime That Tore Sea…
Nicole Engelbrecht Paperback R320 R235 Discovery Miles 2 350
Jumbo Jan van Haasteren Comic Jigsaw…
 (1)
R439 R299 Discovery Miles 2 990
Mountain Backgammon - The Classic Game…
Lily Dyu R575 R460 Discovery Miles 4 600
Bestway Dolphin Armbands (23 x 15cm…
R33 R31 Discovery Miles 310
Infantino Squirt 'n Sail Penguins (Pack…
R159 Discovery Miles 1 590
Snappy Tritan Bottle (1.5L)(Coral)
R229 R180 Discovery Miles 1 800

 

Partners