The LDPC codes are codes that approach optimal decoding performances, with an acceptable decoding computational cost ([1, 2, 3]). In this paper we present a class of quasi-cyclic LDPC codes and we show that we are able to guarantee some relevant properties of the codes. Experimentally, their decoding performance is comparable with the performance obtained by random LDPC codes. Traditionally, co...

Many communication channels accept as input binary strings and return output strings of the same length that have been altered in an unpredictable way. To compensate for these “errors”, redundant data is added to messages before they enter the channel. The task of a decoding algorithm is to reconstruct sent message(s) (i.e., to decode) the channel output. There are several critical attributes o...

We present an extended MPEG video format for efficient Dynamic Voltage Scaling (DVS). DVS technique has been widely researched, but the execution time variation of a periodic task (i.e. MPEG decoding) is still a challenge to be tackled. Unlike previous works, we focus on the data (video stream) rather than the execution code to overcome such limitation. The proposed video format provides the de...

Decoding high complexity is a major issue to design decode and forward (DF) relay protocol. Thus, the establishment of low decoding system would beneficial assist This paper reviews existing methods for min-sum based LDPC as system. Reference lists chosen articles were further reviewed associated publications. introduces comprehensive model representing describing developed DF It consists numbe...

This paper gives a new approach to decoding Hermite codes using the key equation, avoiding the use of majority voting. Our approach corrects up to (dmin − 1)/2 errors, and works up to some extent also beyond. We present an efficient implementation of our algorithm based on a Sugiyamatype iterative procedure for computing solutions of a key equation.

in this paper, we provide a blind adaptive channel estimation method for decoding of orthogonal space-time block codes (OSTBC), which is built on the minimizing of an unconstrained cost function. The global minima of the cost function are analyzed. Both LMS and RLS algorithm realizations are given. Our method can adaptively track the time varying channel and decode transferred symbols without p...

This paper deals with reduction of the transmission power usage in the wireless sensor networks. A system with FEC can provide an objective reliability using less power than a system without FEC. We propose to study LDPC codes to provide reliable communication while saving power in the sensor networks. As shown later, LDPC codes are more energy efficient than those that use BCH codes. Another m...

This paper deals with reduction of the transmission power usage in the wireless sensor networks. A system with FEC can provide an objective reliability using less power than a system without FEC. We propose to study LDPC codes to provide reliable communication while saving power in the sensor networks. As shown later, LDPC codes are more energy efficient than those that use BCH codes. Another m...

A fountain code produces for given set of k input symbols (x1, . . . , xk) a potentially limitless stream of output symbols z1, z2, . . .. The input and output symbols can be binary vectors of arbitrary length. Each output symbol is the sum of a randomly and independently chosen subset of the input symbols. Information describing the relations between input and output symbols is obtained at the...