Physically constrained unfolded multi-dimensional OMP for large MIMO systems

Nay Klaimi, Clément Elvira, Philippe Mary, Luc Le Magoarou
1/15/2026
eess.SPcs.LG

No confident code implementation found for this paper.

Abstract

Sparse recovery methods are essential for channel estimation and localization in modern communication systems, but their reliability relies on accurate physical models, which are rarely perfectly known. Their computational complexity also grows rapidly with the dictionary dimensions in large MIMO systems. In this paper, we propose MOMPnet, a novel unfolded sparse recovery framework that addresses both the reliability and complexity challenges of traditional methods. By integrating deep unfolding with data-driven dictionary learning, MOMPnet mitigates hardware impairments while preserving interpretability. Instead of a single large dictionary, multiple smaller, independent dictionaries are employed, enabling a low-complexity multidimensional Orthogonal Matching Pursuit algorithm. The proposed unfolded network is evaluated on realistic channel data against multiple baselines, demonstrating its strong performance and potential.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{klaimi2026physically,
  title  = {Physically constrained unfolded multi-dimensional OMP for large MIMO systems},
  author = {Nay Klaimi and Clément Elvira and Philippe Mary and Luc Le Magoarou},
  year   = {2026},
  eprint = {2601.10771},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.10771v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2601.10771.svg)](https://codeofpaper.com/paper/2601.10771)

Discussion