Efficient multiuser detector based on box-constrained dichotomous coordinate descent and regularization  

作　　者：全智 刘杰 

机构地区：[1]Department of Electrical Engineering,Federal University of Juiz de Fora,Juiz de For a 36036900,Brazil [2]School of Information Engineering,Zhengzhou University [3]RF Engines Limited,Newport P0305WB,United Kingdom

出　　处：《Journal of Central South University》2012年第6期1570-1576,共7页中南大学学报（英文版）

摘　　要：The presented iterative multiuser detection technique was based on joint deregularized and box-constrained solution to quadratic optimization with iterations similar to that used in the nonstationary Tikhonov iterated algorithm.The deregularization maximized the energy of the solution,which was opposite to the Tikhonov regularization where the energy was minimized.However,combined with box-constraints,the deregularization forced the solution to be close to the binary set.It further exploited the box-constrained dichotomous coordinate descent algorithm and adapted it to the nonstationary iterative Tikhonov regularization to present an efficient detector.As a result,the worst-case and average complexity are reduced down as K2.8 and K2.5 floating point operation per second,respectively.The development improves the "efficient frontier" in multiuser detection,which is illustrated by simulation results.In addition,most operations in the detector are additions and bit-shifts.This makes the proposed technique attractive for fixed-point hardware implementation.The presented iterative multiuser detection technique was based on joint deregularized and box-constrained solution to quadratic optimization with iterations similar to that used in the nonstationary Tikhonov iterated algorithm. The deregularization maximized the energy of the solution, which was opposite to the Tikhonov regularization where the energy was minimized. However, combined with box-constraints, the deregularization forced the solution to be close to the binary set. It further exploited the box-constrained dichotomous coordinate descent algorithm and adapted it to the nonstationary iterative Tikhonov regularization to present an efficient detector. As a result, the worst-case and average complexity are reduced down as K28 and K25 floating point operation per second, respectively. The development improves the ＂efficient frontier＂ in multiuser detection, which is illustrated by simulation results. In addition, most operations in the detector are additions and bit-shifts, This makes the proposed technique attractive for fixed-point hardware implementation.

关 键 词：dichotomous coordinate descent de-regularization low complexity multiuser detection Tikhonov regularization 

分 类 号：TN929.533[电子电信—通信与信息系统]