A sphere decoding approach for the vector Viterbi algorithm

Peter Kairouz, Aolin Xu, Naresh Shanbhag, Andrew Singer

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationConference Record of the 46th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2012
Pages114-118
Number of pages5
DOIs
StatePublished - 2012
Event46th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2012 - Pacific Grove, CA, United States
Duration: Nov 4 2012Nov 7 2012

Publication series

NameConference Record - Asilomar Conference on Signals, Systems and Computers
ISSN (Print)1058-6393

Other

Other46th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2012
Country/TerritoryUnited States
CityPacific Grove, CA
Period11/4/1211/7/12

ASJC Scopus subject areas

  • Signal Processing
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'A sphere decoding approach for the vector Viterbi algorithm'. Together they form a unique fingerprint.

Cite this