Skoglund, "Bilayer LDPC
convolutional codes for decode-and-forward relaying," IEEE Trans.
Keywords:
convolutional codes, power, register exchange, traceback, viterbi decoder
If the polynomial-based generator matrices of a k/n
convolutional code and the dual code are G(D) and H(D), respectively, we have [16]
Convolutional codes are one of the most important ECC techniques.
Since DVBRCS applications involve the transmission of data using various block sizes and coding rates, the coding scheme has to be very flexible, with better performance than the classical concatenation of a
convolutional code and a Reed-Solomon code (Douillard et al., 2000).
The Viterbi algorithm (VA) is known as a maximum likelihood (ML)-decoding algorithm for
convolutional codes. Maximum likelihood decoding means finding the code branch in the code trellis that was most likely to be transmitted.[2] Therefore, maximum likelihood decoding is based on calculating the hamming distance for each branch forming encode word.
Hagenauer, Rate-compatible punctured
convolutional codes (RCPC codes) and their applications, IEEE Trans.
Coded modulation outperforms conventional modulations because the set partition and
convolutional code are chosen in such a way as to increase the distance between channel sequences while maintaining the same average transmission power.
Convolutional code (CC) was first introduced by Elias in 1955 as stand by to block codes.
In this paper we consider joint network-channel coding for multiple-access relay channel when the transmitting node employs Reed-Solomon (RS code) error correcting code and punctured recursive systematic
convolutional code (RSCC) is used as network code.
We assumed that a tail-biting
convolutional code (CC) is used and the SNR values can be determined for the respective modulation scheme and coding rate as shown in Table 1 [2].