Algebraic generators of sequences for communication signals

• US 9,813,181 B2
• Filed: 06/30/2016
• Issued: 11/07/2017
• Est. Priority Date: 12/01/2011
• Status: Active Grant

• Current Assignee: Optimark, LLC
• Original Assignee: Optimark, LLC
• Inventors: Moreno De Ayala, Oscar, Tirkel, Anatol Zygmunt
• Primary Examiner(s): PANCHOLI, RINA C
• Application Number:
  US15/197,872
• Publication Number:
  US 20170099117A1
• Time in Patent Office: 495 Days
• Field of Search: None
• CPC Class Codes: H04B 1/707 using direct sequence modulation
• CPC Class Codes: H04B 1/7136 Arrangements for generation of hop frequencies, e.g. using a bank of frequency sources, using continuous tuning or using a transform
• CPC Class Codes: H04J 11/00 Orthogonal multiplex systems, e.g. using WALSH codesH04J13/00 takes precedence
• CPC Class Codes: H04J 13/12 Generation of orthogonal codes
• CPC Class Codes: H04J 13/14 Generation of codes with a zero correlation zone
• CPC Class Codes: H04L 7/043 Pseudo-noise [PN] codes variable during transmission synchronisation of spread spectrum receivers H04B1/69

Abstract

A device for modulating communication signals comprises a transceiver for receiving and transmitting the signal, a storage medium storing computer implemented programme code components to generate sequences and a processor in communication with the storage medium and transceiver. The processor executes computer implemented programme code components to generate a family of shift sequences or arrays using exponential, logarithmic or index functions and a polynomial or a rational function polynomial in iε_p−1 for a finite field _p of prime p. Multiple columns of the arrays are substituted with pseudo-noise sequences or other suitable good correlation sequences in a cyclic shift equal to the shift sequence for the respective column to generate a substituted array. The substituted array, or a sequence unfolded using the CRT from the array when the array dimensions are relatively prime, is applied to a carrier wave of the communication signal to generate a modulated communication signal.

Claims

1. A method of modulating a communication signal including:

generating a family of shift sequences having lengths relatively prime using exponential, logarithmic or index functions and a polynomial or a rational function polynomial in iε

<sub>p−

1</sub> for a finite field _p of prime p;

substituting multiple columns of arrays having a relatively prime size with pseudo-noise sequences in a cyclic shift equal to the shift sequence for the respective column of the arrays to generate a substituted array;

unfolding sequences from the arrays using Chinese Remainder Theorem; and

applying the unfolded sequences to a carrier wave of the communication signal to generate a phase modulated communication signal;

wherein the family of shift sequences includes at least one of;

a (p−

1) ×

p array having (p−

1) columns each of length p;

a p×

(p−

1) array with p columns, each of length (p−

1) where the index function is used;

a p×

(p+1) array with p columns, each of length (p+1);

the family of shift sequences using a quadratic exponential map of Construction A1 or A2;

or

the family of shift sequences using a quadratic discrete logarithm map as an inverse of Construction A1 or A2.

2. The method of claim 1 wherein a shift sequence of the family has the form:

s_i=Ag²ⁱ+Bgⁱ+C where g is a primitive root (generator) of Z_p and i ranges from 1 to p−

1′

where A, B, C are elements of the base field Z_p.

3. The method of claim 1, wherein the step of generating the family of shift sequences includes one of the following:

using full cycles generated by a rational function map, producing p ×

(p +1) arrays with p columns, each of length (p+1), wherein the rational function map is the Family B rational function map;

using known frequency hopping patterns, time hopping patterns or optical orthogonal codes;

transforming known CDMA families into shift sequences, wherein the known CDMA families are one of the following;

small Kasami sequences;

large Kasami sequences;

No-Kumar sequences.

4. The method of claim 1, wherein the pseudo-noise sequence is over any alphabet and can be one of the following:

a binary or almost binary Legendre sequence;

a ternary or polyphase Legendre sequence;

a binary or polyphase m-sequence;

a GMW sequence;

a twin prime sequence;

a Hall sequence;

a Sidelnikov sequence;

another low off-peak auto-correlation sequence.

5. The method of claim 1, wherein the substituted array is in the form of, or used for the modulation of one of the following:

a bi-phase array for modulation of a CDMA signal;

a multi-target tracking radar signal;

a multi-target tracking sonar signal;

an ultrasound signal;

an optical orthogonal code array for modulation of an optical CDMA signal.

6. The method of claim 1, including substituting at least one column of the arrays with a constant column such that the substituted array is balanced and has symmetric auto-correlation values, optionally including substituting blank columns in the shift sequence to balance a CDMA sequence.

7. The method of claim 1, including substituting multiple rows of the arrays with an array comprising a maximum of one dot per row.

8. The method of claim 1, including constructing groups of families of sequences or arrays by applying invariance operations to parent arrays and unfolding the parent or the transformed arrays using the Chinese Remainder Theorem.

9. The method of claim 8, including assigning different groups of users different families of sequences or arrays.

10. The method of claim 1, wherein the shift sequences are used in their own right for one of the following:

frequency hopping patterns;

time hopping patterns;

optical orthogonal codes;

sonar sequences.

11. The method of claim 1 including increasing linear complexity by using a shift sequence and a column sequence in composition, optionally including unfolding the composition into a long sequence using the Chinese Remainder Theorem, so that the resulting multidimensional array can be used in image, audio, video or multimedia watermarking.

12. The method of claim 1 including generating a family of multidimensional arrays using a composition of a family of shift sequences or frequency hop patterns and a column sequence and modulating the phase of a multiplicity of orthogonal carriers and optionally dual polarization.

13. The method of claim 1, wherein the unfolded sequences are used as one of the following:

an error correcting code;

a cryptographic code.

14. The method of claim 1 including converting a column solitary sequence with low off-peak autocorrelation into a family of longer sequences or arrays with low off-peak autocorrelation and cross-correlation.

15. The method of claim 1 including unfolding a solitary array from Construction A1 or A2 using a degree one polynomial using Chinese Remainder Theorem, and substituting rows in a larger array used to produce Family B with commensurate row length with the unfolded solitary array, resulting in a family of even larger arrays with good correlation and high linear complexity.

16. The method of claim 15, wherein the substitution is performed as a cascade or the process is performed recursively.

17. The method of claim 1, wherein the family of sequences produced by using the shift sequence to construct arrays which are then unfolded using Chinese Remainder Theorem has a linear complexity greater than 45% of the sequence length, regardless of the sequence length.

18. The method of claim 1, wherein the shift sequence is obtained from an m-sequence, and the substitution column is a ternary or other non-binary pseudo-noise sequence, resulting in a new long pseudo-noise sequence obtained by Chinese Remainder Theorem from the array.

19. The method of claim 1, wherein a family of shift sequences is obtained by a combination of trace map and discrete logarithm from a singly or doubly periodic shift sequence produced by an m-sequence.

20. The method of claim 19, where the family thus produced is the small Kasami set, or the No-Kumar set.

21. A device for modulating a communication signal, the device comprising:

a transceiver for receiving and transmitting the signal;

a storage medium storing computer implemented programme code components to generate sequences; and

a processor in communication with the storage medium and the transceiver to execute at least some of the computer implemented programme code components to cause;

generating a family of shift sequences or arrays using exponential, logarithmic or index functions and a polynomial or a rational function polynomial in i ε

<sub>p−

1</sub> for a finite field _p of prime p;

substituting multiple columns of the arrays with pseudo-noise sequences in a cyclic shift equal to the shift sequence for the respective column to generate a substituted array; and

applying the substituted array, or a sequence unfolded from the array when the array dimensions are relatively prime, to a carrier wave of the communication signal to generate a modulated communication signal.

22. A device for modulating a communication signal, the device comprising:

a transceiver for receiving and transmitting the signal;

a storage medium storing computer implemented programme code components to generate sequences; and

a processor in communication with the storage medium and the transceiver to execute at least some of the computer implemented programme code components to cause;

generating a family of shift sequences having lengths relatively prime using exponential, logarithmic or index functions and a polynomial or a rational function polynomial in i ε

<sub>p−

1</sub> for a finite field _p of prime p;

substituting multiple columns of arrays having a relatively prime size with pseudo-noise sequences in a cyclic shift equal to the shift sequence for the respective column of the arrays to generate a substituted array;

unfolding sequences from the arrays using Chinese Remainder Theorem;

applying the unfolded sequences to a carrier wave of the communication signal to generate a phase modulated communication signal;

wherein the family of shift sequences includes at least one of;

a (p−

1) ×

p array having (p−

1) columns each of length p;

a p×

(p−

1) array with p columns, each of length (p−

1) where the index function is used;

a p×

(p+1) array with p columns, each of length (p+1);

the family of shift sequences using a quadratic exponential map of Construction A1 or A2;

or

the family of shift sequences using a quadratic discrete logarithm map as an inverse of Construction A1 or A2.