English
Related papers

Related papers: PEP Analysis of Selective Decode and Forward Proto…

200 papers

Collaborative beamforming enables nodes in a wireless network to transmit a common message over long distances in an energy efficient fashion. However, the process of making available the same message to all collaborating nodes introduces…

Information Theory · Computer Science 2008-01-22 Lun Dong , Athina P. Petropulu , H. Vincent Poor

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

An opportunistic relay selection based on instantaneous knowledge of channels is considered to increase security against eavesdroppers. The closed-form expressions are derived for the average secrecy rates and the outage probability when…

Information Theory · Computer Science 2010-04-09 Xiaojun Sun , Chunming Zhao , Ming Jiang

The joint detection uses Kalman filtering (KF) to estimate the prior probability of control outputs to assist channel decoding. In this paper, we regard the joint detection as maximum a posteriori (MAP) decoding and derive the lower and…

Information Theory · Computer Science 2026-01-13 Jinnan Piao , Dong Li , Zhibo Li , Ming Yang , Xueting Yu , Jincheng Dai

We derive a sphere-packing error exponent for coded transmission over discrete memoryless channels with a fixed decoding metric. By studying the error probability of the code over an auxiliary channel, we find a lower bound to the…

Information Theory · Computer Science 2022-12-29 Ehsan Asadi Kangarshahi , Albert Guillén i Fàbregas

The posterior matching scheme, for feedback encoding of a message point lying on the unit interval over memoryless channels, maximizes mutual information for an arbitrary number of channel uses. However, it in general does not always…

Information Theory · Computer Science 2019-01-10 Diego A. Mesa , Rui Ma , Siva K. Gorantla , Todd P. Coleman

In this paper, we study a dual-hop mixed power line communication and radio-frequency communication (PLC/RF) system, where the connection between the PLC link and the RF link is made by a decode-and-forward (DF) or amplify-and-forward (AF)…

Information Theory · Computer Science 2020-11-19 Liang Yang , Xiaoqin Yan , Sai Li , Daniel Benevides da Costa , Mohamed-Slim Alouini

This paper is concerned with a wireless system operating in MIMO fading channels with channel state information being known at both transmitter and receiver. By spatiotemporal subchannel selection and power control, it aims to minimize the…

Information Theory · Computer Science 2014-03-27 Dian-Wu Yue , Yichuang Sun

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

As the mobile application landscape expands, wireless networks are tasked with supporting various connection profiles, including real-time communications and delay-sensitive traffic. Among many ensuing engineering challenges is the need to…

Information Theory · Computer Science 2012-02-13 Fatemeh Hamidi-Sepehr , Jean-Francois Chamberland , Henry Pfister

The feasibility of physical-layer-based security approaches for wireless communications in the presence of one or more eavesdroppers is hampered by channel conditions. In this paper, cooperation is investigated as an approach to overcome…

Information Theory · Computer Science 2008-09-30 Lun Dong , Zhu Han , Athina P. Petropulu , H. Vincent Poor

The problem of optimal power allocation among the relays in a two-hop decode-and-forward cooperative relay network with independent Rayleigh fading channels is considered. It is assumed that only the relays that decode the source message…

Information Theory · Computer Science 2015-05-27 Arash Khabbazibasmenj , Sergiy A. Vorobyov

In this paper, we study the performance, in terms of the asymptotic error probability, of a user which communicates with a destination with the aid of a full-duplex in-band relay. We consider that the network is interference-limited, and…

Information Theory · Computer Science 2014-05-16 Andres Altieri , Leonardo Rey Vega , Pablo Piantanida , Cecilia G. Galarza

This paper investigates the symbol error probability~(SEP) of point-to-point massive multiple-input multiple-output (MIMO) systems using equally likely PAM, PSK, and square QAM signallings in the presence of transmitter correlation. The…

Information Theory · Computer Science 2019-01-03 Zheng Dong , Jian-Kang Zhang , He Chen

We study the outage probability of opportunistic relay selection in decode-and-forward relaying with secrecy constraints. We derive the closed-form expression for the outage probability. Based on the analytical result, the asymptotic…

Information Theory · Computer Science 2011-11-16 Xiaojun Sun , Chunming Zhao

Among many submissions to the NIST post-quantum cryptography (PQC) project, NewHope is a promising key encapsulation mechanism (KEM) based on the Ring-Learning with errors (Ring-LWE) problem. Since NewHope is an indistinguishability…

Cryptography and Security · Computer Science 2020-03-09 Minki Song , Seunghwan Lee , Eunsang Lee , Dong-Joon Shin , Young-Sik Kim , Jong-Seon No

A clear understanding the behavior of the error probability (EP) as a function of signal-to-noise ratio (SNR) and other system parameters is fundamental for assessing the design of digital wireless communication systems.We propose an…

Information Theory · Computer Science 2016-11-15 Andrea Conti , Dmitry Panchenko , Sergiy Sidenko , Velio Tralli

Consider the communication of a single-user aided by a nearby relay involved in a large wireless network where the nodes form an homogeneous Poisson point process. Since this network is interference-limited the asymptotic error probability…

Information Theory · Computer Science 2011-03-14 Andres Altieri , Leonardo Rey Vega , Cecilia G. Galarza , Pablo Piantanida

We derive a single-letter upper bound to the mismatched-decoding capacity for discrete memoryless channels. The bound is expressed as the mutual information of a transformation of the channel, such that a maximum-likelihood decoding error…

Information Theory · Computer Science 2021-02-16 Ehsan Asadi Kangarshahi , Albert Guillén i Fàbregas

Orthogonal time frequency space (OTFS) modulation has been proposed recently as a new waveform in the context of doubly-selective multi-path channels. This article proposes a novel pilot design that improves OTFS spectral efficiency (SE)…

Signal Processing · Electrical Eng. & Systems 2025-03-20 Davide Bergamasco , Federico Clazzer , Andrea Munari , Paolo Casari