Abstract
Generalized Levenshtein bound (GLB) is a lower bound on the maximum aperiodic correlation sum of quasi-complementary sequence set (QCSS) which refers to a set of two-dimensional matrices with low non-trivial aperiodic auto- and cross-correlation sums. GLB is an indefinite fractional quadratic function of a “simplex” weight vector w and three additional parameters associated with QCSS. We present a novel approach to analytically conduct fractional quadratic optimization for the tightening of the GLB. Our key idea is to apply the frequency-domain decomposition of the relevant circulant matrix (i.e., the numerator term of GLB) to convert the non-convex problem into a convex one. We derive a new weight vector which asymptotically leads to a tighter GLB (over the Welch bound) for all possible (K, M) cases, where K, M denote the set size, the number of channels, of QCSS, respectively.
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.
