46,106 research outputs found
Enumeration of Linear Transformation Shift Registers
We consider the problem of counting the number of linear transformation shift
registers (TSRs) of a given order over a finite field. We derive explicit
formulae for the number of irreducible TSRs of order two. An interesting
connection between TSRs and self-reciprocal polynomials is outlined. We use
this connection and our results on TSRs to deduce a theorem of Carlitz on the
number of self-reciprocal irreducible monic polynomials of a given degree over
a finite field.Comment: 16 page
The realization and application of parallel linear feedback shift registers
Two methods for serial-to-parallel transformation of linear feedback shift registers are briefly discussed. A third method for transformation is rigorously developed using a next-state and output equation representation of the linear feedback shift register. An algorithm is developed for simplifying the parallel machine resulting from serial-to-parallel transformation, where simplification is defined as reduction in the required number of modulo 2 adders. A computer program incorporating serial-to-parallel transformation and the simplification algorithm is provided --Abstract, page ii
Extended class of linear feedback shift registers
Shift registers with linear feedback are frequently used. They owe their popularity to very well developed theoretical base. Registers with feedback of prime polynomials are of particular practical importance. They are willingly applied as test sequence generators and test response compactors. The article presents an attempt to extend the class of registers with linear feedback. Basing on the formal description of the register, the algorithms of register transformation are proposed. It allows to obtain the registers with equivalent graphs.[1] I. Gosciniak, “Linear Registers with Mixed Feedback, in Polish; Rejestry liniowe z mieszanym sprzȩżeniem zwrotnym,” Pomiary Automatyka Kontrola, no. 1, pp. 4–6, 1996.[2] K. Iwasaki, “Analysis and proposal of signature circuits for LSI testing,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 7, no. 1, pp. 84–90, 1988.[3] L.-T. Wang, N. Touba, R. Brent, H. Xu, and H. Wang, “On Designing Transformed Linear Feedback Shift Registers with Minimum Hardware Cost – Technical Report,” Computer Engineering Research Center Department of Electrical & Computer Engineering The University of Texas at Austin, 2011.[4] J. Rajski, J. Tyszer, M. Kassab, and N. Mukherjee, “Method for Synthesizing Linear Finite State Machines,” U.S. Patent, No. 6,353,842, 2002.[5] I. Gosciniak, “Equivalent Form of Linear Feedback Shift Registers,” in XIXth National Conference Circuit Theory and Eletronic Networks, 1996, pp. 115–120.[6] L. Alaus, D. Noguet, and J. Palicot, “A Reconfigurable LFSR for Tristandard SDR Transceiver, Architecture and Complexity Analysis,” in Digital System Design Architectures, Methods and Tools, 2008. DSD ’08. 11th EUROMICRO Conference on. IEEE Computer Society, 2008, pp. 61–67.[7] R. Ash, Information Theory. John Wiley & Sons, 1967.[8] M. Kopec, “Can Nonlinear Compactors Be Better than Linear Ones?” IEEE Trans. Comput., no. 11, pp. 1275–1282, 1995.[9] A. Gucha and L. Kinney, “Relating the Cyclic Behaviour of Linear Intrainverted Feedback shift Registers,” IEEE Transactions on Computers, vol. 41, no. 9, pp. 1088–1100, 1992
Cyclic Quantum Error-Correcting Codes and Quantum Shift Registers
We transfer the concept of linear feed-back shift registers to quantum
circuits. It is shown how to use these quantum linear shift registers for
encoding and decoding cyclic quantum error-correcting codes.Comment: 18 pages, 15 figures, submitted to Proc. R. Soc.
Recommended from our members
Layered cellular automata for pseudorandom number generation
The proposed Layered Cellular Automata (L-LCA), which comprises of a main CA with L additional layers of memory registers, has simple local interconnections and high operating speed. The time-varying L-LCA transformation at each clock can be reduced to a single transformation in the set formed by the transformation matrix of a maximum length Cellular Automata (CA), and the entire transformation sequence for a single period can be obtained. The analysis for the period characteristics of state sequences is simplified by analyzing representative transformation sequences determined by the phase difference between the initial states for each layer. The L-LCA model can be extended by adding more layers of memory or through the use of a larger main CA based on widely available maximum length CA. Several L-LCA (L=1,2,3,4) with 10- to 48-bit main CA are subjected to the DIEHARD test suite and better results are obtained over other CA designs reported in the literature. The experiments are repeated using the well-known nonlinear functions and in place of the linear function used in the L-LCA. Linear complexity is significantly increased when or is used
Efficient linear feedback shift registers with maximal period
We introduce and analyze an efficient family of linear feedback shift
registers (LFSR's) with maximal period. This family is word-oriented and is
suitable for implementation in software, thus provides a solution to a recent
challenge posed in FSE '94. The classical theory of LFSR's is extended to
provide efficient algorithms for generation of irreducible and primitive LFSR's
of this new type
- …