The k-distribution of generalized feedback shift register pseudorandom numbers

M. Fushimi, S. Tezuka

Research output: Contribution to journalArticle

54 Citations (Scopus)

Abstract

A necessary and sufficient condition is established for the generalized feedback shift register (GFSR) sequence introduced by Lewis and Payne to be k-distributed. Based upon the theorem, a theoretical test for k-distributivity is proposed and performed in a reasonable amount of computer time, even for k = 16 and a high degree of resolution (for which statistical tests are impossible because of the astronomical amount of computer time required). For the special class of GFSR generators considered by Arvillias and Maritsas based on the primitive trinomial Dp + Dq + 1 with q = an integral power of 2, it is shown that the sequence is k-distributed if and only if the lengths of all subregisters are at least k. The theorem also leads to a simple and efficient method of initializing the GFSR generator so that the sequence to be generated is k-distributed.

Original languageEnglish
Pages (from-to)516-523
Number of pages8
JournalCommunications of the ACM
Volume26
Issue number7
DOIs
Publication statusPublished - Jul 1 1983

Fingerprint

Shift registers
Feedback
Statistical tests

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Cite this

The k-distribution of generalized feedback shift register pseudorandom numbers. / Fushimi, M.; Tezuka, S.

In: Communications of the ACM, Vol. 26, No. 7, 01.07.1983, p. 516-523.

Research output: Contribution to journalArticle

Fushimi, M. ; Tezuka, S. / The k-distribution of generalized feedback shift register pseudorandom numbers. In: Communications of the ACM. 1983 ; Vol. 26, No. 7. pp. 516-523.
@article{88215ba6a5bf4ad88c826048233e19f7,
title = "The k-distribution of generalized feedback shift register pseudorandom numbers",
abstract = "A necessary and sufficient condition is established for the generalized feedback shift register (GFSR) sequence introduced by Lewis and Payne to be k-distributed. Based upon the theorem, a theoretical test for k-distributivity is proposed and performed in a reasonable amount of computer time, even for k = 16 and a high degree of resolution (for which statistical tests are impossible because of the astronomical amount of computer time required). For the special class of GFSR generators considered by Arvillias and Maritsas based on the primitive trinomial Dp + Dq + 1 with q = an integral power of 2, it is shown that the sequence is k-distributed if and only if the lengths of all subregisters are at least k. The theorem also leads to a simple and efficient method of initializing the GFSR generator so that the sequence to be generated is k-distributed.",
author = "M. Fushimi and S. Tezuka",
year = "1983",
month = "7",
day = "1",
doi = "10.1145/358150.358159",
language = "English",
volume = "26",
pages = "516--523",
journal = "Communications of the ACM",
issn = "0001-0782",
publisher = "Association for Computing Machinery (ACM)",
number = "7",

}

TY - JOUR

T1 - The k-distribution of generalized feedback shift register pseudorandom numbers

AU - Fushimi, M.

AU - Tezuka, S.

PY - 1983/7/1

Y1 - 1983/7/1

N2 - A necessary and sufficient condition is established for the generalized feedback shift register (GFSR) sequence introduced by Lewis and Payne to be k-distributed. Based upon the theorem, a theoretical test for k-distributivity is proposed and performed in a reasonable amount of computer time, even for k = 16 and a high degree of resolution (for which statistical tests are impossible because of the astronomical amount of computer time required). For the special class of GFSR generators considered by Arvillias and Maritsas based on the primitive trinomial Dp + Dq + 1 with q = an integral power of 2, it is shown that the sequence is k-distributed if and only if the lengths of all subregisters are at least k. The theorem also leads to a simple and efficient method of initializing the GFSR generator so that the sequence to be generated is k-distributed.

AB - A necessary and sufficient condition is established for the generalized feedback shift register (GFSR) sequence introduced by Lewis and Payne to be k-distributed. Based upon the theorem, a theoretical test for k-distributivity is proposed and performed in a reasonable amount of computer time, even for k = 16 and a high degree of resolution (for which statistical tests are impossible because of the astronomical amount of computer time required). For the special class of GFSR generators considered by Arvillias and Maritsas based on the primitive trinomial Dp + Dq + 1 with q = an integral power of 2, it is shown that the sequence is k-distributed if and only if the lengths of all subregisters are at least k. The theorem also leads to a simple and efficient method of initializing the GFSR generator so that the sequence to be generated is k-distributed.

UR - http://www.scopus.com/inward/record.url?scp=0020793402&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0020793402&partnerID=8YFLogxK

U2 - 10.1145/358150.358159

DO - 10.1145/358150.358159

M3 - Article

AN - SCOPUS:0020793402

VL - 26

SP - 516

EP - 523

JO - Communications of the ACM

JF - Communications of the ACM

SN - 0001-0782

IS - 7

ER -