Efficient multiuser detector based on box-constrained deregularization and its FPGA design

Multiuser detection can be described as a quadratic optimization problem with binary constraint. Many techniques are available to find approximate solution to this problem. These tech- niques can be characterized in terms of complexity and detection performance. The ＂efficient frontier＂ of known techniques include the decision-feedback, branch-and-bound and probabilistic data association detectors. The presented iterative multiuser detection technique is based on joint deregularized and box-constrained so- lution to quadratic optimization with iterations similar to that used in the nonstationary Tikhonov iterated algorithm. The deregulari- zation maximizes the energy of the solution, this is opposite to the Tikhonov regularization where the energy is minimized. However, combined with box-constraints, the deregularization forces the solution to be close to the binary set. We further exploit the box- constrained dichotomous coordinate descent （DCD） algorithm and adapt it to the nonstationary iterative Tikhonov regularization to present an efficient detector. As a result, the worst-case and aver- age complexity are reduced down to K28 and K2~ floating point operation per second, respectively. The development improves the ＂efficient frontier＂ in multiuser detection, which is illustrated by simulation results. Finally, a field programmable gate array （FPGA） design of the detector is presented. The detection performance obtained from the fixed-point FPGA implementation shows a good match to the floating-point implementation.

Exact Box-Constrained Economic Operating Region for Power Grids Considering Renewable Energy Sources

The growing integration of renewable energy sources manifests as an effective strategy for reducing carbon emissions. This paper strives to efficiently approximate the set of optimal scheduling plans(OSPs) to enhance the performance of the steady-state adaptive cruise method(SACM) of power grid, improving the ability of dealing with operational uncertainties. Initially, we provide a mathematical definition of the exact boxconstrained economic operating region(EBC-EOR) for the power grid and its dispatchable components. Following this, we introduce an EBC-EOR formulation algorithm and the corresponding bi-level optimization models designed to explore the economic operating boundaries. In addition, we propose an enhanced big-M method to expedite the computation of the EBCEOR. Finally, the effectiveness of the EBC-EOR formulation, its economic attributes, correlation with the scheduling plan underpinned by model predictive control, and the significant improvement in computational efficiency(over twelvefold) are verified through case studies conducted on two test systems..

Monotone projected gradient methods for large-scale box-constrained quadratic programming

Inspired by the success of the projected Barzilai-Borwein (PBB) method for largescale box-constrained quadratic programming, we propose and analyze the monotone projected gradient methods in this paper. We show by experiments and analyses that for the new methods,it is generally a bad option to compute steplengths based on the negative gradients. Thus in our algorithms, some continuous or discontinuous projected gradients are used instead to compute the steplengths. Numerical experiments on a wide variety of test problems are presented, indicating that the new methods usually outperform the PBB method.