{"title":"Investigation of two high-rate algebraic space-time codes","authors":"M. O. Damen, N. Beaulieu","doi":"10.1109/GLOCOM.2001.965157","DOIUrl":null,"url":null,"abstract":"The algebraic properties of two new space-time block codes over M transmitter antennas and T symbol periods are examined. The first code transmits at a rate of 2 symbols per channel use and has a transmit diversity of 2 over all 4-dimensional constellations carved from Z[i]/sup 4/ for M=T=2. From this code, we construct a space-time block code for M=T=3 which transmits at a rate of 4/3 symbols per channel use and has a transmit diversity of 3. We give upper and lower bounds to the achieved coding gains and prove that irrational numbers that are poorly approximated by rational numbers are particularly useful to enhance the coding gains of our schemes.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2001.965157","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The algebraic properties of two new space-time block codes over M transmitter antennas and T symbol periods are examined. The first code transmits at a rate of 2 symbols per channel use and has a transmit diversity of 2 over all 4-dimensional constellations carved from Z[i]/sup 4/ for M=T=2. From this code, we construct a space-time block code for M=T=3 which transmits at a rate of 4/3 symbols per channel use and has a transmit diversity of 3. We give upper and lower bounds to the achieved coding gains and prove that irrational numbers that are poorly approximated by rational numbers are particularly useful to enhance the coding gains of our schemes.