{"product_id":"regularized-fast-hartley-transform-9783030682453","title":"Regularized Fast Hartley Transform","description":"\u003cp\u003eThis 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.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":52911058944279,"sku":null,"price":13430.27,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9783030682453.jpg?v=1781259207","url":"https:\/\/payment.letskitaboo.com\/products\/regularized-fast-hartley-transform-9783030682453","provider":"Kitaboo One eStore","version":"1.0","type":"link"}