The Regularized Fast Hartley Transform
- Išparduota
The Regularized Fast Hartley Transform provides the reader with the tools necessary to both understand the proposed new formulation and to implement simple design variations that offer clear implementational advantages, both practical and theoretical, over more conventional complex-data solutions to the problem. The highly-parallel formulation described is shown to lead to scalable and device-independent solutions to the latency-constrained version of the problem which are able to optimize the…
0
/https://libri-media.knygos-static.lt/4f5545a9-0abb-44bc-bdb9-62ec2f4f5d53/1)
- Autorius: Keith Jones
- Leidėjas: Springer-Verlag GmbH
- Metai: 2010
- ISBN-10: 9048139163
- ISBN-13: 9789048139163
- Formatas: 16.4 x 24.2 x 2.5 cm, kieti viršeliai
- Kalba: Anglų
Atsiliepimai
Aprašymas
The Regularized Fast Hartley Transform provides the reader with the tools necessary to both understand the proposed new formulation and to implement simple design variations that offer clear implementational advantages, both practical and theoretical, over more conventional complex-data solutions to the problem. The highly-parallel formulation described is shown to lead to scalable and device-independent solutions to the latency-constrained version of the problem which are able to optimize the use of the available silicon resources, and thus to maximize the achievable computational density, thereby making the solution a genuine advance in the design and implementation of high-performance parallel FFT algorithms.
Išparduota
- Autorius: Keith Jones
- Leidėjas: Springer-Verlag GmbH
- Metai: 2010
- ISBN-10: 9048139163
- ISBN-13: 9789048139163
- Formatas: 16.4 x 24.2 x 2.5 cm, kieti viršeliai
- Kalba: Anglų
The Regularized Fast Hartley Transform provides the reader with the tools necessary to both understand the proposed new formulation and to implement simple design variations that offer clear implementational advantages, both practical and theoretical, over more conventional complex-data solutions to the problem. The highly-parallel formulation described is shown to lead to scalable and device-independent solutions to the latency-constrained version of the problem which are able to optimize the use of the available silicon resources, and thus to maximize the achievable computational density, thereby making the solution a genuine advance in the design and implementation of high-performance parallel FFT algorithms.
Atsiliepimai