Efficient exhaustive search for binary complementary code sets

Efficient exhaustive search for binary complementary code sets

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 nee...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Coxson, Gregory E., Russo, Jon C.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
autocorrelation sidelobes
binary code
Binary codes
complementary code set
Correlation
Error correction
Error correction codes
exhaustive search
Hadamard matrix
Laboratories
Radar imaging
Vectors
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 approach is described, designed to find all sets of K complementary binary codes of length N, for specified N and K. Results for several cases are examined.
DOI:10.1109/CISS.2013.6552317