33 search results - page 5 / 7 » Single-Symbol Maximum Likelihood Decodable Linear STBCs |
120
click to vote
ICASSP
2010
IEEE
15 years 2 months ago
2010
IEEE
We present a novel discriminative training algorithm for n-gram language models for use in large vocabulary continuous speech recognition. The algorithm uses large margin estimati...
143
click to vote
ICASSP
2010
IEEE
15 years 2 months ago
2010
IEEE
—This paper provides a framework for designing space-time codes to take advantage of a small number of feedback bits from the receiver. The new codes are based on circulant matri...
102
click to vote
GLOBECOM
2008
IEEE
15 years 8 months ago
2008
IEEE
— In this paper, we propose a new decoding algorithm for quasi-orthogonal space-time block codes (QOSTBCs) which achieves near Maximum Likelihood (ML) performance while substanti...
112
click to vote
TIT
2008
15 years 1 months ago
2008
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
139
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...