Code construction of TLP random number sequences with good randomness

The TLP random number sequence is generated from a binary M sequence and is widely applied to various problems. In this sequence, however, there alway s exist positions with time difference, for which the sequences are not ind ependent, i.e., there exists time-correlation due to the effect of the algo rithm for M sequence generation, This paper reveals the mechanism through w hich time correlation appears in the TLP random number sequence, based on t he shift-and-add property possessed by the binary M-sequence. Then, aiming at a TLP random number sequence with a good pseudorandom property, we propo se a method for optimal time-delay selection between the code vector elemen ts that maximizes the number of time differences for independence. For the optimal TLP random number sequence, the local code frequency and the joint occurrence property are statistically examined by the chi(2) test. The reje ction ratio is approximately X% for a significance level of X%, and it is c oncluded that the sequence has sufficient randomness. (C) 1999 Scripta Tech nica, Electron Comm Jpn Pt 3, 83(2): 86-95, 1999.