Sciweavers

47 search results - page 3 / 10
» Achieving Full Rate Network Coding with Constellation Compat...
Sort
View
CISS
2007
IEEE
13 years 11 months ago
High-Throughput Cooperative Communications with Complex Field Network Coding
Relay-based cooperative communications can achieve spatial diversity gains, enhance coverage and potentially increase capacity. If considered for large networks, traditional relayi...
Tairan Wang, Georgios B. Giannakis
CORR
2011
Springer
168views Education» more  CORR 2011»
13 years 7 days ago
Precoding for Outage Probability Minimization on Block Fading Channels
The outage probability limit is a fundamental and achievable lower bound on the word error rate of coded communication systems affected by fading. This limit is mainly determined ...
Dieter Duyck, Joseph Jean Boutros, Marc Moeneclaey
GLOBECOM
2008
IEEE
13 years 11 months ago
Low-Complexity Maximum Likelihood Detection of Orthogonal Space-Time Block Codes
Abstract— In this paper, we propose a low complexity Maximum Likelihood (ML) decoding algorithm for orthogonal spacetime block codes (OSTBCs) based on the real-valued lattice rep...
Luay Azzam, Ender Ayanoglu
CORR
2011
Springer
182views Education» more  CORR 2011»
13 years 7 days ago
Short-Message Quantize-Forward Network Coding
—Recent work for single-relay channels shows that quantize-forward (QF) with long-message encoding achieves the same reliable rates as compress-forward (CF) with short-message en...
Gerhard Kramer, Jie Hou
IPSN
2005
Springer
13 years 10 months ago
A family of distributed space-time trellis codes with asynchronous cooperative diversity
—In current cooperative communication schemes, to achieve cooperative diversity, synchronization between terminals is usually assumed, which may not be practical since each termi...
Yabo Li, Xiang-Gen Xia