# US 2017/0288726 A1 · Methods and systems for spread spectrum communications

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

- Number: US 2017/0288726 A1
- Document ID: US20170288726A1
- Status: Published application
- Kind: A1
- Application number: 15/508,287
- Filed: 2015-09-01
- Published: 2017-10-05
- Earliest claimed: 2014-09-02
- Assignees: Socovar, Societe en Commandite
- Applicants: Socovar Societe En Commandite
- Inventors: GEORGES KADDOUM; YOGESH ANIL NIJSURE; FAROUK ABDELLATIF AHMED MOHAMMED
- Web page: https://patentgrep.com/patent/US20170288726A1

## CPC

- H04B 1/707: using direct sequence modulation
- H04B: TRANSMISSION

## Abstract

Wireless communications have become ubiquitous for society with the availability of low cost front end transmitter and receiver circuits. Network operators strive to provide wireless signals with good Signal to Noise and Interference Ratio (SNIR) whilst increasing useable network capacity and bandwidth using maximum over-the-air data rate and controlling or minimizing over-the-air congestion. Historically this has been achieved via evolutions of network and consumer hardware, firmware, software and hence it would be beneficial to provide network operators with a means of increasing network capacity without requiring either additional hardware complexity and/or additional computational complexity in the receiving devices. The inventor has established a new domain within the network, the spreading code domain, to increase the data rate, by using spreading codes to map the data in conjunction with the constellation symbols and reduce the amount of transmitted data required.

## Claims

### Claim 1 (depends on 18)

The method according to claim 18, further comprising:
receiving a block of Nb bits to be transmitted;
mapping (Nb−n) bits of the block of Nb bits against a selected code of a set of 2(Nb−n) spreading codes where n is the number of bits that will be modulated and transmitted;
transmitting the n bits by using M-digital modulation and spreading the resultant symbols representing the n bits using the selected code of the set of 2(Nb−n) spreading codes.

### Claim 2 (depends on 1)

The method according to claim 1, wherein
the mapping of data to a selected code of the set of spreading codes results in the transmission of the selected code without modulation as n=0 and all bits within the data are mapped to the selected code of the set of spreading codes.

### Claim 3 (depends on 1)

The method according to claim 1, wherein
the selected code of the set of spreading codes employed for transmitting the bit of information is selected in dependence upon the mapping of the bit of information to the set of spreading codes.

### Claim 4 (depends on 1)

The method according to claim 1, wherein
the number spreading codes within the set of spreading codes is 2(Nb−n).

### Claim 5 (depends on 1)

The method according to claim 1, wherein
Nb=4 and n=2.

### Claim 6 (depends on 19)

The method according to claim 19, further comprising:
receiving a bit of data over the wireless communications network;
determining a predetermined code of a plurality of codes in dependence upon the received bit;
associating a value to a first decoded symbol based upon the predetermined code of the plurality of codes;
determining a plurality of decoded bits in dependence upon the predetermined code of the plurality of codes and the received bit.

### Claim 7 (depends on 6)

The method according to claim 6, wherein the plurality of codes relate to spread-spectrum communication codes.

### Claim 8 (depends on 6)

The method according to claim 6, wherein
the plurality of codes all relate to a spread spectrum communications protocol, the spread spectrum communications protocol selected from the group comprising code modulation spread spectrum, frequency hopping spread spectrum, direct sequence spread spectrum and chirp spread spectrum.

### Claim 9 (depends on 19)

The method according to claim 19, further comprising:
receiving n bits of data over the wireless communications network;
determining a predetermined code of a plurality of codes in dependence upon the most powerful correlator output of a set of 2(Nb−n) different correlators, wherein Nb bits were received for transmission but only n bits were physically transmitted;
demodulating the selected most powerful correlator output to decode the transmitted symbol;
determining the values of (Nb−n) bits in dependence upon the predetermined code of the plurality of codes.

### Claim 10 (depends on 9)

The method according to claim 9, wherein
(Nb−n) represents the number of bits within a block of data to be mapped by the selected spread spectrum code and n is the number of bits that will be transmitted;

### Claim 11 (depends on 9)

The method according to claim 9, wherein
the plurality of codes relate to spread spectrum communication codes.

### Claim 12 (depends on 9)

The method according to claim 9, wherein
the plurality of codes all relate to a spread spectrum communications protocol, the spread spectrum communications protocol selected from the group comprising code modulation spread spectrum, frequency hopping spread spectrum, direct sequence spread spectrum and chirp spread spectrum.

### Claim 13 (depends on 19)

The method according to claim 19, further comprising:
receiving a spread symbol data over the wireless communications network;
determining a predetermined code of a plurality of codes in dependence upon the received spread symbol data;
associating a value to a first decoded symbol based upon the outputs of a plurality of de-spreading circuits, each de-spreading circuit de-spreading a predetermined code of the plurality of codes;
determining the values of a plurality of bits of data in dependence upon the first decoded symbol and a de-spreading circuit of the plurality of de-spreading circuits meeting a predetermined condition.

### Claim 14 (depends on 13)

The method according to claim 13, wherein
the predetermined condition is the output of that de-spreading circuit of the plurality of de-spreading circuits is higher than the other outputs.

### Claim 15 (depends on 18)

The method according to claim 18, further comprising:
receiving a pair of bits to be transmitted;
selecting a predetermined code of a plurality of codes in dependence upon the value of Nb−n) bits spreading the symbol with n bits to be transmitted using the predetermined code.

### Claim 16 (depends on 19)

The method according to claim 19, further comprising:
receiving a bit of data over the wireless communications network;
determining a predetermined code of a plurality of codes in dependence upon the most powerful correlator output of a set of 2(Nb−n) different correlators, where Nb bits were received for transmission but only n bits were actually transmitted;
demodulating the selected most powerful correlator output to decode the transmitted symbol;
determining the values of (Nb−n) bits in dependence upon the predetermined code of the plurality of codes.

### Claim 17 (depends on 19)

The method according to claim 19, further comprising:
receiving spread symbol data over the wireless communications network;
determining a predetermined code of a plurality of codes in dependence upon the received spread symbol data;
associating a value to a first decoded symbol based upon the outputs of a plurality of de-spreading circuits, each de-spreading circuit de-spreading a predetermined code of the plurality of codes;
determining the values of a plurality of bits of data in dependence upon the first decoded symbol and a de-spreading circuit of the plurality of de-spreading circuits meeting a predetermined condition.

### Claim 18

A method for transmitting data within a wireless communications network with increased efficiency.

### Claim 19

A method of receiving data within a wireless communications network with increased efficiency.
