اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدLikelihood ratios and Bayesian inference for Poisson channels
198
0
0.0
(
0
)
نشر من قبل
Anthony R\\'eveillac
تاريخ النشر
2009
مجال البحث
الهندسة المعلوماتية
والبحث باللغة
English
تأليف
Anthony Reveillac
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In recent years, infinite-dimensional methods have been introduced for the Gaussian channels estimation. The aim of this paper is to study the application of similar methods to Poisson channels. In particular we compute the Bayesian estimator of a Poisson channel using the likelihood ratio and the discrete Malliavin gradient. This algorithm is suitable for numerical implementation via the Monte-Carlo scheme. As an application we provide an new proof of the formula obtained recently by Guo, Shamai and Verduu relating some derivatives of the input-output mutual information of a time-continuous Poisson channel and the conditional mean estimator of the input. These results are then extended to mixed Gaussian-Poisson channels.
قيم البحث
اقرأ أيضاً
In this work a method for statistical analysis of time series is proposed, which is used to obtain solutions to some classical problems of mathematical statistics under the only assumption that the process generating the data is stationary ergodic. N
amely, three problems are considered: goodness-of-fit (or identity) testing, process classification, and the change point problem. For each of the problems a test is constructed that is asymptotically accurate for the case when the data is generated by stationary ergodic processes. The tests are based on empirical estimates of distributional distance.
This paper considers the comparison of noisy channels from the viewpoint of statistical decision theory. Various orderings are discussed, all formalizing the idea that one channel is better than another for information transmission. The main result i
s an equivalence relation that is proved for classical channels, quantum channels with classical encoding, and quantum channels with quantum encoding.
The problem of modulation classification for a multiple-antenna (MIMO) system employing orthogonal frequency division multiplexing (OFDM) is investigated under the assumption of unknown frequency-selective fading channels and signal-to-noise ratio (S
NR). The classification problem is formulated as a Bayesian inference task, and solutions are proposed based on Gibbs sampling and mean field variational inference. The proposed methods rely on a selection of the prior distributions that adopts a latent Dirichlet model for the modulation type and on the Bayesian network formalism. The Gibbs sampling method converges to the optimal Bayesian solution and, using numerical results, its accuracy is seen to improve for small sample sizes when switching to the mean field variational inference technique after a number of iterations. The speed of convergence is shown to improve via annealing and random restarts. While most of the literature on modulation classification assume that the channels are flat fading, that the number of receive antennas is no less than that of transmit antennas, and that a large number of observed data symbols are available, the proposed methods perform well under more general conditions. Finally, the proposed Bayesian methods are demonstrated to improve over existing non-Bayesian approaches based on independent component analysis and on prior Bayesian methods based on the `superconstellation method.
We study the problem of characterizing when two memoryless binary asymmetric channels, described by their transition probabilities $(p,q)$ and $(p,q)$, are equivalent from the point of view of maximum likelihood decoding (MLD) when restricted to $n$-
block binary codes. This equivalence of channels induces a partition (depending on $n$) on the space of parameters $(p,q)$ into regions associated with the equivalence classes. Explicit expressions for describing these regions, their number and areas are derived. Some perspectives of applications of our results to decoding problems are also presented.
For massive MIMO AF relays, symbol detection becomes a practical issue when the number of antennas is not large enough, since linear methods are non-optimal and optimal methods are exponentially complex. This paper proposes a new detection algorithm
that offers Bayesian-optimal MSE at the cost of $O(n^3)$ complexity per iteration. The algorithm is in essence a hybrid of two methods recently developed for deep learning, with particular optimization for relay. As a hybrid, it inherits from the two a state evolution formulism, where the asymptotic MSE can be precisely predicted through a scalar equivalent model. The algorithm also degenerates easily to many results well-known when single-hop considered.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
