Simultaneous correlation of orthogonal pairs of complementary sequences

Efficient simultaneous correlation of M mutually orthogonal complementary sets of sequences

“…Much effort is currently devoted to improving CSS correlation for being the most demanding operation. Previous contributions [2,3] have provided improved correlation architectures. The calculation efficiency obtained with those contributions has constituted a significant step towards the practical application of these sequences.…”

“…. , M ), which is in accordance with the last correlation stage [2,5]. In the correlation process, each set is detected when the seed of the last correlator stage is equal to that corresponding to a particular set.…”

Reduced architecture for simultaneous correlation of orthogonal sets of complementary sequences

“…Next, the simultaneous correlation of two orthogonal pairs of Golay sequences was demonstrated in [4], using a single correlation architecture (O 2 GC). To generalise the OGC with respect to the M complementary set of sequences (M-CSS), a new correlation architecture is proposed in [5].…”

“…To generalise the OGC with respect to the M complementary set of sequences (M-CSS), a new correlation architecture is proposed in [5]. This Letter presents a recursive algorithm to simultaneously correlate 4-CSS and so obtain a similar calculation reduction to that in [4].…”

“…Given a 4-CSS, there are four mutually orthogonal sets, which can be generated from different seeds in the first generation stage [2,4]. In other words, the orthogonality is given by w i,1 (i ¼ 1, 2), all the other seed coefficients remaining equal.…”