English
Related papers

Related papers: Uncoded Binary Signaling through Modulo AWGN Chann…

200 papers

The problem of transmitting a parameter value over an additive white Gaussian noise (AWGN) channel is considered, where, in addition to the transmitter and the receiver, there is a helper that observes the noise non-causally and provides a…

Information Theory · Computer Science 2024-10-28 Anatoly Khina , Neri Merhav

It is well known that orthogonal coding can be used to approach the Shannon capacity of the power-constrained AWGN channel without a bandwidth constraint. This correspondence describes a semi-orthogonal variation of pulse position…

Information Theory · Computer Science 2007-07-13 Anant Sahai

A scheme is proposed that combines probabilistic signal shaping with bit-metric decoding. The transmitter generates symbols according to a distribution on the channel input alphabet. The symbols are labeled by bit strings. At the receiver,…

Information Theory · Computer Science 2014-04-22 Georg Böcherer

We consider the Additive White Gaussian Noise channel with Binary Phase Shift Keying modulation. Our aim is to enable an algebraic hard decision Bounded Minimum Distance decoder for a binary block code to exploit soft information obtained…

Information Theory · Computer Science 2009-05-18 Christian Senger , Vladimir Sidorenko , Victor Zyablov

Inspired by compressive sensing principles, we propose novel error control coding techniques for communication systems. The information bits are encoded in the support and the non-zero entries of a sparse signal. By selecting a dictionary…

Information Theory · Computer Science 2021-02-09 Madhusudan Kumar Sinha , Arun Pachai Kannu

In contrast to a maximum-likelihood decoder, it is often desirable to use an incomplete decoder that can detect its decoding errors with high probability. One common choice is the bounded distance decoder. Bounds are derived for the total…

Information Theory · Computer Science 2012-07-26 Kenneth Andrews , Sam Dolinar

We consider a communication problem in which the receiver must first detect the presence of an information packet and, if detected, decode the message carried within it. We present general nonasymptotic upper and lower bounds on the maximum…

Information Theory · Computer Science 2021-09-29 Alejandro Lancho , Johan Östman , Giuseppe Durisi

Lattice coding and decoding have been shown to achieve the capacity of the additive white Gaussian noise (AWGN) channel. This was accomplished using a minimum mean-square error scaling and randomization to transform the AWGN channel into a…

Information Theory · Computer Science 2013-08-08 Charles H. Swannack , Uri Erez , Gregory W. Wornell

While the channel capacity reflects a theoretical upper bound on the achievable information transmission rate in the limit of infinitely many bits, it does not characterise the information transfer of a given encoding routine with finitely…

Neurons and Cognition · Quantitative Biology 2017-04-05 Sebastian Weichwald , Tatiana Fomina , Bernhard Schölkopf , Moritz Grosse-Wentrup

We consider covert communication, i.e., hiding the presence of communication from an adversary for multiple-input multiple-output (MIMO) additive white Gaussian noise (AWGN) channels. We characterize the maximum covert coding rate under a…

Signal Processing · Electrical Eng. & Systems 2021-01-25 Ahmed Bendary , Amr Abdelaziz , C. Emre Koksal

The rising interest in applications requiring the transmission of small amounts of data has recently lead to the development of accurate performance bounds and of powerful channel codes for the transmission of short-data packets over the…

Information Theory · Computer Science 2017-05-17 Gianluigi Liva , Giuseppe Durisi , Marco Chiani , Shakeel Salamat Ullah , Soung Chang Liew

The capacity of the AWGN broadcast channel is achieved by superposition coding, but superposition of individual coded modulations expands the modulation alphabet and distorts its configuration. Coded modulation over a broadcast channel…

Information Theory · Computer Science 2016-10-31 Ahmed Abotabl , Aria Nosratinia

We study the problem of the transmission of currently observed time variable signals via a channel that is capable of sending a single binary signal only for each measurement of the underlying process. For encoding and decoding, we suggest…

Information Theory · Computer Science 2015-01-22 Nikolai Dokuchaev

We consider the problem of jointly optimum modulation and estimation of a real-valued random parameter, conveyed over an additive white Gaussian noise (AWGN) channel, where the performance metric is the large deviations behavior of the…

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

We consider the problem of modulating the value of a parameter onto a band-limited signal to be transmitted over a continuous-time, additive white Gaussian noise (AWGN) channel, and estimating this parameter at the receiver. The performance…

Information Theory · Computer Science 2016-06-22 Nir Weinberger , Neri Merhav

A framework is proposed that allows for a joint description and optimization of both binary polar coding and $2^m$-ary digital pulse-amplitude modulation (PAM) schemes such as multilevel coding (MLC) and bit-interleaved coded modulation…

Information Theory · Computer Science 2013-02-13 Mathis Seidl , Andreas Schenk , Clemens Stierstorfer , Johannes B. Huber

For high speed ultra-wideband (UWB) communication systems, the multipath interference exhibits a primary obstacle to improve transmission performance. In order to enhance the signal to interference plus noise ratio (SINR) in the receiver, a…

Signal Processing · Electrical Eng. & Systems 2018-01-09 Yang Cao , Chao Luo , Xuanli Wu

We present a square root limit on the amount of information transmitted reliably and with low probability of detection (LPD) over additive white Gaussian noise (AWGN) channels. Specifically, if the transmitter has AWGN channels to an…

Information Theory · Computer Science 2013-10-18 Boulat A. Bash , Dennis Goeckel , Don Towsley

The performance of maximum-likelihood (ML) decoded binary linear block codes is addressed via the derivation of tightened upper bounds on their decoding error probability. The upper bounds on the block and bit error probabilities are valid…

Information Theory · Computer Science 2007-07-13 M. Twitto , I. Sason , S. Shamai

This letter considers a network comprising a transmitter, which employs random linear network coding to encode a message, a legitimate receiver, which can recover the message if it gathers a sufficient number of linearly independent coded…

Cryptography and Security · Computer Science 2022-03-08 Amjad Saeed Khan , Andrea Tassi , Ioannis Chatzigeorgiou
‹ Prev 1 2 3 10 Next ›