Results 1 to 10 of about 39,209 (145)
Expressions for bit error probability [PDF]
AbstractThe bit error probability (BEP) for many wireless communications networks can be expressed in the form R = Pr (X2 < X1) where X1 and X2 are independent random variables. Here, a comprehensive collection of formulas is derived for R by assuming the most commonly known models for X1 and X2.
Saralees Nadarajah, Samuel Kotz
openaire +1 more source
Ratio-based multi-level resistive memory cells
Ratio-based encoding has recently been proposed for single-level resistive memory cells, in which the resistance ratio of a pair of resistance-switching devices, rather than the resistance of a single device (i.e.
Miguel Angel Lastras-Montaño +5 more
doaj +1 more source
Closed-Form Bit Error Probabilities for FBMC Systems [PDF]
This paper analyses the data reconstruction effects emerged from the deployment of non-perfect prototype filters in Filter Bank MultiCarrier (FBMC) systems operating over Additive White Gaussian Noise (AWGN) and frequency-flat Rayleigh channels considering frequency-flatness for each subcarrier. This goal is attained by studying the Bit Error Rate (BER)
Ricardo Tadashi Kobayashi, Taufik Abrao
openaire +2 more sources
Calculating the required number of bits in the function of confidence level and error probability estimation [PDF]
This paper proposes the calculation of the required number of bits transmitted in the system, in order to achieve the desired level of confidence.
Mitić Dragan +2 more
doaj +1 more source
In this paper, a new approach is introduced to reduce bit stuffing and consequently residual error probability in the controller area network (CAN). The proposed method is based on XOR masking.
Reza Alaei, Payman Moallem, Ali Bohlooli
doaj +1 more source
Bit Error Probability for Large Intelligent Surfaces Under Double-Nakagami Fading Channels
In this work, we investigate the probability distribution function of the channel fading between a base station, an array of intelligent reflecting elements, known as large intelligent surfaces (LIS), and a single-antenna user. We assume that both fading
Ricardo Coelho Ferreira +4 more
doaj +1 more source
On decoding bit error probability for binary convolutional codes [PDF]
An explanation is given for the paradoxical fact that, at low signal-to-noise ratios, the systematic feedback encoder results in fewer decoding bit errors than does a nonsystematic feedforward encoder for the same code. The analysis identifies a new code property, the d-distance weight density of the code.
Johannesson, Rolf +2 more
openaire +2 more sources
Upper Bound on the Bit Error Probability of Systematic Binary Linear Codes via Their Weight Spectra
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.
Jia Liu +5 more
doaj +1 more source
In this paper, we determine the probability of erroneous decoding of integer codes capable of correcting asymmetric CT-bursts, unidirectional solid bursts, and symmetric bursts within a b-bit byte.
Nabin Kumar Pokhrel, Pankaj Kumar Das
doaj +1 more source
Error probability analysis of bit-interleaved coded modulation [PDF]
This correspondence presents a simple method to accurately compute the error probability of bit-interleaved coded modulation (BICM). Thanks to the binary-input output-symmetric (BIOS) nature of the channel, the pairwise error probability (PEP) is equal to the tail probability of a sum of random variables with a particular distribution. This probability
Martinez, A. +2 more
openaire +2 more sources

