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...
Casio LW-200-7AV Watch with 10-Year…
R999 R884 Discovery Miles 8 840
Venom 2: Let There Be Carnage
Tom Hardy, Woody Harrelson, … DVD R156 Discovery Miles 1 560
Snappy Tritan Bottle (1.5L)(Coral)
R229 R180 Discovery Miles 1 800
Kenwood Steam Iron (2200W)
R519 R437 Discovery Miles 4 370
Shield Anti Freeze/Summer Cooolant 96…
R86 Discovery Miles 860
Dala Craft Pom Poms - Assorted Colours…
R36 Discovery Miles 360
Loot
Nadine Gordimer Paperback  (2)
R398 R330 Discovery Miles 3 300
Docking Edition Multi-Functional…
R1,099 R799 Discovery Miles 7 990
HP 330 Wireless Keyboard and Mouse Combo
R800 R450 Discovery Miles 4 500
A Desire To Return To The Ruins - A Look…
Lucas Ledwaba Paperback R287 Discovery Miles 2 870

 

Partners