Name
Abstract | ||
|---|---|---|
Orthogonal Matching Pursuit (OMP) is a greedy algorithm well-known for its applications to Compressed Sensing. For this work it serves as a toy problem of a rapid digital design flow based on high-level synthesis (HLS). HLS facilitates extensive design space exploration in connection with a data type-agnostic programming methodology. Nonetheless, some algorithmic transformations are needed to obtain optimised digital architectures. OMP contains a least squares orthogonalisation step, yet its iterative selection strategy makes rank-1 updating possible. We furthermore propose to compute complex mathematical operations, e.g. the needed reciprocal square root operation, with the help of the logarithmic number system to optimise HLS results. Our results can compete with prior works in terms of latency and resource utilisation. Additionally and to the best of our knowledge, we can report on the first complex-valued digital architecture of OMP, which is able to recover a vector of length 128 with 5 non-zero elements in 17.1 mu s. |
Year | Venue | Field |
|---|---|---|
2016 | European Signal Processing Conference | Matching pursuit,Algorithm design,Toy problem,Computer science,Design flow,Greedy algorithm,Theoretical computer science,Logarithmic number system,Design space exploration,Computer engineering,Digital architecture |
DocType | ISSN | Citations |
Conference | 2076-1465 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Benjamin Knoop | 1 | 17 | 5.48 |
| Jochen Rust | 2 | 32 | 12.51 |
| Sebastian Schmale | 3 | 10 | 4.07 |
| Dagmar Peters-Drolshagen | 4 | 39 | 12.87 |
| Steffen Paul | 5 | 142 | 40.96 |