A recursive algorithm for the error probability evaluation of M-QAM
IEEE Communications Letters2000Vol. 4(10), pp. 304–306
Citations Over TimeTop 10% of 2000 papers
Abstract
A general recursive algorithm for the efficient and accurate computation of the bit error rate (BER) of square-shaped M-QAM constellations over additive white Gaussian noise (AWGN) channels is derived. We take advantage of the relationship amongst different square-shaped M-QAM constellations using Gray coded bit mapping.
Related Papers
- → Blind equalization of square-QAM signals: a multimodulus approach(2010)75 cited
- → Phase-Noise-Tolerant Two-Stage Carrier Recovery Concept for Higher Order QAM Formats(2009)61 cited
- → Geometric Constellation Shaping Using Initialized Autoencoders(2021)9 cited
- → Complex Fixed-Point ICA Algorithm for Separation of QAM Sources using Gaussian Mixture Model(2007)16 cited
- → A Family of Multimodulus Algorithms for Blind Equalization of Square-QAM Signal(2007)1 cited