On a class of non-orthogonal space-time block codes with linear decoding complexity
- Additional Document Info
- View All
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)
2003 IEEE 58TH VEHICULAR TECHNOLOGY CONFERENCE, VOLS1-5, PROCEEDINGS
author list (cited authors)
Dalton, L. A., & Georghiades, C. N.
complete list of authors
Dalton, LA||Georghiades, CN