LDPC convolutional codes, also known as spatially coupled LDPC codes, have attracted considerable attention due to their promising properties. By coupling the protographs from different positions into a chain and terminating the chain properly, the resulting convolutional-like LDPC code ensemble is able to produce capacityachieving performance in the limit of large parameters. In addition, opti...

Convolutional codes over rings behave quite differently from convolutional codes over fields, but they are the ones best suited for phase modulation. This behavior depends strongly on the structure of the underlying ring. Some basic concepts about ring convolutional codes, in particular over Zpr , and their structural properties such as basicity, systematicity, non-catastrophicity and minimalit...

The difference between block codes and convolutional codes is the encoding principle. In the block codes, the information bits are followed by the parity bits. In convolutional codes the information bits are spread along the sequence. That means that the convolutional codes map information to code bits not block wise, but sequentially convolve the sequence of information bits according to some ...

In this paper, we study joint network/channel decoding for multi–source multi–relay heterogeneous wireless networks. When convolutional and network codes are used at the physical and network layers, respectively, we show that error correction and diversity properties of the whole network can be characterized by an equivalent and distributed convolutional network/channel code. In particular, it ...

A turbo decoding scheme for a noncoherent, unitary space-time modulated [3] communication system employing an FEC convolutional code is proposed. The channel is assumed to be Rayleigh fading with neither the transmitter nor the receiver knowing the channel coefficients. The convolutional encoder is applied to the information symbols before performing unitary spacetime coding. Treating the combi...

Abstract Error correcting codes can play a key role in improving the efficiency and reliability of wireless communications. Concatenated codes have the advantages that: 1) breaking the task into stages simplifies decoding, and 2) performance is good against clustered bit errors, fading and bursty interference. Reed-Solomon codes (maximum distance codes) have been popular as an outer code of con...

Finite State Machine (FSM) model is widely used in the construction of binary convolutional codes. If Z2 = {0, 1} is the binary mod-2 addition group and Z n 2 is the n-times direct product of Z2, then a binary convolutional encoder, with rate k n < 1 and memory m, is a FSM with Z2 as inputs group, Z n 2 as outputs group and Z m 2 as states group. The next state mapping ν : Z2⊕Z m 2 → Z m 2 is a...

QUAL COMM Israel. rror correction codes come in two flavors: block codes and convolutional codes. The most popular method of combining modulation and coding has been termed trellis coded modulation [ l ] (or more simply trellis codes). Pragmatic trellis codes were introduced in a previous IEEE Communications Magazine article [2] whereby the encoders and decoders for trellis codes were obtained ...

Yamada, Harashima, and Miyakawa proposed to use a trellis constructed based on a syndrome former for the purpose of Viterbi decoding of rate-(n − 1)/n convolutional codes. In this paper, we extend their code-trellis construction to general rate-k/n convolutional codes. We show that the extended construction is equivalent to the one proposed by Sidorenko and Zyablov. Moreover, we show that the p...

In this paper, we construct new sequences of asymptotically good convolutional codes (AGCC). These sequences are obtained from sequences of transitive, self-orthogonal and self-dual algebraic geometry (AG) codes attaining the Tsfasman-Vladut-Zink bound. Furthermore, by applying the techniques of expanding, extending, puncturing, direct sum, the 〈u|u+ v〉 construction and the product code constru...