Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userMaximizing the Mutual Information of Multi-Antenna Links Under an Interfered Receiver Power Constraint
57
0
0.0
(
0
)
Added by
George Papageorgiou
Publication date
2017
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Single-user multiple-input / multiple-output (SU-MIMO) communication systems have been successfully used over the years and have provided a significant increase on a wireless links capacity by enabling the transmission of multiple data streams. Assuming channel knowledge at the transmitter, the maximization of the mutual information of a MIMO link is achieved by finding the optimal power allocation under a given sum-power constraint, which is in turn obtained by the water-filling (WF) algorithm. However, in spectrum sharing setups, such as Licensed Shared Access (LSA), where a primary link (PL) and a secondary link (SL) coexist, the power transmitted by the SL transmitter may induce harmful interference to the PL receiver. While such co-existing links have been considered extensively in various spectrum sharing setups, the mutual information of the SL under a constraint on the interference it may cause to the PL receiver has, quite astonishingly, not been evaluated so far. In this paper, we solve this problem, find its unique optimal solution and provide the power allocation policy and corresponding precoding solution that achieves the optimal capacity under the imposed constraint. The performance of the optimal solution and the penalty due to the interference constraint are evaluated over some indicative Rayleigh fading channel conditions and interference thresholds. We believe that the obtained results are of general nature and that they may apply, beyond spectrum sharing, to a variety of applications that admit a similar setup.
rate research
Read More
Powering mobiles using microwave emph{power transfer} (PT) avoids the inconvenience of battery recharging by cables and ensures uninterrupted mobile operation. The integration of PT and emph{information transfer} (IT) allows wireless PT to be realized by building on the existing infrastructure for IT and also leads to compact mobile designs. As a result, emph{simultaneous wireless information and power transfer} (SWIPT) has emerged to be an active research topic that is also the theme of this paper. In this paper, a practical SWIPT system is considered where two multi-antenna stations perform separate PT and IT to a multi-antenna mobile to accommodate their difference in ranges. The mobile dynamically assigns each antenna for either PT or IT. The antenna partitioning results in a tradeoff between the MIMO IT channel capacity and the PT efficiency. The optimal partitioning for maximizing the IT rate under a PT constraint is a NP-hard integer program, and the paper proposes solving it via efficient greedy algorithms with guaranteed performance. To this end, the antenna-partitioning problem is proved to be one that optimizes a sub-modular function over a matroid constraint. This structure allows the application of two well-known greedy algorithms that yield solutions no smaller than the optimal one scaled by factors $(1-1/e)$ and 1/2, respectively.
Simultaneous wireless information and power transfer (SWIPT) is an appealing research area because both information and energy can be delivered to wireless devices simultaneously. In this paper, we propose a diplexer-based receiver architecture that can utilizes both the doubling frequency and baseband signals after the mixer. The baseband signals are used for information decoding and the doubling frequency signals are converted to direct current for energy harvesting. We analyze the signal in the receiver and find that the power of the energy harvested is equal to that of information decoded. Therefore, the diplexer can be used as a power splitter with a power splitting factor of 0.5. Specifically, we consider a multiuser multi-input single-output (MISO) system, in which each user is equipped with the newly proposed receiver. The problem is formulated as an optimization problem that minimizes the total transmitted power subject to some constraints on each users quality of service and energy harvesting demand. We show that the problem thus formulated is a non-convex quadratically constrained quadratic program (QCQP), which can be solved by semi-definite relaxation.
Age of Incorrect Information (AoII) is a newly introduced performance metric that considers communication goals. Therefore, comparing with traditional performance metrics and the recently introduced metric - Age of Information (AoI), AoII achieves better performance in many real-life applications. However, the fundamental nature of AoII has been elusive so far. In this paper, we consider the AoII in a system where a transmitter sends updates about a multi-state Markovian source to a remote receiver through an unreliable channel. The communication goal is to minimize AoII subject to a power constraint. We cast the problem into a Constrained Markov Decision Process (CMDP) and prove that the optimal policy is a mixture of two deterministic threshold policies. Afterward, by leveraging the notion of Relative Value Iteration (RVI) and the structural properties of threshold policy, we propose an efficient algorithm to find the threshold policies as well as the mixing coefficient. Lastly, numerical results are laid out to highlight the performance of AoII-optimal policy.
To provide an efficient approach to characterize the input-output mutual information (MI) under additive white Gaussian noise (AWGN) channel, this short report fits the curves of exact MI under multilevel quadrature amplitude modulation (M-QAM) signal inputs via multi-exponential decay curve fitting (M-EDCF). Even though the definition expression for instanious MI versus Signal to Noise Ratio (SNR) is complex and the containing integral is intractable, our new developed fitting formula holds a neat and compact form, which possesses high precision as well as low complexity. Generally speaking, this approximation formula of MI can promote the research of performance analysis in practical communication system under discrete inputs.
This paper studies the problem of secure communcation over the two-receiver discrete memoryless broadcast channel with one-sided receiver side information and with a passive eavesdropper. We proposed a coding scheme which is based upon the superposition-Marton framework. Secrecy techniques such as the one-time pad, Carleial-Hellman secrecy coding and Wyner serecy coding are applied to ensure individual secrecy. This scheme is shown to be capacity achieving for some cases of the degraded broadcast channel. We also notice that one-sided receiver side information provides the advantage of rate region improvement, in particular when it is available at the weaker legitimate receiver.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
