{"title":"利用状态划分方法对存在码间干扰的数字序列进行状态估计","authors":"R. Kamel, Y. Bar-Ness","doi":"10.1109/ISIT.1994.394820","DOIUrl":null,"url":null,"abstract":"A reduced-state sequence estimator for linear dispersive channels is described. The technique is based on partitioning the set of all possible channel states in a way that defines a trellis with fewer states resulting in reduced complexity. The new technique results in a generalization of trellises that were previously obtained in Duel-Hallen and Heegard (IEEE Trans. on Communications, vol. COM 37, p.428-36). The Viterbi algorithm (VA) is used to search for the best path through the reduced state trellis.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Reduced-state sequence estimation of digital sequence in the presence of intersymbol interference using state partitioning\",\"authors\":\"R. Kamel, Y. Bar-Ness\",\"doi\":\"10.1109/ISIT.1994.394820\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A reduced-state sequence estimator for linear dispersive channels is described. The technique is based on partitioning the set of all possible channel states in a way that defines a trellis with fewer states resulting in reduced complexity. The new technique results in a generalization of trellises that were previously obtained in Duel-Hallen and Heegard (IEEE Trans. on Communications, vol. COM 37, p.428-36). The Viterbi algorithm (VA) is used to search for the best path through the reduced state trellis.<<ETX>>\",\"PeriodicalId\":331390,\"journal\":{\"name\":\"Proceedings of 1994 IEEE International Symposium on Information Theory\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1994 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.1994.394820\",\"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 1994 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.1994.394820","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Reduced-state sequence estimation of digital sequence in the presence of intersymbol interference using state partitioning
A reduced-state sequence estimator for linear dispersive channels is described. The technique is based on partitioning the set of all possible channel states in a way that defines a trellis with fewer states resulting in reduced complexity. The new technique results in a generalization of trellises that were previously obtained in Duel-Hallen and Heegard (IEEE Trans. on Communications, vol. COM 37, p.428-36). The Viterbi algorithm (VA) is used to search for the best path through the reduced state trellis.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
