Topic

# Bit error rate

About: Bit error rate is a(n) research topic. Over the lifetime, 43142 publication(s) have been published within this topic receiving 508173 citation(s). The topic is also known as: Bit error ratio & BER.

##### Papers published on a yearly basis

##### Papers

More filters

•

01 Jan 2004

TL;DR: The book gives many numerical illustrations expressed in large collections of system performance curves, allowing the researchers or system designers to perform trade-off studies of the average bit error rate and symbol error rate.

Abstract: noncoherent communication systems, as well as a large variety of fading channel models typical of communication links often found in the real world, including single- and multichannel reception with a large variety of types. The book gives many numerical illustrations expressed in large collections of system performance curves, allowing the researchers or system designers to perform trade-off studies of the average bit error rate and symbol error rate. This book is a very good reference book for researchers and communication engineers and may also be a source for supplementary material of a graduate course on communication or signal processing. Nowadays, many new books attach a CD-ROM for more supplementary material. With the many numerical examples in this book, it appears that an attached CD-ROM would be ideal for this book. It would be even better to present the computer program in order to be interactive so that the readers can plug in their arbitrary parameters for the performance evaluation. —H. Hsu

6,398 citations

••

23 May 1993Abstract: A new class of convolutional codes called turbo-codes, whose performances in terms of bit error rate (BER) are close to the Shannon limit, is discussed. The turbo-code encoder is built using a parallel concatenation of two recursive systematic convolutional codes, and the associated decoder, using a feedback decoding rule, is implemented as P pipelined identical elementary decoders. >

5,895 citations

••

28 Apr 1996TL;DR: There is a constant power gap between the spectral efficiency of the proposed technique and the channel capacity, and this gap is a simple function of the required bit-error rate (BER).

Abstract: We propose a variable-rate and variable-power MQAM modulation scheme for high-speed data transmission over fading channels. We first review results for the Shannon capacity of fading channels with channel side information, where capacity is achieved using adaptive transmission techniques. We then derive the spectral efficiency of our proposed modulation. We show that there is a constant power gap between the spectral efficiency of our proposed technique and the channel capacity, and this gap is a simple function of the required bit-error rate (BER). In addition, using just five or six different signal constellations, we achieve within 1-2 dB of the maximum efficiency using unrestricted constellation sets. We compute the rate at which the transmitter needs to update its power and rate as a function of the channel Doppler frequency for these constellation sets. We also obtain the exact efficiency loss for smaller constellation sets, which may be required if the transmitter adaptation rate is constrained by hardware limitations. Our modulation scheme exhibits a 5-10-dB power gain relative to variable-power fixed-rate transmission, and up to 20 dB of gain relative to nonadaptive transmission. We also determine the effect of channel estimation error and delay on the BER performance of our adaptive scheme. We conclude with a discussion of coding techniques and the relationship between our proposed modulation and Shannon capacity.

2,322 citations

••

Institut Eurécom

^{1}TL;DR: By examining the bit error-rate with antipodal signalling, it is shown that an increase in capacity over a perfectly-power controlled (Gaussian) channel can be achieved, especially if the number of users is large, and the inherent diversity in multiuser communications over fading channels is shown.

Abstract: We consider a power control scheme for maximizing the information capacity of the uplink in single-cell multiuser communications with frequency-flat fading, under the assumption that the users attenuations are measured perfectly. Its main characteristics are that only one user transmits over the entire bandwidth at any particular time instant and that the users are allocated more power when their channels are good, and less when they are bad. Moreover, these features are independent of the statistics of the fading. Numerical results are presented for the case of single-path Rayleigh fading. We show that an increase in capacity over a perfectly-power controlled (Gaussian) channel can be achieved, especially if the number of users is large. By examining the bit error-rate with antipodal signalling, we show the inherent diversity in multiuser communications over fading channels.

2,247 citations

••

27 Nov 1989

TL;DR: The Viterbi algorithm is modified to deliver the most likely path sequence in a finite-state Markov chain, as well as either the a posteriori probability for each bit or a reliability value, with the aim of producing soft decisions to be used in the decoding of outer codes.

Abstract: The Viterbi algorithm (VA) is modified to deliver the most likely path sequence in a finite-state Markov chain, as well as either the a posteriori probability for each bit or a reliability value. With this reliability indicator the modified VA produces soft decisions to be used in the decoding of outer codes. The inner software output Viterbi algorithm (SOVA) accepts and delivers soft sample values and can be regraded as a device for improving the signal-to-noise ratio, similar to an FM demodulator. Several applications are investigated to show the gain over the conventional hard-deciding VA, including concatenated convolutional codes, concatenation of trellis-coded modulation with convolutional FEC (forward error correcting) codes, and coded Viterbi equalization. For these applications additional gains of 1-4 dB as compared to the classical hard-deciding algorithms were found. For comparison, the more complex symbol-to-symbol MAP, whose optimal a posteriori probabilities can be transformed into soft outputs, was investigated. >

1,814 citations