Low-Complexity Detection And Performance Analysis For Decode-And-Forward Relay Networks

We re-examine the problem of designing low-complexity detectors and their performance analysis for the 3-node one-way decode-and-forward (DF) relay network, where the destination has the statistical channel state information (CSI) of the source-relay link, and the instantaneous CSI of both the source-destination and relay-destination links Recently proposed detection schemes, such as the piece-wise linear detector (PLD), achieve near-optimal error performance with linear complexity (with respect to the modulation size). In this paper, we propose two new detectors with near-optimal error performance. One has linear complexity for general modulations and the other has constant complexity for PAM signals. Additionally, an algorithm for computing the upper bound on the symbol en-or rate (SER) of the new detectors for the static source-destination and relay-destination links is proposed. Simulation results are presented to verify the efficiency of the proposed detectors and the tightness of the proposed SER bound.