On the Expected Complexity Analysis of a Generalized Sphere Decoding Algorithm for Underdetermined Linear Communication Systems

Author(s):  
P. Wang ◽  
T. Le-Ngoc
2013 ◽  
Vol 2013 ◽  
pp. 1-20 ◽  
Author(s):  
Jian Luo ◽  
Wilhelm Keusgen ◽  
Andreas Kortke

MIMO OFDM is a very promising technique for future wireless communication systems. By applying direct conversion architecture, low-cost, low-power, small size, and flexible implementation of MIMO OFDM systems can be realized. However, the performance of direct conversion architecture-based MIMO OFDM systems can be seriously affected by RF impairments incling carrier frequency offset (CFO) and I/Q-imbalance. While OFDM is sensitive to CFO, direct conversion architecture is sensitive to I/Q imbalance. Such RF impairments aggravate as the carrier frequency becomes higher for example, beyond 60 GHz. To achieve the desired high performance of MIMO OFDM, such RF impairments have to be compensated for. In this paper, the joint compensation of CFO, transmitter and receiver frequency-selective I/Q imbalance, and the MIMO radio channel is investigated. Two preamble-based schemes are proposed for impairment parameter estimation. The proposed preambles are constructed both in time and frequency domains and require much less overhead than the state-of-the-art designs. Furthermore, much lower computational complexity is allowed, enabling efficient implementation. The advantages and effectiveness of both proposed schemes are compared and verified by numerical simulations and complexity analysis.


2019 ◽  
Vol 9 (5) ◽  
pp. 831
Author(s):  
Yusheng Xing ◽  
Guofang Tu

In this paper, we propose a low-complexity ordered statistics decoding (OSD) algorithm called threshold-based OSD (TH-OSD) that uses a threshold on the discrepancy of the candidate codewords to speed up the decoding of short polar codes. To determine the threshold, we use the probability distribution of the discrepancy value of the maximal likelihood codeword with a predefined parameter controlling the trade-off between the error correction performance and the decoding complexity. We also derive an upper-bound of the word error rate (WER) for the proposed algorithm. The complexity analysis shows that our algorithm is faster than the conventional successive cancellation (SC) decoding algorithm in mid-to-high signal-to-noise ratio (SNR) situations and much faster than the SC list (SCL) decoding algorithm. Our addition of a list approach to our proposed algorithm further narrows the error correction performance gap between our TH-OSD and OSD. Our simulation results show that, with appropriate thresholds, our proposed algorithm achieves performance close to OSD’s while testing significantly fewer codewords than OSD, especially with low SNR values. Even a small list is sufficient for TH-OSD to match OSD’s error rate in short-code scenarios. The algorithm can be easily extended to longer code lengths.


2011 ◽  
Vol 5 (9) ◽  
pp. 1275-1285 ◽  
Author(s):  
M.T. Gamba ◽  
G. Masera

Sign in / Sign up

Export Citation Format

Share Document