Search

A new class of pseudonoise even balanced (PN-EB) binary spreading sequences is derived from existing classical odd-length families of maximum-length sequences, such as those proposed by Gold, by appending or inserting one extra-zero element (chip) to the original sequences. The incentive to generate large families of PN-EB spreading sequences is motivated by analyzing the spreading effect of these sequences from a natural sampling point of view. From this analysis a new definition for PG is established, from which it becomes clear that very high processing gains (PGs) can be achieved in band-limited direct-sequence spread-spectrum (DSSS) applications by using spreading sequences with zero mean, given that certain conditions regarding spectral aliasing are met. To obtain large families of even balanced (i.e., equal number of ones and zeros) sequences, two design criteria are proposed, namely the ranging criterion (RC) and the generating ranging criterion (GRC). PN-EB sequences in the polynomial range are derived using these criteria, and it is shown that they exhibit secondary autocorrelation and cross-correlation peaks comparable to the sequences they are derived from. The methods proposed not only facilitate the generation of large numbers of new PN-EB spreading sequences required for CDMA applications, but simultaneously offer high processing gains and good despreading characteristics in multiuser SS scenarios with band-limited noise and interference spectra. Simulation results are presented to confirm the respective claims made.

In this paper we introduce new discrete-time derivative concepts based on the bilinear (Tustin) transformation. From the new formulation, we obtain derivatives that exhibit a high degree of similarity with the continuous-time Grünwald-Letnikov derivatives. Their properties are described highlighting one important feature, namely that such derivatives have always long memory., (© 2020 The Authors. Published by Elsevier B.V. on behalf of Cairo University.)

A study of non-commensurate fractional linear system is done in a parallel way to the commensurate case. A partial fraction decomposition is accomplished using a recursive procedure. Each partial fraction is inverted in two different ways. The decomposition integer/fractional is done also. Some examples are presented., (© 2020 The Authors. Published by Elsevier B.V. on behalf of Cairo University.)