Stopping Rule-Based Iterative Tree Search for Low-Complexity Detection in MIMO Systems
Breadth first tree search (BFTS) algorithms are known to provide a close to maximum likelihood (quasi-ML) solution at a low-complexity if the received sequence is detected in the right sequence order. However, finding the right sequence order has an exponential overhead. In view of this, we propose to repeatedly apply a BFTS algorithm to all sequence orders. Since it will test all the orders, it is expected to achieve quasi-ML performance. However, this will increase the complexity because of redundant iterations. The complexity can be reduced if we can stop the iterations as soon as a quasi-ML solution is achieved. For this, we propose two stopping rules, one relies on a constellation based heuristic and the other one uses the distribution of ML cost. It is found that their complexity curves have a cross-over point. Thus, a combination of the two rules provides a quasi-ML error performance at a low-complexity for uncoded as well as coded systems. We further show that the proposed stopping rule can reduce the complexity of depth first tree search algorithms also. Last, for large MIMO systems, compared with existing algorithms, it is found to be exceptionally better in terms of both error performance and complexity.
유료 다운로드의 경우 해당 사이트의 정책에 따라 신규 회원가입, 로그인, 유료 구매 등이 필요할 수 있습니다. 해당 사이트에서 발생하는 귀하의 모든 정보활동은 NDSL의 서비스 정책과 무관합니다.
원문복사신청을 하시면, 일부 해외 인쇄학술지의 경우 외국학술지지원센터(FRIC)에서
무료 원문복사 서비스를 제공합니다.
NDSL에서는 해당 원문을 복사서비스하고 있습니다. 위의 원문복사신청 또는 장바구니 담기를 통하여 원문복사서비스 이용이 가능합니다.
- 이 논문과 함께 출판된 논문 + 더보기