Publication

ISI Tolerant Signaling: A Comparative Study of PAM4 and ENRZ

Publications associées (32)

We examine routing over two classes of orthogonal information networks. The first is a relay network with orthogonal inputs. The nodes in this network do not broadcast, but communicate to the different nodes via independent inputs. There is multiple access ...

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

Designs for transmit alphabet constrained spacetime codes naturally lead to questions about the design of rank distance codes. Recently, diversity embedded multi-level space-time codes for flat fading channels have been designed by using sets of binary mat ...

2007

Embedded Rank Distance Codes for ISI channels

Suhas Diggavi, Sanket Dusad

Designs for transmit alphabet constrained space-time codes naturally lead to questions about the design of rank distance codes. Recently, diversity embedded multi-level space-time codes for flat fading channels have been designed by using sets of binary ma ...

2007

On Successive Refinement of Diversity for fading ISI channels

Suhas Diggavi, Sanket Dusad

Abstract—Rate and diversity impose a fundamental tradeoff in communications. This tradeoff was investigated for IntersymbolInterference (ISI) channels in [4]. A different point of view was explored in [1] where high-rate codes were designed so that they ha ...

2006

On Embedded Diversity Codes

Suhas Diggavi, Sanket Dusad

Diversity-embedded codes for fading channels are high-rate codes that are designed so that they have a high-diversity code embedded within them \cite{DIMACS,Embed:Globecom}. This is equivalent to coding the data into two streams such that the high-priority ...

2005

Advanced OFDM systems for terrestrial multimedia links

Renzo Posega

Recently, there has been considerable discussion about new wireless technologies and standards able to achieve high data rates. Due to the recent advances of digital signal processing and Very Large Scale Integration (VLSI) technologies, the initial obstac ...

EPFL2005

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

Efficient adaptive receivers for joint equalization and interference cancellation in multiuser space-time block-coded systems

Ali H. Sayed

This paper develops low-complexity adaptive receivers for space-time block-coded (STBC) transmissions over frequency-selective fading channels. The receivers are useful for equalization purposes for single user transmissions and for joint equalization and ...

IEEE2003

Fundamentals of adaptive filtering

Ali H. Sayed

This graduate-level textbook offers a comprehensive and up-to-date treatment of adaptive filtering; a vast and fast-moving field. The book is logically organized, specific in its presentation of each topic, and far-reaching in scope. Throughout the present ...

John Wiley & Sons2003

Prefiltered M-BCJR Equalizer for MIMO Frequency-Selective Channels

Christina Fragouli, Suhas Diggavi

This paper addresses the problem of soft equalization for space-time-coded transmissions over frequency-selective fading channels. The structure of the space-time code is embedded in the channel impulse response for efficient joint equalization and decodin ...

2002

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