Sciweavers

256 search results - page 7 / 52
» Recursive Lattice Reduction
Sort
View
ICC
2007
IEEE
245views Communications» more  ICC 2007»
14 years 1 months ago
Low Complexity MMSE Vector Precoding Using Lattice Reduction for MIMO Systems
—In this paper, a lattice-reduction-aided (LRA) With such an approximation, the complexity of VP is greatly minimum mean square error (MMSE) vector precoding (VP) is reduced. pro...
Feng Liu, Ling-ge Jiang, Chen He
CASES
2007
ACM
13 years 11 months ago
Stack size reduction of recursive programs
For memory constrained environments like embedded systems, optimization for program size is often as important, if not more important, as optimization for execution speed. Commonl...
Stefan Schäckeler, Weijia Shang
WAE
2000
103views Algorithms» more  WAE 2000»
13 years 8 months ago
Lattice Basis Reduction with Dynamic Approximation
Abstract. In this paper we present a heuristic based on dynamic approximations for improving the well-known Schnorr-Euchner lattice basis reduction algorithm. In particular, the ne...
Werner Backes, Susanne Wetzel
ICIP
2001
IEEE
14 years 9 months ago
Compression color space estimation of JPEG images using lattice basis reduction
Given a color image that was quantized in some hidden color space (termed compression color space) during previous JPEG compression, we aim to estimate this unknown compression co...
Ramesh Neelamani, Ricardo L. de Queiroz, Richard G...
ICASSP
2008
IEEE
14 years 1 months ago
Worst- and average-case complexity of LLL lattice reduction in MIMO wireless systems
Lattice reduction by means of the LLL algorithm has been previously suggested as a powerful preprocessing tool that allows to improve the performance of suboptimal detectors and t...
Joakim Jalden, Dominik Seethaler, Gerald Matz