Rapid digital architecture design of orthogonal matching pursuit
Rapid digital architecture design of orthogonal matching pursuit
复制标题
正交匹配追踪的快速数字架构设计
DOI：
10.1109/eusipco.2016.7760570
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
S. Paul
中科院分区：
文献类型：
--
作者：
Benjamin Knoop;Jochen Rust;Sebastian Schmale;D. Peters;S. Paul
正交匹配追求（OMP）是一种贪婪的算法，以其用于压缩感应的应用。探索与数据类型无关的方法相关。复杂的数学操作，例如，在对数编号系统的帮助下，我们的结果可以在我们的延迟和资源上与先前的作品进行竞争。可以报告OMP的第一个复合物值数字体系结构，该数字体系结构能够恢复17.1μs中5个非零元件的长度为128的向量。
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 μs.