Semidefinite programming detection for OvHDM signal

被引：0
作者：
School of Information Engineering, Beijing University of Posts and Telecommunications, Beijing, 100876, China [1 ]
机构：
[1] School of Information Engineering, Beijing University of Posts and Telecommunications, Beijing
来源：
J. China Univ. Post Telecom. | 2008年 / 3卷 / 8-12,18期
基金：
中国国家自然科学基金;
关键词：
overlapped frequency division multiplexing (OvFDM); overlapped hybrid division multiplexing (OvHDM); overlapped TDM (OvTDM); semidefinite programming; successive interference cancellation;
D O I：
10.1016/S1005-8885(08)60099-0
中图分类号：
学科分类号：
摘要：
Non-orthogonal time-frequency division multiplexing (NTFDM) transmission scheme has been proposed to further improve the bandwidth efficiency and overcome the drawbacks of the conventional orthogonal frequency division multiplexing (OFDM) method. Based on such approach, the fast signal detection algorithm, semidefinite programming (SDP) detection, has been studied. As the coefficient matrix tends to be ill conditioned, the modified SDP algorithm combined with successive interference cancellation (SIC) has been developed. The improved algorithm is a good tradeoff between performance and detection complexity. Simulation results show that the proposed algorithm can achieve better performance than cutting plane aided SDP method. © 2008 The Journal of China Universities of Posts and Telecommunications.
引用
收藏
页码：8 / 12,18
相关论文
共 10 条
  • [1] Chen J., Siegel P., On the symmetric information rate of two-dimensional finite-state ISI channels, IEEE Transactions on Information Theory, 52, 1, pp. 227-236, (2006)
  • [2] Lin S., Costello D.J., Error control coding: fundamentals and applications, (1983)
  • [3] Wang F.Q., Costello D.J., Erasure-free sequential decoding of trellis codes, IEEE Transactions on Information Theory, 40, 6, pp. 1803-1817, (1994)
  • [4] Fincke U., Pohst M., Improved methods for calculating vectors of short length in a lattice, including a complexity analysis, Mathematics of Computation, 44, 5, pp. 463-471, (1985)
  • [5] Tan P.H., Rasmussen L., The application of semidefinite programming for detection in CDMA, IEEE Journal on Selected Areas in Communications, 19, 8, pp. 1442-1449, (2001)
  • [6] Helmberg C., Rendl F., Vanderbei R., Et al., An interior point method for semidefinite programming, SIAM Journal on Optimization, 7, 3, pp. 342-361, (1996)
  • [7] Goemans M.X., Williamson D.P., Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, Journal of the ACM, 42, 6, pp. 1115-1145, (1995)
  • [8] Helmberg C., Rendl F., Solving quadratic (0,1)-problems by semidefinite programs and cutting planes, Mathematical Programming, 82, 3, pp. 291-315, (1998)
  • [9] Wang X., Lu W.S., Antoniou A., Multiuser detectors for synchronous DS-CDMA systems based on a recursive p-norm convex relaxation approach, IEEE Transactions on Circuits and Systems, 52, 5, pp. 1021-1031, (2005)
  • [10] Ma W.K., Davidson T., Wong K.M., Et al., A block alternating likelihood maximization approach to multiuser detection, IEEE Transactions on Signal Processing, 52, 9, pp. 2600-2611, (2004)
1