Probabilistic Sorting Memory Constrained Tree Search Algorithm for MIMO System

Considering the shortcomings of large storage space requirements and high complexity in multiple-symbol differential detection algorithm in current Multiple Input Multiple Output (MIMO) system, this paper proposes a probabilistic sorting memory constrained tree search algorithm (PSMCTS) by using performance advantage of sorting algorithm and storage advantage of memory constrained tree search (MCTS). Based on PSMCTS, a pruning PSMCTS named PPSMCTS is put forward. Simulation results show that the performance of PSMCTS is approach to that of ML algorithm under fixed memory situations, while the computational complexity is lower than that of MCTS algorithm in small storage capacity conditions under low signal noise ratio (SNR) region. PPSMCTS has more prominent advantages on reduction of computational complexity than PSMCTS algorithm. Theoretical analysis and simulation demonstrate that the two proposed algorithms can effectively inherit the good feature of MCTS algorithm, which are suitable for hardware implementation.

[1]  John R. Barry,et al.  Reduced-Complexity MIMO Detection via a Slicing Breadth-First Tree Search , 2017, IEEE Transactions on Wireless Communications.

[2]  Wei-Ho Chung,et al.  Best-First Tree Search with Probabilistic Node Ordering for MIMO Detection: Generalization and Performance-Complexity Tradeoff , 2012, IEEE Transactions on Wireless Communications.

[3]  S. Wang,et al.  Research on low-complexity breadth-first detection for multiple-symbol differential unitary space-time modulation systems , 2011, IET Commun..

[4]  Zhiyuan Yan,et al.  Memory-Constrained Tree Search Detection and New Ordering Schemes , 2009, IEEE Journal of Selected Topics in Signal Processing.

[5]  Inkyu Lee,et al.  A New Reduced Complexity ML Detection Scheme for MIMO Systems , 2010, 2009 IEEE International Conference on Communications.

[6]  L. Lampe,et al.  A new stopping criterion for the Sphere Decoder in UWB impulse-radio multiple-symbol differential detection , 2009, 2009 IEEE International Conference on Ultra-Wideband.

[7]  Andreas Schenk,et al.  A stopping radius for the sphere decoder: Complexity reduction in multiple-symbol differential detection , 2010, 2010 International ITG Conference on Source and Channel Coding (SCC).

[8]  Tae-Hwan Kim,et al.  High-Throughput and Area-Efficient MIMO Symbol Detection Based on Modified Dijkstra's Search , 2010, IEEE Transactions on Circuits and Systems I: Regular Papers.

[9]  Tatsuki Fukuda,et al.  An appropriate radius for reduced-complexity sphere decoding , 2010, 2010 International Conference on Communications, Circuits and Systems (ICCCAS).

[10]  Yuanyuan Gao,et al.  Error rates calculation and performance analysis of (2,1) STBC systems , 2004, Proceedings 7th International Conference on Signal Processing, 2004. Proceedings. ICSP '04. 2004..

[11]  Chintha Tellambura,et al.  On Multiple Symbol Detection for Diagonal DUSTM Over Ricean Channels , 2008, IEEE Transactions on Wireless Communications.

[12]  Ruey-Yi Wei.  Differential Encoding by a Look-Up Table for Quadrature-Amplitude Modulation , 2011, IEEE Transactions on Communications.

[13]  Chintha Tellambura,et al.  Bound-intersection detection for multiple-symbol differential unitary space-time modulation , 2005, IEEE Transactions on Communications.

[14]  Mark Zwolinski,et al.  A Survey of VLSI Implementations of Tree Search Algorithms for MIMO Detection , 2016, Circuits Syst. Signal Process..

[15]  Novica Nosovic,et al.  Dijkstra's shortest path algorithm serial and parallel execution performance analysis , 2012, 2012 Proceedings of the 35th International Convention MIPRO.

[16]  Philip Schniter,et al.  On the robustness of decision-feedback detection of DPSK and differential unitary space-time modulation in Rayleigh-fading channels , 2004, IEEE Transactions on Wireless Communications.

[17]  Wei-Ho Chung,et al.  Efficient Tree-Search MIMO Detection with Probabilistic Node Ordering , 2011, 2011 IEEE International Conference on Communications (ICC).

[18]  Abhay Kumar Sah,et al.  Stopping Rule-Based Iterative Tree Search for Low-Complexity Detection in MIMO Systems , 2017, IEEE Transactions on Wireless Communications.

[19]  Haige Xiang,et al.  Adjustable Reduced Metric-First Tree Search , 2011, 2011 7th International Conference on Wireless Communications, Networking and Mobile Computing.