Improved Coded Cooperation Schemes for Wireless Communications

Zhang, YY, Ma, Y and Tafazolli, R (2008) Improved Coded Cooperation Schemes for Wireless Communications

Full text not available from this repository.

Abstract

Cooperative communications can exploit distributed spatial diversity gain to improve link performance. When the message is coded at a low rate, source and relay can send different parts of a codeword to destination. This is referred to as the coded cooperation. In this paper, we propose two novel coded cooperation schemes for three-node relay networks, i.e., adaptive coded cooperation and ARQ-based coded cooperation. The former one needs the channel quality information available at source. The codeword splits adaptively to minimize the overall BER. The latter one is devised for relay network with erasure. In the first time slot, source sends a high-rate sub-codeword. Once destination reports the decoding errors, either source or relay can send one or two new bits selected from the mother codeword. Unlike random rateless erasure codes, such as Fountain code, the proposed scheme is based on the deterministic code generator and puncture pattern. It is experimentally shown that the proposed scheme can offer improved throughput in comparison with the conventional approach.

Item Type:	Conference or Workshop Item (UNSPECIFIED)
Divisions :	Surrey research (other units)
Authors :	Name Email ORCID Zhang, YY Ma, Y y.ma@surrey.ac.uk Tafazolli, R r.tafazolli@surrey.ac.uk
Date :	2008
Contributors :	Contribution Name Email ORCID publisher IEEE,
Uncontrolled Keywords :	DIVERSITY, NETWORKS
Depositing User :	Symplectic Elements
Date Deposited :	17 May 2017 12:00
Last Modified :	23 Jan 2020 17:30
URI:	http://epubs.surrey.ac.uk/id/eprint/833636

Actions (login required)

View Item

Downloads