English
Related papers

Related papers: On Low-complexity Lattice Reduction Algorithms for…

200 papers

In order to improve the performance of Least Mean Square (LMS) based system identification of sparse systems, a new adaptive algorithm is proposed which utilizes the sparsity property of such systems. A general approximating approach on…

Information Theory · Computer Science 2015-06-15 Yuantao Gu , Jian Jin , Shunliang Mei

This paper initiates the study of I/O algorithms (minimizing cache misses) from the perspective of fine-grained complexity (conditional polynomial lower bounds). Specifically, we aim to answer why sparse graph problems are so hard, and why…

Data Structures and Algorithms · Computer Science 2017-12-06 Erik D. Demaine , Andrea Lincoln , Quanquan C. Liu , Jayson Lynch , Virginia Vassilevska Williams

In this paper, the routing in massive low earth orbit (LEO) satellite networks is studied. When the satellite-to-satellite communication distance is limited, we choose different relay satellites to minimize the latency in a constellation at…

Networking and Internet Architecture · Computer Science 2022-04-11 Ruibo Wang , Mustafa A. Kishk , Mohamed-Slim Alouini

Large-scale multiple-input multiple-output (MIMO) is an emerging wireless technology that deploys thousands of transmit antennas at the base-station to boost spectral efficiency. The classic weighted minimum mean-square-error (WMMSE)…

Information Theory · Computer Science 2025-03-17 Yi Feng , Kaiming Shen

Query rewriting, the process of transforming queries into semantically equivalent yet more efficient variants, is crucial for database optimization. Existing solutions predominantly rely on either rule-based heuristics or Large Language…

Databases · Computer Science 2026-04-09 Jiahui Li , Tongwang Wu , Yuren Mao , Rong Kang , Tieying Zhang , Yunjun Gao

In frequency-division duplex (FDD) massive multiple-input multiple-output (MIMO) systems, the growing number of base station antennas leads to prohibitive feedback overhead for downlink channel state information (CSI). To address this…

Signal Processing · Electrical Eng. & Systems 2024-06-25 Yifan Ma , Hengtao He , Shenghui Song , Jun Zhang , Khaled B. Letaief

In this paper, the spectral efficiency of permutation modulation-based multiple input multiple output (MIMO) visible light communication is improved using systematically designed, multiweight codeword matrices. Soft-decision, low-complexity…

Signal Processing · Electrical Eng. & Systems 2020-07-01 Oluwafemi Kolade , Ling Cheng

Motivated by lattice mixture identification and grain boundary detection, we present a framework for lattice pattern representation and comparison, and propose an efficient algorithm for lattice separation. We define new scale and shape…

Image and Video Processing · Electrical Eng. & Systems 2024-12-20 Yuchen He , Sung Ha Kang

Spatial Modulation (SM) is a recently developed low-complexity Multiple-Input Multiple-Output scheme that uses antenna indices and a conventional signal set to convey information. It has been shown that the Maximum-Likelihood (ML) detection…

Information Theory · Computer Science 2013-01-17 Rakshith Rajashekar , K. V. S. Hari

In this work, decision feedback (DF) detection algorithms based on multiple processing branches for multi-input multi-output (MIMO) spatial multiplexing systems are proposed. The proposed detector employs multiple cancellation branches with…

Information Theory · Computer Science 2013-08-14 R. C. de Lamare

In this paper, we investigate the design of linear precoders for multiple-input multiple-output (MIMO) multiple access channels (MAC). We assume that statistical channel state information (CSI) is available at the transmitters and consider…

Information Theory · Computer Science 2014-01-22 Yongpeng Wu , Chao-Kai Wen , Chengshan Xiao , Xiqi Gao , Robert Schober

We present a complexity reduction algorithm for a family of parameter-dependent linear systems when the system parameters belong to a compact semi-algebraic set. This algorithm potentially describes the underlying dynamical system with…

Systems and Control · Computer Science 2012-09-25 Farhad Farokhi , Henrik Sandberg , Karl H. Johansson

Vector perturbation (VP) precoding is an effective nonlinear precoding technique in the downlink (DL) with modulo channels, providing an approximation of dirty paper coding (DPC) which is capacity-achieving. Especially, when combined with…

Information Theory · Computer Science 2026-05-06 Dominik Semmler , Wolfgang Utschick , Michael Joham

In future practical deployments of massive multi-input multi-output (MIMO) systems, the number of radio frequency (RF) chains at the base stations (BSs) may be much smaller than the number of BS antennas to reduce the overall expenditure.…

Information Theory · Computer Science 2016-11-15 Jun Zhu , Wei Xu , Ning Wang

This paper proposes a parallel computation strategy and a posterior-based lattice expansion algorithm for efficient lattice rescoring with neural language models (LMs) for automatic speech recognition. First, lattices from first-pass…

Audio and Speech Processing · Electrical Eng. & Systems 2021-03-10 Ke Li , Daniel Povey , Sanjeev Khudanpur

In this paper, the efficiency of various MIMO detectors was analyzed from the perspective of highly correlated channels, where MIMO systems have a lack of performance, besides in some cases an increasing complexity. Considering this hard,…

Signal Processing · Electrical Eng. & Systems 2018-10-09 João Lucas Negrão , Taufik Abrão

In this paper we present a novel method for decoding multiple input - multiple output (MIMO) transmission, which combines sphere decoding (SD) and zero forcing (ZF) techniques to provide near optimal low complexity and high performance…

Information Theory · Computer Science 2008-03-03 Vadim Neder , Doron Ezri , Motti Haridim

Minimum mean square error (MMSE) signal detection algorithm is near- optimal for uplink multi-user large-scale multiple input multiple output (MIMO) systems, but involves matrix inversion with high complexity. In this letter, we firstly…

Information Theory · Computer Science 2015-07-17 Xinyu Gao , Linglong Dai , Yongkui Ma , Zhaocheng Wang

A Random SubMatrix method (RSM) is proposed to calculate the low-rank decomposition of large-scale matrices with known entry percentage \rho. RSM is very fast as the floating-point operations (flops) required are compared favorably with the…

Numerical Analysis · Computer Science 2015-10-28 Yiguang Liu

We consider the approximate recovery of multivariate periodic functions from a discrete set of function values taken on a rank-$s$ integration lattice. The main result is the fact that any (non-)linear reconstruction algorithm taking…

Numerical Analysis · Mathematics 2016-08-02 Glenn Byrenheid , Lutz Kämmerer , Tino Ullrich , Toni Volkmer