{"title":"一种用于二维数字通信系统联合盲与载波恢复的改进常模算法","authors":"Kun-Da Tsai, Jenq-Tay Yuan","doi":"10.1109/ISSPA.2003.1224939","DOIUrl":null,"url":null,"abstract":"The conventional constant modulus algorithm (CMA) requires a separate carrier recovery system (for example, a phase-locked loop) for phase recovery. This paper analyzes a modified CMA (MCMA) for blind equalization in QAM communication systems. The results indicate that the MCMA alone may be able to remove inter-symbol interference (ISI) and simultaneously correct the phase error because it implicitly incorporates a phase-tracking loop, which automatically recovers carrier phase. Consequently, it may outperform the conventional CMA in terms of convergence speed and residual ISI while both algorithms require an almost identical computational cost.","PeriodicalId":264814,"journal":{"name":"Seventh International Symposium on Signal Processing and Its Applications, 2003. Proceedings.","volume":"241 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A modified constant modulus algorithm (CMA) for joint blind and carrier recovery in two-dimensional digital communication systems\",\"authors\":\"Kun-Da Tsai, Jenq-Tay Yuan\",\"doi\":\"10.1109/ISSPA.2003.1224939\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The conventional constant modulus algorithm (CMA) requires a separate carrier recovery system (for example, a phase-locked loop) for phase recovery. This paper analyzes a modified CMA (MCMA) for blind equalization in QAM communication systems. The results indicate that the MCMA alone may be able to remove inter-symbol interference (ISI) and simultaneously correct the phase error because it implicitly incorporates a phase-tracking loop, which automatically recovers carrier phase. Consequently, it may outperform the conventional CMA in terms of convergence speed and residual ISI while both algorithms require an almost identical computational cost.\",\"PeriodicalId\":264814,\"journal\":{\"name\":\"Seventh International Symposium on Signal Processing and Its Applications, 2003. Proceedings.\",\"volume\":\"241 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Seventh International Symposium on Signal Processing and Its Applications, 2003. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISSPA.2003.1224939\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Seventh International Symposium on Signal Processing and Its Applications, 2003. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSPA.2003.1224939","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A modified constant modulus algorithm (CMA) for joint blind and carrier recovery in two-dimensional digital communication systems
The conventional constant modulus algorithm (CMA) requires a separate carrier recovery system (for example, a phase-locked loop) for phase recovery. This paper analyzes a modified CMA (MCMA) for blind equalization in QAM communication systems. The results indicate that the MCMA alone may be able to remove inter-symbol interference (ISI) and simultaneously correct the phase error because it implicitly incorporates a phase-tracking loop, which automatically recovers carrier phase. Consequently, it may outperform the conventional CMA in terms of convergence speed and residual ISI while both algorithms require an almost identical computational cost.