TY - GEN
T1 - Iterative multiuser joint decoding based on ADMM
AU - Horii, S.
AU - Suko, T.
AU - Matsushima, T.
AU - Hirasawa, S.
PY - 2013/12/1
Y1 - 2013/12/1
N2 - In this paper, we develop an iterative multiuser joint decoding of code-division multiple-access (CDMA) signals based on a distributed optimization algorithm. For the joint decoding problem, decoding algorithm based on the turbo principle is widely used. The algorithm consists of soft-input soft-output (SISO) channel decoder and SISO multiuser detector and it can be derived as an application of the sum-product algorithm. On the other hand, in the research area of error correcting codes, the decoding algorithm based on convex optimization has been attracting a great deal of attention. Decoding algorithm based on linear programming (LP) has decoding error rate which is comparable with sum-product algorithm with stronger theoretical guarantees. We formulate the joint decoding problem of CDMA signals as an convex optimization problem and we present a relax form of the problem. Moreover, we propose a distributed algorithm which efficiently solves the relaxed optimization problem. The proposed algorithm is based on alternating direction method of multipliers (ADMM). We also see the performance of the proposed decoder through numerical simulations.
AB - In this paper, we develop an iterative multiuser joint decoding of code-division multiple-access (CDMA) signals based on a distributed optimization algorithm. For the joint decoding problem, decoding algorithm based on the turbo principle is widely used. The algorithm consists of soft-input soft-output (SISO) channel decoder and SISO multiuser detector and it can be derived as an application of the sum-product algorithm. On the other hand, in the research area of error correcting codes, the decoding algorithm based on convex optimization has been attracting a great deal of attention. Decoding algorithm based on linear programming (LP) has decoding error rate which is comparable with sum-product algorithm with stronger theoretical guarantees. We formulate the joint decoding problem of CDMA signals as an convex optimization problem and we present a relax form of the problem. Moreover, we propose a distributed algorithm which efficiently solves the relaxed optimization problem. The proposed algorithm is based on alternating direction method of multipliers (ADMM). We also see the performance of the proposed decoder through numerical simulations.
KW - ADMM
KW - Augmented Lagrangian
KW - Coded CDMA
KW - Multiuser detection
KW - Turbo principle
UR - http://www.scopus.com/inward/record.url?scp=84897680906&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84897680906&partnerID=8YFLogxK
U2 - 10.1109/GlobalSIP.2013.6737085
DO - 10.1109/GlobalSIP.2013.6737085
M3 - Conference contribution
AN - SCOPUS:84897680906
SN - 9781479902484
T3 - 2013 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013 - Proceedings
SP - 1097
EP - 1100
BT - 2013 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013 - Proceedings
T2 - 2013 1st IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013
Y2 - 3 December 2013 through 5 December 2013
ER -