Uplink Signal Detection For Large-Scale MIMO-ISAC Systems
Pith reviewed 2026-05-10 01:39 UTC · model grok-4.3
The pith
P-NS-ADMM achieves the same received diversity order as maximum likelihood detection in large-scale MIMO-ISAC uplink.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
By casting MIMO-ISAC uplink detection as a mixed-integer least squares problem, the authors develop P-NS-ADMM which, via neighborhood search and projection steps inside the ADMM framework, matches the diversity order of maximum likelihood detection; the companion I-NS-ADMM drops the projection for reduced complexity while using a flexible iteration count to maintain sensing accuracy.
What carries the argument
The projection-based neighborhood search-aided alternating direction method of multipliers (P-NS-ADMM) applied to the mixed-integer least squares model of the detection problem.
Load-bearing premise
The uplink MIMO-ISAC detection problem is accurately captured by the mixed-integer least squares model and the neighborhood search plus projection steps preserve the full diversity order without hidden parameter dependencies.
What would settle it
A high-SNR simulation or analysis in which the bit-error-rate slope of P-NS-ADMM is shallower than that of ML detection in a large-scale MIMO-ISAC setup would disprove the diversity-order claim.
Figures
read the original abstract
Next-generation wireless communication systems are unifying large-scale multiple-input multiple-output (MIMO) and integrated sensing and communication (ISAC) to enhance sensing and communication performance. In this paper, the signal detection problem for MIMO-ISAC systems is modeled as a mixed-integer least squares (MILS) problem. To solve it efficiently, we propose a projection-based neighborhood search-aided alternating direction method of multipliers (P-NS-ADMM) detection scheme. By theoretical analysis, we demonstrate that P-NS-ADMM achieves the same received diversity order as maximum likelihood (ML) detection. For further complexity reduction, an iteration-based NS-ADMM (I-NS-ADMM) is proposed to remove the complex projection operation. Complexity analysis shows its complexity advantage compared with P-NS-ADMM. Moreover, to better estimate the sensing signals for I-NS-ADMM, a flexible mechanism of ADMM iterations is given. Finally, simulations demonstrate the proposed NS-aided ADMM detection schemes have significant performance advantages in terms of both BER and NMSE.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript models the uplink signal detection problem in large-scale MIMO-ISAC systems as a mixed-integer least squares (MILS) problem. It proposes a projection-based neighborhood search-aided ADMM (P-NS-ADMM) scheme that is shown through theoretical analysis to achieve the same diversity order as maximum likelihood (ML) detection. An iteration-based variant (I-NS-ADMM) is introduced to reduce complexity by eliminating the projection step, along with a flexible ADMM iteration mechanism for sensing signal estimation. Complexity analysis and simulations demonstrating advantages in bit error rate (BER) and normalized mean square error (NMSE) are provided.
Significance. If the diversity-order claim holds, this work would offer a computationally efficient detection method for integrated sensing and communication systems that maintains near-optimal error performance, which is valuable for large-scale MIMO deployments in next-generation wireless networks. The provision of both theoretical guarantees and practical complexity reductions strengthens the contribution, though verification of the proof details and simulation parameters is needed to fully assess the impact.
major comments (1)
- [theoretical analysis section] The claim that P-NS-ADMM achieves the same received diversity order as ML detection requires an explicit bound demonstrating that the probability of the correct symbol lying outside the searched neighborhood or being modified by the projection operation decays at least as fast as the ML error probability at high SNR. The presence of sensing signals in the ISAC model may introduce correlations that could affect the independence assumptions in the diversity calculation, and this needs to be addressed to confirm the equivalence.
minor comments (2)
- [simulation results] The simulation results for BER and NMSE should include details on the exact system parameters, number of Monte Carlo runs, and error bars to allow reproducibility and assessment of statistical significance.
- [notation and definitions] Ensure consistent use of notation for the ADMM penalty parameter and other variables throughout the manuscript.
Simulated Author's Rebuttal
We thank the referee for the constructive feedback on our manuscript. We address the single major comment below and will revise the theoretical analysis section to provide the requested explicit bounds and clarifications.
read point-by-point responses
-
Referee: [theoretical analysis section] The claim that P-NS-ADMM achieves the same received diversity order as ML detection requires an explicit bound demonstrating that the probability of the correct symbol lying outside the searched neighborhood or being modified by the projection operation decays at least as fast as the ML error probability at high SNR. The presence of sensing signals in the ISAC model may introduce correlations that could affect the independence assumptions in the diversity calculation, and this needs to be addressed to confirm the equivalence.
Authors: We agree that an explicit bound would strengthen the presentation. In the revised manuscript we will insert a new lemma immediately following the existing diversity-order theorem. The lemma will bound the probability that the true symbol vector lies outside the neighborhood searched by P-NS-ADMM or is altered by the subsequent projection step; the bound will be shown to decay at least as fast as the ML pairwise error probability (i.e., exponentially with SNR). The proof proceeds by relating the neighborhood radius to the minimum distance of the constellation and using the fact that the ADMM iterates converge to a point whose distance to the ML solution is controlled by the noise variance. Regarding sensing signals, we will add a short paragraph clarifying that, under the uplink ISAC model, the sensing component is either known a priori or estimated separately before communication detection; the residual sensing interference appears as an additional deterministic term in the effective noise. Because this term is independent of the communication symbols and does not scale with SNR, it does not change the high-SNR slope of the error probability. Consequently the independence assumptions used in the diversity calculation remain valid conditionally on the estimated sensing parameters. These additions will be placed in the theoretical analysis section and will not alter the complexity or simulation results. revision: yes
Circularity Check
No significant circularity detected in diversity-order claim
full rationale
The paper models uplink MIMO-ISAC detection as a mixed-integer least-squares problem and introduces P-NS-ADMM, asserting via theoretical analysis that it matches the ML diversity order. No quoted derivation step reduces the diversity result to a fitted parameter, a self-definitional equivalence, or a load-bearing self-citation chain; the claim is framed as following from standard high-SNR error-probability analysis applied to the neighborhood-search and projection steps. The provided abstract and context contain no equations or citations that would make the output equivalent to the inputs by construction. This is the common non-circular outcome for algorithmic papers whose central result rests on external analytical techniques rather than internal redefinition.
Axiom & Free-Parameter Ledger
free parameters (1)
- ADMM penalty parameter
axioms (1)
- standard math ADMM converges to a stationary point for the formulated MILS problem under standard conditions on the penalty parameter and problem structure.
Reference graph
Works this paper leans on
-
[1]
A Survey on Fundamental Limits of Integrated Sensing and Communication,
A. Liu, Z. Huang, M. Li, Y . Wan, W. Li, T. X. Han, C. Liu, R. Du, D. K. P. Tan, J. Lu, Y . Shen, F. Colone, and K. Chetty, “A Survey on Fundamental Limits of Integrated Sensing and Communication,”IEEE Commun. Surveys Tuts., vol. 24, no. 2, pp. 994–1034, 2022
work page 2022
-
[2]
Integrated Sensing and Communication Signals Toward 5G-A and 6G: A Survey,
Z. Wei, H. Qu, Y . Wang, X. Yuan, H. Wu, Y . Du, K. Han, N. Zhang, and Z. Feng, “Integrated Sensing and Communication Signals Toward 5G-A and 6G: A Survey,”IEEE Internet Things J., vol. 10, no. 13, pp. 11 068–11 092, 2023
work page 2023
-
[3]
Enabling Joint Communication and Radar Sensing in Mobile Networks—A Survey,
J. A. Zhang, M. L. Rahman, K. Wu, X. Huang, Y . J. Guo, S. Chen, and J. Yuan, “Enabling Joint Communication and Radar Sensing in Mobile Networks—A Survey,”IEEE Commun. Surveys Tuts., vol. 24, no. 1, pp. 306–345, 2022
work page 2022
-
[4]
Integrated Sensing and Communications: Toward Dual- Functional Wireless 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 Wireless Networks for 6G and Beyond,”IEEE J. Sel. Areas Commun., vol. 40, no. 6, pp. 1728–1767, 2022
work page 2022
-
[5]
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
work page 2022
-
[6]
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
work page 2020
-
[7]
C. Liu, W. Yuan, S. Li, X. Liu, H. Li, D. W. K. Ng, and Y . Li, “Learning-Based Predictive Beamforming for Integrated Sensing and Communication in Vehicular Networks,”IEEE J. Sel. Areas Commun., vol. 40, no. 8, pp. 2317–2334, 2022
work page 2022
-
[8]
B. Wang, L. Wu, Z. Cheng, and Z. He, “Exploiting Constructive Interference in Symbol Level Hybrid Beamforming for Dual-Function Radar-Communication System,”IEEE Wireless Commun. Lett., vol. 11, no. 10, pp. 2071–2075, 2022
work page 2071
-
[9]
Dual-Functional Radar-Communication Waveform Design: A Symbol-Level Precoding Approach,
R. Liu, M. Li, Q. Liu, and A. L. Swindlehurst, “Dual-Functional Radar-Communication Waveform Design: A Symbol-Level Precoding Approach,”IEEE J. Sel. Topics Signal Process., vol. 15, no. 6, pp. 1316– 1331, 2021
work page 2021
-
[10]
Waveform Design and Performance Analysis for Full-Duplex Integrated Sensing and Communication,
Z. Xiao and Y . Zeng, “Waveform Design and Performance Analysis for Full-Duplex Integrated Sensing and Communication,”IEEE J. Sel. Areas Commun., vol. 40, no. 6, pp. 1823–1837, 2022
work page 2022
-
[11]
MIMO-OFDM ISAC Waveform Design for Range-Doppler Sidelobe Suppression,
P. Li, M. Li, R. Liu, Q. Liu, and A. Lee Swindlehurst, “MIMO-OFDM ISAC Waveform Design for Range-Doppler Sidelobe Suppression,” IEEE Trans. Wireless Commun., vol. 24, no. 2, pp. 1001–1015, 2025
work page 2025
-
[12]
Adaptive Interference Removal for Uncoordinated Radar/Communication Coexistence,
L. Zheng, M. Lops, and X. Wang, “Adaptive Interference Removal for Uncoordinated Radar/Communication Coexistence,”IEEE J. Sel. Topics Signal Process., vol. 12, no. 1, pp. 45–60, 2018
work page 2018
-
[13]
Performance of Downlink and Uplink Integrated Sensing and Communications (ISAC) Systems,
C. Ouyang, Y . Liu, and H. Yang, “Performance of Downlink and Uplink Integrated Sensing and Communications (ISAC) Systems,”IEEE Wireless Commun. Lett., vol. 11, no. 9, pp. 1850–1854, 2022
work page 2022
-
[14]
Joint radar and communication design: Applications, state-of-the-art, and the road ahead,
F. Liu, C. Masouros, A. P. Petropulu, H. Griffiths, and L. Hanzo, “Joint radar and communication design: Applications, state-of-the-art, and the road ahead,”IEEE Trans. Commun., vol. 68, no. 6, pp. 3834–3862, 2020
work page 2020
-
[15]
A Dual-Function Massive MIMO Uplink OFDM Communication and Radar Architecture,
M. Temiz, E. Alsusa, and M. W. Baidas, “A Dual-Function Massive MIMO Uplink OFDM Communication and Radar Architecture,”IEEE Trans. Cogn. Commun. Netw., vol. 8, no. 2, pp. 750–762, 2022
work page 2022
-
[16]
Joint receiver design for integrated sensing and communications,
Y . Dong, F. Liu, and Y . Xiong, “Joint receiver design for integrated sensing and communications,”IEEE Commun. Lett., vol. 27, no. 7, pp. 1854–1858, 2023
work page 2023
-
[17]
Addressing the Mutual Interference in Uplink ISAC Receivers: A Projection Method,
Z. Yu, H. Ren, C. Pan, G. Zhou, R. Wang, M. Liu, and J. Wang, “Addressing the Mutual Interference in Uplink ISAC Receivers: A Projection Method,”IEEE Wireless Commun. Lett., vol. 13, no. 11, pp. 3109–3113, 2024
work page 2024
-
[18]
S. Boyd, N. Parikh, E. Chu, B. Peleato, J. Ecksteinet al., “Distributed optimization and statistical learning via the alternating direction method of multipliers,”F ound. Trends Mach. Learn., vol. 3, no. 1, pp. 1–122, 2011
work page 2011
-
[19]
A simple effective heuristic for embedded mixed-integer quadratic programming,
R. Takapoui, N. Moehle, S. Boyd, and A. Bemporad, “A simple effective heuristic for embedded mixed-integer quadratic programming,”Int. J. Control, vol. 93, no. 1, pp. 2–12, 2020
work page 2020
-
[20]
ADMM-Based Infinity-Norm Detection for Massive MIMO: Algorithm and VLSI Architecture,
S. Shahabuddin, I. Hautala, M. Juntti, and C. Studer, “ADMM-Based Infinity-Norm Detection for Massive MIMO: Algorithm and VLSI Architecture,”IEEE Trans. V ery Large Scale Integr . (VLSI) Syst., vol. 29, no. 4, pp. 747–759, 2021
work page 2021
-
[21]
Efficient QAM Signal Detector for Massive MIMO Systems via PS/DPS-ADMM Approaches,
Q. Zhang, J. Wang, and Y . Wang, “Efficient QAM Signal Detector for Massive MIMO Systems via PS/DPS-ADMM Approaches,”IEEE Trans. Wireless Commun., vol. 21, no. 10, pp. 8859–8871, 2022
work page 2022
-
[22]
Sequential and Global Likelihood Ascent Search-Based Detection in Large MIMO Systems,
A. K. Sah and A. K. Chaturvedi, “Sequential and Global Likelihood Ascent Search-Based Detection in Large MIMO Systems,”IEEE Trans. Commun., vol. 66, no. 2, pp. 713–725, 2018
work page 2018
-
[23]
A Low-Complexity Detector for Large MIMO Systems and Multicarrier CDMA Systems,
K. V . Vardhan, S. K. Mohammed, A. Chockalingam, and B. S. Rajan, “A Low-Complexity Detector for Large MIMO Systems and Multicarrier CDMA Systems,”IEEE J. Sel. Areas Commun., vol. 26, no. 3, pp. 473– 485, 2008
work page 2008
-
[24]
A Low- complexity near-ML performance achieving algorithm for large MIMO detection,
S. K. Mohammed, A. Chockalingam, and B. Sundar Rajan, “A Low- complexity near-ML performance achieving algorithm for large MIMO detection,” inProc. IEEE Int. Symp. Inf. Theory (ISIT), Jul. 2008, pp. 2012–2016
work page 2008
-
[25]
Low-complexity near-ML decoding of large non-orthogonal STBCs using reactive tabu search,
N. Srinidhi, S. K. Mohammed, A. Chockalingam, and B. Sundar Rajan, “Low-complexity near-ML decoding of large non-orthogonal STBCs using reactive tabu search,” inProc. IEEE Int. Symp. Inf. Theory (ISIT), Jun. 2009, pp. 1993–1997
work page 2009
-
[26]
An Unconstrained Likelihood Ascent Based Detection Algorithm for Large MIMO Systems,
A. K. Sah and A. K. Chaturvedi, “An Unconstrained Likelihood Ascent Based Detection Algorithm for Large MIMO Systems,”IEEE Trans. Wireless Commun., vol. 16, no. 4, pp. 2262–2273, 2017
work page 2017
-
[27]
De- centralized Likelihood Ascent Search-Aided Detection for Distributed Large-Scale MIMO Systems,
Q. Chen, Z. Wang, C. Qi, Z. Gao, Y . Huang, and D. Niyato, “De- centralized Likelihood Ascent Search-Aided Detection for Distributed Large-Scale MIMO Systems,”IEEE Trans. Wireless Commun., vol. 24, no. 5, pp. 4160–4173, 2025. 14
work page 2025
-
[28]
H. Q. Ngo,Massive MIMO: Fundamentals and system designs. Linkop- ings Universitet, 2015
work page 2015
-
[29]
Massive MIMO Detection Techniques: A Survey,
M. A. Albreem, M. Juntti, and S. Shahabuddin, “Massive MIMO Detection Techniques: A Survey,”IEEE Commun. Surveys Tuts., vol. 21, no. 4, pp. 3109–3132, 2019
work page 2019
-
[30]
MILES: MATLAB package for solving mixed integer least squares problems,
X.-W. Chang and T. Zhou, “MILES: MATLAB package for solving mixed integer least squares problems,”GPS Solutions, vol. 11, pp. 289– 294, 2007
work page 2007
-
[31]
Z. Wang, Y . Xia, J. Li, and Q. Wu, “A New Method of Integer Parameter Estimation in Linear Models With Applications to GNSS High Precision Positioning,”IEEE Trans. Signal Process., vol. 69, pp. 4567–4579, 2021
work page 2021
-
[32]
Low-Complexity and Full- Diversity MIMO Detection Based on Condition Number Thresholding,
J. Maurer, G. Matz, and D. Seethaler, “Low-Complexity and Full- Diversity MIMO Detection Based on Condition Number Thresholding,” inProc. IEEE ICASSP, vol. 3, 2007, pp. III–61–III–64
work page 2007
-
[33]
General Recursive Least Square Algorithm for Distributed Detection in Massive MIMO,
Q. Chen, Z. Wang, C. Ma, X. Dai, and D. W. K. Ng, “General Recursive Least Square Algorithm for Distributed Detection in Massive MIMO,” IEEE Trans. V eh. Technol., vol. 73, no. 8, pp. 12 137–12 142, 2024
work page 2024
-
[34]
The Equivalence of Semidefinite Relaxation MIMO Detectors for Higher- Order QAM,
W.-K. Ma, C.-C. Su, J. Jalden, T.-H. Chang, and C.-Y . Chi, “The Equivalence of Semidefinite Relaxation MIMO Detectors for Higher- Order QAM,”IEEE J. Sel. Topics Signal Process., vol. 3, no. 6, pp. 1038–1052, 2009
work page 2009
-
[35]
A. Paulraj, R. Nabar, and D. Gore,Introduction to space-time wireless communications. Cambridge university press, 2003
work page 2003
-
[36]
Transmit selection in spatial multiplexing systems,
D. Gore, R. Heath, and A. Paulraj, “Transmit selection in spatial multiplexing systems,”IEEE Commun. Lett., vol. 6, no. 11, pp. 491–493, 2002
work page 2002
-
[37]
On maximum-likelihood detection and the search for the closest lattice point,
M. Damen, H. El Gamal, and G. Caire, “On maximum-likelihood detection and the search for the closest lattice point,”IEEE Trans. Inf. Theory, vol. 49, no. 10, pp. 2389–2402, 2003
work page 2003
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.