PaperlayerView exact revision on arXiv

Source-linked AI summary

Amortized Neural SVD for XL-MIMO: Structure-Guided Factor Prediction for Beamforming and Multi-Stream Utility

Yue Zhang, Yiyan Zhang, Ruijin Sun, Honggang Jia, Chen Gong

arXiv:2608.26727v1eess.SP

TL;DR

Exact SVD becomes a latency bottleneck as MIMO arrays grow, motivating a learned replacement. SVDNet predicts truncated, structure-constrained factors in one forward pass, achieving near-reference single-stream utility and improving multi-stream results with optional refinement while scaling faster than exact SVD.

Abstract

from arXiv · show

Singular value decomposition (SVD) is a core operation in multiple-input multiple-output (MIMO) beamforming, but the cubic complexity of standard SVD routines can lead to a major latency bottleneck as array dimensions scale to extremely large sizes. This paper presents a fully learned neural operator that avoids explicit SVD computation by directly mapping channel matrices to truncated low-rank factors for precoder and combiner design. In contrast to iterative numerical solvers and algorithm-unrolled networks, the proposed structure-aware model, termed SVDNet, produces these factors in a single forward pass at inference, shifting the per-instance decomposition cost to offline training. The model also includes lightweight constraints to enforce basic algebraic properties required by beamforming, such as semi-unitarity of the singular vectors and nonnegative singular values, without invoking matrix factorization kernels. Experiments on extremely large-scale MIMO channels with matrix dimensions up to 512*512 show that the proposed approach achieves spectral efficiency close to exact SVD-based beamforming in single-stream transmission and consistently improves multi-stream sum-rate over representative learned baselines, indicating good scalability for low-latency wireless processing.

I. INTRODUCTION

SVD is central to MIMO beamforming but becomes a major computational bottleneck for extremely large arrays. SVDNet replaces repeated numerical decomposition with a structure-aware learned operator evaluated through communication utility and scaling.

  • Exact dense SVD costs O(N^3) arithmetic and O(N^2) memory traffic, creating latency bottlenecks as array dimensions grow.Source: §I · p. 1
  • Iterative and randomized methods reduce costs for top-k subspaces but retain data-dependent convergence, matrix-vector products, and orthogonalization.Source: §I · p. 1
  • SVD factors require unitary singular vectors plus nonnegative and ordered singular values to remain useful for downstream beamforming.Source: §I · pp. 1–2
  • SVDNet maps complex channel matrices directly to structured factors in one forward pass, using matrix-aware encoding, unitary guidance, and SVD-specific constraints.Source: §I · p. 2
  • The evaluation targets communication utility and wall-clock scaling against exact SVD, with near-reference single-stream utility and multi-stream refinement support.Source: §I · p. 2

II. SYSTEM MODEL AND METRICS

The system models a narrowband MIMO channel through a truncated SVD representation. The learned operator predicts low-rank factors that directly support beamforming and precoding relative to an exact reference decomposition.

B. Communication Utility and Scaling Latency Metrics

The paper evaluates learned factors through single-stream beamforming utility, multi-stream interference-aware sum-rate, and decomposition latency relative to exact SVD. The metrics expose both communication performance and scaling behavior.

Communication Utility

Scaling Latency

A. Learned Neural SVD Operator

The learned operator predicts truncated SVD-like factors through a compact matrix-aware architecture and structural post-processing. Training combines reconstruction with progressively stronger semi-unitary regularization.

B. Structure-Aware Design and Unitary Guidance

The design injects SVD-specific structure into learned low-rank factors, constraining singular values and guiding singular vectors toward semi-unitarity without explicit factorization routines.

Structure-Aware Factorization

  • The operator uses a fixed low-rank parameterization and SVD-compatible post-processing to produce communication-usable factors.Singular values are made nonnegative, energy-calibrated, and descending, while vector factors receive differentiable structural guidance.Source: B. Structure-Aware Design and Unitary… · p. 4
  • Ordering consistency makes the first predicted singular-vector column correspond to the strongest spatial direction in the dominant-mode regime.This follows from sorting singular values in descending order with synchronized factor columns.Source: B. Structure-Aware Design and Unitary… · p. 4

Unitary Guidance

  • A fixed-depth unitary guidance layer is applied separately to the decoded U- and V-factors to address orthogonality drift.The layer operates on complex decoder outputs after column normalization.Source: B. Structure-Aware Design and Unitary… · p. 4
  • The guidance iterations encourage the Gram matrix of each output factor to approach the R × R identity matrix.This promotes semi-unitarity without invoking explicit matrix factorization routines and is used during training and inference.Source: B. Structure-Aware Design and Unitary… · p. 4

C. Multi-Stream Enhancement

For multi-stream transmission, SVDNet optionally refines the predicted right-singular subspace using a low-dimensional Rayleigh–Ritz update to improve stream decoupling.

Subspace Refinement

  • The refinement selects a subspace from the leading predicted columns, with rsub = min{max(k, ralign), R} and ralign = 3 in the final experiments.This restricts the update to a low-dimensional subspace predicted by the network.Source: C. Multi-Stream Enhancement · p. 4

Rayleigh–Ritz Update

  • Within that subspace, the method extracts k dominant eigenvectors and reconstructs refined right-singular directions and associated singular-vector factors.The refined directions are Vref = VsubEk, followed by σi = ∥Hvi∥2 and ui = Hvi/σi.Source: C. Multi-Stream Enhancement · p. 4

Multi-Stream Utility

  • The refinement is unnecessary for the dominant-mode case but improves stream decoupling for k > 1 under the interference-aware sum-rate metric.Its role is specifically tied to multi-stream residual coupling and utility.Source: C. Multi-Stream Enhancement · p. 4

D. Computational Complexity

The proposed deployment replaces cubic numerical SVD scaling with an approximately quadratic learned operator under fixed architectural widths and depths, while refinement adds limited overhead.

Baseline Complexity

  • For square n × n channels, numerical SVD has cubic complexity O(n^3).The learned encoder instead uses separate row- and columnwise branches with linear attention that avoids forming an explicit n × n attention matrix.Source: D. Computational Complexity · p. 4

Learned Operator Scaling

  • With fixed embedding width, heads, encoder depth, output rank R, and guidance depth, the learned operator scales approximately as O(n^2).Matrix-shaped projections and decoders dominate the end-to-end deployment cost.Source: D. Computational Complexity · p. 4

Refinement Overhead

  • The optional refinement adds overhead O(n^2rsub + rsub^3) when rsub is small.This keeps the refinement lower-dimensional than a full SVD.Source: D. Computational Complexity · p. 4

IV. EXPERIMENTS

Experiments use measurement-anchored noisy XL-MIMO channels and compare learned factorization against oracle SVD and learned baselines using communication utility and latency-related protocols.

Datasets and Setup

  • Evaluation covers complex square channels with M = N ∈ {128, 256, 512}, plus N ∈ {32, 64} for scalability benchmarking.Datasets at other sizes match statistics estimated from approximately 30,000 measured 128 × 128 realizations.Source: A. Datasets, Experimental Setup, and… · p. 4

Reporting Caveat

Evaluation Protocol

  • Learned methods infer factors from noisy observations X, while communication utility is evaluated on the corresponding clean channel Y.The clean-channel SVD computed with torch.svd serves as the oracle reference for normalized utility metrics.Source: A. Datasets, Experimental Setup, and… · p. 5

B. Experiment Results

SVDNet provides near-oracle single-stream utility across tested dimensions and SNRs, while optional subspace refinement substantially improves multi-stream performance. It also offers increasing latency advantages over exact SVD as array dimensions grow.

Single-stream results

  • η1 remains within [0.9933, 0.9975] for N ∈{128, 256, 512} over {0, 10, 20} dB, indicating near-oracle single-stream utility.Source: B. Experiment Results · p. 5

Efficiency and scaling

  • On GPU, SVDNet latency remains within 4.67–6.02 ms while torch.svd reaches 77.58 ms at N = 512, yielding a 16.60× speedup.Source: B. Experiment Results · p. 6
  • On CPU, the speedup reaches 5.61× at N = 512, while peak memory remains comparable between SVDNet and exact SVD.The reported acceleration is attributed to computational efficiency rather than increased memory usage.Source: B. Experiment Results · p. 6
  • Under batched inference with 8 samples, the effective GPU throughput speedup reaches approximately 140×.Source: B. Experiment Results · p. 6

C. Accuracy Comparison with Learned Decomposition Base-

Across N = 32–512, SVDNet is more stable than the pure neural baseline and achieves higher utility than the prior-aided baseline. The results attribute this advantage to explicitly incorporating SVD structure into the learned decomposition.

Stability under dimension scaling

  • At N ≥256, Peken's η1 drops to very low values, whereas SVDNet maintains stable convergence and near-oracle performance at N = 512.SVDNet uses unitary guidance to regularize the high-dimensional factor search space.Source: C. Accuracy Comparison with Learned… · p. 6

Comparison with the prior-aided baseline

  • SVDNet consistently outperforms AED, especially in the multi-stream regime k = 3.The text attributes AED's lower utility to a rigid QR block combined with a generic feature extractor.Source: C. Accuracy Comparison with Learned… · p. 6

Overall comparison

  • Across N = 32–512, SVDNet delivers near-oracle single-stream accuracy and consistently stronger multi-stream performance.Source: C. Accuracy Comparison with Learned… · p. 6
  • The gains do not arise from neuralization alone: the pure neural baseline collapses at large dimensions, while the prior-aided amortized baseline remains less accurate.The conclusion identifies incorporating SVD structure as key to scalable and stable learned decomposition.Source: §V · p. 6

Related papers

Loading 2608.26727v1…