Improved depth-first QRD-M detection algorithm for MIMO systems

被引:0
|
作者
机构
[1] Engineering Optimization and Smart Antenna Institute, Northeastern University at Qinhuangdao, Qinhuangdao, Hebei
[2] School of Information Science and Engineering, Northeastern University, Shenyang, Liaoning
来源
Liu, L. | 1600年 / Asian Network for Scientific Information卷 / 12期
基金
中国国家自然科学基金;
关键词
Depth-first search; MEMO; ML detection; QRD-M;
D O I
10.3923/itj.2013.8015.8019
中图分类号
学科分类号
摘要
Maximum Likelihood (ML) detection algorithm has the optimal Bit Error Rate (BER) performance and the highest calculating complexity in Multiple-Input Multiple-Output (MIMO) system especially with high numbers of transmit antenna and modulation order. QR decomposition with M-algorithm (QRD-M) has been proofed to provide near ML detection performance. QRD-M algorithm reduces the complexity by selecting M candidates with the smallest accumulated metrics at each level of the tree search. To achieve near-ML detection performance, M should be set as large as the constellation size which results the increasing of calculating complexity. If reducing candidate branch, the detection performance will become worse. An improved detection scheme, depth-first QRD-M detection algorithm, is presented here. By jointing depth-first search method with QRD-M, the proposed algorithm can provide better tradeoff options by selecting parameters at different values and simulation results show the validity of proposed algorithm. © 2013 Asian Network for Scientific Information.
引用
收藏
页码:8015 / 8019
页数:4
相关论文
共 36 条
  • [21] An optimal algorithm for finding depth-first spanning tree on permutation graphs
    Sukumar Mondal
    Madhumangal Pal
    Tapan K. Pal
    Korean Journal of Computational & Applied Mathematics, 1999, 6 (3) : 493 - 500
  • [22] Concurrent depth-first search algorithms based on Tarjan's Algorithm
    Lowe, Gavin
    INTERNATIONAL JOURNAL ON SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER, 2016, 18 (02) : 129 - 147
  • [23] Concurrent depth-first search algorithms based on Tarjan’s Algorithm
    Gavin Lowe
    International Journal on Software Tools for Technology Transfer, 2016, 18 : 129 - 147
  • [24] A linear time algorithm for finding depth-first spanning trees on trapezoid graphs
    Chen, HC
    Wang, YL
    INFORMATION PROCESSING LETTERS, 1997, 63 (01) : 13 - 18
  • [25] Enhancing artificial bee colony algorithm with depth-first search and direction information
    Zhou X.
    Tang H.
    Wu S.
    Wang M.
    International Journal of Wireless and Mobile Computing, 2024, 27 (01) : 1 - 12
  • [26] OPTIMIZATION OF THE EVACUATION ROUTE IN CHEMICAL PLANTS BASED ON THE DEPTH-FIRST SEARCH ALGORITHM
    Liu, Ying
    You, Zuoling
    Wang, Fa
    Zhang, Yunrui
    Zhang, Bo
    ENVIRONMENTAL ENGINEERING AND MANAGEMENT JOURNAL, 2020, 19 (12): : 2187 - 2196
  • [27] Improving Depth-First Search Algorithm of VLSI Wire Routing with Pruning and Iterative Deepening
    Deng, Xinguo
    Yao, Yangguang
    Chen, Jiarui
    EMERGING RESEARCH IN ARTIFICIAL INTELLIGENCE AND COMPUTATIONAL INTELLIGENCE, 2011, 237 : 100 - +
  • [28] Multi-level Block Information Extraction in Engineering Drawings Based on Depth-first Algorithm
    Zhang, Jiayi
    Zhao, Longfei
    Hao, Yongping
    AUTOMATION EQUIPMENT AND SYSTEMS, PTS 1-4, 2012, 468-471 : 2100 - 2103
  • [29] Intelligent toy tracking trajectory design based on mobile cloud terminal deployment and depth-first search algorithm
    Zhang, Yang
    Zhang, Hu
    PEERJ COMPUTER SCIENCE, 2024, 10
  • [30] Segmentation of pectoral muscle from digital mammograms with depth-first search algorithm towards breast density classification
    Pawar, Shivaji D.
    Sharma, Kamal Kr.
    Sapate, Suhas G.
    Yadav, Geetanjali Y.
    BIOCYBERNETICS AND BIOMEDICAL ENGINEERING, 2021, 41 (03) : 1224 - 1241