Related papers: Beyond the Channel Capacity of BPSK Input
The field of the coded modulations witnessed its golden era as the simulated achievable bit rates (ABRs) were getting close to the channel capacities of the finite alphabet inputs. However, when working at a single channel, the previous…
In this paper, we propose a method layering two independent BPSK symbol streams in parallel transmission through a single additive white Gaussian noise (AWGN) channel and investigate its achievable data rate (ADR). The receiver processes…
A method is proposed, referred to as the cocktail BPSK, to use two independent BPSK streams layered in a parallel transmission through the additive white Gaussian channel. The critical point of the method is to translate the interference…
Shannon channel capacity of an additive white Gaussian noise channel is the highest reliable transmission bit rate (RTBR) with arbitrary small error probability. However, the authors find that the concept is correct only when the channel…
The present paper proposes a novel transmission strategy, referred to as cocktail BPSK, whereat two independent BPSKs are superposed with the non-orthogonal basis in a parallel transmission. In contrast to the conventional signal…
This paper proposes a novel transmission strategy, referred to as layered BPSK, which allows two independent symbol streams to be layered at the transmitter on a non-orthogonal basis and isolated from each other at the receiver without…
This paper proposes a novel transmission strategy, referred to as cocktail BPSK, where two independent BPSK symbols are layered with various weights to be transmitted and, capitalizing on the cross power utilization, will be demodulated at…
In this work, we derive achievable rate regions for the three-user interference channels with asymmetric transmitter cooperation and various decoding capabilities at the receivers. The three-user channel facilitates different ways of…
This paper focuses on $ K $-receiver discrete-time memoryless broadcast channels (DM-BCs) with private messages, where the transmitter wishes to convey $K$ private messages to $K$ receivers respectively. A general inner bound on the…
We consider a broadcast communication system over parallel sub-channels where the transmitter sends three messages: a common message to two users, and two confidential messages to each user which need to be kept secret from the other user.…
This paper presents a new method, referred to as the cocktail intra-symbol-code, to reveal the possibility of exceeding the channel limit of QPSK input by transmitting independent signals in parallel manner and separating them the receiver,…
In this paper, a class of broadcast interference channels (BIC) is investigated, where one of the two broadcast receivers is subject to interference coming from a point-to-point transmission. For a general discrete memoryless broadcast…
We consider a broadcast scenario where one transmitter communicates with two receivers under quality-of-service constraints. The transmitter initially employs superposition coding strategies with arbitrarily distributed signals and sends…
We study the Han-Kobayashi (HK) achievable sum rate for the two-user symmetric Gaussian interference channel. We find the optimal power split ratio between the common and private messages (assuming no time-sharing), and derive a closed form…
In the earlier version of this paper, it was wrongly claimed that time-sharing is required to achieve the capacity region of the Gaussian interference channel to within one bit, especially at corner points. The flaw in the argument of the…
We study the problem of joint information and energy transfer in a binary two-hop channel with an energy harvesting relay. We consider a finite battery size at the relay and energy loss in transmitting energy. In other words, to be able to…
We study private broadcasting of two messages to two groups of receivers over independent parallel channels. One group consists of an arbitrary number of receivers interested in a common message, whereas the other group has only one…
Achievable rate regions and outer bounds are derived for three-user interference channels where the transmitters cooperate in a unidirectional manner via a noncausal message-sharing mechanism. The three-user channel facilitates different…
This paper introduces novel transmit beamforming approaches for the cognitive radio (CR) Z-channel. The proposed transmission schemes exploit non-causal information about the interference at the SBS to re-design the CR beamforming…
This paper addresses the problem of computing the achievable rates for two (and three) users sharing a same frequency band without coordination and thus interfering with each other. It is thus primarily related to the field of cognitive…