Minimal Transmit Power in Parallel Vector Broadcast Channels With Linear Precoding


We consider the communication over a set of parallel multiple-input single-output (MISO) broadcast channels with separate linear precoding on each of them. In this setup, we study the problem of fulfilling per-user quality of service constraints, expressed in terms of rates, using minimal transmit power. By means of a dual decomposition approach and a branch-and-bound algorithm solving the arising nonconvex subproblems, we find the so far unknown globally optimal solution for the case of linear precoding with time sharing. Although prohibitively complex for implementation in a practical system, the new power minimization method is highly interesting from a theoretical point of view as it can be used to quantify the performance gap between the outcome of heuristic algorithms and the theoretical limitations of the system with linear transceivers. We also extend the approach such that zero-forcing constraints can be handled.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE : Congestion Control for Background Data Transfers With Minimal Delay Impact - 2017 ABSTRACT: Congestion management protocols for background data are commonly conceived and designed to emulate low priority traffic,
PROJECT TITLE : Channel-Adaptive Packetization Policy for Minimal Latency and Maximal Energy Efficiency - 2016 ABSTRACT: This paper considers the matter of delay-optimal bundling of the input symbols into transmit packets
PROJECT TITLE :First and Last Triggering Event Approaches for Replacement With Minimal RepairsABSTRACT:To make effective use of a running system, this paper proposes that, when replacement times may be scheduled at a planned time
PROJECT TITLE :Maximal Level Minimal Path Vectors of a Two-Terminal Undirected NetworkABSTRACT:A 2-terminal flow network is sometimes defined as a directed graph, or a digraph; but there are a variety of applications where it's
PROJECT TITLE :Approaching Minimal Time Control Sequences for Timed Petri NetsABSTRACT:The most contribution of this note is to propose algorithms that incrementally compute control sequences that drive the marking of timed Petri

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry