z-logo
Premium
Efficient filter for the generation/correlation of Golay binary sequence pairs
Author(s) -
García Enrique,
Ureña Jesús,
García Juan J.,
Ruiz Daniel,
Pérez María C.,
García Juan C.
Publication year - 2014
Publication title -
international journal of circuit theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.364
H-Index - 52
eISSN - 1097-007X
pISSN - 0098-9886
DOI - 10.1002/cta.1901
Subject(s) - binary golay code , complementary sequences , mathematics , binary number , algorithm , pseudorandom binary sequence , filter (signal processing) , sequence (biology) , combinatorics , arithmetic , computer science , biology , computer vision , genetics
SUMMARY In this paper, a digital filter for the generation/correlation of binary Golay pairs of sequences of length 2 N  · 10 M  · 26 P ( N , M and P are non‐negative integers) is proposed. It is carried out by means of a novel Golay kernel 26 decomposition, also introduced in this paper, combined with building blocks of Golay kernels 2 and 10, presented in previous works. The proposed filter has a similar architecture to the digital filter for the generation/correlation of Golay multilevel pairs of sequences, where the parameters at intermediate stages have to be adjusted to obtain Golay binary pairs of sequences in the final stage. Copyright © 2013 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom