On the Entropy Computation of Large Complex Gaussian Mixture Distributions

From MaRDI portal
Publication:4580785

DOI10.1109/TSP.2015.2441046zbMATH Open1394.94277arXiv1502.03790OpenAlexW2115780024MaRDI QIDQ4580785FDOQ4580785


Authors: Sumin Kim, Tan Tai do, Tobias J. Oechtering, Gunnar Peters Edit this on Wikidata


Publication date: 22 August 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Abstract: The entropy computation of Gaussian mixture distributions with a large number of components has a prohibitive computational complexity. In this paper, we propose a novel approach exploiting the sphere decoding concept to bound and approximate such entropy terms with reduced complexity and good accuracy. Moreover, we propose an SNR region based enhancement of the approximation method to reduce the complexity even further. Using Monte-Carlo simulations, the proposed methods are numerically demonstrated for the computation of the mutual information including the entropy term of various channels with finite constellation modulations such as binary and quadratic amplitude modulation (QAM) inputs for communication applications.


Full work available at URL: https://arxiv.org/abs/1502.03790




Recommendations








This page was built for publication: On the Entropy Computation of Large Complex Gaussian Mixture Distributions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580785)