Pith. sign in

REVIEW 3 major objections 6 minor 3 cited by

A Tensor-Structured Approach to Dynamic Channel Prediction for Massive MIMO Systems with Temporal Non-Stationarity

T0 review · 3 major / 6 minor · reviewed 2026-08-11 · deepseek-v4-flash

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

Pith's one-line read A tensor-structured predictor that splits channel dynamics into fast intra-frame and slow inter-frame parts can keep massive MIMO accurate at 60–120 km/h, outperforming all tested baselines.

desk verdict Solid, novel tensor-based channel predictor whose headline gains need error bars and the missing hyperparameters before I'd believe the margins. read the letter →

arxiv 2412.06713 v2 pith:A2C4QWXL submitted 2024-12-09 eess.SP

Hongwei Hou , Yafei Wang , Yiming Zhu , Xinping Yi , Wenjin Wang , Dirk T. M. Slock , Shi Jin This is my paper · ORCID
classification eess.SP
keywords massiveMIMOchannelpredictiontemporalnon-stationaritytensordecompositionvariationalfreeenergyMarkovrandomfieldDopplerdomainmodelingonlineinference
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

In a 60–120 km/h mobile scenario, the channel state that a massive MIMO base station needs for precoding ages within milliseconds, because Doppler shifts and evolving scatterers make the channel statistics non-stationary. The paper's central claim is that this hard problem becomes tractable if the channel is treated as locally stationary inside short sliding frames: fast intra-frame dynamics are captured by a Doppler-domain tensor model, while slow inter-frame evolution is captured by Markov/autoregressive processes on the sparse angle-delay-Doppler coefficients. The paper builds a complete Bayesian model with Markov-random-field support priors and tensor-coupled Gaussian power priors, casts prediction as variational free energy minimization, and derives an online, tensor-structured algorithm (Online TS-DCP). On simulated urban channels, the paper reports that for the first future non-pilot and pilot symbols the algorithm reaches TNMSEs (time-averaged normalized mean square errors) below −16 dB and −11 dB at 60 km/h and below −15 dB and −9 dB at 120 km/h, levels it says no compared benchmark attains. If this holds, high-mobility massive MIMO can operate on predictions instead of stale CSI, and the same dual-timescale tensor machinery could transfer to other rapidly varying channel models.

What carries the argument

The load-bearing object is the sliding-frame Tucker model of the channel, together with the variational free energy objective that turns it into an algorithm. Each frame's spatial-frequency-temporal channel tensor is expressed as a low-dimensional ADD-domain core multiplied along four modes by steering matrices parameterized by angle, delay, and Doppler grids; the grids carry small learned perturbations to handle off-grid paths. Short-timescale correlation is carried by the Doppler factor matrix inside a frame, while long-timescale correlation is carried by first-order Markov dynamics on the binary support tensor and an AR-type dynamics on the complex-valued hidden value tensor across frames. Clustered scattering is encoded through high-order neighbor interactions: a Markov random field on support and a tensor-coupled Gaussian distribution on power. The inference machinery is the dual-layer variational free energy minimization: an inner layer alternates between a multi-linear observation module and a structured prior module, using Bethe-style beliefs and relaxed moment constraints, and an outer layer learns perturbation parameters and hyperparameters. The tensor structure makes all iterations act mode-by-mode on the ADD core, reducing per-iteration complexity from $O(T N_h^2 N_v^2 N_{sc}^2 N_{sym}^2)$ to $O(T N_h N_v N_{sc} N_{sym}(N_h+N_v+N_{sc}+N_{sym}))$.

What would settle it

Generate or record a high-mobility channel where a dominant scatterer appears or disappears, or the terminal turns sharply, within a single frame, so that angles and Doppler change measurably inside the roughly 4 ms window; if Online TS-DCP's TNMSE advantage over the AR/Prony baselines collapses (for example, if the reported −16 dB/−11 dB values climb above −10 dB), the locally-stationary frame assumption is the broken link.

Watch

Extended reading notes

Core claim

On the paper's own terms, the discovery is that temporal non-stationarity does not have to be modeled as one monolithic time-varying process. Because physical path parameters vary smoothly, each short frame is approximately stationary, so the channel tensor $H_{n_F}$ in the spatial-frequency-temporal domain can be written as a Tucker decomposition with an angle-delay-Doppler core $G_{n_F}$ and factor matrices built from angle, delay, and Doppler grids: $H_{n_F}=G_{n_F}\times_1 A_h(\tilde\theta)\times_2 A_v(\tilde\phi)\times_3 B(\tilde\tau)\times_4 C(\tilde\nu)$. Off-grid errors are absorbed by learned perturbation parameters on the grids. The support and power of the ADD-domain core are given structured priors—a Markov random field with high-order neighbors for sparsity, and a tensor-coupled Gaussian distribution for power—so clustered scattering becomes a modeling asset rather than a nuisance. Minimizing variational free energy with a factorized trial belief splits the problem into an inner online per-frame inference and an outer hyperparameter/perturbation-learning layer, yielding the Online TS-DCP algorithm. The paper's headline numerical claim is that this algorithm predicts the first future non-pilot and pilot symbols with TNMSE below −16 dB and −11 dB at 60 km/h and below −15 dB and −9 dB at 120 km/h, which it states is unattainable by all compared algorithms.

Load-bearing premise

The argument rests on the premise that inside one sliding frame—a few milliseconds of pilot symbols—the physical path parameters (angles, delays, and Doppler shifts) stay nearly constant, so a fixed set of Doppler frequencies accurately describes the channel within the frame.

Editorial extensions

If this is right

  • At 60 km/h, the first predicted non-pilot symbol can be delivered with TNMSE below −16 dB, and the first predicted pilot symbol below −11 dB; at 120 km/h the corresponding figures are below −15 dB and −9 dB, gaps the paper says no benchmark closes.
  • Prediction runs online in a sliding-frame manner, so the base station can keep updating its channel knowledge as new pilot symbols arrive rather than reprocessing the whole history.
  • Because the grids are corrected by learned perturbation parameters, the method does not require exact knowledge of angles, delays, or Doppler frequencies to reach the reported accuracy.
  • The tensor-structured operations reduce the dominant computational cost to a sum of modewise products, which is the difference between practical real-time implementation and prohibitive matrix-vector inference for large arrays.
  • Even simplified variants of the algorithm—with pre-sampled grids or unstructured independent priors—still outperform all baselines, indicating that the Doppler-domain sliding-frame modeling, not the additional priors alone, is what carries the performance gain.

Reading between the lines

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

  • The same dual-timescale decomposition should transfer to frequency-division duplex downlink prediction and to higher carrier bands, where Doppler scales with frequency; the price would be shorter frames or more frames per second to preserve local stationarity.
  • The reported results come from simulated channels with maintained spatial consistency; a natural stress test is a real measurement campaign with abrupt scatterer occlusion or sharp vehicle turns, where the intra-frame stationarity premise is harder to satisfy.
  • Because the VFE framework treats message-passing rules as design choices, the MRF/TCGD priors could in principle be replaced or augmented by learned priors trained on channel data, provided the online per-frame structure is preserved.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

3 major / 6 minor

Summary. The paper proposes a tensor-structured dynamic channel prediction (TS-DCP) method for massive MIMO-OFDM systems under temporally non-stationary channels. The channel is represented by a Tucker model whose factor matrices are parameterized by angle-delay-Doppler grids, and a sliding frame structure separates short-timescale Doppler correlations from long-timescale Markov/AR correlations. The authors add Markov random field and tensor-coupled Gaussian priors to capture clustered-scattering structure, formulate channel prediction as variational free energy minimization, and derive an online dual-layer algorithm whose inner layer alternates between a multilinear observation module and a structured-prior module. The outer layer learns off-grid perturbation parameters and hyperparameters. Numerical simulations using QuaDRiGa at 60 and 120 km/h compare the proposed algorithm with four benchmarks and two ablated variants, reporting large TNMSE gains.

Significance. If the reported gains are reproducible, this is a substantial contribution: it provides a coherent tensor probabilistic model with automatic rank treatment, unifies several message-passing rules under a VFE/Bethe perspective, and gives a complexity reduction relative to unstructured matrix-vector processing. The inclusion of ablated variants (PG and UIP) is a genuine strength because it isolates the contributions of perturbation learning and structured priors. The main weakness is empirical: the headline claim in Section V-C2 rests on unreported simulation details and on curves without error bars, so the magnitude and statistical reliability of the gains cannot currently be verified. The local-stationarity assumption is not the main issue: from Table I the frame duration is about 4 ms, giving a Doppler resolution around 286 Hz, while the Doppler drift at 60-120 km/h is only about 0.1-1 Hz, so a fixed Doppler spectrum inside a frame is physically plausible. The central algorithmic derivation is plausible and the appendices supply derivations, but the missing reproducibility evidence prevents acceptance on the current manuscript.

major comments (3)
  1. [Section V-C2, Figs. 6-8] The headline claim that Online TS-DCP achieves TNMSE below -16 dB/-11 dB at 60 km/h and below -15 dB/-9 dB at 120 km/h, described as 'unattainable by all other algorithms', is not statistically supported. The paper reports no number of independent QuaDRiGa realizations or seeds, no error bars, and no confidence intervals; the curves appear to represent single trajectories. Please provide Monte Carlo repetitions over independent channel realizations and report the mean and variance (or confidence intervals) of the TNMSE metric, and quantify the spread of the claimed margins.
  2. [Section V-A, Table I, and Algorithm 3] Key simulation hyperparameters are omitted: the ADD grid sizes K_h, K_v, K_de, K_do in (6a)-(6d), the MRF coupling strength gamma in (14), the Gaussian-sum threshold in Section IV-A3, the inner iteration count T, the number of frames NF used for hyperparameter learning, and the initialization/update details for M, L, V and the perturbation parameters. Since Section III states that the multi-linear rank is crucial, omitting the grid sizes is not a cosmetic issue. Please add a complete configuration table and a sensitivity analysis, at least over the grid sizes and gamma, to demonstrate that the reported margins are not configuration-specific.
  3. [Section V-A2 and V-C] The benchmark hyperparameters are not specified: the AR order P for VKF, the rank R and iteration count for FIT, the model order or window sizes for PAD and MPAD, and the interpolation settings used for non-pilot symbols. Without these values the comparison cannot be reproduced or checked for fairness. Please report the exact benchmark configurations used and, if possible, provide a reproducibility supplement or code release for the simulation.
minor comments (6)
  1. [Throughout] There are numerous typos: 'Prediciton' in the title, 'Paramter' in Table I, 'bencmarks' in Section V, 'sinde' in Section IV-A1, 'annd' in Proposition 1, and 'groud-truth' in (49).
  2. [Algorithm 1, line 12] The expression for N G,bG nF uses the undefined symbol 'U R,bR nF'; this should presumably be 'U H,bH nF' or should be defined explicitly.
  3. [Eq. (46b)] Eq. (46b) writes |\hat L^*|^{\odot 2} while \hat L is treated as a real hyperparameter in (15) and (75); please make the real/complex status of \hat L consistent throughout.
  4. [References [39], [60]] Reference [60] is cited as 3GPP TR 38.211 but the description 'Study on channel model for frequencies from 0.5 to 100 GHz' corresponds to TR 38.901; please correct the reference and avoid duplication with [39].
  5. [Section V-B] The complexity simplification assumes that each ADD domain dimension is of the same order as the corresponding SFT domain dimension; this assumption should be stated as an explicit condition, together with the grid sizes used in the simulations, so that the simplified complexity in Table II can be checked.
  6. [Section IV-A3] The threshold-based Gaussian sum approximation is only referenced to [55]; a brief description of the threshold or of the approximation actually implemented in Algorithm 3 would improve reproducibility.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: the predicted channels are extrapolations of an estimated ADD-domain tensor to unobserved symbol times, not refits of the prediction targets; the few self-citations are non-load-bearing.

full rationale

The central claim is an empirical performance comparison, and the prediction target never enters the estimation objective. Channels for future non-pilot and pilot symbols are computed by (48), H_CP = Ghat x1 A_h(...) x2 A_v(...) x3 B(...) x4 C_tilde(...), where Ghat and the perturbation/grid parameters are estimated only from pilot observations through the VFE/online inference in Section IV. The future symbol times enter only through the deterministic Doppler-to-time factor matrix C_tilde, so the quoted TNMSE gains are genuine extrapolation rather than a fit renamed as prediction. Hyperparameters (M, L, V, gamma) and perturbation parameters are learned online from historical frames, e.g., eqs. (43)-(47), rather than set from the benchmark outputs, and all benchmarks are evaluated on the same QuaDRiGa channel data, so the comparison is not forced by construction. The short-timescale stationarity assumption is cited to [33]-[35]; although [35] is an author's prior work, it is accompanied by independent external surveys [33],[34], and the assumption is not presented as a uniqueness theorem or as an unverified input that the derivation merely re-exports. Other author self-citations ([10], [43], [59]) support only motivation or implementation details and are not load-bearing for the prediction claim. The main weakness is instead an empirical reproducibility gap: the simulations report no Monte Carlo repetitions, confidence intervals, or key settings (tensor grid sizes K_h, K_v, K_de, K_do, MRF coupling gamma, iteration count T, frame count NF), which reduces confidence in the Section V-C2 margins but is not circularity under the definitions used here.

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

The model rests on a small number of physical assumptions, namely local stationarity, low-rank Tucker structure, and clustered scattering, and on a larger set of tuning parameters such as grid sizes, MRF strength, neighbor sets, and thresholds. The learning rules estimate M, L, V, and perturbation deltas from data, so the final prediction is several steps removed from first-principles channel physics. The paper introduces no new physical entities.

free parameters (7)
  • ADD grid sizes Kh, Kv, Kde, Kdo = not reported
    The number of angle, delay, and Doppler grids are user-chosen trade-offs; the paper says they are typically set proportional to antenna, subcarrier, and symbol counts but gives no values for the simulations.
  • Hyperparameter V (tensor-coupled Gaussian variance) = learned per element
    V controls the power of the hidden value tensor innovations and is learned by the update in equation (45).
  • Transition factor M (support Markov model) = learned per element
    M controls the sparsity transition probability across frames and is updated by equation (46a).
  • Temporal correlation factor L (value AR model) = learned per element
    L controls the autoregressive memory of the hidden values and is updated by solving the quadratic in equation (46b).
  • Perturbation parameters delta_theta, delta_phi, delta_tau, delta_nu = learned per frame
    These off-grid corrections are estimated from observations in Section IV-B1 and used in the channel reconstruction in equation (48).
  • MRF coupling strength gamma = not reported
    Gamma sets the strength of cross-domain correlation in equations (14) and (16); no learning rule or simulation value is given.
  • High-order neighbor set N and Gaussian-sum threshold = not reported
    The neighbor set defines the MRF interaction region and the threshold is used in the Gaussian sum approximation; both are implementation choices left unspecified.
assumptions (6)
  • domain assumption Within a sliding frame, physical path parameters such as angles, delays, and Doppler are approximately constant, so the channel is locally stationary.
    Invoked in Section II, first paragraph, and is the basis for the dual-timescale decomposition.
  • domain assumption The SFT channel can be represented by a Tucker model with a low-dimensional ADD domain tensor and factor matrices parameterized by ADD grids.
    Equation (7) and Section II-B; relies on limited scattering and low-rank structure.
  • domain assumption Clustered scattering induces Markov random field structure in the support and tensor-coupled Gaussian structure in the power.
    Equations (14)-(16) in Section III-A; no independent validation of this specific form is provided.
  • ad hoc to paper Off-grid perturbations are small enough that first-order Taylor expansions of the steering matrices are accurate.
    Proposition 3 and Appendix C approximate A_h(theta + delta) with A_h(theta) + dot_A_h(theta) diag(delta); large off-grid deviations would invalidate the quadratic optimization.
  • standard math Variational inference with the specified factorized trial beliefs converges to a good approximation of the posterior.
    Standard VFE tools [50]-[53] are used; the paper does not prove global convergence or bound the approximation error.
  • domain assumption The pilot tensor is all-one and noise variance is known.
    Section II-A after equation (5); perfect pilot cancellation and known noise variance are assumed.

how reviews work

0 comments
Cite this review

Pith. "Pith review of A Tensor-Structured Approach to Dynamic Channel Prediction for Massive MIMO Systems with Temporal Non-Stationarity." pith.science (2026). https://pith.science/paper/A2C4QWXL

@misc{pith2026241206713,
  author       = {Pith},
  title        = {Pith review of: A Tensor-Structured Approach to Dynamic Channel Prediction for Massive MIMO Systems with Temporal Non-Stationarity},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/A2C4QWXL}},
  note         = {Machine review of arXiv:2412.06713}
}
read the original abstract

In moderate- to high-mobility scenarios, CSI varies rapidly and becomes temporally non-stationary, leading to severe performance degradation in the massive MIMO transmissions. To address this issue, we propose a tensor-structured approach to dynamic channel prediction (TS-DCP) for massive MIMO systems with temporal non-stationarity, exploiting both dual-timescale and cross-domain correlations. Specifically, due to inherent spatial consistency, non-stationary channels over long-timescales can be approximated as stationary on short-timescales, decoupling complicated temporal correlations into more tractable dual-timescale ones. To exploit such property, we propose the sliding frame structure composed of multiple pilot OFDM symbols, which capture short-timescale correlations within frames by Doppler domain modeling and long-timescale correlations across frames by Markov/autoregressive processes. Building on this, we develop the Tucker-based spatial-frequency-temporal domain channel model, incorporating angle-delay-Doppler (ADD) domain channels and factor matrices parameterized by ADD domain grids. Furthermore, we model cross-domain correlations of ADD domain channels within each frame, induced by clustered scattering, through the Markov random field and tensor-coupled Gaussian distribution that incorporates high-order neighboring structures. Following these probabilistic models, we formulate the TS-DCP problem as variational free energy (VFE) minimization, and unify different inference rules through the structure design of trial beliefs. This formulation results in the dual-layer VFE optimization process and yields the online TS-DCP algorithm, where the computational complexity is reduced by exploiting tensor-structured operations. Numerical simulations demonstrate the significant superiority of the proposed algorithm over benchmarks in terms of channel prediction performance.

Figures

Figures reproduced from arXiv: 2412.06713 by the authors.

Figure 1
Figure 1. Sliding frame structure for dynamic channel prediction. [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. The diagrams of the SFT domain and ADD domain channel tensors. [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. The three-dimensional example of high-order neighbors. In this case, [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figures from the paper (4 more)
Figure 5
Figure 5. Figure 5: Module diagram of the multi-linear inference with structured priors. [PITH_FULL_IMAGE:figures/full_fig_p007_5.png]
Figure 6
Figure 6. Figure 6: TNMSE of channel prediction versus transmission power: (a) [PITH_FULL_IMAGE:figures/full_fig_p011_6.png]
Figure 7
Figure 7. Figure 7: TNMSE of channel prediction versus predict length for [PITH_FULL_IMAGE:figures/full_fig_p012_7.png]
Figure 9
Figure 9. Figure 9: The convergence performance of the proposed algorithms for [PITH_FULL_IMAGE:figures/full_fig_p013_9.png]

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. DMRS-Based Uplink Channel Estimation for MU-MIMO Systems with Location-Specific SCSI Acquisition

    eess.SP 2025-06 conditional novelty 5.0 of 10

    The proposed VSTD-based location-specific SCSI database and MMSE-based channel estimators achieve lower channel estimation error than existing benchmarks in simulated MU-MIMO systems.

  2. Interference in Spectrum-Sharing Integrated Terrestrial and Satellite Networks: Modeling, Approximation, and Robust Transmit Beamforming

    eess.SP 2025-06 conditional novelty 5.0 of 10

    A robust statistical-CSI beamforming design for satellite-to-terrestrial interference mitigation in integrated terrestrial-satellite networks, with a position-aided approximation of the interference integral.

  3. Extract the Best, Discard the Rest: CSI Feedback with Offline Large AI Models

    eess.SP 2025-05 conditional novelty 5.0 of 10

    A vision-based large AI model, used offline, refines codebook codewords for CSI feedback in FDD massive MIMO, improving reconstruction accuracy and sum rate without online inference latency.

Reference graph

Works this paper leans on

61 extracted references · 57 canonical work pages · cited by 3 Pith papers

  1. [1]

    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, Nov. 2010

    2010

  2. [2]

    An overview of massive MIMO: Benefits and challenges,

    L. Lu, G. Y . Li et al. , “An overview of massive MIMO: Benefits and challenges,” IEEE J. Sel. Topics Signal Process. , vol. 8, no. 5, pp. 742– 758, Oct. 2014

    work page 2014

  3. [3]

    Massive MIMO has unlimited capacity,

    E. Bj ¨ornson, J. Hoydis, and L. Sanguinetti, “Massive MIMO has unlimited capacity,” IEEE Trans. Wireless Commun., vol. 17, no. 1, pp. 574–590, Jan. 2018

    work page 2018

  4. [4]

    Toward massive MIMO 2.0: Understanding spatial correlation, interference suppression, and pilot contamination,

    L. Sanguinetti, E. Bj ¨ornson, and J. Hoydis, “Toward massive MIMO 2.0: Understanding spatial correlation, interference suppression, and pilot contamination,” IEEE Trans. Commun. , vol. 68, no. 1, pp. 232–257, Jan. 2020

    2020

  5. [5]

    Massive MIMO evolution towards 3GPP Release 18,

    H. Jin, K. Liu et al., “Massive MIMO evolution towards 3GPP Release 18,” IEEE J. Sel. Areas Commun. , vol. 41, no. 6, pp. 1635–1654, Jun. 2023

    work page 2023

  6. [6]

    Downlink channel estimation in multiuser massive MIMO with hidden Markovian sparsity,

    A. Liu, L. Lian et al. , “Downlink channel estimation in multiuser massive MIMO with hidden Markovian sparsity,” IEEE Trans. Signal Process., vol. 66, no. 18, pp. 4796–4810, Sep. 2018

    work page 2018

  7. [7]

    Downlink channel reconstruction for spatial mul- tiplexing in massive MIMO systems,

    H. Lee, H. Choi et al., “Downlink channel reconstruction for spatial mul- tiplexing in massive MIMO systems,” IEEE Trans. Wireless Commun. , vol. 20, no. 9, pp. 6154–6166, Sep. 2021

    work page 2021

  8. [8]

    OFDM-based massive grant-free transmis- sion over frequency-selective fading channels,

    Y . Zhu, G. Sun et al. , “OFDM-based massive grant-free transmis- sion over frequency-selective fading channels,” IEEE Trans. Commun. , vol. 70, no. 7, pp. 4543–4558, Jul. 2022

    work page 2022

Show all 61 references
  1. [9]

    Sub-6 GHz to mmWave for 5G-advanced and beyond: Channel measurements, characteristics and impact on system performance,

    H. Miao, J. Zhang et al., “Sub-6 GHz to mmWave for 5G-advanced and beyond: Channel measurements, characteristics and impact on system performance,” IEEE J. Sel. Areas Commun. , vol. 41, no. 6, pp. 1945– 1960, Jun. 2024

    1945

  2. [10]

    A specular approach to MIMO frequency- selective channel tracking and prediction,

    M. Guillaud and D. T. Slock, “A specular approach to MIMO frequency- selective channel tracking and prediction,” inProc. IEEE Signal Process. Advances in Wireless Commun. , 2004, pp. 59–63

    2004

  3. [11]

    Extrapolation of MIMO mobile-to-mobile wireless channels using parametric-model- based prediction,

    R. O. Adeogun, P. D. Teal, and P. A. Dmochowski, “Extrapolation of MIMO mobile-to-mobile wireless channels using parametric-model- based prediction,” IEEE Trans. Veh. Technol., vol. 64, no. 10, pp. 4487– 4498, Oct. 2015

    2015

  4. [12]

    Parametric schemes for prediction of wideband MIMO wireless channels,

    R. Adeogun, P. Teal, and P. Dmochowski, “Parametric schemes for prediction of wideband MIMO wireless channels,” arXiv preprint arXiv:1408.0581, 2014

    2014 arXiv

  5. [13]

    Addressing the curse of mobility in massive MIMO with prony-based angular-delay domain channel predictions,

    H. Yin, H. Wang et al. , “Addressing the curse of mobility in massive MIMO with prony-based angular-delay domain channel predictions,” IEEE J. Sel. Areas Commun. , vol. 38, no. 12, pp. 2903–2917, Dec. 2020

    2020

  6. [14]

    A partial reciprocity-based channel prediction framework for FDD massive MIMO with high mobility,

    Z. Qin, H. Yin et al. , “A partial reciprocity-based channel prediction framework for FDD massive MIMO with high mobility,” IEEE Trans. Wireless Commun., vol. 21, no. 11, pp. 9638–9652, Nov. 2022

    2022

  7. [15]

    A multi-dimensional matrix pencil-based channel prediction method for massive MIMO with mobility,

    W. Li, H. Yin et al., “A multi-dimensional matrix pencil-based channel prediction method for massive MIMO with mobility,” IEEE Trans. Wireless Commun., vol. 22, no. 4, pp. 2215–2230, Apr. 2023

    2023

  8. [16]

    Joint channel estimation and prediction for massive MIMO with frequency hopping sounding,

    Y . Zhu, J. Zhuang et al. , “Joint channel estimation and prediction for massive MIMO with frequency hopping sounding,” IEEE Trans. Wireless Commun., 2024

    2024

  9. [17]

    Channel acquisition for HF skywave mas- sive MIMO-OFDM communications,

    D. Shi, L. Song et al. , “Channel acquisition for HF skywave mas- sive MIMO-OFDM communications,” IEEE Trans. Wireless Commun. , vol. 22, no. 6, pp. 4074–4089, Jun. 2023

    2023

  10. [18]

    Channel prediction with time-varying Doppler spectrum in high-mobility scenarios: A polynomial Fourier transform based approach and field measurements,

    X. Wang, Y . Shi et al., “Channel prediction with time-varying Doppler spectrum in high-mobility scenarios: A polynomial Fourier transform based approach and field measurements,” IEEE Trans. Wireless Com- mun., vol. 22, no. 11, pp. 7116–7129, Nov. 2023

    2023

  11. [19]

    Robust multi-user channel tracking scheme for 5G new radio,

    Y . Wan, G. Liu et al., “Robust multi-user channel tracking scheme for 5G new radio,” IEEE Trans. Wireless Commun. , 2023

    2023

  12. [20]

    A two-stage 2D channel extrapolation scheme for TDD 5G NR systems,

    Y . Wan and A. Liu, “A two-stage 2D channel extrapolation scheme for TDD 5G NR systems,” IEEE Trans. Wireless Commun. , 2024

    2024

  13. [21]

    Sparse Bayesian learning for the time-varying massive MIMO channels: Acquisition and tracking,

    J. Ma, S. Zhang et al., “Sparse Bayesian learning for the time-varying massive MIMO channels: Acquisition and tracking,” IEEE Trans. Com- mun., vol. 67, no. 3, pp. 1925–1938, Mar. 2019

    1925

  14. [22]

    Time-varying massive MIMO channel estima- tion: Capturing, reconstruction, and restoration,

    M. Li, S. Zhang et al., “Time-varying massive MIMO channel estima- tion: Capturing, reconstruction, and restoration,” IEEE Trans. Commun., vol. 67, no. 11, pp. 7558–7572, Nov. 2019

    2019

  15. [23]

    Sparse doubly-selective channel es- timation techniques for OSTBC MIMO-OFDM systems: A hierarchical Bayesian Kalman filter based approach,

    S. Srivastava, M. S. Kumar et al., “Sparse doubly-selective channel es- timation techniques for OSTBC MIMO-OFDM systems: A hierarchical Bayesian Kalman filter based approach,” IEEE Trans. Commun., vol. 68, no. 8, pp. 4844–4858, Aug. 2020

    2020

  16. [24]

    Sparse, group-sparse, and on- line Bayesian learning aided channel estimation for doubly-selective mmWave hybrid MIMO OFDM systems,

    S. Srivastava, C. S. K. Patro et al. , “Sparse, group-sparse, and on- line Bayesian learning aided channel estimation for doubly-selective mmWave hybrid MIMO OFDM systems,” IEEE Trans. Commun. , vol. 69, no. 9, pp. 5843–5858, Sep. 2021

    2021

  17. [25]

    Channel prediction in high-mobility massive MIMO: From spatio-temporal autoregression to deep learning,

    C. Wu, X. Yi et al. , “Channel prediction in high-mobility massive MIMO: From spatio-temporal autoregression to deep learning,” IEEE J. Sel. Areas Commun. , vol. 39, no. 7, pp. 1915–1930, Jul. 2021

    1915

  18. [26]

    Massive MIMO channel prediction: Kalman filtering vs. machine learning,

    H. Kim, S. Kim et al. , “Massive MIMO channel prediction: Kalman filtering vs. machine learning,” IEEE Trans. Commun. , vol. 69, no. 1, pp. 518–528, Jan. 2021

    2021

  19. [27]

    Two-stage based partial online optimization channel prediction for massive MIMO in high-mobility,

    P. Wang, J. Li et al. , “Two-stage based partial online optimization channel prediction for massive MIMO in high-mobility,”IEEE Commun. Lett., vol. 28, no. 2, pp. 417–421, Feb. 2024

    2024

  20. [28]

    Learning to estimate: A real-time online learning framework for MIMO-OFDM channel estimation,

    J. Xu, L. Li et al. , “Learning to estimate: A real-time online learning framework for MIMO-OFDM channel estimation,”IEEE Trans. Wireless Commun., 2024

    2024

  21. [29]

    Time varying channel tracking with spatial and temporal BEM for massive MIMO systems,

    J. Zhao, H. Xie et al. , “Time varying channel tracking with spatial and temporal BEM for massive MIMO systems,” IEEE Trans. Wireless Commun., vol. 17, no. 8, pp. 5653–5666, Aug. 2018

    2018

  22. [30]

    Exploiting dynamic sparsity for downlink FDD-massive MIMO channel tracking,

    L. Lian, A. Liu, and V . K. Lau, “Exploiting dynamic sparsity for downlink FDD-massive MIMO channel tracking,” IEEE Trans. Signal Process., vol. 67, no. 8, pp. 2007–2021, Apr. 2019

    2007

  23. [31]

    Sparse channel estimation via hierarchical hybrid message passing for massive MIMO-OFDM systems,

    X. Liu, W. Wang et al. , “Sparse channel estimation via hierarchical hybrid message passing for massive MIMO-OFDM systems,” IEEE Trans. Wireless Commun., vol. 20, no. 11, pp. 7118–7134, Nov. 2021

    2021

  24. [32]

    Downlink channel prediction for time-varying FDD massive MIMO systems,

    W. Peng, W. Li et al. , “Downlink channel prediction for time-varying FDD massive MIMO systems,” IEEE J. Sel. Topics Signal Process. , vol. 13, no. 5, pp. 1090–1102, Sep. 2019

    2019

  25. [33]

    Channel nonstationarity and consis- tency for beyond 5G and 6G: A survey,

    X. Cheng, Z. Huang, and L. Bai, “Channel nonstationarity and consis- tency for beyond 5G and 6G: A survey,” IEEE Commun. Surveys Tuts. , vol. 24, no. 3, pp. 1634–1669, 3rd Quart. 2022

    2022

  26. [34]

    A general 3D non-stationary 6G channel model with time-space consistency,

    Z. Huang, X. Cheng, and X. Yin, “A general 3D non-stationary 6G channel model with time-space consistency,” IEEE Trans. Commun. , vol. 70, no. 5, pp. 3436–3450, May 2022

    2022

  27. [35]

    Joint beam alignment and Doppler estima- tion for fast time-varying wideband mmWave channels,

    H. Hou, Y . Wang et al. , “Joint beam alignment and Doppler estima- tion for fast time-varying wideband mmWave channels,” IEEE Trans. Wireless Commun., vol. 23, no. 9, pp. 10 895–10 910, Sep. 2024

    2024

  28. [36]

    A general 3D non-stationary wireless channel model for 5G and beyond,

    J. Bian, C.-X. Wang et al. , “A general 3D non-stationary wireless channel model for 5G and beyond,” IEEE Trans. Wireless Commun. , vol. 20, no. 5, pp. 3211–3224, May 2021

    2021

  29. [37]

    A novel 3D beam domain channel model for massive MIMO communication systems,

    ——, “A novel 3D beam domain channel model for massive MIMO communication systems,” IEEE Trans. Wireless Commun., vol. 22, no. 3, pp. 1618–1632, Mar. 2023

    2023

  30. [38]

    Tensor decompositions and applications,

    T. G. Kolda and B. W. Bader, “Tensor decompositions and applications,” SIAM Review, vol. 51, no. 3, pp. 455–500, 2009

    2009

  31. [39]

    NR; physical channels and modulation,

    3rd Generation Partnership Project (3GPP), “NR; physical channels and modulation,” 3GPP, Technical Specification (TS) 38.211, 2025. [Online]. Available: https://www.3gpp.org

    2025

  32. [40]

    Blind signal separation via tensor decomposition with Vandermonde factor: Canonical polyadic decompo- sition,

    M. Sørensen and L. De Lathauwer, “Blind signal separation via tensor decomposition with Vandermonde factor: Canonical polyadic decompo- sition,” IEEE Trans. Signal Process. , vol. 61, no. 22, pp. 5507–5519, Nov. 2013. 17

    2013

  33. [41]

    Tensor CP decomposition with structured factor matrices: Algorithms and performance,

    J. H. d. M. Goulart, M. Boizard et al., “Tensor CP decomposition with structured factor matrices: Algorithms and performance,” IEEE J. Sel. Topics Signal Process., vol. 10, no. 4, pp. 757–769, Jun. 2015

    2015

  34. [42]

    Dictionary-based tensor canonical polyadic decomposition,

    J. E. Cohen and N. Gillis, “Dictionary-based tensor canonical polyadic decomposition,” IEEE Trans. Signal Process. , vol. 66, no. 7, pp. 1876– 1889, Apr. 2017

    2017

  35. [43]

    BP-VB-EP based static and dynamic sparse Bayesian learning with Kronecker structured dictionaries,

    C. K. Thomas and D. Slock, “BP-VB-EP based static and dynamic sparse Bayesian learning with Kronecker structured dictionaries,” in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process. , 2020, pp. 9095– 9099

    2020

  36. [44]

    Sparse Bayesian learning based tensor dictionary learning and signal recovery with application to MIMO channel estimation,

    W.-C. Chang and Y . T. Su, “Sparse Bayesian learning based tensor dictionary learning and signal recovery with application to MIMO channel estimation,” IEEE J. Sel. Topics Signal Process. , vol. 15, no. 3, pp. 847–859, Apr. 2021

    2021

  37. [45]

    Towards flexible sparsity-aware modeling: Automatic tensor rank learning using the generalized hyperbolic prior,

    L. Cheng, Z. Chen et al. , “Towards flexible sparsity-aware modeling: Automatic tensor rank learning using the generalized hyperbolic prior,” IEEE Trans. Signal Process. , vol. 70, pp. 1834–1849, Apr. 2022

    2022

  38. [46]

    Sparse Bayesian learning based channel extrapolation for RIS assisted MIMO-OFDM,

    X. Xu, S. Zhang et al. , “Sparse Bayesian learning based channel extrapolation for RIS assisted MIMO-OFDM,” IEEE Trans. Commun. , vol. 70, no. 8, pp. 5498–5513, Aug. 2022

    2022

  39. [47]

    Variance state propagation for structured sparse Bayesian learning,

    M. Zhang, X. Yuan, and Z.-Q. He, “Variance state propagation for structured sparse Bayesian learning,” IEEE Trans. Signal Process. , vol. 68, pp. 2386–2400, 2020

    2020

  40. [48]

    Joint scattering environment sensing and channel estimation based on non-stationary Markov random field,

    W. Xu, Y . Xiao et al., “Joint scattering environment sensing and channel estimation based on non-stationary Markov random field,” IEEE Trans. Wireless Commun., vol. 23, no. 5, pp. 3903–3917, May 2023

    2023

  41. [49]

    Structured hybrid message passing based channel estimation for massive MIMO-OFDM systems,

    X. Liu, W. Wang et al. , “Structured hybrid message passing based channel estimation for massive MIMO-OFDM systems,” IEEE Trans. Veh. Technol., vol. 72, no. 6, pp. 7491–7507, Jun. 2023

    2023

  42. [50]

    Advances in variational inference,

    C. Zhang, J. B ¨utepage et al., “Advances in variational inference,” IEEE Trans. Pattern Anal. Mach. Intell. , vol. 41, no. 8, pp. 2008–2026, Aug. 2019

    2008

  43. [51]

    Variational message passing,

    J. Winn, C. M. Bishop, and T. Jaakkola, “Variational message passing,” J. Mach. Learn. Res. , vol. 6, no. 4, p. 661–694, 2005

    2005

  44. [52]

    Constructing free-energy approximations and generalized belief propagation algorithms,

    J. S. Yedidia, W. T. Freeman, and Y . Weiss, “Constructing free-energy approximations and generalized belief propagation algorithms,” IEEE Trans. Inf. Theory, vol. 51, no. 7, pp. 2282–2312, Jul. 2005

    2005

  45. [53]

    Unifying message passing algorithms under the framework of constrained Bethe free energy minimization,

    D. Zhang, X. Song et al., “Unifying message passing algorithms under the framework of constrained Bethe free energy minimization,” IEEE Trans. Wireless Commun., vol. 20, no. 7, pp. 4144–4158, Jul. 2021

    2021

  46. [54]

    S. P. Boyd and L. Vandenberghe, Convex Optimization . Cambridge University Press, 2004

    2004

  47. [55]

    Dynamic compressive sensing of time-varying signals via approximate message passing,

    J. Ziniel and P. Schniter, “Dynamic compressive sensing of time-varying signals via approximate message passing,” IEEE Trans. Signal Process., vol. 61, no. 21, pp. 5270–5284, Nov. 2013

    2013

  48. [56]

    Pattern-coupled sparse Bayesian learning for recovery of block-sparse signals,

    J. Fang, Y . Shen et al. , “Pattern-coupled sparse Bayesian learning for recovery of block-sparse signals,” IEEE Trans. Signal Process., vol. 63, no. 2, pp. 360–372, Jan. 2015

    2015

  49. [57]

    Two-dimensional pattern-coupled sparse Bayesian learning via generalized approximate message passing,

    J. Fang, L. Zhang, and H. Li, “Two-dimensional pattern-coupled sparse Bayesian learning via generalized approximate message passing,” IEEE Trans. Image Process., vol. 25, no. 6, pp. 2920–2930, Jun. 2016

    2016

  50. [58]

    The expectation-maximization algorithm,

    T. K. Moon, “The expectation-maximization algorithm,” IEEE Signal Process. Mag., vol. 13, no. 6, pp. 47–60, Nov. 1996

    1996

  51. [59]

    Beam-delay domain channel estimation for mmWave XL-MIMO systems,

    H. Hou, X. He et al. , “Beam-delay domain channel estimation for mmWave XL-MIMO systems,” IEEE J. Sel. Topics Signal Process. , vol. 18, no. 4, pp. 646–661, May 2024

    2024

  52. [60]

    Study on channel model for frequencies from 0.5 to 100 GHz (Release 18),

    3rd Generation Partnership Project (3GPP), “Study on channel model for frequencies from 0.5 to 100 GHz (Release 18),” 3GPP, Technical Report (TR) 38.211, 2024. [Online]. Available: https://www.3gpp.org

    2024

  53. [61]

    QuaDRiGa: A 3-D multi-cell channel model with time evolution for enabling virtual field trials,

    S. Jaeckel, L. Raschkowski et al., “QuaDRiGa: A 3-D multi-cell channel model with time evolution for enabling virtual field trials,” IEEE Trans. Antennas Propag., vol. 62, no. 6, pp. 3242–3256, Jun. 2014

    2014

Pith tools

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