Sciweavers

256 search results - page 24 / 52
» Recursive Lattice Reduction
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Efficient lattice-reduction-aided MMSE decision-feedback equalization
Since optimum diversity behavior can be achieved, equalization based on lattice basis reduction is of special interest for transmission over MIMO channels. Although the per-symbol...
Robert F. H. Fischer
CTCS
1987
Springer
13 years 11 months ago
A Typed Lambda Calculus with Categorical Type Constructors
A typed lambda calculus with categorical type constructors is introduced. It has a uniform category theoretic mechanism to declare new types. Its type structure includes categoric...
Tatsuya Hagino
STOC
1999
ACM
176views Algorithms» more  STOC 1999»
13 years 12 months ago
On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
Johannes Blömer, Jean-Pierre Seifert
TIT
2010
105views Education» more  TIT 2010»
13 years 2 months 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
ICASSP
2011
IEEE
12 years 11 months ago
Hill climbing on speech lattices: A new rescoring framework
We describe a new approach for rescoring speech lattices — with long-span language models or wide-context acoustic models — that does not entail computationally intensive latt...
Ariya Rastrow, Markus Dreyer, Abhinav Sethy, Sanje...