Learn More
This paper stands at the intersection of two distinct lines of research. One line is “holographic algorithms,” a powerful approach introduced by Valiant for solving various counting problems in computer science; the other is “normal factor graphs,” an elegant framework proposed by Forney for representing codes defined on graphs.(More)
—In this letter, we present a new message-passing schedule for the decoding of low-density parity-check (LDPC) codes. This approach, designated " probabilistic schedule, " takes into account the structure of the Tanner graph (TG) of the code. We show by simulation that the new schedule offers a much better performance/complexity trade-off. This work also(More)
This paper studies the problem of Raptor-code design for binary-input AWGN (BIAWGN) channels using the mean-LLR-EXIT chart approach presented in [1]. We report that there exist situations where such a design approach may fail or fail to produce capacity-achieving codes, for certain ranges of channel SNR. Suggestions and discussions are provided pertaining(More)
We explore the use of rateless coding for communication over fading channels with delay constraints. Both quasi-static fading and block-fading channels are considered. When only the receiver has channel information, we show there exist rateless codes that are both reliable and efficient for every channel realization of such channels. We then apply these(More)
We consider the problem of reliable transmission of information over unknown AWGN channels using rateless codes and non-uniform modulation techniques. We show that Raptor codes and a form of non-uniform, high-order modulation allow for reliable communication at low SNR, with the ability to automatically adapt rate as the SNR increases. Simulation results(More)
In his recent work, Valiant presented a powerful family of new algorithms, which he calls holographic algorithms. The mathematical foundation of holographic algorithms is what is known as Holant Theorem. Synthesizing from Valiant's work, in this paper, we introduce the notion of Valiant transform for normal graphs. Exploiting this synthesis, we establish a(More)
— The highly stochastic nature of wireless environments makes it desirable to monitor link loss rates in wireless sensor networks. In a wireless sensor network, link loss monitoring is particularly supported by the data aggregation communication paradigm of network traffic: the data collecting node can infer link loss rates on all links in the network by(More)