M. Goresky and A. Klapper, Galois and Fibonacci Representations for Feedback with Carry Shift Registers, in preparation. 25 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Periodicity, Correlation, and Distribution Properties of.. - Goresky, Klapper (2000) Self-citation (Goresky Klapper) (Correct)
.... sequences Mark Goresky # Andrew Klapper October 26, 2000 Abstract A d feedback with carry shift register (d FCSR) is a finite state machine, similar to a linear feedback shift register, in which a small amount of memory and a delay (by d clock cycles) is used in the feedback algorithm (see [4, 5]) The output sequences of these simple devices may be described using arithmetic in a ramified extension field of the rational numbers. In this paper we show how many of these sequences may also be described using simple integer arithmetic, and consequently how to find such sequences with large ....
....which to study shift register sequences. It also explains the many apparent similarities between the theory of LFSRs and the theory of FCSRs (and d FCSRs) However in this paper we restrict our attention to the d FCSRs. This paper is self contained and does not rely on any results from [8] In [5] we show how to build shift register hardware which will generate these d FCSR sequences with given design parameters. However, in this paper we maintain a purely algebraic point of view and we will only tangentially refer to the relevant shift register hardware. The constructions in [5] depend ....
[Article contains additional citation context not shown here]
M. Goresky and A. Klapper, Galois and Fibonacci Representations for Feedback with Carry Shift Registers, in preparation. 25
Periodicity, Correlation, and Distribution Properties of.. - Goresky, Klapper (2000) Self-citation (Goresky Klapper) (Correct)
....which to study shift register sequences. It also explains the many apparent similarities between the theory of LFSRs and the theory of FCSRs (and d FCSRs) However in this paper we restrict our attention to the d FCSRs. This paper is self contained and does not rely on any results from [8] In [5] we show how to build shift register hardware which will generate these d FCSR sequences with given design parameters. However, in this paper we maintain a purely algebraic point of view and we will only tangentially refer to the relevant shift register hardware. The constructions in [5] depend ....
....[8] In [5] we show how to build shift register hardware which will generate these d FCSR sequences with given design parameters. However, in this paper we maintain a purely algebraic point of view and we will only tangentially refer to the relevant shift register hardware. The constructions in [5] depend heavily on this paper. In the remaining sections our attention is restricted to the binary case, p = 2. The usual notion of cross correlation (with shift ) of two binary sequences S and T is the sum P i ( 1) S i T i : The addition in the exponent may be replaced by addition modulo ....
[Article contains additional citation context not shown here]
M. Goresky and A. Klapper, Galois and Fibonacci Representations for Feedback with Carry Shift Registers, in preparation. 25
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC