By Topic

Adaptive distributed space-time block code with linear decoding complexity

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 $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

5 Author(s)
Shao Lan ; Wireless Signal Process. & Network Lab., Beijing Univ. of Posts & Telecommun., Beijing, China ; Wang Wenbo ; Wang Li ; Lin Yicheng
more authors

In this paper, an adaptive distributed space-time block code (ADSTBC) with linear decoding complexity is proposed. Within a group of candidate minimum-decoding-complexity quasi-orthogonal STBC (MDC-QO-STBC) codewords obtained by changing the row order of a basic one, the codeword that has minimum absolute value of interference between real symbols (IRS) in its equivalent channel correlation matrix is optimal and adopted by ADSTBC. In addition, for the optimal codeword's IRS absolute value is small enough to be ignored, linear decoding can achieve the performance of single complex symbol maximum-likelihood decoding, which is employed by MDC-QO-STBC, thus the decoding complexity is significantly reduced. The simulation results when the cooperative relays number is 4 and 3 both show the superiority of ASTBC over the normal DSTBC in the block error ratio performance and decoding complexity as well.

Published in:

Information, Computing and Telecommunication, 2009. YC-ICT '09. IEEE Youth Conference on

Date of Conference:

20-21 Sept. 2009