This paper proposes an iterative detector for uncoded OFDM signals in cooperative networks, where the information symbols are simply partitioned through a time-domain matrix at the OFDM transmitter. We analytically show that our proposed iterative detector at the partner node converges and can completely recover the user's data from its partitioned version, if sufficient redundancy is inserted in the user's data. For efficient use of the redundancy in the user's data, a coded cooperative transmission based on superposition modulation is proposed. Additionally, a closed-form input-output relationship for the partitioning and reconstruction algorithm in the proposed cooperative scenario is derived. We also obtain closed-form expressions for symbol error rate performance of the proposed coded cooperative scenario over Rayleigh frequency-selective fading channels. Numerical comparisons shed light on the relative merits of the proposed coded cooperation under various inter-user and uplink channel conditions.
- Coded cooperative diversity
- iterative detection
- orthogonal frequency division multiplexing (OFDM) systems
ASJC Scopus subject areas
- Electrical and Electronic Engineering