Sobre el parámetro complejidad lineal y los filtros no lineales de segundo orden

  1. Fúster Sabater, Amparo
  2. García Villalba, Luis Javier
Revue:
Revista matemática complutense

ISSN: 1139-1138 1988-2807

Année de publication: 2000

Volumen: 13

Número: 1

Pages: 119-136

Type: Article

DOI: 10.5209/REV_REMA.2000.V13.N1.17093 DIALNET GOOGLE SCHOLAR lock_openAccès ouvert editor

D'autres publications dans: Revista matemática complutense

Résumé

A new method of analysing the linear complexity of 2nd-order nonlinear filterings of m-sequences that is based on the concept of regular coset is present. The procedure considers any value of the LFSR's length, L, (prime or composite number). Emphasis is on the geometric interpretation of the regular cosets which produce degeneracies in the linear complexity of the filtered sequence. Numerical expressions to compute the linear complexity of such sequences are given as well as practical rules to design 2nd- order nonlinear filtering which preserve the maximal linear complexity are stated.