A new lattice decoding for space time block codes with low complexity

被引：0
|
作者：
Beygi, L [1 ]
Ghaderipoor, HAR [1 ]
Dolatyar, K [1 ]
Jamali, SH [1 ]
机构：
[1] Univ Teheran, Dept Elect & Comp Engn, Tehran 14399, Iran
来源：
13TH IEEE INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS, VOL 1-5, PROCEEDINGS: SAILING THE WAVES OF THE WIRELESS OCEANS | 2002年
关键词：
Space Time Coding; lattice decoding; linear dispersion codes;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We present an algorithm based on the closest point search (CPS) in lattices for decoding of space-time block codes (STBC). The modified CPS algorithm based on the Schnorr-Euchner variation of the Pohst method is used to perform the decoding of STBC. This method is shown to be substantially faster than other known sphere decoding methods. Also we exploit a fast method for decoding of orthogonal STBC with low complexity. We show that our proposed method gives the same decoding performance as the maximum-likelihood (ML) ratio decoding while it shows much lower complexity.
引用
收藏
页码：428 / 430
页数：3
相关论文
共 50 条
  • [1] Asynchronous Space Time Block Codes: Low Complexity Decoding Methods
    Nahas, Michel
    Saadani, Ahmed
    Hatoum, Rima
    [J]. SPAWC 2011: 2011 IEEE 12TH INTERNATIONAL WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS, 2011, : 401 - 405
  • [2] A very low complexity soft decoding of space-time block codes
    Chen, YN
    Parhi, KK
    [J]. 2002 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS I-IV, PROCEEDINGS, 2002, : 2693 - 2696
  • [3] Computational Complexity of Decoding Orthogonal Space-Time Block Codes
    Ayanoglu, Ender
    Larsson, Erik G.
    Karipidis, Eleftherios
    [J]. 2010 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, 2010,
  • [4] Computational Complexity of Decoding Orthogonal Space-Time Block Codes
    Ayanoglu, Ender
    Larsson, Erik G.
    Karipidis, Eleftherios
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2011, 59 (04) : 936 - 941
  • [5] Low complexity decoding of a class of linear space-time block codes by subspace partitioning
    Kuhn, M
    Wittneben, A
    [J]. IEEE 56TH VEHICULAR TECHNOLOGY CONFERENCE, VTC FALL 2002, VOLS 1-4, PROCEEDINGS, 2002, : 2182 - 2186
  • [6] LOW COMPLEXITY ESSENTIALLY MAXIMUM LIKELIHOOD DECODING OF PERFECT SPACE-TIME BLOCK CODES
    Howard, S. D.
    Sirianunpiboon, S.
    Calderbank, A. R.
    [J]. 2009 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS 1- 8, PROCEEDINGS, 2009, : 2725 - +
  • [7] Lattice decoding for space-time codes with new approach
    Dolatyar, K
    Beygi, L
    Olfat, A
    [J]. 13TH IEEE INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS, VOL 1-5, PROCEEDINGS: SAILING THE WAVES OF THE WIRELESS OCEANS, 2002, : 423 - 427
  • [8] New sphere decoding for block space-time codes
    Harchegani, LB
    Ghaderipoor, AR
    Jamali, SH
    Dolatyar, K
    [J]. 2002 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS I-IV, PROCEEDINGS, 2002, : 4170 - 4170
  • [9] A Low-Complexity Decoding Algorithm for Quasi-orthogonal Space-Time Block Codes
    Jin, Xiao-Ping
    Li, You-Ming
    Li, Zheng-Quan
    Jin, Ning
    [J]. ELECTRONICS, COMMUNICATIONS AND NETWORKS V, 2016, 382 : 19 - 25
  • [10] On lattice decoding of space-time block codes for asynchronous cooperative relaying
    Hammons, A. Roger, Jr.
    Damen, Mohamed Oussama
    [J]. 2007 IEEE SARNOFF SYMPOSIUM, 2007, : 341 - +
12345