On a class of non-orthogonal space-time block codes with linear decoding complexity Conference Paper

abstract

• Orthogonal space-time codes have received attention for having maximum likelihood (ML) receivers that reduce an optimal joint symbol detection problem into a set of single symbol detection problems. In this paper, we introduce a class of space-time block codes, referred to as Linear Receiver Processing (LRP) codes, which have decoupled, linear complexity optimal receivers but are not necessarily orthogonal. These codes are also capable of achieving full diversity and rate. Orthogonal codes may be viewed as a special case of the new LRP codes.

name of conference

• 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484)

authors

• Georghiades, Costas

published proceedings

• 2003 IEEE 58TH VEHICULAR TECHNOLOGY CONFERENCE, VOLS1-5, PROCEEDINGS

author list (cited authors)

• Dalton, L. A., & Georghiades, C. N.

citation count

• 0

complete list of authors

• Dalton, LA||Georghiades, CN

publication date

• January 2003

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE Vehicular Technology Conference  Journal

keywords

• 40 Engineering
• 4006 Communications Engineering
• 46 Information And Computing Sciences
• 4613 Theory Of Computation

Digital Object Identifier (DOI)

• 10.1109/VETECF.2003.1285321

International Standard Book Number (ISBN) 10

• 0-7803-7954-3

start page

• 1728

end page

• 1732

volume

• 3

issue

• 3

URL

• http://dx.doi.org/10.1109/vetecf.2003.1285321