基于位移的快速彼得森解码器

2015 IEEE 14th Canadian Workshop on Information Theory (CWIT) Pub Date : 2015-07-06 DOI:10.1109/CWIT.2015.7255142

C. Senger, F. Kschischang

{"title":"基于位移的快速彼得森解码器","authors":"C. Senger, F. Kschischang","doi":"10.1109/CWIT.2015.7255142","DOIUrl":null,"url":null,"abstract":"A displacement-based approach for solving the Peterson system that arises in the decoding of generalized Reed-Solomon codes is presented. The main contribution is an LU factorization algorithm for the corresponding Toeplitz coefficient matrix, implemented as a sequence of vector-matrix multiplications each with linear instead of quadratic time-complexity, resulting in overall quadratic decoding time-complexity.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A fast displacement-based Peterson decoder\",\"authors\":\"C. Senger, F. Kschischang\",\"doi\":\"10.1109/CWIT.2015.7255142\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A displacement-based approach for solving the Peterson system that arises in the decoding of generalized Reed-Solomon codes is presented. The main contribution is an LU factorization algorithm for the corresponding Toeplitz coefficient matrix, implemented as a sequence of vector-matrix multiplications each with linear instead of quadratic time-complexity, resulting in overall quadratic decoding time-complexity.\",\"PeriodicalId\":426245,\"journal\":{\"name\":\"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)\",\"volume\":\"98 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-07-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CWIT.2015.7255142\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CWIT.2015.7255142","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

提出了一种基于位移的求解广义Reed-Solomon码解码中出现的Peterson系统的方法。主要贡献是对应Toeplitz系数矩阵的LU分解算法，实现为向量矩阵乘法序列，每个乘法具有线性而不是二次时间复杂度，从而导致总体二次解码时间复杂度。

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

查看原文本刊更多论文

A fast displacement-based Peterson decoder

A displacement-based approach for solving the Peterson system that arises in the decoding of generalized Reed-Solomon codes is presented. The main contribution is an LU factorization algorithm for the corresponding Toeplitz coefficient matrix, implemented as a sequence of vector-matrix multiplications each with linear instead of quadratic time-complexity, resulting in overall quadratic decoding time-complexity.

求助全文

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

来源期刊

2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)

自引率

0.00%

发文量