Results 1  10
of
3,001
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 1060 (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
Practical Network Coding
, 2003
"... We propose a distributed scheme for practical network coding that obviates the need for centralized knowledge of the graph topology, the encoding functions, and the decoding functions, and furthermore obviates the need for information to be communicated synchronously through the network. The resu ..."
Abstract

Cited by 462 (15 self)
 Add to MetaCart
We propose a distributed scheme for practical network coding that obviates the need for centralized knowledge of the graph topology, the encoding functions, and the decoding functions, and furthermore obviates the need for information to be communicated synchronously through the network
Factor Graphs and the SumProduct Algorithm
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 1998
"... A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple c ..."
Abstract

Cited by 1791 (69 self)
 Add to MetaCart
A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple
Overview of the scalable video coding extension of the H.264/AVC standard
 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY IN CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY
, 2007
"... With the introduction of the H.264/AVC video coding standard, significant improvements have recently been demonstrated in video compression capability. The Joint Video Team of the ITUT VCEG and the ISO/IEC MPEG has now also standardized a Scalable Video Coding (SVC) extension of the H.264/AVC stand ..."
Abstract

Cited by 522 (6 self)
 Add to MetaCart
standard. SVC enables the transmission and decoding of partial bit streams to provide video services with lower temporal or spatial resolutions or reduced fidelity while retaining a reconstruction quality that is high relative to the rate of the partial bit streams. Hence, SVC provides functionalities
The Laplacian Pyramid as a Compact Image Code
, 1983
"... We describe a technique for image encoding in which local operators of many scales but identical shape serve as the basis functions. The representation differs from established techniques in that the code elements are localized in spatial frequency as well as in space. Pixeltopixel correlations a ..."
Abstract

Cited by 1388 (12 self)
 Add to MetaCart
We describe a technique for image encoding in which local operators of many scales but identical shape serve as the basis functions. The representation differs from established techniques in that the code elements are localized in spatial frequency as well as in space. Pixeltopixel correlations
Invariant amino acids essential for decoding function of
, 2005
"... polypeptide release factor eRF1 ..."
Generalized encoding and decoding functions for a cylindrical ambisonic sound system
 IEEE Signal Processing Letters
, 2003
"... AbstractIn this letter, we present generalized encoding and decoding functions for an ambisonic system. Our approach provides matrix representations for optimum encoding and decoding for both odd and even number of loudspeakers. Particularly, we present ambisonic components (signals or channels) f ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
AbstractIn this letter, we present generalized encoding and decoding functions for an ambisonic system. Our approach provides matrix representations for optimum encoding and decoding for both odd and even number of loudspeakers. Particularly, we present ambisonic components (signals or channels
Linearly Decodable Functions From Neural Population
, 2001
"... The population vector is a linear decoder for an ensemble of neurons, whose response properties are nonlinear functions of the input vector. However, previous analyses of this decoder seem to have missed the obsevation that the population vector can also be used to estimate functions of the input ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The population vector is a linear decoder for an ensemble of neurons, whose response properties are nonlinear functions of the input vector. However, previous analyses of this decoder seem to have missed the obsevation that the population vector can also be used to estimate functions
Some MPEG Decoding Functions on Spert An Example for Assembly Programmers
, 1994
"... We describe our method how to implement Cprogram sequences in torrent (T0) assembler code while there is no efficient automatic tool. We use restructuring of the source code, vectorization, dataflow graphs, a simple scheduling strategy and a straight forward register allocation algorithm. We defi ..."
Abstract
 Add to MetaCart
define some lower and an upper bound for the expected run time. For two functions, namely the color transformation and reverse DCT, we achieve almost 54, respectively 16 times the performance of a Sparc 2 workstation. ii Contents 1 Introduction 2 2 CCode 2 3 Vectorizing 3 4 Dataflow Graphs 3 5 Lower
DECODER
, 2012
"... The 74HC237 is a highspeed Sigate CMOS device and is pin compatible with lowpower Schottky TTL (LSTTL). The 74HC237 is specified in compliance with JEDEC standard no. 7A. The 74HC237 is a 3to8 line decoder, demultiplexer with latches at the three address inputs (An). The 74HC237 essentially com ..."
Abstract
 Add to MetaCart
combines the 3to8 decoder function with a 3bit storage latch. When the latch is enabled (LE = LOW), the 74HC237 acts as a 3to8 active LOW decoder. When the latch enable (LE) goes from LOWtoHIGH, the last data present at the inputs before this transition, is stored in the latches. Further address
Results 1  10
of
3,001