GOLAY COMPLEMENTARY SEQUENCES ARE SUPERIOR TO PN SEQUENCES
Srdjan Budigin
Abstract
Srdjan Budigin
Abstract
Golay sequences were considered, up to now, only as pairs of sequences with complementary autocorrelation functions. Here we consider the properties of individual Golay sequences and show that they are in many respects equal or superior to PN sequences. The following properties of both sequences are compared: sequence length, number of sequences, autocorrelation properties, spectral properties, complexity of sequence generators and correlators. The most important advantage of Golay sequences is the existence of the Fast Golay Correlation algorithm which make them ideal for applications that require high bit rates and large sequence lengths.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Golay sequences were considered, up to now, only as pairs of sequences with complementary autocorrelation functions. Here we consider the properties of individual Golay sequences and show that they are in many respects equal or superior to PN sequences. The following properties of both sequences are compared: sequence length, number of sequences, autocorrelation properties, spectral properties, complexity of sequence generators and correlators. The most important advantage of Golay sequences is the existence of the Fast Golay Correlation algorithm which make them ideal for applications that require high bit rates and large sequence lengths.
Key concepts: Binary Golay code, Complementary sequences, Autocorrelation, Mathematics, Sequence (biology), Combinatorics, Algorithm, Ternary Golay code