{"title":"生成多次出现均匀随机序列的加性同余方法","authors":"D. M. Ionescu, M. Wickert","doi":"10.1109/WITS.1994.513929","DOIUrl":null,"url":null,"abstract":"The formalism behind a novel additive congruential method (ACM) is described. This method yields uniform random sequences whose outcomes occur more than once throughout the sequence. The approach to generating a uniformly distributed pseudorandom sequence (PS) is presented. For a selected prime, p, the PS is a sequence of random variables (RV) over the Galois field GF(p). The ACM yields a Markov PS, where each valid outcome appears more than once within the main period, and still obeys a uniform distribution.","PeriodicalId":423518,"journal":{"name":"Proceedings of 1994 Workshop on Information Theory and Statistics","volume":"84 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An additive congruential method for generating a multiple occurrence uniform random sequence\",\"authors\":\"D. M. Ionescu, M. Wickert\",\"doi\":\"10.1109/WITS.1994.513929\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The formalism behind a novel additive congruential method (ACM) is described. This method yields uniform random sequences whose outcomes occur more than once throughout the sequence. The approach to generating a uniformly distributed pseudorandom sequence (PS) is presented. For a selected prime, p, the PS is a sequence of random variables (RV) over the Galois field GF(p). The ACM yields a Markov PS, where each valid outcome appears more than once within the main period, and still obeys a uniform distribution.\",\"PeriodicalId\":423518,\"journal\":{\"name\":\"Proceedings of 1994 Workshop on Information Theory and Statistics\",\"volume\":\"84 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-10-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1994 Workshop on Information Theory and Statistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WITS.1994.513929\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 1994 Workshop on Information Theory and Statistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WITS.1994.513929","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An additive congruential method for generating a multiple occurrence uniform random sequence
The formalism behind a novel additive congruential method (ACM) is described. This method yields uniform random sequences whose outcomes occur more than once throughout the sequence. The approach to generating a uniformly distributed pseudorandom sequence (PS) is presented. For a selected prime, p, the PS is a sequence of random variables (RV) over the Galois field GF(p). The ACM yields a Markov PS, where each valid outcome appears more than once within the main period, and still obeys a uniform distribution.