Extended Closed-form Expressions for the Robust Symmetrical Number System Dynamic Range and an Efficient Algorithm for its Computation
Abstract
The robust symmetrical number system (RSNS) is a number theoretic transform based on N > = 2 sequences that can extract the maximum amount of information from symmetrical folding waveforms. The sequences, based on coprime moduli, exhibit an integer Gray code property making the RSNS well-suited for many applications that benefit from an inherent error detection and correction capability such as analog-to-digital converters, direction finding arrays and radar waveform design. To use the RSNS, it is necessary to know the greatest length of combined sequences without ambiguities, called the dynamic range M, for which only a few closed-form expressions currently exist. In this paper, an efficient algorithm for computing M and its position within the combined set of sequences is presented and shown to be independent of the size of the moduli. The algorithm is used to generate the equations for several groups of additional moduli arrangements. Closed form expressions for M are conjectured and proved using the obtained congruence equations that define the ambiguity locations.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 2014
- Accession Number
- ADA615619
Entities
People
- Brian L. Luke
- Pantelimon Stanica
- Phillip E. Pace
- Thomas W. Tedesso
Organizations
- Naval Postgraduate School