Fast maximum likelihood decoding of quasi-orthogonal codes
Lei He; Hongya Ge
Signals, Systems and Computers, 2003. Conference Record of the Thirty-Seventh Asilomar Conference on
Volume 1, Issue , 9-12 Nov. 2003 Page(s): 1022 - 1026 Vol.1
Digital Object Identifier   10.1109/ACSSC.2003.1292080
Summary: 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 /spl times/ N system into N/2 parallel 2 /spl times/ 2 MIMO sub-systems without information loss followed by MRC. It then detects symbols contained in each 2 /spl times/ 2 MIMO sub-system using a sphere decoder of reduced computational complexity.

» View citation and abstract

Log in by entering your IEEE Web Account Username and Password.

IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.

• Search and access Abstract records free of charge
• Register for table of contents alerts
• Purchase Full Text PDF documents

» Learn more about subscription options or how to become an IEEE Member.