The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
A complementary set of $K$ binary $\pm 1$ codes of length $N$ has the useful property that the sum of the autocorrelation sequences of the codes has only one nonvanishing element, its size-$KN$ peak. The $N\times K$ matrix whose columns are the codes of a binary complementary set, arranged in order, is the code set's complementary code matrix (CCM). One might ask for which $K$ and $N$ such matrices...
Results are presented for an adiabatic quantum algorithm to compute low peak sidelobe binary and unimodular codes on a D-Wave 2 quantum computer. The quantum algorithm is benchmarked against a conventional genetic algorithm (GA). The quantum algorithm shows roughly a 100 times speedup relative to the GA for binary codes longer that 100 bits and is capable of producing low sidelobe binary codes up...
New tools are developed for testing Complementary Code Matrix (CCM) existence, first for binary CCMs and then for more general p-phase classes, by formulating a CCM in terms of its row-correlation function. It is shown that a result of Lam and Leung on vanishing sums of roots of unity is useful in this approach for developing p-phase CCM existence tests in terms of the prime factorization of p. In...
A set of unimodular (or binary) code vectors is complementary if the sum of the aperiodic autocorrelation sidelobes is zero, for every sidelobe. Complementary code sets are constructed using a matrix formulation in which code vectors form the columns of a matrix, called a Complementary Code Matrix, or CCM. Known construction methods for Hadamard matrices are examined and found to apply to the larger...
Binary complementary code sets offer a possibility that single binary codes cannot-zero aperiodic autocorrelation sidelobe levels. These code sets can be viewed as the columns of so-called complementary code matrices, or CCMs. This matrix formulation is particularly useful in gaining the insight needed for developing an efficient exhaustive search for complementary code sets. An exhaustive search...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.