Publication

On reduced trellis equalization using the M-BCJR Algorithm

Related publications (32)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Channel coding and modulation based on chaotic systems

Slobodan Kozic

In this thesis, a new class of codes on graphs based on chaotic dynamical systems are proposed. In particular, trellis coded modulation and iteratively decodable codes on graphs are studied. The codes are designed by controlling symbolic dynamics of chaoti ...

EPFL2006

VLSI implementation of the list sphere algorithm

Andreas Peter Burg, Matthieu Philippe Emmanuel Zellweger, Christoph Studer

Sphere decoding (SD) is widely considered as one of the most promising detection schemes for multiple-input multiple-output (MIMO) communication systems. The recently proposed list sphere-decoding (LSD) algorithm is an extension of the original SD algorith ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2006

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

Efficient error correction solutions for OFDM based digital video

Mauro Lattuada

The robustness of the delivery of digital compressed video streams has always been one of the main topic of the standardization bodies to assure the Quality of the Service (QoS). The MPEG standard which is nowadays the reference for digital television defi ...

EPFL2005

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

Concatenated codes for block-fading channels

Albert Guillén i Fàbregas

In this thesis we study coding strategies for single-user block-fading channels. The block-fading channel is a simplified model of slowly varying wireless communication channels with stringent delay constraints. This model is particularly important in prac ...

EPFL2004

On the joint source and channel coding of atomic image streams

Pascal Frossard

This paper presents an error resilient coding scheme for atomic image bitstreams, as generated by Matching Pursuit encoders. A joint source and channel coding algorithm is proposed, that takes benefit of both the flexibility in the image representation, an ...

IEEE2004

Serially concatenated coding for broadcasting S-UMTS applications

Christina Fragouli

Satellite-UMTS supports broadcast applications that involve transmission of the same encoded data over channels that may vary significantly. The same code must allow a user with a good channel to recover the information with low complexity, while a user wi ...

2002

Turbo Encoder Design for Symbol Interleaved Parallel Concatenated Trellis Coded Modulation

Christina Fragouli

This paper addresses turbo-encoder design for coding with high spectral efficiency using parallel concatenated trellis-coded modulation and symbol interleaving. The turbo-encoder design involves the constituent encoder design and the interleaver design. Th ...

2001

Turbo Codes with Non-Uniform Constellation

Christina Fragouli

This paper presents parallel concatenated turbo codes that employ a non-uniform constellation to achieve shaping gain. The output signal approximates the Gaussian distribution by using equally likely signals with unequal spacing (a non-uniform constellatio ...

2001

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