paper-with-me

Papers

Coherent Source Enumeration with Compact ULAs

2025-04-27 · Dibakar Sil, Sunder Ram Krishnan, Kumar Vijay Mishra

Source enumeration typically relies on subspace-based techniques that require accurate separation of signal and noise subspaces. However, prior works do not address coherent sources in small uniform linear arrays, where ambiguities arise in the spatial spectrum. We address this by decomposing the forward-backward smoothed covariance matrix into a sum of a rank-constrained Toeplitz matrix and a diagonal matrix with non-negative entries representing the signal and noise subspace, respectively. We solve the resulting non-convex optimization problem by proposing Toeplitz approach for rank-based target estimation (TARgEt) that employs the alternating direction method of multipliers. Numerical results on both synthetic and real-world datasets demonstrate the effectiveness and robustness of TARgEt over a recent subspace matching method and a related covariance matrix reconstruction approach.

📄 PDF Abstract BibTeX arXiv:2504.19126

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Chromatic Feature Vectors for 2-Trees: Exact Formulas for Partition Enumeration with Network Applications

2025-12-08 · J. Allagan, G. Morgan, S. Langley, R. Lopez-Bonilla 외 arxiv

We establish closed-form enumeration formulas for chromatic feature vectors of 2-trees under the bichromatic triangle constraint. These efficiently computable structural features derive from constrained graph colorings w…

Entailment vs. Verification for Partial-assignment Satisfiability and Enumeration

2025-03-03 · Roberto Sebastiani

Many procedures for SAT-related problems, in particular for those requiring the complete enumeration of satisfying truth assignments, rely their efficiency and effectiveness on the detection of (possibly small) partial a…

Are You Satisfied by This Partial Assignment?

2020-02-28 · Roberto Sebastiani

Many procedures for SAT and SAT-related problems -- in particular for those requiring the complete enumeration of satisfying truth assignments -- rely their efficiency on the detection of partial assignments satisfying a…

A canonical generalization of OBDD

2026-04-07 · Florent Capelli, YooJung Choi, Stefan Mengel, Martín Muñoz 외 arxiv

We introduce Tree Decision Diagrams (TDD) as a model for Boolean functions that generalizes OBDD. They can be seen as a restriction of structured d-DNNF; that is, d-DNNF that respect a vtree $T$. We show that TDDs enjoy …

A New Probabilistic Algorithm for Approximate Model Counting

2017-06-13 · Cunjing Ge, Feifei Ma, Tian Liu, Jian Zhang

Constrained counting is important in domains ranging from artificial intelligence to software analysis. There are already a few approaches for counting models over various types of constraints. Recently, hashing-based ap…

model