國立虎尾科技大學 |

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

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	The Regularized Fast Hartley Transform/ by Keith John Jones.
其他題名:	Low-Complexity Parallel Computation of the FHT in One and Multiple Dimensions /
作者:	Jones, Keith John.
面頁冊數:	XIX, 320 p. 57 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Communications Engineering, Networks. -
電子資源:	https://doi.org/10.1007/978-3-030-68245-3
ISBN:	9783030682453

The Regularized Fast Hartley Transform = Low-Complexity Parallel Computation of the FHT in One and Multiple Dimensions /
Jones, Keith John.

The Regularized Fast Hartley TransformLow-Complexity Parallel Computation of the FHT in One and Multiple Dimensions /[electronic resource] :by Keith John Jones. - 2nd ed. 2022. - XIX, 320 p. 57 illus.online resource.

Part 1: The Discrete Fourier and Hartley Transforms -- Background to Research -- The Real-Data Discrete Fourier Transform -- The Discrete Hartley Transform -- Part 2: The Regularized Fast Hartley Transform -- Derivation of Regularized Formulation of Fast Hartley Transform -- Design Strategy for Silicon-Based Implementation of Regularized Fast Hartley Transform -- Architecture for Silicon-Based Implementation of Regularized Fast Hartley Transform -- Design of CORDIC-Based Processing Element for Regularized Fast Hartley Transform -- Part 3: Applications of Regularized Fast Hartley Transform -- Derivation of Radix-2 Real-Data Fast Fourier Transform Algorithms using Regularized Fast Hartley Transform -- Computation of Common DSP-Based Functions using Regularized Fast Hartley Transform -- Part 4: The Multi-Dimensional Discrete Hartley Transform -- Parallel Reordering and Transfer of Data between Partitioned Memories of Discrete Hartley Transform for 1-D and m-D Cases -- Architectures for Silicon-Based Implementation of m-D Discrete Hartley Transform using Regularized Fast Hartley Transform -- Part 5: Results of Research -- Summary and Conclusions.

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.

ISBN: 9783030682453

Standard No.: 10.1007/978-3-030-68245-3doiSubjects--Topical Terms:

669809
Communications Engineering, Networks.

LC Class. No.: TK5102.9

Dewey Class. No.: 621.382

The Regularized Fast Hartley Transform = Low-Complexity Parallel Computation of the FHT in One and Multiple Dimensions /
LDR:03690nam a22004215i 4500 001 1085427
003 DE-He213
005 20220116193853.0
007 cr nn 008mamaa
008 221228s2022 sz | s |||| 0|eng d
020 $a 9783030682453 $9 978-3-030-68245-3
024 7 $a 10.1007/978-3-030-68245-3 $2 doi
035 $a 978-3-030-68245-3
050 4 $a TK5102.9
072 7 $a TJF $2 bicssc
072 7 $a UYS $2 bicssc
072 7 $a TEC008000 $2 bisacsh
072 7 $a TJF $2 thema
072 7 $a UYS $2 thema
082 0 4 $a 621.382 $2 23
100 1 $a Jones, Keith John. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1391897
245 1 4 $a The Regularized Fast Hartley Transform $h [electronic resource] : $b Low-Complexity Parallel Computation of the FHT in One and Multiple Dimensions / $c by Keith John Jones.
250 $a 2nd ed. 2022.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a XIX, 320 p. 57 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
505 0 $a Part 1: The Discrete Fourier and Hartley Transforms -- Background to Research -- The Real-Data Discrete Fourier Transform -- The Discrete Hartley Transform -- Part 2: The Regularized Fast Hartley Transform -- Derivation of Regularized Formulation of Fast Hartley Transform -- Design Strategy for Silicon-Based Implementation of Regularized Fast Hartley Transform -- Architecture for Silicon-Based Implementation of Regularized Fast Hartley Transform -- Design of CORDIC-Based Processing Element for Regularized Fast Hartley Transform -- Part 3: Applications of Regularized Fast Hartley Transform -- Derivation of Radix-2 Real-Data Fast Fourier Transform Algorithms using Regularized Fast Hartley Transform -- Computation of Common DSP-Based Functions using Regularized Fast Hartley Transform -- Part 4: The Multi-Dimensional Discrete Hartley Transform -- Parallel Reordering and Transfer of Data between Partitioned Memories of Discrete Hartley Transform for 1-D and m-D Cases -- Architectures for Silicon-Based Implementation of m-D Discrete Hartley Transform using Regularized Fast Hartley Transform -- Part 5: Results of Research -- Summary and Conclusions.
520 $a 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.
650 2 4 $a Communications Engineering, Networks. $3 669809
650 2 4 $a Theory and Algorithms for Application Domains. $3 1388553
650 1 4 $a Signal, Speech and Image Processing . $3 1366353
650 0 $a Telecommunication. $3 568341
650 0 $a Computer science. $3 573171
650 0 $a Signal processing. $3 561459
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030682446
776 0 8 $i Printed edition: $z 9783030682460
776 0 8 $i Printed edition: $z 9783030682477
856 4 0 $u https://doi.org/10.1007/978-3-030-68245-3
912 $a ZDB-2-ENG
912 $a ZDB-2-SXE
950 $a Engineering (SpringerNature-11647)
950 $a Engineering (R0) (SpringerNature-43712)