English
Related papers

Related papers: Low-Complexity Integer-Forcing Methods for Block F…

200 papers

In multiple-input multiple-output (MIMO) fading channels, the design criterion for full-diversity space-time block codes (STBCs) is primarily determined by the decoding method at the receiver. Although constructions of STBCs have…

Information Theory · Computer Science 2017-01-16 J. Harshan , Amin Sakzad , Emanuele Viterbo

We consider a point-to-point flat-fading MIMO channel with channel state information known both at transmitter and receiver. At the transmitter side, a lattice coding scheme is employed at each antenna to map information symbols to…

Information Theory · Computer Science 2015-04-02 Amin Sakzad , Emanuele Viterbo

Consider an uplink cloud radio access network where users are observed simultaneously by several base stations, each with a rate-limited link to a central processor, which wishes to decode all transmitted messages. Recent efforts have…

Information Theory · Computer Science 2020-01-07 Islam El Bakoury , Bobak Nazer

This work presents two novel optimization methods based on integer linear programming (ILP) that minimize the number of adders used to implement a direct/transposed finite impulse response (FIR) filter adhering to a given frequency…

Signal Processing · Electrical Eng. & Systems 2019-12-10 Martin Kumm , Anastasia Volkova , Silviu-Ioan Filip

We present a novel iterative detection and decoding scheme for the uplink of large-scale multiuser multiple-antenna systems. In order to reduce the receiver's energy consumption and computational complexity, 1-bit analog-to-digital…

Information Theory · Computer Science 2017-12-27 Z. Shao , L. Landau , R. de Lamare

In this paper, we study the sum rate maximization for successive zero-forcing dirty-paper coding (SZFDPC) with per-antenna power constraint (PAPC). Although SZFDPC is a low-complexity alternative to the optimal dirty paper coding (DPC),…

Information Theory · Computer Science 2019-05-21 Thuy M. Pham , Ronan Farrell , Le-Nam Tran

While linear programming (LP) decoding provides more flexibility for finite-length performance analysis than iterative message-passing (IMP) decoding, it is computationally more complex to implement in its original form, due to both the…

Information Theory · Computer Science 2009-02-05 Mohammad H. Taghavi , Amin Shokrollahi , Paul H. Siegel

Many satellite communication systems operating today employ low cost upconverters or downconverters which create phase noise. This noise can severely limit the information rate of the system and pose a serious challenge for the detection…

Information Theory · Computer Science 2012-10-19 Shachar Shayovitz , Dan Raphaeli

The performance of integer-forcing equalization for communication over the compound multiple-input multipleoutput channel is investigated. An upper bound on the resulting outage probability as a function of the gap to capacity has been…

Information Theory · Computer Science 2017-12-05 Elad Domanovitz , Uri Erez

In this paper, we develop an orthogonal precoding scheme for integer-forcing (IF) linear receivers using the steepest gradient algorithm. Although this scheme can be viewed as a special case of the unitary precoded integer-forcing (UPIF),…

Information Theory · Computer Science 2019-04-23 Mohammad Nur Hasan , Brian M. Kurkoski , Amin Sakzad , Emanuele Viterbo

This paper proposes two low-complexity iterative algorithms to compute the capacity of a single-user multiple-input multiple-output channel with per-antenna power constraint. The first method results from manipulating the optimality…

Information Theory · Computer Science 2017-05-18 Thuy M. Pham , Ronan Farrell , Le-Nam Tran

We investigate the multiple-input multiple-output broadcast channel with statistical channel state information available at the transmitter. The so-called linear assignment operation is employed, and necessary conditions are derived for the…

Information Theory · Computer Science 2015-06-22 Yongpeng Wu , Shi Jin , Xiqi Gao , Matthew R. McKay , Chengshan Xiao

Full-rate space-time block codes (STBCs) achieve high spectral-efficiency by transmitting linear combinations of information symbols through every transmit antenna. However, the coefficients used for the linear combinations, if not chosen…

Information Theory · Computer Science 2013-03-18 J. Harshan , Emanuele Viterbo

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

In multiple-input multiple-output (MIMO) fading channels, the design criterion for full-diversity space-time block codes (STBCs) is primarily determined by the decoding method at the receiver. Although constructions of STBCs have…

Information Theory · Computer Science 2018-04-04 J. Harshan , Amin Sakzad , Emanuele Viterbo

We consider a multi-cell multiple-input multiple-output (MIMO) coordinated downlink transmission, also known as network MIMO, under per-antenna power constraints. We investigate a simple multiuser zero-forcing (ZF) linear precoding…

Information Theory · Computer Science 2013-04-18 Saeed Kaviani , Witold A. Krzymien

This paper proposes an iterative detection and decoding (IDD) scheme for a cell free massive multiple input multiple output (CF-mMIMO) system. Users send coded data to the access points (APs), which is jointly detected at central processing…

Information Theory · Computer Science 2022-10-25 T. Ssettumba , R. Di Renna , L. Landau , R. C. de Lamare

Low-complexity precoding {algorithms} are proposed in this work to reduce the computational complexity and improve the performance of regularized block diagonalization (RBD) {based} precoding {schemes} for large multi-user {MIMO} (MU-MIMO)…

Information Theory · Computer Science 2013-04-25 Keke Zu , Rodrigo C. de Lamare , Martin Haardt

The error floor phenomenon observed with LDPC codes and their graph-based, iterative, message-passing (MP) decoders is commonly attributed to the existence of error-prone substructures -- variously referred to as near codewords, trapping…

Information Theory · Computer Science 2013-09-11 Xiaojie Zhang , Paul H. Siegel

This paper proposes a cell-free massive multiple-input multiple-output (CF-mMIMO) architecture with joint list-based detection with soft interference cancelation (soft-IC) and access points (APs) selection. In particular, we derive a new…

Information Theory · Computer Science 2023-04-11 T. Ssettumba , L. T. N. Landau , R. C. de Lamare