Myerson et al., 1995 - Google Patents
Some problems concerning recurrence sequencesMyerson et al., 1995
View PDF- Document ID
- 8905560830738480075
- Author
- Myerson G
- Van Der Poorten A
- Publication year
- Publication venue
- The American mathematical monthly
External Links
Snippet
There are questions about recurrence sequences that seem to crop up again and again. Plainly, though their answers are well known they are not known well. We endeavour to explain these answers in context so that they may become more widely known. The …
- 230000001939 inductive effect 0 description 5
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
- G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
- G06F7/724—Finite field arithmetic
- G06F7/726—Inversion; Reciprocal calculation; Division of elements of a finite field
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
- G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
- G06F7/52—Multiplying; Dividing
- G06F7/523—Multiplying only
- G06F7/533—Reduction of the number of iteration steps or stages, e.g. using the Booth algorithm, log-sum, odd-even
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
- G06F17/147—Discrete orthonormal transforms, e.g. discrete cosine transform, discrete sine transform, and variations therefrom, e.g. modified discrete cosine transform, integer transforms approximating the discrete cosine transform
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
- G06F17/141—Discrete Fourier transforms
- G06F17/142—Fast Fourier transforms, e.g. using a Cooley-Tukey type algorithm
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
- G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
- G06F7/544—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices for evaluating functions by calculation
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03H—IMPEDANCE NETWORKS, e.g. RESONANT CIRCUITS; RESONATORS
- H03H17/00—Networks using digital techniques
- H03H17/02—Frequency selective networks
- H03H17/06—Non-recursive filters
- H03H17/0621—Non-recursive filters with input-sampling frequency and output-delivery frequency which differ, e.g. extrapolation; Anti-aliasing
- H03H17/0635—Non-recursive filters with input-sampling frequency and output-delivery frequency which differ, e.g. extrapolation; Anti-aliasing characterized by the ratio between the input-sampling and output-delivery frequencies
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03H—IMPEDANCE NETWORKS, e.g. RESONANT CIRCUITS; RESONATORS
- H03H17/00—Networks using digital techniques
- H03H17/02—Frequency selective networks
- H03H17/0223—Computation saving measures; Accelerating measures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06G—ANALOGUE COMPUTERS
- G06G7/00—Devices in which the computing operation is performed by varying electric or magnetic quantities
- G06G7/12—Arrangements for performing computing operations, e.g. operational amplifiers
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Mahler | Some suggestions for further research | |
Golomb | Shift register sequences: secure and limited-access code generators, efficiency code generators, prescribed property generators, mathematical models | |
Burrus | Digital filter structures described by distributed arithmetic | |
Pollard et al. | The theory of algebraic numbers | |
Huntington | The continuum and other types of serial order | |
Agarwal et al. | Number theoretic transforms to implement fast digital convolution | |
Bostan et al. | Tellegen's principle into practice | |
Myerson et al. | Some problems concerning recurrence sequences | |
Allouche et al. | Periodicity, repetitions, and orbits of an automatic sequence | |
Bilu | The many faces of the subspace theorem [after Adamczewski, Bugeaud, Corvaja, Zannier...] | |
Polizzi et al. | A Pair of Rigid Surfaces with pg= q= 2 and K 2= 8 Whose Universal Cover is Not the Bidisk | |
Lecouturier et al. | On a conjecture of Sharifi and Mazur’s Eisenstein ideal | |
Fisher | The Cassels–Tate pairing and the Platonic solids | |
Thakur | On characteristic $ p $ zeta functions | |
Dimitrov et al. | Generalized Fermat-Mersenne number theoretic transform | |
Zhang et al. | Entire solutions of delay differential equations of Malmquist type | |
Kundu et al. | Control theorems for fine Selmer groups | |
Vanwormhoudt | Structural properties of complex residue rings applied to number theoretic Fourier transforms | |
Karpenko | Filtrations on the representation ring of an affine algebraic group | |
Dubois et al. | The generalized discrete Fourier transform in rings of algebraic integers | |
Golomb | Properties of the sequences 3⋅ 2ⁿ+ 1 | |
Dimitrov et al. | Number theoretic transforms over the golden section quadratic field | |
Li | Several classes of exponential sums and three-valued Walsh spectrums over finite fields | |
Cautis et al. | Periodicity, morphisms, and matrices | |
Abboud | Actions of nilpotent groups on complex algebraic varieties |