The Experts below are selected from a list of 139710 Experts worldwide ranked by ideXlab platform
Hideki Yoshikawa - One of the best experts on this subject based on the ideXlab platform.
-
on the bit Error Probability for constant log map decoding of convolutional codes
International Symposium on Information Theory and its Applications, 2016Co-Authors: Hideki YoshikawaAbstract:Maximum a posteriori Probability (MAP) decoding minimizes the symbol or bit Error Probability, however, few studies have performed an exact Error performance evaluation, although the optimality does not require explanation. The MAP algorithm is much more complex than maximum likelihood decoding methods, therefore, suboptimal MAP algorithms are considered for practical systems. The Max-Log-MAP decoding algorithm is one of several near optimum algorithms that reduce decoding complexity. However, it is shown that turbo decoding with Max-Log-MAP has an Error-performance degradation compared with MAP decoding. Log-MAP decoding can be realized using Max-Log-MAP decoding with a correction term, which corrects the Error induced by maximum approximation. Constant Log-MAP decoding employs the constant correction term instead of the log-domain correction term. In this paper, analytical results of bit Error Probability of convolutional codes with constant Log-MAP decoding are shown. Furthermore, the analytical results are compared with the result of Max-Log-MAP decoding, and the improvement by the correction term which correct Error induced by maximum approximation is presented, theoretically. The results show that the Error performance of constant Log-MAP decoding is slightly better than Max-Log-MAP decoding.
-
theoretical analysis of bit Error Probability for 4 state convolutional code with max log map decoding
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, 2008Co-Authors: Hideki YoshikawaAbstract:In this letter, a theoretical analysis of bit Error Probability for 4-state convolutional code with Max-Log-maximum a posteriori Probability (MAP) decoding is presented. This technique employs an iterative calculation of Probability density function of the state metric per one transition, and gives the exact bit Error Probability for all signal-to-noise power ratio.
-
theoretical analysis of bit Error Probability for max log map decoding
IEEE Transactions on Information Theory, 2007Co-Authors: Hideki YoshikawaAbstract:In this correspondence, an analytical technique for bit-Error Probability of 2-state convolutional code with Max-Log-maximum a posteriori Probability (MAP) decoding is presented. This technique employs an iterative calculation of the Probability density function (pdf) of the state metric per one transition, and gives the exact the bit-Error Probability for the overall signal-to-noise ratio (SNR)
-
exact analysis of bit Error Probability for trellis coded qpsk
IEEE Communications Letters, 2005Co-Authors: Hideki Yoshikawa, Ikuo Oka, Chikato FujiwaraAbstract:This letter presents an exact analysis of bit Error Probability for trellis coded modulation with soft decision Viterbi decoding. It is shown that this analytical technique is effective for low signal-to-noise power ratio where bounds are useless. The extension to asymmetric constellation is also investigated.
-
theoretical analysis for bit Error Probability of viterbi decoding over binary symmetric channel
International Conference on Communications, 2003Co-Authors: Hideki YoshikawaAbstract:In this paper, the exact analysis of bit Error Probability of 2- and 4-state Viterbi decoding over binary symmetric channels are demonstrated. It is shown that the results are effective for low signal-to-noise power ratio where bounds are useless. Furthermore, the extension to 2-state soft decision decoding is investigated.
Xiaodai Dong - One of the best experts on this subject based on the ideXlab platform.
-
The exact transition Probability and bit Error Probability of two-dimensional signaling
IEEE Transactions on Wireless Communications, 2005Co-Authors: Lei Xiao, Xiaodai DongAbstract: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.
-
A new approach to calculating the exact transition Probability and bit Error Probability of arbitrary two-dimensional signaling
IEEE Global Telecommunications Conference 2004. GLOBECOM '04., 2004Co-Authors: Lei Xiao, Xiaodai DongAbstract:A general method is presented for the computation of the exact bit Error Probability for arbitrary two-dimensional (2D) signaling with polygonal decision regions in various channel environments. This new approach is general in the sense that it applies to any coherent 2D constellation, any bit-to-symbol mapping, and various environments such as additive white Gaussian noise (AWGN) channels and slow fading channels with and without diversity reception and channel estimation Error. The considered performance measures include the exact bit Error Probability, the symbol Error Probability, the mutual information and the Error probabilities of individual bits in a constellation. The proposed new approach is exact and easy to evaluate, thus avoiding the need for computer simulation.
Idelfonso Tafur Monroy - One of the best experts on this subject based on the ideXlab platform.
-
Error Probability evaluation of optical systems disturbed by phase noise and additive noise
International Symposium on Information Theory, 1995Co-Authors: G Einarsson, J Strandberg, Idelfonso Tafur MonroyAbstract:A direct and efficient method for evaluation of the Error Probability of optical heterodyne receivers in the presence of phase noise is presented. Closed form expressions for the statistics of the decision variable, including photodetector shot noise and thermal noise from electronic circuitry, are shown. Amplitude shift keying (ASK), frequency shift keying (FSK) and differential phase-shift keying (DPSK) are examined.
-
Error Probability evaluation of optical systems disturbed by phase noise and additive noise
Journal of Lightwave Technology, 1995Co-Authors: G Einarsson, J Strandberg, Idelfonso Tafur MonroyAbstract:A direct and efficient method for evaluation of the Error Probability of optical heterodyne receivers in the presence of phase noise is presented. A closed form expression for the statistics of the decision variable, including photodetector shot noise and thermal noise from electronic circuitry, is derived. The analysis assumes simple integrating filters in the receiver and is based on a power series expansion of the filtered phase noise. The Error Probability is calculated using a saddle point approximation which is numerically simple and gives accurate results. The optimal prefilter bandwidth for best phase noise rejection is easily determined. >
M K Simon - One of the best experts on this subject based on the ideXlab platform.
-
new exponential bounds and approximations for the computation of Error Probability in fading channels
IEEE Transactions on Wireless Communications, 2003Co-Authors: Marco Chiani, Davide Dardari, M K SimonAbstract:We present new exponential bounds for the Gaussian Q function (one- and two-dimensional) and its inverse, and for M-ary phase-shift-keying (MPSK), M-ary differential phase-shift-keying (MDPSK) Error probabilities over additive white Gaussian noise channels. More precisely, the new bounds are in the form of the sum of exponential functions that, in the limit, approach the exact value. Then, a quite accurate and simple approximate expression given by the sum of two exponential functions is reported. The results are applied to the general problem of evaluating the average Error Probability in fading channels. Some examples of applications are also presented for the computation of the pairwise Error Probability of space-time codes and the average Error Probability of MPSK and MDPSK in fading channels.
-
evaluation of average bit Error Probability for space time coding based on a simpler exact evaluation of pairwise Error Probability
Journal of Communications and Networks, 2001Co-Authors: M K SimonAbstract:The moment generating function method previously proposed by the author for the analysis of uncoded and coded digital communication over fading channels using only a single transmitter is applied to provide a simple exact evaluation of the pairwise Error Probability (PEP) for space-time coded systems with multiple transmitters. In certain scenarios, the PEP (and therefore the approximation to the average bit Error Probability (BEP)) can be evaluated in closed form. An example of such a closed-form evaluation is presented for the 4-state space-time code described in the literature with both slow (constant over the length of a codeword) and fast (constant over the duration of a symbol) Rayleigh fading. The method also has the additional advantage of allowing for direct evaluation of the transfer function upper bound on average BEP for the latter case.
A Gorokhov - One of the best experts on this subject based on the ideXlab platform.
-
outage Error Probability for space time codes over rayleigh fading
International Symposium on Information Theory, 2001Co-Authors: A GorokhovAbstract:The coding gain and coding advantage criteria commonly used to analyse space-time codes are revisited. These criteria are based on the approximation of the average pairwise Error Probability achievable over a Rician multiple antenna channel at high signal-to-noise ratios. Both criteria appear to be inaccurate for a moderate number of antennas, especially in the environments with limited diversity and Rayleigh fading. In these cases, the average Error Probability may differ substantially from the outage Probability for practically considered outage rates. A closed form upper bound on the outage pairwise Error Probability is derived. This bound gives rise to an alternative measure of coding advantage and coding gain that depend on the outage rate.
