Search

This letter studies the joint active and passive beamforming in intelligent reflecting surface (IRS)-enhanced wireless powered mobile edge computing (MEC) networks, in which a hybrid access point (HAP) is deployed to charge multiple wireless devices (WDs) and assist in computation of the offloaded tasks from the WDs. An IRS is deployed to enhance the downlink wireless power transfer (WPT) and the uplink tasks offloading (TO). To maximize the systems’ sum computation rate, an optimization problem is formulated by jointly optimizing the time assignment of WPT and TO, the active beamforming at the HAP, the transmit power and computing frequency of the WDs, and the passive beamforming at the IRS. To tackle the non-convex problem, we present an efficient algorithm by utilizing the alternating optimization (AO) and semidefinite relaxation (SDR) techniques. Simulation results show that by deploying IRS in the system, a significant computation rate gain can be achieved. Especially, when the IRS is closer to the WDs or the HAP, the much higher computation rate can be reached.

In this work, a multiple-input multiple-output (MIMO) broadcast channel under the energy harvesting (EH) constraint and the peak power constraint is investigated. The transmitter is equipped with a hybrid energy storage system consisting of a perfect super capacitor (SC) and an inefficient battery, where both elements are with limited energy storage capacities. In addition, the effect of data processing circuit power consumption is also addressed. To be specific, two extreme cases are studied here, where the first assumes ideal/zero circuit power consumption and the second considers a positive constant circuit power consumption where the circuit is always operating at its highest power level. The performance of these two extreme cases hence serve as the upper bound and the lower bound of the system performance in practice, respectively. In this setting, the offline scheduling with ideal and maximum circuit power consumption models are investigated. Their corresponding optimization problems are formulated and solved in terms of weighted sum-throughput. Further, we extend to a general circuit power consumption model. To complement this work, some intuitive online policies are presented for all cases. Interestingly, for the case with maximum circuit power consumption, a close-to-optimal online policy is presented and its performance is shown to be comparable to its offline counterpart in the numerical results.

A modified belief-propagation algorithm is proposed for decoding of irregular low-density parity-check codes. This algorithm effectively reduces the decoding complexity while achieving a BER performance near to or even better than that of the standard belief-propagation algorithm.