2009
This chapter contains sections titled: Introduction Bit Error Ratio and Bit Error Rate Definitions OSNR and Spectral Matching Carrier-to-Noise Ratio Shannon's Limit Optical Signal-to-Noise Ratio Probability and Statistics 101 Bit Error Probability Bit Error Contributors Bit Error Rate Optical Signal-to-Noise Ratio Channel Capacity and SNR The Quality or Q-Factor Bit Error Monitoring BER and Data Patterning BER and Eye Diagram Eye-Pattern Mask References Standards
Cited by 2
Sean Coffey, Houshou Chen · 2000
. The problem of decoding a binary linear code used over a binary symmetric channel so as to minimize bit error probability, rather than codeword error probability, is studied. In general, there are substantial differences with the maximum likelihood case. The optimal decoding rule depends on the crossover probability of the channel, the bit error probability depends on the generator matrix used, and the optimal generator matrix itself depends on the crossover probability of the channel. This paper demonstrates each of the above properties. In addition, an infinite class of codes whose optimal generator matrix is non-systematic when the channel crossover probability is small is demonstrated. A new demonstration of the following facts is presented: if the code has d ? ? 2, then for a sufficiently noisy channel, the optimal generator matrix is (uniquely) a (widesense) systematic one, and the optimal decoding rule is to ignore the parity checks and to take the information bits as they ...
Cited by 0
R. A. Rojas, E. Banta · IEEE Transactions on Communication Technology · 1964
Cited by 0
Temuri Berianidze, Nana Rostiashvili · Theoretical & Applied Science · 2022
Cited by 0Open access
Matti Latva-aho · 2007
The wideband code-division multiple access (CDMA) concept (FMA2) developed in the European FRAMES AC090 project supports variable data rate transmission. The data rate can be altered by changing either the spreading factor or by using multiple spreading codes in parallel. In order to facilitate flexible changing of data rate, orthogonal Walsh codes are used for channel separation, followed by scrambling code. Optional short scrambling codes can be used if interference suppression is used. In this paper the downlink performance of the FMA2 system using both conventional RAKE and LMMSE-RAKE receivers is studied. According to the numerical results, the performance of the conventional RAKE receivers is insufficient at lowest spreading factors, whereas the the LMMSE-RAKE performs well regardless of the spreading factor. Hence, the final specification for ETSI ff-group proposal should facilitate interference suppression also in the downlink, and not only for the uplink due to relatively bad ...
Cited by 0
A. J. Lawrance, G. Ohama · Circuits Systems and Signal Processing · 2005
Cited by 7
D. Lao, Alexander M. Haimovich · IEEE Transactions on Communications · 2004
New expressions are derived for the exact symbol error probability and bit-error probability for optimum combining with multiple phase-shift keying. The expressions are for any numbers of equal-power cochannel interferers and receive branches. It is assumed that the aggregate interference and noise is Gaussian and that both the desired signal and interference are subject to flat Rayleigh fading. The new expressions have low computational complexity, as they contain only a single integral form with finite limits and finite integrand.
Cited by 8
Jun Muramatsu · 2022 IEEE International Symposium on Information Theory (ISIT) · 2022
This paper introduces techniques to construct binary polar source/channel codes based on the bit error probability of successive-cancellation decoding. Techniques to compute the bit error probability based on the symmetric parameterization of joint sources are introduced. These techniques can be applied to the construction of polar codes and the computation of lower and upper bounds of the block decoding error probability.
Cited by 2
Alfonso García Martínez, Albert Guillén i Fàbregas, G. Caire · IEEE Transactions on Information Theory · 2005
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 is in turn computed with a saddlepoint approximation. Its precision is numerically validated for coded transmission over standard Gaussian noise and fully interleaved fading channels for both convolutional and turbo-like codes.
Cited by 123Open access
Erik Agrell, Erik G. Ström · Chalmers Publication Library (Chalmers University of Technology) · 2006
Labelings of multilevel PSK constellations are analyzed with respect to the error probability for individual bit positions, when symbols are transmitted over additive noise channels.When the maximum bit error probability is minimized instead of the average, the best labeling is in general not a Gray code.We develop a new class of labelings by modifying balanced Gray codes into better, but non-Gray, labelings.
Cited by 2Open access
Iandra Galdino, Didier Le Ruyet, Marcello L. R. de Campos et al. · IEEE Communications Letters · 2022
Quadrature Amplitude Modulation based Filter-Bank Multi-Carrier (QAM-FBMC) is a promising technology to replace Orthogonal Frequency Division Multiplexing (OFDM) in future radio access systems. In this letter, we derive a bit error probability expression of QAM-FBMC systems over AWGN channels and over Rayleigh fading channels. We model the intrinsic interference related to the prototype filter through the interference table and consider the interference distribution to derive the bit error probability in QAM-FBMC systems. Numerical results reveal that the proposed expressions pair perfectly with the simulation results.
Cited by 10
افاضاتی، سارا, Sara Efazati · 2010
Cited by 0
Michael P. Fitz, J.P. Seymour · International Journal of Wireless Information Networks · 1994
Cited by 64
Lei Xiao, Xiaodai Dong · IEEE Transactions on Wireless Communications · 2005
A new signal-space partitioning method is proposed for the calculation of transition probabilities of arbitrary two-dimensional (2-D) signaling with polygonal decision regions. This enables straightforward formulation of exact bit error probability, symbol error probability, mutual information (MI), and error probabilities of individual bits in the constellation. Previously published symbol error rate (SER) results for additive white Gaussian noise (AWGN) and various fading channels, diversity reception, and imperfect channel estimation (ICE) can all be used in conjunction with the new signal-space partitioning method to obtain the desired performance measures. Numerical results of the bit error rates (BERs) of several 8-ary and 16-ary constellations in AWGN and in Rayleigh, Ricean, and Nakagami fading channels with diversity reception are presented. Pilot-symbol-assisted 2-D signaling is also studied. The proposed new approach is both exact and numerically efficient. It provides new insights into the effect of bit mapping, constellation parameter optimizations, unequal error protection (UEP) at different bit positions, and performance comparisons of different constellations.
Cited by 20
Stigter, P.A. (author) · Research Repository (Delft University of Technology) · 1993
This report presents a model for Bit Error Probability evaluation for frequency selective multipath channels. This model has been used to calculate BEP results for channel measurements carried out at the TNO-FEL laboratory. In this model a coherent BPSK receiver is assumed with optimum symbol timing, and which uses a squaring loop for carrier recovery. It is shown that a receiver without diversity has poor performance in many cases. A system with several antennas is expected to have much better performance.
Cited by 0
Of Code Synchronization, Elena-simona Lohan, Markku Renfors · 2003
We derive here a simple and accurate theoretical method for computing the bit-error-probability (BEP) of a direct-sequence spread spectrum (DS-SS) receiver using maximum ratio combiner (MRC), in the presence of code synchronization errors, root raised cosine (RRC) pulse shaping, and Rayleigh fading channels with correlated paths. Theoretical BEP curves with QPSK modulation are validated by link level simulations for different downlink Rayleigh fading channels. The impact of the delay estimation errors on the performance of Rake receiver is analyzed for both closely-spaced and distant channel taps, and for different path correlation coefficients.
Cited by 0
Nemanja Stefan Perović · 2024
Dynamic metasurface antennas (DMAs) are an alternative application of metasurfaces as active reconfigurable antennas with advanced analog signal processing and beamforming capabilities, which have been proposed to replace conventional antenna arrays for next-generation transceivers. Motivated by this, we investigate the bit error probability (BEP) optimization in a DMA-based system, propose an iterative optimization algorithm, which adjusts the transmit precoder and the weights of the DMA elements, prove its convergence and derive complexity.
Cited by 0
Jeff D. Laster, Jeffrey H. Reed, William H. Tranter · IEEE Transactions on Vehicular Technology · 2003
The concept of real-time bit error rate (BER) estimation based on probability density function (PDF) estimators of the decision statistic is discussed. Communications systems need techniques to approximate real-time BER estimation without resorting to brute-force error counting methods. Due to the dynamic nature of the wireless channel, a priori (deductive) estimation techniques (e.g., where knowledge of signal impairments is assumed before demodulation) are often unreliable. A posteriori (inductive) estimation techniques (e.g., where knowledge of signal impairments is acquired after the signal is demodulated) are preferable because they assume no prior knowledge of the channel. Two a posteriori techniques are described that yield reliable BER estimates over small observation intervals: (1) the Gram-Charlier series approximation for PDFs and (2) Parzen's PDF estimator. Robust estimators of location and scale are also employed to improve the performance of Gram-Charlier estimation. The performance of BER estimation based on the PDF estimators is validated by simulations. A 1-bit differential demodulator (DD1) is used to demodulate a Gaussian minimum shift keying signal, and Gram-Charlier-based and Parzen (1962) based BER estimations are compared to measured DD1 results. Comparisons are made for BER estimation versus measured BER in additive white Gaussian noise (AWGN) and cochannel interference (CCI) channels and in urban multipath with AWGN and CCI.
Cited by 32
Göran Lindell, Carl-Erik Sundberg, Arne Svensson · Chalmers Publication Library (Chalmers University of Technology) · 1985
Cited by 5
Seungju Woo, Sungho Kim, Minha Park et al. · IEEE Communications Letters · 2025
This letter proposes an enhanced method for calculating the error probability of multi-bit nodes in the SC-decoding tree of polar codes. We prove that the number of effective bits influencing the error probability for a multi-bit node corresponds to the number of information bits under the multi-bit node. Using this fact, we refine the error probability originally proposed in OEB-aided SCL decoding by considering only effective bits, which allows accurate estimation of one-error and multi-error probabilities. Simulation results show that the corrected error probabilities closely match the actual probabilities, even with frozen bits present under multi-bit nodes.
Cited by 0