{"title":"时间选择信道上的最佳空时分组码","authors":"Jun He, P. Kam","doi":"10.1109/GLOCOM.2008.ECP.702","DOIUrl":null,"url":null,"abstract":"We analyze the average bit error probability (BEP) of orthogonal space-time block codes (STBC) over time-selective channels. Exact BEP results are obtained in closed form. Through the analysis, we reveal the relationship between the inter-symbol interference (ISI) and the row positions in a STBC matrix. We then introduce one proposition and two design criteria for code search/design. Optimum/near-optimum codes are found/designed with reduced ISI.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimum Space-Time Block Codes over Time-Selective Channels\",\"authors\":\"Jun He, P. Kam\",\"doi\":\"10.1109/GLOCOM.2008.ECP.702\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We analyze the average bit error probability (BEP) of orthogonal space-time block codes (STBC) over time-selective channels. Exact BEP results are obtained in closed form. Through the analysis, we reveal the relationship between the inter-symbol interference (ISI) and the row positions in a STBC matrix. We then introduce one proposition and two design criteria for code search/design. Optimum/near-optimum codes are found/designed with reduced ISI.\",\"PeriodicalId\":297815,\"journal\":{\"name\":\"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOM.2008.ECP.702\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2008.ECP.702","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimum Space-Time Block Codes over Time-Selective Channels
We analyze the average bit error probability (BEP) of orthogonal space-time block codes (STBC) over time-selective channels. Exact BEP results are obtained in closed form. Through the analysis, we reveal the relationship between the inter-symbol interference (ISI) and the row positions in a STBC matrix. We then introduce one proposition and two design criteria for code search/design. Optimum/near-optimum codes are found/designed with reduced ISI.