On computing Verdu's upper bound for a class of maximum-likelihood multiuser detection and sequence detection problems

被引:2
|
作者
Ma, WK [1 ]
Wong, KM
Ching, PC
机构
[1] Chinese Univ Hong Kong, Dept Elect Engn, Shatin, Hong Kong, Peoples R China
[2] McMaster Univ, Commun Res Lab, Hamilton, ON L8S 4K1, Canada
关键词
maximum-likelihood (NIL) detection; multiuser detection; performance analysis; sequence detection;
D O I
10.1109/18.959286
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The upper bound derived by Verdu is often used to evaluate the bit error performance of both the maximum-likelihood (ML) sequence detector for single-user systems and the ML multiuser detector for code-division multiple-access (CDMA) systems. This upper bound, which is based on the concept of indecomposable error vectors (IEVs), can be expensive to compute because in general the IEVs may only be obtained using an exhaustive search. In this correspondence, we consider the identification of IEVs for a particular class of ML detection problems commonly encountered in communications. By exploiting the properties of the IEVs for this case, we develop an IEV generation algorithm which has a complexity substantially lower than that of the exhaustive search. We also show that for specific communication systems, such as duobinary signaling, the expressions of Verdu's upper bound can be considerably simplified.
引用
收藏
页码:3049 / 3053
页数:5
相关论文
共 50 条
  • [1] Smart maximum-likelihood CDMA multiuser detection
    Fard, SF
    Tellambura, C
    [J]. 2005 IEEE PACIFIC RIM CONFERENCE ON COMMUNICATIONS, COMPUTERS AND SIGNAL PROCESSING (PACRIM), 2005, : 522 - 525
  • [2] An improved bound on the performance of maximum-likelihood multiuser detection receivers in Rayleigh fading
    Mohasseb, Y
    Fitz, MP
    Mitra, U
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (03) : 1184 - 1196
  • [4] Maximum-likelihood synchronization and channel estimation with multiuser detection in GFDMA
    Shayanfar, Hamidreza
    Saeedi-Sourck, Hamid
    Farhang, Arman
    Doyle, Linda E.
    [J]. TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES, 2018, 29 (06):
  • [5] A reduced-complexity maximum-likelihood method for multiuser detection
    Li, JQ
    Ben Letaief, K
    Cao, ZG
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2004, 52 (02) : 289 - 295
  • [6] Reliability-based near maximum-likelihood multiuser detection
    Liu, ZY
    Pados, DA
    [J]. 2001 MILCOM, VOLS 1 AND 2, PROCEEDINGS: COMMUNICATIONS FOR NETWORK-CENTRIC OPERATIONS: CREATING THE INFORMATION FORCE, 2001, : 576 - 580
  • [7] A Structured Channel Estimator for Maximum-Likelihood Sequence Detection
    Ng, Boon Chong
    Cedervall, Mats
    Paulraj, A.
    [J]. IEEE COMMUNICATIONS LETTERS, 1997, 1 (02) : 52 - 55
  • [8] Turbo decoding as iterative constrained maximum-likelihood sequence detection
    Walsh, John MacLaren
    Regalia, Phillip A.
    Johnson, C. Richard, Jr.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (12) : 5426 - 5437
  • [9] Breadth-first maximum-likelihood sequence detection: Geometry
    Aulin, TA
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2003, 51 (12) : 2071 - 2080
  • [10] Asymptotic minimum bit error rate property of maximum-likelihood multiuser detection
    Ma, WK
    Ching, PC
    [J]. IEEE COMMUNICATIONS LETTERS, 2003, 7 (09) : 425 - 427