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. We introduce the notion(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 propose a novel coding framework for wireless relay channels based on rateless codes, which allows for a natural extension to multiple antenna and multiple relay settings. The relaying protocol is half-duplex, and relays independently choose when to collaborate, if at all. With a simulated fountain code based implementation of this framework, we show(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)
We have developed an integrated suite of algorithms, statistical methods, and computer applications to support large-scale LC-MS-based gel-free shotgun profiling of complex protein mixtures using basic experimental procedures. The programs automatically detect and quantify large numbers of peptide peaks in feature-rich ion mass chromatograms, compensate for(More)
—We introduce the concept of convolutional factor graphs, which represent convolutional factorizations of mul-tivariate functions, just as conventional (multiplicative) factor graphs represent multiplicative factorizations. Convolutional and multiplicative factor graphs arise as natural Fourier transform duals. In coding theory applications, algebraic(More)