LC Manoharan, KR Chandrashekar, Suresh Kumar Muthuvel · Institutional Repository @ NAL (University of Southampton) · 1986
Measurement of Bit Rate (BR) amp; Bit Error Rate (BER)13; is essential f o r the assessment of performance of digital13; communication equipment including those of Fibreoptic (FOf13; digital data transmission. A very simple, easy to fabricate BR / BER monitor is described here. Both CMOS amp; TTL ICs are used here. This can be used for bit rates upto 10 MB/s and for both CMOS amp; TTL compatible equipment.
Cited by 0
Larry C. Andrews · SPIE eBooks · 2019
Cited by 1
Elsevier eBooks · 2001
Cited by 1
P. Jeppesen, B. Tromborg · Elsevier eBooks · 2024
Cited by 0
Piotr Miedzik, Piotr Koczoń · GSI Repository (GSI Helmholtzzentrum für Schwerionenforschung) · 2015
Cited by 0Open access
S. Chen, N. N. Ahmad, L. Hanzo · 2002
Cited by 0
Fowler, J., Kurple, W., Kobayaski, H. S. · NASA Technical Reports Server (NASA)
Bit error rate is measured by sending a pseudo-random noise (PRN) code test signal simulating digital data through digital equipment to be tested. An incoming signal representing the response of the equipment being tested, together with any added noise, is received and tracked by being compared with a locally generated PRN code. Once the locally generated PRN code matches the incoming signal a tracking lock is obtained. The incoming signal is then integrated and compared bit-by-bit against the locally generated PRN code and differences between bits being compared are counted as bit errors.
Cited by 0Open access
For Binary Signaling · 2007
We consider the design and adaptation of a linear equalizer with a finite number of coefficients in the context of a classical linear intersymbol-interference channel with Gaussian noise and a memoryless decision device. If the number of equalizer coefficients is sufficient, the popular minimum mean-squared-error (MMSE) linear equalizer closely approximates the optimal linear equalizer that directly minimizes bit-error rate (BER). However, when the number of equalizer coefficients is insufficient to approximate the channel inverse, the minimum-BER equalizer can outperform the MMSE equalizer by as much as 16 dB in certain cases. We propose a simple stochastic adaptive algorithm for realizing the minimum-BER equalizer. Compared to the least-mean-square algorithm, the proposed algorithm can provide a substantial reduction in BER with no increase in complexity.
Cited by 0
Sheng Chen · IEE Proceedings - Vision Image and Signal Processing · 2004
Adaptive filtering has traditionally been developed based on the minimum mean square error (MMSE) principle and has found ever-increasing applications in communications. The paper develops adaptive filtering based on an alternative minimum bit error rate (MBER) criterion for communication applications. It is shown that the MBER filtering exploits the non-Gaussian distribution of filter output effectively and, consequently, can provide significant performance gain in terms of smaller bit error rate (BER) over the MMSE approach. Adopting the classical Parzen window or kernel density estimation for a probability density function (pdf), a block-data gradient adaptive MBER algorithm is derived. A stochastic gradient adaptive MBER algorithm is further developed for sample-by-sample adaptive implementation of the MBER filtering. Extension of the MBER approach to adaptive nonlinear filtering is also discussed.
Cited by 23
R. Paschotta · 2005
Cited by 0
Iliescu, Irina, Willmut Zschunke · TUbilio (Technical University of Darmstadt) · 1997
Cited by 0
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
Mahmoud Aldababsa, Caner Göztepe, Güneş Karabulut Kurt et al. · IEEE Communications Letters · 2020
This letter examines the bit error rate (BER) performance of downlink non-orthogonal multiple access networks for binary phase-shift keying modulation. Exact BER expression is derived for each user in closed-form under additive white Gaussian noise and Rayleigh fading channels in perfect and imperfect successive interference cancellation (SIC) cases. Next, in perfect SIC case, the asymptotic BER expression in a high signal-to-noise ratio (SNR) region is obtained to express the behavior of the network with diversity and array gains. On the other hand, in imperfect SIC case, the upper bound for BER is attained, and at high SNR values, the BER reveals an error floor, and hence a zero diversity gain is achieved. Then, a feasible range of power allocation coefficients is found such that a good BER performance can be provided for each user. Finally, through simulations and software-defined radio-based real-time tests, analytical results are validated.
Cited by 113
Thomas, R., Huitema, C, Centre national d'etudes des telecommunications, Paris A, Division Telematique, informatique et mathematiques appliquees Issy-les-Moulineaux (FRANCE) · OpenGrey (Institut de l'Information Scientifique et Technique) · 1984
Cited by 0
Eugene Zhiwei Han · DR-NTU (Nanyang Technological University) · 2016
Uncoded transmissions are suitable for a low-noise environment, but these ideal conditions are not usually available. While a multitude of options exists for reducing errors during transmission, it is challenging to estimate the volume of additional resources required for an improvement in its error-reduction capability. As such, this report compares uncoded communication systems with some coding schemes, examining their resource efficiency and overall effectiveness. \nExtensive research has been conducted before and the literature of bit error rate (BER) and block error rate (BLER) relating to binary linear block code is widely available. This project strives to reinforce those findings by employing myriad simulative methods. Hamming-coded transmissions aid in reducing error caused by noise, but their performance varies across different orders of coding systems. Focussing on Hamming codes, a common platform where various types of Hamming codes can be normalized is built, allowing them to be compared based on BER and BLER. \nBER and BLER are examined in greater details as well, through both theoretical models and simulations. A relationship has been found between the two. It is observed that BLER is higher than BER in all cases. For Hamming codes, the relationship is BER = 3 𝑛� BLER, where 𝑛� is the length of the code. This linearity applies to non-perfect linear block code too. This report also highlights the importance of supporting theory with applications. An investigation into the discrepancy in errors correction between degrees of error reveals that Hamming code performs unpredictably when an error of greater than 1 is introduced. As such, careful analysis shows that many factors like 𝐸�𝑏�/𝑁�0 and predicted errors must be considered for each type of communication system.
Cited by 0
A. J. Lawrance, G. Ohama · Circuits Systems and Signal Processing · 2005
Cited by 7
Farinaz Edalat, Charles G. Sodini, Farinaz Edalat · 2003
In today's high-speed wireless communication applications, the simultaneous demand for bandwidth-efficient modulation schemes such as M-QAM and high power-efficiency of elec-tronic components in the system imposes a contradicting tradeoff. On one hand, with the RF power amplifier (PA) at the transmitter antenna being the major power "hungry " block in many such systems, high power-efficiency for the system is obtained when the PA con-sumes most of the little supplied dc power (e.g. from a battery) as RF power, which is the power delivered to the load. On the other hand, at high powers, the PA becomes nonlinear, which becomes problematic when the input to the PA has a time-varying envelope. More precisely, when an M-QAM modulated signal (which has varying envelope and phase) is transmitted, the PA nonlinearity characteristics adversely affect the system performance, such as degradation of the Bit Error Rate (BER). Although linearization and compensation techniques can be used to minimize the above mentioned degradation in system performance, such techniques are mostly not suitable for low-cost and small-size integrated-circuit implementations. As a result, to obtain an optimal
Cited by 0
Matt Booth · Opus: Research & Creativity (Indiana University – Purdue University Fort Wayne) · 1999
Cited by 0
2008
Abstract — In this paper a method for on-line estimation of the Bit Error Rate (BER) during turbo decoding process is presented. We model the log-likelihood ratios as a mixture of two Gaussian random variables and derive estimators for the mean and variance of these distributions, which can be used to estimate the BER. Index Terms — BER estimation, decoder convergence,Gaussian mixture, iterative decoding, stopping criterion, turbo-codes.
Cited by 0
Samingan, Ahmad Kamsani · ePrints Soton (University of Southampton) · 2003
<p>The Minimum Bit Error Rate (MBER) linear MUDs considered are designed for the synchronous downlink of Direct Sequence CDMA (DS-CDMA) systems, employing Binary Phase Shift Keying (BPSK) modulation as well as 4-level Quadrature Amplitude Modulation (4-QAM). An iterative non-adaptive algorithm capable of converging to the MBER solution was developed based on the Steepest Descent Gradient algorithm. A Simplified Conjugate Gradient algorithm was also proposed for the sake of improving the convergence speed of the Steepest Descent Gradient MBER algorithm. Our simulation results showed that the MBER MUD is capable of outperforming the MMSE MUD in terms of the achievable BER under various channel conditions. Furthermore, the MBER MUD is combined with Forward Error Correction (FEC) coding and several coded modulation schemes are invoked for the sake of enhancing the achievable BER performance.</p> <p>Adaptive versions of the MBER algorithm are also presented, which are initialised for example to the MMSE MUD weights and then iteratively adjust the weights until the MBER solution is reached. More specifically, two classes of adaptive algorithms are presented, namely block adaptive and sample-by-sample adaptive algorithms. Two algorithms belonging to the block adaptive category are referred to as the Block Adaptive Steepest-descent Gradient (BASG) and the Block Adaptive Conjugate Gradient (BACG) algorithms. Although the BACG algorithm is capable of a faster convergence to the MBER solution, this algorithm exhibits a higher sensitivity to the choice of the adaptive step size. Hence, a hybrid solution is preferred. Similarly, two sample-by-sample adaptive algorithms were derived, namely the Least Bit Error Rate (LBER) algorithm and the Approximate LBER (ALBER) arragement. Our simulation results demonstrated that both algorithms outperformed the Least Mean Square (LMS), the Difference approximation MBER (DMBER) and the Approximate MBER (AMBER) algorithms m terms of the attainable convergence speed and the steady state BER.</p>
Cited by 0