By Topic

A* Algorithm Inspired Memory-Efficient Detection for MIMO Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ronald Y. Chang ; Research Center for Information Technology Innovation, Academia Sinica, Taipei, Taiwan ; Wei-Ho Chung ; Sian-Jheng Lin

Implementation of a best-first detection algorithm for multiple-input multiple-output (MIMO) systems requires large amounts of memory especially in large systems with high-order modulation. In this letter, we propose modified best-first detection algorithms in which the order of nodes is determined by both the original cost and the estimated future cost associated with each node, as inspired by an improved shortest path algorithm (A* algorithm). The modified algorithms maintain the detection optimality, reduce the memory requirement and sorting complexity, and achieve improved detection performance in memory-constrained scenarios.

Published in:

IEEE Wireless Communications Letters  (Volume:1 ,  Issue: 5 )