English
Related papers

Related papers: An error event sensitive trade-off between rate an…

200 papers

In this work we show how an improved lower bound to the error exponent of the memoryless multiple-access (MAC) channel is attained via the use of linear codes, thus demonstrating that structure can be beneficial even in cases where there is…

Information Theory · Computer Science 2016-11-18 Eli Haim , Yuval Kochman , Uri Erez

In this paper we present a theoretical performance analysis of the maximum ratio combining (MRC) rule for channel-aware decision fusion over multiple-input multiple-output (MIMO) channels for (conditionally) dependent and independent local…

Information Theory · Computer Science 2013-11-07 D. Ciuonzo , G. Romano , P. Salvo Rossi

The code that combines channel estimation and error protection has received general attention recently, and has been considered a promising methodology to compensate multi-path fading effect. It has been shown by simulations that such code…

Information Theory · Computer Science 2007-12-18 Chia-Lung Wu , Po-Ning Chen , Yunghsiang S. Han , Ming-Hsin Kuo

We consider a broadcast channel with a degraded message set, in which a single transmitter sends a common message to two receivers and a private message to one of the receivers only. The main goal of this work is to find new lower bounds to…

Information Theory · Computer Science 2009-06-09 Yonatan Kaspi , Neri Merhav

A new single-letter achievable rate region is proposed for the two-user discrete memoryless multiple-access channel(MAC) with noiseless feedback. The proposed region includes the Cover-Leung rate region [1], and it is shown that the…

Information Theory · Computer Science 2014-03-31 Ramji Venkataramanan , S. Sandeep Pradhan

Upper and lower bounds on the error probability of linear codes under maximum-likelihood (ML) decoding are shortly surveyed and applied to ensembles of codes on graphs. For upper bounds, focus is put on Gallager bounding techniques and…

Information Theory · Computer Science 2007-07-13 Igal Sason , Shlomo Shamai

In this work, a new lower bound for the maximal error probability of a two-user discrete memoryless (DM) multiple-access channel (MAC) is derived. This is the first bound of this type that explicitly imposes independence of the users' input…

Information Theory · Computer Science 2008-03-27 Ali Nazari , Sandeep Pradhan , Achilleas Anastasopoulos

Optimal decoding of bit interleaved coded modulation (BICM) MIMO-OFDM where an imperfect channel estimate is available at the receiver is investigated. First, by using a Bayesian approach involving the channel a posteriori density, we…

Networking and Internet Architecture · Computer Science 2007-08-13 Sajad Sadough , Pablo Piantanida , Pierre Duhamel

In applications such as remote estimation and monitoring, update packets are transmitted by power-constrained devices using short-packet codes over wireless networks. Therefore, networks need to be end-to-end optimized using information…

Information Theory · Computer Science 2023-12-05 Sudarsanan A. K. , Vineeth B. S. , Chandra R. Murthy

In this work, a new upper bound for average error probability of a two-user discrete memoryless (DM) multiple-access channel (MAC) is derived. This bound can be universally obtained for all discrete memoryless MACs with given input and…

Information Theory · Computer Science 2009-01-09 Ali Nazari , Achilleas Anastasopoulos , S. Sandeep Pradhan

Adder MAC is a simple noiseless multiple-access channel (MAC), where if users send messages $X_1,\ldots,X_h\in \{0,1\}^n$, then the receiver receives $Y = X_1+\cdots+X_h$ with addition over $\mathbb{Z}$. Communication over the noiseless…

Information Theory · Computer Science 2018-09-21 Yuzhou Gu

A recent result of Zheng and Tse states that over a quasi-static channel, there exists a fundamental tradeoff, referred to as the diversity-multiplexing gain (D-MG) tradeoff, between the spatial multiplexing gain and the diversity gain that…

Information Theory · Computer Science 2007-07-13 Petros Elia , K. Raj Kumar , Sameer A. Pawar , P. Vijay Kumar , Hsiao-feng Lu

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

This paper addresses the fundamental characteristics of information exchange via multihop network coding over two-way relaying in a wireless ad hoc network. The end-to-end rate regions achieved by time-division multihop (TDMH), MAC-layer…

Information Theory · Computer Science 2009-02-16 Chun-Hung Liu , Feng Xue , Jeffrey G. Andrews

We analyze two-user single-antenna fading interference channels with perfect receive channel state information (CSI) and no transmit CSI. We compute the diversity-multiplexing tradeoff (DMT) region of a fixed-power-split Han and Kobayashi…

Information Theory · Computer Science 2009-05-07 Cemal Akcaba , Helmut Boelcskei

We consider the decoding of bit interleaved coded modulation (BICM) applied to multiband OFDM for practical scenarios where only a noisy (possibly very bad) estimate of the channel is available at the receiver. First, a decoding metric…

Networking and Internet Architecture · Computer Science 2007-08-13 Sajad Sadough , Pablo Piantanida , Pierre Duhamel

In this paper, we propose a new upper bound on the error probability performance of maximum-likelihood (ML) detection. The proposed approach provides a much tighter upper bound when compared to the traditionally used union bound, especially…

Information Theory · Computer Science 2022-08-01 Tian Han , Rajitha Senanayake , Peter Smith , Jamie Evans

In this paper we analyze the performance of 2by3 MIMOMCCDMA system in MATLAB which greatly reduces BER by increasing the efficiency of system. MIMO and MCCDMA system arrangement is used to decrease bit error rate and also figure a new…

Information Theory · Computer Science 2014-05-26 Mr. Atul Singh Kushwah , Mr. Sachin Manglasheril

This paper studies the performance of the uplink Non-Orthogonal Multiple Access (NOMA) with Joint Maximum-Likelihood Detector (JML). We present a generalized upper bound of bit-error rate (BER) expression of adaptive M-ary phase-shift…

Information Theory · Computer Science 2021-08-10 Hichem Semira , Ferdi Kara

The Dynamic Decode-and-Forward (DDF) protocol and the Hybrid DDF and Amplified-and-Forward (HDAF) protocol for the multiple-access relay channel (MARC) with quasi static fading are evaluated using the Zheng-Tse diversity-multiplexing…

Information Theory · Computer Science 2011-03-22 Chung-Pi Lee , Hsuan-Jung Su