Results 1 
8 of
8
HighRate, SingleSymbol ML Decodable Precoded DSTBCs for Cooperative Networks
"... Abstract—Distributed orthogonal space–time block codes (DOSTBCs) achieving fulldiversity order and singlesymbol maximumlikelihood (ML) decodability have been introduced recently by Yi and Kim for cooperative networks, and an upper bound on the maximal rate of such codes along with code constructi ..."
Abstract

Cited by 12 (8 self)
 Add to MetaCart
(Show Context)
Abstract—Distributed orthogonal space–time block codes (DOSTBCs) achieving fulldiversity order and singlesymbol maximumlikelihood (ML) decodability have been introduced recently by Yi and Kim for cooperative networks, and an upper bound on the maximal rate of such codes along with code constructions has been presented. In this paper, a new class of singlesymbol ML decodable precoded distributed space–time block codes (SSDPDSTBCs) called semiorthogonal SSDPDSTBCs (semiSSDPDSTBCs) is introduced wherein, the source performs linear precoding of information symbols appropriately before transmitting it to all the relays. It is shown that DOSTBCs are a special case of semiSSDPDSTBCs. A special class of semiSSDPDSTBCs having diagonal covariance matrix at the destination is studied and an upper bound on the maximal rate of such codes is derived. The bounds obtained
Single RealSymbol Decodable, HighRate, Distributed SpaceTime Block Codes
"... Abstract — A scheme to apply the rate1 real orthogonal designs (RODs) in relay networks with single realsymbol decodability of the symbols at the destination for any arbitrary number of relays is proposed. In the case where the relays do not have any information about the channel gains from the so ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
Abstract — A scheme to apply the rate1 real orthogonal designs (RODs) in relay networks with single realsymbol decodability of the symbols at the destination for any arbitrary number of relays is proposed. In the case where the relays do not have any information about the channel gains from the source to themselves, the best known distributed space time block codes (DSTBCs) for k relays with single realsymbol decodability offer 2 2+k an overall rate of complex symbols per channel use. The scheme proposed in this paper offers an overall rate of 1/4 complex symbol per channel use, which is independent of the number of relays. Furthermore, in the scenario where the relays have partial channel information in the form of channel phase knowledge, the best known DSTBCs with single realsymbol
Are Hjørungnes, ”HighRate, Distributed TrainingEmbedded Complex Orthogonal Designs for Relay Networks,” submitted to IEEE Information theory workshop 2010
"... Abstract — Distributed SpaceTime Block Codes (DSTBCs) from Complex Orthogonal Designs (CODs) (both square and nonsquare CODs other than the Alamouti design) are known to lose their singlesymbol ML decodable (SSD) property when used in twohop wireless relay networks using amplify and forward prot ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract — Distributed SpaceTime Block Codes (DSTBCs) from Complex Orthogonal Designs (CODs) (both square and nonsquare CODs other than the Alamouti design) are known to lose their singlesymbol ML decodable (SSD) property when used in twohop wireless relay networks using amplify and forward protocol. For such a network, in this paper, a new class of high rate, trainingembedded (TE) SSD DSTBCs are constructed from TECODs. The proposed codes include the training symbols in the structure of the code which is shown to be the key point to obtain high rate as well as the SSD property. TECODs are shown to offer fulldiversity for arbitrary complex constellations. Nonsquare TECODs are shown to provide higher rates (in symbols per channel use) compared to the known SSD DSTBCs for relay networks with number of relays less than 10. I. INTRODUCTION AND PRELIMINARIES
TrainingEmbedded Complex Orthogonal Designs (TECODs)
"... Abstract — Recently, a special class of complex designs called ..."
(Show Context)
TrainingSymbol Embedded, HighRate Complex Orthogonal Designs for Relay Networks
"... Abstract — Distributed SpaceTime Block Codes (DSTBCs) from Complex Orthogonal Designs (CODs) (both square and nonsquare CODs other than the Alamouti design) are known to lose their singlesymbol ML decodable (SSD) property when used in twohop wireless relay networks using the amplify and forward ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract — Distributed SpaceTime Block Codes (DSTBCs) from Complex Orthogonal Designs (CODs) (both square and nonsquare CODs other than the Alamouti design) are known to lose their singlesymbol ML decodable (SSD) property when used in twohop wireless relay networks using the amplify and forward protocol. For such a network, a new class of high rate, trainingsymbol embedded (TSE) SSD DSTBCs are proposed from TSECODs. The constructed codes include the training symbols within the structure of the code which is shown to be the key point to obtain high rate along with the SSD property. TSECODs are shown to offer fulldiversity for arbitrary complex constellations. Nonsquare TSECODs are shown to provide better rates (in symbols per channel use) compared to the known SSD DSTBCs for relay networks when the number of relays is less than 10. Importantly, the proposed DSTBCs do not contain zeros in their
Abstract — SingleSymbol Maximum Likelihood (ML) decodable Distributed Orthogonal SpaceTime Block Codes (DOST
"... BCs) have been introduced recently for cooperative networks and an upperbound on the maximal rate of such codes along with code constructions has been presented. In this paper, we introduce a new class of Distributed SpaceTime Block Codes (DSTBCs) called Semiorthogonal Precoded Distributed Single ..."
Abstract
 Add to MetaCart
(Show Context)
BCs) have been introduced recently for cooperative networks and an upperbound on the maximal rate of such codes along with code constructions has been presented. In this paper, we introduce a new class of Distributed SpaceTime Block Codes (DSTBCs) called Semiorthogonal Precoded Distributed SingleSymbol Decodable SpaceTime Block Codes (SemiSSDPDSTBCs) wherein, the source performs precoding on the information symbols before transmitting it to all the relays. A set of necessary and sufficient conditions on the relay matrices for the existence of SemiSSDPDSTBCs is proved. It is shown that the DOSTBCs are a special case of SemiSSDPDSTBCs. A subset of SemiSSDPDSTBCs having diagonal covariance matrix at the destination is studied and an upper bound on the maximal rate of such codes is derived. The bounds obtained are approximately twice larger than that of the DOSTBCs. A systematic construction of Semi
DSTBCs for Cooperative Networks
, 2007
"... Distributed Orthogonal SpaceTime Block Codes (DOSTBCs) achieving full diversity order and singlesymbol ML decodability have been introduced recently for cooperative networks and an upperbound on the maximal rate of such codes along with code constructions has been presented. In this report, we in ..."
Abstract
 Add to MetaCart
(Show Context)
Distributed Orthogonal SpaceTime Block Codes (DOSTBCs) achieving full diversity order and singlesymbol ML decodability have been introduced recently for cooperative networks and an upperbound on the maximal rate of such codes along with code constructions has been presented. In this report, we introduce a new class of Distributed STBCs called Semiorthogonal Precoded Distributed SingleSymbol Decodable STBCs (SPDSSDC) wherein, the source performs coordinate interleaving of information symbols appropriately before transmitting it to all the relays. It is shown that DOSTBCs are a special case of SPDSSDCs. A special class of SPDSSDCs having diagonal covariance matrix at the destination is studied and an upper bound on the maximal rate of such codes is derived. The bounds obtained are approximately twice larger than that of the DOSTBCs. A systematic construction of SPDSSDCs is presented when the number of relays K ≥ 4. The constructed codes are shown to achieve the upperbound on the rate when K is of the form 0 modulo 4 or 3 modulo 4. For the rest of the values of K, the constructed codes are shown to have rates higher than that of DOSTBCs. It is also shown that SPDSSDCs cannot be constructed with any form of linear processing at the relays when the source doesn’t perform coordinate interleaving of the information symbols.
1 High Rate SingleSymbol ML Decodable Precoded DSTBCs for Cooperative Networks
, 709
"... Distributed Orthogonal SpaceTime Block Codes (DOSTBCs) achieving full diversity order and singlesymbol ML decodability have been introduced recently by Yi and Kim for cooperative networks and an upperbound on the maximal rate of such codes along with code constructions has been presented. In this ..."
Abstract
 Add to MetaCart
(Show Context)
Distributed Orthogonal SpaceTime Block Codes (DOSTBCs) achieving full diversity order and singlesymbol ML decodability have been introduced recently by Yi and Kim for cooperative networks and an upperbound on the maximal rate of such codes along with code constructions has been presented. In this paper, we introduce a new class of Distributed STBCs called Semiorthogonal Precoded Distributed SingleSymbol Decodable STBCs (SPDSSDC) wherein, the source performs coordinate interleaving of information symbols appropriately before transmitting it to all the relays. It is shown that DOSTBCs are a special case of SPDSSDCs. A special class of SPDSSDCs having diagonal covariance matrix at the destination is studied and an upperbound on the maximal rate of such codes is derived. The bounds obtained are approximately twice larger than that of the DOSTBCs. A systematic construction of SPDSSDCs is presented when the number of relays K ≥ 4. The constructed codes are shown to achieve the upperbound on the rate when K is of the form 0 or 3 modulo 4. For the rest of the values of K, the constructed codes are shown to have rates higher than that of DOSTBCs. It is shown that SPDSSDCs cannot be constructed with any form of linear processing at the relays when the source doesn’t perform coordinate interleaving of the information symbols. Simulation result shows that SPDSSDCs have better probability of error performance than that of DOSTBCs.