84 search results - page 9 / 17 » Computational Complexity of Decoding Orthogonal Space-Time B... |
96
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract--Space-Time Block Codes from square complex orthogonal designs (SCOD) have been extensively studied and most of the existing SCODs contain large number of zero. The zeros ...
104
Voted
CORR
2006
Springer
15 years 1 months ago
2006
Springer
A Space-Time Block Code (STBC) in K symbols (variables) is called g-group decodable STBC if its maximumlikelihood decoding metric can be written as a sum of g terms such that each ...
108
click to vote
TIT
2011
14 years 8 months ago
2011
—Constellation Constrained (CC) capacity regions of two-user Single-Input Single-Output (SISO) Gaussian Multiple Access Channels (GMAC) are computed for several Non-Orthogonal Mu...
118
click to vote
TIT
1998
15 years 1 months ago
1998
—A sequential decoder for linear block codes that performs maximum-likelihood soft-decision decoding is described. The decoder uses a metric computed from a lower bound on the co...
118
click to vote
TWC
2008
15 years 1 months ago
2008
Diversity-Embedding Space-Time Block Coding (DE-STBC), introduced in [1], enables Unequal Error Protection (UEP) using multiple transmit antennas. Even though these codes do not re...