Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2403.19119

Co-Designing Statistical MIMO Radar and In-band Full-Duplex Multi-User MIMO Communications -- Part II: Joint Precoder, Radar Code, and Receive Filters Design

Jiawei Liu·Kumar Vijay Mishra·Mohammad Saquib
View original source ↗Read source document ↗Export metadata ↓

Abstract

We address the challenge of spectral sharing between a statistical multiple-input multiple-output (MIMO) radar and an in-band full-duplex (IBFD) multi-user MIMO (MU-MIMO) communications system operating simultaneously in the same frequency band. Existing research on joint MIMO-radar-MIMO-communications (MRMC) systems has limitations, such as focusing on colocated MIMO radars, half-duplex MIMO communications, single-user scenarios, neglecting practical constraints, or employing separate transmit/receive units for MRMC coexistence. This paper, along with companion papers (Part I and III), proposes a comprehensive MRMC framework that addresses all these challenges. In the previous companion paper (Part I), we presented signal processing techniques for a distributed IBFD MRMC system. In this paper, we introduce joint design of statistical MIMO radar codes, uplink/downlink precoders, and corresponding receive filters using a novel metric called compounded-and-weighted sum mutual information. To solve the resulting highly non-convex problem, we employ a combination of block coordinate descent (BCD) and alternating projection methods. Numerical experiments show convergence of our algorithm, mitigation of uplink interference, and stable data rates under varying noise levels, channel estimate imperfections, and self-interference. The subsequent companion paper (Part III) extends the discussion to multiple targets and evaluates the tracking performance of our MRMC system.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiawei Liu, Kumar Vijay Mishra, Mohammad Saquib. 2024-03-28. Co-Designing Statistical MIMO Radar and In-band Full-Duplex Multi-User MIMO Communications -- Part II: Joint Precoder, Radar Code, and Receive Filters Design. https://arxiv.org/abs/2403.19119

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Information mechanics: conservation and assimilation

Inference and learning are cast as optimisation, yet invariant constraints governing uncertainty reduction remain unclear. This work presents information mechanics (infomechanics), a first-principles framework that describes informational structure in two canonical state coordinates. From Bayes' pointwise identity, minimal requirements of additivity, symmetry, and finite-resolution robustness select two robust additive projections, yielding conservation identities for entropy and Fisher information, governing global uncertainty and local geometry. Their residual defines the non-additive, coordinate-scale-invariant information potential $Φ$, separating the entropic baseline from residual geometric complexity. $Φ$ vanishes uniquely for isotropic Gaussians, decreases under Gaussian coarse-graining, and in finite-resolution multimodal landscapes asymptotically approaches the logarithm of the effective number of local optima. Extending the formalism to the Markov chain linking hidden states, observations, and internal representations yields assimilation inequalities constraining faithful external-state inference. Small bidirectional information potentials constrain representations towards near-linear relations with hidden causes. Together, these results identify invariant constraints underlying inference, learning, and computation across biological and artificial systems, irrespective of implementation.

cs.IT↗
arXiv2026

When Relaxation Does Not Help: RLDCs with Small Soundness Yield LDCs

Locally decodable codes (LDCs) are error-correcting codes that allow recovery of any single message symbol by probing only a small number of positions from the (possibly corrupted) codeword. Relaxed locally decodable codes (RLDCs) further allow the decoder to output a special failure symbol $\bot$ on a corrupted codeword. While known constructions of RLDCs achieve much better parameters than standard LDCs, it is intriguing to understand the relationship between LDCs and RLDCs. On the one hand, separation results (i.e., the existence of $q$-query RLDCs that are not $q$-query LDCs) are known for $q=3$ (Gur, Minzer, Weissenberg, and Zheng, STOC 2026) and $q \geq 15$ (Grigorescu, Kumar, Manohar, and Mon, STOC 2026). On the other hand, prior work (Block, Blocki, Cheng, Grigorescu, Li, Zheng, and Zhu, CCC 2023) shows that any $2$-query RLDC also gives a $2$-query LDC, and Grigorescu, Kumar, Manohar, and Mon (STOC 2026) show that any \emph{linear} $3$-query RLDC is also a linear $3$-query LDC. Furthermore, Grigorescu, Kumar, Manohar, and Mon (STOC 2026) show that when the soundness error of a \emph{linear} $q$-query RLDC with perfect completeness is below some threshold $s(q)$, the code must also be a linear $q$-query LDC with comparable parameters. In this work, we extend the main result of Grigorescu, Kumar, Manohar, and Mon (STOC 2026) by removing the linearity requirement in the nonadaptive setting. Specifically, we show that every nonadaptive $(q,δ,1,s)$-RLDC over a finite alphabet $Σ$ with $s<|Σ|^{-q}$ yields a $q$-query LDC with comparable decoding radius and error. Our results also extend to the setting of locally correctable codes (LCCs) and relaxed locally correctable codes (RLCCs). From this, we also obtain lower bounds for nonadaptive RLDCs from known LDC lower bounds.

cs.IT↗
arXiv2026

Formalizing building-up constructions of self-dual codes through isotropic lines in Lean

The purpose of this paper is two-fold. First, we show that, after a specified form isometry, the two-coordinate reduction in the binary Hilbert-symbol realization of Chinburg and Zhang is inverse to Kim's building-up construction, up to permutation equivalence. Second, for $q\equiv1\pmod4$, we develop a $q$-ary analogue of this reduction-and-extension mechanism. The identity $c^2=-1$ yields the isotropic line governing the split construction. For every fixed ordered pairing of the coordinates, we obtain a universal rank-$r$ boxed normal form, where $r$ is the dimension of the intersection with the product of these isotropic lines. Applications include optimal self-dual $[6,3,4]$ and $[8,4,4]$ codes over $\mathbb F_{5}$, optimal self-dual $[8,4,5]$ and $[10,5,6]$ codes over $\mathbb F_{13}$, and a self-dual $[12,6,6]$ code over $\mathbb F_{13}$. We also give an exact repeated boxed realization of self-dual $[18,9,8]$ and $[20,10,10]$ codes over $\mathbb F_{13}$, in which the split-boxed parent and its building-up child occur in one complete generator matrix. The algebraic core is formalized in Lean 4.

cs.IT↗