Efficient simultaneous correlation of
            <i>M</i>
            mutually orthogonal complementary sets of sequences

Hadad, Martín Ariel; Funes, Marcos; Donato, Patricio G.; Carrica, Daniel

doi:10.1049/el.2011.0585

Cited by 3 publications

(3 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By applying a similar reasoning to the one shown in [17], it may be assumed that the correlation of a subgroup of GPC sequences can be obtained by replacing the single row of the Hadamard matrix (Hg) with the full Hadamard matrix, as it is shown in 22 and Figure 8. Figure 9 provides an example of the scheme that is used to implement the product H 4 ÁD ′ 4 z ð ÞÁC j by using a reduced architecture.…”

Section: A Simultaneous Generalized Pairwise Complementary Correlatimentioning

confidence: 99%

“…Earlier works [6,16,17] have introduced new approaches for CSS generation and correlation, which result in a significant reduction in the number of required operations to process CSS. Accordingly, similar approaches can be applied to GPC sequences in order to reduce the amount of operations required by the generation and correlation processes.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Simultaneous generation and correlation of complete sets of generalized pairwise complementary sequences

Hadad

Funes

Donato

et al. 2015

Circuit Theory & Apps

View full text Add to dashboard Cite

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 . MN Hadad, MA Funes, PG Donato, DO Carrica. Hardware implementation of simultaneous M mutually orthogonal complementary sets of sequences algorithms.

show abstract

Section: A Simultaneous Generalized Pairwise Complementary Correlatimentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Simultaneous generation and correlation of complete sets of generalized pairwise complementary sequences

Hadad

Funes

Donato

et al. 2015

Circuit Theory & Apps

View full text Add to dashboard Cite

show abstract

“…In addition, several efficient generations and correlations are also developed for PCSS [24][25][26][27][28]. The authors of [29,30] have proposed efficient calculation of fast Fourier transform (FFT) of ZC sequence.…”

Section: Introductionmentioning

confidence: 99%

Joint timing synchronization and channel estimation based on ZCZ sequence set in SC-MIMO-FDE system

Wang

Sun

et al. 2016

J Wireless Com Network

View full text Add to dashboard Cite

In this paper, we investigate the channel estimation and time synchronization problem based on the zero correlation zone (ZCZ) sequence set for single carrier multiple-input multiple-output frequency domain equalization (SC-MIMO-FDE). A factorized construction of ZCZ sequence set considering the properties of both ZCZ and nonzero correlation zone (NCZ) is proposed with efficient generator and correlator, which can be in favor of timing synchronization and channel estimation both in performance and computation complexity. Using the ZCZ sequence set, a new algorithm called twice section-maximum algorithm is put forward to eliminate energy interference among channels from different transmitting antennas to the same receiving antenna. The performance achieved by the developed algorithm which performs joint timing synchronization and channel estimation with lower computational cost is better than that of the conventional method.

show abstract

Efficient Architectures for the Generation and Correlation of Binary CSS Derived From Different Kernel Lengths

García

Ureña

Garcı́a

et al. 2013

IEEE Trans. Signal Process.

View full text Add to dashboard Cite

Efficient simultaneous correlation of M mutually orthogonal complementary sets of sequences

Cited by 3 publications

References 4 publications

Simultaneous generation and correlation of complete sets of generalized pairwise complementary sequences

Simultaneous generation and correlation of complete sets of generalized pairwise complementary sequences

Joint timing synchronization and channel estimation based on ZCZ sequence set in SC-MIMO-FDE system

Efficient Architectures for the Generation and Correlation of Binary CSS Derived From Different Kernel Lengths

Contact Info

Product

Resources

About