pith. sign in

arxiv: 2604.19709 · v1 · submitted 2026-04-21 · 📡 eess.SP · cs.IT· math.IT

Networked Tracking of Multiple Moving Targets in 6G Network

Yanmo Hu , Weifeng Zhu , Chenshu Wu , Shuowen Zhang , J. Andrew Zhang , Liang Liu This is my paper

Pith reviewed 2026-05-10 01:28 UTC · model grok-4.3

classification 📡 eess.SP cs.ITmath.IT
keywords networked tracking6G ISACKalman filterbeamformingposterior Cramer-Rao boundmoving targetsmulti-base stationtracking MSE
0
0 comments X

The pith

Multiple base stations in 6G systems track moving targets more accurately by dynamically assigning them via optimized beamforming and a networked Kalman filter.

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

This paper examines a multi-base-station architecture for tracking several moving targets in 6G integrated sensing and communication networks. The authors develop a networked Kalman filter that fuses echo signals from cooperating stations, derive the posterior Cramer-Rao bound on tracking performance under this filter, and then optimize transmit beamforming vectors across stations to minimize that bound. Numerical tests indicate that the resulting dynamic assignment of targets to stations at each sensing interval lowers overall mean-squared tracking error relative to fixed or single-station approaches.

Core claim

By using a networked Kalman filter to process signals from multiple base stations and jointly optimizing beamforming vectors to minimize the posterior Cramer-Rao bound, targets can be associated with the most suitable stations over successive sensing blocks, which in turn reduces the mean-squared error of the tracking estimates.

What carries the argument

The networked Kalman filter (NKF) that fuses multi-base-station measurements, together with the beamforming vectors designed to minimize the posterior Cramer-Rao bound (PCRB) on the tracking state.

If this is right

  • Targets are assigned to suitable base stations at each sensing block through the beamforming design.
  • The mean-squared tracking error decreases as wireless resources are reallocated according to instantaneous target locations.
  • Multi-base-station cooperation extends the coverage and accuracy limits of single-station tracking.
  • The posterior Cramer-Rao bound serves as a tight performance metric for the networked filter design.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The approach suggests that 6G sensing protocols could incorporate periodic reassociation rules without separate control channels.
  • The PCRB minimization could be adapted to joint sensing-communication objectives where data rate constraints are added.
  • Field trials with real mobility patterns would test whether the modeled zero-overhead handoff holds under hardware timing limits.

Load-bearing premise

Targets can switch between base stations over time without extra signaling overhead or association errors that would prevent resources from being allocated purely according to location.

What would settle it

A simulation or measurement in which realistic association overhead or errors are added and the optimized beamforming no longer produces a lower tracking mean-squared error than a fixed single-base-station scheme.

Figures

Figures reproduced from arXiv: 2604.19709 by Chenshu Wu, J. Andrew Zhang, Liang Liu, Shuowen Zhang, Weifeng Zhu, Yanmo Hu.

Figure 1
Figure 1. Figure 1: System model of our considered networked tracking ar [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Diagram of the proposed two-phase networked sensing [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Configuration of the networked sensing scenario with [PITH_FULL_IMAGE:figures/full_fig_p008_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Transmit beampattern results of all BSs at three sele [PITH_FULL_IMAGE:figures/full_fig_p009_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Optimal beam direction versus different weighting v [PITH_FULL_IMAGE:figures/full_fig_p009_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Comparisons of the tracking accuracy under differen [PITH_FULL_IMAGE:figures/full_fig_p010_6.png] view at source ↗
Figure 8
Figure 8. Figure 8: Tracking accuracy under different process noise pow [PITH_FULL_IMAGE:figures/full_fig_p011_8.png] view at source ↗
read the original abstract

This paper considers a networked tracking architecture in 6G integrated sensing and communication (ISAC) systems, where multiple base stations (BSs) cooperatively transmit radio signals and process received echo signals to track multiple moving targets. Compared to the single-BS counterpart, networked tracking allows the moving targets to be associated with different BSs over time such that the wireless resources can be dynamically allocated among BSs based on target locations. However, networked tracking imposes new challenges for algorithm design and resource allocation. In this paper, we first design the networked Kalman Filter (NKF) that is suitable for multi-BS based tracking, then characterize the posterior Cramer-Rao bound (PCRB) under this NKF, and last design the beamforming vectors of all the BSs to minimize the tracking PCRB. Numerical results show that our dynamic beamforming design can properly associate the targets to the suitable BSs at various sensing blocks and reduce the tracking mean-squared error (MSE).

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

3 major / 2 minor

Summary. The paper proposes a networked multi-BS tracking architecture for multiple moving targets in 6G ISAC systems. It designs a Networked Kalman Filter (NKF) suitable for cooperative multi-BS echo processing, derives the posterior Cramér-Rao bound (PCRB) under this filter, and optimizes the beamforming vectors at all BSs to minimize the resulting PCRB. Numerical results are presented to show that the optimized dynamic beamforming implicitly associates targets to suitable BSs across sensing blocks and reduces tracking MSE relative to single-BS baselines.

Significance. If the central claims hold after addressing the modeling gaps, the work would provide a concrete PCRB-driven beamforming method for dynamic resource allocation in multi-BS ISAC tracking, extending standard Kalman-filter and bound techniques to networked settings. The explicit use of PCRB minimization for association-aware allocation is a natural and potentially useful direction for 6G sensing-communication co-design.

major comments (3)
  1. [Section III and IV] The PCRB derivation (Section III, following the NKF state and measurement models) assumes a fixed effective measurement matrix determined by the current association; however, the subsequent beamforming optimization (Section IV) is continuous over all BSs and implicitly realizes association via power allocation. No term in the PCRB accounts for the discontinuity or the probability of association flips under small location or channel perturbations, so the bound used in the objective is not guaranteed to remain valid for the realized system.
  2. [Section V] The numerical results (Section V) claim that the PCRB-minimizing beamformer 'properly associate[s] the targets to the suitable BSs' and reduces MSE, yet the manuscript provides no explicit binary association variables, no signaling-cost term, and no sensitivity analysis showing that the NKF update and PCRB remain accurate when associations change. This leaves the central empirical claim unsupported.
  3. [Introduction and Section II] The weakest assumption listed in the problem statement—that targets can be dynamically reassociated without extra overhead or error—is not relaxed or bounded anywhere in the NKF recursion or PCRB expression, yet it is load-bearing for the claim that networked tracking outperforms single-BS tracking.
minor comments (2)
  1. [Section II] Notation for the multi-BS measurement model and the transition between sensing blocks should be clarified with an explicit diagram or table of the time-varying association mapping.
  2. [Abstract] The abstract and introduction would benefit from one or two key equations (e.g., the NKF update or the PCRB expression) to allow readers to assess the technical novelty without reading the full derivations.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the thorough review and valuable suggestions. We have carefully considered each major comment and provide point-by-point responses below, indicating the revisions we plan to make to the manuscript.

read point-by-point responses

  1. Referee: [Section III and IV] The PCRB derivation (Section III, following the NKF state and measurement models) assumes a fixed effective measurement matrix determined by the current association; however, the subsequent beamforming optimization (Section IV) is continuous over all BSs and implicitly realizes association via power allocation. No term in the PCRB accounts for the discontinuity or the probability of association flips under small location or channel perturbations, so the bound used in the objective is not guaranteed to remain valid for the realized system.

    Authors: We appreciate the referee highlighting this important aspect of the PCRB's applicability. The PCRB in Section III is derived conditional on a fixed association for the duration of the sensing block, with the effective measurement matrix reflecting the BSs assigned to each target. The optimization in Section IV searches over continuous beamforming vectors for all BSs, allowing the power allocation to effectively determine the associations. We concur that the expression lacks explicit modeling of association transition probabilities or discontinuities. In the revised manuscript, we will add a clarification in Sections III and IV stating the per-block fixed-association assumption and include a short robustness discussion or additional simulation to show that the bound remains indicative even under small perturbations. This constitutes a partial revision focused on exposition and validation rather than a fundamental model change. revision: partial

  2. Referee: [Section V] The numerical results (Section V) claim that the PCRB-minimizing beamformer 'properly associate[s] the targets to the suitable BSs' and reduces MSE, yet the manuscript provides no explicit binary association variables, no signaling-cost term, and no sensitivity analysis showing that the NKF update and PCRB remain accurate when associations change. This leaves the central empirical claim unsupported.

    Authors: We acknowledge that the numerical evaluation relies on implicit associations emerging from the beamforming optimization without introducing discrete variables or explicit cost terms for signaling. To better support the claims, we will revise Section V to explicitly describe the post-optimization association rule (e.g., associating a target to the BS with the highest allocated power or SNR above a threshold), add a note on the low signaling overhead in the centralized 6G architecture, and incorporate a sensitivity study that perturbs the associations slightly and evaluates the resulting NKF performance and PCRB accuracy. These changes will provide the requested support for the empirical observations. revision: yes

  3. Referee: [Introduction and Section II] The weakest assumption listed in the problem statement—that targets can be dynamically reassociated without extra overhead or error—is not relaxed or bounded anywhere in the NKF recursion or PCRB expression, yet it is load-bearing for the claim that networked tracking outperforms single-BS tracking.

    Authors: The dynamic reassociation without modeled overhead is indeed a key modeling choice that enables the performance comparison. The NKF recursion and PCRB are formulated under perfect knowledge of the current associations at the central unit. We will update the Introduction and Section II to more prominently discuss this assumption, its rationale in the context of 6G ISAC with centralized processing, and potential practical implications including minimal control signaling. While we do not introduce a full error bound on association mistakes in this work (as it would require integrating an association algorithm), we will note this as a limitation and direction for extension. This is a partial revision to enhance the discussion of assumptions. revision: partial

Circularity Check

0 steps flagged

No circularity: NKF-PCRB-beamforming chain uses standard derivations without self-referential reduction

full rationale

The paper's core chain—designing an NKF for multi-BS tracking, deriving the PCRB under that filter, and optimizing beamforming vectors to minimize the PCRB—is self-contained and follows conventional estimation and optimization techniques applied to the networked setting. No equation reduces a claimed prediction or result to a fitted parameter or prior self-citation by construction; the numerical demonstration that the resulting beamformer implicitly associates targets emerges from the optimization rather than being presupposed in the PCRB expression itself. External benchmarks (standard KF/PCRB literature) remain independent of the paper's fitted values or assumptions about association overhead.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Abstract-only review yields no explicit free parameters, axioms, or invented entities; the work relies on standard Kalman and PCRB machinery applied to the new networked setting.

axioms (1)
  • domain assumption The networked Kalman Filter is suitable for multi-BS based tracking
    Stated as the first design step in the abstract.

pith-pipeline@v0.9.0 · 5481 in / 1229 out tokens · 34719 ms · 2026-05-10T01:28:25.189208+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

38 extracted references · 3 canonical work pages

  1. [1]

    Integrated sensing and communications: Toward dual-func tional wire- less networks for 6G and beyond,

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

    2022

  2. [2]

    An overview of signal processing techniques for joint communication and radar sensing,

    J. A. Zhang, F. Liu, C. Masouros, R. W. Heath, Z. Feng, L. Zh eng, and A. Petropulu, “An overview of signal processing techniques for joint communication and radar sensing,” IEEE J. Sel. Topics Signal Process. , vol. 15, no. 6, pp. 1295–1315, Nov. 2021

    2021

  3. [3]

    Leveraging a variety of anch ors in cellular network for ubiquitous sensing,

    L. Liu, S. Zhang, and S. Cui, “Leveraging a variety of anch ors in cellular network for ubiquitous sensing,” IEEE Commun. Mag. , vol. 62, no. 9, pp. 98–104, Sep. 2024

    2024

  4. [4]

    A survey on fundamental limits of integrated sensing and communicat ion,

    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 communicat ion,” IEEE Commun. Surveys Tuts. , vol. 24, no. 2, pp. 994–1034, 2nd Quart., 2022

    2022

  5. [5]

    m 2TrackFormer: Transformer-based mmWave tracking with lost target re-acq uisition capability,

    T. Li, W. Zhu, S. Zhang, J. Cao, S. Cui, and L. Liu, “m 2TrackFormer: Transformer-based mmWave tracking with lost target re-acq uisition capability,” in Proc. IEEE Int. Conf. Acoust., Speech Signal Process. (ICASSP), May 2026, pp. 1–5

    2026

  6. [6]

    m 3TrackFormer: Transformer-based mmwave multi-target trac king with lost target re-acquisition capability,

    T. Li, W. Zhu, S. Zhang, J. Cao, S. Cui, and L. Liu, “m 3TrackFormer: Transformer-based mmwave multi-target trac king with lost target re-acquisition capability,” 2026. [Onlin e]. Available: https://arxiv.org/abs/2602.18254

    work page arXiv 2026

  7. [7]

    Anch or points assisted uplink sensing in perceptive mobile networ ks,

    Y . Hu, J. Andrew Zhang, K. Wu, W. Deng, and Y . Jay Guo, “Anch or points assisted uplink sensing in perceptive mobile networ ks,” IEEE Trans. Commun., vol. 73, no. 2, pp. 904–920, Feb. 2025

    2025

  8. [8]

    Downlink and uplink cooperative joint communication and s ensing,

    X. Chen, Z. Feng, J. A. Zhang, Z. Wei, X. Y uan, P . Zhang, and J. Peng, “Downlink and uplink cooperative joint communication and s ensing,” IEEE Trans. V eh. Technol., vol. 73, no. 8, pp. 11 318–11 332, Aug. 2024

    2024

  9. [9]

    On the Fundamental Trade-Offs of Time-FrequencyResource Distribution in OFDMA ISAC,

    X.-Y . Wang, S. Y ang, K. Meng, H.-Y . Zhai, and C. Masouros, “On the fundamental trade-offs of time-frequency resource distribution in OFDMA ISAC,” 2024. [Online]. Available: https://arxiv.org/abs/2407.12628

    work page arXiv 2024

  10. [10]

    Cooperative sensing for 6G mobile cell ular networks: Feasibility, performance, and field trial,

    G. Liu, R. Xi, Z. Han, L. Han, X. Zhang, L. Ma, Y . Wang, M. Lo u, J. Jin, Q. Wang, and J. Wang, “Cooperative sensing for 6G mobile cell ular networks: Feasibility, performance, and field trial,” IEEE J. Sel. Areas Commun., vol. 42, no. 10, pp. 2863–2876, Oct. 2024

    2024

  11. [11]

    Deep-learning-based multinode ISAC 4D environmental rec onstruction with uplink-downlink cooperation,

    B. Lu, Z. Wei, H. Wu, X. Zeng, L. Wang, X. Lu, D. Mei, and Z. F eng, “Deep-learning-based multinode ISAC 4D environmental rec onstruction with uplink-downlink cooperation,” IEEE Internet Things J. , vol. 11, no. 24, pp. 39 512–39 526, Oct. 2024

    2024

  12. [12]

    Symbol-level integrated sensing and communication enabl ed multiple base stations cooperative sensing,

    Z. Wei, R. Xu, Z. Feng, H. Wu, N. Zhang, W. Jiang, and X. Y an g, “Symbol-level integrated sensing and communication enabl ed multiple base stations cooperative sensing,” IEEE Trans. V eh. Technol., vol. 73, no. 1, pp. 724–738, Jan. 2024

    2024

  13. [13]

    Coordi nated transmit beamforming for networked ISAC with imperfect CSI and time synchronization,

    X. Y ang, Z. Wei, J. Xu, Y . Fang, H. Wu, and Z. Feng, “Coordi nated transmit beamforming for networked ISAC with imperfect CSI and time synchronization,” IEEE Trans. Wireless Commun. , vol. 23, no. 12, pp. 18 019–18 035, Dec. 2024

    2024

  14. [14]

    Integrated massive communication and target localizatio n in 6G cell- free networks,

    J. Gao, W. Zhu, S. Zhang, Y . Wu, J. Cao, G. Caire, and L. Liu , “Integrated massive communication and target localizatio n in 6G cell- free networks,” IEEE Trans. Wireless Commun., vol. 25, pp. 8498–8515, 2026

    2026

  15. [15]

    Covariance-based imaging and multi-view fusion fo r networked sensing,

    J. Gao, W. Zhu, Y . Hu, S. Zhang, J. Cao, Y . Wu, G. Caire, and L. Liu, “Covariance-based imaging and multi-view fusion fo r networked sensing,” 2025. [Online]. Available: https://arxiv.org/ abs/2511.14490

    work page arXiv 2025

  16. [16]

    Bar-Shalom, X

    Y . Bar-Shalom, X. Li, and T. Kirubarajan, Estimation with Applications to Tracking and Navigation: Theory Algorithms and Software . New Y ork, NY , USA: Wiley, 2004

    2004

  17. [17]

    Design of an interacting multi ple model algorithm for air traffic control tracking,

    X. Li and Y . Bar-Shalom, “Design of an interacting multi ple model algorithm for air traffic control tracking,” IEEE Trans. Control Syst. Technol., vol. 1, no. 3, pp. 186–194, Sep. 1993

    1993

  18. [18]

    V ariable dimension filt er for maneu- vering target tracking,

    Y . Bar-Shalom and K. Birmiwal, “V ariable dimension filt er for maneu- vering target tracking,” IEEE Trans. Aerosp. Electron. Syst., vol. AES-18, no. 5, pp. 621–629, Sep. 1982

    1982

  19. [19]

    Unscented filtering and nonli near estimation,

    S. Julier and J. Uhlmann, “Unscented filtering and nonli near estimation,” Proc. IEEE , vol. 92, no. 3, pp. 401–422, Mar. 2004

    2004

  20. [20]

    Gaussian filters for nonlinear filte ring problems,

    K. Ito and K. Xiong, “Gaussian filters for nonlinear filte ring problems,” IEEE Trans. Autom. Control , vol. 45, no. 5, pp. 910–927, May 2000

    2000

  21. [21]

    Single-target real-time passive WiFi tracking,

    Z. Wang, J. A. Zhang, M. Xu, and Y . J. Guo, “Single-target real-time passive WiFi tracking,” IEEE Trans. Mobile Comput. , vol. 22, no. 6, pp. 3724–3742, Jun. 2023

    2023

  22. [22]

    Cognitive radar for target t racking in mul- tipath scenarios,

    P . Chavali and A. Nehorai, “Cognitive radar for target t racking in mul- tipath scenarios,” in Proc. Int. Conf. W aveform Diversity Des. (WDD) , Sep. 2010, pp. 110–114

    2010

  23. [23]

    UA V- based target tracking: Integrating sensing into communication s ignals,

    J. Wu, W. Y uan, F. Liu, Y . Cui, X. Meng, and H. Huang, “UA V- based target tracking: Integrating sensing into communication s ignals,” in Proc. IEEE/CIC Int. Conf. Commun. China (ICCC W orkshops) , Oct. 2022, pp. 309–313

    2022

  24. [24]

    Seeing is not always believing: ISAC-assisted predictive beam tracking in multipath channels,

    Y . Cui, Q. Zhang, Z. Feng, Q. Wen, Z. Wei, F. Liu, and P . Zha ng, “Seeing is not always believing: ISAC-assisted predictive beam tracking in multipath channels,” IEEE Wireless Commun. Lett. , vol. 13, no. 1, pp. 14–18, Jan. 2024

    2024

  25. [25]

    Scheduling and power alloca tion in a cognitive radar network for multiple-target tracking,

    P . Chavali and A. Nehorai, “Scheduling and power alloca tion in a cognitive radar network for multiple-target tracking,” IEEE Trans. Signal Process., vol. 60, no. 2, pp. 715–729, Feb. 2012

    2012

  26. [26]

    Power and bandwidth alloc ation for multi-target tracking in collocated MIMO radar,

    H. Zhang, B. Zong, and J. Xie, “Power and bandwidth alloc ation for multi-target tracking in collocated MIMO radar,” IEEE Trans. V eh. Technol., vol. 69, no. 9, pp. 9795–9806, Sep. 2020

    2020

  27. [27]

    Prior knowled ge- based simultaneous multibeam power allocation algorithm f or cognitive multiple targets tracking in clutter,

    J. Y an, B. Jiu, H. Liu, B. Chen, and Z. Bao, “Prior knowled ge- based simultaneous multibeam power allocation algorithm f or cognitive multiple targets tracking in clutter,” IEEE Trans. Signal Process., vol. 63, no. 2, pp. 512–527, Jan. 2015

    2015

  28. [28]

    Posterior Cram´ er-Rao bounds for discrete-time nonlinear filtering,

    P . Tichavsky, C. Muravchik, and A. Nehorai, “Posterior Cram´ er-Rao bounds for discrete-time nonlinear filtering,” IEEE Trans. Signal Pro- cess., vol. 46, no. 5, pp. 1386–1396, May 1998

    1998

  29. [29]

    Device-free sensin g in OFDM cellular network,

    Q. Shi, L. Liu, S. Zhang, and S. Cui, “Device-free sensin g in OFDM cellular network,” IEEE J. Sel. Areas Commun. , vol. 40, no. 6, pp. 1838– 1853, Jun. 2022

    2022

  30. [30]

    A hetero geneous 6G networked sensing architecture with active and passive a nchors,

    Q. Wang, L. Liu, S. Zhang, B. Di, and F. C. M. Lau, “A hetero geneous 6G networked sensing architecture with active and passive a nchors,” IEEE Trans. Wireless Commun. , vol. 23, no. 8, pp. 9502–9517, Aug. 2024

    2024

  31. [31]

    Spars ity and compressed sensing in radar imaging,

    L. C. Potter, E. Ertin, J. T. Parker, and M. Cetin, “Spars ity and compressed sensing in radar imaging,” Proc. IEEE , vol. 98, no. 6, pp. 1006–1020, Jun. 2010. 14

    2010

  32. [32]

    Cross-f requency sensing in bistatic ISAC systems,

    Y . Hu, K. Wu, J. A. Zhang, W. Deng, and Y . Jay Guo, “Cross-f requency sensing in bistatic ISAC systems,” IEEE Trans. Wireless Commun. , vol. 25, pp. 681–697, Jan. 2026

    2026

  33. [33]

    ISAC from the s ky: UA V trajectory design for joint communication and target local ization,

    X. Jing, F. Liu, C. Masouros, and Y . Zeng, “ISAC from the s ky: UA V trajectory design for joint communication and target local ization,” IEEE Trans. Wireless Commun., vol. 23, no. 10, pp. 12 857–12 872, Oct. 2024

    2024

  34. [34]

    M. I. Skolnik, Radar Handbook, Third Edition , New Y ork, NY , USA: McGraw-Hill, 2008

    2008

  35. [35]

    Localizing multiple e vents using times of arrival: a parallelized, hierarchical approach to the association problem,

    S. V enkateswaran and U. Madhow, “Localizing multiple e vents using times of arrival: a parallelized, hierarchical approach to the association problem,” IEEE Trans. Signal Process. , vol. 60, no. 10, pp. 5464–5477, Oct. 2012

    2012

  36. [36]

    Multiple sou rce localiza- tion in wireless sensor networks based on time of arrival mea surement,

    H. Shen, Z. Ding, S. Dasgupta, and C. Zhao, “Multiple sou rce localiza- tion in wireless sensor networks based on time of arrival mea surement,” IEEE Trans. Signal Process. , vol. 62, no. 8, pp. 1938–1949, Apr. 2014

    1938

  37. [37]

    S. M. Kay, Fundamentals of Statistical Signal Processing V olume I: Estimation Theory , Englewood Cliffs, NJ, USA: Prentice-Hall, 1993

    1993

  38. [38]

    Determinant maximization with linear matrix inequality constraints,

    L. V andenberghe, S. P . Boyd, and S.-P . Wu, “Determinant maximization with linear matrix inequality constraints,” SIAM J. Matrix Anal. Appl. , vol. 19, pp. 499–533, Apr. 1998

    1998