Fast maximum likelihood decoding of quasi-orthogonal codes

Lei He, Hongya Ge

Research output: Contribution to journalConference articlepeer-review

19 Scopus citations


In this paper, we present a new fast maximum likelihood (ML) detection algorithm for quasi-orthogonal space-time block codes (QO-STBC). Observed in a transformed signal space, the QO-STBC encoder embeds information into a group of orthogonal subspaces of rank two. We propose a fast technique that separates information embedded in each rank-two subspace by a simple linear processing, and decodes the separated information independently. For a multiple-input and multiple-output (MIMO) system, decoding algorithm decomposes the original N × N system into N/2 parallel 2 × 2 MIMO sub-systems without information loss followed by MRC. It then detects symbols contained in each 2 × 2 MIMO sub-system using a sphere decoder of reduced computational complexity.

Original languageEnglish (US)
Pages (from-to)1022-1026
Number of pages5
JournalConference Record of the Asilomar Conference on Signals, Systems and Computers
StatePublished - 2003
EventConference Record of the Thirty-Seventh Asilomar Conference on Signals, Systems and Computers - Pacific Grove, CA, United States
Duration: Nov 9 2003Nov 12 2003

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Networks and Communications


Dive into the research topics of 'Fast maximum likelihood decoding of quasi-orthogonal codes'. Together they form a unique fingerprint.

Cite this