We study Low-Density Parity-Check (LDPC) codes with iterative decoding on block-fading (BF) Relay Channels. We consider two users that employ coded cooperation, a variant of decode-andforward with a smaller outage probability than the latter. An outage probability analysis for discrete constellations shows that full diversity can be achieved only when the coding rate does not exceed a maximum value that depends on the level of cooperation. We derive a new code structure by extending the previously published full-diversity root-LDPC code, designed for the BF point-to-point channel, to exhibit a rate-compatibility property which is necessary for coded cooperation. We estimate the asymptotic performance through a new density evolution analysis and the word error rate performance is determined for finite length codes. We show that our code construction exhibits near-outage limit performance for all block lengths and for a range of coding rates up to 0.5, which is the highest possible coding rate for two cooperating users.
Cooperative communications is a well known technique to yield transmit diversity in a multi-user environment. Network coding can increase the spectral efficiency in networks. These two techniques can be combined to achieve a double diversity order for a maximum coding rate Rc = 2/3 on the Multiple Access Relay Channel (MARC), where two sources share a common relay in their transmission to the destination. However, codes have to be carefully designed to obtain the intrinsic channel diversity. Up till now, no full-diversity capacity achieving code for the MARC at a coding rate Rc = 2/3 has been published. We present a strategy to produce excellent low-density parity-check (LDPC) codes with rate 2/3, i.e., exhibiting full-diversity and operating close to the outage probability limit. Simulation of the word error rate performance of the new proposed family of LDPC codes for the MARC confirms the full-diversity
The outage probability limit is a fundamental and achievable lower bound on the word error rate of coded communication systems affected by fading. This limit is mainly determined by two parameters: the diversity order and the coding gain. With linear precoding, full diversity on a block fading channel can be achieved without error-correcting code. However, the effect of precoding on the coding gain is not well known, mainly due to the complicated expression of the outage probability. Using a geometric approach, this paper establishes simple upper bounds on the outage probability, the minimization of which yields to precoding matrices that achieve very good performance. For discrete alphabets, it is shown that the combination of constellation expansion and precoding is sufficient to closely approach the minimum possible outage achieved by an i.i.d. Gaussian input distribution, thus essentially maximizing the coding gain.Index Terms-Block fading channels, multidimensional mapping, precoding, outage probability.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.