A novel method for generating pseudorandom integer strings and pseudorandom sequences (Q1589783): Difference between revisions

Let \(b,p\geq 2\) be integers. Suppose that the \(b\)-based decimal expansion of \(1/p\) is purely recurrent and its recurrent period is just \(p-1\), i.e. \(1/p= \langle 0.\dot a_1 a_2\dots \dot a_{p-1}\rangle_b\). The author calls it the full-recurrent-decimal, and the generated sequence \((a_1,a_2,\dots, a_{p-1})\) the full-recurrent-decimal-sequence (abbr. FRDS). Extending in a periodic way, it becomes a periodic sequence with \(b\) codes (or states) and period length \(p-1\). The author investigates the pseudorandom integer string properties and the run-length properties of the FRDS-sequences. Furthermore, by the transformation \(x_i= \sin(2\pi n_i/p)\), where \(n_i/p=\langle 0.\dot a_i\dots a_{p-1}a_1\dots\dot a_{i-1}\rangle_b\), \(n_i\in \mathbb{N}\), \(i= 1,\dots, p-1\), the author suggests a new kind of pseudorandom sequences \(\{x_n \}_{n=1}^\infty\) with optimal auto-correlation function.