Xiao-Hong Peng, A. Burr, P. Farrell, J. M. Gil-García
{"title":"快速软判决解码块码使用网格","authors":"Xiao-Hong Peng, A. Burr, P. Farrell, J. M. Gil-García","doi":"10.1109/ISIT.1998.708834","DOIUrl":null,"url":null,"abstract":"The trellis used for decoding can be significantly simplified by using the results from decoding the component codes of the full code. The saving on decoding complexity varies according to the decoding performances required. The method applies to any block code that can be decomposed into component codes.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Fast soft-decision decoding for block codes using a trellis\",\"authors\":\"Xiao-Hong Peng, A. Burr, P. Farrell, J. M. Gil-García\",\"doi\":\"10.1109/ISIT.1998.708834\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The trellis used for decoding can be significantly simplified by using the results from decoding the component codes of the full code. The saving on decoding complexity varies according to the decoding performances required. The method applies to any block code that can be decomposed into component codes.\",\"PeriodicalId\":133728,\"journal\":{\"name\":\"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)\",\"volume\":\"63 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-08-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.1998.708834\",\"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. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.1998.708834","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fast soft-decision decoding for block codes using a trellis
The trellis used for decoding can be significantly simplified by using the results from decoding the component codes of the full code. The saving on decoding complexity varies according to the decoding performances required. The method applies to any block code that can be decomposed into component codes.