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

图标索引 历史查询
 

feedforward sequence
相关语句
  前馈序列
     RELATIONS BETWEEN A FEEDBACK SEQUENCE AND A FEEDFORWARD SEQUENCE
     前馈序列与反馈序列的关系(英文)
短句来源
     Comment on"Memory-Decimation Feedforward Sequence
     对“存储采样前馈序列”的评述
短句来源
     The problem,how to choose the set of phase vectors of tap sequences in the nonlinear feedforward generator such that some frequency component of the feedforward sequence under Galois-Field Fourier transform is equal to zero, will be discussed in this article.
     本文讨论对于前馈网络,如何选取抽头序列的相位向量集,使得前馈序列在Galois域Fourier变换下某一频率分量为零(即前馈序列的线性复杂度退化)。
短句来源
  “feedforward sequence”译为未确定词的双语例句
     Design of the Cipher Chip Based on Nonlinear Combining Feedforward Sequence Generator
     基于组合前馈序列的密码芯片的设计
短句来源
查询“feedforward sequence”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
没有找到相关例句


This paper discusses the periodicity of feedforward sequences.Ageneral method to get the longest period of feedforward sequences is putforward.

本文讨论了前馈序列的周期性问题,找到了使前馈序列获得最大周期的一般方法。

The problem,how to choose the set of phase vectors of tap sequences in the nonlinear feedforward generator such that some frequency component of the feedforward sequence under Galois-Field Fourier transform is equal to zero, will be discussed in this article. We will give the solution of the problem's existence, enumeration and construction by PFZ Algorithm when the number n of the LFSR's stages and the number m of variables of the feedforward function are coprime, and prove PFZ Algorithm is efficient...

The problem,how to choose the set of phase vectors of tap sequences in the nonlinear feedforward generator such that some frequency component of the feedforward sequence under Galois-Field Fourier transform is equal to zero, will be discussed in this article. We will give the solution of the problem's existence, enumeration and construction by PFZ Algorithm when the number n of the LFSR's stages and the number m of variables of the feedforward function are coprime, and prove PFZ Algorithm is efficient when n or m is small.

本文讨论对于前馈网络,如何选取抽头序列的相位向量集,使得前馈序列在Galois域Fourier变换下某一频率分量为零(即前馈序列的线性复杂度退化)。当LFSR的级数n和前馈函数的变元个数m互素时,本文由PFZ算法给出了上述问题的存在性、计数和构造性组合问题的完整解,且证明了当n或m较小时,PFZ算法是一个有效的算法。

Bit security is one of the important indexes on measuring stream ciphers.This paper discusses the security of stream ciphers by treating them as systems with memory.The models studied in this paper include linear shift register sequences,feedforward sequences and clock controlled sequences.The results may be helpful for some new realization of the local security of stream cipher systems.

流密码的比特安全性是衡量密码体制好坏的重要指标。本文把流密码看作一个有记忆系统对其比特安全性进行了讨论。本文研究的模型包括线性移位寄存器序列,前馈序列和钟控序列。通过研究它们的比特安全性,可以对这些流密码体制在局部范围的安全程度有新的认识。

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

 


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

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