对数似然比 meaning in English
llr
Examples
- Log likelihood ratio decoding of ldpc coded modulation in ofdm system
编码调制的对数似然比译码 - Asymptotic log - likelihood ratio and a class of strong deviation theorems
渐近对数似然比与一类强偏差定理 - For any information source on a countable set , the limit properties of relative likelihood ratio and log - likelihood ratio of entropy with respect to the independent geometry distribution , an important problem in the information theory is discussed
摘要对任意的可列集上的信息源，探讨资讯论的一个重要问题，即探讨了相对于独立型几何分布的熵密度似然比与对数似然比的极限性质。 - In chapter l , we introduce the relative background on this paper and give some simple expressions of the work which have been studied . in chapter 2 , in virtue of the notion of likelihood ratio the limit properties of the sequences of dependent nonnegative continuous random variables are studied , and a class of strong limit theorems represented by inequalities are obtained . the bounds given by these theorems depend on positive constant c . in chapter 3 , by means of the notion of log likelihood ratio , a kind random strong deviation theorem are obtained , and the bounds given by these theorems depend on r ( )
第一章，介绍本论文的选题背景，对已有的工作进行扼要的介绍；第二章，利用似然比的概念研究相依连续型非负随机变量序列的极限性质，得到一类强偏差定理，其偏差界依赖于正常数c ；第三章，利用对数似然比的概念得到一类随机偏差定理，其偏差界依赖于r ( ) ，证明中引进了尾概率和尾概率的laplace变换的概念；第四章，利用对数似然比的概念，得到了一类关于任意连续型随机变量序列的泛函的强偏差定理。 - We show the difficulty in hardware implementation by complexity analysis , then based on the analysis we provide our scheme , which has low complexity and has been proved to be equivalent to the mmse algorithm without iterations . we provide a scheme called the mmse - llr ( logarithm likelihood ratio ) which is the simplified llr demodulation scheme and omitted a lot of non - linear operations
然后提出自己的简化方案,即通过简要的推导证明在无循环的情况下mmsesic检测算法完全等同于mmse检测算法,结合运算的特点提出了简化的对数似然比解调方案,从而省去了大量的非线性运算,简化后的方案在文中被称为mmse - llr检测方案。