Learn More
This paper introduces a new and ubiquitous framework for establishing achievability results in network information theory problems. The framework uses random binning arguments and is based on a duality between channel and source coding problems. Furthermore, the framework uses pmf approximation arguments instead of counting and typicality. This allows for(More)
The discrete memoryless state-dependent relay channel (SD-RC) is considered in this study. Two main cases are investigated: SD-RC with non-causal channel state information (CSI) and SD-RC with causal CSI. In each case, the SD-RC with partial CSI at the source and the relay is considered. As special cases it includes three different situations in which(More)
This paper deals with the problem of multicasting a set of discrete memoryless correlated sources (DMCS) over a cooperative relay network. Necessary conditions with cut-set interpretation are presented. A Joint source-Wyner-Ziv encoding/sliding window decoding scheme is proposed, in which decoding at each receiver is done with respect to an ordered(More)
In this paper, we present a new generalization of the well- known Compress-and-Forward strategy for relay networks. We propose an offset decoding at destination, where destination considers an ordered partition of relays and decodes information of any partition with the help of information from prior partitions. We show that when we do not partition the set(More)
In this correspondence, we focus on the performance analysis of the widely-used minimum description length (MDL) source enumeration technique in array processing. Unfortunately, available theoretical analysis exhibit deviation from the simulation results. We present an accurate and insightful performance analysis for the probability of missed detection. We(More)
This paper proposes a novel technique to prove a one-shot version of achievability results in network information theory. The technique is not based on covering and packing lemmas. In this technique, we use a stochastic encoder and decoder with a particular structure for coding that resembles both the ML and the joint-typicality coders. Although stochastic(More)
In this paper, we consider a discrete memoryless state-dependent relay channel with non-causal Channel State Information (CSI). We investigate three different cases in which perfect channel states can be known non-causally: i) only to the source, ii) only to the relay or iii) both to the source and to the relay node. For these three cases we establish lower(More)
We propose computationally inexpensive and efficient solutions for signal activity detection of Phase Shift Keying (PSK) signals in Additive White Gaussian Noise. We consider the complex amplitude of the signal as well as the information sequence as the unknown parameters. In addition, the noise variance is assumed unknown. We derive the Generalized(More)