Method to gain access to a base station in a discrete multitone spread spectrum communications system

Claim 2

A highly bandwidth-efficient communications method, comprising: receiving at a base station during a first time period a first spread signal from a first remote unit comprising a first common access channel data signal spread over a first plurality of discrete tones in accordance with a first spreading code assigned to at least the first and a second remote units; receiving at the base station during the first time period a second spread signal from the second remote unit comprising a second common access channel data signal spread over the first plurality of discrete tones in accordance with the first spreading code; said discrete tones being sampled, digitized, passed through a fast Fourier transform (FFT) processor, and stored in FFT incremental frequency bins as complex numbers which represent points in a OAM modulation constellation which are related to an average amount of energy of the discrete tones; adaptively despreading the first spread signal and the second spread signal received at the base station by using first despreading codes that are based on characteristics of the received first and second spread signals; determining at the base station that a collision has occurred between the first and second spread signals; transmitting from the base station a notice of the collision to the first and second remote units said base station using said complex numbers to prepare said notice of the collision; and said base station distinguishing the collision from a noise burst by using said complex numbers.

Claim 3

The highly bandwidth-efficient communications method of claim 1, which further comprises: said first and second spread signals are discrete tones received by the base station from the first and second remote units during a reverse interval of a time division duplex period.

Claim 4

The highly bandwidth-efficient communications method of claim 2, which further comprises: said discrete tones are modulated with an access request by the first and second remote units using a 16 QAM modulation scheme.

Claim 5

A highly bandwidth-efficient communications method, comprising: receiving at a base station during a first time period a first spread signal from a first remote unit comprising a first common access channel data signal spread over a first plurality of discrete tones in accordance with a first spreading code assigned to at least the first and a second remote units; receiving at the base station during the first time period a second spread signal from the second remote unit comprising a second common access channel data signal spread over the first plurality of discrete tones in accordance with the first spreading code; adaptively despreading the first spread signal and the second spread signal received at the base station by using first despreading codes that are based on characteristics of the received first and second spread signals; determining at the base station that a collision has occurred between the first and second spread signals; transmitting from the base station a notice of the collision to the first and second remote units; said first and second spread signals discrete tones received by the base station from the first and second remote units during a reverse interval of a time division duplex period; said discrete tones modulated by the first and second remote units using a QAM modulation scheme; said discrete tones sampled, digitized, passed through a fast Fourier transform (FFT) processor, and stored in FFT incremental frequency bins as complex numbers which represent points in a QAM modulation constellation which are related to an average amount of energy of the discrete tone; said base station using said complex numbers to prepare said notice of the collision; and said base station distinguishing the collision from a noise burst by using said complex numbers.

Claim 6

A highly bandwidth-efficient communications method, comprising: receiving at a base station during a first time period a first spread signal from a first remote unit comprising a first common access channel data signal spread over a first plurality of discrete tones in accordance with a first spreading code assigned to at least the first and a second remote units; receiving at the base station during the first time period a second spread signal from the second remote unit comprising a second common access channel data signal spread over the first plurality of discrete tones in accordance with the first spreading code; adaptively despreading the first spread signal and the second spread signal received at the base station by using first despreading codes that are based on characteristics of the received first and second spread signals; determining at the base station that a collision has occurred between the first and second spread signals; transmitting from the base station a notice of the collision to the first and second remote units; said first and second spread signals discrete tones received by the base station from the first and second remote units during a reverse interval of a time division duplex period; said discrete tones modulated by the first and second remote units using a QAM modulation scheme; said discrete tones sampled, digitized, passed through a fast Fourier transform (FFT) processor, and stored in FFT incremental frequency bins as complex numbers which represent points in a QAM modulation constellation which are related to an average amount of energy of the discrete tone; said base station using said complex numbers to prepare said notice of the collision; and said base station distinguishing the collision from a noise burst by using said complex numbers.

Claim 7

The highly bandwidth-efficient communications method of claim 1, which further comprises: said first remote unit and said second remote unit receiving said notice and in response thereto, beginning a first type back-off and retry process to avoid a second collision.

Claim 8

The highly bandwidth-efficient communications method of claim 5, which further comprises: said first remote unit and said second remote unit failing to receive said notice and in response thereto, beginning a second type back-off and retry process to minimize effects of noise bursts.

Claim 9

A highly bandwidth-efficient communications method, comprising: receiving at a base station during a first time period a first spread signal from a first remote unit comprising a first common access channel data signal spread over a first plurality of discrete tones in accordance with a first spreading code assigned to at least the first and a second remote units; receiving at the base station during the first time period a noise burst signal comprising that at least partially interferes with the first plurality of discrete tones; said discrete tones being sampled, digitized, passed through a fast Fourier transform (FFT) processor, and stored in FFT incremental frequency bins as complex numbers which represent points in a OAM modulation constellation which are related to an average amount of energy of the discrete tones; adaptively despreading the first spread signal and processing the noise burst signal received at the base station by using first despreading codes that are based on characteristics of the first spread signal; determining at the base station that a noise burst has occurred while receiving the first spread signal; transmitting from the base station a notice of the noise burst to the first remote unit; said base station using said complex numbers to prepare said notice of the noise burst; and said base station distinguishing the noise burst from collisions with spread signals from other remote units by using said complex numbers.

Claim 10

A highly bandwidth-efficient communications method, comprising: receiving at a base station during a first time period a first spread signal from a first remote unit comprising a first common access channel data signal spread over a first plurality of discrete tones in accordance with a first spreading code assigned to at least the first and a second remote units; receiving at the base station during the first time period a noise burst signal comprising that at least partially interferes with the first plurality of discrete tones; said discrete tones being sampled, digitized, passed through a fast Fourier transform (FFT) processor, and stored in FFT incremental frequency bins as complex numbers which represent points in a OAM modulation constellation which are related to an average amount of energy of the discrete tones; adaptively despreading the first spread signal and processing the noise burst signal received at the base station by using first despreading codes that are based on characteristics of the first spread signal; determining at the base station that a noise burst has occurred while receiving the first spread signal; transmitting from the base station a notice of the noise burst to the first remote unit; said base station using said complex numbers to prepare said notice of the noise burst; and said base station distinguishing the noise burst from collisions with spread signals from other remote units by using said complex numbers.

Claim 11

The highly bandwidth-efficient communications method of claim 7, which further comprises: said first spread signal is discrete tones received by the base station from the first remote unit during a reverse interval of a time division duplex period.

Claim 12

The highly bandwidth-efficient communications method of claim 8, which further comprises: said discrete tones are modulated with an access request by the first remote unit using a 16 QAM modulation scheme.

Claim 13

A highly bandwidth-efficient communications method, comprising: receiving at a base station during a first time period a first spread signal from a first remote unit comprising a first common access channel data signal spread over a first plurality of discrete tones in accordance with a first spreading code assigned to at least the first and a second remote units; receiving at the base station during the first time period a noise burst signal comprising that at least partially interferes with the first plurality of discrete tones; adaptively despreading the first spread signal and processing the noise burst signal received at the base station by using first despreading codes that are based on characteristics of the first spread signal; determining at the base station that a noise burst has occurred while receiving the first spread signal; transmitting from the base station a notice of the noise burst to the first remote unit; said first spread signal discrete tones received by the base station from the first remote unit during a reverse interval of a time division duplex period; said discrete tones modulated with an access request by the first remote unit using a QAM modulation scheme; said discrete tones sampled, digitized, passed through a fast Fourier transform (FFT) processor, and stored in FFT incremental frequency bins as complex numbers which represent points in a QAM modulation constellation which are related to an average amount of energy of the discrete tones; said base station using said complex numbers to prepare said notice of the noise burst; and said base station distinguishing the noise burst from collisions with spread signals from other remote units by using said complex numbers.

Claim 14

A highly bandwidth-efficient communications method, comprising: receiving at a base station during a first time period a first spread signal from a first remote unit comprising a first common access channel data signal spread over a first plurality of discrete tones in accordance with a first spreading code assigned to at least the first and a second remote units; receiving at the base station during the first time period a noise burst signal comprising that at least partially interferes with the first plurality of discrete tones; adaptively despreading the first spread signal and processing the noise burst signal received at the base station by using first despreading codes that are based on characteristics of the first spread signal; determining at the base station that a noise burst has occurred while receiving the first spread signal; transmitting from the base station a notice of the noise burst to the first remote unit; said first spread signal discrete tones received by the base station from the first remote unit during a reverse interval of a time division duplex period; said discrete tones modulated with an access request by the first remote unit using a QAM modulation scheme; said discrete tones sampled, digitized, passed through a fast Fourier transform (FFT) processor, and stored in FFT incremental frequency bins as complex numbers which represent points in a QAM modulation constellation which are related to an average amount of energy of the discrete tones; said base station using said complex numbers to prepare said notice of the noise burst; and said base station distinguishing the noise burst from collisions with spread signals from other remote units by using said complex numbers.

Claim 15

The highly bandwidth-efficient communications method of claim 7, which further comprises: said first remote unit receiving said notice and in response thereto, beginning a first type back-off and retry process to minimize effects of the noise burst.

Claim 16

The highly bandwidth-efficient communications method of claim 11, which further comprises: said first remote unit failing to receive said notice and in response thereto, beginning said first type back-off and retry process to minimize effects of noise bursts.

Claim 17

A highly bandwidth-efficient communications system, comprising: means for receiving at a base station during a first time period a first spread signal from a first remote unit comprising a first common access channel data signal spread over a first plurality of discrete tones in accordance with a first spreading code assigned to at least the first and a second remote units; means for receiving at the base station during the first time period a second spread signal from the second remote unit comprising a second common access channel data signal spread over the first plurality of discrete tones in accordance with the first spreading code; said discrete tones being sampled, digitized, passed through a fast Fourier transform (FFT) processor, and stored in FFT incremental frequency bins as complex numbers which represent points in a OAM modulation constellation which are related to an average amount of energy of the discrete tones; means for adaptively despreading the first spread signal and the second spread signal received at the base station by using first despreading codes that are based on characteristics of the received first and second spread signals; means for determining at the base station that a collision has occurred between the first and second spread signals; means for transmitting from the base station a notice of the collision to the first and second remote units; said base station using said complex numbers to prepare said notice of the collision; and said base station distinguishing the collision from a noise burst by using said complex numbers.

Claim 18

A highly bandwidth-efficient communications system, comprising: means for receiving at a base station during a first time period a first spread signal from a first remote unit comprising a first common access channel data signal spread over a first plurality of discrete tones in accordance with a first spreading code assigned to at least the first and a second remote units; means for receiving at the base station during the first time period a second spread signal from the second remote unit comprising a second common access channel data signal spread over the first plurality of discrete tones in accordance with the first spreading code; said discrete tones being sampled, digitized, passed through a fast Fourier transform (FFT) processor, and stored in FFT incremental frequency bins as complex numbers which represent points in a OAM modulation constellation which are related to an average amount of energy of the discrete tones; means for adaptively despreading the first spread signal and the second spread signal received at the base station by using first despreading codes that are based on characteristics of the received first and second spread signals; means for determining at the base station that a collision has occurred between the first and second spread signals; means for transmitting from the base station a notice of the collision to the first and second remote units; said base station using said complex numbers to prepare said notice of the collision; and said base station distinguishing the collision from a noise burst by using said complex numbers.

Claim 19

The highly bandwidth-efficient communications system of claim 13, which further comprises: said first and second spread signals are discrete tones received by the base station from the first and second remote units during a reverse interval of a time division duplex period.

Claim 20

The highly bandwidth-efficient communications system of claim 14, which further comprises: said discrete tones are modulated with an access request by the first and second remote units using a 16 QAM modulation scheme.

Claim 21

A highly bandwidth-efficient communications system, comprising: means for receiving at a base station during a first time period a first spread signal from a first remote unit comprising a first common access channel data signal spread over a first plurality of discrete tones in accordance with a first spreading code assigned to at least the first and a second remote units; means for receiving at the base station during the first time period a second spread signal from the second remote unit comprising a second common access channel data signal spread over the first plurality of discrete tones in accordance with the first spreading code; means for adaptively despreading the first spread signal and the second spread signal received at the base station by using first despreading codes that are based on characteristics of the received first and second spread signals; means for determining at the base station that a collision has occurred between the first and second spread signals; means for transmitting from the base station a notice of the collision to the first and second remote units; said first and second spread signals discrete tones received by the base station from the first and second remote units during a reverse interval of a time division duplex period; said discrete tones modulated with an access request by the first and second remote units using a QAM modulation scheme; said discrete tones sampled, digitized, passed through a fast Fourier transform (FFT) processor, and stored in FFT incremental frequency bins as complex numbers which represent points in a QAM modulation constellation which are related to an average amount of energy of the discrete tones; said base station using said complex numbers to prepare said notice of the collision; and said base station distinguishing the collision from a noise burst by using said complex numbers.

Claim 22

A highly bandwidth-efficient communications system, comprising: means for receiving at a base station during a first time period a first spread signal from a first remote unit comprising a first common access channel data signal spread over a first plurality of discrete tones in accordance with a first spreading code assigned to at least the first and a second remote units; means for receiving at the base station during the first time period a second spread signal from the second remote unit comprising a second common access channel data signal spread over the first plurality of discrete tones in accordance with the first spreading code; means for adaptively despreading the first spread signal and the second spread signal received at the base station by using first despreading codes that are based on characteristics of the received first and second spread signals; means for determining at the base station that a collision has occurred between the first and second spread signals; means for transmitting from the base station a notice of the collision to the first and second remote units; said first and second spread signals discrete tones received by the base station from the first and second remote units during a reverse interval of a time division duplex period; said discrete tones modulated with an access request by the first and second remote units using a QAM modulation scheme; said discrete tones sampled, digitized, passed through a fast Fourier transform (FFT) processor, and stored in FFT incremental frequency bins as complex numbers which represent points in a QAM modulation constellation which are related to an average amount of energy of the discrete tones; said base station using said complex numbers to prepare said notice of the collision; and said base station distinguishing the collision from a noise burst by using said complex numbers.

Claim 23

The highly bandwidth-efficient communications system of claim 13, which further comprises: said first remote unit and said second remote unit receiving said notice and in response thereto, beginning a first type back-off and retry process to avoid a second collision.

Claim 24

The highly bandwidth-efficient communications system of claim 17, which further comprises: said first remote unit and said second remote unit failing to receive said notice and in response thereto, beginning a second type back-off and retry process to minimize effects of noise bursts.

Claim 25

A highly bandwidth-efficient communications system, comprising: means for receiving at a base station during a first time period a first spread signal from a first remote unit comprising a first common access channel data signal spread over a first plurality of discrete tones in accordance with a first spreading code assigned to at least the first and a second remote units; means for receiving at the base station during the first time period a noise burst signal comprising that at least partially interferes with the first plurality of discrete tones; said discrete tones being sampled, digitized, passed through a fast Fourier transform (FFT) processor, and stored in FFT incremental frequency bins as complex numbers which represent points in a OAM modulation constellation which are related to an average amount of energy of the discrete tones; means for adaptively despreading the first spread signal and processing the noise burst signal received at the base station by using first despreading codes that are based on characteristics of the first spread signal; means for determining at the base station a notice of the noise burst to the first remote unit; said base station using said complex numbers to prepare said notice of the noise burst; and said base station distinguishing the noise burst from collisions with spread signals from other remote units by using said complex numbers.

Claim 26

A highly bandwidth-efficient communications system, comprising: means for receiving at a base station during a first time period a first spread signal from a first remote unit comprising a first common access channel data signal spread over a first plurality of discrete tones in accordance with a first spreading code assigned to at least the first and a second remote units; means for receiving at the base station during the first time period a noise burst signal comprising that at least partially interferes with the first plurality of discrete tones; said discrete tones being sampled, digitized, passed through a fast Fourier transform (FFT) processor, and stored in FFT incremental frequency bins as complex numbers which represent points in a OAM modulation constellation which are related to an average amount of energy of the discrete tones; means for adaptively despreading the first spread signal and processing the noise burst signal received at the base station by using first despreading codes that are based on characteristics of the first spread signal; means for determining at the base station a notice of the noise burst to the first remote unit; said base station using said complex numbers to prepare said notice of the noise burst; and said base station distinguishing the noise burst from collisions with spread signals from other remote units by using said complex numbers.

Claim 27

The highly bandwidth-efficient communications system of claim 19, which further comprises: said first spread signal is discrete tones received by the base station from the first remote unit during a reverse interval of a time division duplex period.

Claim 28

The highly bandwidth-efficient communications system of claim 20, which further comprises: said discrete tones are modulated with an access request by the first remote unit using a 16 QAM modulation scheme.

Claim 29

A highly bandwidth-efficient communications system, comprising: means for receiving at a base station during a first time period a first spread signal from a first remote unit comprising a first common access channel data signal spread over a first plurality of discrete tones in accordance with a first spreading code assigned to at least the first and a second remote units; means for receiving at the base station during the first time period a noise burst signal comprising that at least partially interferes with the first plurality of discrete tones; means for adaptively despreading the first spread signal and processing the noise burst signal received at the base station by using first despreading codes that are based on characteristics of the first spread signal; means for determining at the base station a notice of the noise burst to the first remote unit; said first spread signal discrete tones received by the base station from the first remote unit during a reverse interval of a time division duplex period; said discrete tones modulated with an access request by the first remote unit using a QAM modulation scheme; said discrete tones sampled, digitized, passed through a fast Fourier transform (FFT) processor, and stored in FFT incremental frequency bins as complex numbers which represent points in a QAM modulation constellation which are related to an average amount of energy of the discrete tones; said base station using said complex numbers to prepare said notice of the noise burst; said base station distinguishing the noise burst from collisions with spread signals from other remote units by using said complex numbers.

Claim 30

A highly bandwidth-efficient communications system, comprising: means for receiving at a base station during a first time period a first spread signal from a first remote unit comprising a first common access channel data signal spread over a first plurality of discrete tones in accordance with a first spreading code assigned to at least the first and a second remote units; means for receiving at the base station during the first time period a noise burst signal comprising that at least partially interferes with the first plurality of discrete tones; means for adaptively despreading the first spread signal and processing the noise burst signal received at the base station by using first despreading codes that are based on characteristics of the first spread signal; means for determining at the base station a notice of the noise burst to the first remote unit; said first spread signal discrete tones received by the base station from the first remote unit during a reverse interval of a time division duplex period; said discrete tones modulated with an access request by the first remote unit using a QAM modulation scheme; said discrete tones sampled, digitized, passed through a fast Fourier transform (FFT) processor, and stored in FFT incremental frequency bins as complex numbers which represent points in a QAM modulation constellation which are related to an average amount of energy of the discrete tones; said base station using said complex numbers to prepare said notice of the noise burst; said base station distinguishing the noise burst from collisions with spread signals from other remote units by using said complex numbers.

Claim 31

The highly bandwidth-efficient communications system of claim 19, which further comprises: said first remote unit receiving said notice and in response thereto, beginning a first type back-off and retry process to minimize effects of the noise burst.

Claim 32

The highly bandwidth-efficient communications system of claim 23, which further comprises: said first remote unit failing to receive said notice and in response thereto, beginning said first type back-off and retry process to minimize effects of noise bursts.