Approximate Joint MAP Detection of Co-Channel Signals

TL;DR

This paper introduces an approximate joint MAP detection algorithm for co-channel signals in multipath channels, leveraging a factor graph model to balance detection accuracy and computational feasibility.

Contribution

It proposes a novel approximation method for joint MAP detection based on factor graphs, reducing complexity while maintaining high detection performance.

Findings

The algorithm closely approximates the joint MAP detector.

It effectively handles co-channel signals in multipath environments.

The method offers a computationally feasible solution for practical receivers.

Abstract

We consider joint detection of co-channel signals---specifically, signals which do not possess a natural separability due to, for example, the multiple access technique or the use of multiple antennas. Iterative joint detection and decoding is a well known approach for utilizing the error correction code to improve detection performance. However, the joint maximum a posteriori probability (MAP) detector may be prohibitively complex, especially in a multipath channel. In this paper, we present an approximation to the joint MAP detector motivated by a factor graph model of the received signal. The proposed algorithm is designed to approximate the joint MAP detector as closely as possible within the computational capability of the receiver.