Synthesis of two-dimensional linear feedback shift registers and Groebner bases
In this paper we discuss about how to design a two-dimensional linear feedback shift register. It is a switching circuit capable of generating a prescribed doubly periodic array. In particular, it can be used as an encoder of a two-dimensional cyclic code. Our method is based on a two-dimensional extension of the Berlekamp-Massey algorithm for synthesis of a (one-dimensional) linear feedback shift register. In the sequel, we make clear that our problem is equivalent to constructing a Groebner basis of the ideal which is defined by the given array.
Unable to display preview. Download preview PDF.
- Berlekamp E.R., Nonbinary BCH decoding,’ Algebraic Coding Theory', Chapters 7 and 10, 1968.Google Scholar
- Buchberger B., Groebner basis: An algorithmic method in polynomial ideal theory, Chapter 6 in N.K. Bose (ed.):’ Recent Trends in Multidimensional Systems Theory', D. Reidel Publ. Co., 1985.Google Scholar
- Sakata S., Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array, J. of Symbolic Computation, vol. 5, pp.321–337, 1987.Google Scholar