Premium
Simultaneous generation and correlation of complete sets of generalized pairwise complementary sequences
Author(s) -
Hadad Matías N.,
Funes Marcos A.,
Donato Patricio G.,
García Enrique,
Ureña Jesús,
Carrica Daniel
Publication year - 2016
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.2093
Subject(s) - pairwise comparison , computer science , noise immunity , coding (social sciences) , set (abstract data type) , algorithm , correlation , process (computing) , theoretical computer science , mathematics , artificial intelligence , transmission (telecommunications) , telecommunications , statistics , geometry , programming language , operating system
Summary New coding schemes are increasingly being developed to adapt multisensor and communication systems to the requirements of the current technological environment. In some cases, the practical implementation of these schemes involves a great amount of signal processing operations. In order to achieve and make suitable their use in different platforms, efficient algorithms are required to process coding. In the last years, a new kind of complementary sequences, known as Generalized Pairwise Complementary sequences, has been proposed. These sequences provide high noise immunity when they are applied to multiuser systems, as well as a low cross‐correlation, which is convenient in those applications. The aim of this paper is to propose optimized generation and correlation architectures for Generalized Pairwise Complementary sequences that would allow to process a complete set using a reduced amount of operations. An analytical demonstration is provided, with a final comparison to evaluate the reduction with regard to other algorithms. Copyright © 2015 John Wiley & Sons, Ltd.