Bayesian inference in high-dimensional discrete-input additive noise models is a fundamental challenge in communication systems, as the support of the required joint a posteriori probability (APP) mass function grows exponentially with the number of unknown variables. In this work, we propose a tensor-train (TT) framework for tractable, near-optimal Bayesian inference in discrete-input additive noise models. The central insight is that the joint log-APP mass function admits an exact low-rank representation in the TT format, enabling compact storage and efficient computations. To recover symbol-wise APP marginals, we develop a practical inference procedure that approximates the exponential of the log-posterior using a TT-cross algorithm initialized with a truncated Taylor-series. To demonstrate the generality of the approach, we derive explicit low-rank TT constructions for two canonical communication problems: the linear observation model under additive white Gaussian noise (AWGN), applied to multiple-input multiple-output (MIMO) detection, and soft-decision decoding of binary linear block error correcting codes over the binary-input AWGN channel. Numerical results show near-optimal error-rate performance across a wide range of signal-to-noise ratios while requiring only modest TT ranks. These results highlight the potential of tensor-network methods for efficient Bayesian inference in communication systems.
Figures & tables
Fig. 1: Graphical representation of the TT decomposition. Each edge can be interpreted as a tensor contraction.
Fig. 2: SER over SNR for various MIMO detectors across different N~×N~ system configurations (real-valued dimensions NT=NR=2N~ ). The maximum rank r_max in the truncated Taylor-series initialization is set to (from left to right) 10,10,40,20 .
P(xi=a∣y)∝a∈ANTai=a∑eΛ(a),a∈A,i=1,…,NT,
Algorithm 1 TTDet for MIMO detection
rmax after TT -cross
Memory savings w.r.t. MN~
Eb/N0
mean
median
mean
median
−11 dB
210
209
1013
1013
−5 dB
98
86
1014
1014
TABLE I: Memory complexity of the TTDet-sample algorithm for N~=32 and 4 - QAM
Communications Research Laboratory, Ilmenau University of Technology, Ilmenau, Germany · School of Electrical and Computer Engineering, Tel Aviv University, Tel Aviv, Israel