Binary De Bruijn sequences for DS-CDMA systems: analysis and results

Abstract

Code division multiple access (CDMA) using direct sequence (DS) spread spectrum modulation provides multiple access capability essentially thanks to the adoption of proper sequences as spreading codes. The ability of a DS-CDMA receiver to detect the desired signal relies to a great extent on the auto-correlation properties of the spreading code associated to each user; on the other hand, multi-user interference rejection depends on the crosscorrelation properties of all the spreading codes in the considered set. As a consequence, the analysis of new families of spreading codes to be adopted in DS-CDMA is of great interest. This article provides results about the evaluation of specific full-length binary sequences, the De Bruijn ones, when applied as spreading codes in DS-CDMA schemes, and compares their performance to other families of spreading codes commonly used, such as msequences, Gold, OVSF, and Kasami sequences. While the latter sets of sequences have been specifically designed for application in multi-user communication contexts, De Bruijn sequences come from combinatorial mathematics, and have been applied in completely different scenarios. Considering the similarity of De Bruijn sequences to random sequences, we investigate the performance resulting by applying them as spreading codes. The results herein presented suggest that binary De Bruijn sequences, when properly selected, may compete with more consolidated options, and encourage further investigation activities, specifically focused on the generation of longer sequences, and the definition of correlation-based selection criteria.

De Bruijn sequences analysis through Ambiguity functions in a deep-space communication scenario

“…Surely, not all the 2 sequences could be suitable for a target multi-user scenario. Even if strict selection criteria are applied, it is reasonable to expect that a quite huge amount of sequences may be extracted from the entire family, as shown in a previous paper for De Bruijn sequences of span 6 [7]. The autocorrelation (k) of a De Bruijn sequence in bipolar form c = (c , c , … , c ), of length L = 2 n , for a given shift k, may assume only a set of given values, as stated by the following properties:…”

De Bruijn Graph Based Solution for Lookup Acceleration and Optimization in P2P Networks

“…De Bruijn graphs have been proposed for many applications [15] but also for network routing. P2P community is interested to exploit these graphs and their applications as part of DHTs.…”

Physical resilience to insider attacks in IoT networks: Independent cryptographically secure sequences for DSSS anti-jamming

“…The literature on CC of sequence sets for wireless communication [23,24,20,25] characterizes a given family of sequence sets by the maximum CC value of all the pairs of sequences within a set . In most cases, due to the impossibility of computing exact-values, lower bounds for are given.…”