{"product_id":"the-regularized-fast-hartley-transform-lowcomplexity-parallel-computation-of-the-fht-in-one-and-multiple-dimensions-9783030682477","title":"The Regularized Fast Hartley Transform: Low-Complexity Parallel Computation of the FHT in One and Multiple Dimensions","description":"\u003cp\u003e\u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e\u003cblockquote\u003eThis book discusses how to formulate a key signal\/image processing algorithm, the fast Hartley transform (FHT), to facilitate computationally-efficient solutions for 1-D and m-D cases, with low arithmetic\/memory\/power requirements, particularly relevant for mobile communications. \u003c\/blockquote\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003eFormat\u003c\/strong\u003e: Paperback \/ softback\u003cbr\u003e\u003cstrong\u003eLength\u003c\/strong\u003e: 320 pages\u003cbr\u003e\u003cstrong\u003ePublication date\u003c\/strong\u003e: 04 September 2022\u003cbr\u003e\u003cstrong\u003ePublisher\u003c\/strong\u003e: Springer Nature Switzerland AG\u003cbr\u003e\u003c\/p\u003e\u003cp\u003e\u003cbr\u003eThis book delves into the formulation of a crucial signal processing algorithm, known as the fast Hartley transform (FHT), or its real-data counterpart, the fast Fourier transform (FFT). Its primary objective is to provide computationally efficient solutions for diverse applications, spanning both 1-D and m-D scenarios. By leveraging the fast Hartley transform, the author aims to achieve low arithmetic\/memory\/power requirements, making it particularly relevant in resource-constrained environments such as mobile communications.\u003cbr\u003e\u003cbr\u003eThe author discusses the application of the fast Hartley transform in various fields, including spectrum analysis of audio signals and compression of noisy 2-D images or watermarking of 3-D video signals. The focus is on finding solutions that align optimally with the specific problem at hand, taking into account the assumptions of silicon-based computing technology and a resource-constrained environment where real-valued data is involved.\u003cbr\u003e\u003cbr\u003eThe monograph aims to bridge the gap between theory and practice, offering practical insights and methodologies for implementing the fast Hartley transform and its real-data counterpart effectively. It serves as a valuable resource for researchers, engineers, and practitioners seeking to optimize signal processing algorithms in resource-constrained environments.\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003eWeight\u003c\/strong\u003e: 522g\u003cbr\u003e\u003cstrong\u003eDimension\u003c\/strong\u003e: 235 x 155 (mm)\u003cbr\u003e\u003cstrong\u003eISBN-13\u003c\/strong\u003e: 9783030682477\u003cbr\u003e \u003cstrong\u003eEdition number\u003c\/strong\u003e: 2nd ed. 2022\u003c\/p\u003e","brand":"Keith John Jones","offers":[{"title":"Paperback \/ softback","offer_id":44282950582522,"sku":"9783030682477","price":83.29,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0522\/4297\/2845\/products\/noImage_1_6e966b35-88bf-4a89-b8c2-c9d3a0efa931.jpg?v=1686916747","url":"https:\/\/shulphink.com\/products\/the-regularized-fast-hartley-transform-lowcomplexity-parallel-computation-of-the-fht-in-one-and-multiple-dimensions-9783030682477","provider":"Shulph Ink","version":"1.0","type":"link"}