The Regularized Fast Hartley Transform : Optimal Formulation of Real-Data Fast Fourier Transform for Silicon-Based Implementation in Resource-Constrained Environments
When designing high-performance DSP systems for implementation with silicon-based computing technology, the oft-encountered problem of the real-data DFT is typically addressed by exploiting an existing complex-data FFT, which can easily result in an overly complex and resource-hungry solution. The r...
Gorde:
| Egile nagusia: | |
|---|---|
| Formatua: | Livre numérique |
| Hizkuntza: | Anglais |
| Argitaratua: |
Dordrecht :
Springer Netherlands
[20..].
Cham : Springer Nature |
| Edizioa: | 1st ed. 2010. |
| Saila: | Signals and Communication Technology
|
| Sarrera elektronikoa: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Oharra: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • The Regularized Fast Hartley Transform, Texte imprimé, 9789048139163 • The Regularized Fast Hartley Transform, Texte imprimé, 9789048139620 • The Regularized Fast Hartley Transform, Texte imprimé, 9789048139163 • The Regularized Fast Hartley Transform, Texte imprimé, 9789400731783 |
| LEADER | 04120nam a22003617a 4500 | ||
|---|---|---|---|
| 001 | 943256 | ||
| 008 | 110106q2000 xx ||| |||| 00| 0 eng d | ||
| 009 | PPN149075588 | ||
| 020 | |a 9789048139170 | ||
| 041 | 0 | |a eng | |
| 082 | |a 518 | ||
| 100 | 1 | |a Jones, Keith. | |
| 245 | 1 | 0 | |a The Regularized Fast Hartley Transform : |b Optimal Formulation of Real-Data Fast Fourier Transform for Silicon-Based Implementation in Resource-Constrained Environments |c by Keith Jones. |
| 250 | |a 1st ed. 2010. | ||
| 260 | |a Dordrecht : |b Springer Netherlands. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Signals and Communication Technology |x 1860-4870 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 1 | |a Background to Research Fast Solutions to Real-Data Discrete Fourier Transform The Discrete Hartley Transform Derivation of the Regularized Fast Hartley Transform Algorithm Design for Hardware-Based Computing Technologies Derivation of Area-Efficient and Scalable Parallel Architecture Design of Arithmetic Unit for Resource-Constrained Solution Computation of 2n-Point Real-Data Discrete Fourier Transform Applications of Regularized Fast Hartley Transform Summary and Conclusions | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 520 | |a When designing high-performance DSP systems for implementation with silicon-based computing technology, the oft-encountered problem of the real-data DFT is typically addressed by exploiting an existing complex-data FFT, which can easily result in an overly complex and resource-hungry solution. The research described in The Regularized Fast Hartley Transform: Optimal Formulation of Real-Data Fast Fourier Transform for Silicon-Based Implementation in Resource-Constrained Environments deals with the problem by exploiting directly the real-valued nature of the data and is targeted at those real-world applications, such as mobile communications, where size and power constraints play key roles in the design and implementation of an optimal solution. 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 | ||
| 776 | 0 | |t The Regularized Fast Hartley Transform |b Texte imprimé |z 9789048139163 | |
| 776 | 0 | |t The Regularized Fast Hartley Transform |b Texte imprimé |z 9789048139620 | |
| 776 | 0 | |t The Regularized Fast Hartley Transform |b Texte imprimé |z 9789048139163 | |
| 776 | 0 | |t The Regularized Fast Hartley Transform |b Texte imprimé |z 9789400731783 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/978-90-481-3917-0 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-3XTXPCQ1-3 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747827273 |u https://ezproxy.univ-orleans.fr/login?url=https://dx.doi.org/10.1007/978-90-481-3917-0 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750844493 |u https://ezproxy.insa-cvl.fr/login?qurl=https://dx.doi.org/10.1007/978-90-481-3917-0 |z Accès INSA CVL | |
| 997 | |0 943256 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||