pith. sign in

arxiv: 2507.14937 · v4 · submitted 2025-07-20 · 📡 eess.SP

Phase-optimised linearly-constrained minimum-variance beamformers

Hugh L Kennedy This is my paper

Pith reviewed 2026-05-19 04:22 UTC · model grok-4.3

classification 📡 eess.SP
keywords LCMV beamformergroup delay optimizationnoise power minimizationprocessing delayVHF communicationUHF radarbeamforming
0
0 comments X

The pith

The group delay of an LCMV beamformer can be chosen to minimize either noise power or processing delay.

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

This paper proposes a procedure to determine the optimal group-delay for a Linearly-Constrained Minimum-Variance beamformer. The optimal delay is selected either to minimize the noise power at the output or to minimize the overall processing delay. This approach is tested in simulated VHF communication and UHF bistatic radar scenarios. A reader would care because it offers a new degree of freedom in beamformer design that can improve performance without altering the core constraints or weight calculation method.

Core claim

A procedure is proposed for selecting the optimal group-delay of an LCMV beamformer. Two selection criteria are given: one that minimizes noise power and one that minimizes processing delay. The value of this design choice is shown through application to VHF communication and UHF radar beamforming.

What carries the argument

The group-delay parameter, optimized after determining the linear constraints and minimum-variance weights.

If this is right

  • Minimizing noise power with the optimal delay reduces interference in the beamformer output.
  • Minimizing processing delay allows for lower latency in time-critical applications.
  • The method applies to both communication systems and radar systems without requiring changes to the underlying LCMV formulation.

Where Pith is reading between the lines

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

  • If the optimal delay selection works across different array geometries, it could simplify beamformer tuning in practice.
  • Extending this to adaptive beamformers might allow real-time delay adjustment based on changing noise conditions.

Load-bearing premise

The group delay acts as an independent design variable that can be set after fixing the constraints and solving for the minimum-variance weights.

What would settle it

Measurement of output noise power in a VHF communication setup where the optimized delay fails to yield lower noise than a conventional fixed delay choice would falsify the benefit of the procedure.

read the original abstract

A procedure for the determination of the optimal group-delay of a Linearly-Constrained Minimum-Variance (LCMV) beamformer is proposed. Two ways of selecting the optimal delay are recommended: the first is the solution that minimizes the noise power; the second is the solution that minimizes the processing delay. The potential of this hitherto unexplored degree of design freedom is investigated using simulated Very-High-Frequency (VHF) communication, and Ultra-High-Frequency (UHF) bistatic radar, applications

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

1 major / 2 minor

Summary. The paper proposes a procedure to determine the optimal group delay for a Linearly-Constrained Minimum-Variance (LCMV) beamformer. The method embeds candidate group delays directly into the desired-response vector f of the standard closed-form LCMV solution w = R^{-1}C(C^H R^{-1}C)^{-1}f. For each discrete delay value the linear constraints are updated and the weights recomputed; the optimal delay is then selected either as the solution that minimizes output noise power or as the solution that minimizes processing delay. The approach is evaluated through simulations in VHF communication and UHF bistatic radar scenarios.

Significance. If the central derivation holds, the work identifies a previously unexplored design degree of freedom within the classical LCMV framework. The two concrete selection rules (minimum noise power and minimum processing delay) are practical and remain inside the standard formulation without requiring a new optimization problem. The simulation results in application-relevant domains provide initial evidence of utility, though the strength of the contribution depends on the robustness of the reported performance gains.

major comments (1)
  1. [§3] §3, Eq. (8): the update of the constraint vector f for each candidate delay is presented as a direct substitution, but it is not shown whether the resulting family of solutions remains feasible when the underlying signal model includes delay-dependent phase terms; a short proof or counter-example would strengthen the claim that no re-derivation of the LCMV weights is required beyond the substitution.
minor comments (2)
  1. [Figure 2] Figure 2: the legend does not distinguish the two selection criteria clearly; adding a second panel or explicit markers would improve readability.
  2. [Abstract] The abstract states that the potential is 'investigated' but does not quantify the improvement; a sentence summarizing the dB gain or delay reduction observed in the simulations would help readers assess practical impact.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the constructive comment and positive overall assessment. We address the major comment below and have revised the manuscript to strengthen the presentation of the constraint update.

read point-by-point responses

  1. Referee: [§3] §3, Eq. (8): the update of the constraint vector f for each candidate delay is presented as a direct substitution, but it is not shown whether the resulting family of solutions remains feasible when the underlying signal model includes delay-dependent phase terms; a short proof or counter-example would strengthen the claim that no re-derivation of the LCMV weights is required beyond the substitution.

    Authors: We thank the referee for highlighting this point. In the standard LCMV derivation the closed-form solution w = R^{-1}C(C^H R^{-1}C)^{-1}f satisfies the linear constraints C^H w = f exactly for any f (provided C has full column rank). The group delay enters only through a linear phase factor applied to each entry of f; this modification leaves both C and the algebraic validity of the solution unchanged. Any delay-dependent phase terms present in the underlying signal model are already embedded in the steering vectors that constitute the columns of C, which remain fixed. Consequently the substitution into f requires no re-derivation of the weights. We have added a short paragraph together with a brief proof of constraint satisfaction to the revised Section 3. revision: yes

Circularity Check

0 steps flagged

No significant circularity in the LCMV group-delay optimization

full rationale

The manuscript embeds candidate group delays directly into the desired-response vector f of the classical LCMV closed-form solution w = R^{-1}C(C^H R^{-1}C)^{-1}f, recomputes weights for each discrete delay after updating the linear constraints, and then selects the optimum by applying an external rule (minimum output noise power or minimum processing delay). This construction operates entirely inside the standard LCMV framework; no quantity is fitted to a subset and then renamed as a prediction, no self-citation supplies a load-bearing uniqueness theorem, and no ansatz is smuggled in. The procedure therefore introduces an independent design choice rather than reducing any claimed result to its own inputs by definition.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the domain assumption that group delay remains a free parameter after the LCMV constraints are imposed. No free parameters or invented entities are visible from the abstract alone.

axioms (1)
  • domain assumption Group delay can be varied independently while preserving the linear constraints and minimum-variance property of the LCMV beamformer.
    This premise is required for the proposed optimization procedure to be valid.

pith-pipeline@v0.9.0 · 5596 in / 1153 out tokens · 28918 ms · 2026-05-19T04:22:57.867217+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

15 extracted references · 15 canonical work pages

  1. [1]

    L.Van Trees, Optimum Array Processing, Wiley-Interscience, New York, 2002

    H. L.Van Trees, Optimum Array Processing, Wiley-Interscience, New York, 2002

    work page 2002

  2. [2]

    An algorithm for linearly constrained adaptive array processing

    O. L. Frost, “An algorithm for linearly constrained adaptive array processing”, in Proceedings of the IEEE, vol. 60, no. 8, pp. 926-935, Aug. 1972. https://doi.org/10.1109/PROC.1972.8817

    work page doi:10.1109/proc.1972.8817 1972

  3. [3]

    Elimination of Pre -Steering Delays in Space -Time Broadband Beamforming Using Frequency Domain Constraints

    R. Ebrahimi and S . R. Seydnejad. “Elimination of Pre -Steering Delays in Space -Time Broadband Beamforming Using Frequency Domain Constraints.” IEEE Communications Letters vol. 17, no. 4 , pp. 769–72, 2013. https://doi.org/10.1109/LCOMM.2013.022713.130090

    work page doi:10.1109/lcomm.2013.022713.130090 2013

  4. [4]

    An Efficient Broadband Adaptive Beamformer without Presteering Delays

    Zhang Ming Xiaojian Wang and Anxue Zhang. “An Efficient Broadband Adaptive Beamformer without Presteering Delays.” Sensors (Basel, Switzerland) vol. 21, no. 4, p 1100, 2021. https://doi.org/10.3390/s21041100

    work page doi:10.3390/s21041100 2021

  5. [5]

    Adaptive Wideband Beamforming With Frequency Invariance Constraints

    Yong Zhao, Wei Liu, and R J Langley. “Adaptive Wideband Beamforming With Frequency Invariance Constraints” IEEE Transactions on Antennas and Propagation, vol. 59, no. 4, pp. 1175–84, 2011. https://doi.org/10.1109/TAP.2011.2110630

    work page doi:10.1109/tap.2011.2110630 2011

  6. [6]

    Minimum Variance Beamforming with Phase-Independent Derivative Constraints

    C.-Y. Tseng, “Minimum Variance Beamforming with Phase-Independent Derivative Constraints”, IEEE Transactions on Antennas and Propagation, vol. 40, no. 3, pp. 285–94, 1992. https://doi.org/10.1109/8.135471

    work page doi:10.1109/8.135471 1992

  7. [7]

    Digital Adaptive Wideband Beamforming without Pre-Steering Delay Processing

    Julan Xie, Zishu He, Shenyu Rao, Ziyang Cheng and Huiyong Li. “Digital Adaptive Wideband Beamforming without Pre-Steering Delay Processing” Digital Signal Processing, vol. 132, 103813, 2023. https://doi.org/10.1016/j.dsp.2022.103813

    work page doi:10.1016/j.dsp.2022.103813 2023

  8. [8]

    Optimal Array Phase Center Study for Frequency -Domain Constrained Space- Time Broadband Beamforming

    Yang Wang, Haiyun Xu, Bin Wang and Minglei Sun. “Optimal Array Phase Center Study for Frequency -Domain Constrained Space- Time Broadband Beamforming”, IEEE Access, vol. 11, pp. 1–1, 2023. https://doi.org/10.1109/ACCESS.2022.3233645

    work page doi:10.1109/access.2022.3233645 2023

  9. [9]

    Adaptive Broadband Frequency Invariant Beamforming Using Nulling -Broadening and Frequency Constraints

    Shurui Zhang, Qiong Gu, Hui Sun, Weixing Sheng and Thia Kirubarajan , “Adaptive Broadband Frequency Invariant Beamforming Using Nulling -Broadening and Frequency Constraints ”, Signal Processing , vol. 195, 108461, 2022. https://doi.org/10.1016/j.sigpro.2022.108461

    work page doi:10.1016/j.sigpro.2022.108461 2022

  10. [10]

    Convolution Constraints for Broadband Antenna Arrays

    L.C. Godara, and M.R.S Jahromi. “Convolution Constraints for Broadband Antenna Arrays ”, IEEE Transactions on Antennas and Propagation, vol. 55, no. 11, pp. 3146–54, 2007. https://doi.org/10.1109/TAP.2007.908823

    work page doi:10.1109/tap.2007.908823 2007

  11. [11]

    Broadband Spatial Spectrum Estimation Based on Space -Time Minimum Variance Distortionless Response and Frequency Derivative Constraints

    Yang Wang, Haiyun Xu, Bin Wang, and Minglei Sun. “Broadband Spatial Spectrum Estimation Based on Space -Time Minimum Variance Distortionless Response and Frequency Derivative Constraints ”, IEEE Access vol. 11, 1–1, 2023. https://doi.org/10.1109/ACCESS.2023.3258978

    work page doi:10.1109/access.2023.3258978 2023

  12. [12]

    Recursive Optimal Filters for Smoothing and Prediction with Instantaneous Phase and Frequency Estimation Applications

    H.L. Kennedy, “Recursive Optimal Filters for Smoothing and Prediction with Instantaneous Phase and Frequency Estimation Applications” Circuits Syst Signal Process, (to appear), 2025. https://doi.org/10.1007/s00034-025-03155-0

    work page doi:10.1007/s00034-025-03155-0 2025

  13. [13]

    Maximally Flat Low-Pass FIR Filters with Reduced Delay

    I.W Selesnick and C.S Burrus. “Maximally Flat Low-Pass FIR Filters with Reduced Delay”, IEEE Transactions on Circuits and Systems. 2, Analog and Digital Signal Processing, vol. 45, no. 1, pp. 53–68, 1998. https://doi.org/10.1109/82.659456

    work page doi:10.1109/82.659456 1998

  14. [14]

    On the Approximation Problem in Nonrecursive Digital Filter Design

    O. Herrmann, “On the Approximation Problem in Nonrecursive Digital Filter Design ”, IEEE Transactions on Circuit Theory , vol. 18, no. 3, pp 411–13, 1971. https://doi.org/10.1109/TCT.1971.1083275

    work page doi:10.1109/tct.1971.1083275 1971

  15. [15]

    Performance Analysis of OTFS Signal with Different Pulse Shapes for JCR Systems

    Olivia Zacharia, and Vani Devi M. “Performance Analysis of OTFS Signal with Different Pulse Shapes for JCR Systems” in Proc. IEEE 18th International Colloquium on Signal Processing & Applications (CSPA) , pp. 24–29, 2022. https://doi.org/10.1109/CSPA55076.2022.9781902

    work page doi:10.1109/cspa55076.2022.9781902 2022