For access to this article, please select a purchase option:
IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.
Your recommendation has been sent to your librarian.
In this paper, we consider the numerical design of complete complementary codes (CCC), which are quite different from traditional analytical approaches. The design task is formulated as minimizing the integrated sidelobe level (ISL) of a sequence set under unimodular constraint. Exploiting the algebraic structure of ISL, we calculate its value and derivative efficiently via FFT. Then, an algorithm based on BFGS (Broyden Fletcher Goldfarb and Shanno) method is proposed, which is suited to small scale problems. For large scale cases, another line-search-free Limited-Memory BFGS based algorithm is preferred as it omits the memory intensive Hessian matrix update and time-consuming line-search. Simulation results confirm the effectiveness of the proposed algorithms. s, when used to design complementary set of sequences, which is a special case of CCC, they outperform the existing state-of-the-art algorithms.
Inspec keywords: fast Fourier transforms; codes; Hessian matrices; search problems
Subjects: Optimisation techniques; Combinatorial mathematics; Linear algebra (numerical analysis); Integral transforms in numerical analysis; Codes