Results 1  10
of
660,777
An Upper Bound on the Distribution of Computation of a Sequential Decoder for MultipleAccess Channels
, 1993
"... The computational distribution of sequential decoding for discrete memoryless multipleaccess channels is examined. It is shown that all possible collections of incorrect paths in the code tree may be described by bipartite graphs. Using this fact and a new decoding metric it is proved that the numb ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The computational distribution of sequential decoding for discrete memoryless multipleaccess channels is examined. It is shown that all possible collections of incorrect paths in the code tree may be described by bipartite graphs. Using this fact and a new decoding metric it is proved
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
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
Computation over MultipleAccess Channels
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2007
"... The problem of reliably reconstructing a function of sources over a multipleaccess channel is considered. It is shown that there is no sourcechannel separation theorem even when the individual sources are independent. Joint sourcechannel strategies are developed that are optimal when the structure ..."
Abstract

Cited by 142 (24 self)
 Add to MetaCart
sources over a Gaussian multipleaccess channel with a joint sourcechannel lattice code. Finally, computation codes are used to determine the multicast capacity of finite field multipleaccess networks, thus linking them to network coding.
Nested Transactions: An Approach to Reliable Distributed Computing
, 1981
"... Distributed computing systems are being built and used more and more frequently. This distributod computing revolution makes the reliability of distributed systems an important concern. It is fairly wellunderstood how to connect hardware so that most components can continue to work when others are ..."
Abstract

Cited by 527 (1 self)
 Add to MetaCart
Distributed computing systems are being built and used more and more frequently. This distributod computing revolution makes the reliability of distributed systems an important concern. It is fairly wellunderstood how to connect hardware so that most components can continue to work when others
Distributed Computing in Practice: The Condor Experience
 Concurrency and Computation: Practice and Experience
, 2005
"... Since 1984, the Condor project has enabled ordinary users to do extraordinary computing. Today, the project continues to explore the social and technical problems of cooperative computing on scales ranging from the desktop to the worldwide computational grid. In this chapter, we provide the history ..."
Abstract

Cited by 542 (7 self)
 Add to MetaCart
the history and philosophy of the Condor project and describe how it has interacted with other projects and evolved along with the field of distributed computing. We outline the core components of the Condor system and describe how the technology of computing must correspond to social structures. Throughout
A theory of communicating sequential processes
, 1984
"... A mathematical model for communicating sequential processes is given, and a number of its interesting and useful properties are stated and proved. The possibilities of nondetermimsm are fully taken into account. ..."
Abstract

Cited by 4135 (17 self)
 Add to MetaCart
A mathematical model for communicating sequential processes is given, and a number of its interesting and useful properties are stated and proved. The possibilities of nondetermimsm are fully taken into account.
Capacity of Fading Channels with Channel Side Information
, 1997
"... We obtain the Shannon capacity of a fading channel with channel side information at the transmitter and receiver, and at the receiver alone. The optimal power adaptation in the former case is "waterpouring" in time, analogous to waterpouring in frequency for timeinvariant frequencysele ..."
Abstract

Cited by 579 (23 self)
 Add to MetaCart
We obtain the Shannon capacity of a fading channel with channel side information at the transmitter and receiver, and at the receiver alone. The optimal power adaptation in the former case is "waterpouring" in time, analogous to waterpouring in frequency for timeinvariant frequency
Diversitymultiplexing tradeoff in multipleaccess channels
 IEEE Trans. Inform. Theory
, 2004
"... In a pointtopoint wireless fading channel, multiple transmit and receive antennas can be used to improve the reliability of reception (diversity gain) or increase the rate of communication for a fixed reliability level (multiplexing gain). In a multiple access situation, multiple receive antennas ..."
Abstract

Cited by 187 (4 self)
 Add to MetaCart
In a pointtopoint wireless fading channel, multiple transmit and receive antennas can be used to improve the reliability of reception (diversity gain) or increase the rate of communication for a fixed reliability level (multiplexing gain). In a multiple access situation, multiple receive antennas
SIS: A System for Sequential Circuit Synthesis
, 1992
"... SIS is an interactive tool for synthesis and optimization of sequential circuits. Given a state transition table, a signal transition graph, or a logiclevel description of a sequential circuit, it produces an optimized netlist in the target technology while preserving the sequential inputoutput b ..."
Abstract

Cited by 514 (41 self)
 Add to MetaCart
SIS is an interactive tool for synthesis and optimization of sequential circuits. Given a state transition table, a signal transition graph, or a logiclevel description of a sequential circuit, it produces an optimized netlist in the target technology while preserving the sequential input
Results 1  10
of
660,777