Combining methods of mathematical optimization theory and applications from communications engineering recently led to new approaches for error correction in data transmission systems. In this new discipline, also called LP decoding, researchers so far focussed on theoretical aspects. In this paper, we study how these new algorithms from mathematical theory can be accelerated using dedicated ha...

Image encoding decoding concept is studied by using the techniques of wavelet transformation, artificial neural network(ANN)and threshold value. The aforesaid techniques are useful in encoding and decoding. This process gives more ensured, a three leveled security to the images in three different terms. First is wavelet transformation. Second is encoding decoding keys along with weights of ANN ...

Similar to algebraic decoding schemes, the (23, 12, 7) Golay code can be decoded by applying the step-by-step decoding algorithm. In this work, a modified step-by-step algorithm for decoding the Golay code is presented. Logical analysis yielded a simple rule for directly determining whether a bit in the received word is correct. The computational complexity can be reduced significantly using th...

In this paper, a new procedure for decoding cyclic and BCH codes up to their actual minimum distance is presented. Previous algebraic decoding procedures for cyclic and BCH codes such as the Peterson decoding procedure and our procedure using nonrecurrent syndrome dependence relations can be regarded as special cases of this new decoding procedure. With the aid of a computer prokram, it has bee...

Decoding with feedback or iterative decoding is an eecient, low-complexity means for \informa-tion handover" in any parallel or serial concate-nated coding scheme and in related applications. Invented twenty years ago, it has recently been payed considerable attention in the context of \Turbo Codes". Iterative decoding has been jus-tiied intuitively, but many question remain and perhaps will re...

A pipeline decoder for woven convolutional codes (WCCs) is introduced. The decoding is performed iteratively by shifting a window over the received sequence. For the symbol–by–symbol a posteriori (s/s– APP) decoding of convolutional code segments, a windowed version of the BCJR algorithm is applied. This pipeline concept allows a trade–off between decoding delay, decoding complexity, and perfor...

We investigate joint network and channel coding schemes for networks when relay nodes are not capable of performing channel coding operations. Rather, channel encoding is performed at the source node while channel decoding is done only at the destination nodes. We examine three different decoding strategies: independent network-then-channel decoding, serial network and channel decoding, and joi...

In this paper, we define a stopping set of turbo codes with the iterative decoding in the binary erasure channel. Based on the stopping set analysis, we study the block and bit erasure probabilities of turbo codes and the performance degradation of the iterative decoding against the maximum-likelihood decoding. The error floor performance of turbo codes with the iterative decoding is dominated ...

We discuss soft-decision decoding which achieves nearmaximum likelihood decoding (MLD) of binary block codes over a Markov modulated channel. In this paper, a new soft-decision decoding algorithm using a generalized Expectation Maximization (EM) algorithm is proposed. Each iteration step of the proposed decoding algorithm can be regarded as performing MLD over an additive white Gaussian noise (...