助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   maximum likelihood decoding 的翻译结果: 查询用时:0.186秒
图标索引 在分类学科中查询
所有学科
电信技术
自动化技术
数学
更多类别查询

图标索引 历史查询
 

maximum likelihood decoding
相关语句
  最大似然译码
     5. The simulation method and the performance of turbo codes on a Rayleigh fading channel are described, and an average upper bound for the maximum likelihood decoding strategy of turbo codes is derived.
     5.论述了衰落信道上turbo码的仿真方法与相关衰落信道上编码器的构成方式,给出了衰落信道上turbo码的最大似然译码的平均性能上界。
短句来源
     The maximum likelihood decoding metrics without and with channel state information are derived over Rice Lognormal fading channel. The pairwise error probability is compared with conventional Euclidean distance metrics. The numerical results show that :for TC MPSK signal,the effect of Channel fading characteristics (f DT) on metric performance is negligible.
     本文推导出了RiceLognormal 衰落信道中没有信道状态信息和具有信道状态信息两种情况下的最大似然译码度量,并同传统欧氏距离度量的成对错误概率进行了比较.数值计算结果表明:对于TCMPSK 方案,信道衰落特征(fDT)对度量特性的影响几乎可以忽略.最后,讨论了RiceLognormal 衰落信道中的最小交织深度
短句来源
     A neural network decoder N (23,12) for the Golay code is presented in this paper. The maximum likelihood decoding of the Golay code is proved to the equivalent to that N (23,12) converges the globe stable state of a energy function.
     本文提出了Golay码的一个神经网络译码器N(23,12),证明了Golay码的最大似然译码等价于N(23,12)收敛于能量函数的全局稳定状态。
短句来源
     The Viterbi algorithm is a maximum likelihood decoding procedure for the convolutional code in essence.
     Viterbi译码算法是卷积码的一种概率译码算法,其本质就是最大似然译码
短句来源
     Viterbi decoding algorithm is a kind of maximum likelihood decoding algorithm of convolutional code, according to the maximum likelihood decoding standard to find out a maximum likelihood path to get the decoding result in the trellis chart.
     Viterbi译码算法是卷积码的一种最大似然译码算法,它按照最大似然译码准则,在网格图上找出一条最大似然路径来得到译码结果。
短句来源
更多       
  最大似然解码
     Space time block coding based on orthogonal design over Rayleigh fading channels uses multiple transmit antennas. The uses of the orthogonal structure and the maximum likelihood decoding algorithm reduce the complex of the receive, improve the performance of the system.
     基于正交设计的空时分组编码技术 ,在瑞利衰落信道中用多个发送天线 ,其正交结构及最大似然解码算法降低了接收机的复杂度 ,提高了分集增益 ,改善了系统性能 .
短句来源
  “maximum likelihood decoding”译为未确定词的双语例句
     Channel state information of STBC-OFDM system is required for maximum likelihood decoding.
     STBC-OFDM系统中进行最大释然译码需要已知信道状态信息.
短句来源
     The Viterbi algorithm is a maximum likelihood decoding procedure for the convolutional code. It has developed rapidly both in theory and in practice since the day it was presented.
     Viterbi译码算法是卷积码的一种概率译码算法,自Viterbi算法提出以来,无论在理论上还是在实践上都得到了极其迅速的发展。
短句来源
     A combined VBLAST-LCP decoder was proposed. It combined successive cancellation of classical VBLAST with Maximum Likelihood decoding of LCP precoding.
     同时提出一种VBLAST LCP联合解码器 ,该解码器结合了经典的VBLAST解码方法和基于最大似然准则 (ML)的LCP解码 .
短句来源
查询“maximum likelihood decoding”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  maximum likelihood decoding
Improved Performance of Maximum Likelihood Decoding Algorithm with Efficient Use of Algebraic Decoder
      
A new maximum likelihood decoding (MLD) algorithm for linear block codes is proposed.
      
A Maximum Likelihood Decoding Algorithm for Wireless Channels
      
The maximum likelihood decoding of these high-rate QO-STBCs can be performed on two separate sub-groups of symbols.
      
Maximum likelihood decoding through a Viterbi algorithm is used to decode the information symbols.
      
更多          


In order to simplify the equipment's complexity resulted from the anti-interference encoding method, the following mathematical models are sequentially analysed: they are maximum likelihood decoding, minimum average penalty, maximum a posterior probability, matrix of instruction's transform probability. The combination with spare replacement method can be effectively used to solve occasional jumps and fixed inefficiency.

为简化抗干扰编码法所引起的设备复杂性,应用最大似然解码,最小平均罚量,最大归纳概率,指令转移概率矩阵等逐次深刻的数学模型进行分析,结合以备用替换,可有效地解决偶然跳动与失效故障。

The performance of RS codes on different fields when the codes are used in an optical digital pulse-position modulation (PPM) system with direct-detection are discussed. With different mapping relations between code symbols and modulation symbols, the measures and performance bounds of maximum likelihood decoding as well as the error probabilities of hard decision decoding are developed for shot-noise-limited Poissonian and Gaussian counting models respectively. These results are helpful to the selection...

The performance of RS codes on different fields when the codes are used in an optical digital pulse-position modulation (PPM) system with direct-detection are discussed. With different mapping relations between code symbols and modulation symbols, the measures and performance bounds of maximum likelihood decoding as well as the error probabilities of hard decision decoding are developed for shot-noise-limited Poissonian and Gaussian counting models respectively. These results are helpful to the selection of code parameters in designs.

研究了大小不同域上的RS码用于直接检测数字脉位调制(PPM)系统时的性能;对散弹噪声限下的Poisson和Gauss两种光电子计数模型分别导出了码符和调制符号不同对应关系下的最大似然译码量度、性能限以及硬判决译码时的性能计算公式,为实际设计中码参数的选择提供了理论依据.

In this paper, Bruck and Blaum's conclusions are generalized in two aspects. On the one band, the maximum likelihood decoding of linear block codes in the soft-decision condition is proved to be equivalent to making a neural network converge to a globe stable state of the energy function. On the other hand, we construct such an associative memory neural network for a linear block code in GF(p) that each codeword of the code is respctive to a globe maximum point of the energy function of the neural...

In this paper, Bruck and Blaum's conclusions are generalized in two aspects. On the one band, the maximum likelihood decoding of linear block codes in the soft-decision condition is proved to be equivalent to making a neural network converge to a globe stable state of the energy function. On the other hand, we construct such an associative memory neural network for a linear block code in GF(p) that each codeword of the code is respctive to a globe maximum point of the energy function of the neural network.

从两个方面推广了Bruck和Blaum的工作。一方面,证明了在软判决译码的情况下,线性分组码的最大似然译码等价于一个神经网络收敛于它能量函数的全局极大状态。另一方面,对GF(p)上的线性分组码,构造了一个联想记忆神经网络,使得每一个线性分组码的码字都对应于神经网络的一个全局稳定状态。

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关maximum likelihood decoding的内容
在知识搜索中查有关maximum likelihood decoding的内容
在数字搜索中查有关maximum likelihood decoding的内容
在概念知识元中查有关maximum likelihood decoding的内容
在学术趋势中查有关maximum likelihood decoding的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社