pith. sign in

arxiv: 2605.02213 · v1 · submitted 2026-05-04 · 📡 eess.SP

Optimal Pilot Pattern Design for LMMSE Channel Estimation in OFDM Systems with Finite Block Size over Doubly Dispersive Channels

Xuyao Yu , Zijun Gong , Zhilu Lai This is my paper

Pith reviewed 2026-05-08 19:21 UTC · model grok-4.3

classification 📡 eess.SP
keywords pilot pattern designLMMSE channel estimationOFDMdoubly dispersive channelsA-optimal selectionheuristic algorithmsfinite block sizechannel estimation error
0
0 comments X

The pith

Heuristic algorithms can find pilot patterns that reduce LMMSE channel estimation error more effectively than rectangular or diamond lattices in finite OFDM grids over doubly dispersive channels.

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

The paper seeks to determine the best positions for a fixed number of pilot symbols in OFDM to minimize estimation error when the wireless channel varies across both time and frequency and the transmission block has limited size. It recasts the placement task as an A-optimal sensor selection problem whose goal is to minimize the trace of the posterior error covariance under the LMMSE criterion. Two practical algorithms are introduced: one relaxes the combinatorial problem to a convex form and applies randomized rounding, while the other builds the pattern through greedy incremental selection; both then apply a local swap refinement step. Simulations on realistic resource-block dimensions show that the resulting patterns produce lower estimation errors than the conventional fixed lattices. If the claim holds, systems could achieve more accurate channel knowledge with the same pilot overhead in high-mobility environments.

Core claim

For finite time-frequency grids in doubly dispersive channels the LMMSE-optimal pilot pattern is obtained by solving an A-optimal sensor selection problem via either convex relaxation followed by randomized rounding or greedy selection, each combined with local swap refinement, and the resulting patterns consistently yield lower mean-square estimation error than rectangular or diamond lattices on practical block sizes.

What carries the argument

A-optimal sensor selection formulation of pilot placement, solved approximately by convex relaxation with randomized rounding or by greedy selection, both followed by local swap refinement.

Load-bearing premise

The proposed heuristics reliably approximate the true A-optimal patterns and the doubly dispersive channel model together with the LMMSE criterion accurately reflect real-world performance on the finite grids considered.

What would settle it

A direct measurement of channel estimation mean-square error on a high-mobility wireless link that shows the proposed patterns produce no lower error than a rectangular lattice of equal pilot density.

Figures

Figures reproduced from arXiv: 2605.02213 by Xuyao Yu, Zhilu Lai, Zijun Gong.

Figure 1
Figure 1. Figure 1: Designed pattern with 8% of pilot budget. view at source ↗
Figure 3
Figure 3. Figure 3: Channel estimation MSE versus pilot density for view at source ↗
Figure 2
Figure 2. Figure 2: MSE versus pilot density for different pilot patterns. view at source ↗
Figure 4
Figure 4. Figure 4: Designed pattern of proposed method with different view at source ↗
read the original abstract

Pilot pattern design over doubly dispersive channels has regained significant research interest, driven by emerging high-mobility applications in 5G-Advanced and 6G systems, as well as recent developments in Orthogonal Time Frequency Space (OTFS) modulation. This paper addresses the design of LMMSE-optimal pilot patterns for OFDM systems over doubly dispersive channels with finite time-frequency grids. We formulate the problem as A-optimal sensor selection and propose two heuristic algorithms, both combining an initialization stage with local swap refinement. The first employs convex relaxation with randomized rounding, while the second uses greedy selection. Simulations on practical resource block dimensions demonstrate that the proposed designs consistently outperform conventional rectangular and diamond lattice patterns.

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

2 major / 1 minor

Summary. The paper claims that formulating LMMSE pilot pattern design over finite doubly dispersive OFDM grids as an A-optimal sensor selection problem, then solving it via two heuristics (convex relaxation plus randomized rounding, and greedy selection, each followed by initialization and local swap refinement), yields patterns that consistently outperform conventional rectangular and diamond lattices, as shown by simulations on practical resource block dimensions.

Significance. If the heuristics are shown to be close to true A-optimality, the work supplies a practical method for improving channel estimation MSE in high-mobility 5G-Advanced and 6G scenarios. The empirical demonstration of gains over standard lattices on finite grids is a useful contribution, even if the underlying optimization techniques are standard.

major comments (2)
  1. [Simulation Results / Algorithm Validation] The central claim that the proposed heuristics produce (near-)optimal patterns rests on simulations showing outperformance over lattices, yet the manuscript provides no comparison of either heuristic against the exact A-optimal solution on small grids where exhaustive search or branch-and-bound is tractable. Without an optimality-gap result, it remains possible that the observed gains are modest or lattice-specific rather than evidence that the heuristics reliably approximate the true optimum.
  2. [Abstract and Simulation Results] The abstract (and presumably the results section) reports only that the designs 'consistently outperform' the baselines without quantitative MSE gains, confidence intervals, exact grid sizes, channel parameters, or SNR ranges. This makes it difficult to judge whether the improvements are load-bearing for the claim of practical superiority.
minor comments (1)
  1. [Problem Formulation] Clarify the precise definition of the A-criterion (trace of the inverse covariance) and its relation to the LMMSE MSE expression early in the formulation section.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive comments, which help improve the clarity and validation of our work on A-optimal pilot pattern design for finite-block OFDM systems. We provide point-by-point responses to the major comments below.

read point-by-point responses

  1. Referee: [Simulation Results / Algorithm Validation] The central claim that the proposed heuristics produce (near-)optimal patterns rests on simulations showing outperformance over lattices, yet the manuscript provides no comparison of either heuristic against the exact A-optimal solution on small grids where exhaustive search or branch-and-bound is tractable. Without an optimality-gap result, it remains possible that the observed gains are modest or lattice-specific rather than evidence that the heuristics reliably approximate the true optimum.

    Authors: We agree that an explicit comparison to the exact A-optimal solution on small grids would provide stronger evidence for the quality of the heuristics. The A-optimal sensor selection problem is combinatorial and NP-hard, rendering exhaustive search or branch-and-bound intractable for the practical resource block sizes considered in the paper. However, to directly address this concern, we will add a new simulation subsection in the revised manuscript that compares both heuristics against the exact optimum (computed via enumeration or branch-and-bound) on small grids (e.g., 4x4 and 5x5 time-frequency blocks) where such computation is feasible. This will report the optimality gaps and confirm that the heuristics achieve near-optimal performance. revision: yes

  2. Referee: [Abstract and Simulation Results] The abstract (and presumably the results section) reports only that the designs 'consistently outperform' the baselines without quantitative MSE gains, confidence intervals, exact grid sizes, channel parameters, or SNR ranges. This makes it difficult to judge whether the improvements are load-bearing for the claim of practical superiority.

    Authors: We acknowledge that the abstract would be strengthened by including specific quantitative details. The full results section already specifies the exact grid sizes (practical 5G resource blocks such as 14 subcarriers by 12 OFDM symbols), channel parameters (including Doppler and delay spreads for doubly dispersive channels), SNR ranges, and provides MSE values with direct comparisons to rectangular and diamond lattices. To improve accessibility, we will revise the abstract to summarize key quantitative outcomes, such as the observed MSE reductions (e.g., X% improvement at specific SNRs) and the simulation setups. revision: yes

Circularity Check

0 steps flagged

No circularity; standard A-optimal formulation with heuristic approximation and simulation validation

full rationale

The paper formulates pilot pattern design as the standard A-optimal sensor selection problem (a known combinatorial criterion) and applies two common heuristic solvers (convex relaxation plus randomized rounding; greedy selection with local refinement). Performance claims rest on direct simulation comparisons of the resulting patterns against rectangular and diamond lattices on finite doubly dispersive grids. No step reduces a claimed prediction or optimality result to a fitted parameter or self-referential definition; no load-bearing self-citations appear; the derivation chain remains independent of its own outputs and is evaluated against external simulation benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

Review based on abstract only; no explicit free parameters, invented entities, or ad-hoc axioms are stated. Standard domain assumptions about LMMSE estimation and doubly dispersive channel statistics are implicit.

axioms (2)
  • domain assumption LMMSE is the appropriate estimator for the channel model
    Invoked as the target performance metric for pilot design.
  • standard math A-optimal design criterion minimizes estimation error variance
    Used to formulate the sensor selection problem.

pith-pipeline@v0.9.0 · 5420 in / 1210 out tokens · 78795 ms · 2026-05-08T19:21:49.355702+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

26 extracted references · 26 canonical work pages

  1. [1]

    K. Dyer. (2025, Aug.) 6g meeting settles on same old air interface. The Mobile Network. [Online]. Available: https://the-mobile-network. com/2025/08/6g-meeting-settles-on-same-old-air-interface/

    work page 2025

  2. [2]

    Bayesian Learning Aided Sparse Channel Estimation for Orthogo- nal Time Frequency Space Modulated Systems,

    S. Srivastava, R. K. Singh, A. K. Jagannatham, and L. Hanzo, “Bayesian Learning Aided Sparse Channel Estimation for Orthogo- nal Time Frequency Space Modulated Systems,”IEEE Trans. Veh. Technol., vol. 70, no. 8, pp. 8343–8348, Aug. 2021

    work page 2021

  3. [3]

    Pilot Pattern Design for Two- Dimensional OFDM Modulations in Time-Varying Frequency- Selective Fading Channels,

    S. He, Q. Zhang, and J. Qin, “Pilot Pattern Design for Two- Dimensional OFDM Modulations in Time-Varying Frequency- Selective Fading Channels,”IEEE Trans. Wireless Commun., vol. 21, no. 2, pp. 1335–1346, Feb. 2022

    work page 2022

  4. [4]

    Time-Frequency Domain Channel Esti- mation for OTFS Systems,

    H.-T. Sheng and W.-R. Wu, “Time-Frequency Domain Channel Esti- mation for OTFS Systems,”IEEE Trans. Wireless Commun., vol. 23, no. 2, pp. 937–948, Feb. 2024

    work page 2024

  5. [5]

    Pilot tone selection for channel estimation in a mobile OFDM system,

    R. Negi and J. Cioffi, “Pilot tone selection for channel estimation in a mobile OFDM system,”IEEE Trans. Consumer Electron., vol. 44, no. 3, pp. 1122–1128, Aug. 1998

    work page 1998

  6. [6]

    Optimal placement of training for frequency-selective block-fading channels,

    S. Adireddy, Lang Tong, and H. Viswanathan, “Optimal placement of training for frequency-selective block-fading channels,”IEEE Trans. Inform. Theory, vol. 48, no. 8, pp. 2338–2353, Aug. 2002

    work page 2002

  7. [7]

    Capacity Maximizing MMSE-Optimal Pilots for Wireless OFDM Over Frequency-Selective Block Rayleigh- Fading Channels,

    S. Ohno and G. Giannakis, “Capacity Maximizing MMSE-Optimal Pilots for Wireless OFDM Over Frequency-Selective Block Rayleigh- Fading Channels,”IEEE Trans. Inform. Theory, vol. 50, no. 9, pp. 2138–2145, Sep. 2004

    work page 2004

  8. [8]

    P. P. Vaidyanathan,Multirate Systems and Filter Banks, ser. Prentice- Hall Signal Processing Series. Englewood Cliffs, NJ: Prentice Hall, 1993

    work page 1993

  9. [9]

    Pilot assisted channel estimation for OFDM in mobile cellular systems,

    F. Tufvesson and T. Maseng, “Pilot assisted channel estimation for OFDM in mobile cellular systems,” in1997 IEEE 47th Vehicular Technology Conference. Technology in Motion, vol. 3. Phoenix, AZ, USA: IEEE, 1997, pp. 1639–1643

    work page 1997

  10. [10]

    Pilot patterns for channel estimation in OFDM,

    M. F.-G. Garc ´ıa, S. Zazo, and J. P ´aez-Borrallo, “Pilot patterns for channel estimation in OFDM,”Electron. Lett., vol. 36, no. 12, pp. 1049–1050, Jun. 2000

    work page 2000

  11. [11]

    Channel estimation techniques based on pilot arrangement in OFDM systems,

    S. Coleri, M. Ergen, A. Puri, and A. Bahai, “Channel estimation techniques based on pilot arrangement in OFDM systems,”IEEE Trans. on Broadcast., vol. 48, no. 3, pp. 223–229, Sep. 2002

    work page 2002

  12. [12]

    Optimal pilot placement for channel tracking in OFDM,

    M. Dong, L. Tong, and B. Sadler, “Optimal pilot placement for channel tracking in OFDM,” inMILCOM 2002. Proceedings. Anaheim, CA, USA: IEEE, 2002, pp. 602–606 vol.1

    work page 2002

  13. [13]

    Pilot-symbol-aided channel estimation for OFDM in wireless systems,

    Y . Li, “Pilot-symbol-aided channel estimation for OFDM in wireless systems,”IEEE Trans. Veh. Technol., vol. 49, no. 4, pp. 1207–1215, Jul. 2000

    work page 2000

  14. [14]

    Optimum pilot pattern for channel estimation in OFDM systems,

    J.-W. Choi and Yong-Hwan Lee, “Optimum pilot pattern for channel estimation in OFDM systems,”IEEE Trans. Wireless Commun., vol. 4, no. 5, pp. 2083–2088, Sep. 2005

    work page 2083

  15. [15]

    Optimal Training and Pilot Pattern Design for OFDM Systems in Rayleigh Fading,

    W. Zhang, X.-G. Xia, and P. C. Ching, “Optimal Training and Pilot Pattern Design for OFDM Systems in Rayleigh Fading,”IEEE Trans. on Broadcast., vol. 52, no. 4, pp. 505–514, Dec. 2006

    work page 2006

  16. [16]

    An Efficient Design of Doubly Selective Channel Estimation for OFDM Systems,

    C. Shin, J. Andrews, and E. Powers, “An Efficient Design of Doubly Selective Channel Estimation for OFDM Systems,”IEEE Trans. Wireless Commun., vol. 6, no. 10, pp. 3790–3802, Oct. 2007

    work page 2007

  17. [17]

    Pilot pattern design scheme with branch and bound in PSA-OFDM system,

    S. Wang, S. Gao, and W. Yang, “Pilot pattern design scheme with branch and bound in PSA-OFDM system,”J Comb Optim, vol. 45, no. 4, p. 110, May 2023

    work page 2023

  18. [18]

    Pilot Pattern Design for Deep Learning-Based Channel Estimation in OFDM Systems,

    M. Soltani, V . Pourahmadi, and H. Sheikhzadeh, “Pilot Pattern Design for Deep Learning-Based Channel Estimation in OFDM Systems,” IEEE Wireless Commun. Lett., vol. 9, no. 12, pp. 2173–2176, Dec. 2020

    work page 2020

  19. [19]

    Pruning the Pilots: Deep Learning- Based Pilot Design and Channel Estimation for MIMO-OFDM Sys- tems,

    M. B. Mashhadi and D. Gunduz, “Pruning the Pilots: Deep Learning- Based Pilot Design and Channel Estimation for MIMO-OFDM Sys- tems,”IEEE Trans. Wireless Commun., vol. 20, no. 10, pp. 6315–6328, Oct. 2021

    work page 2021

  20. [20]

    PD- CEViT: A Novel Pilot Pattern Design and Channel Estimation Net- work for OFDM Systems,

    F. Liu, P. Jiang, J. Zhang, W. Wang, C.-K. Wen, and S. Jin, “PD- CEViT: A Novel Pilot Pattern Design and Channel Estimation Net- work for OFDM Systems,”IEEE Trans. Commun., vol. 73, no. 6, pp. 4363–4377, Jun. 2025

    work page 2025

  21. [21]

    Characterization of Randomly Time-Variant Linear Chan- nels,

    P. Bello, “Characterization of Randomly Time-Variant Linear Chan- nels,”IEEE Trans. Commun., vol. 11, no. 4, pp. 360–393, Dec. 1963

    work page 1963

  22. [22]

    V . V . Fedorov,Theory of Optimal Experiments, ser. Probability and Mathematical Statistics : A Series of Monographs and Textbooks. New York: Academic Press, 1972, no. 12

    work page 1972

  23. [23]

    Pukelsheim,Optimal Design of Experiments, ser

    F. Pukelsheim,Optimal Design of Experiments, ser. Classics in Ap- plied Mathematics. Philadelphia, Pa: Society for Industrial and Ap- plied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104), 2006, no. 50

    work page 2006

  24. [24]

    S. P. Boyd and L. Vandenberghe,Convex Optimization. Cambridge, UK ; New York: Cambridge University Press, 2004

    work page 2004

  25. [25]

    Sensor Selection via Convex Optimization,

    S. Joshi and S. Boyd, “Sensor Selection via Convex Optimization,” IEEE Trans. Signal Process., vol. 57, no. 2, pp. 451–462, Feb. 2009

    work page 2009

  26. [26]

    Dependent rounding and its applications to approximation algorithms,

    R. Gandhi, S. Khuller, S. Parthasarathy, and A. Srinivasan, “Dependent rounding and its applications to approximation algorithms,”J. ACM, vol. 53, no. 3, pp. 324–360, May 2006

    work page 2006