Sciweavers

437 search results - page 3 / 88
» Randomized Lattice Decoding
Sort
View
GLOBECOM
2007
IEEE
14 years 18 days ago
Geometric Decoding Of PAM and QAM Lattices
— A geometric decoding technique for finite lattices was presented by Seethaler et al. for flat-fading multiple-input multiple-output channels in the case of linear modulations...
Michael Samuel, Michael P. Fitz
TIT
1998
90views more  TIT 1998»
13 years 5 months ago
On the Complexity of Decoding Lattices Using the Korkin-Zolotarev Reduced Basis
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain of L, and are obtained ba...
Amir H. Banihashemi, Amir K. Khandani
EMNLP
2008
13 years 7 months ago
Lattice Minimum Bayes-Risk Decoding for Statistical Machine Translation
We present Minimum Bayes-Risk (MBR) decoding over translation lattices that compactly encode a huge number of translation hypotheses. We describe conditions on the loss function t...
Roy Tromble, Shankar Kumar, Franz Josef Och, Wolfg...
LREC
2008
138views Education» more  LREC 2008»
13 years 7 months ago
MISTRAL: a Statistical Machine Translation Decoder for Speech Recognition Lattices
This paper presents MISTRAL, an open source statistical machine translation decoder dedicated to spoken language translation. While typical machine translation systems take a writ...
Alexandre Patry, Philippe Langlais
TIT
2010
105views Education» more  TIT 2010»
13 years 29 days ago
DMT optimality of LR-aided linear decoders for a general class of channels, lattice designs, and system models
The work identifies the first general, explicit, and non-random MIMO encoder-decoder structures that guarantee optimality with respect to the diversity-multiplexing tradeoff (DMT),...
Joakim Jalden, Petros Elia