DocumentCode :
640016
Title :
Generalised Multi-sequence Shift-Register synthesis using module minimisation
Author :
Nielsen, Johan S. R.
Author_Institution :
Dept. of Appl. Math. & Comput. Sci., Tech. Univ. of Denmark, Lyngby, Denmark
fYear :
2013
fDate :
7-12 July 2013
Firstpage :
882
Lastpage :
886
Abstract :
We show how to solve a generalised version of the Multi-sequence Linear Feedback Shift-Register (MLFSR) problem using minimisation of free modules over F[x]. We show how two existing algorithms for minimising such modules run particularly fast on these instances. Furthermore, we show how one of them can be made even faster for our use. With our modelling of the problem, classical algebraic results tremendously simplify arguing about the algorithms. For the non-generalised MLFSR, these algorithms are as fast as what is currently known. We then use our generalised MLFSR to give a new fast decoding algorithm for Reed Solomon codes.
Keywords :
Reed-Solomon codes; algebra; decoding; minimisation; shift registers; Reed Solomon codes; algebraic result; fast decoding algorithm; generalised MLFSR; generalised multisequence shift-register synthesis; module minimisation; multisequence linear feedback shift-register; Algorithm design and analysis; Complexity theory; Decoding; Minimization; Polynomials; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on
Conference_Location :
Istanbul
ISSN :
2157-8095
Type :
conf
DOI :
10.1109/ISIT.2013.6620353
Filename :
6620353
Link To Document :
بازگشت