Sciweavers

46 search results - page 2 / 10
» On the Optimality of Successive Decoding in Compress-and-For...
Sort
View
ICASSP
2011
IEEE
12 years 9 months ago
Optimal and low-complexity iterative joint network/channel decoding for the multiple-access relay channel
In this paper, we investigate joint network and channel decoding algorithms for the multiple-access relay channel. We consider a realistic reference scenario with Rayleigh fading ...
Xuan-Thang Vu, Marco Di Renzo, Pierre Duhamel
GLOBECOM
2006
IEEE
13 years 11 months ago
Cooperative Relay Networks Using Fountain Codes
We investigate a cooperative communications scheme with N parallel relays, where both the transmissions from the source to the relays and from the relays to the destination use fo...
Andreas F. Molisch, Neelesh B. Mehta, Jonathan S. ...
ICC
2008
IEEE
133views Communications» more  ICC 2008»
13 years 11 months ago
Memoryless Relay Strategies for Two-Way Relay Channels: Performance Analysis and Optimization
— We consider relaying strategies for two-way relay channels, where two terminals transmits simultaneously to each other with the help of relays. A memoryless system is considere...
Tao Cui, Jörg Kliewer
INFOCOM
2007
IEEE
13 years 11 months ago
Cooperative Strategies and Optimal Scheduling for Tree Networks
Abstract— In this paper, we develop and analyze a lowcomplexity cooperative protocol that significantly increases the average throughput of multi-hop upstream transmissions for ...
Alexandre de Baynast, Omer Gurewitz, Edward W. Kni...
TIT
2010
105views Education» more  TIT 2010»
12 years 12 months ago
Multigroup ML decodable collocated and distributed space-time block codes
In this paper, collocated and distributed space-time block codes (DSTBCs) which admit multigroup maximum-likelihood (ML) decoding are studied. First, the collocated case is conside...
G. Susinder Rajan, B. Sundar Rajan