Tabu search: an efficient tool for designing DS-CDMA spreading sequences

Gold functions are well-known for designing sequences with good correlation properties. This paper reveals a fascinating relationship between Gold functions and Golay-Davis-Jedwab (GDJ) Boolean functions to design sequences with low correlation and low PAPR, which is the first of its kind. The bent and semi-bent properties of the Gold functions are utilized to derive the correlation of the resultant binary spreading sequence sets, while the complementary properties of the GDJ Boolean functions are used to derive the low PAPR. Based on this idea we propose three new sets of binary spreading sequences with low PAPR and low correlation. The proposed sequence sets have the potential to be used as spreading sequences in non-orthogonal multiple access (NOMA). They have a very large set size, which in turn results in a high overloading factor as compared to the existing sequence sets with the same length and the same correlation, which are generated through systematic constructions.

A detailed study of the effects of binary spreading sequences (BSS) excitation in the magnetization dynamics of exchange-biased spin-valves driven by spin-transfer-torque has been carried out by full micromagnetic modeling. We show that the use of BSS allows to trigger the magnetization reversal by exciting its main precession modes. We compared our numerical results with the experimental ones reported by [Cui et al., Phys. Rev. B 77, 214440 (2008)], attaining quantitative agreement. Advantages of BSS as microwave source with respect to a sinusoidal signal are also reported and discussed.

The paper contains an analysis of the basic criteria for the selection of spreading sequences for the multi-carrier CDMA (MC-CDMA) systems with spectrum spreading in the frequency domain. It is shown that the time-domain crosscorrelation function between the spreading sequences is not a proper interference measure for the asynchronous MC-CDMA users. Therefore the spectral correlation function is introduced and, together with the peak-to-average power ratio (PAPR) and the dynamic range of the corresponding multi-carrier waveforms, is used for the evaluation of MC-CDMA sequences. Some well-known classes of sequences, such as Walsh and Gold sequences, as well as orthogonal Gold and Zadoff-Chu (1972) sequences, are evaluated with respect to the aforementioned basic criteria. It is also shown that the multi-carrier spread spectrum waveforms based on the (multilevel) Huffman sequences have the lower PAPR than a single sine wave.

It is well known that jointly optimal multiuser detection for code division multiplex access (CDMA) systems has complexity which grows exponentially with the number of users. Recently, several authors [S. Ulukus and R. D. Yates, April 1998], [C. Sankaran and A. Ephremides, Sept. 1998], [C. Schlegel and A. Grant, 2000] have reported that, for certain special sets of spreading sequences, optimal multiuser detection in synchronous CDMA systems can be performed with computational complexity which is polynomial in the number of users. In this paper, we show that the existing polynomial complexity (PC) algorithms of [S. Ulukus and R. D. Yates, April 1998], [C. Sankaran and A. Ephremides, Sept. 1998], [C. Schlegel and A. Grant, 2000] lead to efficient algorithms for a wider class of spreading sequences than initially proposed. We identify these sequences and prove the existence of optimal polynomial-complexity algorithms for detecting synchronous CDMA signals using these sequences. We also give constructions of sets of binary antipodal spreading sequences for which optimal polynomial-complexity algorithms exist and show that for any sequence length N, we can construct at least N such sequences.

Performance of band-limited baseband synchronous CDMA using orthogonal Independent Component Analysis (ICA) spreading sequences is investigated. The orthogonal ICA sequences have an orthogonality condition in a synchronous CDMA like the Walsh-Hadamard sequences. Furthermore, these have useful correlation properties like the Gold sequences. These sequences are obtained easily by using the ICA which is one of the brain-style signal processing algorithms. In this study, the ICA is used not as a separator for received signal but as a generator of spreading sequences. The performance of the band-limited synchronous CDMA using the orthogonal ICA sequences is compared with the one using the Walsh-Hadamard sequences. For limiting bandwidth, a Root Raised Cosine filter (RRC) is used. We investigate means and variances of correlation outputs after passing the RRC filter and the Bit Error Rates (BERs) of the system in additive white Gaussian noise channel by numerical simulations. It is found that the BER in the band-limited system using the orthogonal ICA sequences is much lower than the one using the Walsh-Hadamard sequences statistically.

In this paper, for odd n and any k with gcd(n, k) = 1, new binary sequence families Sk of period 2n-1 are constructed. These families have maximum correlation $1+2^{n+3\\over 2}$, family size 22n+2n+1 and maximum linear span $n(n+1)\\over 2$. The correlation distribution of Sk is completely determined as well. Compared with the modified Gold codes with the same family size, the proposed families have the same period and correlation properties, but larger linear span. As good candidates with low correlation and large family size, the new families contain the Gold sequences and the Gold-like sequences. Furthermore, Sk includes a subfamily $\\mathcal{S}^k_1$ which has the same period, correlation distribution, family size and linear span as the family So(2) recently constructed by Yu and Gong. In particular, when k=1, $\\mathcal{S}^k_1$ is exactly So(2).

The effects of a noise-like weak signal in the resonant switching of the magnetization driven by spin transfer torque have been systematically studied by means of micromagnetic simulations in both in-plane spin valves and out-of-plane magnetic tunnel junctions. The use of a noise-like resonant excitation allows the overpassing of some critical points compared to the traditional microwave assisted switching. In particular, the application of binary spreading sequences (BSS) does not require the precise knowledge of the resonant frequency and of the optimum relative phase, allowing the use of the same resonant excitation for all the devices in a matrix of memory cells, even if small variations of the physical and geometrical parameters are present. In addition, we also found that in spin valves the switching probabilities close to 100% can be achieved with a smaller current pulse, and in magnetic tunnel junctions a significant energy saving can be obtained.

The transmitter identification of the DTV systems becomes crucial nowadays. Transmitter identification (TxID, or transmitter fingerprinting) technique is used to detect, diagnose and classify the operating status of any radio transmitter of interest. A pseudo random sequence was proposed to be embedded into the DTV signal before transmission. Thus, the transmitter identification can be realized by invoking the cross-correlation functions between the received signal and the possible candidates of the pseudo random sequences. Gold sequences and Kasami sequences are two excellent candidates for the transmitter ID sequences as they provide a large family of nearly-orthogonal codes. In order to investigate the sensitivity of the transmitter identification in different topologies and Kasami sequences with different length, we present the analysis here for four different geometric layouts, namely circular distribution, doubly concentric and circular distribution, square array and hexagonal tessellation. The covered area and the lowest received signal-to-interference ratio are considered as two essential parameters for the multiple-transmitter identification. It turns out to be that the larger the Kasami sequence length, the larger the received signal-to-interference ratio. Our new analysis can be used to determine the required Kasami sequence length for a specific broadcasting coverage.

This paper is devoted to the generation and evaluation of the Chaos-based M-ary spreading sequences on communications systems. Sequences obtained by repeating a truncated and multi-ary quantized chaotic series are compared with classical m-sequences by means of the autocorrelation and cross-correlation properties and power-spectral features. Anti-noise performance of binary sequences and chaotic-based M-ary spreading sequences has been compared in the case of the same single-frequency interferences. Studies have shown that spectral features and anti-noise performance of chaotic-based M-ary spreading sequences which have great researching value are better than binary sequences. DOI: http://dx.doi.org/10.11591/telkomnika.v10i8.1654 Full Text: PDF

In previous works, the performance of DS-UWB (Direct Sequence- Ultra Wide Band) systems in a multiuser scenario with binary pulse amplitude modulation has been studied. In most of these works, independent identically distributed (i.i.d) random sequences have been considered and no optimization of the DS-UWB performance with respect to the choice of spreading sequences has been done. In this paper, we investigate an analysis of multi-user interference (MUI) term in three different families of traditional spreading sequences; i.i.d, Gold and Kasami sequences on Rayleigh and AWGN (additive white gaussian noise) channel. Then, we evaluate the bit error rate (BER) performance of conventional receiver on both channels to confirm the results found about MUI.

The integration and application of a new multi-objective tabu search optimization algorithm for Fluid Structure Interaction (FSI) problems are presented. The aim is to enhance the computational design process for real world applications and to achieve higher performance of the whole system for the four considered objectives. The described system combines the optimizer with a well established FSI solver which is based on the fully implicit, monolithic formuFlation of the problem in the Arbitrary Lagrangian-Eulerian FEM approach. The proposed solver resolves the proposed uid-structure interaction benchmark which describes the self-induced elastic deformation of a beam attached to a cylinder in laminar channel ow. The optimized ow characteristics of the aforementioned geometrical arrangement illustrate the performance of the system in two dimensions. Special emphasis is given to the analysis of the simulation package, which is of high accuracy and is the core of application. The design process identifies the best combination of ow features for optimal system behavior and the most important objectives. In addition, the presented methodology has the potential to run in parallel, which will significantly speed-up the elapsed time. Finite Element Method (FEM), Fluid-Structure Interaction (FSI), Multi-Ojective Tabu search (MOTS2). Copyright © 2013 Tech Science Press.

In this paper, a binary direct-sequence spread-spectrum multiple-access (DS/SSMA) communication system with an additive white Gaussian noise channel and a correlation receiver are considered. The signature sequences are m-sequences or random sequences when the number of users is small and are random sequences, Gold sequences, or Kasami sequences when the number of users is large. Simulation results are obtained to verify a variety of bounds provided in other literature and to compare system performance when employing different signature sequences. >

A genetic algorithm approach to find the best regression/econometric model among the candidates

The Gold sequence family [1] is one of the oldest and most well‐known families of binary sequences with optimal correlation properties. This chapter focuses on the binary Gold sequences and their relatives called Gold‐like sequences. Mathematical representations as well as the family sizes and maximum correlation magnitudes of these sequences are reviewed.

This paper presents results of computer simulation that evaluates the performance of a direct-sequence code division multiple access (DS CDMA) system for three classes of spreading codes namely, Maximal-length, Gold and Kasami sequences. The need to select the optimum spreading code for DS COMA applications is shown from the system capacity and bit-error rate (BER) performance for each of the three types of codes. It is shown that knowledge of the cross-correlation peaks alone is not sufficient to establish which of the codes is better suited for CDMA applications. Hence it is shown that their performances depend on the whole spectrum of their cross-correlation functions rather than their peak values. Additional results of the BER performance of the CDMA system for the three types of spreading codes in frequency-selective multipath fading channel are featured.