Results 221 to 230 of about 52,700 (275)

Short-Packet Communications in Multi-Antenna Cooperative NOMA Networks with Hardware Impairments. [PDF]

Sensors (Basel)
Zhang X, Chen D, Hu J, Sun X, Wang B, Zhang D.   +5 more
europepmc   +1 more source

Study on the anti-interference characteristics of neuronal networks: a comparative study of chemical synapses and electrical synapse. [PDF]

Front Neurosci
Li X, Lu M.
europepmc   +1 more source

Hard meets soft: tuning binary ferrofluids.

Nanoscale
Khelfallah M, Novak EV, Kuznetsov AA, Mostarac D, Daffé N, Sikora M, Neveu S, Zečević J, Meeldijk JD, Taverna D, Sainctavit P, Rovezzi M, Elnaggar H, Bertuit E, Mille N, Belkhou R, Dupuis V, Carvallo C, Juhin A, Kantorovich SS.   +19 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Superposition codes for mismatched decoding

2013 IEEE International Symposium on Information Theory, 2013
An achievable rate is given for discrete memoryless channels with a given (possibly suboptimal) decoding rule. The result is obtained using a refinement of the superposition coding ensemble. The rate is tight with respect to the ensemble average, and can be weakened to the LM rate of Hui and Csiszar-Korner, and to Lapidoth's rate based on parallel ...
Jonathan Scarlett, Alfonso Martinez, Albert Guillen i Fabregas   +2 more
openaire   +1 more source

Implementation of Sparse Superposition Codes

IEEE Transactions on Signal Processing, 2017
Sparse superposition codes (SSCs) are capacity achieving codes whose decoding process is a linear sensing problem. Decoding approaches thus exploit the approximate message passing algorithm, which has been proven to be effective in compressing sensing.
Carlo Condo, Warren J. Gross
openaire   +1 more source

Superposition coding in the combination network

2016 IEEE International Symposium on Information Theory (ISIT), 2016
We present an inner bound for the combination network based on superposition coding and partial interference decoding. This inner bound is tight in the three-user and K-user symmetric cases, where capacity has been previously characterized. However, unlike previous achievability schemes, the scheme presented herein does not require network coding.
Henry P. Romero, Mahesh Kumar Varanasi
openaire   +1 more source

Superposition coding in rewritable channels

2010 Information Theory and Applications Workshop (ITA), 2010
We introduce the notions of superposition coding and sequential decoding in the context of rewritable channels. Using these concepts we will show that for k 1 > k 0 , C(k 1 ) ≥ C(k 0 )+log(k1/k0), where C(·) is the capacity of the rewritable channel for a given cost. A consequence of this result is that C(k) ≥ C(1) + log k, where C(1) is the classical
L. A. Lastras-Montao, Thomas Mittelholzer, Michele Franceschini   +2 more
openaire   +1 more source

Superposition coding in an adversarial environment

2011 45th Annual Conference on Information Sciences and Systems, 2011
In this paper we will consider a jamming environment in a game theoretic framework. This framework includes a transmitting node, a receiving node and a jammer. The jammer is assumed to be a Gaussian jammer with a flat PSD. We will consider two transmitting scenarios; a scenario when the transmitter has two strategies for transmission; a low rate code ...
Koorosh Firouzbakht, Guevara Noubir, Masoud Salehi   +2 more
openaire   +1 more source

Polar Coded Superposition Modulation

2019 IEEE 19th International Conference on Communication Technology (ICCT), 2019
A scheme for polar coded superposition modulation is proposed. In Gaussian channels, no active shaping is required in this scheme, compared with multi-level coded modulation and bit interleaved coded modulation. Co-optimization of polar coding and modulation can increase bandwidth efficiency while improving transmission reliability.
Xueying Wang, Zhisong Bie
openaire   +1 more source

Superposition Coded Modulation for Cooperative Communications

2012 IEEE Vehicular Technology Conference (VTC Fall), 2012
A Turbo Trellis-Coded Modulation (TTCM) aided superposition modulation scheme is conceived for a Decode-and-Forward (DAF) based cooperative communication system. More specifically, two source nodes communicate simultaneously with the same destination node via a relay node.
Hua Sun, Soon Xin Ng, Lajos Hanzo
openaire   +1 more source