Publication

Sparse Probabilistic Models

Publications associées (124)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Robust checkers for self-calibrating designs

Frédéric Worm

So far, performance and reliability of circuits have been determined by worst-case characterisation of silicon and of environmental conditions such as noise and temperature. As nanometer technologies exacerbate process variations and reduce noise margins, ...

EPFL2006

Unequal Error Protection of Atomic Image Streams

Pascal Frossard, Pierre Vandergheynst

This paper presents an unequal error protection scheme for atomic image bitstreams. An atomic stream is the encoded version of a digital image, which is represented as a sum of bi-dimensional functions, as typically generated by Matching Pursuit encoders. ...

2005

LDPC codes for fading Gaussian broadcast channels

Peter Allan Berlin, Daniela Tuninetti

In this work, we study coding over a class of two-user broadcast channels (BCs) with additive white Gaussian noise and multiplicative fading known at the receivers only. Joint decoding of low-density parity-check (LDPC) codes is analyzed. The message updat ...

2005

Wireless Image Transmission Using Turbo Codes and Optimal Unequal Error Protection

Nikolaos Thomos

A novel image transmission scheme is proposed for the communication of SPIHT image streams over wireless channels. The proposed scheme employs turbo codes and Reed-Solomon codes in order to deal effectively with burst errors. An algorithm for the optimal u ...

Institute of Electrical and Electronics Engineers2005

Improved Decoding of Interleaved AG-Codes

Mohammad Amin Shokrollahi, Lorenz Minder, Andrew Brown

We analyze a generalization of a recent algorithm of Bleichenbacher et al.~for decoding interleaved codes on the

Q

-ary symmetric channel for large

Q

. We will show that for any

m

and any

\epsilon

the new algorithms can decode up to a fraction of at ...

2005

Error Control Schemes for On-chip Communication Links: the energy-reliability trade-off

Giovanni De Micheli, Luca Benini

On-chip interconnection networks for future systems on chip (SoC) will have to deal with the increasing sensitivity of global wires to noise sources such as crosstalk or power supply noise. Hence, transient delay and logic faults are likely to reduce the r ...

Institute of Electrical and Electronics Engineers2005

Locally Testable Codes

Mahdi Cheraghchi Bashi Astaneh

Error correcting codes are combinatorial objects that allow reliable recovery of information in presence of errors by cleverly augmenting the original information with a certain amount of redundancy. The availability of efficient means of error detection i ...

2005

Asymptotic and finite-length analysis of low-density parity-check codes

Changyan Di

This thesis addresses the topic of Low-Density Parity-Check (LDPC) code analysis, both asymptotically and for finite block lengths. Since in general it is a difficult problem to analyze individual code instances, ensemble averages are studied by following ...

EPFL2004

Low-density parity-check codes with rates very close to the capacity of the q-ary symmetric channel for large q

Mohammad Amin Shokrollahi

Transmission of packets over computer networks is subject to packet-level errors, which appear as "bursts" of bit-level errors and are not well modeled by memoryless binary channels. A standard scrambling technique is used for transmission of packets by th ...

2004

LDPC codes for Gaussian broadcast channels

Peter Allan Berlin, Daniela Tuninetti

We study coding over a class of two-user broadcast channels with additive white Gaussian noise and fading known at the receivers only. Joint decoding of low-density parity-check codes is analyzed. The message update rule at the mapping node linking the use ...

2004

Improved Decoding of Interleaved AG-Codes

Mohammad Amin Shokrollahi, Lorenz Minder, Andrew Brown

We analyze a generalization of a recent algorithm of Bleichenbacher et al.~for decoding interleaved codes on the

Q

-ary symmetric channel for large

Q

. We will show that for any

m

and any

\epsilon

the new algorithms can decode up to a fraction of at ...

2005