New Optimal Low Correlation Sequences for Wireless Communications

  title={New Optimal Low Correlation Sequences for Wireless Communications},
  author={Oscar Moreno and Andrew Z. Tirkel},
This paper presents three new sets of frequency hopping sequences, which are converted into sequences for CDMA. One of the CDMA sequence families is optimal with respect to the Welch bound, and two are nearly optimal. Our sequences are available for more lengths, and have much higher linear complexity than other CDMA sequences. They have a similar structure to the small Kasami set, but are balanced. The CDMA sequences are constructed using a composition method, which combines new shift… 

Large families of sequences for CDMA, frequency hopping, and UWB

This paper generalizes three constructions of families of sequences with bounded off peak correlation with application to Code Division Multiple Access, frequency hopping, and Ultra Wide Band and shows that the generalized Kamaletdinov I construction offers the lowest off-peak correlation for a given family size.

Secure CDMA and Frequency Hop Sequences

A new method is presented for constructing CDMA sequence sets with the linear complexity of the Legendre sequences, from new frequency hop patterns, the first families whose normalized linear complexities do not asymptote to 0, verified for lengths up to 6×108.

Secure CDMA Sequences

These are the first families whose normalized linear complexities do not asymptote to 0, verified for lengths up to 6x108.

Ensembles of optimal binary sequences of length 22n

This work aims to develop a systematic method for constructing ensembles of sequences with optimal correlation with arbitrary period, of fundamental importance in information theory, with wide-ranging applications to wireless communications, navigation, radar, digital watermarking, and related fields.

Binary sequences and their applications

  • Computer Science
  • 2020
This project focuses on a technique for the algebraic construction of sequences where a sequence of shifts and a sequence with good properties generate a new sequence, and develops software intended to provide support to a designer in the search of said sequences and check their properties.

Families of 3D Arrays for Video Watermarking

New constructions of families of binary and ternary arrays with low off-peak (periodic) autocorrelation and low cross-correlation for application to video watermarking are presented.

Ensembles of sequences and arrays

  • A. LeukhinA. Tirkel
  • Computer Science
    2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)
  • 2015
A unified construction of periodic binary sequences with low off-peak autocorrelation and cross-correlation using linear feedback shift registers is presented.

Arrays composed from the extended rational cycle

A unified method of obtaining multivariate recursion polynomials and their footprints for all finite multidimensional arrays and shows that the size of the footprint is invariant under dimensional transformations based on the Chinese Remainder Theorem.

k-Error linear complexity for multidimensional arrays

This paper makes computations for some typical families of multidimensional arrays to confirm that they have a large $k$-error linear complexity for small $k$.

Multidimensional arrays with maximal linear complexity

The study of multidimensional arrays provides new ways to understand sequences and set the basis for forthcoming proof of the three years old conjectures related with CDMA sequences.



Maximum periodic correlation of pseudo-random sequences in CDMA

  • M. StularS. Tomažič
  • Computer Science
    2000 10th Mediterranean Electrotechnical Conference. Information Technology and Electrotechnology for the Mediterranean Countries. Proceedings. MeleCon 2000 (Cat. No.00CH37099)
  • 2000
The article presents the comparison of the Welch, modified Welch, Sarwate and Sidelnikov lower bounds on the correlation of CDMA codes. It is shown that the modified Welch bound is the best general

Crosscorrelation properties of pseudorandom and related sequences

This paper presents a survey of recent results and provides several new results on the periodic and aperiodic crosscorrelation functions for pairs of m-sequences and for Pair of related (but not maximal-length) binary shift register sequences.

Lower bounds on the maximum periodic and aperiodic correlation of signal sets with arbitrary ener

The Welch lower bound is generalized here to allow for arbitrary signal energy for each member of the signal set, with a view towards considering the application of CDMA to QAM signals.

Pseudo-random sequences and arrays

A simple description of pseudo-random sequences, or maximal-length shift-register sequences, and two-dimensional arrays of area n = 2lm- 1 with the same property.

Theory of Error-correcting Codes

This course expounds the principles of coded modulations for the Gaussian channel and, if time permits, for Rician and Rayleigh fading channels (fully interleaved), and reminds students of the basics of the theory of linear codes for conventional memoryless ergodic channels.

Decomposition of M-sequences and its applications

The properties and structures of the m -sequence and its subsequences are studied under decomposition and a method for designing cyclic codes with desirable weights is suggested.

Constructions and properties of Costas arrays

A Costas array is an n × n array of dots and blanks with exactly one dot in each row and column, and with distinct vector differences between all pairs of dots. As a frequency-hop pattern for radar

Multi-dimensional arrays for watermarking

  • O. MorenoA. Tirkel
  • Computer Science
    2011 IEEE International Symposium on Information Theory Proceedings
  • 2011
This paper presents two new classes of families of multi-periodic arrays suitable for digital watermarking, large and all arrays have good auto and cross-correlation, and are available in many sizes.

Crosscorrelation of M-sequences and GMW-sequences with the same primitive polynomial

  • R. Games
  • Computer Science
    Discret. Appl. Math.
  • 1985

Generalized Kasami Sequences: The Large Set

New binary sequence families F F k of period 2<sup>n</sup>-1 are constructed for even n and any k with gcd(k,n)=2 if n/2 is odd or gcd (k, n)=1 if n /2 is even.