. 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

New results on estimations of the burst and bit error probabilities for fixed convolutional codes

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

ABSTRACT 1 The most common metric for evaluating the performance of an optical communications system is the symbol error probability (SEP) versus the received optical power. In circuit-like optical systems employing binary transmission such as WDM, this SEP takes the form of the Bit Error Rate (BER

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 ...

Abstract In this paper, an exact expression for the average bit error probability was obtained for the λ-MRC detector, proposed in Sendonaris et al. (IEEE Trans Commun 51: 1927-1938, IEEE Trans. Commun 51: 1939-1948, under Rayleigh fading channel. In addition, a very accurate approximation

In this paper the bit error probability rather than the lower bound for two interferences is evaluated. The signal, interferences and noise are applied at the input to the phase-coherent communication receiver and an expression for the bit error probability is derived for the case when

0 New expressions are derived for the exact symbol error probability and bit error probability for OC with multiple phase-shift keying. The expressions are for any numbers of equal power co-channel interferers and receive branches. It is assumed that the aggregate interference and noise is Gaussian

Bit error probability evaluation of Tkellis-Coded Modulation (TCM) over fading channels is rather complicated, and the analytical results are limited to loose upper bounds leaving the system designer with the only option of simulation. Cavers and Ho [l] have derived an ezacl analytical expression

All Rayleigh fading channel simulators basing on finite sums of weighted harmonic functions with determined frequencies and phases are constitutionally deterministic. In this paper, we analyze the performance of this important class of fading channel simulators with respect to the bit error