Iterative tree search algorithms like K-Best or sphere decoder algorithms are promising candidates for the upcoming wireless communications systems. In this paper a square root and division free Givens rotation (SDFG) algorithm is merged into a common sphere decoder algorithm to decrease the entire complexity. Furthermore, the algorithm is speeded up due to parallelizing the computation by taking the orthogonality of the real and imaginary parts of the complex transmit symbols into account.
Abstract-We consider distributed relaying networks using space-time block codes (STBC) to exploit cooperative diversity. In order to mitigate the impact of error propagation for DecodeForward (DF), an inter-relay cooperation (IRC) scheme is proposed that allows message exchanges between the relays based on punctured channel codes. Specifically, one of the error-free relays broadcasts punctured bits as side information to help failed relays to re-decode. Consequently, only relays capable of successful decoding transmit to the destination using STBC. Furthermore, an energy model for relays is introduced, so that the proposed IRC scheme can be evaluated with respect to throughput and energy consumptions for transmission, baseband and RF circuit at all relays. Simulation results show the superior performance using IRC, which should be properly designed under the influence of energy considerations.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.