基于线性系统模型的BCJR解码器的暂态和收敛特性

Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494) Pub Date : 2001-09-02 DOI:10.1109/ITW.2001.955162

John B. Anderson

{"title":"基于线性系统模型的BCJR解码器的暂态和收敛特性","authors":"John B. Anderson","doi":"10.1109/ITW.2001.955162","DOIUrl":null,"url":null,"abstract":"The BCJR algorithm consists of two linear recursions whose joint transient response define the algorithm's response to errors. The transient behavior is described and some implications are discussed for sliding block decoder storage, recovery from incorrect starts, and good code design.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Transient and convergence properties of the BCJR decoder via a linear system model\",\"authors\":\"John B. Anderson\",\"doi\":\"10.1109/ITW.2001.955162\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The BCJR algorithm consists of two linear recursions whose joint transient response define the algorithm's response to errors. The transient behavior is described and some implications are discussed for sliding block decoder storage, recovery from incorrect starts, and good code design.\",\"PeriodicalId\":288814,\"journal\":{\"name\":\"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-09-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW.2001.955162\",\"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 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW.2001.955162","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

BCJR算法由两个线性递归组成，它们的联合瞬态响应定义了算法对误差的响应。描述了瞬态行为，并讨论了对滑动块解码器存储、错误启动恢复和良好代码设计的影响。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Transient and convergence properties of the BCJR decoder via a linear system model

The BCJR algorithm consists of two linear recursions whose joint transient response define the algorithm's response to errors. The transient behavior is described and some implications are discussed for sliding block decoder storage, recovery from incorrect starts, and good code design.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)

自引率

0.00%

发文量