Bounds on the performance of sphere decoding of linear block codes

被引:0
|
作者
El-Khamy, M [1 ]
Vikalo, H [1 ]
Hassibi, B [1 ]
机构
[1] CALTECH, Dept Elect Engn, Pasadena, CA 91125 USA
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A sphere decoder searches for the closest lattice point within a certain search radius. The search radius provides a tradeoff between performance and complexity. We derive tight upper bounds on the performance of sphere decoding of linear block codes. The performance of soft-decision sphere decoding on AWGN channels as well as that of hard-decision sphere decoding on binary symmetric channels is analyzed.
引用
收藏
页码:47 / 51
页数:5
相关论文
共 50 条
  • [1] On the performance of sphere decoding of block codes
    El-Khamy, Mostafa
    Vikalo, Haris
    Hassibi, Babak
    McEliece, R. J.
    [J]. 2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 1964 - +
  • [2] Performance of Sphere Decoding of Block Codes
    El-Khamy, Mostafa
    Vikalo, Haris
    Hassibi, Babak
    McEliece, Robert J.
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2009, 57 (10) : 2940 - 2950
  • [3] Upper Bounds on the Error Probability for the Ensemble of Linear Block Codes with Mismatched Decoding
    Niinomi, Toshihiro
    Yagi, Hideki
    Hirasawa, Shigeichi
    [J]. PROCEEDINGS OF 2020 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA2020), 2020, : 151 - 155
  • [4] Upper Bounds on the Error Probability for the Ensemble of Linear Block Codes with Mismatched Decoding
    Niinomi, Toshihiro
    Yagi, Hideki
    Hirasawa, Shigeichi
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2022, E105A (03) : 363 - 371
  • [5] Bounds on Maximum Likelihood Decoding Performance for Linear Codes at Low Rates
    Yagi, Hideki
    Poor, H. Vincent
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (07) : 4482 - 4497
  • [6] Trellis decoding of linear block codes
    Büttner, WH
    Staphorst, L
    Linde, LP
    [J]. PROCEEDINGS OF THE 1998 SOUTH AFRICAN SYMPOSIUM ON COMMUNICATIONS AND SIGNAL PROCESSING: COMSIG '98, 1998, : 171 - 174
  • [7] Turbo decoding of linear block codes
    Yue, DW
    Shwedyk, E
    [J]. 2001 IEEE PACIFIC RIM CONFERENCE ON COMMUNICATIONS, COMPUTERS AND SIGNAL PROCESSING, VOLS I AND II, CONFERENCE PROCEEDINGS, 2001, : 107 - 110
  • [8] Improved Hamming Sphere Bounds on the MLD Performance of Binary Linear Codes
    Liu, Jia
    Ma, Xiao
    [J]. 2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 1756 - 1760
  • [9] Tightened upper bounds on the ML decoding error probability of binary linear block codes
    Twitto, Moshe
    Sason, Igal
    Shamai, Shlomo
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (04) : 1495 - 1510
  • [10] Tightened upper bounds on the ML decoding error probability of binary linear block codes
    Twitto, Moshe
    Sason, Igal
    Shamai, Shlomo
    [J]. 2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 714 - +