By Topic

Low complexity distributed STBCs with unitary relay matrices for any number of relays

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)
G. Susinder Rajan ; Atheros India, LLC, Chennai 600004, India ; B. Sundar Rajan

Jing and Hassibi introduced a distributed space time block coding scheme for symbol synchronous, coherent, amplify and forward relay networks with half duplex constrained relay nodes. In this two phase transmission scheme, the source transmits a vector of complex symbols to the relays during the first phase and each relay applies a pre-assigned unitary transformation to the received vector or its conjugate before transmitting it to the destination during the second phase. The destination then perceives a certain structured distributed space time block code (DSTBC) whose maximum likelihood (ML) decoding complexity in general, is very high. In this paper, explicit constructions of minimum delay, full diversity, four group ML decodable DSTBCs with unitary relay matrices are provided for even number of relay nodes. Prior constructions of DSTBCs with the same features were either limited to power of two number of relay nodes or had non-unitary relay matrices which leads to large peak to average power ratio of the relay's transmitted signals. For the case of odd number of relays, constructions of minimum delay, full diversity, two group ML decodable DSTBCs are given.

Published in:

2009 IEEE International Symposium on Information Theory

Date of Conference:

June 28 2009-July 3 2009