# US 2010/0166041 A1 · Communications system employing orthogonal chaotic spreading codes

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2010/0166041 A1
- Document ID: US20100166041A1
- Status: Published application
- Kind: A1
- Application number: 12/344,962
- Filed: 2008-12-29
- Published: 2010-07-01
- Earliest claimed: 2008-12-29
- Assignees: Harris Corporation
- Inventors: Alan J. Michaels; David B. Chester
- Web page: https://patentgrep.com/patent/US20100166041A1

## CPC

- H04J 13/0018: {Chaotic}
- H04J 13/12: Generation of orthogonal codes
- H04L 9/001: {using chaotic signals}
- H04B 1/707: using direct sequence modulation
- H04L 2209/12: Details relating to cryptographic hardware or logic circuitry
- H04L 2209/80: Wireless
- H04J: MULTIPLEX COMMUNICATION (transmission in general H04B; peculiar to transmission of digital information H04L5/00; systems for the simultaneous or sequential transmission of more than one television signal H04N7/08; in exchanges H04Q11/00; stereophonic systems H04S)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04B: TRANSMISSION

## 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.

## Claims

### 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 polynomial equations;
forming a plurality of spread spectrum communications signals respectively using said plurality of orthogonal or statistically orthogonal chaotic spreading codes;
concurrently transmitting said plurality of spread spectrum communication signals over a common RF frequency band.

### Claim 2 (depends on 1)

The method according to claim 1, wherein said generating step further comprises using residue number system (RNS) arithmetic operations to respectively determine a plurality of solutions for each set of polynomial equations, said plurality of solutions iteratively computed and expressed as RNS residue values.

### Claim 3 (depends on 2)

The method according to claim 2, wherein said generating step further comprises determining a series of digits in a weighted number system based on said plurality of RNS residue values.

### Claim 4 (depends on 3)

The method according to claim 3, wherein said generating step further comprises selecting a value for each of N moduli comprising a respective moduli set in an RNS used for respectively solving each said set of polynomial equations.

### Claim 5 (depends on 4)

The method according to claim 4, wherein said moduli set is different for each said set of polynomial equations.

### Claim 6 (depends on 1)

The method according to claim 1, wherein said sets of polynomial equations differ with respect to at least one characteristic selected from the group comprising a constant and a polynomial degree.

### Claim 7 (depends on 1)

The method according to claim 1, wherein said generating step further comprises selecting a plurality of relatively prime numbers to be used as modulus in solving each set of polynomial equations.

### Claim 8 (depends on 1)

The method according to claim 1, further comprising:
receiving said plurality of spread spectrum communications signals at a receiver;
generating at least one chaotic de-spreading code; and
de-spreading at least one of said spread spectrum communication signals using said chaotic de-spreading code.

### Claim 9 (depends on 1)

The method according to claim 1, further comprising:
receiving said plurality of spread spectrum communications signals at a receiver;
generating a plurality of chaotic de-spreading codes; and
de-spreading a plurality of said spread spectrum communication signals using said plurality of chaotic de-spreading codes.

### Claim 10 (depends on 9)

The method according to claim 9, further comprising synchronizing said at least one of said plurality of chaotic de-spreading codes in time and frequency with at least one of said plurality of chaotic spreading codes.

### Claim 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 polynomial equations;
selecting a different moduli sets for each set of 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.

### Claim 12 (depends on 11)

The method according to claim 11, wherein said plurality of solutions are iteratively computed and expressed as RNS residue values.

### Claim 13 (depends on 12)

The method according to claim 12, wherein said generating step further comprises determining a series of digits in a weighted number system based on said plurality of RNS residue values.

### Claim 14 (depends on 11)

The method according to claim 11, wherein said sets of polynomial equations differ with respect to at least one characteristic selected from the group comprising a constant and a polynomial degree.

### Claim 15 (depends on 11)

The method according to claim 11, further comprising:
receiving said plurality of spread spectrum communications signals at a receiver;
generating at least one chaotic de-spreading code; and
de-spreading at least one of said spread spectrum communication signals using said chaotic de-spreading code.

### Claim 16 (depends on 11)

The method according to claim 11, further comprising:
receiving said plurality of spread spectrum communications signals at a receiver;
generating a plurality of chaotic de-spreading codes; and
de-spreading a plurality of said spread spectrum communication signals using said plurality of chaotic de-spreading codes.

### Claim 17 (depends on 16)

The method according to claim 16, further comprising synchronizing said at least one of said plurality of chaotic de-spreading codes in time and frequency with at least one of said plurality of chaotic spreading codes.

### Claim 18

A code-division multiplex communications system, comprising:
a plurality of transmitters configured for (a) generating a plurality of orthogonal or statistically orthogonal chaotic spreading codes respectively using a plurality of different sets of polynomial equations, (b) forming a plurality of spread spectrum communications signals respectively using said plurality of orthogonal or statistically orthogonal chaotic spreading codes, and (c) concurrently transmitting said plurality of spread spectrum communication signals over a common RF frequency band.

### Claim 19 (depends on 18)

The code-division multiplex communications system according to claim 18, wherein each transmitter of said plurality of transmitters is further configured for generating a spreading code of said plurality of orthogonal or statistically orthogonal chaotic spreading codes using residue number system (RNS) arithmetic operations to respectively determine a plurality of solutions for a respective one of said plurality of different sets of polynomial equations, said plurality of solutions iteratively computed and expressed as RNS residue values.

### Claim 20 (depends on 19)

The code-division multiplex communications system according to claim 19, wherein each transmitter of said plurality of transmitters is further configured for generating a spreading code of said plurality of orthogonal or statistically orthogonal chaotic spreading codes by determining a series of digits in a weighted number system based on said plurality of RNS residue values.

### Claim 21 (depends on 20)

The code-division multiplex communications system according to claim 20, wherein each transmitter of said plurality of transmitters is further configured for generating a spreading code of said plurality of orthogonal or statistically orthogonal chaotic spreading codes by selecting a value for each of N moduli comprising a respective moduli set in an RNS used for respectively solving each said set of polynomial equations.

### Claim 22 (depends on 21)

The code-division multiplex communications system according to claim 21, wherein said moduli set is different for each said set of polynomial equations.

### Claim 23 (depends on 18)

The code-division multiplex communications system according to claim 18, wherein said sets of polynomial equations differ with respect to at least one characteristic selected from the group comprising a constant and a degree.

### Claim 24 (depends on 18)

The code-division multiplex communications system according to claim 18, wherein each transmitter of said plurality of transmitters is further configured for generating a spreading code of said plurality of orthogonal or statistically orthogonal chaotic spreading codes by selecting a plurality of relatively prime numbers to be used as modulus in solving each set of polynomial equations.

### Claim 25 (depends on 18)

The method according to claim 18, further comprising:
receiving said plurality of spread spectrum communications signals at a receiver;
generating a plurality of chaotic de-spreading codes; and
de-spreading a plurality of said spread spectrum communication signals using said plurality of chaotic de-spreading codes;
wherein said at least one of said plurality of chaotic de-spreading codes is synchronized in time and frequency with at least one of said plurality of chaotic spreading codes.
