A sphere decoding approach for the vector Viterbi algorithm

Author

Kairouz, Peter ; Aolin Xu ; Shanbhag, Naresh ; Singer, Amit

Author_Institution

Dept. of Electr. & Comput. Eng., Univ. of Illinois at Urbana Champaign, Champaign, IL, USA

fYear

2012

Firstpage

114

Lastpage

118

Abstract

High speed multi-input multi-output (MIMO) communication systems suffer from inter-channel and inter-symbol-interference (ICI and ISI). The vector Viterbi algorithm (VVA) is a maximum likelihood sequence detection (MLSD) algorithm for MIMO frequency selective channels. MLSD algorithms are desired because they minimize the probability of sequence detection error. However, they suffer from very high computational complexity. In this work, we show how a sphere decoding like algorithm can be used to reduce the complexity of VVA while preserving its optimality. For a 2 × 2 MIMO system with 16-QAM signal constellation, our algorithm cuts VVA´s complexity by 50% at an SNR of 10 dB and by 60% at an SNR of 15 dB.

Keywords

MIMO communication; Viterbi decoding; adjacent channel interference; communication complexity; error statistics; intersymbol interference; maximum likelihood detection; quadrature amplitude modulation; ICI; ISI; MIMO communication system; MIMO frequency selective channel; MLSD algorithm; QAM signal constellation; SNR; VVA; complexity reduction; computational complexity; error probability; high speed multiinput multioutput communication system; interchannel interference; intersymbol interference; maximum likelihood sequence detection; noise figure 10 dB; noise figure 15 dB; sequence detection error; sphere decoding; vector Viterbi algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Signals, Systems and Computers (ASILOMAR), 2012 Conference Record of the Forty Sixth Asilomar Conference on

Conference_Location

Pacific Grove, CA

ISSN

1058-6393

Print_ISBN

978-1-4673-5050-1

Type

conf

DOI

10.1109/ACSSC.2012.6488970

Filename

6488970