By Topic

N -Sequence RSNS Ambiguity Analysis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Brian L. Luke ; Adv. Concepts & Demonstrations, Navy Inf. Oper. Command Suitland, Fort Meade, MD ; Phillip E. Pace

The robust symmetrical number system (RSNS) is a modular system formed using Nges2 integer sequences and ensures that two successive RSNS vectors (paired terms from all N sequences) differ by only one integer. This integer Gray-code property reduces the possibility of encoding errors and makes the RSNS useful in applications such as folding analog-to-digital converters (ADCs), direction finding antenna architectures, and photonic processors. This paper determines the length of combined sequences that contain no vector ambiguities. This length or longest run of distinct vectors we call the RSNS dynamic range (Mcirc). The position of Mcirc which is the starting point in the sequence is also derived. Computing Mcirc and the position of Mcirc allows the integer Gray-code properties of the RSNS to be used in practical applications. We first extend our two-sequence results to develop a closed-form expression for Mcirc for a three-sequence RSNS with moduli of the form 2r-1,2r,2r+1. We then extend the results to solving the N-sequence RSNS ambiguity locations in general

Published in:

IEEE Transactions on Information Theory  (Volume:53 ,  Issue: 5 )