 Research
 Open Access
 Published:
Binary De Bruijn sequences for DSCDMA systems: analysis and results
EURASIP Journal on Wireless Communications and Networking volume 2011, Article number: 4 (2011)
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 DSCDMA receiver to detect the desired signal relies to a great extent on the autocorrelation properties of the spreading code associated to each user; on the other hand, multiuser 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 DSCDMA is of great interest. This article provides results about the evaluation of specific fulllength binary sequences, the De Bruijn ones, when applied as spreading codes in DSCDMA 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 multiuser 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 correlationbased selection criteria.
Introduction
It is well known that an efficient use of radio spectrum, and the delivery of high capacity to a multitude of final users may be achieved through the adoption of multiuser communication techniques. Among them, code division multiple access (CDMA) using direct sequence (DS) spread spectrum modulation is widely recognized as an efficient solution to allow uncoordinated access by several users to a common radio network, to resist against interference, and to combat the effects of multipath fading [1, 2]. With respect to other possible techniques available to enable multiple access, CDMA may also provide intrinsically secure communications, by the selection of pseudonoise spreading codes [3]. In a CDMA system, the transmitted signal is spread over a frequency band much wider than the minimum bandwidth required to transmit the information. All users share the same frequency band, but each transmitter is assigned a distinct spreading code. The selection of suitable spreading codes plays a fundamental role in determining the performance of a CDMA system. As a matter of fact, the multiple access capability itself is primarily due to coding, thanks to which there is also no requirement for precise time or frequency coordination between the transmitters in the system. Each spread spectrum signal should result uncorrelated to all the other spread signals coexisting in the same band: this property is ensured only by the selection of spreading codes featuring a very low crosscorrelation [4].
As a consequence, the spreading sequence allocated to each user is an essential element in the design of any CDMA system, as it provides the signal with the requested coded format, and ensures the necessary channel separation mechanism. As in any multiuser communication technique, mutual interference among active users is inherent to a CDMA scheme, and, again, it may be strongly affected by the periodic and nonperiodic crosscorrelation properties of the whole set of spreading codes selected for adoption [5]. Further, the number of active users and their relative power levels also affect the performance of a CDMA system, besides the propagation channel conditions. But when the number of active users is fixed, and a specific channel scenario is considered, it is possible to investigate the performance of a CDMA system as a function of the properties exhibited by the spreading codes chosen. Bounds on the system performance are determined by the type of codes used, their length, and their chip rate, and may be changed by selecting a different code set.
Several families of codes have been traditionally adopted for spread spectrum purposes, such as Maximallength sequences (msequences), Gold, and Kasami sequences. Either Gold or Kasami sequences are derived by means of wellknown algorithms from msequences that are generated through Linear Feedback Shift Registers (LFSRs) and exhibit a number of interesting features. In the context of CDMA systems, the most remarkable property is the two valued autocorrelation profile provided by an msequence that allows for a precise synchronization of each user at the receiver. Gold and Kasami sequences are mostly valued for the cardinality of their sets, and for the favorable crosscorrelation properties they provide that are necessary to ensure as limited interference as possible [2]. Orthogonal variable spreading factor (OVSF) codes [6] are adopted in Wideband CDMA as channelization codes, thanks to the orthogonality ensured by codes belonging to the same set, i.e., at a parity of their Spreading Factor (SF). OVSF codes may show very differentiated correlation properties, and do not ensure orthogonality when used asynchronously. This article focuses on the evaluation of a class of binary sequences, named De Bruijn sequences that have been studied for many years [7–9], but not considered, at the authors' best knowledge, in the framework of multiuser communication systems, as a candidate family of spreading codes to apply. Binary De Bruijn sequences are a special class of nonlinear shift register sequences with full period L = 2^{n}: n is called the span of the sequence, i.e., the sequence may be generated by an nstage shift register. In the binary case, the total number of distinct sequences of span n is ; in the more general case of span n sequences over an alphabet of cardinality, α, the number of distinct sequences is . In this article, we refer to binary De Bruijn sequences. The construction of De Bruijn sequences has been extensively investigated, and several different generation techniques have been proposed in the literature [10, 11]; however, due to the exceptional cardinality of their sets, the exhaustive generation of De Bruijn sequences of increasing length is still an open issue. The doubly exponential number of sequences is also a major impediment to characterizing the entire sequence family. At the same time, cardinality is one of the most valued properties of De Bruijn sequences, especially in specific application contexts such as cryptography; on the other hand, not so much is known about the correlation features of the sequences. If adequate, it would be possible to adopt De Bruijn sequences to implement a DSCDMA communication system, thanks to the huge number of different users that could share the radio channel.
In this article, we investigate the possibility of using binary De Bruijn sequences as spreading codes in DSCDMA systems, by studying the correlation properties of such sequences and extending the preliminary results presented in [12]. Given the amount of binary De Bruijn sequences obtainable, even for small values of the span parameter, and considering the great complexity of the generation process [13], we can provide an exhaustive analysis of binary sequences of length 32 (i.e., span 5) that form a set of 2,048 different sequences, and partial results for sequences generated by increasing values of the span.
The article is organized as follows: section "System model" provides a basic description of the DSCDMA reference model adopted in the paper; section "Binary De Bruijn sequences and their correlation properties" discusses the main properties of binary De Bruijn sequences, with a specific focus on the properties considered relevant to our context. Section "Evaluation of binary De Bruijn sequences in DSCDMA systems" evaluates the applicability of De Bruijn sequences in DSCDMA by providing several results obtained through simulations; finally, the article concludes.
System Model
DSCDMA fundamentals
The basic theory of DSCDMA is well known: the main principle is to spread the user information, i.e., data symbols, by a spreading sequence c^{(k)}(t) of length L. The development of the theoretical model shows that several terms may affect symbol estimation: the desired signal of the k th user, the multiple access interference, the additive noise, and the multipath propagation effect. Due to the multiple access interference term, information bit estimation may be wrong with a certain probability, even at high signaltonoise ratio (SNR) values, leading to the wellknown errorfloor in the BER curves of DSCDMA systems.
Phasecoded spread spectrum multiple access systems, such as DSCDMA, may be analyzed by modelling phase shifts, time delays, and data symbols as mutually independent random variables (Pursley et al., [5]). Interference terms are random as well, and treated as additional noise. By this way, the SNR at the output of a correlation receiver in the system is computed by means of probabilistic expectations, with respect to the phase shifts, time delays, and data symbols. According to such an approach, in asynchronous DSCDMA systems, the average interference parameter may be expressed by:
where A_{ k }(l) denotes the aperiodic correlation function of the k th user's spreading sequence c^{(k)}(t), with period L. The aperiodic correlation function is, in its turn, defined as:
The average SNR at the output of a correlator receiver of the i th user among the K users in the system, under AWGN environment, is given by:
and the average bit error probability for the i th user is defined as
provided a Gaussian distribution for the MAI term, and . According to Equation 3, the signaltonoise ratio of the i th user in the system can be evaluated without knowledge of the crosscorrelation functions of the spreading codes used, but by resorting to the proper aperiodic correlation definition. When dealing with binary De Bruijn sequences, avoiding the need to exhaustively evaluate the crosscorrelation values in a given family may be very important, due to the computational burden associated to the huge cardinality of a set. In any case, crosscorrelation between sequences is equally significant in multiuser communication systems, because it is a measure of the agreement between different codes, i.e., of the channel separation capability. The same family of spreading codes may provide very different performances when evaluating their auto or crosscorrelation. As an example, the msequences themselves, though providing optimal autocorrelation, are not immune to crosscorrelation problems and may have large crosscorrelation values. In [14], Welch obtained a lower bound on the crosscorrelation between any pair of binary sequences of period L in a set of M sequences, given by:
where a and b are two binary sequences in the set having the same period L, and l denotes any possible value of the shift among the sequences (0 ≤ l ≤ L  1); the approximation holds when M ≫ L (increasing value of the span n). It is shown in the following that the approximation is tightly verified by De Bruijn binary sequences, due to the double exponential growth of M with n they feature. Being Equation 5 a lower bound, it may help in identifying the sequences showing the worst behavior, i.e., those providing the highest value of the bound.
In the following, we will provide discussions about the correlation properties of binary De Bruijn sequences, that represent the specific set of fulllength sequences we are interested in. In section "Evaluation of binary De Bruijn sequences in DSCDMA systems," a comparative evaluation of the Welch bound for different families of binary spreading codes will be also presented.
Channel model
In order to test the performance obtainable by the application of De Bruijn sequences as spreading codes in a classical DSCDMA system, we assume a gaussian channel affected by multipath that is described by means of either the indoor office test environment and the outdoor to indoor and pedestrian test environment described in [15]. In both the cases, the socalled Channel A specified by the Recommendation has been considered.
Both the channel configurations are simulated by means of a tappeddelayline model, with different values assigned to relative delay (in ns) and average power (in dB) of each path: there are five secondary paths in the indoor test environment, and three secondary paths in the outdoor model. A detailed description of each model may be found in the related reference. Such channel models have been taken as a reference to test the performance of a DSCDMA system when different choices of the spreading codes are performed, as discussed in section "Evaluation of binary De Bruijn sequences in DSCDMA systems."
Binary De Bruijn Sequences and their Correlation Properties
The states S_{0}, S_{1}, . . ., S_{N  1}of a span n De Bruijn sequence are exactly 2^{n} different binary ntuples; when viewed cyclically, a De Bruijn sequence of length 2^{n} contains each binary ntuple exactly once over a period. Being maximal period binary sequences, the length of a De Bruijn sequence is always an even number.
When comparing the total number of De Bruijn sequences of length L to the total number of available msequences, Gold, or Kasami sequences, similar but not identical length values shall be considered, as reported in Table 1. The table confirms the double exponential growth in the cardinality of De Bruijn sequences, at a parity of the span n, with respect to the other sequences. Of course, not all the De Bruijn sequences of span n may be suitable for application in a multiuser system; anyway, even if strict selection criteria are applied, it is reasonable to expect that a quite extended subset of sequences may be extracted from the entire family.
About the autocorrelation values , τ = 0, 1, . . ., L  1, assumed by a De Bruijn sequence c of span n and period L, for a given shift τ, the known results are as follows:
Further, for n ≥ 3, θ_{ c }(2^{n1}) is a multiple of 8.
The second property implies that as long as the span of the sequence increases, there exist more values of the shift τ for which the autocorrelation sidelobes (i.e., the values assumed for τ ≠ 0) are zero. Obviously, at a parity of the chip time, the time duration of each null sample is reduces. These null values are adjacent to the autocorrelation peak value, and contribute to provide resistance against possible multipath effects. It may be shown that the autocorrelation profile is always symmetric with respect to the central value of the shift, and that θ_{ c } (τ) ≡ 0 mod 4 for all τ, for any binary sequence of period L = 2^{n}, with n ≥ 2. As any binary De Bruijn sequence c comprises the same number of 1's and 0's, when converted into a bipolar form, the following holds:
So, when n increases, the autocorrelation profiles of the De Bruijn sequences will show many samples equal to 0, a symmetric distribution of the samples, and a reduced number of different positive and negative samples, as to give an average autocorrelation equal to 0. Figure 1 shows the average autocorrelation profile of the set of span 5 De Bruijn sequences that confirms the previous properties.
A simple bound may be defined for the positive values of the correlation functions sidelobes in De Bruijn sequences [16]:
where [x]^{+} denotes the smallest integer greater than or equal to x. The left inequality follows from the second and the third properties in (6); the right inequality is due to the peculiar features of De Bruijn sequences that are fulllength sequences, a period of which includes all the possible binary ntuples. In the case of binary De Bruijn sequences of span n = 5, the bound gives 0 ≤ maxθ (τ) ≤ 16.
The crosscorrelation computed between pairs of De Bruijn sequences a and b randomly chosen, of the same span and period L, denoted as , for 0 ≤ τ ≤ L  1, exhibits properties very similar to those discussed for the autocorrelation function:
For the crosscorrelation function of a pair of De Bruijn sequences a and b (a ≠ b) of the same span n, the following bound holds [16]:
All the possible crosscorrelation values are integer multiple of 4. Figure 2 shows the average crosscorrelation profile of binary De Bruijn sequences of span 5.
It is worth noting that De Bruijn sequences may be piecewise orthogonal, meaning that it is possible to find two sequences having null crosscorrelation for several values of the shift parameter τ. On the other hand, it is also possible that two De Bruijn sequences have an absolute value of the crosscorrelation equal to 2^{n} for some value of the shift τ (e.g. complementary sequences), as stated by the bound equation above. This variability in the crosscorrelation behavior of the sequences may affect the performance of the CDMA system, when the spreading sequences associated to each user are chosen randomly from the whole set; it will be discussed in the following, with reference to the case of span n = 5 sequences. This also motivates the need for a proper selection criterion to be applied on the whole set of sequences, to extract the most suitable spreading codes to use in the DSCDMA system.
Evaluation of Binary De Bruijn Sequences in DSCDMA Systems
As previously stated in the "Introduction," we can provide a comprehensive evaluation of binary De Bruijn sequences of length 32, i.e., n = 5, which form a set of 2,048 different sequences because, given the small value of the span parameter considered, it is possible to generate the whole set of sequences by means of an exhaustive approach, which may be intended as a brute force one: all the possible binary sequences of length 2^{n} are generated, then the ones satisfying the De Bruijn definition are selected.
For increasing values of n, the brute force generation process becomes unfeasible, and more sophisticated techniques shall be applied [13]. A useful overview of possible alternative approaches suggested in the literature may be found in [17]. However, the main limitation of such solutions is related to the reduced number of sequences they allow to obtain by a single generation step. As a consequence, in this article, we opted for a generation strategy that we named "tree approach". Basically, sequence generation starts with n zeros (the allzero ntuple shall be always included in a period of a span n De Bruijn sequence) and appends a one or a zero, as the next bit of the sequence, thus originating two branches. As long as the last ntuple in the partial sequence obtained has not yet appeared before, generation goes on by iterating the process; otherwise the generation path is discarded. This generation scheme that proceeds by parallel branches is fast to execute, and has the advantage of providing the whole set of sequences that we need to perform our correlationrelated evaluations. However, the approach suggested suffers for memory limitations, because all the sequences having the same span n must be generated at the same time. As a consequence, taking into account our focus on the correlation properties of the sequences, we introduce in the generation process a constraint related to crosscorrelation: when two generation paths share a common pattern of bits in their initial root, one of them is pruned, in order to reduce a priori the number of sequences that will provide high crosscorrelation, due to the presence of common bit patterns.
Before moving to the evaluation of the auto and crosscorrelation properties of binary De Bruijn sequences, for n = 5 and n = 6, let us compare the behavior of such sequences to other families of spreading codes, with respect to the Welch bound discussed above.
De Bruijn sequences and the Welch bound
As previously stated, the Welch bound allows to evaluate a family of binary spreading codes in terms of its crosscorrelation performance. The bound is a lower one, as a consequence, by evaluating such bound over different code sets we can draw conclusions about the one providing the worst performance, i.e., the one for which the bound assumes the highest value. According to this statement, we can compare the Welch bound profile of different sets of spreading codes, namely msequences, Gold, OVSF, Kasami, and De Bruijn sequences, at a parity of the span n. To such an aim, we first compute the expression of the Welch bound for each set of spreading codes, starting from the general definition of Equation 5. In the case of OVSF sequences, we assume even values of the spreading factor, given by SF = 2^{n}.
Welch bound for msequences
The number of msequences of period L = 2^{n}  1 is given by the number of primitive polynomials of degree n, i.e., ϕ (L)/n, where ϕ is the Euler's totient function [18]. So we have M = ϕ (L)/n and, by substitution into Equation 5, we get:
where WB_{ m } denotes the expression of the Welch bound for msequences.
Welch bound for Gold sequences
Gold sequences are generated from the socalled preferred pairs of msequences, for values of the span n that satisfy the conditions: n ≠ 0 (mod 4) or n = 2 (mod 4). In the case of Gold sequences, we have L = 2^{n}  1, and M = L + 2 = 2^{n} + 1, so that:
Welch bound for OVSF sequences
OVSF sequences are adopted as channelization codes in Wideband CDMA (WCDMA), together with Gold codes used as information scrambling sequences. The main feature of OVSF codes that are derived from WalshHadamard sequences is to be mutually orthogonal at a parity of the SF parameter. However, the orthogonality is ensured in the synchronous case, whereas it is usually lost when OVSF codes are applied asynchronously. Codes in the same OVSF family may exhibit different autocorrelation behaviors, with the possible presence of autocorrelation peaks even for values of the shift τ ≠ 0. The crosscorrelation function is zero for OVSF codes of the same SF, and not null in the other cases. In the case of OVSF sequences we have L = M = SF , so that:
When the SF is a power of 2, as in the simulated cases, we can express it as SF = 2^{n} so that r_{ ab } ≥ WB_{OVSF} ≅ 2^{n/2}. However, it is worth noting that in the specific case of OVSF sequences, for which M = L, the condition of validity of the Welch bound approximation is not strictly verified.
Welch bound for Kasami sequences
In the case of Kasami sequences that are generated from msequences as well, we have to distinguish between the socalled small set and the large set of sequences. A procedure similar to that used to generate Gold codes permits to obtain the small set of Kasami sequences, that have M = 2^{n/2}and a period L = 2^{n}  1, where n is even. The large set of Kasami sequences contains, again, sequences of period L = 2^{n}  1 for n even, and includes either the Gold sequences or the small set. For this set, we have M = 2^{3n/2}if n = 0 (mod 4), and M = 2^{3n/2}+ 2^{n/2}if n = 2 (mod 4).
So, for the small set of Kasami sequences, when n is even:
For the large set of Kasami sequences:
when n = 0 (mod 4), and:
when n = 2 (mod 4).
Welch bound for De Bruijn sequences
In the case of binary De Bruijn sequence, for any value of the span n we have: and L = 2^{n} , so that:
Once derived the expression of the Welch bound specific for each code set, it is possible to compare the sequences' behaviors by evaluating each bound equation for different values of the span n, ranging from 3 to 10. Figure 3 shows the resulting performance, together with the asymptotic curve, corresponding to that holds when M ≫ L. In evaluating the asymptotic curve, we assume .
For the smallest values of the span n, msequences and De Bruijn sequences show the lowest values of the bound; when n increases, De Bruijn sequences exhibit performance comparable to Gold and Kasami large set sequences. As shown, the asymptotic curve is well approached by the De Bruijn sequences, even for small values of n, thanks to the double exponential growth of M with n. As long as the value of the span n increases, the De Bruijn sequences show a better adherence to the Welch bound than the other families of spreading codes considered for comparison. Detailed values assumed by the bound for each family of sequences and for n = 3 and n = 10 are reported in Table 2.
Auto and crosscorrelation properties of De Bruijn sequences
Any set of binary De Bruijn sequences of span n includes M/2 different sequences, and their corresponding complementary ones; so, in the set n = 5 we have 1,024 different sequences, and 1,024 complementary sequences. Table 3 provides a description of the statistical properties of the autocorrelation functions for the sequences included in this set; as shown, from the whole family of sequences, two subsets are extracted, corresponding to different thresholds on the maximum absolute value of the autocorrelation sidelobes (i.e., for shift τ ≠ 0). Low sidelobes in the autocorrelation functions of the CDMA spreading sequences allow a better synchronization at the receiver, so we select two subsets, Φ_{4} that contains 12 sequences, for which the maximum absolute value of the autocorrelation sidelobes is 4, and Φ_{8} that includes 784 sequences, for which the maximum absolute value of the autocorrelation sidelobes is 8. As expected, all the sequences in any set have an average autocorrelation equal to 0.
The crosscorrelation function computed between two complementary De Bruijn sequences always shows a negative peak value of  2^{n}, for a shift τ = 0. As a consequence, given the DSCDMA context of application, it is necessary to avoid the presence of complementary sequences in the set from which spreading codes are chosen. This constraint will limit our analysis to 1,024 sequences of span n = 5. Table 4 describes the statistical properties of the crosscorrelation functions computed over 1,024 De Bruijn sequences of span 5 that are divided into different subsets by setting different thresholds on the maximum absolute value of the crosscorrelation peak. The analysis performed on the crosscorrelation properties shows that the two sequences extracted from the half set, for which the crosscorrelation absolute peak value is 8, are also the two optimum sequences for autocorrelation. We also observe that in the subset Φ_{4}, when the threshold on the maximum absolute value of the crosscorrelation peak decreases, the statistical figures evaluated increase. It means that if we try to extract sequences having low autocorrelation sidelobes, like those in Φ_{4}, we cannot simultaneously reduce the crosscorrelation peak and sidelobes values. If we want a limited crosscorrelation peak, we must accept higher sidelobes, and viceversa. As a further remark, we may say that high values of the crosscorrelation functions (i.e., greater than 12) are sporadically obtained; however, when these values appear, and the crosscorrelation between two sequences gets higher than 20, the effects on the DSCDMA system performance are disruptive.
Results similar to those presented in Table 3 have been derived also for a partial set of De Bruijn sequences of span 6. The generation of span 6 De Bruijn sequences is performed by resorting to the "tree approach" under development. In a first round, the generated paths are pruned every 8 steps; by this way, we limit the generation to a partial set of 268,510 sequences. Among them, we select those sequences for which the maximum absolute value of the autocorrelation sidelobes does not exceed 8, and we obtain 127 sequences. These are further selected into a subset of 15 sequences, for which the maximum crosscorrelation equals 24, and into a subset of 34 sequences, for which the maximum crosscorrelation equals 28. It is worth noting that even when limiting the subset of sequences to those having a maximum absolute value of the autocorrelation sidelobes equal to 8, we still get 127 different sequences among which we can select the required spreading codes for the DSCDMA system.
A similar approach is applied to the sequences generated by pruning the partial paths every 6 steps. A smaller set is obtained, including 4,749 sequences, among which we select 736 sequences having a maximum absolute value of the autocorrelation sidelobes equal to 12. From this subset, we further select 7 sequences with a maximum crosscorrelation peak equal to 24, and 18 sequences with a maximum crosscorrelation peak of 28. The properties of the sequences obtained are described in Tables 5 and 6.
Considering the family of span 5 De Bruijn sequences that we can generate exhaustively, once obtained the subset Φ_{4} including sequences with favorable crosscorrelation functions, we tested the possibility of adopting them as spreading codes in the downlink and uplink sections of a DSCDMA system, for different numbers of users. We computed the average error probability at the output of a correlator receiver of the i th user, in a gaussian channel affected by multipath, according to the Channel A indoor and outdoortoindoor test environments specified in [15]. The performance provided by the adoption of De Bruijn sequences are compared to those obtainable by adopting OVSF sequences in the dowlink section, Gold sequences in the uplink section, and to the ideal behavior of the system (no interference). Some results are also provided, related to the outdoor test environment only, for sequences of span n = 6.
Downlink section, span n = 5
Simulations in the downlink section of the CDMA system are performed by comparing De Bruijn and OVSF sequences of length 32, in the case of 2, 3, and 4 active users. De Bruijn sequences belong to the set Φ_{4} that includes 12 pairwise complementary sequences: 6 sequences are chosen, by excluding the corresponding complementary ones, so that they may result orthogonal with respect to the corresponding crosscorrelation. At the same time, 32 OVSF sequences are generated, and the average performance computed over all the possible subsets of 4 sequences obtainable from the whole set.
Simulation results are shown in Figures 4 and 5, for the indoor and outdoor Channel A test environments, respectively. The average probability of error is estimated, for the E_{ b }/N_{0} parameter ranging from 6 to 14 dB or 12 dB, and for a number of active users equal to 2, 3 and 4.
As a general remark, we may observe that De Bruijn sequences generally perform slightly better than OVSF sequences, thanks to their more favorable autocorrelation profiles, with respect to OVSF codes. The improvement brought by the adoption of De Bruijn sequences is more evident for higher values of the E_{ b }/N_{0} parameter.
Uplink section, span n = 5
In the uplink section of the CDMA system, we compare De Bruijn sequences of length 32 and Gold sequences of length 31, in the case of 2, 3, and 4 active users. De Bruijn sequences are selected in the set Φ_{8} that includes 7 sequences showing a maximum absolute value of the crosscorrelation equal to 12. The performance is averaged over all the possible selections of 2, 3, and 4 sequences in the whole set. In a similar way, we also test the performance provided by the set of 33 Gold sequences, by averaging the results obtained by different choices of 4, 3, and 2 spreading codes.
Figures 6 and 7 show the estimated behavior, in the indoor and outdoor Channel A test environments, respectively. Again, the average probability of error is estimated for the E_{ b }/N_{0} parameter ranging from 6 to 14 dB or 12 dB.
It is evident that in all the situations considered, Gold codes perform better than De Bruijn ones, even if the differences in the average probability of error are not so significant. We can say that De Bruijn sequences are comparable to OVSF codes, whereas they do not perform so good with respect to Gold sequences. The last comparison we provide refers to the outdoor test environment only, for span n = 6.
Uplink and downlink sections, span n = 6
As a final evaluation, we consider span 6 sequences, i.e., OVSF sequences of length 64, Gold codes of length 63, and De Bruijn sequences of length 64 belonging to the subset Φ_{8} in Table 5 made of sequences showing a maximum value of the crosscorrelation equal to 28. We test their performance in the outdoor test environment only, either in the downlink or in the uplink sections. Similar to the previous test, we compare De Bruijn sequences to Gold codes in the uplink section, and to the OVSF codes in the downlink section, and consider the case of four users active in the system. Figure 8 shows the average error probability for different values of the E_{ b }/N_{0} parameter. It is confirmed that Gold codes perform better than De Bruijn ones, even for increased span, whereas De Bruijn sequences are better than OVSF codes in the downlink section.
Conclusion
This article presented some results about the application of binary De Bruijn sequences in DSCDMA systems, as user spreading codes. Binary De Bruijn sequences feature great cardinality of the available sequence sets, even for small values of the span parameter, and may consequently allow the definition of proper selection criteria, based on thresholds applied on the auto and crosscorrelation profiles, though preserving a great number of available codes. The performance provided by De Bruijn sequences have been compared to those obtained by more consolidated solutions, relying on the use of msequences, Gold, and OVSF sequences as spreading codes. From simulations, it is evident that De Bruijn codes show a rather similar behavior to the code sets traditionally considered, and designed ad hoc to provide good CDMA performance. Consequently, the results discussed in this article encourage further studies and analyses, to extensively test the applicability of De Bruijn sequences in multiuser contexts, even by resorting to longer codes, that, however, require more sophisticated generation techniques. At the same time, a thorough investigation of the sequences correlation properties is fundamental, to design suitable selection criteria for each specific application scenario.
Abbreviations
 CDMA:

code division multiple access
 DS:

direct sequence
 LFSRs:

Linear Feedback Shift Registers.
References
 1.
Pursley MB: Performance evaluation for phasecoded spread spectrum multipleaccess communicationpart I: system analysis. IEEE Trans Commun 1977, COM25(8):795799.
 2.
Dinan EH, Jabbari B: Spreading Codes for Direct Sequence CDMA and Wideband CDMA Cellular Networks. IEEE Commun Mag 1998, 36(9):4854. 10.1109/35.714616
 3.
Haykin S: Communication Systems. 4th edition. Wiley, New York; 2001.
 4.
Sarwate DV, Pursley MB: Crosscorrelation properties of pseudorandom and related sequences. Proc IEEE 1980, 68(05):593619.
 5.
Pursley MB, Sarwate DV: Performance evaluation for phasecoded spread spectrum multipleaccess communicationpart ii: code sequence analysis. IEEE Trans Commun 1977, COM25(8):800802.
 6.
Minn T, Siu KY: Dynamic assignment of orthogonal variablespreadingfactor codes in WCDMA. IEEE J Sel Areas Commun 2000, 18(8):14291440. 10.1109/49.864008
 7.
De Bruijn N: A combinatorial problem. Proc Ned Akad Wet 1946, 49: 758764.
 8.
Mayhew GL: Clues to the hidden nature of de Bruijn sequences. Comput Math Appl 2000, 39: 5765.
 9.
Fredricksen H: A survey of full length nonlinear shift register cycle algorithms. SIAM Rev 1982, (24):195221.
 10.
Mitchell CJ, Etzion T, Paterson KG: A method for constructing decodable de Bruijn sequences. IEEE Trans Inf Theory 1996, 42(5):14721478. 10.1109/18.532887
 11.
Annexstein FS: Generating De Bruijn sequences: an efficient implementation. IEEE Trans Comput 1997, 46(2):198200. 10.1109/12.565596
 12.
Andrenacci S, Gambi E, Spinsante S: Preliminary results on the adoption of De Bruijn binary sequences in DSCDMA Systems. In Multiple Access Communications, Proc. of MACOM 2010. Volume 6235. LNCS, Springer, Berlin, Heidelberg; 2010:5869. 10.1007/9783642154287_6
 13.
Etzion T, Lempel A: Algorithms for the generation of fulllength shiftregister sequences. IEEE Trans Inform Theory 1984, IT30(3):480484.
 14.
Welch LR: Lower bounds on the maximum crosscorrelation of signals. IEEE Trans Inform Theory 1974, (IT20):397399.
 15.
Recommendation ITUR M.1225: "Guidelines for Evaluation of Radio Transmission Technologies for IMT2000". International Telecommunication Union 1997.
 16.
Zhaozhi Z, Wende C: Correlation properties of De Bruijn sequences. Syst Sci Math Sci Acad Sinica 1989, 2(2):170183.
 17.
Zhang W, Liu S, Huang H: An efficient implementation algorithm for generating de Bruijn sequences. J Comput Stand Interfaces 2009, 31(6):11901191. 10.1016/j.csi.2008.12.001
 18.
Golomb SW: Shift Register Sequences. Aegean Park Press, Laguna Hills; 1981.
Author information
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Spinsante, S., Andrenacci, S. & Gambi, E. Binary De Bruijn sequences for DSCDMA systems: analysis and results. J Wireless Com Network 2011, 4 (2011) doi:10.1186/1687149920114
Received:
Accepted:
Published:
Keywords
 Spreading code
 De Bruijn sequence
 DSCDMA
 Welch bound