摘要:
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.
摘要:
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.
摘要:
A method and apparatus for decoding of tailbiting convolutional codes (TBCC) are disclosed. The proposed modified maximum-likelihood TBCC decoding technique preserves error correction performance of optimal maximum-likelihood based TBCC decoding, while the computational complexity is substantially decreased since a reduced number of decoding states has been evaluated. Compare to other sub-optimal TBCC decoding algorithms, modified maximum-likelihood TBCC decoding achieves improved packet error rate performance with similar computational complexity.
摘要:
A method and apparatus for decoding of tailbiting convolutional codes (TBCC) are disclosed. The proposed modified maximum-likelihood TBCC decoding technique preserves error correction performance of optimal maximum-likelihood based TBCC decoding, while the computational complexity is substantially decreased since a reduced number of decoding states has been evaluated. Compare to other sub-optimal TBCC decoding algorithms, modified maximum-likelihood TBCC decoding achieves improved packet error rate performance with similar computational complexity.
摘要:
Space time coding (STC) may be applied at the transmitter adding redundant information in both space and time dimensions. At the receiver, the received STC signal may be decoded using a spatial multiplexing MIMO decoding, for example, based on either Minimum Mean Square Error (MMSE) or maximum-likelihood (ML) algorithms. A selective STC decoder may incorporate both the conventional maximum ratio combining (MRC) decoding scheme and a MIMO decoding scheme. One of the STC decoding schemes may be selected, for example, based on estimated channel conditions in order to achieve a trade-off between error rate performance and computational complexity. Components used for a non-selected scheme may be powered down.
摘要:
A “post-squaring” detection algorithm, and related devices, that may reduce the complexity of maximum likelihood detection (MLD) schemes while preserving their performance is provided. Rather than search for optimum metrics (such as minimum distance metrics) based on squared norm values, a search may be based on un-squared norm metrics, and the squaring may be postponed, for example, until subsequent log-likelihood ratio (LLR) computation. For certain embodiments, approximations of un-squared norm values may significantly reduce computation complexity.
摘要:
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.
摘要:
Certain embodiments of the present disclosure provide techniques for approximate computation of l2 norms as a part of the maximum likelihood (ML) detection: tri-maxmin, maxsum and sortsum algorithms. The proposed approximation schemes show better accuracy than conventional approximation schemes—the abssum and maxmin algorithms, while the computational complexity is very similar. The error rate performance of the ML detection that utilizes proposed norm-approximation techniques are very close to the reference ML detection with exact calculation of l2 norms, while the computational complexity is significantly smaller.
摘要:
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.
摘要:
Techniques for initial wireless network synchronization by a mobile station are provided. For certain embodiments, the techniques may involve a joint search for the cell identification (ID-cell index) and the coarse carrier frequency offset (CFO) estimation. For certain embodiments, the techniques may be based on hard correlation and binary differential despreading that substantially simplifies computational complexity compare to known techniques that independently search for the ID-cell index and perform CFO estimation.