Go to main content

The regularized fast Hartley transform : low-complexity parallel computation of the FHT in one and multiple dimensions / Keith John Jones.

Jones, Keith, 1951- author.
2022
QA403.5 .J66 2022
Available Online
Formats
Format
BibTeX
MARCXML
TextMARC
MARC
DublinCore
EndNote
NLM
RefWorks
RIS
Add to Basket
Cite

Linked e-resources

Linked Resource
Online Access
Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks

Details

Title
The regularized fast Hartley transform : low-complexity parallel computation of the FHT in one and multiple dimensions / Keith John Jones.
Author
Jones, Keith, 1951- author.
Edition
Second edition.
ISBN
9783030682453 (electronic bk.)
3030682455 (electronic bk.)
9783030682446
3030682447
DOI
https://doi.org/10.1007/978-3-030-68245-3
Published
Cham : Springer, [2022]
Copyright
©2022
Language
English
Description
1 online resource : illustrations
Item Number
10.1007/978-3-030-68245-3 doi
Call Number
QA403.5 .J66 2022
Dewey Decimal Classification
515/.723
Summary
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 (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.
Bibliography, etc. Note
Includes bibliographical references and index.
Access Note
Access limited to authorized users.
Source of Description
Online resource; title from PDF title page (SpringerLink, viewed September 14, 2021).
Available in Other Form
Regularized fast Hartley transform.
Linked Resources
Online Access
Record Appears in
Online Resources > Ebooks
All Resources
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.

Browse Subjects

Show more subjects...

Statistics

from
to
Export