However, in order to achieve the code detection and parameter estimation at the same time, the allowable parameter estimation range is strictly limited.
The authors [32] used multi-core CPU and GPU platforms to achieve the coding of parallel processing.
At the destination, the soft information is first combined and then iterative decoding is performed for GLD codes to achieve the coding gain and diversity gain.
Specially, in certain case, the MLS schemes can be inferior to the MMLS schemes even if the MLS schemes always achieve the coding gain over the T-BRS.
In order to achieve the coded-cooperative diversity, many distributed coding schemes have been reported in the literature such as the convolutional codes [10,11], distributed space-time coding [12,13], distributed low-density parity-check codes (D-LDPC) [14,15] and distributed turbo codes (DTC) [16,17] and more recently the polar codes [18,19].
The POSD 1,3) decoding with the 183 test error patterns achieves the coding gain of 17 dB over an uncoded system, the coding gain of 4 dB over ISD(2) with the 137 test error patterns, while it has the same BER as OSD 3)with the 697 test error patterns.
The code bits for the two encoders are alternatively punctured to achieve the desired code rate R = 1/2.
Let us consider a GLDPC-Staircase code rate r G. Several values of the base code rate r L, or equivalently of E, enable to achieve the global code rate r G (see Eq. (8)).
We do this both for simple decoders (which are fast but commonly require larger code lengths) and for joint decoders (which may be slower but achieve the best code lengths).
First, the Slepian-Wolf theorem states that SW coding can achieve the same coding performance asymptotically.
