Evaluate the Word Error Rate of Binary Block Codes with Square Radius Probability Density Function
نویسندگان
چکیده
The word error rate (WER) of soft-decision-decoded binary block codes rarely has closed-form. Bounding techniques are widely used to evaluate the performance of maximum-likelihood decoding algorithm. But the existing bounds are not tight enough especially for low signal-to-noise ratios and become looser when a suboptimum decoding algorithm is used. This paper proposes a new concept named square radius probability density function (SR-PDF) of decision region to evaluate the WER. Based on the SR-PDF, The WER of binary block codes can be calculated precisely for ML and suboptimum decoders. Furthermore, for a long binary block code, SR-PDF can be approximated by Gamma distribution with only two parameters that can be measured easily. Using this property, two closed-form approximative expressions are proposed which are very close to the simulation results of the WER of interesting. Index Terms Binary block codes, bounds, decision region, square radius probability density function, word error rate.
منابع مشابه
Protograph LDPC Codes with Block Thresholds: Extension to Degree-1 and Generalized Nodes
Protograph low-density-parity-check (LDPC) are considered to design near-capacity lowrate codes over the binary erasure channel (BEC) and binary additive white Gaussian noise (BIAWGN) channel. For protographs with degree-one variable nodes and doubly-generalized LDPC (DGLDPC) codes, conditions are derived to ensure equality of bit-error threshold and block-error threshold. Using this condition,...
متن کاملUnified Error Probability Analysis for Error Correcting Codes with Different Decoding Algorithms
The error rate of error correcting codes with soft-decision-decoding rarely has a closed-form expression. Bounding techniques are widely used to evaluate the performance of maximum-likelihood decoding algorithm. But the existing bounds are not tight enough especially for a low signal-to-noise ratios region and become looser when a suboptimum decoding algorithm is used. The radius of decision re...
متن کاملCombinatorial bounds for list decoding
Informally, an error-correcting code has “nice” listdecodability properties if every Hamming ball of “large” radius has a “small” number of codewords in it. Here, we report linear codes with non-trivial list-decodability: i.e., codes of large rate that are nicely listdecodable, and codes of large distance that are not nicely list-decodable. Specifically, on the positive side, we show that there...
متن کاملComparison of decoding algorithms of binary linear block codes in Rayleigh fading channels with dive - Electronics Letters
The word error probability of binary linear block codes is evaluated in Rayleigh fading channels with diversity reception far three decoding algorithms: error correction (EC), errorlerasure correction (EEC). and maximum likelihood (MLI soft decoding algorithms. The performance advantage of EEC over EC In the required average SNR decreases as the number of ditersity channels increases. The perfo...
متن کاملDecoding Error Probability of Binary Linear Block Codes
The performance of maximum-likelihood (ML) decoded binary linear block codes is addressed via the derivation of tightened upper bounds on their decoding error probability. The upper bounds on the block and bit error probabilities are valid for any memoryless, binary-input and outputsymmetric communication channel, and their effectiveness is exemplified for various ensembles of turbo-like codes ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0710.1916 شماره
صفحات -
تاریخ انتشار 2007