期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
自收缩序列的周期和线性复杂度稳定性
1
作者 魏先彪 刘三阳 《西安电子科技大学学报》 EI CAS CSCD 北大核心 2004年第3期465-468,共4页
周期稳定性和线性复杂度稳定性是衡量周期序列不确定性和随机性的重要指标.利用序列有理分式表示及极小多项式,研究了自收缩序列,讨论了自收缩序列周期稳定性和线杂度稳定性,得到了自收缩序列分别在1重量、2重量时的周期及其复杂度.
关键词 周期序列 自收缩序列 周期稳定性 复杂度稳定性 重量周期 重量复杂度
下载PDF
GF(3)上一类新型控制生成器
2
作者 王锦玲 于静雅 《计算机应用》 CSCD 北大核心 2014年第A01期64-65,73,共3页
构造了一类新型的GF(3)上的控制序列,它是由两个GF(3)上的线性移位寄存器(LFSR)构成。详细给出两条mm-序列控制下的GF(3)上新型控制生成器的性质,研究表明:新型控制生成器生成序列周期长,线性复杂度高,是防攻击能力强,稳定性好的新型模型。
关键词 周期 线性复杂度 mm-序列 符号分布 重量周期
下载PDF
Ground State Properties of Superheavy Nuclei in Macroscopic-Microscopic Model 被引量:1
3
作者 ZHI Qi-Jun REN Zhong-Zhou +1 位作者 ZHANG Xiao-Ping ZHENG Qiang 《Communications in Theoretical Physics》 SCIE CAS CSCD 2008年第9期707-714,共8页
The ground state properties of superheavy nuclei are systematically calculated by the macroscopic-microscopic (MM) model with the Nilsson potential.The calculations well produced the ground state binding energies,α-d... The ground state properties of superheavy nuclei are systematically calculated by the macroscopic-microscopic (MM) model with the Nilsson potential.The calculations well produced the ground state binding energies,α-decay energies,and half lives of superheavy nuclei.The calculated results are systematically compared with availableexperimental data.The calculated results are also compared with theoretical results from other MM models and fromrelativistic mean-field model.The calculations and comparisons show that the MM model is reliable in superheavy regionand that the MM model results are not very sensitive to the choice of microscopic single-particle potential. 展开更多
关键词 macroscopic-microscopic model.superheavy nuclei binding energy half life
下载PDF
Incremental Min-Period Retiming Algorithm for FPGA Synthesis Based on Influence of Fan-Outs
4
作者 郝亚男 杨海钢 +2 位作者 崔秀海 谭宜涛 路宝珠 《Transactions of Tianjin University》 EI CAS 2012年第4期259-265,共7页
An improved linear-time retiming algorithm is proposed to incrementally optimize the clock period, espe cially considering the influence of the in-out degree of the critical combinational elements. Firslly, the critic... An improved linear-time retiming algorithm is proposed to incrementally optimize the clock period, espe cially considering the influence of the in-out degree of the critical combinational elements. Firslly, the critical elements are selected from all the critical combinational elements to retime. Secondly, for the nodes that cannot be performed with such retiming, register sharing is implemented while the path delay is kept unchanged. The incremental algorithm can be applied with the technology mapping to minimize the critical path delay and obtain fewer registers in the re- timed circuit with the near-optimal clock period. Compared with Singh's incremental algorithm, experiments show that the proposed algorithm can reduce the flip-flop count by 11% and look-up table (LUT) count by 5% while improv- ing the minimum clock period by 6%. The runtime is also reduced by 9% of the design flow. 展开更多
关键词 linear-time retiming sequential optimization sharing register field programmable gate array (FPGA)
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部