English
Related papers

Related papers: Construction of MIMO MAC Codes Achieving the Pigeo…

200 papers

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

Due to the short and bursty incoming messages, channel access activities in a wireless random access system are often fractional. The lack of frequent data support consequently makes it difficult for the receiver to estimate and track the…

Information Theory · Computer Science 2011-10-11 Zheng Wang , Jie Luo

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

Information Theory · Computer Science 2016-11-15 Yongpeng Wu , Chao-Kai Wen , Chengshan Xiao , Xiqi Gao , Robert Schober

A new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the…

Information Theory · Computer Science 2016-11-15 Zheng Wang , Jie Luo

In this article we compare the performance of two typical hyrbid beamforming structures for multiuser massive MIMO systems, i.e., the full- and partial-connection structures. Under the assumption of small angular spread for mmWave channels,…

Signal Processing · Electrical Eng. & Systems 2020-06-19 Zheda Li , Shengqian Han , Andreas F. Molisch

We characterize the total degrees of freedom (DoF) of the full-rank MIMO X channel with arbitrary number of antennas at each node. We elucidate that the existing outer bound is tight for any antenna configuration and provide transmit and…

Information Theory · Computer Science 2012-10-10 Adrian Agustin , Josep Vidal

In the scalar dirty multiple-access channel, in addition to Gaussian noise, two additive interference signals are present, each known non-causally to a single transmitter. It was shown by Philosof et al. that for strong interferences, an…

Information Theory · Computer Science 2017-06-20 Anatoly Khina , Yuval Kochman , Uri Erez

In this paper, we study how coded caching can be efficiently applied to multiple-input multiple-output (MIMO) communications. This is an extension to cache-aided multiple-input single-output (MISO) communications, where it is shown that…

Information Theory · Computer Science 2021-10-05 MohammadJavad Salehi , Hamidreza Bakhshzad Mahmoodi , Antti Tölli

In this work, the Multiple transmit antennas Multiple Access Channel is considered. A construction of a family of distributed space-time codes for this channel is proposed. No Channel Side Information at the transmitters is assumed and…

Information Theory · Computer Science 2008-04-10 Maya Badr , Jean-Claude Belfiore

We present a rate-compatible polar coding scheme that achieves the capacity of any family of channels. Our solution generalizes the previous results [1], [2] that provide capacity-achieving rate-compatible polar codes for a degraded family…

Information Theory · Computer Science 2017-01-24 Marco Mondelli , S. Hamed Hassani , Ivana Marić , Dennis Hui , Song-Nam Hong

Multiple-input multiple-output (MIMO) or multi-antenna communication is a key technique to achieve high spectral efficiency in wireless systems. For the point-to-point MIMO channel, it is a well-known result that the channel singular value…

Information Theory · Computer Science 2016-11-17 Liang Liu , Rui Zhang

Motivated by the growing application of wireless multi-access networks with stringent delay constraints, we investigate the Gaussian multiple access channel (MAC) in the finite blocklength regime. Building upon information spectrum…

Information Theory · Computer Science 2013-09-11 Ebrahim MolavianJazi , J. Nicholas Laneman

The multiplicative-additive finite-field matrix channel arises as an adequate model for linear network coding systems when links are subject to errors and erasures, and both the network topology and the network code are unknown. In a…

Information Theory · Computer Science 2010-04-13 Roberto W. Nobrega , Bartolomeu F. Uchoa-Filho

The maximum rates for reliably transmitting classical information over Bosonic multiple-access channels (MACs) are derived when the transmitters are restricted to coherent-state encodings. Inner and outer bounds for the ultimate capacity…

Quantum Physics · Physics 2009-11-11 Brent J. Yen , Jeffrey H. Shapiro

In a recent work, a capacity-achieving scheme for the common-message two-user MIMO broadcast channel, based on single-stream coding and decoding, was described. This was obtained via a novel joint unitary triangularization which is applied…

Information Theory · Computer Science 2011-06-01 Anatoly Khina , Ayal Hitron , Uri Erez

This paper presents finite-blocklength achievability bounds for the Gaussian multiple access channel (MAC) and random access channel (RAC) under average-error and maximal-power constraints. Using random codewords uniformly distributed on a…

Information Theory · Computer Science 2022-05-05 Recep Can Yavas , Victoria Kostina , Michelle Effros

The problem of three-user multiple-access channel (MAC) with noiseless feedback is investigated. A new coding strategy is presented. The coding scheme builds upon the natural extension of the Cover-Leung (CL) scheme; and uses quasi-linear…

Information Theory · Computer Science 2017-02-21 Mohsen Heidari , Farhad Shirani , S. Sandeep Pradhan

In this work, novel upper and lower bounds for the capacity of channels with arbitrary constraints on the support of the channel input symbols are derived. As an immediate practical application, the case of multiple-input multiple-output…

Information Theory · Computer Science 2017-09-01 Alex Dytso , Mario Goldenbaum , Shlomo Shamai , H. Vincent Poor

The necessary and sufficient condition of the channel capacity is rigorously formulated for the N-user discrete memoryless multiple-access channel (MAC). The essence of the formulation is to invoke an {\em elementary} MAC where sizes of…

Information Theory · Computer Science 2007-08-09 Yoichiro Watanabe , Koichi Kamoi

This paper considers the multi-input multi-output (MIMO) relay channel where multiple antennas are employed by each terminal. Compared to single-input single-output (SISO) relay channels, MIMO relay channels introduce additional degrees of…

Information Theory · Computer Science 2008-05-03 Caleb K. Lo , Sriram Vishwanath , Robert W. Heath