Title :
Blind maximum-likelihood detection for decode-and-forward randomized distributed OSTBC
Author :
Chang, Tsung-Hui ; Ma, Wing-Kin ; Kuo, Chao-Yi ; Chong-Yung Chi
Author_Institution :
Dept. of Elec. Eng., Nat. Tsing Hua Univ., Hsinchu, Taiwan
Abstract :
This paper considers the randomized distributed orthogonal space-time block coding (DOSTBC) system proposed by Sirkeci-Mergen and Scaglione, and considers a situation where some of the cooperative relays can disconnect from the network during the data frame transmission. Such an event translates into abrupt changes of the virtual channel matrix at the receiver; and a coherent detector, which assumes that the virtual channel matrix is perfectly known and static, can be severely degraded in performance. We propose a blind maximum-likelihood (ML) detector and a non-intersecting subspace (NIS) code scheme for the randomized DOSTBC system. With a mild assumption on the transmission protocol, we show that the proposed blind ML detector is robust against the unexpected relay disconnection problem. Moreover, we show that the randomized NIS code scheme can achieve the maximum transmit diversity with the blind ML receiver. Some simulation results are presented to demonstrate the efficacy of the proposed method.
Keywords :
blind source separation; block codes; channel capacity; channel estimation; maximum likelihood detection; space-time codes; blind maximum-likelihood detection; coherent detector; decode-and-forward randomized distributed OSTBC; maximum transmit diversity; non-intersecting subspace code; randomized distributed orthogonal space-time block coding; virtual channel matrix; Block codes; Chaos; Degradation; Detectors; Frame relay; MIMO; Maximum likelihood decoding; Maximum likelihood detection; Protocols; Robustness; Blind ML detection; distributed space-time coding; maximum transmit diversity.; relay networks;
Conference_Titel :
Signal Processing Advances in Wireless Communications, 2009. SPAWC '09. IEEE 10th Workshop on
Conference_Location :
Perugia
Print_ISBN :
978-1-4244-3695-8
Electronic_ISBN :
978-1-4244-3696-5
DOI :
10.1109/SPAWC.2009.5161787