JOURNAL ARTICLE

Distributed orthogonal space-time coding with relay selection

Abstract

In this paper we employ relay selection in two-hop distributed orthogonal space time coding system. The proposed system has a single source, a single destination, and N relays. In the second hop, before transmitting signal to destination the best two relays out of N relays are selected based on the instantaneous channel conditions between the source and relays. This simple technique of relay selection can improve the end to end bit error performance of system without any increase in the total transmission power of the network and without any added complexity to the decoding process at the receiver side. The bit error performance (BER) of the proposed system is examined using computer simulation. The results show that a gain of about 3 dB at BER=10 −2 is achieved by selecting the best two relays out of three. Further improvement in the BER performance can be achieved by increasing the number of relays N. However, no significant improvement in BER performance can be observed by increasing the number of relays N beyond 8.

Keywords:
Relay Decoding methods Computer science Bit error rate Hop (telecommunications) Coding gain Coding (social sciences) Space–time code Selection (genetic algorithm) Algorithm Transmission (telecommunications) Electronic engineering Real-time computing Power (physics) Telecommunications Mathematics Engineering Block code Statistics Artificial intelligence Physics

Metrics

1
Cited By
0.37
FWCI (Field Weighted Citation Impact)
17
Refs
0.61
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Cooperative Communication and Network Coding
Physical Sciences →  Computer Science →  Computer Networks and Communications
Advanced Wireless Communication Technologies
Physical Sciences →  Engineering →  Electrical and Electronic Engineering
Full-Duplex Wireless Communications
Physical Sciences →  Engineering →  Electrical and Electronic Engineering
© 2026 ScienceGate Book Chapters — All rights reserved.