Abstract

This paper discusses the receiver design of a destination node supporting multiple antennas for an alternate-relaying decode-and-forward (DF) cooperative communication system. We exploit the structure of the received signal to develop an optimal data detection algorithm at the destination. It is shown that the optimal algorithm can be implemented by parallel detectors, each based on a family of Bahl, Cocke, Jelinek and Raviv (BCJR) algorithms. The proposed optimal algorithm requires to receive and store all packets before performing data detection. To avoid this, a sub-optimal algorithm is also proposed. Unlike the optimal algorithm, the sub-optimal one exploits two consecutive received packets to detect one packet. It turns out that the sub-optimal algorithm has less reduced delay, complexity, memory size and bandwidth loss with a slight increase of the bit-error-rate. The detection performance of the proposed algorithms is evaluated via Monte Carlo simulations, and the results demonstrate their effectiveness.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call