Close category search window
 

High-rate information-lossless linear dispersion STBCs from group algebra

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

2 Author(s)
Kiran, T. ; Dept. of Electr. Commun. Eng., Indian Inst. of Sci., Bangalore, India ; Rajan, B.S.

For multiple-input multiple-output (MIMO) channels, at high spectral efficiencies, space-time block codes (STBC) must be designed to maximize the mutual information between the transmit and receive signals. In an uncoiled scheme (spatial multiplexing or V-BLAST), it is well-known that the Gaussian input distribution maximizes the mutual information. Hassibi and Hochwald (2002) introduced a linear dispersion (LD) framework for designing space-time codes, wherein any transmit codeword is a linear combination of a fixed set of matrices called the weight matrices. A LD space-time block code is said to be information-lossless if it does not disturb the maximum mutual information between the transmit and receive signals. In other words, a MIMO scheme using information-lossless LD space-time block codes has the same capacity as the uncoded scheme. Through computer search, information-lossless LD codes with better diversity compared to the uncoded system were found by Hassibi et al., and also by Heath et al. (2002). We give a general algebraic construction of high-rate information-lossless STBC, both square and rectangular, by restricting the weight matrices to those which form a finite group under matrix multiplication.

Published in:
Global Telecommunications Conference, 2004. GLOBECOM '04. IEEE  (Volume:1 )

Date of Conference: 29 Nov.-3 Dec. 2004

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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.