BOUNDS ON PARTIAL CORRELATIONS OF SEQUENCES

Citation
Kg. Paterson et Pjg. Lothian, BOUNDS ON PARTIAL CORRELATIONS OF SEQUENCES, IEEE transactions on information theory, 44(3), 1998, pp. 1164-1175
Citations number
29
Categorie Soggetti
Computer Science Information Systems","Engineering, Eletrical & Electronic","Computer Science Information Systems
ISSN journal
00189448
Volume
44
Issue
3
Year of publication
1998
Pages
1164 - 1175
Database
ISI
SICI code
0018-9448(1998)44:3<1164:BOPCOS>2.0.ZU;2-N
Abstract
Two approaches to bounding the partial auto-and crosscorrelations of b inary sequences are considered. The first approach uses the discrete F ourier transform and bounds for character sums to obtain bounds on par tial autocorrelations of m-sequences and on the partial auto-and cross correlations for the small Kasami sets and dual-BCH families of sequen ces. The second approach applies to binary sequences obtained by inter leaving m-sequences, A bound on the peak partial correlation of such s equences is derived in terms of the peak partial autocorrelation of th e underlying m-sequences, The bound is applied to GMW, No, and other f amilies of sequences for particular parameters. A comparison of the tw o approaches shows that the elementary method gives generally weaker r esults but is more widely applicable, On the other hand, both methods show that well-known sequence families can have favorable partial corr elation characteristics, making them useful in certain spread-spectrum applications.