{"title":"自适应分数间隔盲均衡","authors":"I. Fijalkow, F.L. de Victoria, C. R. Johnson","doi":"10.1109/DSP.1994.379828","DOIUrl":null,"url":null,"abstract":"The asymptotic behavior of the FSE-CMA (i.e., fractionally spaced equalizer adapted by the Godard algorithm) is studied. Under conditions on the channel and equalizer finite length that are known to allow perfect equalization, the authors show that the FSE-CMA cost-function admits only global maxima, global minima and saddle points. However, the set of global minima contains dense sets of infinite extent which can lead to numerical overflow.<<ETX>>","PeriodicalId":189083,"journal":{"name":"Proceedings of IEEE 6th Digital Signal Processing Workshop","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"47","resultStr":"{\"title\":\"Adaptive fractionally spaced blind equalization\",\"authors\":\"I. Fijalkow, F.L. de Victoria, C. R. Johnson\",\"doi\":\"10.1109/DSP.1994.379828\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The asymptotic behavior of the FSE-CMA (i.e., fractionally spaced equalizer adapted by the Godard algorithm) is studied. Under conditions on the channel and equalizer finite length that are known to allow perfect equalization, the authors show that the FSE-CMA cost-function admits only global maxima, global minima and saddle points. However, the set of global minima contains dense sets of infinite extent which can lead to numerical overflow.<<ETX>>\",\"PeriodicalId\":189083,\"journal\":{\"name\":\"Proceedings of IEEE 6th Digital Signal Processing Workshop\",\"volume\":\"57 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-10-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"47\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of IEEE 6th Digital Signal Processing Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DSP.1994.379828\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of IEEE 6th Digital Signal Processing Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DSP.1994.379828","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The asymptotic behavior of the FSE-CMA (i.e., fractionally spaced equalizer adapted by the Godard algorithm) is studied. Under conditions on the channel and equalizer finite length that are known to allow perfect equalization, the authors show that the FSE-CMA cost-function admits only global maxima, global minima and saddle points. However, the set of global minima contains dense sets of infinite extent which can lead to numerical overflow.<>