TY - JOUR
T1 - On transceiver signal linearization and the decoding delay of maximum rate complex orthogonal space-time block codes
AU - Adams, Sarah Spence
AU - Karst, Nathaniel
AU - Murugan, Mathav Kishore
AU - Wysocki, Tadeusz A.
N1 - Funding Information:
Manuscript received July 07, 2009; revised June 30, 2010; accepted November 11, 2010. Date of current version May 25, 2011. This work was supported in part by NSA Young Investigator Awards H98230-07-1-0022 and H98230-10-1-0220 and in part by Olin College. S. S. Adams is with the Franklin W. Olin College of Engineering, Needham, MA 02492-1245 USA (e-mail: [email protected]). N. Karst is with the Center for Applied Mathematics, Cornell University, Ithaca, NY 14853 USA (e-mail: [email protected]). M. K. Murugan was with the Indian Institute of Technology, Kharagpur, India. He is now with the Center for Applied Mathematics, Cornell University, Ithaca, NY 14853 USA (e-mail: [email protected]). T. A. Wysocki is with the Peter Kiewit Institute, University of Nebraska—Lincoln, NE 68508 USA (e-mail: [email protected]). Communicated by B. S. Rajan, Associate Editor for Coding Theory. Digital Object Identifier 10.1109/TIT.2011.2137050
PY - 2011/6
Y1 - 2011/6
N2 - Complex orthogonal designs (CODs) have been successfully implemented in wireless systems as complex orthogonal space-time block codes (COSTBCs). Certain properties of the underlying CODs affect the performance of the codes. In addition to the main properties of a COD's rate and decoding delay, a third consideration is whether the COD can achieve transceiver signal linearization, a property that facilitates practical implementation by, for example, significantly simplifying the receiver structure for iterative decoding. It has been shown that a COD can achieve this transceiver signal linearization if the nonzero entries in any given row of the matrix are either all conjugated or all nonconjugated. This paper determines the conditions under which maximum rate CODs can achieve this desirable property. For an odd number of transmit antennas, it is shown that maximum rate CODs that achieve the lower bound on decoding delay can also achieve transceiver signal linearization. In contrast, for an even number of transmit antennas, maximum rate CODs that achieve the lower bound on delay cannot achieve this linearization. In this latter case, linearization is possible only if the COD achieves at least twice the lower bound on delay. This work highlights the tradeoffs among these three important properties.
AB - Complex orthogonal designs (CODs) have been successfully implemented in wireless systems as complex orthogonal space-time block codes (COSTBCs). Certain properties of the underlying CODs affect the performance of the codes. In addition to the main properties of a COD's rate and decoding delay, a third consideration is whether the COD can achieve transceiver signal linearization, a property that facilitates practical implementation by, for example, significantly simplifying the receiver structure for iterative decoding. It has been shown that a COD can achieve this transceiver signal linearization if the nonzero entries in any given row of the matrix are either all conjugated or all nonconjugated. This paper determines the conditions under which maximum rate CODs can achieve this desirable property. For an odd number of transmit antennas, it is shown that maximum rate CODs that achieve the lower bound on decoding delay can also achieve transceiver signal linearization. In contrast, for an even number of transmit antennas, maximum rate CODs that achieve the lower bound on delay cannot achieve this linearization. In this latter case, linearization is possible only if the COD achieves at least twice the lower bound on delay. This work highlights the tradeoffs among these three important properties.
KW - Complex orthogonal designs (CODs)
KW - iterative decoding
KW - space-time block codes
KW - transceiver signal linearization
UR - http://www.scopus.com/inward/record.url?scp=79957655305&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79957655305&partnerID=8YFLogxK
U2 - 10.1109/TIT.2011.2137050
DO - 10.1109/TIT.2011.2137050
M3 - Article
AN - SCOPUS:79957655305
SN - 0018-9448
VL - 57
SP - 3618
EP - 3621
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 6
M1 - 5773007
ER -