Abstract:
A method for suppressing interference in a wireless communication is provided. The method comprises receiving a burst of symbols, generating a plurality of timing hypotheses for the burst of symbols, and calculating, for each timing hypothesis, a plurality of weights for an interference suppression filter based upon a subset of the burst of symbols. The method further comprises, for each timing hypothesis, filtering the subset of the burst of symbols using the interference suppression filter with the corresponding plurality of weights, and selecting one of the plurality of timing hypotheses corresponding to a selection criteria. The method further comprises equalizing and decoding the filtered burst of symbols based upon the selected one of the plurality of timing hypotheses.
Abstract:
A method for suppressing interference in a wireless communication is provided. The method comprises receiving a burst of symbols, generating a plurality of timing hypotheses for the burst of symbols, and calculating, for each timing hypothesis, a plurality of weights for an interference suppression filter based upon a subset of the burst of symbols. The method further comprises, for each timing hypothesis, filtering the subset of the burst of symbols using the interference suppression filter with the corresponding plurality of weights, and selecting one of the plurality of timing hypotheses corresponding to a selection criteria. The method further comprises equalizing and decoding the filtered burst of symbols based upon the selected one of the plurality of timing hypotheses.
Abstract:
A method and apparatus of wireless communication are configured to capture, at a user equipment, one or more adjacent Universal Mobile Telecommunication System Terrestrial Radio Access Absolute Radio Frequency Channel Numbers (UARFCNs), extract a useful wide band signal from the one or more adjacent UARFCNs, perform a PSCH search on the useful wide band signal to obtain a composite PSCH signal, and reject the one or more UARFCNs where no peaks greater than a noise threshold are detected in the composite PSCH signal.
Abstract:
Methods and apparatus for receiving, processing, and decoding MIMO transmissions in communications systems are described. A non-Gaussian approximation method for simplifying processing complexity where summations are used is described. Use of a priori information to facilitate determination of log likelihood ratios (LLRs) in receivers using iterative decoders is further described. A Gaussian or non-Gaussian approximation method using a priori information may be used to determine a K-best list of values for summation to generate an LLR is also described.
Abstract:
Techniques for performing time tracking in a communication system utilizing a cyclic prefix are described. In an aspect, a receiver may perform time tracking and determine an FFT window position based on a metric related to inter-symbol interference (ISI) and inter-carrier interference (ICI). The receiver may determine an early energy for signal paths earlier than the current FFT window position, determine a late energy for signal paths later than the current FFT window position, determine the metric based on the early and late energies, compute an update amount for the FFT window position based on the metric, and update the FFT window position based on the update amount with a time tracking loop (TTL). In yet another aspect, the receiver may compute the FFT window position based on a channel impulse response (CIR) estimate directly, without using a TTL.
Abstract:
Providing for reduced complexity or improved accuracy in de-mapping received wireless data streams for multi-channel wireless communication is described herein. By way of example, a low-complexity likelihood algorithm can be employed to de-map data bits from the wireless data streams. In one particular example, the likelihood algorithm can approximate a received bit with a subset of received wireless symbols correlated the bit, reducing algorithm complexity. In other examples, a limited set of received wireless symbols can be employed for the subset, further reducing algorithm complexity. According to at least one other example, logarithmic terms of the algorithm can be approximated with non-logarithmic functions, such as a look-up table, series expansion, polynomial approximation, or the like. These approximations can enhance symbol de-mapping accuracy while maintaining or improving processing overhead for a wireless receiver.
Abstract:
Techniques for performing time tracking in a communication system utilizing a cyclic prefix are described. In an aspect, a receiver may detect for large timing errors based on early and late received samples obtained with early and late FFT windows, respectively. The receiver may derive first and second channel impulse response (CIR) estimates based on the early and late received samples, respectively, determine an early channel energy based on the first CIR estimate, determine a late channel energy based on the second CIR estimate, compute an update amount based on the early and late channel energies, and update the FFT window position based on the update amount. In another aspect, the receiver may perform time tracking with an inner time tracking loop (TTL) and an outer TTL. The receiver may update the FFT window position in coarse steps with the outer TTL and in fine steps with the inner TTL.
Abstract:
Certain embodiments of the present disclosure provide a method for frequency- domain gain control in system utilizing orthogonal frequency division multiplexing (OFDM) multiple input multiple output (MIMO). The proposed method reduces the complexity of the system while maximizing the internal accuracy of the OFDM MIMO decoder and preserving the performance of the system.