Communications system employing orthogonal chaotic spreading codes
First Claim
1. A method for code-division multiplex communications, comprising:
- generating each of a plurality of orthogonal or statistically orthogonal chaotic spreading codes using a respective one of a plurality of different sets of modular polynomial equations of a third order or higher, where at least two polynomial equations of each of said plurality of different sets of modular polynomial equations differ with respect to polynomial degree; and
where a statistically expected value of an inner product of each said plurality of orthogonal or statistically orthogonal chaotic spreading codes is zero;
forming a plurality of spread spectrum communications signals respectively using said plurality of orthogonal or statistically orthogonal chaotic spreading codes; and
concurrently transmitting said plurality of spread spectrum communication signals over a common RF frequency band.
1 Assignment
0 Petitions
Accused Products
Abstract
Methods for code-division multiplex communications. The methods involve generating orthogonal or statistically orthogonal chaotic spreading codes (CSC1, . . . , CSCK) using different sets of polynomial equations (f0(x(nT)), . . . , fN-1(x(nT))), different constant values (C0, C1, . . . , CN-1) for the polynomial equations, or different sets of relatively prime numbers (p0, p1, . . . , pN-1) as modulus (m0, m1, . . . , mN-1) in solving the polynomial equations. The methods also involve forming spread spectrum communications signals using the orthogonal or statistically orthogonal chaotic spreading codes, respectively. The method further involve concurrently transmitting the spread spectrum communications signals over a common RF frequency band.
215 Citations
25 Claims
-
1. A method for code-division multiplex communications, comprising:
-
generating each of a plurality of orthogonal or statistically orthogonal chaotic spreading codes using a respective one of a plurality of different sets of modular polynomial equations of a third order or higher, where at least two polynomial equations of each of said plurality of different sets of modular polynomial equations differ with respect to polynomial degree; and
where a statistically expected value of an inner product of each said plurality of orthogonal or statistically orthogonal chaotic spreading codes is zero;forming a plurality of spread spectrum communications signals respectively using said plurality of orthogonal or statistically orthogonal chaotic spreading codes; and concurrently transmitting said plurality of spread spectrum communication signals over a common RF frequency band. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A method for code-division multiplex communications, comprising:
-
generating a plurality of orthogonal or statistically orthogonal chaotic spreading codes using residue number system (RNS) arithmetic operations to respectively determine a plurality of solutions for each of a respective one of a plurality of sets of modular polynomial equations of a third order or higher, where at least two polynomial equations of each of said plurality of sets of modular polynomial equations differ with respect to polynomial degree; and
where a statistically expected value of an inner product of each said plurality of orthogonal or statistically orthogonal chaotic spreading codes is zero;selecting a different moduli sets for each set of modular polynomial equations, each moduli set comprising a value for each of N moduli in said RNS used for determining said plurality of solutions; forming a plurality of spread spectrum communications signals respectively using said plurality of orthogonal or statistically orthogonal chaotic spreading codes; and concurrently transmitting said plurality of spread spectrum communication signals over a common RF frequency band. - View Dependent Claims (12, 13, 14, 15, 16, 17)
-
-
18. A code-division multiplex communications system, comprising:
a plurality of transmitters configured to (a) generate a plurality of orthogonal or statistically orthogonal chaotic spreading codes respectively using a plurality of different sets of modular polynomial equations of a third order or higher, where at least two polynomial equations of each of said plurality of different sets of modular polynomial equations differ with respect to polynomial degree, and where a statistically expected value of an inner product of each said plurality of orthogonal or statistically orthogonal chaotic spreading codes is zero; (b) form a plurality of spread spectrum communications signals respectively using said plurality of orthogonal or statistically orthogonal chaotic spreading codes, and (c) concurrently transmit said plurality of spread spectrum communication signals over a common RF frequency band. - View Dependent Claims (19, 20, 21, 22, 23, 24, 25)
Specification