A fast sphere decoding algorithm for space-frequency block codes

作     者：Safar, Zoltan Su, Weifeng Liu, K. J. Ray 

作者机构：Univ Maryland Dept Elect & Comp Engn A James Clark Sch Engn College Pk MD 20742 USA Univ Maryland Syst Res Inst College Pk MD 20742 USA Nokia Modern Syst Design Technol Platforms DK-1790 Copenhagen Denmark SUNY Buffalo Dept Elect Engn Sch Engn & Appl Sci Buffalo NY 14260 USA 

出 版 物：《EURASIP JOURNAL ON APPLIED SIGNAL PROCESSING》 (EURASIP信号处理进展杂志)

年 卷 期：2006年第2006卷第1期

页      面：097676-097676页

核心收录：

学科分类：0808[工学-电气工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 

主　　题：Spheres decoding algorithm performance boost degradation of performance algorithms DECODING complexity classes central portion Block codes 

摘      要：The recently proposed space-frequency-coded MIMO-OFDM systems have promised considerable performance improvement over single-antenna systems. However, in order to make multiantenna OFDM systems an attractive choice for practical applications, implementation issues such as decoding complexity must be addressed successfully. In this paper, we propose a computationally efficient decoding algorithm for space-frequency block codes. The central part of the algorithm is a modulation-independent sphere decoding framework formulated in the complex domain. We develop three decoding approaches: a modulation-independent approach applicable to any memoryless modulation method, a QAM-specific and a PSK-specific fast decoding algorithm performing nearest-neighbor signal point search. The computational complexity of the algorithms is investigated via both analysis and simulation. The simulation results demonstrate that the proposed algorithm can significantly reduce the decoding complexity. We observe up to 75% reduction in the required FLOP count per code block compared to previously existing methods without noticeable performance degradation. Copyright (C) 2006 Hindawi Publishing Corporation. All rights reserved.