O. Shental, N. Shental, S. Shamai, I. Kanter, A. Weiss, Y. Weiss
{"title":"关于广义BP在二维通道中如此显著的原因的评论","authors":"O. Shental, N. Shental, S. Shamai, I. Kanter, A. Weiss, Y. Weiss","doi":"10.1109/ITA.2007.4357604","DOIUrl":null,"url":null,"abstract":"Generalized belief propagation (GBP) algorithm has been shown recently to infer the a-posteriori probabilities of finite-state input two-dimensional (2D) Gaussian channels with memory in a practically accurate manner, thus enabling near-optimal estimation of the transmitted symbols and the Shannon-theoretic information rates. In this note, a rationalization of this excellent performance of GBP is addressed.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Comments on Why Generalized BP Serves So Remarkably in 2-D Channels\",\"authors\":\"O. Shental, N. Shental, S. Shamai, I. Kanter, A. Weiss, Y. Weiss\",\"doi\":\"10.1109/ITA.2007.4357604\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Generalized belief propagation (GBP) algorithm has been shown recently to infer the a-posteriori probabilities of finite-state input two-dimensional (2D) Gaussian channels with memory in a practically accurate manner, thus enabling near-optimal estimation of the transmitted symbols and the Shannon-theoretic information rates. In this note, a rationalization of this excellent performance of GBP is addressed.\",\"PeriodicalId\":439952,\"journal\":{\"name\":\"2007 Information Theory and Applications Workshop\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-10-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 Information Theory and Applications Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITA.2007.4357604\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 Information Theory and Applications Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITA.2007.4357604","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Comments on Why Generalized BP Serves So Remarkably in 2-D Channels
Generalized belief propagation (GBP) algorithm has been shown recently to infer the a-posteriori probabilities of finite-state input two-dimensional (2D) Gaussian channels with memory in a practically accurate manner, thus enabling near-optimal estimation of the transmitted symbols and the Shannon-theoretic information rates. In this note, a rationalization of this excellent performance of GBP is addressed.