Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 394 papers for “bit error probability upper bound”
Poramate Tarasak, Nandana Rajatheva · Electronics Letters · 1999
A new upper bound on the bit error probability using Chernoff's bound of trellis code modulation (TCM) is introduced. It can be applied to a frequency-selective Rayleigh fading channel. The bound indicates a new design criterion, which is the product of the intersymbol interference (ISI) distance.
Cited by 2
Göran Lindell, Carl-Erik Sundberg, Arne Svensson · Chalmers Publication Library (Chalmers University of Technology) · 1985
Cited by 0
Marc H, Rolf Johannesson, James L. Massey et al. · 2015
Abstract- When concatenated coding schemes op-erate near channel capacity their component encoders may operate above capacity. The decoding bit-error performance of binary convolutional codes near and above capacity is investigated. Let G ( D) be a b x c generator matrix of a rate R = b /c con-volutional code. We define a tap-minimal right pseudo inverse of the generator matrix G(D) to be a right pseudo inverse of G ( D) with the minimum number of taps among all right pseudo inverses. By the number of “taps ” in a right pseudo inverse we mean the total number of nonzero coefficients in the power series that are entries of this c x b matrix. We now define the pseudo-inverse decoder (T-decoder) for convolutional codes. Assume that we use a convolutional code C encoded by the generator matrix G(D) for transmission over
Cited by 0
M. Handlery, Rolf Johannesson, James L. Massey et al. · Lund University Publications (Lund University) · 2002
When concatenated coding schemes operate near channel capacity their component encoders may operate above capacity. The decoding bit-error performance of binary convolutional codes near and above capacity is investigated.
Cited by 1Open access
Jia Liu, Mingyu Zhang, Chaoyong Wang et al. · Discrete Dynamics in Nature and Society · 2020
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. The proposed bound on the bit error probability is derived with the framework of Gallager’s first bounding technique (GFBT), where the Gallager region is defined to be an irregular high-dimensional geometry by using a list decoding algorithm. The proposed bound on the bit error probability requires only the knowledge of weight spectra, which is helpful when the input-output weight enumerating function (IOWEF) is not available. Numerical results show that the proposed bound on the bit error probability matches well with the maximum-likelihood (ML) decoding simulation approach especially in the high signal-to-noise ratio (SNR) region, which is better than the recently proposed Ma bound.
Cited by 0Open access
Yonghui Li, Branka Vucetic · Electronics Letters · 2004
A tight upper bound for the bit error probability of the combined space-time block codes and ideal beamforming is derived. The resulting upper bound is compared to the simulated BER performance, showing a tight approximation at both low and high SNR.
Cited by 0
Peter Schramm · 2002
A tight upper bound on the bit error probability of convolutionally encoded spread spectrum communication over frequency-selective Rayleigh-fading channels is derived. It is shown that combining coding and multipath propagation leads to a multiplication of time and multipath diversity. The main difference between the two types of diversity is that in contrast to time diversity the multipath diversity is achieved by splitting the total transmitted power. This fact has fundamental consequences to the effects of both types of diversity on the performance of coded spread spectrum systems. Finally, the results are used to predict the performance of CDMA systems.
Cited by 18
Smith, Bancroft O. B. · Journal of International Crisis and Risk Communication Research · 1990
The most significant indicator of the performance of a multiple access packet radio network is its packet error probability. Packet errors in a multiple access system are a result of noise at the receiver and interference between packet transmissions. In this thesis, we compute an upper bound on the packet error probability induced in a direct sequence spread spectrum (DS-SS) multiple access packet radio network when convolutional or BCH codes are used for the encoding of the packets. More specifically, an upper bound on the bit error probability is first developed. Then, this upper bound is used to calculate upper bounds on the packet error probability for BCH codes. For convolutional codes, the upper bound on the final packet error probability, is a result of an upper bound on the packet error probability, an upper bound on the first event error probability and an upper bound on the bit error probability taken in that order. Due to the multiple bounds (three) introduced to compute the upper bound on the packet error probability for convolutional codes compared to the single upper bound utilized to evaluate upper bounds on the packet error probability for the BCH code, it is evident, that the above analysis favors the BCH over the convolutional codes. To remedy this shortcoming, we built a simulator package that allows you to compute upper bound on the packet error probability induced by convolutional codes utilizing, as in the case of the BCH code, only the upper bound on the bit error probability. The simulator permits the user to enter such parameters as constraint length, bit error probability and decode depth of the utilized Viterbi decoder. At the end of each run the simulator produces the number and the specific positions of the bits that remained uncorrected by the Viterbi decoder from which the packet error probability can be determined. From our results, a fair comparison of the performance of the BCH and convolutional codes in DS-SS multiple access packet radio network.
Cited by 0Open access
Hyundong Shin, Jae Hong Lee · 2002
We investigate an improved upper bound on the bit error probability of turbo codes for the maximum likelihood (ML) decoding with imperfect channel state information (CSI) in a fully interleaved Rayleigh fading channel. The upper bound is based on the Viterbi & Viterbi (see Proc. of the IEEE Inform. Theory Workshop '98, San Diego, CA, Feb. 1998, p.72) bound and is also compared with iterative decoding using the log-MAP algorithm. It is shown that the upper bound well approximates the simulation results of the iterative decoding below a BER of 10/sup -5/.
Cited by 3
Jang, Won Mee · Insecta mundi · 2011
We present a simple upper bound of the Gaussian Q-function with its closed-form error bound. The proposed approximation can be applied to the evaluation of the average error probability of digital modulations with its error bound. Our bit error rate (BER) bound can be easily applied to fading channels.
Cited by 0Open access
Jang, Won Mee · Insecta mundi · 2011
We present a simple upper bound of the Gaussian Q-function with its closed-form error bound. The proposed approximation can be applied to the evaluation of the average error probability of digital modulations with its error bound. Our bit error rate (BER) bound can be easily applied to fading channels.
Cited by 0Open access
Yuh-Long Chen, Che‐Ho Wei · IEE Proceedings F Communications Radar and Signal Processing · 1987
It is known that convolutional coding and Viterbi decoding together with high-level modulation can provide error-control protection without sacrificing bandwidth efficiency on additive white Gaussian noise (AWGN) channels. Bearing this in mind, the paper is concerned with the performance of short constraint length convolutional codes in conjunction with M-ary phase-shift-keyed modulation and maximum-likelihood Viterbi decoding on the fully interleaved Rician fading channels. The primary interest is in the bit error probability performance as a function of system parameters and channel parameters. The generating function union bounding approach is applied, and fairly general analytic upper bounds on the event and bit error probability performance are developed. The bit error probability performance of selected rate-1/2 optimum codes with QPSK and of selected rate-2/3 Ungerbock codes and the Hui code with 8PSK are evaluated using the developed bound. The tightness of the analytic upper bound on bit error probability is also checked by means of computer simulation.
Cited by 5
Sergio Benedetto, G. Montorsi · 2002
We propose an analytical method to upper bound the bit error probability of parallel concatenated block and convolutional codes.
Cited by 13
F. Hemmati, Daniel J. Costello · IEEE Transactions on Communications · 1977
An upper bound on the bit error probability due to truncation of the path length in Viterbi decoding is obtained for any given convolutional code. This bound is then used to determine the path length at which the additional error probability due to truncation becomes negligible compared to the maximum likelihood decoding error probability. These results are tested by simulation using several short constraint length codes.
Cited by 53
P. Shamain, L.B. Milstein · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2003
We obtain the exact pairwise error probability for an MPSK based space-time code employing receive diversity and noisy channel estimates and experiencing fast Rayleigh fading. The exact expression for the pairwise error probability lends itself to the application of classical transfer bounding techniques. We also obtain a union bound by applying the transfer function bound in conjunction with the pairwise error probability, and show that the union bound is within a few dBs for fast Rayleigh fading. In the case of MQAM based space-time codes and/or quasi-static Rayleigh fading channels, the same technique provides an upper bound on the pairwise error probability, which, in conjunction with the transfer function bound, is used to obtain a union bound on the bit error rate.
Cited by 0
S.A. Al-Semari · 2002
An exact expression for the pairwise error probability of convolutionally encoded spread spectrum BPSK with ideal interleaving and RAKE reception over frequency selective Rayleigh fading channels is presented. This expression is used to find a tight upper bound on the bit error probability using the transfer function approach.
Cited by 1
Van-Thien Luong, Minh-Tuan Le, Hong-Anh Mai et al. · 2015
In this paper, we present a new upper bound for the bit error probability (BEP) of the so-called Space Time Block Coded Spatial Modulation (STBC-SM) system introduced by E. Basar et al. in [1] over a quasi-static Rayleigh fading channel. Based on the Verdu's theorem [2], the concept of the spatial constellation (SC) codewords and maximum likelihood (ML) decoder in [3], the upper bound is obtained by eliminating a number of redundant pairwise error probabilities (PEPs). Our approach leads to a new upper bound, which is tighter than the union bound. Consequently, it allows us to evaluate the bit-error performance of STBC-SM systems more exactly, particularly when the signal-to-noise power ratio (SNR) is sufficiently high.
Cited by 3
Van-Thien Luong, Minh-Tuan Le, Dong Nhat Nguyen et al. · 2015
In this paper, we present a new upper bound for the bit error probability (BEP) of the so-called High-Rate Spatial Modulation (HR-SM) system using QAM modulation introduced by Thu Phuong Nguyen et al. in [1], over a quasi-static Rayleigh fading channel. Our approach based on the Verdu's theorem [2], the concept of the spatial constellation (SC) codewords and maximum likelihood (ML) decoder in [1] results in the new upper bound which is tighter than the union bound due to eliminating a number of redundant pairwise error probabilities (PEPs). Therefore, by using the new upper bound rather than the union bound, we can evaluate the bit-error performance of HR-SM systems more exactly, especially when the signal-to-noise power ratio (SNR) is sufficiently high.
Cited by 0
A.W. Lam · Electronics Letters · 1992
Arbitrarily tight upper and lower bounds on the probability of bit error (PBE) for direct-detection avalanche photodiode detector (APD) based code-division multiple-access (CDMA) communication systems are presented. Previously, only the Chernoff upper bound (CB), modified Chernoff upper bound (MCB), and Gaussian approximation (GA) of the PBE have been available. The MCB is calibrated.
Cited by 1
Lihbor Yiin, G.L. Stüber · 2002
A coherent receiver for interleaved partial response trellis coded continuous phase modulation (TC-CPM) is derived. A true upper bound on the bit error probability for flat fading channels is derived, by showing that TC-CPM is equivalent to a TCM scheme. The upper bound is evaluated by defining an error-state diagram along with a set of characteristic distances, and then applying transfer function bounding techniques. Comparison with simulation results shows that the upper bound is tight to within 1.5-2 dB.
Cited by 6