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...
Κύριος συγγραφέας: | |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Dordrecht :
Springer Netherlands : Imprint: Springer,
2010.
|
Σειρά: | Signals and Communication Technology,
|
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- 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.