Adaptive weight update method and system for a discrete multitone spread spectrum communications system

Claim 2

A highly bandwidth-efficient communications method, comprising the steps of: receiving at a base station a first spread signal comprising an incoming data signal spread over a plurality of discrete frequencies; adaptively despreading the signal received at the base station by using first despreading weights; computing an error value for said first spread signal; comparing the error value with a threshold error value; maintaining first spreading weights as a current spreading weights at the base station to apply to an outgoing data signal in response to said error value being less than said threshold error value; adaptively calculating second despreading weights at the base station from said first spread signal and calculating second spreading weights as the current spreading weights from said second despreading weights to apply to the outgoing data signal in response to said error value being greater than said threshold error value; spreading said outgoing data signal at the base station with said current spreading weights, to distribute the outgoing data signal over a plurality of discrete tones, forming a second spread signal; and transmitting said second spread signal.

Claim 3

The highly bandwidth-efficient communications method of claim 1, that further comprises: said error value for said first spread signal being a bit error rate.

Claim 4

The highly bandwidth-efficient communications method of claim 1, that further comprises: said error value for said first spread signal being a Reed-Solomon error value.

Claim 5

The highly bandwidth-efficient communications method of claim 1, that further comprises: said error value for said first spread signal being a difference value between said first spread signal and a reference signal at the base station.

Claim 6

The highly bandwidth-efficient communications method of claim 1, that further comprises: said error value for said first spread signal being a mean square error value.

Claim 7

The highly bandwidth-efficient communications method of claim 1, that further comprises: said threshold error value being a limit error value less a margin error value.

Claim 8

A highly bandwidth-efficient communications method, comprising the steps of: receiving a pilot signal over a channel at a first station and measuring its distortion by the channel as a first channel response characteristic; adaptively calculating a despread matrix of first despreading weights that maximizes the ratio of signal-to-noise-and-interference associated with the received pilot signal; receiving at the first station a first signal comprising an incoming data signal having the first channel response characteristic; adaptively equalizing the channel response characteristic of the first signal at the first station by using the first despreading weights; computing an error value for said first signal; comparing the error value with a threshold error value; maintaining said first despreading weights as a current despreading weights at the first station in response to said error value being less than said threshold error value; adaptively calculating second despreading weights as the current despreading weights by modifying said first despreading weights in response to said error value being greater than said threshold error value; receiving at the first station a second signal later than said first signal, comprising an incoming data signal; equalizing the channel response characteristic of the second signal received at the first station by using said second despreading weights.

Claim 9

A highly bandwidth-efficient communications method, comprising the steps of: receiving a pilot signal over a channel at a first station and measuring its distortion by the channel as a first channel response characteristic; adaptively calculating a despread matrix of first despreading weights that maximizes the ratio of signal-to-noise-and-interference associated with the received pilot signal; receiving at the first station a first signal comprising an incoming data signal having the first channel response characteristic; adaptively equalizing the channel response characteristic of the first signal at the first station by using the first despreading weights; computing an error value for said first signal; comparing the error value with a threshold error value; maintaining said first despreading weights as a current despreading weights at the first station in response to said error value being less than said threshold error value; adaptively calculating second despreading weights as the current despreading weights by modifying said first despreading weights in response to said error value being greater than said threshold error value; receiving at the first station a second signal later than said first signal, comprising an incoming data signal; equalizing the channel response characteristic of the second signal received at the first station by using said second despreading weights.

Claim 10

The highly bandwidth-efficient communications method of claim 7, that further comprises: said error value for said first signal being a bit error rate.

Claim 11

The highly bandwidth-efficient communications method of claim 7, that further comprises: said error value for said first signal being a Reed-Solomon error value.

Claim 12

The highly bandwidth-efficient communications method of claim 7, that further comprises: said error value for said first signal being a difference value between said first signal and a reference signal at the first station.

Claim 13

The highly bandwidth-efficient communications method of claim 7, that further comprises: said error value for said first signal being a mean square error value.

Claim 14

The highly bandwidth-efficient communications method of claim 7, that further comprises: said threshold error value being a limit error value less a margin error value.

Claim 15

A highly bandwidth-efficient communications method, comprising the steps of: receiving a pilot signal over a channel at a first station and measuring its distortion by the channel as a first channel response characteristic; adaptively calculating a despread matrix of first despreading weights that maximizes the ratio of signal-to-noise-and-interference associated with the received pilot signal; receiving at a base station a first spread signal comprising an incoming data signal spread over a plurality of discrete frequencies; adaptively despreading the signal received at the base station by using said first despreading weights; computing an error value for said first spread signal; comparing the error value with a threshold error value; maintaining said first despreading weights as current despreading weights at the base station in response to said error value being less than said threshold error value; adaptively calculating second despreading weights at the base station from said first spread signal in response to said error value being greater than said threshold error value; receiving at the base station a second spread signal comprising an incoming data signal spread over a plurality of discrete frequencies; adaptively despreading the second signal received at the base station by using said second despreading weights.

Claim 16

A highly bandwidth-efficient communications method, comprising the steps of: receiving a pilot signal over a channel at a first station and measuring its distortion by the channel as a first channel response characteristic; adaptively calculating a despread matrix of first despreading weights that maximizes the ratio of signal-to-noise-and-interference associated with the received pilot signal; receiving at a base station a first spread signal comprising an incoming data signal spread over a plurality of discrete frequencies; adaptively despreading the signal received at the base station by using said first despreading weights; computing an error value for said first spread signal; comparing the error value with a threshold error value; maintaining said first despreading weights as current despreading weights at the base station in response to said error value being less than said threshold error value; adaptively calculating second despreading weights at the base station from said first spread signal in response to said error value being greater than said threshold error value; receiving at the base station a second spread signal comprising an incoming data signal spread over a plurality of discrete frequencies; adaptively despreading the second signal received at the base station by using said second despreading weights.

Claim 17

The highly bandwidth-efficient communications method of claim 13, that further comprises: said error value for said first signal being a bit error rate.

Claim 18

The highly bandwidth-efficient communications method of claim 13, that further comprises: said error value for said first signal being a Reed-Solomon error value.

Claim 19

The highly bandwidth-efficient communications method of claim 13, that further comprises: said error value for said first signal being a difference value between said first signal and a reference signal at the first station.

Claim 20

The highly bandwidth-efficient communications method of claim 13, that further comprises: said error value for said first signal being a mean square error value.

Claim 21

The highly bandwidth-efficient communications method of claim 13, that further comprises: said threshold error value being a limit error value less a margin error value.

Claim 22

A highly bandwidth-efficient communications method, comprising the steps of: receiving at a station a new incoming spread signal comprising an incoming data signal spread over a plurality of discrete frequencies; accessing a stored error value for a previously received spread signal; comparing the stored error value with a threshold error value; if the stored error value is less than the threshold error value, then maintaining existing despreading and spreading weights as current weights to apply to the new incoming signal and an outgoing data signal; alternately, if the stored error value is greater than the threshold error value, then adaptively calculating new despreading weights from the new incoming spread signal and calculating new spreading weights from the new despreading weights to apply to the new incoming signal and an outgoing data signal; despreading the new incoming signal; computing and storing a new error value for the new incoming signal; and spreading an outgoing data signal to distribute the outgoing data signal over a plurality of discrete tones.

Claim 23

A highly bandwidth-efficient communications method, comprising the steps of: receiving at a station a new incoming spread signal comprising an incoming data signal spread over a plurality of discrete frequencies; accessing a stored error value for a previously received spread signal; comparing the stored error value with a threshold error value; if the stored error value is less than the threshold error value, then maintaining existing despreading and spreading weights as current weights to apply to the new incoming signal and an outgoing data signal; alternately, if the stored error value is greater than the threshold error value, then adaptively calculating new despreading weights from the new incoming spread signal and calculating new spreading weights from the new despreading weights to apply to the new incoming signal and an outgoing data signal; despreading the new incoming signal; computing and storing a new error value for the new incoming signal; and spreading an outgoing data signal to distribute the outgoing data signal over a plurality of discrete tones.

Claim 24

The highly bandwidth-efficient communications method of claim 19, that further comprises: said stored error value for said previously received spread signal being a bit error rate.

Claim 25

The highly bandwidth-efficient communications method of claim 19, that further comprises: said stored error value for said previously received spread signal being a Reed-Solomon error value.

Claim 26

The highly bandwidth-efficient communications method of claim 19, that further comprises: said stored error value for said previously received spread signal being a difference value between said previously received spread signal and a reference signal at the base station.

Claim 27

The highly bandwidth-efficient communications method of claim 19, that further comprises: said stored error value for said previously received spread signal being a mean square error value.

Claim 28

The highly bandwidth-efficient communications method of claim 19, that further comprises: said threshold error value being a limit error value less a margin error value.

Claim 29

A highly bandwidth-efficient communications method, comprising the steps of: receiving at a station a new incoming signal comprising an incoming data signal spread over a plurality of discrete frequencies; accessing a stored error value; comparing the error value with a threshold error value; if the error value is less than the threshold error value, then maintaining existing weights as current weights to apply to the new incoming signal and an outgoing data signal; alternately, if the error value is greater than the threshold error value, then adaptively calculating new weights as current weights from the new incoming signal to apply to the new incoming signal and an outgoing data signal; applying said current weights to the new incoming signal; and computing and storing a new error value for the new incoming signal.

Claim 30

A highly bandwidth-efficient communications method, comprising the steps of: receiving at a station a new incoming signal comprising an incoming data signal spread over a plurality of discrete frequencies; accessing a stored error value; comparing the error value with a threshold error value; if the error value is less than the threshold error value, then maintaining existing weights as current weights to apply to the new incoming signal and an outgoing data signal; alternately, if the error value is greater than the threshold error value, then adaptively calculating new weights as current weights from the new incoming signal to apply to the new incoming signal and an outgoing data signal; applying said current weights to the new incoming signal; and computing and storing a new error value for the new incoming signal.

Claim 31

The highly bandwidth-efficient communications method of claim 25, that further comprises: said current weights being despreading and spreading weights to apply to the new incoming signal and an outgoing data signal, respectively.

Claim 32

A highly bandwidth-efficient communications system, comprising: means for receiving at a base station a first spread signal comprising an incoming data signal spread over a plurality of discrete frequencies; means for adaptively despreading the signal received at the base station by using first despreading weights; means for computing an error value for said first spread signal; means for comparing the error value with a threshold error value; means for maintaining first spreading weights as a current spreading weights at the base station to apply to an outgoing data signal in response to said error value being less than said threshold error value; means for adaptively calculating second despreading weights at the base station from said first spread signal and calculating second spreading weights as the current spreading weights from said second despreading weights to apply to the outgoing data signal in response to said error value being greater than said threshold error value; means for spreading said outgoing data signal at the base station with said current spreading weights, to distribute the outgoing data signal over a plurality of discrete tones, forming a second spread signal; and means for transmitting said second spread signal.

Claim 33

A highly bandwidth-efficient communications system, comprising: means for receiving at a base station a first spread signal comprising an incoming data signal spread over a plurality of discrete frequencies; means for adaptively despreading the signal received at the base station by using first despreading weights; means for computing an error value for said first spread signal; means for comparing the error value with a threshold error value; means for maintaining first spreading weights as a current spreading weights at the base station to apply to an outgoing data signal in response to said error value being less than said threshold error value; means for adaptively calculating second despreading weights at the base station from said first spread signal and calculating second spreading weights as the current spreading weights from said second despreading weights to apply to the outgoing data signal in response to said error value being greater than said threshold error value; means for spreading said outgoing data signal at the base station with said current spreading weights, to distribute the outgoing data signal over a plurality of discrete tones, forming a second spread signal; and means for transmitting said second spread signal.

Claim 34

A highly bandwidth-efficient communications system, comprising: means for receiving a pilot signal over a channel at a first station and measuring its distortion by the channel as a first channel response characteristic; means for adaptively calculating a despread matrix of first despreading weights that maximizes the ratio of signal-to-noise-and-interference associated with the received pilot signal; means for receiving at the first station a first signal comprising an incoming data signal having the first channel response characteristic; means for adaptively equalizing the channel response characteristic of the first signal at the first station by using the first despreading weights; means for computing an error value for said first signal; means for comparing the error value with a threshold error value; means for maintaining said first despreading weights as a current despreading weights at the first station in response to said error value being less than said threshold error value; means for adaptively calculating second despreading weights as the current despreading weights by modifying said first despreading weights in response to said error value being greater than said threshold error value; means for receiving at the first station a second signal later than said first signal, comprising an incoming data signal; and means for equalizing the channel response characteristic of the second signal received at the first station by using said second despreading weights.

Claim 35

A highly bandwidth-efficient communications system, comprising: means for receiving a pilot signal over a channel at a first station and measuring its distortion by the channel as a first channel response characteristic; means for adaptively calculating a despread matrix of first despreading weights that maximizes the ratio of signal-to-noise-and-interference associated with the received pilot signal; means for receiving at the first station a first signal comprising an incoming data signal having the first channel response characteristic; means for adaptively equalizing the channel response characteristic of the first signal at the first station by using the first despreading weights; means for computing an error value for said first signal; means for comparing the error value with a threshold error value; means for maintaining said first despreading weights as a current despreading weights at the first station in response to said error value being less than said threshold error value; means for adaptively calculating second despreading weights as the current despreading weights by modifying said first despreading weights in response to said error value being greater than said threshold error value; means for receiving at the first station a second signal later than said first signal, comprising an incoming data signal; and means for equalizing the channel response characteristic of the second signal received at the first station by using said second despreading weights.

Claim 36

A highly bandwidth-efficient communications system, comprising: means for receiving a pilot signal over a channel at a first station and measuring its distortion by the channel as a first channel response characteristic; means for adaptively calculating a despread matrix of first despreading weights that maximizes the ratio of signal-to-noise-and-interference associated with the received pilot signal; means for receiving at a base station a first spread signal comprising an incoming data signal spread over a plurality of discrete frequencies; means for adaptively despreading the signal received at the base station by using said first despreading weights; means for computing an error value for said first spread signal; means for comparing the error value with a threshold error value; means for maintaining said first despreading weights as current despreading weights at the base station in response to said error value being less than said threshold error value; means for adaptively calculating second despreading weights at the base station from said first spread signal in response to said error value being greater than said threshold error value; means for receiving at the base station a second spread signal comprising an incoming data signal spread over a plurality of discrete frequencies; and means for adaptively despreading the second signal received at the base station by using said second despreading weights.

Claim 37

A highly bandwidth-efficient communications system, comprising: means for receiving a pilot signal over a channel at a first station and measuring its distortion by the channel as a first channel response characteristic; means for adaptively calculating a despread matrix of first despreading weights that maximizes the ratio of signal-to-noise-and-interference associated with the received pilot signal; means for receiving at a base station a first spread signal comprising an incoming data signal spread over a plurality of discrete frequencies; means for adaptively despreading the signal received at the base station by using said first despreading weights; means for computing an error value for said first spread signal; means for comparing the error value with a threshold error value; means for maintaining said first despreading weights as current despreading weights at the base station in response to said error value being less than said threshold error value; means for adaptively calculating second despreading weights at the base station from said first spread signal in response to said error value being greater than said threshold error value; means for receiving at the base station a second spread signal comprising an incoming data signal spread over a plurality of discrete frequencies; and means for adaptively despreading the second signal received at the base station by using said second despreading weights.

Claim 38

A highly bandwidth-efficient communications system, comprising: means for receiving at a station a new incoming spread signal comprising an incoming data signal spread over a plurality of discrete frequencies; means for accessing a stored error value for a previously received spread signal; means for comparing the stored error value with a threshold error value; means for maintaining existing despreading and spreading weights as current weights to apply to the new incoming signal and an outgoing data signal, if the stored error value is less than the threshold error value; means for adaptively calculating new despreading weights from the new incoming spread signal and calculating new spreading weights from the new despreading weights to apply to the new incoming signal and an outgoing data signal, if the stored error value is greater than the threshold error value; means for despreading the new incoming signal; means for computing and storing a new error value for the new incoming signal; and means for spreading an outgoing data signal to distribute the outgoing data signal over a plurality of discrete tones.

Claim 39

A highly bandwidth-efficient communications system, comprising: means for receiving at a station a new incoming spread signal comprising an incoming data signal spread over a plurality of discrete frequencies; means for accessing a stored error value for a previously received spread signal; means for comparing the stored error value with a threshold error value; means for maintaining existing despreading and spreading weights as current weights to apply to the new incoming signal and an outgoing data signal, if the stored error value is less than the threshold error value; means for adaptively calculating new despreading weights from the new incoming spread signal and calculating new spreading weights from the new despreading weights to apply to the new incoming signal and an outgoing data signal, if the stored error value is greater than the threshold error value; means for despreading the new incoming signal; means for computing and storing a new error value for the new incoming signal; and means for spreading an outgoing data signal to distribute the outgoing data signal over a plurality of discrete tones.

Claim 40

A highly bandwidth-efficient communications system, comprising: means for receiving at a station a new incoming signal comprising an incoming data signal spread over a plurality of discrete frequencies; means for accessing a stored error value; means for comparing the stored error value with a threshold error value; means for maintaining existing weights as current weights to apply to the new incoming signal and an outgoing data signal, if the stored error value is less than the threshold error value; means for adaptively calculating new weights as current weights from the new incoming signal to apply to the new incoming signal and an outgoing data signal, alternately, if the stored error value is greater than the threshold error value; means for applying said current weights to the new incoming signal; and means for computing and storing a new error value for the new incoming signal.

Claim 41

A highly bandwidth-efficient communications system, comprising: means for receiving at a station a new incoming signal comprising an incoming data signal spread over a plurality of discrete frequencies; means for accessing a stored error value; means for comparing the stored error value with a threshold error value; means for maintaining existing weights as current weights to apply to the new incoming signal and an outgoing data signal, if the stored error value is less than the threshold error value; means for adaptively calculating new weights as current weights from the new incoming signal to apply to the new incoming signal and an outgoing data signal, alternately, if the stored error value is greater than the threshold error value; means for applying said current weights to the new incoming signal; and means for computing and storing a new error value for the new incoming signal.