28,424 research outputs found
Heterogeneous Batch Distillation Processes: Real System Optimisation
In this paper, optimisation of batch distillation processes is considered. It deals with real systems with rigorous simulation of the processes through the resolution full MESH differential algebraic equations. Specific software architecture is developed, based on the BatchColumnÂź simulator and on both SQP and GA numerical algorithms, and is able to optimise sequential batch columns as long as the column transitions are set.
The efficiency of the proposed optimisation tool is illustrated by two case studies. The first one concerns heterogeneous batch solvent recovery in a single distillation column and shows that significant economical gains are obtained along with improved process conditions. Case two concerns the optimisation of two sequential homogeneous batch distillation columns and demonstrates the capacity to optimize several sequential dynamic different processes. For such multiobjective complex problems, GA is preferred to SQP that is able to improve specific GA solutions
Robust Transmission in Downlink Multiuser MISO Systems: A Rate-Splitting Approach
We consider a downlink multiuser MISO system with bounded errors in the
Channel State Information at the Transmitter (CSIT). We first look at the
robust design problem of achieving max-min fairness amongst users (in the
worst-case sense). Contrary to the conventional approach adopted in literature,
we propose a rather unorthodox design based on a Rate-Splitting (RS) strategy.
Each user's message is split into two parts, a common part and a private part.
All common parts are packed into one super common message encoded using a
public codebook, while private parts are independently encoded. The resulting
symbol streams are linearly precoded and simultaneously transmitted, and each
receiver retrieves its intended message by decoding both the common stream and
its corresponding private stream. For CSIT uncertainty regions that scale with
SNR (e.g. by scaling the number of feedback bits), we prove that a RS-based
design achieves higher max-min (symmetric) Degrees of Freedom (DoF) compared to
conventional designs (NoRS). For the special case of non-scaling CSIT (e.g.
fixed number of feedback bits), and contrary to NoRS, RS can achieve a
non-saturating max-min rate. We propose a robust algorithm based on the
cutting-set method coupled with the Weighted Minimum Mean Square Error (WMMSE)
approach, and we demonstrate its performance gains over state-of-the art
designs. Finally, we extend the RS strategy to address the Quality of Service
(QoS) constrained power minimization problem, and we demonstrate significant
gains over NoRS-based designs.Comment: Accepted for publication in IEEE Transactions on Signal Processin
A randomised primal-dual algorithm for distributed radio-interferometric imaging
Next generation radio telescopes, like the Square Kilometre Array, will
acquire an unprecedented amount of data for radio astronomy. The development of
fast, parallelisable or distributed algorithms for handling such large-scale
data sets is of prime importance. Motivated by this, we investigate herein a
convex optimisation algorithmic structure, based on primal-dual
forward-backward iterations, for solving the radio interferometric imaging
problem. It can encompass any convex prior of interest. It allows for the
distributed processing of the measured data and introduces further flexibility
by employing a probabilistic approach for the selection of the data blocks used
at a given iteration. We study the reconstruction performance with respect to
the data distribution and we propose the use of nonuniform probabilities for
the randomised updates. Our simulations show the feasibility of the
randomisation given a limited computing infrastructure as well as important
computational advantages when compared to state-of-the-art algorithmic
structures.Comment: 5 pages, 3 figures, Proceedings of the European Signal Processing
Conference (EUSIPCO) 2016, Related journal publication available at
https://arxiv.org/abs/1601.0402
- âŠ