Abstract:
An optimum combiner that reduces the amount of interference imposed upon a first base station (102) by transmissions of other base stations within the same communication system. Two antennas (112, 114) are used to receive transmissions within a receiving station (110). A rake receiver is coupled to each antenna (112, 114). By optimally combining the signals that are received by each independent finger of the rake receiver, interference that is correlated between a finger associated with the first antenna (112) and a finger associated with the second antenna (114) can be minimized with respect to the desired signal. Optimum combining requires determination of optimum combining coefficients. A max-ratio combining algorithm may be substituted for the optimal combining algorithm depending upon interference characteristics.
Abstract:
Techniques for transmitting data from a transmitter unit to a receiver unit in a multiple-input mutiple-output (MIMO) communication system. In one method, at the receiver unit, a number of signals are received via a number of receive antennas, with the received signal from the transmitter unit. The received signals are processed to derive channel state information (CSI) indicative of characteristics of a number of transmission channels used for data transmission. The CSI is transmitted back to the transmitter unit. At the transmitter unit, the CSI from the receiver unit is received and data for transmission to the receiver units is processed based on the received CSI.
Abstract:
According to one aspect of the invention, a method for determining a power control set point is provided. In one embodiment, the power control set point is determined based on one or more factors including a first factor corresponding to a pilot bit error rate, a second factor corresponding to a normalized signal variance, and a third factor corresponding to an average number of fingers in lock.
Abstract:
Techniques for puncturing symbols in a communications system are disclosed. S symbols are received for a frame having a capacity of N symbols, with S being greater than N. P symbols need to be punctured so that remaining symbols fit into the frame. A number of puncture distances, D1 through DN, are computed based on S and P. A particular number of symbol punctures is determined for each computed puncture distance. P1 through PN symbol punctures are then performed at the distances of D1 through DN, respectively. For a more even distribution of the symbol punctures, each of the distances D1 through DN can be selected to be greater than or equal to a minimum puncture distance Dmin defined as Dmin=└S/P┘, where └┘ denotes a floor operator. The symbol punctures at each computed distance can be performed together or distributed with symbol punctures at other distances. In the alternative, an accumulator is configured to wrap around after it has been incremented to a value of S, each increment being of size P. A symbol index is incremented by one each time the accumulator is incremented by P, until the symbol index exceeds the value S. The process is advantageously begun with a puncture. Each time the accumulator wraps around, another puncture is performed. As another alternative, puncturing can be combined with symbol repetition.
Abstract:
Techniques for puncturing symbols in a communications system. S symbols are received for a frame having a capacity of N symbols, with S being greater than N. P symbols need to be punctured so that remaining symbols fit into the frame. A number of puncture distances, D1 through DN, are computed based on S and P. A particular number of symbol punctures is determined for each computed puncture distance. P1 through PN symbol punctures are then performed at the distances of D1 through DN, respectively. For a more even distribution of the symbol punctures, each of the distances D1 through DN can be selected to be greater than or equal to a minimum puncture distance Dmin defined as Dmin = [SIP], where [] denotes a floor operator. The symbol punctures at each computed distance can be performed together or distributed with symbol punctures at other distances. In the alternative, an accumulator is configured to wrap around after it has been incremented to a value of S, each increment being of size P. A symbol index is incremented by one each time the accumulator is incremented by P, until the symbol index exceeds the value S. The process is advantageously begun with a puncture. Each time the accumulator wraps around, another puncture is performed.
Abstract:
Coherent detection of high-speed digital wireless communications becomes more difficult when the frequencies of the transmitter and receiver oscillators do not coincide. A frequency-locked loop may be used to characterize this frequency offset by processing the samples received on a pilot channel. Rather than using the offset information thus derived to correct the frequency of the received signal, the invention realizes a considerable computational savings by applying a frequency correction to the despread pilot samples instead.
Abstract:
An optimum combiner that reduces the amount of interference imposed upon a first base station (102) by transmissions of other base stations within the same communication system. Two antennas (112, 114) are used to receive transmissions within a receiving station (110). A rake receiver is coupled to each antenna (112, 114). By optimally combining the signals that are received by each independent finger of the rake receiver, interference that is correlated between a finger associated with the first antenna (112) and a finger associated with the second antenna (114) can be minimized with respect to the desired signal. Optimum combining requires determination of optimum combining coefficients. A max-ratio combining algorithm may be substituted for the optimal combining algorithm depending upon interference characteristics.
Abstract:
Techniques for puncturing symbols in a communications system are disclosed. S symbols are received for a frame having a capacity of N symbols, with S being greater than N. P symbols need to be punctured so that remaining symbols fit into the frame. A number of puncture distances, D1 through DN, are computed based on S and P. A particular number of symbol punctures is determined or each computed puncture distance. P1 through PN symbol punctures are then performed at the distances of D1 through DN, respectively. For a more even distribution of the symbol punctures, each of the distances D1 through DN can be selected to be greater than or equal to a minimum puncture distance Dmin defined as D min=[ S/P ], where [ ] denotes a floor operator. The symbol punctures at each computed distance can be performed together or distributed with symbol punctures at other distances. In the alternative, an accumulator is configured to wrap around after it has been incremented to a value of S , each increment being of size P . A symbol index is incremented by one each time the accumulator is incremented by P , until the symbol index exceeds the value S . The progress is advantageously begun with a puncture. Each time the accumulator wraps around, another puncture is performed. As another alternative, puncturing can be combined with symbol repetition.
Abstract:
Techniques for puncturing symbols in a communications system are disclosed. S symbols are received for a frame having a capacity of N symbols, with S being greater than N. P symbols need to be punctured so that remaining symbols fit into the frame. A number of puncture distances, D1 through DN, are computed based on S and P. A particular number of symbol punctures is determined for each computed puncture distance. P1 through PN symbol punctures are then performed at the distances of D1 through DN, respectively. For a more even distribution of the symbol punctures, each of the distances D1 through DN can be selected to be greater than or equal to a minimum puncture distance Dmin defined as Dmin=└S/P┘, where └┘ denotes a floor operator. The symbol punctures at each computed distance can be performed together or distributed with symbol punctures at other distances. In the alternative, an accumulator is configured to wrap around after it has been incremented to a value of S, each increment being of size P. A symbol index is incremented by one each time the accumulator is incremented by P, until the symbol index exceeds the value S. The process is advantageously begun with a puncture. Each time the accumulator wraps around, another puncture is performed. As another alternative, puncturing can be combined with symbol repetition.
Abstract:
In wireless communications, it is necessary to monitor the transmission quality of communications channels to maintain system performance and operation. The invention provides a way of measuring bit error rates in channels at the receiver, without diminishing channel throughput by inserting quality monitoring data into the signal at the transmitter.