1243 search results - page 15 / 249 » Complexity reduction of C-Algorithm |
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Consider a flat-fading Multiple-Input Multiple-Output (MIMO) system. The near-optimum detection problematic has been shown to be efficiently solved through QR Decomposition (QRD...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
The question in the title is relevant when considering latticereduction-aided MIMO detectors, which achieve the same diversity as the maximum-likelihood detector while exhibiting ...
AIML
2004
14 years 11 months ago
2004
This paper shows that satisfiability for Propositional Dynamic Logic with Intersection is EXPSPACE-hard. The proof uses a reduction from the word problem for alternating, exponent...
KGC
1997
Springer
15 years 1 months ago
1997
Springer
Rice’s Theorem says that every nontrivial semantic property of programs is undecidable. In this spirit we show the following: Every nontrivial absolute (gap, relative) counting p...
120
click to vote
GLOBECOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— Lattice basis reduction is a powerful technique that enables a hard-output detector for a multiple-input multiple-output channel to approach maximum-likelihood performance with...