Learn More
Models for noncoherent error control in random linear network coding (RLNC) and store and forward (SAF) have been recently proposed. In this paper, we model different types of random network communications as the transmission of flats of matroids. This novel framework encompasses RLNC and SAF and allows us to introduce a novel protocol, referred to as(More)
— We introduce a wide class of LDPC codes, large enough to include LDPC codes over finite fields, rings or groups as well as some non-linear codes. A belief propagation decoding procedure with the same complexity as for the decoding of LDPC codes over finite fields is also presented. Moreover, an encoding procedure is developed.
In this paper, a new, efficient class of blind equalization algorithms is proposed for use in high-order, two-dimensional digital communication systems. We have called this family: the Constant Norm Algorithms (CNA). This family is derived in the context of Bussgang techniques. Therefore, the resulting algorithms are very simple. We show that some(More)
In this paper, we analyze the behavior of the Weighted Decision Feedback Equalizer (WDFE), mainly from filtering properties aspects. This equalizer offers the advantage of limiting the error propagation phenomenon. It is well known that this problem is the main drawback of Decision Feedback Equalizers (DFEs), and due to this drawback DFEs are not used very(More)
In the context of blind equalization, a new class of Bussgang techniques called Constant Norm Algorithm (CNA), which contains the well-known CMA, is developed. From this class, two new cost functions designed for QAM modulation are derived. The first, named CQA for Constant sQuare Algorithm, is better adapted for QAM than the CMA. It results in a lower(More)
A markovian model of the error probability density for decision feedback equalizer is proposed and its application to the error propagation probability computation is derived. The model is a generalization of the Lütkemeyer and Noll model proposed in [1]. It is obtained by the analysis of the gaussian mixture distribution of the errors which follows a(More)
Advancements in channel coding theory over the past decades have been accomplished considering simple channel such as Additive White Gaussian Noise channels. Much less is known about the consequences when the standard Gaussian assumption is not fulfilled in realistic environments and, more importantly, the appropriate countermeasures. This paper studies and(More)
—In this paper, we introduce a novel approach to correct packet errors and packet losses in store and forward by using binary error-correcting codes. Using a framework similar to what has been proposed for error control in random linear network coding, we investigate error control under two scenarios. First, we show that the Hamming metric is suitable for(More)
The coverage problem is one of the most concerns in Wireless Sensor Networks (WSN). Many coverage algorithms are found in literature suppose that nodes are localizable or rely on a specific probability distribution to be located. In this paper, we assume that the nodes are randomly distributed, and their location is unknown. A new test for hole detection in(More)