Abstract:
The present invention provides a method and apparatus for generating SIR estimates early in a time interval that include the benefits of interference suppression without requiring the computation of specific interference suppression elements. In particular, the present invention generates an SIR estimate for a RAKE receiver during a current time interval based on channel estimates generated based on the received signal(s). By applying an offset derived during a previous time interval to the RAKE SIR estimate, the present invention generates a second SIR estimate for a G-RAKE receiver.
Abstract:
The systematic and parity bits of a symbol are tightly coupled to each other based on the way in which the symbol is encoded. The relationship between the systematic and parity bits can be exploited to improve the accuracy of soft bit estimation for both the systematic bits and parity bits. In one embodiment, a received symbol is processed by demodulating the received symbol to determine an initial soft estimate of each systematic bit and corresponding one or more parity bits in the sequence. The systematic bit sequence is iteratively decoded to revise the soft estimate of the systematic bit. The initial soft estimate of the one or more parity bits associated with each systematic bit is revised based on the revised soft estimate of each systematic bit. The received symbol can be decoded or regenerated based on the revised soft estimate of each systematic bit and corresponding one or more parity bits.
Abstract:
A method for use in receiving a spread-spectrum signal includes receiving an input signal. The input signal includes a first plurality of multipath components. The method also includes despreading the first plurality of multipath components. The step of despreading includes computing a plurality of corresponding delays. The method also includes computing a plurality of combining weights based, at least in part, on interference correlation between at least two of the first plurality of multipath components, selecting, according to at least one criterion, a subset of the plurality of combining weights, and despreading and combining a second plurality of multipath components using at least one quantity related to the selected plurality of combining weights and a plurality of delays and multipath components corresponding to the plurality of selected combining weights. This Abstract is provided to comply with rules requiring an Abstract that allows a searcher or other reader to quickly ascertain subject matter of the technical disclosure. This Abstract is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims. 37 CFR 1.72(b).
Abstract:
An average position estimate is determined using an instantaneous position estimate, a previously-determined average position estimate, a previously-determined average signal power, and an instantaneous signal power. The average signal power is determined using the previously-determined average signal power and the instantaneous signal power.
Abstract:
A method of determining a noise-corrected power delay profile includes determining a power delay profile and calculating a noise-corrected power delay profile. The step of calculating the noise-corrected power delay profile includes using a biased noise-floor power estimate, the power delay profile, and a noise-scaling factor.
Abstract:
A CDMA multi-code joint demodulation solution in which impairment suppression and channel matching operations are performed prior to despreading. Embodiments include a linear front end that performs chip-level suppression of signal components that are not included in a subsequent joint demodulation process. The pre-processing stage also carries out metric preparation and provides a vector decision statistic that is processed by a joint demodulation stage to extract per-code soft values for the symbols of interest in the received signal. Both code-specific and code-averaged versions of the linear processing are disclosed, as are several front-end configurations with equivalent performance, but different complexity trade-offs. These new approaches use a block formulation, requiring a set of input chip samples as an input, and perform all operations as matrix-vector multiplications, which is an approach amenable to efficient DSP or hardware implementation.
Abstract:
One aspect of the present invention concerns the management of processing resource allocations for a Turbo receiver, where such resources are consumed from a finite resource budget within a defined processing time interval. The contemplated Turbo receiver attempts to allocate more processing resources to those demodulation and/or Turbo decoding tasks that make more valuable contributions with respect to the ultimate goal of successfully decoding all data streams that are of interest in a received signal. The advantageous management approach allows the Turbo receiver to obtain better results for a given consumption of processing resources, and further permits the Turbo receiver to quit upon either achieving a successful outcome within a defined processing time interval or exhausting the budgeted resources.
Abstract:
One aspect of the present invention concerns the management of processing resource allocations for a Turbo receiver, where such resources are consumed from a finite resource budget within a defined processing time interval. The contemplated Turbo receiver attempts to allocate more processing resources to those demodulation and/or Turbo decoding tasks that make more valuable contributions with respect to the ultimate goal of successfully decoding all data streams that are of interest in a received signal. The advantageous management approach allows the Turbo receiver to obtain better results for a given consumption of processing resources, and further permits the Turbo receiver to quit upon either achieving a successful outcome within a defined processing time interval or exhausting the budgeted resources.
Abstract:
In one or more aspects, the present invention improves the efficiency of soft information transfer within a soft-value processing apparatus, by reducing in some sense the “amount” of soft information transferred between constituent processor circuits within the apparatus, without forfeiting or otherwise compromising the transfer of “valuable” soft information. In one example, the soft values produced by a constituent processor circuit are identified as being reliable or unreliable according to a reliability threshold. Some or all of the unreliable values are omitted from a soft value information transfer to another constituent processor circuit, or they are quantized for such transfer. The reduction in memory requirements for soft information transfer advantageously allows the use of lower power, less complex, and less expensive circuitry than would otherwise be required in the apparatus, which may be, as a non-limiting example, a Turbo receiver in a wireless communication device.
Abstract:
MMSE equalization in the frequency domain is emulated by applying intermediate weights on a per-frequency-bin basis and re-scaling each bin output to recover proper MMSE scaling. Time-domain samples of a received signal are transformed into a frequency-domain representation of the received signal. A frequency-domain representation of a channel response for the radio channel is calculated, and a frequency-domain representation of impairments to the desired signal is generated, the frequency-domain representation of the impairments comprising an impairment covariance matrix for each of the frequency bins. A scaling factor for each of frequency bins is calculated, based on a bin-specific signal-quality estimate for each bin, and an equalized frequency-domain sample for each of the frequency bins is computed, as a function of the scaling factors, the frequency-domain representation of the channel response, and the generated frequency-domain representation of impairments. The equalized frequency-domain samples are transformed into an equalized time-domain sample sequence.