English
Related papers

Related papers: Low-complexity Decoding is Asymptotically Optimal …

200 papers

We consider the problem of universal decoding for arbitrary unknown channels in the random coding regime. For a given random coding distribution and a given class of metric decoders, we propose a generic universal decoder whose average…

Information Theory · Computer Science 2016-11-17 Neri Merhav

Motivated by massive deployment of low data rate Internet of things (IoT) and ehealth devices with requirement for highly reliable communications, this paper proposes receive beamforming techniques for the uplink of a single-input…

Information Theory · Computer Science 2017-05-17 Majid Bavand , Steven D. Blostein

In multiple-input multiple-output (MIMO) fading channels maximum likelihood (ML) detection is desirable to achieve high performance, but its complexity grows exponentially with the spectral efficiency. The current state of the art in MIMO…

Information Theory · Computer Science 2007-07-13 Massimiliano Siti , Michael P. Fitz

We focus on full-rate, fast-decodable space-time block codes (STBCs) for 2x2 and 4x2 multiple-input multiple-output (MIMO) transmission. We first derive conditions for reduced-complexity maximum-likelihood decoding, and apply them to a…

Information Theory · Computer Science 2008-03-18 Ezio Biglieri , Yi Hong , Emanuele Viterbo

The receiver design for multi-input multi-output (MIMO) ultra-reliable and low-latency communication (URLLC) systems can be a tough task due to the use of short channel codes and few pilot symbols. Consequently, error propagation can occur…

Signal Processing · Electrical Eng. & Systems 2024-04-12 Yi Sun , Hong Shen , Bingqing Li , Wei Xu , Pengcheng Zhu , Nan Hu , Chunming Zhao

In this paper, we consider a quasi-orthogonal (QO) space-time block code (STBC) with minimum decoding complexity (MDC-QO-STBC). We formulate its algebraic structure and propose a systematic method for its construction. We show that a…

Information Theory · Computer Science 2007-07-13 Chau Yuen , Yong Liang Guan , Tjeng Thiang Tjhung

We construct a class of linear space-time block codes for any number of transmit antennas that have controllable ML decoding complexity with a maximum rate of 1 symbol per channel use. The decoding complexity for $M$ transmit antennas can…

Information Theory · Computer Science 2012-05-22 Naresh Sharma , Pavan R. Pinnamraju , Constantinos B. Papadias

This paper investigates the performance of a massive multiple-input multiple-output (MIMO) system that uses a large transmit antenna array with antenna elements spaced densely. Under the assumption of idealized uniform linear antenna arrays…

Information Theory · Computer Science 2016-01-25 Keigo Takeuchi

This paper considers the multiple-input-single-output interference channel (MISO-IC) with interference decoding capability (IDC), so that the interference signal can be decoded and subtracted from the received signal. On the MISO-IC with…

Information Theory · Computer Science 2011-07-05 Z. K. M. Ho , D. Gesbert , E. Jorswieck , R. Mochaourab

We consider the problem of coordinated multi- cell downlink beamforming in massive multiple input multiple output (MIMO) systems consisting of N cells, Nt antennas per base station (BS) and K user terminals (UTs) per cell. Specifically, we…

Information Theory · Computer Science 2015-04-09 Subhash Lakshminarayana , Mohamad Assaad , Merouane Debbah

This paper considers a nonlinear multi-hop multi-user multiple-input multiple-output (MU-MIMO) relay channel, in which multiple users send information symbols to a multi-antenna base station (BS) with one-bit analog-to-digital converters…

Information Theory · Computer Science 2019-04-09 Daeun Kim , Song-Nam Hong , Namyoon Lee

In this paper, we address the design of codes which achieve modulation diversity in block fading single-input single-output (SISO) channels with signal quantization at receiver and low-complexity decoding. With an unquantized receiver,…

Information Theory · Computer Science 2015-03-19 Saif Khan Mohammed , Emanuele Viterbo , Yi Hong , Ananthanarayanan Chockalingam

We study downlink beamforming in a single-cell network with a multi-antenna base station serving cache-enabled users. Assuming a library of files with a common rate, we formulate the minimum transmit power with proactive caching and coded…

Information Theory · Computer Science 2020-07-24 Junlin Zhao , Mohammad Mohammadi Amiri , Deniz Gündüz

This paper considers an uplink multiuser massive multiple-input-multiple-output (MIMO) system with low-resolution analog-to-digital converters (ADCs), in which K users with a single-antenna communicate with one base station (BS) with Nr…

Information Theory · Computer Science 2017-04-12 Song-Nam Hong , Seonho Kim , Namyoon Lee

This paper develops a linear minimum mean-square error (LMMSE) channel estimator for single and multicarrier systems that takes advantage of the mutual coupling in antenna arrays. We model the mutual coupling through multiport networks and…

Information Theory · Computer Science 2023-04-18 Bamelak Tadele , Volodymyr Shyianov , Faouzi Bellili , Amine Mezghani

In this paper, we propose an optimal but low-complexity optimization method for nonsquare differential massive MIMO. While a discrete nonlinear optimization is required for the conventional nonsquare differential coding, we newly modify it…

Signal Processing · Electrical Eng. & Systems 2023-05-29 Yuma Katsuki , Naoki Ishikawa

Multiple antennas have been exploited for spatial multiplexing and diversity transmission in a wide range of communication applications. However, most of the advances in the design of high speed wireless multiple-input multiple output…

Information Theory · Computer Science 2017-04-26 Yongpeng Wu , Chengshan Xiao , Zhi Ding , Xiqi Gao , Shi Jin

Spectral efficiency of low-density spreading non-orthogonal multiple access channels in the presence of fading is derived for linear detection with independent decoding as well as optimum decoding. The large system limit, where both the…

Information Theory · Computer Science 2018-01-30 Mai T. P. Le , Guido Carlo Ferrante , Tony Q. S. Quek , Maria-Gabriella Di Benedetto

This paper tackles two problems that fall under the study of coding for insertions and deletions. These problems are motivated by several applications, among them is reconstructing strands in DNA-based storage systems. Under this paradigm,…

Information Theory · Computer Science 2025-06-23 Omer Sabary , Daniella Bar-Lev , Yotam Gershon , Alexander Yucovich , Eitan Yaakobi

The idea that compressed sensing may be used to encrypt information from unauthorised receivers has already been envisioned, but never explored in depth since its security may seem compromised by the linearity of its encoding process. In…

Information Theory · Computer Science 2015-03-02 Valerio Cambareri , Mauro Mangia , Fabio Pareschi , Riccardo Rovatti , Gianluca Setti