Results 1  10
of
323,446
Iterative decoding of binary block and convolutional codes
 IEEE Trans. Inform. Theory
, 1996
"... Abstract Iterative decoding of twodimensional systematic convolutional codes has been termed “turbo ” (de)coding. Using loglikelihood algebra, we show that any decoder can he used which accepts soft inputsincluding a priori valuesand delivers soft outputs that can he split into three terms: the ..."
Abstract

Cited by 600 (43 self)
 Add to MetaCart
: the soft channel and a priori inputs, and the extrinsic value. The extrinsic value is used as an a priori value for the next iteration. Decoding algorithms in the loglikelihood domain are given not only for convolutional codes hut also for any linear binary systematic block code. The iteration
An Implementation of the Binary Blocking Flow Algorithm
, 1998
"... Goldberg and Rao recently devised a new binary blocking flow algorithm for computing maximum flows in networks with integer capacities. We describe an implementation of variants of the binary blocking flow algorithm geared towards practical efficiency and report on preliminary experimental result ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Goldberg and Rao recently devised a new binary blocking flow algorithm for computing maximum flows in networks with integer capacities. We describe an implementation of variants of the binary blocking flow algorithm geared towards practical efficiency and report on preliminary experimental
On Minimal Trellises of Linear Binary Block Codes
, 2002
"... This paper deals with the problem of searching and designing of minimal trellises for linear binary block codes (LBBC), from the generator matrices (GM). Minimal trellises could be used for soft decoding, especially in decoders which utilize the socalled Maximum Likelihood criterion, e.g. in decode ..."
Abstract
 Add to MetaCart
This paper deals with the problem of searching and designing of minimal trellises for linear binary block codes (LBBC), from the generator matrices (GM). Minimal trellises could be used for soft decoding, especially in decoders which utilize the socalled Maximum Likelihood criterion, e
Valgrind: A framework for heavyweight dynamic binary instrumentation
 In Proceedings of the 2007 Programming Language Design and Implementation Conference
, 2007
"... Dynamic binary instrumentation (DBI) frameworks make it easy to build dynamic binary analysis (DBA) tools such as checkers and profilers. Much of the focus on DBI frameworks has been on performance; little attention has been paid to their capabilities. As a result, we believe the potential of DBI ha ..."
Abstract

Cited by 545 (5 self)
 Add to MetaCart
Dynamic binary instrumentation (DBI) frameworks make it easy to build dynamic binary analysis (DBA) tools such as checkers and profilers. Much of the focus on DBI frameworks has been on performance; little attention has been paid to their capabilities. As a result, we believe the potential of DBI
Dryad: Distributed DataParallel Programs from Sequential Building Blocks
 In EuroSys
, 2007
"... Dryad is a generalpurpose distributed execution engine for coarsegrain dataparallel applications. A Dryad application combines computational “vertices ” with communication “channels ” to form a dataflow graph. Dryad runs the application by executing the vertices of this graph on a set of availa ..."
Abstract

Cited by 730 (27 self)
 Add to MetaCart
Dryad is a generalpurpose distributed execution engine for coarsegrain dataparallel applications. A Dryad application combines computational “vertices ” with communication “channels ” to form a dataflow graph. Dryad runs the application by executing the vertices of this graph on a set of available computers, communicating as appropriate through files, TCP pipes, and sharedmemory FIFOs. The vertices provided by the application developer are quite simple and are usually written as sequential programs with no thread creation or locking. Concurrency arises from Dryad scheduling vertices to run simultaneously on multiple computers, or on multiple CPU cores within a computer. The application can discover the size and placement of data at run time, and modify the graph as the computation progresses to make efficient use of the available resources. Dryad is designed to scale from powerful multicore single computers, through small clusters of computers, to data centers with thousands of computers. The Dryad execution engine handles all the difficult problems of creating a large distributed, concurrent application: scheduling the use of computers and their CPUs, recovering from communication or computer failures, and transporting data between vertices.
Extended Welch Inner Product Theorem for Systematic Binary Block Codes
"... A Simple extended Welch inner product theorem is investigated in this paper. Several functions to find the largest possible minimum Hamming distance of the systematic binary block codes are also derived by using the extended Welch inner product theorem. The results will be useful to estimate or desi ..."
Abstract
 Add to MetaCart
A Simple extended Welch inner product theorem is investigated in this paper. Several functions to find the largest possible minimum Hamming distance of the systematic binary block codes are also derived by using the extended Welch inner product theorem. The results will be useful to estimate
Performance of Interleaved NonBinary Block Codes Over Binary Channels with Memory
, 2007
"... The performance of ReedSolomon codes over two classes of binary channels with memory, the queuebased channel (QBC) and the GilbertElliott channel (GEC) is analyzed under the assumption of bounded distance decoding. In particular, we examine two interleaving strategies encountered when dealing wit ..."
Abstract
 Add to MetaCart
with nonbinary codes over a binary channel; namely, symbol interleaving and bit interleaving. An analytical proof is given demonstrating that perfect (i.e., with infinite interleaving depth) symbol interleaving results in a better performance compared to perfect bit interleaving for any nonbinary block
Nonparametric estimation of average treatment effects under exogeneity: a review
 REVIEW OF ECONOMICS AND STATISTICS
, 2004
"... Recently there has been a surge in econometric work focusing on estimating average treatment effects under various sets of assumptions. One strand of this literature has developed methods for estimating average treatment effects for a binary treatment under assumptions variously described as exogen ..."
Abstract

Cited by 597 (26 self)
 Add to MetaCart
Recently there has been a surge in econometric work focusing on estimating average treatment effects under various sets of assumptions. One strand of this literature has developed methods for estimating average treatment effects for a binary treatment under assumptions variously described
Good ErrorCorrecting Codes based on Very Sparse Matrices
, 1999
"... We study two families of errorcorrecting codes defined in terms of very sparse matrices. "MN" (MacKayNeal) codes are recently invented, and "Gallager codes" were first investigated in 1962, but appear to have been largely forgotten, in spite of their excellent properties. The ..."
Abstract

Cited by 741 (23 self)
 Add to MetaCart
. The decoding of both codes can be tackled with a practical sumproduct algorithm. We prove that these codes are "very good," in that sequences of codes exist which, when optimally decoded, achieve information rates up to the Shannon limit. This result holds not only for the binarysymmetric channel
The ratedistortion function for source coding with side information at the decoder
 IEEE Trans. Inform. Theory
, 1976
"... AbstractLet {(X,, Y,J}r = 1 be a sequence of independent drawings of a pair of dependent random variables X, Y. Let us say that X takes values in the finite set 6. It is desired to encode the sequence {X,} in blocks of length n into a binary stream*of rate R, which can in turn be decoded as a seque ..."
Abstract

Cited by 1055 (1 self)
 Add to MetaCart
AbstractLet {(X,, Y,J}r = 1 be a sequence of independent drawings of a pair of dependent random variables X, Y. Let us say that X takes values in the finite set 6. It is desired to encode the sequence {X,} in blocks of length n into a binary stream*of rate R, which can in turn be decoded as a
Results 1  10
of
323,446