مجله بین المللی نوآوری در علوم کامپیوتر و فناوری اطلاعات 2 1 Simultaneous Wireless Information and Power Transfer Optimization with Imperfect Channel State Information Simultaneous Wireless Information and Power Transfer Optimization with Imperfect Channel State Information 3 13 10.22051/jera.2021.31891.2698 FA Saeed Received M.S. degree in communication engineering, Electrical Eng. Dept. , Imam Reza International University, Mashhad, Iran Ebrahim Post Doc in communication, Assistant professor, Biomedical Eng. Dept. , Imam Reza International University, Mashhad, Iran. Simultaneous Wireless Information and Power Transfer (SWIPT) systems are vital to implement wireless charging in contemporary Broadcast Channel (BC) systems. We would design a multi-user multi-antenna BC by simultaneously maximizing the sum of harvested energy and minimizing the sum Mean Square Error (MSE) for symbol detection at each receiver under imperfect Channel State Information (CSI) condition. We will find the minimum sum of harvested energy and exploit the Semidefinite Relaxation (SDR) method to find the worst case of the sum MSE. This multi-objective problem can be recast as a Difference of Convex (DC) bilinear problem. The derived problem is solved using the Alternating Convex Search (ACS) method and the Penalty Convex-Concave Program (PCCP) procedure. Simulation results are employed to address the benefits of the proposed algorithm. Simultaneous Wireless Information and Power Transfer (SWIPT) systems are vital to implement wireless charging in contemporary Broadcast Channel (BC) systems. We would design a multi-user multi-antenna BC by simultaneously maximizing the sum of harvested energy and minimizing the sum Mean Square Error (MSE) for symbol detection at each receiver under imperfect Channel State Information (CSI) condition. We will find the minimum sum of harvested energy and exploit the Semidefinite Relaxation (SDR) method to find the worst case of the sum MSE. This multi-objective problem can be recast as a Difference of Convex (DC) bilinear problem. The derived problem is solved using the Alternating Convex Search (ACS) method and the Penalty Convex-Concave Program (PCCP) /downloadfilepdf/445207