Sciweavers

2654 search results - page 17 / 531
» Space-Time Network Coding
Sort
View
TIT
2008
61views more  TIT 2008»
13 years 9 months ago
Performance of Space-Time Codes: Gallager Bounds and Weight Enumeration
Since the standard union bound for space-time codes may diverge in quasi-static fading channels, the limit-before-average technique has been exploited to derive tight performance b...
Cong Ling, Kwok H. Li, Alex ChiChung Kot
TIT
2008
106views more  TIT 2008»
13 years 9 months ago
Design of Spherical Lattice Space-Time Codes
In this paper, we propose a systematic procedure for designing spherical lattice (space
Narayan Prasad, Inaki Berenguer, Xiaodong Wang
CORR
2006
Springer
97views Education» more  CORR 2006»
13 years 9 months ago
Explicit Space-Time Codes Achieving The Diversity-Multiplexing Gain Tradeoff
A recent result of Zheng and Tse states that over a quasi-static channel, there exists a fundamental tradeoff, referred to as the diversity-multiplexing gain (D-MG) tradeoff, betwe...
Petros Elia, K. Raj Kumar, Sameer A. Pawar, P. Vij...
ICC
2007
IEEE
14 years 4 months ago
Optimal Precoder for Rate 1 Space-Time Block Codes
Abstract— Despite primary space-time coding where the channel state information (CSI) is available at the receiver only, the capacity and performance of multiple-input multiple-o...
Alireza Ghaderipoor, Chintha Tellambura
CORR
2006
Springer
104views Education» more  CORR 2006»
13 years 9 months ago
On Universally Decodable Matrices for Space-Time Coding
The notion of universally decodable matrices (UDMs) was recently introduced by Tavildar and Viswanath while studying slow fading channels. It turns out that the problem of construc...
Pascal O. Vontobel, Ashwin Ganesan