A method of generating uniformly distributed sequences over [0,K], where K+1 is not a power of two

R. Kuehnel, Yuke Wang
{"title":"A method of generating uniformly distributed sequences over [0,K], where K+1 is not a power of two","authors":"R. Kuehnel, Yuke Wang","doi":"10.1109/ICASSP.2003.1202488","DOIUrl":null,"url":null,"abstract":"A new methodology has been recently proposed for the efficient generation of multiple pseudo-random bit sequences that are statistically uncorrelated [1]. Random sequences that are uniformly distributed over a range [0,K], where K+1 is a power of 2, can be constructed by forming a vector of M independent bit sequences, where M=log/sub 2/ (K+1). We demonstrate that this method of construction represents a special case of a more generalized approach in which K can be any positive integer. The procedures described here can be used to efficiently generate multiple independent random sequences that are uniformly distributed over any range.","PeriodicalId":104473,"journal":{"name":"2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03).","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03).","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICASSP.2003.1202488","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

A new methodology has been recently proposed for the efficient generation of multiple pseudo-random bit sequences that are statistically uncorrelated [1]. Random sequences that are uniformly distributed over a range [0,K], where K+1 is a power of 2, can be constructed by forming a vector of M independent bit sequences, where M=log/sub 2/ (K+1). We demonstrate that this method of construction represents a special case of a more generalized approach in which K can be any positive integer. The procedures described here can be used to efficiently generate multiple independent random sequences that are uniformly distributed over any range.
在[0,K]上生成均匀分布序列的一种方法,其中K+1不是2的幂
最近提出了一种新的方法,用于有效地生成统计上不相关的多个伪随机比特序列[1]。在[0,K]范围内均匀分布的随机序列,其中K+1是2的幂,可以通过形成M个独立位序列的向量来构造,其中M=log/sub 2/ (K+1)。我们证明了这种构造方法代表了一种更广义的方法的特殊情况,其中K可以是任何正整数。这里描述的过程可以用来有效地生成在任何范围内均匀分布的多个独立随机序列。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信