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

图标索引 历史查询
 

lll algorithm
相关语句
  “lll algorithm”译为未确定词的双语例句
     One Modified LLL Algorithm in GPS Decorrelation
     对GPS模糊度解相关方法的一种改进
短句来源
     The simulation results suggest that LLL algorithm has apparent advantages over other two detection algorithms.
     通过仿真证明,由于引入了具有准正交特性的格约简基,三种检测算法中格约简辅助检测算法具有最好的检测性能。
短句来源
     Based on the standard LLL algorithm,the conception of l-reduced lattice reduction is proposed in this paper for the first time,and a new l-reduced lattice reduction algorithm is presented.
     本文在标准LLL规约算法[7]的基础上,首次提出了l次规约的概念,并且设计了一种新型的l次规约算法。
短句来源
     This l-reduced lattice reduction algorithm can find vectors shorter than ones got by the standard LLL algorithm which is widely used in this field.
     利用这种新型算法找到的短向量比使用标准LLL规约算法求得的短向量更加接近格中的最短非零向量。
短句来源
  相似匹配句对
     in the algorithm;
     算法简单易行。
短句来源
     One Modified LLL Algorithm in GPS Decorrelation
     对GPS模糊度解相关方法的一种改进
短句来源
     Algorithm has been Presented.
     给出了自学习控制器的结构和算法。
短句来源
查询“lll algorithm”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  lll algorithm
This is the place where the integer Gram-Schmidt orthogonalization by means of the LLL algorithm (modified LLL algorithm) is applied being illustrated by four examples.
      
Mixed Integer-Real Valued Adjustment (IRA) Problems: GPS Initial Cycle Ambiguity Resolution by Means of the LLL Algorithm
      
The LLL algorithm does not necessarily find the basis with the shortest possible vectors.
      
This insight allows the use of the well known LLL algorithm as a fast approximate decoding algorithm.
      
To do so, we developed a new approach based on Lattice Basis Reduction and in particular on the LLL algorithm.
      
更多          


Within the mode of double difference carrier phase, the fundamental mixed integerreal valued adjustment problem is unavoidable. Through standard parameter estimation like weighted least squares only the "floating solution" - including the vector of ambiguity-can be given. In order to speed up the searching process for the integer values of ambiguity, the method of decorrelation is applied, which works "in practice" sufficiently well. Here we evaluate the A. K. Lenstra,H. W. Lenstra and L. Lovacs (LLL)...

Within the mode of double difference carrier phase, the fundamental mixed integerreal valued adjustment problem is unavoidable. Through standard parameter estimation like weighted least squares only the "floating solution" - including the vector of ambiguity-can be given. In order to speed up the searching process for the integer values of ambiguity, the method of decorrelation is applied, which works "in practice" sufficiently well. Here we evaluate the A. K. Lenstra,H. W. Lenstra and L. Lovacs (LLL) algorithm. The analysis of this decorrelation method is made as realistic and as statistically meaningful as possible: a random simulation approach has been implemented, which guarantees a symmetric , positive definite variance covariance matrix of the ambiguity vector ( " float solution" ) derived from the double difference observation variance covariance matrix. The condition number is used as a criterion for the performance of this decorrelation method. The results show that the modified LLL Algorithm works better.

在双差载波相位模型中,整数-实数混合平差是无法避免的.通常的参数估计方法如加权最小二乘,只能给出浮点解,包括模糊度向量也只是实数解.为了加速整周模糊度的搜索过程,解相关的方法得到了应用,并被证明是行之有效的.在此,主要讨论了LLL方法.为了对该解相关方法的分析尽可能地具有现实和统计意义,利用随机模拟方法得到了没有任何先验信息的对称正定矩陈,作为模糊度向量的方差-协方差矩阵.针对现有方法中的不足,提出了改进后的LLL方法,并利用条件数作为评判解相关程度的准则,证明其是切实可行的.

To find out short nonzero vectors from a random lattice is an important subject of crypto applications based on the lattice theory.Usually,approximate short vectors are got by lattice reduction algorithms.Based on the standard LLL algorithm,the conception of l-reduced lattice reduction is proposed in this paper for the first time,and a new l-reduced lattice reduction algorithm is presented.This l-reduced lattice reduction algorithm can find vectors shorter than ones got by the standard...

To find out short nonzero vectors from a random lattice is an important subject of crypto applications based on the lattice theory.Usually,approximate short vectors are got by lattice reduction algorithms.Based on the standard LLL algorithm,the conception of l-reduced lattice reduction is proposed in this paper for the first time,and a new l-reduced lattice reduction algorithm is presented.This l-reduced lattice reduction algorithm can find vectors shorter than ones got by the standard LLL algorithm which is widely used in this field.An interesting property of this algorithm is that a better reduced lattice base can be got if a lager l is chosen,while the time cost increased.Numerical tests have been carried out to study the different performances of the l-reduced algorithm and standard LLL algorithm.Results for the l-reduced algorithm are found to be close to the experimental data. The two possible methods to improve this algorithm are presented at the end of this paper.

寻找格中的非零短向量是格理论应用于密码学研究常常遇到的一个问题。一般通过各种格基规约算法来得到格中的近似最短向量。本文在标准LLL规约算法[7]的基础上,首次提出了l次规约的概念,并且设计了一种新型的l次规约算法。利用这种新型算法找到的短向量比使用标准LLL规约算法求得的短向量更加接近格中的最短非零向量。算法在一定范围内具有计算花费时间和规约结果质量之间可以相互转化的特点,可以通过牺牲更多的运算时间来获得质量更优的规约基。通过大量的数值测试,本文比较了l次规约算法和标准LLL规约算法的实际性能,验证了对l次规约算法的理论分析。最后,本文提出了进一步改进l次规约算法的两个思路。

 
图标索引 相关查询

 


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

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