In this study, the authors propose a full-rate distributed space–time block code (D-STBC) that can operate on an arbitrary number of available relaying nodes which generates minimal network overhead when incorporating additional relaying nodes into transmission stream. The proposed D-STBC also does not require any coordination among participating relaying nodes to share any information among each other. The design of the code allows for single-symbol decoding complexity which is not always possible in other D-STBC’s when the number of relaying nodes increases. The proposed D-STBC requires a minimum of two participating relaying nodes and because of anonymity among the relaying nodes to each the addition or removal of relaying nodes can be done with ease without disrupting the transmission. They present empirical results in this study to support these claims of the proposed code.
محمد طه عمر الاسطل | Mohammed Taha O. El Astal | 6833