Synthesis of minimal cost nonlinear feedback shift registers

Authors:
D. Linardatos;N. Kalouptsidis
Affiliations:
Department of Informatics and Communications, Division of Communications and Signal Processing, University of Athens, Panepistimiopolis, Ilisia, Athens 15784, Greece;Department of Informatics and Communications, Division of Communications and Signal Processing, University of Athens, Panepistimiopolis, Ilisia, Athens 15784, Greece
Venue:
Signal Processing
Year:
2002

Citing 5
Cited 4

A simple derivation of the Berlekamp-Massey algorithm and some applications

IEEE Transactions on Information Theory
Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array

Journal of Symbolic Computation
Extension of the Berlekamp-Massey algorithm to N dimensions

Information and Computation
Linear System Theory and Design

Linear System Theory and Design
Efficient algorithms for Volterra system identification

IEEE Transactions on Signal Processing

On analysis and synthesis of (n, k)-non-linear feedback shift registers

Proceedings of the conference on Design, automation and test in Europe
A transformation from the Fibonacci to the Galois NLFSRs

IEEE Transactions on Information Theory
Finding matching initial states for equivalent NLFSRs in the Fibonacci and the Galois configurations

IEEE Transactions on Information Theory
An algorithm for constructing a fastest Galois NLFSR generating a given sequence

SETA'10 Proceedings of the 6th international conference on Sequences and their applications

Quantified Score

Hi-index	0.20

Visualization

Abstract

This paper is concerned with the determination of the "minimal" nonlinear feedback shift register (NLFSR) that generates a given sequence. A total ordering between structural vectors that takes into account the implementation cost is specified. Minimality is defined with respect to this ordering. A block as well as a sequential algorithm are developed that combine a linear dependence test implemented by an extension of the Fundamental Iterative Algorithm (EFIA) with a minimality procedure that traces the totally ordered structural vectors.