In this paper we describe a new suboptimal decoding technique for linear codes based on the calculation of maximum weight basis of the code. The idea is based on estimating the maximum number locations in a codeword which have least probability of estimation error without violating the codeword structure. In this paper we discuss the details of the algorithm for a convolutional code. The error ...

There are several ways to use iterative decoding techniques with coded continuous phase modulation (CPM). This paper presents a method using parallel concatenation of convolutionally-coded CPM. All CPM schemes can be decomposed into a ring convolutional code and a memoryless signal mapper. This allows a properly designed convolutional code trellis to be combined with the CPM trellis, producing ...

A decoding rule is presented which minimizes the probability of symbol error over a time-discrete memoryless channel for any linear error-correcting code when the code words are equiprobable. The complexity of this rule varies inversely with code rate, making the technique particularly attractive for high rate codes. Examples are given for both block and convolutional codes.

Low-density parity-check (LDPC) codes, originally invented by Gallager in 1963, are now well-known for their good performances. Their convolutional counterpart was introduced by Felström and Zigangirov in 1999 and have already been shown to be able to achieve the Shannon capacity under low-complexity iterative decoding algorithms. In principle, the belief-propagation (BP) threshold of the convo...

Multi-Carrier Code Division Multiple Access (MC-CDMA) system performance is evaluated with Convolutional error control coding in this paper. Multiple antennas are used at transmitting and receiving side to improve the performance. Various types of equalization schemes are examined. 2x2 antennas considered and code rate of convolutional encoder is 1⁄2. AWGN and Rayleigh fading channel is conside...

Denote by w 0 the minimum average weight per edge over all nonzero cycles in the state diagram for a convolutional code, and assume that a technique is available for generating canonical parity-check matrices for codes with increasing degree m. The obtained class of codes is asymptotically catastrophic if w 0 approaches zero for large m. In this paper we prove the existence of convolutional cod...

This paper proposes an ICA-based MIMO-OFDM system which efficiently overcomes problems inherent to ICA by using a precise and robust signal reconstruction method. It exploits the predetermined characteristics introduced to transmitted signals by a convolutional encoder at the transmitter to solve permutation indeterminacy, amplitude scaling ambiguity and phase distortion. Since, the introduced ...

Sequential decoding algorithms decode convolutional codes by guessing their way through the expanding tree of possible transmitted sequences. In this way computational complexity is reduced. Generally it comes at the cost of having to communicate at rates distinctly below capacity. The computational cutoff rate Rcomp delineates the border between those rates for which the average decoding time ...

This paper deals with the problem of constructing superregular matrices that lead to MDP convolutional codes. These matrices are a type of lower block triangular Toeplitz matrices with the property that all the square submatrices that can possibly be nonsingular due to the lower block triangular structure are nonsingular. We present a new class of matrices that are superregular over a sufficien...

Convolutional codes over rings have been motivated by phase-modulated signals. Some structural properties of the generator matrices of such codes are presented. Successively stronger notions of invertibility of generator matrices are studied, and a new condition for a convolutional code over a ring to be systematic is given and shown to be equivalent to a condition given by Massey and Mittelhol...