.png){kind=logo}
Stock image for illustration purposes only - book cover, edition or condition may vary.
The Regularized Fast Hartley Transform. Optimal Formulation of Real-data Fast Fourier Transform for Silicon-based Implementation in Resource-constrained Environments.
Keith Jones
€ 215.10
FREE Delivery in Ireland
Description for The Regularized Fast Hartley Transform. Optimal Formulation of Real-data Fast Fourier Transform for Silicon-based Implementation in Resource-constrained Environments.
Paperback. Direct solution to real-data DFT methods are presented in this volume, which are targeted at real-world applications, like mobile communications. The methods discussed offer simple design variations that optimize resources for the best results. Series: Signals and Communication Technology. Num Pages: 200 pages, biography. BIC Classification: PBW; TJK; UKN. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 13. Weight in Grams: 348.
Most real-world spectrum analysis problems involve the computation of the real-data discrete Fourier transform (DFT), a unitary transform that maps elements N of the linear space of real-valued N-tuples, R , to elements of its complex-valued N counterpart, C , and when carried out in hardware it is conventionally achieved via a real-from-complex strategy using a complex-data version of the fast Fourier transform (FFT), the generic name given to the class of fast algorithms used for the ef?cient computation of the DFT. Such algorithms are typically derived by explo- ing the property of symmetry, whether it exists just in the ... Read more
Most real-world spectrum analysis problems involve the computation of the real-data discrete Fourier transform (DFT), a unitary transform that maps elements N of the linear space of real-valued N-tuples, R , to elements of its complex-valued N counterpart, C , and when carried out in hardware it is conventionally achieved via a real-from-complex strategy using a complex-data version of the fast Fourier transform (FFT), the generic name given to the class of fast algorithms used for the ef?cient computation of the DFT. Such algorithms are typically derived by explo- ing the property of symmetry, whether it exists just in the ... Read more
Product Details
Format
Paperback
Publication date
2012
Publisher
Springer Netherlands
Number of pages
200
Condition
New
Series
Signals and Communication Technology
Number of Pages
200
Place of Publication
Dordrecht, Netherlands
ISBN
9789400731783
SKU
V9789400731783
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for The Regularized Fast Hartley Transform. Optimal Formulation of Real-data Fast Fourier Transform for Silicon-based Implementation in Resource-constrained Environments.
From the reviews: “The aim of the author is to present a design for a generic double-sized butterfly for use by the fast Hartley transform (FHT) of radix-4 length, which lends itself to parallelization and to mapping onto a regular computational structure for implementation with parallel computing technology. … The textbook is mainly written for students and researchers in ... Read more