84 search results - page 10 / 17 » Computational Complexity of Decoding Orthogonal Space-Time B... |
126
click to vote
TIT
2010
14 years 8 months ago
2010
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...
156
click to vote
TSP
2008
15 years 1 months ago
2008
In the traditional transmitting beamforming radar system, the transmitting antennas send coherent waveforms which form a highly focused beam. In the multiple-input multipleoutput (...
146
Voted
CORR
2006
Springer
15 years 1 months ago
2006
Springer
In multiple-input multiple-output (MIMO) fading channels maximum likelihood (ML) detection is desirable to achieve high performance, but its complexity grows exponentially with th...
118
click to vote
STACS
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. Block codes are first viewed as finite state automata represented as trellises. A technique termed subtrellis overlaying is introduced with the object of reducing decoder...
104
Voted
GLOBECOM
2009
IEEE
15 years 8 months ago
2009
IEEE
—This paper proposes a new preprocessing scheme for rate-one quasi-orthogonal space-time block code (QO-STBC), which requires no channel state information at the transmitter. We ...