相关论文: Partial Decode-Forward Binning Schemes for the Cau…
We investigate the capacity of a multiple access channel with cooperating encoders where partial state information is known to each encoder and full state information is known to the decoder. The cooperation between the encoders has a…
The problem of simultaneous multicasting of multiple messages with the help of a relay terminal is considered. In particular, a model is studied in which a relay station simultaneously assists two transmitters in multicasting their…
Various sectors are likely to carry a set of emerging applications while targeting a reliable communication with low latency transmission. To address this issue, upon a spectrally-efficient transmission, this paper investigates the…
Over the past several years, we have witnessed impressive progress in the field of learned image compression. Recent learned image codecs are commonly based on autoencoders, that first encode an image into low-dimensional latent…
We propose a new decentralized coded caching scheme for a two-phase caching network, where the data placed in user caches in the prefetching phase are random portions of a maximal distance separable (MDS) coded version of the original…
In this paper, a buffered decode and forward (DF) relay based three-node underlay cooperative cognitive relay network (CRN) is considered with a direct path to the destination. The source and the relay use multiple rates, and joint rate and…
Compute and Forward (CF) is a promising relaying scheme which, instead of decoding single messages or forwarding/amplifying information at the relay, decodes linear combinations of the simultaneously transmitted messages. The current…
In this paper, we propose a new coding scheme and establish new bounds on the capacity region for the multi-sender unicast index-coding problem. We revisit existing partitioned Distributed Composite Coding (DCC) proposed by Sadeghi et al.…
In this paper, we study the state-dependent two-user interference channel, where the state information is non-causally known at both transmitters but unknown to either of the receivers. We first propose two coding schemes for the discrete…
In this paper the cognitive interference channel with a common message, a variation of the classical cognitive interference channel in which the cognitive message is decoded at both receivers, is studied. For this channel model new outer…
In a distributed space-time coding scheme, based on the relay channel model, the relay nodes co-operate to linearly process the transmitted signal from the source and forward them to the destination such that the signal at the destination…
A digital twin (DT) leverages a virtual representation of the physical world, along with communication (e.g., 6G), computing (e.g., edge computing), and artificial intelligence (AI) technologies to enable many connected intelligence…
The Compute-and-Forward relaying strategy achieves high computation rates by decoding linear combinations of transmitted messages at intermediate relays. However, if the involved relays independently choose which combinations of the…
In this paper, a multi-source multi-relay cooperative wireless network with binary modulation and binary network coding is studied. The system model encompasses: i) a demodulate-and-forward protocol at the relays, where the received packets…
This work focuses on studying the half-duplex (HD) relaying in the Multiple Access Relay Channel (MARC) and the Compound Multiple Access Channel with a Relay (cMACr). A generalized Quantize-and-Forward (GQF) has been proposed to establish…
In this paper we investigate the practical design for the multiple-antenna cognitive radio (CR) networks sharing the geographically used or unused spectrum. We consider a single cell network formed by the primary users (PU), which are…
In this paper, beam training and beam tracking are investigated for extremely large-scale multiple-input-multiple-output communication systems with partially-connected hybrid combining structures. Firstly, we propose a two-stage…
A Han-Kobayashi based achievable scheme is presented for ergodic fading two-user Gaussian interference channels (IFCs) with perfect channel state information at all nodes and Gaussian codebooks with no time-sharing. Using max-min…
Efficiency is crucial to the online recommender systems. Representing users and items as binary vectors for Collaborative Filtering (CF) can achieve fast user-item affinity computation in the Hamming space, in recent years, we have…
In this paper, we investigate problems of communication over physically degraded, state-dependent broadcast channels (BCs) with cooperating decoders. Two different setups are considered and their capacity regions are characterized. First,…