Asymptotic and finite-length performances

نویسنده

  • Andrea Montanari
چکیده

Note that the symmetry property implies that the channel output coincides with the log-likelihood ratio `(y) = y. By this correspondence, symmetric densities admit a partial ordering by physical degradation Z1 Z2 if the corresponding chanels are ordered in the same way Q1 Q2 (i.e. Q1 is less noisy than Q2). Consider now belief propagation decoding with messages {hi→a}, {ĥa→i} and soft decisions {hi}, all of these in the log-likelihood ratio domain. We saw that –as n→∞– these converge to limit random variables described by density evolution

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Overlapped Circular SC-LDPC Codes and Their Modified Coupled Codes

In this paper, overlapped circular spatially-coupled low-density parity-check codes (OC-LDPC) are proposed and their modified coupled codes are derived, which show better performance compared with the spatially-coupled low-density parity-check (SC-LDPC) codes. It is known that the SC-LDPC codes show asymptotically good performance when the chain length is sufficiently large. However, a large ch...

متن کامل

Some Asymptotic Results of Kernel Density Estimator in Length-Biased Sampling

In this paper, we prove the strong uniform consistency and asymptotic normality of the kernel density estimator proposed by Jones [12] for length-biased data.The approach is based on the invariance principle for the empirical processes proved by Horváth [10]. All simulations are drawn for different cases to demonstrate both, consistency and asymptotic normality and the method is illustrated by ...

متن کامل

Non-Asymptotic and Asymptotic Analyses of Information Processing on Markov Chains

We study finite-length bounds for source coding with side information for Markov sources and channel coding for channels with conditional Markovian additive noise. For this purpose, we propose two criteria for finite-length bounds. One is the asymptotic optimality and the other is the efficient computability of the bound. Then, we derive finite-length upper and lower bounds for coding length in...

متن کامل

Asymptotic Distributions of Estimators of Eigenvalues and Eigenfunctions in Functional Data

Functional data analysis is a relatively new and rapidly growing area of statistics. This is partly due to technological advancements which have made it possible to generate new types of data that are in the form of curves. Because the data are functions, they lie in function spaces, which are of infinite dimension. To analyse functional data, one way, which is widely used, is to employ princip...

متن کامل

On optimal permutation codes

Permutation codes are vector quantizers whose codewords are related by permutations and, in one variant, sign changes. Asymptotically, as the vector dimension grows, optimal Variant I permutation code design is identical to optimal entropy-constrained scalar quantizer (ECSQ) design. However, contradicting intuition and previously published assertions, there are finite block length permutation c...

متن کامل

Semi-Analytical Modeling of Electromagnetic Performances in Magnet Segmented Spoke-Type Permanent Magnet Machine Considering Infinite and Finite Soft-Magnetic Material Permeability

In this paper, we present a semi-analytical model for determining the magnetic and electromagnetic characteristics of spoke-type permanent magnet (STPM) machine considering magnet segmentation and finite soft-material relative permeability. The proposed model is based on the resolution of the Laplace’s and Poisson’s equations in a Cartesian pseudo-coordinate system with respect to the relative ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016