84 search results - page 11 / 17 » Computational Complexity of Decoding Orthogonal Space-Time B... |
126
click to vote
DCC
2005
IEEE
16 years 1 months ago
2005
IEEE
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
106
click to vote
ICC
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract—A new 4 × 1 scheme of transmitting two real orthogonal space-time block codes (O-STBC) on the I- and Q-channels with pulse-shaped offset QAM is proposed. This scheme ac...
GLOBECOM
2007
IEEE
15 years 8 months ago
2007
IEEE
—In most of the existing space–time code designs, achieving full diversity is based on maximum-likelihood (ML) decoding at the receiver that is usually computationally expensiv...
109
click to vote
ICIP
2007
IEEE
16 years 3 months ago
2007
IEEE
Interactive navigation in image-based scenes requires random access to the compressed reference image data. When using state of the art block-based hybrid video coding techniques,...
81
Voted
WCNC
2008
IEEE
15 years 8 months ago
2008
IEEE
—This paper proposes the use of group-orthogonal frequency diversity combined with space-time block coding (STBC) to improve the performance of IEEE 802.11n wireless networks (WL...