Pith. sign in

REVIEW 3 major objections 5 minor 44 references

Manifold Optimization-based Pilot Allocation for Cell-Free Massive MIMO ISAC Systems

T0 review · 3 major / 5 minor · reviewed 2026-08-05 · deepseek-v4-flash

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

Pith's one-line read Pilot design on a manifold of unit-modulus matrices is claimed to give near-tabu communication rates and ideal radar autocorrelation in one shot.

desk verdict The communication pilot design is a reasonable extension, but the ISAC sensing claim rests on a false equivalence between time-domain and frequency-domain unit modulus; the paper needs major revision. read the letter →

arxiv 2509.00478 v3 pith:XZYHMKIK submitted 2025-08-30 eess.SP

Getuar Rexhepi , Kuranage Roche Rayan Ranasinghe , Giuseppe Thadeu Freitas de Abreu This is my paper
classification eess.SP
keywords cell-freemassiveMIMOpilotallocationmanifoldoptimizationintegratedsensingandcommunicationsunimodularsequencesGaussianbeliefpropagationcontaminationsum-ratemaximization
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

This paper tries to show that pilot sequences in a cell-free massive MIMO system can be designed directly, rather than assigned from a fixed codebook, by optimizing on a smooth search space where every pilot entry lies on the complex unit circle. The optimization maximizes the achievable uplink sum rate while keeping the pilot entries unimodular, which the authors argue makes the same pilots suitable for radar sensing because it yields perfect autocorrelation. Simulation results are presented to support that the designed pilots reach communication rates close to the best combinatorial benchmark, tabu search, while producing autocorrelation sidelobes near zero and resolving two targets at 8 and 19 meters. A Gaussian belief propagation receiver is then proposed to decode the uplink with near-optimal detection performance at substantially lower complexity. If correct, the contribution is a single pilot-design procedure that serves both communication throughput and sensing accuracy in dense distributed antenna systems.

What carries the argument

The central object is the complex circle manifold C(τ,K), the set of τ×K matrices whose entries all have unit modulus. The paper treats this set as the search space for the pilot matrix and uses Riemannian conjugate-gradient ascent: project the Euclidean gradient of the sum-rate objective onto the tangent space, move along a conjugate direction, and retract back to the manifold with x+z/|x+z|. The other load-bearing identity is the autocorrelation theorem used for sensing: if a frequency-domain sequence has |X[k]|=1 for all k, its power spectrum is flat and its inverse-DFT autocorrelation is a single delta at zero lag, which is what makes the pilots useful for radar range estimation.

What would settle it

Run Algorithm 1 for τ=10, take the discrete Fourier transform of each designed pilot column, and check whether every frequency-domain magnitude equals 1; a single deviation falsifies the perfect-autocorrelation claim. Equivalently, compute the aperiodic autocorrelation of the designed pilots and look for any nonzero sidelobe at a nonzero lag.

Watch

Extended reading notes

Core claim

The central claim is that pilot allocation for cell-free massive MIMO ISAC can be reformulated as an unconstrained optimization on the complex circle manifold C(τ,K) = {X ∈ C^{τ×K} : |X| = J}, where the objective is the sum of per-user log2(1+SINR) rates. The paper derives a closed-form Riemannian gradient of that objective and runs conjugate-gradient ascent with retraction, so every iterate remains on the manifold. It then asserts that the resulting pilots are unimodular in the frequency domain, which by the paper's proof (flat power spectrum → delta autocorrelation) gives ideal sensing autocorrelation with a single peak at zero lag. The contribution is thus a dual-purpose pilot design: nea

Load-bearing premise

The load-bearing premise is that the time-domain unit-modulus search space used in the algorithm is equivalent to the frequency-domain unimodularity constraint that the autocorrelation proof requires; if that equivalence fails, the claimed perfect autocorrelation and sensing advantage do not follow.

Editorial extensions

If this is right

  • The same optimized pilot waveforms can be reused for channel estimation and radar ranging, removing the need for separate sensing waveforms in cell-free massive MIMO ISAC.
  • Pilot contamination can be reduced without combinatorial search, giving a gradient-based alternative to tabu search that tracks its throughput.
  • Users with the worst channels gain the most from the optimized assignment, improving fairness in dense deployments.
  • The GaBP receiver achieves near-EP bit error rates at O(LK) per iteration, making near-optimal detection feasible when the number of APs is large.
  • Because the pilots are unimodular, matched-filter range profiles have sidelobes near zero, allowing two targets separated by 11 meters to be resolved at 20 MHz bandwidth.

Reading between the lines

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

  • The paper's proof of perfect autocorrelation applies to a frequency-domain unimodularity constraint, while Algorithm 1 enforces time-domain unit modulus; a direct check of the DFT magnitude of the produced pilots would settle whether the sensing claim actually holds for the implemented design.
  • If the time-domain search does not yield flat spectra, the same manifold machinery could be run on the DFT of the pilot matrix, or seeded with CAZAC sequences, to obtain the claimed sensing guarantee.
  • The closed-form gradient framework likely extends to other ISAC waveform-shaping objectives, such as minimizing OFDM ranging sidelobes or shaping the local ambiguity function.
  • The receiver and pilot contributions are independent: the GaBP receiver does not rely on the manifold-designed pilots, so either could be deployed separately.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

3 major / 5 minor

Summary. The paper proposes a pilot-allocation scheme for cell-free massive MIMO ISAC systems in which pilot sequences are directly optimized on a complex-circle manifold to maximize the achievable uplink sum rate, together with a Gaussian belief propagation (GaBP) receiver. The authors claim that enforcing unit-modulus pilots in the frequency domain yields perfect autocorrelation properties for sensing, while the communication performance is close to tabu-search pilot assignment. Simulations compare the proposed pilots against random, greedy, and tabu-search allocation and evaluate the GaBP receiver against MRC, LMMSE, and EP receivers.

Significance. If the manifold algorithm actually produced pilots with flat frequency-domain magnitude, the joint communication-sensing pilot design would be an interesting contribution, and the GaBP receiver's O(LK) per-iteration complexity is practically appealing. However, the central sensing claim rests on a false equivalence between time-domain and frequency-domain unimodularity, and the aperiodic-autocorrelation claim is internally inconsistent. As presented, the paper's distinctive ISAC contribution is not established. The sum-rate optimization and the GaBP receiver may still be valuable, but they are secondary to the manuscript's stated main contribution.

major comments (3)
  1. [Sec. III-A, Eqs. (15)-(16), Eq. (21), Algorithm 1] The constraint in Eq. (15) is frequency-domain unimodularity, |F{\bar F}|=1, while Eq. (16) and the manifold C(τ,K) in Eq. (21) enforce time-domain unit modulus, |\bar F|=J. These constraints are not equivalent; for example, [1,1] is time-domain unimodular but has DFT magnitude |1+e^{-jω}|. Algorithm 1 retracts onto C(τ,K), and the gradients in Eqs. (24)-(35) depend only on cross-correlations f_k^H f_{k'} with no spectral-flatness term. Therefore the 'perfect autocorrelation' of ManoptPilots in Fig. 5 does not follow from the described optimization. This invalidates the sensing-superiority claim as stated.
  2. [Sec. II-C vs Sec. III-D2, Eq. (39)] The proof in Sec. II-C (Eqs. 11-14) shows that a flat frequency-domain magnitude gives zero periodic autocorrelation at nonzero lags. The evaluation, however, uses the aperiodic A-ACF in Eq. (39) and calls this 'without loss of generality.' For a nonzero length-τ sequence with |x[n]|=1 for all n, the aperiodic lag-1 term r_1=Σ_n x[n+1]x^*[n] has magnitude τ−1 and cannot vanish. Hence the claim in Sec. III-D2 that the proposed pilots attain 'a single peak at the origin and zero elsewhere' is internally inconsistent with the stated metric. Figures 5 and 6 need to be re-examined under a correctly defined autocorrelation metric.
  3. [Sec. III-C, Eqs. (28) and (33)] The closed-form gradients are load-bearing for Algorithm 1. Differentiating γℓk in Eq. (6) with respect to f_k appears to produce a factor involving 1/τ² that is not present in Eq. (28); as written, Eq. (28) seems off by a factor of τ² or its inverse depending on the gradient convention. Additionally, Eq. (33) uses k' both as the outer summation index and as the inner summation index, making the formula ill-defined. Since the algorithm's convergence and the reported sum-rate results rest on these gradients, they must be corrected and the simulations re-run.
minor comments (5)
  1. [Sec. III-A, Eq. (15)] The notation F{\bar F_{i,k}} is unclear: the Fourier transform is presumably applied column-wise to each pilot sequence, but this is not stated. Please define the DFT normalization and the dimension along which F acts.
  2. [Sec. III-D] The simulation description says 'A total of M APs' but the system model uses L throughout; please unify the notation.
  3. [Sec. II-B, Eq. (10)] Equation (10) uses ρ_p in the SINR expression while Eq. (8) contains √ρ_u. Please clarify the relation between ρ_u, ρ_p, and the power-control coefficients η_k, and state any normalization assumptions.
  4. [Sec. III-D2, Fig. 5] The caption of Fig. 5 states that the sidelobe level is the average of 200 autocorrelation functions; please specify the number of Monte Carlo drops and whether the displayed curves correspond to periodic or aperiodic autocorrelation.
  5. [Throughout] There are several typos ('primarly', 'cyrcularly', 'choosen', 'succesful') and inconsistent uses of M vs L. A careful proofread is needed.

Circularity Check

0 steps flagged · score 2.0 of 10

No significant circularity; the sensing claim fails due to a constraint mismatch, not due to a circular derivation.

full rationale

The paper's central communication result is a direct optimization result: the sum-rate objective in Eq. (15)/(16) is maximized via manifold optimization, and the resulting throughput is benchmarked against random, greedy, and tabu-search allocations in Figs. 2-4. No parameter is fitted to a subset of data and then presented as a prediction of a closely related quantity. The sensing claim is problematic, but the problem is a correctness gap, not circularity. Eq. (15) imposes frequency-domain unimodularity |F{\bar F_{i,k}}| = 1, while Eq. (16) and Eq. (21) replace this with time-domain unimodularity |\bar F| = J, which are not equivalent constraints. Algorithm 1 therefore does not enforce the constraint needed for the claimed 'perfect autocorrelation' in Fig. 5. This is an invalid inference, not a reduction of the result to the input by construction. The GaBP receiver is described self-containedly and evaluated against MRC, LMMSE, and EP receivers in Figs. 7-9; the self-citations in the surrounding text are motivational and not load-bearing. The paper also switches from a periodic-autocorrelation proof in Sec. II-C to an aperiodic A-ACF evaluation in Sec. III-D2, but that is another correctness inconsistency rather than a circular step. Score 2 reflects the presence of several non-load-bearing self-citations; no genuine circular derivation is exhibited.

Assumptions & free parameters 3 free parameters · 5 assumptions · 0 invented entities

The paper introduces no new physical entities. Its free parameters are algorithmic constants used by the two proposed algorithms. The load-bearing assumption is the false equivalence between the time-domain unit-modulus manifold and the frequency-domain unimodularity constraint; this is the main reason the sensing result is unsupported. Standard CF-mMIMO modeling assumptions and the Gaussian approximation for GaBP are the other background inputs.

free parameters (3)
  • GaBP damping factor beta_x = not specified
    Eq. (59) uses 0 < beta_x < 1 to stabilize the GaBP receiver; the value is never given and affects BER and convergence.
  • Manifold CG hyperparameters (Armijo constants, threshold epsilon, max iterations) = not specified
    Algorithm 1 depends on line-search constants and stopping criteria; no values are reported, so the exact optimization trajectory cannot be reproduced.
  • Power control coefficients eta_k = not specified, likely 1
    Eta_k appears in Eq. (7) and should affect the data SINR, but no power control policy is described; if set to 1 implicitly, that is a hand-chosen modeling assumption.
assumptions (5)
  • ad hoc to paper Time-domain unit-modulus manifold C(tau,K) is equivalent to the frequency-domain unimodularity constraint in Eq. (15)
    Eq. (21) defines C(tau,K) by |X|=J, while Eq. (15) constrains |F{bar F}|=1. These are not equal; this false equivalence carries the entire ISAC sensing claim.
  • domain assumption The MMSE channel estimation and SINR expressions from CF-mMIMO literature apply directly to optimized non-orthogonal pilots
    Equations (4)-(10) are borrowed from prior CF-mMIMO analysis and assume MMSE estimation and known large-scale coefficients; the paper does not re-derive them for the new pilot design.
  • standard math Frequency-domain unimodularity gives a delta autocorrelation via the DFT geometric-series argument
    Section II-C proves this correctly, but it is applied to the wrong variable because the algorithm constrains time-domain rather than frequency-domain entries.
  • domain assumption Gaussian approximation and independence of soft-replica errors in GaBP
    Equations (53)-(56) replace interference plus noise with a Gaussian and assume independent per-symbol estimation errors; these standard SGA assumptions are not validated for the simulated regime.
  • domain assumption Manifold conjugate-gradient ascent converges to a useful near-optimal point
    Algorithm 1 assumes Armijo line search and restart conditions suffice for the non-convex sum-rate objective; no convergence or optimality guarantee is provided.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Manifold Optimization-based Pilot Allocation for Cell-Free Massive MIMO ISAC Systems." pith.science (2026). https://pith.science/paper/XZYHMKIK

@misc{pith2026250900478,
  author       = {Pith},
  title        = {Pith review of: Manifold Optimization-based Pilot Allocation for Cell-Free Massive MIMO ISAC Systems},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/XZYHMKIK}},
  note         = {Machine review of arXiv:2509.00478}
}
read the original abstract

We address the challenge of pilot design in cell-free massive multiple input multiple output (CF-mMIMO) integrated sensing and communications (ISAC) systems. We propose a novel pilot allocation framework based on manifold optimization that maximizes the system sum rate by minimizing coherence among pilot sequences, while enforcing unimodularity constraints in the frequency domain to ensure pilots are suitable for both communication and sensing tasks. Simulation results demonstrate that the proposed pilot design achieves communication performance comparable to state-of-the-art (SotA) algorithms, while delivering superior sensing capabilities due to its unimodular structure. These results highlight the potential of manifold-based pilot design for practical CF-mMIMO ISAC deployment.

Figures

Figures reproduced from arXiv: 2509.00478 by the authors.

Figure 1
Figure 1. Simplified model CF-mMIMO system. Pilot con [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 4
Figure 4. Median achievable per user throughput against the [PITH_FULL_IMAGE:figures/full_fig_p007_4.png] view at source ↗
Figure 2
Figure 2. The cumulative distribution of the throughput per [PITH_FULL_IMAGE:figures/full_fig_p007_2.png] view at source ↗
Figures from the paper (6 more)
Figure 3
Figure 3. Figure 3: Median achievable per user throughput against the [PITH_FULL_IMAGE:figures/full_fig_p007_3.png]
Figure 6
Figure 6. Figure 6: Range profile of a dual target scenario with targets [PITH_FULL_IMAGE:figures/full_fig_p008_6.png]
Figure 5
Figure 5. Figure 5: Normalized Sidelobe Level as the average of 200 [PITH_FULL_IMAGE:figures/full_fig_p008_5.png]
Figure 8
Figure 8. Figure 8: BER performance of proposed GaBP-based receiver [PITH_FULL_IMAGE:figures/full_fig_p011_8.png]
Figure 9
Figure 9. Figure 9: BER performance of proposed GaBP-based receiver [PITH_FULL_IMAGE:figures/full_fig_p011_9.png]
Figure 7
Figure 7. Figure 7: BER performance of proposed GaBP-based receiver [PITH_FULL_IMAGE:figures/full_fig_p011_7.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

44 extracted references · 39 canonical work pages

  1. [1]

    Massive MIMO networks: Spectral, Energy, and Hardware Efficiency,

    E. Bj ¨ornson, J. Hoydis, and L. Sanguinetti, “Massive MIMO networks: Spectral, Energy, and Hardware Efficiency,”Foundations and Trends in Signal Processing, vol. 11, no. 3-4, pp. 154–655, 2017

    work page 2017

  2. [2]

    Noncooperative Cellular Wireless with unlimited numbers of base station Antennas,

    T. L. Marzetta, “Noncooperative Cellular Wireless with unlimited numbers of base station Antennas,”IEEE Transactions on Wireless Communications, vol. 9, no. 11, pp. 3590–3600, 2010

    work page 2010

  3. [3]

    T. L. Marzetta, E. G. Larsson, H. Yang, and H. Q. Ngo,Fundamentals of Massive MIMO. Cambridge University Press, 2016

    work page 2016

  4. [4]

    Cell-Free massive MIMO: Uniformly Great Service for Everyone,

    H. Q. Ngo, A. Ashikhmin, H. Yang, E. G. Larsson, and T. L. Marzetta, “Cell-Free massive MIMO: Uniformly Great Service for Everyone,” in 2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2015, pp. 201–205

    work page 2015

  5. [5]

    Cell-Free massive MIMO Versus Small Cells,

    ——, “Cell-Free massive MIMO Versus Small Cells,”IEEE Transac- tions on Wireless Communications, vol. 16, no. 3, pp. 1834–1850, 2016

    work page 2016

  6. [6]

    Sum-Rate Maximization and Leakage Minimization for Multi-User Cell-Free Massive MIMO Systems,

    I. A. M. Sandoval, K. Ando, O. Taghizadeh, and G. T. F. De Abreu, “Sum-Rate Maximization and Leakage Minimization for Multi-User Cell-Free Massive MIMO Systems,”IEEE Access, vol. 11, pp. 127 509– 127 525, 2023

    work page 2023

  7. [7]

    Full-Duplex Trans- mission Optimization for Bi-directional MIMO links with Qos Guar- antees,

    H. Iimori, G. Abreu, and G. C. Alexandropoulos, “Full-Duplex Trans- mission Optimization for Bi-directional MIMO links with Qos Guar- antees,” in2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP), 2018, pp. 201–205

    work page 2018

  8. [8]

    Optimized Frameless ALOHA for Cooperative Base Stations With Overlapped Coverage Areas,

    S. Ogata, K. Ishibashi, and G. T. F. de Abreu, “Optimized Frameless ALOHA for Cooperative Base Stations With Overlapped Coverage Areas,”IEEE Transactions on Wireless Communications, vol. 17, no. 11, pp. 7486–7499, 2018

    work page 2018

Show all 44 references
  1. [9]

    Bj ¨ornson, O

    E. Bj ¨ornson, O. T. Demir, and L. Sanguinetti,Foundations of User- Centric Cell-Free Massive MIMO. Now Publishers, 2021

    2021

  2. [10]

    Massive MIMO Systems for 5G and beyond Networks—Overview, Recent Trends, Challenges, and Future Research Direction,

    R. Chataut and R. Akl, “Massive MIMO Systems for 5G and beyond Networks—Overview, Recent Trends, Challenges, and Future Research Direction,”Sensors, vol. 20, no. 10, p. 2753, 2020

    2020

  3. [11]

    Location-Based Greedy Pilot Assignment for Cell-Free Massive MIMO Systems,

    Y . Zhang, H. Cao, P. Zhong, C. Qi, and L. Yang, “Location-Based Greedy Pilot Assignment for Cell-Free Massive MIMO Systems,” in 2018 IEEE 4th International Conference on Computer and Communi- cations (ICCC), 2018, pp. 392–396

    2018

  4. [12]

    Random vs Structured Pilot Assignment in Cell-Free massive MIMO Wireless Networks,

    M. Attarifar, A. Abbasfar, and A. Lozano, “Random vs Structured Pilot Assignment in Cell-Free massive MIMO Wireless Networks,” inProc. IEEE Intl. Conf. on Commun. Workshops (ICC Workshops), May 2018, pp. 1–6

    2018

  5. [13]

    Graph Coloring Based Pilot Reuse Among Interfering Users in Cell-Free massive MIMO,

    W. Hmida, V . Meghdadi, A. Bouallegue, and J. P. Cances, “Graph Coloring Based Pilot Reuse Among Interfering Users in Cell-Free massive MIMO,” inProc. IEEE Intl. Conf. on Commun. (ICC), May 2020, pp. 1–6

    2020

  6. [14]

    Pilot Assignment for Cell-Free massive MIMO Systems Using a Weighted Graphic Framework,

    W. Zeng, Y . He, B. Li, and S. Wang, “Pilot Assignment for Cell-Free massive MIMO Systems Using a Weighted Graphic Framework,”IEEE Trans. on Veh. Technology, vol. 70, no. 5, pp. 4131–4146, May 2021

    2021

  7. [15]

    Tabu- Search-Based Pilot Assignment for Cell-Free Massive MIMO Systems,

    H. Liu, J. Zhang, X. Zhang, A. Kurniawan, T. Juhana, and B. Ai, “Tabu- Search-Based Pilot Assignment for Cell-Free Massive MIMO Systems,” IEEE Trans. Veh. Technol., vol. 69, no. 2, pp. 2286–2290, Feb. 2020

    2020

  8. [16]

    Pilot Assignment in Cell-Free massive MIMO Based on the Hungarian Algorithm,

    S. Buzzi, C. D’Andrea, M. Fresia, Y .-P. Zhang, and S. Feng, “Pilot Assignment in Cell-Free massive MIMO Based on the Hungarian Algorithm,”IEEE Wireless Commun. Lett., vol. 9, no. 1, pp. 34–37, Jan. 2020

    2020

  9. [17]

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

    F. Liu, Y . Cui, C. Masouros, J. Xu, T. X. Han, Y . C. Eldar, and S. Buzzi, “Integrated sensing and communications: Toward dual-functional wire- less networks for 6G and beyond,”IEEE Journal on Selected Areas in Communications, vol. 40, no. 6, pp. 1728–1767, 2022

    2022

  10. [18]

    J. A. Zhang, Y . J. Guo, and K. Wu,Introduction to Joint Communications and Sensing (JCAS), 2023, pp. 1–30

    2023

  11. [19]

    Integrated Sensing and Communications for 3D Object Imaging via Bilinear Inference,

    H. S. Rou, G. T. F. de Abreu, D. Gonz ´alez G., and O. Gonsa, “Integrated Sensing and Communications for 3D Object Imaging via Bilinear Inference,”IEEE Transactions on Wireless Communications, vol. 23, no. 8, pp. 8636–8653, 2024

    2024

  12. [20]

    Joint Channel, Data, and Radar Parameter Estimation for AFDM Systems in Doubly-Dispersive Channels,

    K. R. R. Ranasinghe, H. Seok Rou, G. Thadeu Freitas de Abreu, T. Takahashi, and K. Ito, “Joint Channel, Data, and Radar Parameter Estimation for AFDM Systems in Doubly-Dispersive Channels,”IEEE Transactions on Wireless Communications, vol. 24, no. 2, pp. 1602– 1619, 2025

    2025

  13. [21]

    Designing unimodular sequence sets with good correlations—including an application to mimo radar,

    H. He, P. Stoica, and J. Li, “Designing unimodular sequence sets with good correlations—including an application to mimo radar,”IEEE Transactions on Signal Processing, vol. 57, no. 11, pp. 4391–4405, 2009

    2009

  14. [22]

    Local ambiguity function shaping via unimodular sequence design,

    G. Cui, Y . Fu, X. Yu, and J. Li, “Local ambiguity function shaping via unimodular sequence design,”IEEE Signal Processing Letters, vol. 24, no. 7, pp. 977–981, 2017

    2017

  15. [23]

    Boumal,An Introduction to Optimization on Smooth Manifolds

    N. Boumal,An Introduction to Optimization on Smooth Manifolds. Cambridge University Press, 2023

    2023

  16. [24]

    A Riemannian Manifold Approach to Constrained Resource Allocation in ISAC,

    S. Zargari, D. Galappaththige, C. Tellambura, and H. V . Poor, “A Riemannian Manifold Approach to Constrained Resource Allocation in ISAC,”IEEE Trans. Wireless Commun., vol. 23, no. 4, pp. 2786–2802, Apr. 2024. 13

    2024

  17. [25]

    A Survey of Recent Advances in Optimization Methods for Wireless Communications,

    Y .-F. Liuet al., “A Survey of Recent Advances in Optimization Methods for Wireless Communications,” arXiv preprint arXiv:2401.12025, 2024. [Online]. Available: https://arxiv.org/abs/2401.12025

    2024 arXiv

  18. [26]

    Absil, R

    P.-A. Absil, R. Mahony, and R. Sepulchre,Optimization Algorithms on Matrix Manifolds. Princeton, NJ: Princeton University Press, 2008

    2008

  19. [27]

    A Brief Introduction to Manifold Optimization,

    J. Hu, X. Liu, Z. Wen, and Y . Yuan, “A Brief Introduction to Manifold Optimization,”J. Oper. Res. Soc. China, vol. 8, no. 2, pp. 199–248, Jun. 2020

    2020

  20. [28]

    Solving Low-Rank Semidefinite Programs via Manifold Optimization,

    J. Wang and L. Hu, “Solving Low-Rank Semidefinite Programs via Manifold Optimization,” arXiv preprint arXiv:2303.01722v3, Mar. 2024

    2024 arXiv

  21. [29]

    Performance of Cell-Free massive MIMO Systems with MMSE and LSFD Receivers,

    E. Nayebi, A. Ashikhmin, T. L. Marzetta, and B. D. Rao, “Performance of Cell-Free massive MIMO Systems with MMSE and LSFD Receivers,” inProc. 50th Asilomar Conf. Signals, Systems and Computers, Pacific Grove, CA, USA, 2016, pp. 203–207

    2016

  22. [30]

    Improving Cell-Free Massive MIMO Detection Perfor- mance via Expectation Propagation,

    A. Kosasih, V . Miloslavskaya, W. Hardjawana, V . Andrean, and B. Vucetic, “Improving Cell-Free Massive MIMO Detection Perfor- mance via Expectation Propagation,” in2021 IEEE 94th Vehicular Technology Conference (VTC2021-Fall), 2021, pp. 1–5

    2021

  23. [31]

    An Efficient Vector- valued Belief Propagation Decoder for Quadrature Spatial Modulation,

    H. S. Rou, G. T. F. de Abreu, and T. Takahashi, “An Efficient Vector- valued Belief Propagation Decoder for Quadrature Spatial Modulation,” in2022 56th Asilomar Conference on Signals, Systems, and Computers, 2022, pp. 27–31

    2022

  24. [32]

    Vector-Approximate-Message- Passing-Based Channel Estimation for MIMO-OFDM Underwater Acoustic Communications,

    W. Chen, J. Tao, L. Ma, and G. Qiao, “Vector-Approximate-Message- Passing-Based Channel Estimation for MIMO-OFDM Underwater Acoustic Communications,”IEEE Journal of Oceanic Engineering, vol. 49, no. 2, pp. 496–506, 2024

    2024

  25. [33]

    An Efficient Vector- Valued Belief Propagation Decoder for Quadrature Spatial Modulation,

    H. S. Rou, G. T. F. de Abreu, and T. Takahashi, “An Efficient Vector- Valued Belief Propagation Decoder for Quadrature Spatial Modulation,” inProc. 2022 56th Asilomar Conference on Signals, Systems, and Computers (Asilomar), 2022, pp. 27–31

    2022

  26. [34]

    Belief Propagation-Based Rotation and Translation Estimation for Rigid Body Localization,

    V . Vizitiv, H. S. Rou, N. F ¨uhrling, and G. T. F. de Abreu, “Belief Propagation-Based Rotation and Translation Estimation for Rigid Body Localization,” inProc. 2025 IEEE Wireless Communications and Net- working Conference (WCNC), 2025

    2025

  27. [35]

    From theory to reality: A design framework for integrated communication and computing receivers,

    K. R. R. Ranasinghe, K. Ando, and G. T. F. de Abreu, “From theory to reality: A design framework for integrated communication and computing receivers,” 2024. [Online]. Available: https://arxiv.org/abs/2411.02016

    2024 arXiv

  28. [36]

    Waveform Design and Signal Processing Aspects for Fusion of Wireless Communications and Radar Sensing,

    C. Sturm and W. Wiesbeck, “Waveform Design and Signal Processing Aspects for Fusion of Wireless Communications and Radar Sensing,” Proceedings of the IEEE, vol. 99, no. 7, pp. 1236–1259, 2011

    2011

  29. [37]

    H. He, J. Li, and P. Stoica,Waveform Design for Active Sensing Systems: A Computational Approach. Cambridge University Press, 2012

    2012

  30. [38]

    Polak,Optimization: Algorithms and Consistent Approximations

    E. Polak,Optimization: Algorithms and Consistent Approximations. New York: Springer-Verlag, 1997

    1997

  31. [39]

    An Introduction to the Conjugate Gradient Method without the Agonizing Pain,

    J. R. Shewchuk, “An Introduction to the Conjugate Gradient Method without the Agonizing Pain,” School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, Tech. Rep., August 1994, edition 1 1/4

    1994

  32. [40]

    Nocedal and S

    J. Nocedal and S. J. Wright,Numerical Optimization, 2nd ed., ser. Springer Series in Operations Research and Financial Engineering. New York: Springer, 2006

    2006

  33. [41]

    Cost 231 Hata Adaptation Model for Urban Conditions in LTE Networks,

    R. V . Akhpashev and A. V . Andreev, “Cost 231 Hata Adaptation Model for Urban Conditions in LTE Networks,” in2016 17th International Conference of Young Specialists on Micro/Nanotechnologies and Elec- tron Devices (EDM), 2016, pp. 64–66

    2016

  34. [42]

    OFDM Achieves the Lowest Ranging Sidelobe Under Random ISAC Signaling,

    F. Liu, Y . Zhang, Y . Xiong, S. Li, W. Yuan, F. Gao, S. Jin, and G. Caire, “OFDM Achieves the Lowest Ranging Sidelobe Under Random ISAC Signaling,” arXiv preprint arXiv:2407.06691, 2024. [Online]. Available: https://arxiv.org/abs/2407.06691

    2024 arXiv

  35. [43]

    Design of Adaptively Scaled Belief in Multi-Dimensional Signal Detection for Higher-Order Modulation,

    T. Takahashi, S. Ibi, and S. Sampei, “Design of Adaptively Scaled Belief in Multi-Dimensional Signal Detection for Higher-Order Modulation,” IEEE Transactions on Communications, vol. 67, no. 3, pp. 1986–2001, 2019

    1986

  36. [44]

    On Convergence Conditions of Gaussian Belief Propagation,

    Q. Su and Y .-C. Wu, “On Convergence Conditions of Gaussian Belief Propagation,”IEEE Transactions on Signal Processing, vol. 63, no. 5, pp. 1144–1155, 2015

    2015

Pith tools

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