Cart (Loading....) | Create Account
Close category search window
 

Fast antenna subset selection algorithms for multiple-input multiple-output relay 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
$31 $31
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)
Zhang, G. ; Fac. of Inf. Eng., Guangdong Univ. of Technol., Guangzhou, China ; Li, G. ; Qin, J.

The antenna subset selection technique balances the performance and hardware cost in the multiple-input multiple-output (MIMO) systems, and the problems on the antenna selection in MIMO relay systems have not been fully solved. This paper considers antenna selection on amplify-and-forward (AF) and decode-and-forward (DF) MIMO relay systems to maximise capacity. Since the optimal antenna selection algorithm has high complexity, two fast algorithms are proposed. The selection criterion of the algorithm for AF relay is to maximise a lower bound of the capacity, but not the exact capacity. This criterion reduces algorithmic complexity. The algorithm for DF relay is an extension of an existing antenna subset selection algorithm for one-hop MIMO systems. The authors show the derivations of the algorithms in detail, and analyse their complexity in terms of numbers of complex multiplications. Simulation results show that the proposed algorithms for both cases achieve comparable performance to the optimal algorithm under various conditions, and have decreased complexity.

Published in:

Communications, IET  (Volume:3 ,  Issue: 11 )

Date of Publication:

November 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.