Pith. sign in

REVIEW 2 major objections 6 minor 46 references

Efficient RF Chain Selection for MIMO Integrated Sensing and Communications: A Greedy Approach

T0 review · 2 major / 6 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Greedy MI-based chain selection reaches near-optimal MIMO ISAC performance while cutting complexity.

desk verdict Solid, correct greedy MI-decomposition framework for RF chain selection in MIMO ISAC; the near-optimality claims are only validated against the same MI objective, so the practical sensing claim needs a caveat or one more experiment. read the letter →

arxiv 2507.09960 v1 pith:SIYAT6Z4 submitted 2025-07-14 eess.SY cs.SY

Subin Shin , Seongkyu Jung , Jinseok Choi , Jeonghun Park This is my paper
classification eess.SYcs.SY
keywords MIMOintegratedsensingandcommunicationRFchainselectionmutualinformationgreedybackwardeliminationbeambeamspaceenergyefficiencyantenna
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper tackles the problem of choosing which radio-frequency (RF) chains to keep active in a MIMO system that simultaneously communicates with a user and senses targets. Because these two functions are traditionally measured with different metrics—mutual information for communication versus beam-pattern MSE or Cramér-Rao lower bound for sensing—the authors adopt sensing mutual information as a unified objective and maximize its weighted sum with communication MI. They show that the total MI can be decomposed into per-chain contributions, and on that basis they propose two greedy backward-elimination algorithms, GES (eigenvalue-based) and GCS (cofactor-based), which repeatedly remove the chain whose loss is smallest. Their simulations report that these methods match exhaustive search almost exactly while costing far less computation, and that the same machinery extends to beam selection in beamspace hybrid arrays, where a simplified diagonal variant (DBS) performs nearly as well. If the sensing-MI proxy is faithful, this gives a practical way to cut hardware cost and power in MIMO ISAC without sacrificing much performance.

What carries the argument

The load-bearing object is the per-RF-chain MI contribution. For a candidate chain $j$, the contribution to communication MI is $T\log_2\big((1-\gamma\alpha_j)^{-1}\big)$ with $\alpha_j=\mathbf{h}_j^{\mathsf{H}}\mathbf{A}\mathbf{h}_j$, and the contribution to sensing MI is $\sum_n \log_2\big((1-\gamma T\beta_{n,j})^{-1}\big)$ with rank-reduced $\mathbf{G}_n$ factors; GCS expresses the same losses as $\log_2(\delta_j^{-1})$ and $\log_2(\varepsilon_{n,j}^{-1})$ using diagonal entries of inverse matrices. These identities turn subset selection into repeated scalar comparisons, and Corollaries 1 and 2 give inversion-free updates of the needed matrices via the Woodbury identity and Schur complement. The same decomposition, with the analog beamforming matrix folded into the channel and target-response matrices, carries the method from antenna-level chain selection to beamspace beam selection; under asymptotic orthogonality it collapses to the one-pass diagonal beam selection.

What would settle it

Run exhaustive enumeration on a small instance (for example $N_t=8$, $K=4$) over one fixed channel and target realization, and compare the weighted-sum MI of the GES and GCS subsets with the exhaustive optimum; a single realization where the gap exceeds a few percent would falsify the near-optimality claim. Separately, compare the beam-pattern MSE or CRLB of the MI-selected chains against chains selected directly on those sensing metrics: if the MI-selected set is clearly worse, the unified-MI proxy is the wrong objective.

Watch

Extended reading notes

Core claim

On the paper's own account, the central discovery is that the weighted-sum RF-chain selection problem (17), though NP-hard in general, can be solved near-optimally by sequential elimination: at each step, the algorithm removes the RF chain whose deletion causes the smallest drop in the weighted sum of normalized communication and sensing MI. The mechanism is an exact decomposition—Theorems 1 and 2—of each MI term into a baseline term and a scalar per-chain loss, so that ranking chains reduces to comparing scalars rather than recomputing determinants. GES computes the loss through eigenvalue decomposition of the sensing covariance and the Woodbury-based updates of Corollary 1; GCS computes it from diagonal entries of inverse matrices updated through the Schur complement in Corollary 2. In the beamspace hybrid-array regime, the same theorems reduce to a diagonal approximation, DBS, which selects chains in one pass. The paper's simulations show GES and GCS tracking exhaustive search across SNR, active-chain count, and Pareto weighting, with DBS close behind.

Load-bearing premise

The load-bearing premise is that sensing mutual information, computed with the wide-separation independent-columns target model and the sample-covariance approximation of (13), faithfully captures what the chosen RF chains deliver for sensing; if that MI proxy diverges from beam-pattern MSE or CRLB in the operating regime, chains picked to maximize weighted MI may not preserve actual sensing capability even though the theorems remain exact for the stated objective.

Editorial extensions

If this is right

  • GES and GCS can replace exhaustive search in MIMO ISAC chain selection, giving essentially the same weighted-sum MI at substantially lower complexity, so larger antenna arrays become tractable.
  • Selecting a small carefully chosen subset of RF chains improves energy efficiency relative to full selection; the paper reports up to 7.79 percent EE gain in the tested setup.
  • Because the MI decomposition is agnostic to the communication-versus-sensing weight, the same greedy loop traces out a wide Pareto frontier between communication MI and sensing MI, so one algorithm serves any operating point on the trade-off.
  • The extension to beamspace MIMO means hybrid-architecture systems can use GES and GCS, and DBS offers a one-pass alternative that stays within a few percent of the full greedy methods even when its asymptotic assumptions are not met.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The backward-elimination formulation implicitly favors removing redundant chains: GCS's cofactor criterion is the determinant of the matrix with that chain's row and column deleted, which measures orthogonality of the remaining vectors, so the method may generalize to other submodular subset-selection objectives with similar curvature.
  • If sensing MI is later found to diverge from beam-pattern MSE or CRLB in some regime, the same greedy framework could be rerun with those metrics substituted wherever the chain contribution has a similar determinant form; the theorems would still supply the ranking.
  • The near-diagonality that DBS exploits suggests a cheap diagnostic: when the off-diagonal entries of $\tilde{\mathbf{D}}$ and $\tilde{\mathbf{E}}_n$ are small relative to the diagonal, one-pass selection is safe, so a system could adaptively switch between GCS and DBS based on measured channel statistics.
  • Because the algorithms need only matrices built from channels and target covariances, they could be applied online as the channel changes, with the low-rank updates in Corollaries 1 and 2 tracking the evolving best subset.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 6 minor

Summary. This paper proposes greedy RF chain selection algorithms for MIMO ISAC systems under a unified MI-based objective. The authors formulate the transmit selection problem as maximizing the weighted sum of normalized communication MI and sensing MI (Eq. (17)), and show that the per-chain contribution can be isolated via the determinant lemma and Schur complement (Theorems 1 and 2). Based on these decompositions, they develop GES and GCS, two backward-elimination greedy algorithms with sequential rank-one updates (Corollaries 1 and 2), and extend the framework to beam selection in beamspace hybrid MIMO, including a simplified diagonal beam selection (DBS) under asymptotic conditions. Numerical results compare the proposed methods with exhaustive search, random selection, fixed selection, and full selection in terms of weighted MI, energy efficiency, and MI Pareto frontiers.

Significance. If the results hold, the paper gives a computationally efficient heuristic for a combinatorial RF chain selection problem, with exact decomposition identities that are likely useful beyond the specific setting. The determinant-lemma and Schur-complement derivations are clean, and the sequential updates avoid repeated matrix inversions, which is a genuine practical contribution. The paper is also careful to formulate the objective explicitly and does not fit parameters to the simulation outputs. The main caveat is that the practical relevance of the selection hinges on sensing MI being a faithful surrogate for the beam-pattern MSE or CRLB metrics that the introduction itself identifies; this is not tested, and the manuscript's claims should be scoped accordingly.

major comments (2)
  1. [Section V, Eqs. (15) and (17)] The central claim that GES and GCS achieve 'near-optimal performance' and demonstrate 'practical effectiveness for MIMO ISAC systems' is validated only against the weighted MI objective (17). The sensing MI in (15) is a surrogate metric, and the introduction explicitly contrasts it with beam-pattern MSE and CRLB as alternative sensing metrics. None of the experiments in Figs. 3-6 evaluates the selected RF-chain subsets under beam-pattern MSE or CRLB, so a subset that is near-optimal for (17) could be suboptimal for the detection/estimation task that those metrics describe. Please either add a simulation comparing the proposed selections against MSE/CRLB benchmarks, or restrict the conclusions to the MI-based objective.
  2. [Algorithm 3] Line 5 of Algorithm 3 instructs the algorithm to 'Select K RF chains with the lowest contribution', but the surrounding derivation shows that DBS should keep the chains with the highest contribution: the objective after removing chain j is proportional to log((d~j)^omega_c * prod_n (e~n,j)^(omega_s/N_s)), so retaining the largest such terms maximizes (17). As printed, Algorithm 3 would select the worst chains and would not reproduce the DBS results in Figs. 3-5. Please correct the pseudocode to 'highest contribution' and ensure the released code, if any, matches.
minor comments (6)
  1. [Algorithms 1 and 2] In Algorithm 1 line 9 and Algorithm 2 line 8, the condition 'if N^(i+1)_t = K' compares a set with an integer; the intended condition is 'if |N^(i+1)_t| = K'.
  2. [Section V] The simulation setup does not specify the number of time slots T, although the sensing MI in (15) contains the factor gamma*T. Please state the value of T used in Figs. 3-6.
  3. [Eq. (26)] The typesetting of Eq. (26) makes the exponent and product structure ambiguous; please rewrite with explicit parentheses and define the 'contribution' term consistently with Eq. (27).
  4. [Section V, Fig. 6] The phrase 'without loss of generality' used to justify omitting Exh from subsequent simulations is imprecise; the omission is a computational choice, not a mathematical reduction. Adding Exh to Fig. 6, or at least noting its absence, would better support the Pareto-frontier claim.
  5. [Section IV] The asymptotic argument that array response vectors 'align closely with exactly one analog beamforming vector' is informal; please state it as an explicit assumption or approximation and give the regime in which it is expected to hold.
  6. [Complexity discussion] The paper claims significantly lower complexity than exhaustive search but gives no quantitative complexity comparison; a brief table or big-O analysis for GES, GCS, DBS, and exhaustive search would make the contribution easier to assess.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the greedy selection rules are exact algebraic decompositions of the stated weighted-MI objective, with no fitted parameters or load-bearing self-citations.

full rationale

The paper's derivation chain is self-contained and exact. Section II defines communication MI in (12) and adopts the sensing MI expression in (15) from cited external prior work ([37], [33], [11]); these expressions are inputs to the selection framework, not outputs of it. Theorems 1 and 2 are algebraic identities (determinant lemma in Appendix A; cofactor/adjugate relation in Appendix C) that decompose the MI loss caused by removing one RF chain. The greedy selection rules (27) and (40) are shown by the paper's own algebra to be exactly equivalent to the sequential reformulation (18) of the weighted-MI objective (17): selecting the chain that maximizes the product in (27)/(40) is equivalent to removing the chain whose deletion causes the smallest loss in the objective. There are no fitted parameters, no data-derived constants, and no hidden normalization imported from the authors' prior work. The numerical evaluation compares GES, GCS, and DBS against exhaustive search on the same weighted-MI metric; this is the appropriate internal benchmark for a greedy near-optimality claim, and evaluating the objective that an algorithm optimizes is not circular. Self-citations in the paper ([7], [21], [26], [27], [44]) appear only as background or as power-consumption modeling and do not carry the load of Theorems 1-2 or of the near-optimality claim. An external-validity caveat remains: the sensing MI proxy (15) is used as the sensing performance metric without an explicit check against beam-pattern MSE or CRLB subset rankings, so the practical ISAC claim is conditional on the fidelity of that proxy. This is a correctness and validation concern, not circularity.

Assumptions & free parameters 0 free parameters · 7 assumptions · 0 invented entities

The paper's derivations rely on standard linear algebra and on domain assumptions adopted from cited ISAC literature; no free parameters are fitted and no new entities are introduced.

assumptions (7)
  • domain assumption The transmit signal x(t) is Gaussian with covariance P I and the channel H_c is known at the BS.
    This justifies the MI formulas (11)-(12) and the fixed-power model in which each active chain transmits with the same power P.
  • domain assumption Sensing MI, defined as the MI between the received signal and the target response matrix, is an adequate sensing metric with the form in (15).
    Adopted from [33],[37]; the paper relies on this to make communication and sensing objectives commensurable.
  • domain assumption Sensing antennas are widely separated and the columns of H_s^H are modeled as independent with covariance R_{T,n} of the form (16).
    This product structure is necessary for the sensing MI to decompose into per-target determinants.
  • domain assumption For T much larger than N_s, the sample covariance (1/T) X X^H is approximated by P I_K.
    Used to pass from (14) to (15); if T is small the sensing MI expression changes.
  • domain assumption In the asymptotic regime M to N_t, N_t and N_c to infinity with distinct AoDs and AoAs, steering vectors become orthogonal and align with the DFT beams, making H~^H H~ and R~ approximately diagonal.
    This is the basis for DBS in Section IV; it is an asymptotic idealization that the simulations test at finite sizes.
  • standard math Standard identities: determinant lemma, Weinstein-Aronszajn identity, Woodbury matrix identity, and Schur complement.
    These are the algebraic steps in Theorems 1-2 and Corollaries 1-2.
  • domain assumption The RF chain subset selection problem (17) is NP-hard.
    Stated in Section II-C without proof or citation; it is a standard complexity result for antenna subset selection, and it motivates the greedy heuristic but is not needed for the decomposition theorems.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Efficient RF Chain Selection for MIMO Integrated Sensing and Communications: A Greedy Approach." pith.science (2026). https://pith.science/paper/SIYAT6Z4

@misc{pith2026250709960,
  author       = {Pith},
  title        = {Pith review of: Efficient RF Chain Selection for MIMO Integrated Sensing and Communications: A Greedy Approach},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/SIYAT6Z4}},
  note         = {Machine review of arXiv:2507.09960}
}
read the original abstract

In multiple-input multiple-output integrated sensing and communication (MIMO ISAC) systems, radio frequency chain (i.e., RF chain) selection plays a vital role in reducing hardware cost, power consumption, and computational complexity. However, designing an effective RF chain selection strategy is challenging due to the disparity in performance metrics between communication and sensing-mutual information (MI) versus beam-pattern mean-squared error (MSE) or the Cram\'er-Rao lower bound (CRLB). To overcome this, we propose a low-complexity greedy RF chain selection framework maximizing a unified MI-based performance metric applicable to both functions. By decomposing the total MI into individual contributions of each RF chain, we introduce two approaches: greedy eigen-based selection (GES) and greedy cofactor-based selection (GCS), which iteratively identify and remove the RF chains with the lowest contribution. We further extend our framework to beam selection for beamspace MIMO ISAC systems, introducing diagonal beam selection (DBS) as a simplified solution. Simulation results show that our proposed methods achieve near-optimal performance with significantly lower complexity than exhaustive search, demonstrating their practical effectiveness for MIMO ISAC systems.

Figures

Figures reproduced from arXiv: 2507.09960 by the authors.

Figure 1
Figure 1. The considered bistatic MIMO ISAC system with [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Beam selection with 𝐾 active RF chains. Orang beams represent the selected (active) beams, while blue beams represent unselected (inactive) beams. RF chain selection. In this section, we extend our proposed methods to hybrid beamforming architecture [42], wherein each RF chain is connected to 𝑁𝑡 antennas via dedicated phase shifters. Within this architecture, the original problem of RF chain selection naturally evol… view at source ↗
Figure 3
Figure 3. The weighted sum of normalized MI over average SNR (dB) in [PITH_FULL_IMAGE:figures/full_fig_p008_3.png] view at source ↗
Figures from the paper (3 more)
Figure 4
Figure 4. Figure 4: The weighted sum of normalized MI over the number of active RF [PITH_FULL_IMAGE:figures/full_fig_p008_4.png]
Figure 5
Figure 5. Figure 5: The weighted sum of normalized EE over the number of active RF [PITH_FULL_IMAGE:figures/full_fig_p009_5.png]
Figure 6
Figure 6. Figure 6: The Pareto boundary of normalized communication MI and normal [PITH_FULL_IMAGE:figures/full_fig_p010_6.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

46 extracted references · 37 canonical work pages

  1. [1]

    Integrated sensing and communications: Toward dual-functional wire- less networks for 6g and beyond,

    F. Liu, Y . Cui, C. Masouros, J. Xu, T. X. Han, Y . C. Eldar, and S. Buzzi, “Integrated sensing and communications: Toward dual-functional wire- less networks for 6g and beyond,” IEEE J. Sel. Areas Commun., vol. 40, no. 6, pp. 1728–1767, 2022

    work page 2022

  2. [2]

    Multi- beam integrated sensing and communication: State-of-the-art, challenges and opportunities,

    Y . Zhuo, T. Mao, H. Li, C. Sun, Z. Wang, Z. Han, and S. Chen, “Multi- beam integrated sensing and communication: State-of-the-art, challenges and opportunities,” IEEE Commun. Mag. , vol. 62, no. 9, pp. 90–96, 2024

    work page 2024

  3. [3]

    MU-MIMO commu- nications with MIMO radar: From co-existence to joint transmission,

    F. Liu, C. Masouros, A. Li, H. Sun, and L. Hanzo, “MU-MIMO commu- nications with MIMO radar: From co-existence to joint transmission,” IEEE Trans. Wireless Commun. , vol. 17, no. 4, pp. 2755–2770, 2018

    work page 2018

  4. [4]

    To- ward dual-functional radar-communication systems: Optimal waveform design,

    F. Liu, L. Zhou, C. Masouros, A. Li, W. Luo, and A. Petropulu, “To- ward dual-functional radar-communication systems: Optimal waveform design,” IEEE Trans. Signal Process. , vol. 66, no. 16, pp. 4264–4279, 2018

    work page 2018

  5. [5]

    Joint transmit beamforming for multiuser MIMO communications and MIMO radar,

    X. Liu, T. Huang, N. Shlezinger, Y . Liu, J. Zhou, and Y . C. Eldar, “Joint transmit beamforming for multiuser MIMO communications and MIMO radar,” IEEE Trans. Signal Process. , vol. 68, pp. 3929–3944, 2020

    2020

  6. [6]

    Optimal transmit beamforming for integrated sensing and communication,

    H. Hua, J. Xu, and T. X. Han, “Optimal transmit beamforming for integrated sensing and communication,” IEEE Trans. Veh. Technol. , vol. 72, no. 8, pp. 10 588–10 603, 2023

    work page 2023

  7. [7]

    Joint and robust beam- forming framework for integrated sensing and communication systems,

    J. Choi, J. Park, N. Lee, and A. Alkhateeb, “Joint and robust beam- forming framework for integrated sensing and communication systems,” IEEE Trans. Wireless Commun. , vol. 23, no. 11, pp. 17 602–17 618, 2024

    work page 2024

  8. [8]

    Integrated Sensing and Communications in Downlink FDD MIMO without CSI Feedback

    N. Kim, J. Han, J. Choi, A. Alkhateeb, C.-B. Chae, and J. Park, “Integrated sensing and communications in downlink FDD MIMO without CSI feedback,” ArXiv Preprint , 2024. [Online]. Available: https://arxiv.org/abs/2412.12590

    work page Pith review arXiv 2024

Show all 46 references
  1. [9]

    Integrated sensing and communications in FDD MIMO without CSI feedback: Towards FDD MIMO ISAC,

    N. Kim, J. Han, and J. Park, “Integrated sensing and communications in FDD MIMO without CSI feedback: Towards FDD MIMO ISAC,” in Proc. Int. Symp. on Model. and Opt. in Mobile, Ad Hoc, and Wireless Networks (WiOpt), 2024, pp. 132–137

    2024

  2. [10]

    Cram ´er-rao bound optimization for joint radar-communication beamforming,

    F. Liu, Y .-F. Liu, A. Li, C. Masouros, and Y . C. Eldar, “Cram ´er-rao bound optimization for joint radar-communication beamforming,” IEEE Trans. Signal Process., vol. 70, pp. 240–253, 2022

    2022

  3. [11]

    On the fundamental tradeoff of integrated sensing and communications under gaussian channels,

    Y . Xiong, F. Liu, Y . Cui, W. Yuan, T. X. Han, and G. Caire, “On the fundamental tradeoff of integrated sensing and communications under gaussian channels,” IEEE Trans. Inf. Theory , vol. 69, no. 9, pp. 5723– 5751, 2023

    2023

  4. [12]

    MIMO integrated sensing and commu- nication: CRB-rate tradeoff,

    H. Hua, T. X. Han, and J. Xu, “MIMO integrated sensing and commu- nication: CRB-rate tradeoff,” IEEE Trans. Wireless Commun. , vol. 23, no. 4, pp. 2839–2854, 2024

    2024

  5. [13]

    Antenna selection in MIMO systems,

    S. Sanayei and A. Nosratinia, “Antenna selection in MIMO systems,” IEEE Commun. Mag. , vol. 42, no. 10, pp. 68–73, 2004

    2004

  6. [14]

    Low RF-complexity millimeter-wave beamspace-MIMO systems by beam selection,

    P. V . Amadori and C. Masouros, “Low RF-complexity millimeter-wave beamspace-MIMO systems by beam selection,” IEEE Trans. Commun., vol. 63, no. 6, pp. 2212–2223, 2015

    2015

  7. [15]

    Sparse array beamformer design via ADMM,

    H. Huang, H. C. So, and A. M. Zoubir, “Sparse array beamformer design via ADMM,” IEEE Trans. Signal Process. , vol. 71, pp. 3357–3372, 2023

    2023

  8. [16]

    Hybrid sparse array beamforming design for general rank signal models,

    S. A. Hamza and M. G. Amin, “Hybrid sparse array beamforming design for general rank signal models,” IEEE Trans. Signal Process. , vol. 67, no. 24, pp. 6215–6226, 2019

    2019

  9. [17]

    Adaptive sparse array beamformer design by regularized complementary antenna switching,

    X. Wang, M. S. Greco, and F. Gini, “Adaptive sparse array beamformer design by regularized complementary antenna switching,” IEEE Trans. Signal Process., vol. 69, pp. 2302–2315, 2021

    2021

  10. [18]

    Real-time CRLB based antenna selection in planar antenna arrays,

    M. Arash, I. Stupia, and L. Vandendorpe, “Real-time CRLB based antenna selection in planar antenna arrays,” IEEE Trans. Wireless Commun., vol. 22, no. 6, pp. 4043–4056, 2023

    2023

  11. [19]

    Massive mimo in real propagation environments: Do all antennas contribute equally?

    X. Gao, O. Edfors, F. Tufvesson, and E. G. Larsson, “Massive mimo in real propagation environments: Do all antennas contribute equally?” IEEE Trans. Commun. , vol. 63, no. 11, pp. 3917–3928, 2015

    2015

  12. [20]

    Smart antenna assignment is essential in full-duplex communications,

    J. M. B. d. Silva, H. Ghauch, G. Fodor, M. Skoglund, and C. Fischione, “Smart antenna assignment is essential in full-duplex communications,” IEEE Trans. Commun. , vol. 69, no. 5, pp. 3450–3466, 2021

    2021

  13. [21]

    Rate-splitting multiple access for downlink MIMO: A generalized power iteration approach,

    J. Park, J. Choi, N. Lee, W. Shin, and H. V . Poor, “Rate-splitting multiple access for downlink MIMO: A generalized power iteration approach,” IEEE Trans. Wireless Commun. , vol. 22, no. 3, pp. 1588–1603, 2023

    2023

  14. [22]

    Fast antenna subset selection in MIMO systems,

    M. Gharavi-Alkhansari and A. Gershman, “Fast antenna subset selection in MIMO systems,” IEEE Trans. Signal Process. , vol. 52, no. 2, pp. 339–347, 2004

    2004

  15. [23]

    Efficient sum rate max- imization and resource allocation in block-diagonalized space-division multiplexing,

    B. C. Lim, W. A. Krzymien, and C. Schlegel, “Efficient sum rate max- imization and resource allocation in block-diagonalized space-division multiplexing,” IEEE Trans. Veh. Technol., vol. 58, no. 1, pp. 478–484, 2009

    2009

  16. [24]

    Performance analysis and algorithm designs for transmit antenna selection in linearly precoded multiuser MIMO systems,

    P.-H. Lin and S.-H. Tsai, “Performance analysis and algorithm designs for transmit antenna selection in linearly precoded multiuser MIMO systems,” IEEE Trans. Veh. Technol. , vol. 61, no. 4, pp. 1698–1708, 2012

    2012

  17. [25]

    Energy-efficient hybrid analog and digital precoding for mmwave MIMO systems with large antenna arrays,

    X. Gao, L. Dai, S. Han, C.-L. I, and R. W. Heath, “Energy-efficient hybrid analog and digital precoding for mmwave MIMO systems with large antenna arrays,” IEEE J. Sel. Areas Commun. , vol. 34, no. 4, pp. 998–1009, 2016

    2016

  18. [26]

    Base station antenna selection for low-resolution ADC systems,

    J. Choi, J. Sung, N. Prasad, X.-F. Qi, B. L. Evans, and A. Gatherer, “Base station antenna selection for low-resolution ADC systems,” IEEE Trans. Commun., vol. 68, no. 3, pp. 1951–1965, 2020

    1951

  19. [27]

    Optimization of mixed- ADC multi-antenna systems for cloud-RAN deployments,

    J. Park, S. Park, A. Yazdan, and R. W. Heath, “Optimization of mixed- ADC multi-antenna systems for cloud-RAN deployments,” IEEE Trans. Commun., vol. 65, no. 9, pp. 3962–3975, 2017

    2017

  20. [28]

    Joint antenna selection and covariance matrix optimization for ISAC systems,

    M. Palaiologos, M. H. Cast ˜aneda Garc ´ıa, T. Laas, R. A. Stirling- Gallacher, and G. Caire, “Joint antenna selection and covariance matrix optimization for ISAC systems,” in Proc. IEEE Int. Conf. on Comm. , 2024, pp. 2071–2076

    2024

  21. [29]

    Joint transmit/receive antenna selection and beamforming design for ISAC systems,

    R. Liu, M. Li, and Q. Liu, “Joint transmit/receive antenna selection and beamforming design for ISAC systems,” in Proc. IEEE Glob. Comm. Conf., 2023, pp. 3118–3123

    2023

  22. [30]

    Information theory and radar waveform design,

    M. Bell, “Information theory and radar waveform design,” IEEE Trans. Inf. Theory, vol. 39, no. 5, pp. 1578–1597, 1993

    1993

  23. [31]

    MIMO radar waveform design based on mutual information and minimum mean-square error estimation,

    Y . Yang and R. S. Blum, “MIMO radar waveform design based on mutual information and minimum mean-square error estimation,” IEEE Trans. Aerosp. Electron. Syst. , vol. 43, no. 1, pp. 330–343, 2007

    2007

  24. [32]

    MIMO radar waveform design in colored noise based on information theory,

    B. Tang, J. Tang, and Y . Peng, “MIMO radar waveform design in colored noise based on information theory,”IEEE Trans. Signal Process., vol. 58, no. 9, pp. 4684–4697, 2010

    2010

  25. [33]

    Spectrally constrained MIMO radar waveform design based on mutual information,

    B. Tang and J. Li, “Spectrally constrained MIMO radar waveform design based on mutual information,” IEEE Trans. Signal Process. , vol. 67, no. 3, pp. 821–834, 2019

    2019

  26. [34]

    Mutual information-based waveform design for MIMO radar space-time adaptive processing,

    G. Sun, Z. He, J. Tong, X. Yu, and S. Shi, “Mutual information-based waveform design for MIMO radar space-time adaptive processing,” IEEE Trans. Geosci. Remote Sens., vol. 59, no. 4, pp. 2909–2921, 2021

    2021

  27. [35]

    MIMO-ISAC: Performance analysis and rate region characterization,

    C. Ouyang, Y . Liu, and H. Yang, “MIMO-ISAC: Performance analysis and rate region characterization,” IEEE Wireless Commun. Lett., vol. 12, no. 4, pp. 669–673, 2023

    2023

  28. [36]

    Mutual information-based integrated sensing and communications: A WMMSE framework,

    Y . Peng, S. Yang, W. Lyu, Y . Li, H. He, Z. Zhang, and C. Assi, “Mutual information-based integrated sensing and communications: A WMMSE framework,” IEEE Wireless Commun. Lett. , vol. 13, no. 10, pp. 2642– 2646, 2024

    2024

  29. [37]

    Unified ISAC Pareto boundary based on mutual information and minimum mean- square error estimation,

    S. Wang, L. Chen, J. Zhou, Y . Chen, K. Han, and C. You, “Unified ISAC Pareto boundary based on mutual information and minimum mean- square error estimation,” IEEE Trans. Commun. , vol. 72, no. 11, pp. 6783–6795, 2024

    2024

  30. [38]

    Integrated sensing and communications: A mutual information-based framework,

    C. Ouyang, Y . Liu, H. Yang, and N. Al-Dhahir, “Integrated sensing and communications: A mutual information-based framework,” IEEE Commun. Mag., vol. 61, no. 5, pp. 26–32, 2023

    2023

  31. [39]

    Probability of detection for fluctuating targets,

    P. Swerling, “Probability of detection for fluctuating targets,” IRE Trans. Inf. Theory, vol. 6, no. 2, pp. 269–308, 1960

    1960

  32. [40]

    On probing signal design for MIMO radar,

    P. Stoica, J. Li, and Y . Xie, “On probing signal design for MIMO radar,” IEEE Trans. Signal Process. , vol. 55, no. 8, pp. 4151–4161, 2007

    2007

  33. [41]

    Sensing mutual information with random signals in gaussian channels: Bridging sensing and communication metrics,

    L. Xie, F. Liu, J. Luo, and S. Song, “Sensing mutual information with random signals in gaussian channels: Bridging sensing and communication metrics,” ArXiv Preprint , 2024. [Online]. Available: http://arxiv.org/abs/2402.03919

    2024 arXiv

  34. [42]

    An overview of signal processing techniques for millimeter wave MIMO systems,

    R. W. Heath, N. Gonz ´alez-Prelcic, S. Rangan, W. Roh, and A. M. Sayeed, “An overview of signal processing techniques for millimeter wave MIMO systems,” IEEE J. Sel. Topics Signal Process. , vol. 10, no. 3, pp. 436–453, 2016

    2016

  35. [43]

    Noncooperative cellular wireless with unlimited num- bers of base station antennas,

    T. L. Marzetta, “Noncooperative cellular wireless with unlimited num- bers of base station antennas,” IEEE Trans. Wireless Commun. , vol. 9, no. 11, pp. 3590–3600, 2010

    2010

  36. [44]

    Energy efficiency maximization precoding for quantized massive MIMO systems,

    J. Choi, J. Park, and N. Lee, “Energy efficiency maximization precoding for quantized massive MIMO systems,” IEEE Trans. Wireless Commun., vol. 21, no. 9, pp. 6803–6817, 2022

    2022

  37. [45]

    Energy-constrained modulation optimization,

    S. Cui, A. Goldsmith, and A. Bahai, “Energy-constrained modulation optimization,” IEEE Trans. Wireless Commun., vol. 4, no. 5, pp. 2349– 2360, 2005

    2005

  38. [46]

    R. A. Horn and C. R. Johnson, Matrix analysis. Cambridge university press, 2012

    2012

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.