Two algorithms for the direct computation of binary correlation functions

Two algorithms for the direct computation of binary correlation functions

Two algorithms for computing the two-sided correlation function (correlogram) and several identities for the cross correlation of binary codes are developed. The basic theorem (The Product Rule) shows the correlogram of two binary codes, X * Y, to be the arithmetic product of Y and the mirror revers...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings of the IEEE 1967, Vol.55 (9), p.1638-1639
1. Verfasser: Simmons, G.J.
Format: Artikel
Sprache:eng
Schlagworte:
Arithmetic
Binary codes
Binary sequences
Equations
Mirrors
Power generation
Upper bound
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Two algorithms for computing the two-sided correlation function (correlogram) and several identities for the cross correlation of binary codes are developed. The basic theorem (The Product Rule) shows the correlogram of two binary codes, X * Y, to be the arithmetic product of Y and the mirror reversal of X, when the code symbols are ±1.
ISSN:0018-9219
1558-2256
DOI:10.1109/PROC.1967.5932