Computer Science – Information Theory
Scientific paper
2011-03-14
Computer Science
Information Theory
Accepted by IEEE Transactions on Communications
Scientific paper
Full-rate STBC (space-time block codes) with non-vanishing determinants achieve the optimal diversity-multiplexing tradeoff but incur high decoding complexity. To permit fast decoding, Sezginer, Sari and Biglieri proposed an STBC structure with special QR decomposition characteristics. In this paper, we adopt a simplified form of this fast-decodable code structure and present a new way to optimize the code analytically. We show that the signal constellation topology (such as QAM, APSK, or PSK) has a critical impact on the existence of non-vanishing determinants of the full-rate STBC. In particular, we show for the first time that, in order for APSK-STBC to achieve non-vanishing determinant, an APSK constellation topology with constellation points lying on square grid and ring radius $\sqrt{m^2+n^2} (m,n\emph{\emph{integers}})$ needs to be used. For signal constellations with vanishing determinants, we present a methodology to analytically optimize the full-rate STBC at specific constellation dimension.
Guan Yong Liang
Ren Tian Peng
Yuen Chau
Zhang Er Yang
Zhou Yue
No associations
LandOfFree
Optimization of Fast-Decodable Full-Rate STBC with Non-Vanishing Determinants does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Optimization of Fast-Decodable Full-Rate STBC with Non-Vanishing Determinants, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimization of Fast-Decodable Full-Rate STBC with Non-Vanishing Determinants will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-258869