首页 | 本学科首页   官方微博 | 高级检索  
     检索      

关于渐近随机的GFSR序列的设计
作者姓名:Moroh.  H Fushi.  M
作者单位:HOZUMI MOROHOSI(Graduate School of Engineering,University of Tokyo,Tokyo 113-8656,Japan)       MASANORI FUSHIMI(Graduate School of Engineering,University of Tokyo,Tokyo 113-8656,Japan)
摘    要:Tootill等人提出了一种渐近的随机Tausworthe序列,并给出了一个偶然发现的此种序列,但直到现在尚未有人提出一个寻求此种序列的系统性的方法,本文中我们将给出一种设计GFSR序 算法,所产生的序列近似地满足渐近随机性,我们的算法基于反复地运用由Fushimi提出的算法,由现在的算法所设计出来的序列不有一种附加的好处,即其十中抽一的序列也是近似地渐近随机的,文中给出了一些数字例子。

关 键 词:拟随机数生成  渐近随机  整数规划  GFSR序列  设计

Designing Asymptotically Random GFSR Sequences
Moroh.,H Fushi.,M.Designing Asymptotically Random GFSR Sequences[J].OR Transactions,2000,4(2):7-18.
Authors:HOZUMI MOROHOSI  MASANORI FUSHIMI
Institution:Graduate School of Engineering,University of Tokyo,Tokyo 113-8656,Japan
Abstract:Tootill et al. Proposed the concept of an asymptotically random Tausworthe sequence, and gave an example of such sequence found by chance. However, no systematic way of finding such sequences has been proposed by now. In this paper we will give an algorithm for designing GFSR sequences which satisfy the asymptotic randomness approximately. Our algorithm is based on repeated applications of the algorithm proposed by Fushimi. The sequences designed by the present algorithm have an added merit that their decimated sequences are also approximately asymptotically random. Some numerical examples will be shown.
Keywords:pseudorandom number generation  asymptotic randomness  integer programming  binary matroid  
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号