Sciweavers

1243 search results - page 6 / 249
» Complexity reduction of C-Algorithm
Sort
View
LATIN
2010
Springer
15 years 6 months ago
Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...
Mark van Hoeij, Andrew Novocin
CORR
2007
Springer
94views Education» more  CORR 2007»
14 years 11 months ago
Size reduction of complex networks preserving modularity
The ubiquity of modular structure in real-world complex networks is being the focus of attention in many trials to understand the interplay between network topology and functionali...
Alex Arenas, J. Duch, A. Fernandez, Sergio G&oacut...
80
Voted
ICASSP
2008
IEEE
15 years 6 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
95
Voted
ICC
2007
IEEE
245views Communications» more  ICC 2007»
15 years 6 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
94
Voted
ICC
2008
IEEE
113views Communications» more  ICC 2008»
15 years 6 months ago
Complexity Reduction of Maximum-Likelihood Multiuser Detection (ML-MUD) Receivers with Carrier Interferometry Codes in MC-CDMA
—We propose to use carrier interferometry (CI) codes to reduce the complexity of the maximumlikelihood multiuser-detection (ML-MUD) receiver in MC-CDMA systems with carrier frequ...
Layla Tadjpour, Shang-Ho Tsai, C. C. Jay Kuo