scholarly journals Non-parametric kernel-based bit error probability estimation in digital communication systems: An estimator for soft coded QAM BER computation

2018 ◽  
Vol Volume 27 - 2017 - Special... ◽  
Author(s):  
Pasteur Poda ◽  
Samir Saoudi ◽  
Thierry Chonavel ◽  
Frédéric GUILLOUD ◽  
Théodore Tapsoba

The standard Monte Carlo estimations of rare events probabilities suffer from too much computational time. To make estimations faster, kernel-based estimators proved to be more efficient for binary systems whilst appearing to be more suitable in situations where the probability density function of the samples is unknown. We propose a kernel-based Bit Error Probability (BEP) estimator for coded M-ary Quadrature Amplitude Modulation (QAM) systems. We defined soft real bits upon which an Epanechnikov kernel-based estimator is designed. Simulation results showed, compared to the standard Monte Carlo simulation technique, accurate, reliable and efficient BEP estimates for 4-QAM and 16-QAM symbols transmissions over the additive white Gaussian noise channel and over a frequency-selective Rayleigh fading channel. Les estimations de probabilités d'événements rares par la méthode de Monte Carlo classique souffrent de trop de temps de calculs. Des estimateurs à noyau se sont montrés plus efficaces sur des systèmes binaires en même temps qu'ils paraissent mieux adaptés aux situations où la fonction de densité de probabilité est inconnue. Nous proposons un estimateur de Probabilité d'Erreur Bit (PEB) à noyau pour les systèmes M-aires codés de Modulations d'Amplitude en Quadrature (MAQ). Nous avons défini des bits souples à valeurs réelles à partir desquels un estimateur à noyau d'Epanechnikov est conçu. Les simulations ont montré, par rapport à la méthode Monte Carlo, des estimées de PEB précises, fiables et efficaces pour des transmissions MAQ-4 et MAQ-16 sur canaux à bruit additif blanc Gaussien et à évanouïssements de Rayleigh sélectif en fréquence.

2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Jia Liu ◽  
Mingyu Zhang ◽  
Chaoyong Wang ◽  
Rongjun Chen ◽  
Xiaofeng An ◽  
...  

In this paper, upper bound on the probability of maximum a posteriori (MAP) decoding error for systematic binary linear codes over additive white Gaussian noise (AWGN) channels is proposed. The proposed bound on the bit error probability is derived with the framework of Gallager’s first bounding technique (GFBT), where the Gallager region is defined to be an irregular high-dimensional geometry by using a list decoding algorithm. The proposed bound on the bit error probability requires only the knowledge of weight spectra, which is helpful when the input-output weight enumerating function (IOWEF) is not available. Numerical results show that the proposed bound on the bit error probability matches well with the maximum-likelihood (ML) decoding simulation approach especially in the high signal-to-noise ratio (SNR) region, which is better than the recently proposed Ma bound.


Author(s):  
A. V. Rabin ◽  
M. A. Dobroselskij ◽  
V. A. Lipatnikov

In the digital communication systems for noise immunity's increase with the fixed code rate it is proposed to use an additional orthogonal coding developed by the authors. It is an analogue of convolutional coding over the rational numbers' field. Transmission of digital signals in Additive white Gaussian noise (AWGN) channel and fading channels is considered including a joint use of the orthogonal and correcting codes (block and convolutional). It is shown that losses in signal-to-noise ratio can be significantly reduced by use of orthogonal coding. By increase of matrices' order, on which basis orthogonal codes are constructed, the coding gain grows also. By use of the proposed by the authors orthogonal coding the required quality of communication is implemented with a smaller energy cost. The significant coding gain (up to 6,4 dB in the channels with the AWGN, up to 22,74 dB in the fading channels) provided by more effective use of energy of transmitted signals is reached without increase in complexity and cost of transmitting/receiving devices.


2020 ◽  
Author(s):  
Sidrah Javed ◽  
Ahmed Elzanaty ◽  
Osama Amin ◽  
Basem Shihada ◽  
Mohamed-Slim Alouini

<pre><pre>Hardware distortions (HWD) render drastic effects on the performance of communication systems. They are recently proven to bear asymmetric signatures; and hence can be efficiently mitigated using improper Gaussian signaling (IGS), thanks to its additional design degrees of freedom. Discrete asymmetric signaling (AS) can practically realize the IGS by shaping the signals' geometry or probability. In this paper, we adopt the probabilistic shaping (PS) instead of uniform symbols to mitigate the impact of HWD and derive the optimal maximum a posterior detector. Then, we design the symbols' probabilities to minimize the error rate performance while accommodating the improper nature of HWD. Although the design problem is a non-convex optimization problem, we simplified it using successive convex programming and propose an iterative algorithm. We further present a hybrid shaping (HS) design to gain the combined benefits of both PS and geometric shaping (GS). Finally, extensive numerical results and Monte-Carlo simulations highlight the superiority of the proposed PS over conventional uniform constellation and GS. Both PS and HS achieve substantial improvements over the traditional uniform constellation and GS with up to one order magnitude in error probability and throughput. </pre></pre>


Sign in / Sign up

Export Citation Format

Share Document