Rapid Digital Architecture Design of Computationally Complex Algorithms
Datei | Beschreibung | Größe | Format | |
---|---|---|---|---|
00107133-1.pdf | 2.69 MB | Adobe PDF | Anzeigen |
Sonstige Titel: | Schneller Entwurf digitaler Architekturen von komplexen Algorithmen | Autor/Autorin: | Knoop, Benjamin Andreas ![]() |
BetreuerIn: | Paul, Steffen | 1. GutachterIn: | Paul, Steffen | Weitere Gutachter:innen: | Burg, Andreas | Zusammenfassung: | Traditional digital design techniques hardly keep up with the rising abundance of programmable circuitry found on recent Field-Programmable Gate Arrays. Therefore, the novel Rapid Data Type-Agnostic Digital Design Methodology (RDAM) elevates the design perspective of digital design engineers away from the register-transfer level to the algorithmic level. It is founded on the capabilities of High-Level Synthesis tools. By consequently working with data type-agnostic source codes, the RDAM brings significant simplifications to the fixed-point conversion of algorithms and the design of complex-valued architectures. Signal processing applications from the field of Compressed Sensing illustrate the efficacy of the RDAM in the context of multi-user wireless communications. For instance, a complex-valued digital architecture of Orthogonal Matching Pursuit with rank-1 updating has successfully been implemented and tested. |
Schlagwort: | Digital Design; Field-Programmable Gate Array (FPGA); High-Level Synthesis (HLS); Fixed-Point Arithmetic; Signal Processing; Wireless Communications; Compressed Sensing (CS); Orthogonal Matching Pursuit (OMP) | Veröffentlichungsdatum: | 7-Feb-2019 | Dokumenttyp: | Dissertation | Zweitveröffentlichung: | no | URN: | urn:nbn:de:gbv:46-00107133-11 | Institution: | Universität Bremen | Fachbereich: | Fachbereich 01: Physik/Elektrotechnik (FB 01) |
Enthalten in den Sammlungen: | Dissertationen |
Seitenansichten
308
checked on 03.04.2025
Download(s)
288
checked on 03.04.2025
Google ScholarTM
Prüfe
Alle Ressourcen in diesem Repository sind urheberrechtlich geschützt.