Concept

Code de Gray

Publications associées (64)

Time-Splitting Multiple-Access

It is shown that the encoding/decoding problem for any asynchronous M-user memoryless multiple-access channel can be reduced to corresponding problems for at most 2M-1 single-user memoryless channels. This is done via a method called time-splitting multipl ...

1999

HPF on Fine-Grain Distributed Shared Memory: Early Experience

James Richard Larus

This paper examines the performance of a suite of HPF applications on a network of workstations using two different compilation approaches: generating explicit message-passing code, and generating code for a shared address space provided by a finegrain dis ...

Springer1997

Approaching the AWGN Channel Capacity without Active Shaping

Rüdiger Urbanke, Bixio Rimoldi

It is shown that the capacity of the AWGN channel can be approached via a multilevel coding scheme with the output of each encoder mapped into an independent signal constellation. No active shaping is required in this scheme, regardless of the signal-to-no ...

1997

Studies of Self-Consistent-Field Structure in a Quasi-Optical Gyrotron

Minh Quang Tran

The presence of an electron beam in a quasioptical gyrotron cavity alters the structure of the fields from that of the empty cavity. A computer code has been written that calculates this alteration for either an electron beam or a thin dielectric tube plac ...

1993

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