Abstract
New binary and ternary sequences with low correlation and simple implementation are presented. The sequences are unfolded from arrays, whose columns are cyclic shifts of a short sequence or constant columns and whose shift sequence (sequence of column shifts) has the distinct difference property. It is known that a binary m-sequence/GMW sequence of length 2 2m -1 1 can be folded row-by-row into an array of 2 m - 1 rows of length 2 m + 1. We use this to construct new arrays which have at most one column matching for any two dimensional cyclic shift and therefore have low off-peak autocorrelation. The columns of the array can be multiplied by binary orthogonal sequences of commensurate length to produce a set of arrays with low cross-correlation. These arrays are unfolded to produce sequence sets with identical low correlation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
