Efficient SER Estimation for MIMO Detectors via Importance Sampling Schemes

In this paper we propose two importance sampling methods for the efficient symbol error rate (SER) estimation of maximum likelihood (ML) multiple-input multiple-output (MIMO) detectors. Conditioned to a given transmitted symbol, computing the SER requires the evaluation of an integral outside a given polytope in a high-dimensional space, for which a closed-form solution does not exist. Therefore, Monte Carlo (MC) simulation is typically used to estimate the SER, although a naive or raw MC implementation can be very inefficient at high signal-to-noise-ratios or for systems with stringent SER requirements. A reduced variance estimator is provided by the Truncated Hypersphere Importance Sampling (THIS) method, which samples from a proposal density that excludes the largest hypersphere circumscribed within the Voronoi region of the transmitted vector. A much more efficient estimator is provided by the existing ALOE (which stands for "At Least One rare Event") method, which samples conditionally on an error taking place. The paper describes in detail these two IS methods, discussing their advantages and limitations, and comparing their performances.

[1]  Kung Yao,et al.  Improved importance sampling technique for efficient simulation of digital communication systems , 1988, IEEE J. Sel. Areas Commun..

[2]  Petar Popovski,et al.  Towards Massive, Ultra-Reliable, and Low-Latency Wireless Communication with Short Packets , 2015 .

[3]  S. R. Jammalamadaka,et al.  Directional Statistics, I , 2011 .

[4]  Erik Agrell,et al.  Faster Recursions in Sphere Decoding , 2009, IEEE Transactions on Information Theory.

[5]  Michael Chertkov,et al.  Importance sampling the union of rare events with an application to power systems analysis , 2017, Electronic Journal of Statistics.

[6]  Petar M. Djuric,et al.  Adaptive Importance Sampling: The past, the present, and the future , 2017, IEEE Signal Processing Magazine.

[7]  P. Balaban,et al.  Statistical evaluation of the error rate of the fiberguide repeater using importance sampling , 1976, The Bell System Technical Journal.

[8]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[9]  Yuval Kochman,et al.  Lattice Coding for Signals and Networks: Side-information problems , 2014 .

[10]  Ignacio Santamaría,et al.  Multiple Importance Sampling for Efficient Symbol Error Rate Estimation , 2019, IEEE Signal Processing Letters.

[11]  Claus-Peter Schnorr,et al.  Lattice basis reduction: Improved practical algorithms and solving subset sum problems , 1991, FCT.

[12]  J. Keith Townsend,et al.  A Stochastic Importance Sampling Methodology for the Efficient Simulation of Adaptive Systems in Frequency Nonselective Rayleigh Fading Channels , 1997, IEEE J. Sel. Areas Commun..

[13]  B. Hassibi,et al.  On the expected complexity of sphere decoding , 2001, Conference Record of Thirty-Fifth Asilomar Conference on Signals, Systems and Computers (Cat.No.01CH37256).

[14]  Giuseppe Caire,et al.  On maximum-likelihood detection and the search for the closest lattice point , 2003, IEEE Trans. Inf. Theory.

[15]  P. Balaban,et al.  A Modified Monte-Carlo Simulation Technique for the Evaluation of Error Rate in Digital Communication Systems , 1980, IEEE Trans. Commun..

[16]  U. Fincke,et al.  Improved methods for calculating vectors of short length in a lattice , 1985 .

[17]  David Luengo,et al.  Generalized Multiple Importance Sampling , 2015, Statistical Science.

[18]  Mónica F. Bugallo,et al.  Efficient Multiple Importance Sampling Estimators , 2015, IEEE Signal Processing Letters.

[19]  Mansoor Shafi,et al.  Quick Simulation: A Review of Importance Sampling Techniques in Communications Systems , 1997, IEEE J. Sel. Areas Commun..