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

图标索引 历史查询
 

sum product algorithm
相关语句
  “sum product algorithm”译为未确定词的双语例句
     analyse the classical decoding algorithm of LDPC Codes, including Sum Product Algorithm which based on probability and LLR, and Min Sum Algorithm.
     并在此基础上分析和推导了各种LDPC码经典译码算法,包括概率测度和积译码算法、对数似然比测度和积译码算法和最小和译码算法。
短句来源
     It is proved that the PDF of the initial channel LLR message in sum product algorithm satisfies the symmetry condition and the stability is given when the channel is Nakagami fading channel.
     证明了在Nakagami信道中和积译码算法的信道初始化消息的概率密度函数满足对称性条件,并推导了Nakagami信道的稳定性条件。
短句来源
     And then, the paper introduces hard-adjudged decoding algorithm and soft-adjudged decoding algorithm of Low-Density Parity-Check codes in detail, especially analyzes the most popular used decoding algorithm which is called sum product algorithm.
     然后,详细介绍了LDPC码的硬判决译码算法和软判决译码算法,重点分析了目前最为常用的和积译码即置信传播(Belief Propagation)算法。
短句来源
     Based on the factor graph representation of maximum a posteriori probabilities decoding of the user's information bits and the sum product algorithm, an iterative multiuser decoding based on parallel partial interference cancellation detection for coded CDMA system was proposed.
     基于用户信息比特最大后验概率解码的因子图表示及和 -积算法 ,通过干扰估计值的渐进性能分析 ,提出了一种基于并行部分干扰对消检测的迭代多用户解码器 .
短句来源
  相似匹配句对
     The equations for updating messages in sum-product algorithm are also derived.
     推导了不同测度下LDPC码和积译码算法的消息迭代更新公式。
短句来源
     in the algorithm;
     算法简单易行。
短句来源
     Product Sum Formula and Its Applications
     积和式及其应用
短句来源
     PRODUCT
     产品推荐
短句来源
     Numerical Algorithm of Product Fragility
     产品脆值的数值计算方法
短句来源
查询“sum product algorithm”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  sum product algorithm
When applied to LDPC codes, the sum-product algorithm has a decoding complexity linear in the blocklength which makes very long codes feasible.
      
The sum-product algorithm converges here to the correct MAP estimate under a rich variety of communication topologies.
      
The sum-product algorithm is then applied to this modified matrix, and then Gaussian elimination and sum-product decoding are both repeated.
      
The voting potential is defined in such a way that the message passing can be calculated efficiently by the sum-product algorithm described next.
      
This standardizes the execution of the sum-product algorithm and will lead to a reduction in implementation complexity.
      
更多          


Beth turbo codes and LDPC codes can achieve the Shannon limited performance. The constituent RSC codes in turbo codes are more structural and this lends the encoding problem easier with shift_register circuit.While the encoding of LDPC codes is performed via matrix multiplication, it is more complex than it appears for capacity_approaching LDPC codes. On the other hand,the soft_input soft_output BCJR algorithm,or the sub_optimal version of it,used for turbo_decoding is rather complex while sum_product...

Beth turbo codes and LDPC codes can achieve the Shannon limited performance. The constituent RSC codes in turbo codes are more structural and this lends the encoding problem easier with shift_register circuit.While the encoding of LDPC codes is performed via matrix multiplication, it is more complex than it appears for capacity_approaching LDPC codes. On the other hand,the soft_input soft_output BCJR algorithm,or the sub_optimal version of it,used for turbo_decoding is rather complex while sum_product algorithm used for LDPC decoding lends itself to parallel implementation and is computationally simpler. Combining the turbo codes encoding and LDPC decoding,a new scheme based on factor graphs and sum_product algorithm is developed, Which can reduce the decoding complexity of turbo codes greatly,and also has some guides in the designing of interleaver and the choosing of RSC constituent codes. Simulation shows the correctness of the scheme.

Turbo码和LDPC码都可以实现接近Shannon理论极限的性能。Turbo码由于成员RSC码所固有的移位寄存器特性使得其编码较为容易实现 ;而对于接近Shannon容量的LDPC码 ,则需要大量的矩阵乘法运算才能完成信息的编码 ,电路实现较为复杂。另一方面 ,采用和积算法的LDPC码的译码过程则比采用BCJR算法 (及其简化形式 )的Turbo译码更加容易实现 ,且计算复杂度更低。将Turbo编码与LDPC码的译码相结合 ,对Turbo采用基于其因子图表示的和积译码算法进行译码 ,可以在很大程度上降低Turbo码的译码复杂度 ,并对交织器的设计及成员码的选择有一定的指导作用。仿真结果证明了该方案的有效性

Based on the factor graph representation of maximum a posteriori probabilities decoding of the user's information bits and the sum product algorithm, an iterative multiuser decoding based on parallel partial interference cancellation detection for coded CDMA system was proposed. The structure of the multiuser detection is similar to the parallel partial interference cancellation detection, but the multiple access interference (MAI) estimation is from the channel decoding, and the proportion...

Based on the factor graph representation of maximum a posteriori probabilities decoding of the user's information bits and the sum product algorithm, an iterative multiuser decoding based on parallel partial interference cancellation detection for coded CDMA system was proposed. The structure of the multiuser detection is similar to the parallel partial interference cancellation detection, but the multiple access interference (MAI) estimation is from the channel decoding, and the proportion of the estimated MAI to be cancelled is chosen based on the error characteristic provided by the channel decoding. The simulation result shows that the receiver offers performance close to the single user system with the increase of the iterations.

基于用户信息比特最大后验概率解码的因子图表示及和 -积算法 ,通过干扰估计值的渐进性能分析 ,提出了一种基于并行部分干扰对消检测的迭代多用户解码器 .多用户检测模块的基本结构类似于并行部分干扰对消检测 ,但干扰估计来自信道译码模块 ;同时 ,信道译码模块还提供干扰估计误差特性 ,多用户检测模块据此选取消除估计多址干扰的比例 .仿真结果表明 ,随着迭代次数的增加 ,这种接收器接近单用户系统性能

In this paper,an iterative multiuser receiver based on factor graph for asynchronous coded CDMA system is proposed,the a posteriori probability of users information bits conditioned on the noise-whitening filters output is represented by factor graphs,and after numbers of iterations with the sum-product algorithm the information bits are estimated.We also propose a reduced complexity algorithm.Simulation results show that with this proposed receiver,near-single-user performance can be...

In this paper,an iterative multiuser receiver based on factor graph for asynchronous coded CDMA system is proposed,the a posteriori probability of users information bits conditioned on the noise-whitening filters output is represented by factor graphs,and after numbers of iterations with the sum-product algorithm the information bits are estimated.We also propose a reduced complexity algorithm.Simulation results show that with this proposed receiver,near-single-user performance can be achieved,and the algorithm has achieved significant complexity reduction.

针对异步编码CDMA系统 ,本文提出了一种基于因子图的迭代多用户接收器 ,它是将用户信息比特对接收端噪声白化滤波器输出的条件后验概率分布用因子图表示 ,并采用和 积算法 ,经过有限次迭代获得用户信息比特的估计值 .为降低计算复杂度 ,本文还提出一种简化算法 .仿真结果表明 ,本文提出的迭代多用户接收器在经过几次迭代后的比特误码性能接近单用户系统 ;同时 ,简化算法的性能接近完全算法 ,但算法复杂度有明显改善

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

 


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

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