By Topic

Further reduced search for optimal diagonal space-time constellations from groups

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

2 Author(s)
Jun Li ; Sch. of Electron. & Inf., South China Univ. of Technol., Guangzhou, China ; Gang Wei

A reduced search algorithm for optimal diagonal space-time constellation is introduced. This algorithm reduces the computations by using the symmetrical attribute of the determinant distances, and by grouping the search space as a union of some equivalent classes. In an equivalent class, all of its elements will generate the same constellation set, in which there is exact one needed to be searched. As a result, the search are significantly reduced since no any repeatedly search is performed.

Published in:

PCCC 2005. 24th IEEE International Performance, Computing, and Communications Conference, 2005.

Date of Conference:

7-9 April 2005