Concept

Chip (CDMA)

Publications associées (11)

Parallel temporal signal processing enabled by polarization-multiplexed programmable THz metasurfaces

Romain Christophe Rémy Fleury, Ali Momeni

Under the trends of multifunctionality, tunability, and compactness in modern wave -based signal processors, in this paper, we propose a polarization-multiplexed graphene-based metasurface to realize distinct mathematical operators on the parallel time-dom ...

Optica Publishing Group2022

Exploiting Common Randomness: a Resource for Network Secrecy

Suhas Diggavi, László Czap, Vinod Malathidevi Prabhakaran

We investigate the problem of secure communication in a simple network with three communicating parties, two distributed sources who communicate over orthogonal channels to one destination node. The cooperation between the sources is restricted to a rate l ...

2013

Exploiting Common Randomness: a Resource for Network Secrecy

Christina Fragouli, Suhas Diggavi, László Czap, Vinod Malathidevi Prabhakaran

Ieee2013

Tight Bounds on the Capacity of Binary Input random CDMA Systems

Nicolas Macris, Satish Babu Korada

We consider multiple access communication on a binary input additive white Gaussian noise channel using randomly spread code division. For a general class of symmetric distributions for spreading coefficients, in the limit of a large number of users, we pr ...

2010

Bounds on the Sum Capacity of Synchronous Binary CDMA Channels

Pedram Pad, Vahid Aref

In this paper, we obtain a family of lower bounds for the sum capacity of code-division multiple-access (CDMA) channels assuming binary inputs and binary signature codes in the presence of additive noise with an arbitrary distribution. The envelope of this ...

Institute of Electrical and Electronics Engineers2009

On the Capacity of a Code Division Multiple Access System

Nicolas Macris, Satish Babu Korada

We consider multiuser communication on a binary input additive white Gaussian noise channel using Randomly Spread-Code Division Multiple Access. We show concentration of various quantities of the system including the capacity and the free energy. We also o ...

2007

Multiuser Interference during Synchronization Phase in UWB Impulse Radio

Pierre-André Farine, Cyril Botteron

This paper analyzes the receiver's ability to differentiate between multiple users in ultra-wideband (UWB) impulse radio (IR) during the initial synchronization phase after a cold start, i.e., when the receiver is not yet synchronized with the user of inte ...

2005

An uplink DS-CDMA receiver using a robust post-correlation Kalman structure

Ali H. Sayed

Kalman filtering has been proposed in the literature for wireless channel estimation, however, it is not sufficiently robust to uncertainties in the channel auto-correlation model as well as to multiple access interference (MAI). This paper presents a rece ...

IEEE2005

Low complexity frequency domain equalization of MIMO channels with applications to MIMO-CDMA systems

Andreas Peter Burg

CDMA and MIMO-CDMA systems using RAKE receivers are heavily limited by self- and multiple-access-interference. Linear equalization is a means to remove this interference, however it is often not practical due to the enormous complexity, especially in the M ...

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

Comparison of multi-cell multi-antenna CDMA and TDMA systems

Ninoslav Marina

We evaluate system capacities for multicellular systems with different multiple access strategies. The interference from another cell sharing the same frequency is calculated, and the total interference arising from the frequency reuse pattern is evaluated ...

2004

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