Computation of the robust symmetrical number system dynamic range

The robust symmetrical number system (RSNS) is a number theoretic transform formed using N ≥ 2 integer sequences and ensures that two successive RSNS vectors (paired terms from all N sequences) differ by only one integer - integer Gray code property. The dynamic range M of the RSNS is defined as the greatest length of combined sequences that contain no ambiguities or repeated paired terms. For all but a select few RSNS sequences there is no closed-form solution to compute the dynamic range and its position. This paper presents an efficient algorithm for computing the dynamic range and its position. The dynamic range is shown to satisfy M