Calculation of fibonacci polynomials for gfsr sequences with low discrepancies

Shu Tezuka, Masanori Fushimi

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Fibonacci polynomials are defined in the context of the two-dimensional discrepancy of Tausworthe pseudorandom sequences as an analogue to Fibonacci numbers, which give the best figure of merit for the two-dimensional discrepancy of linear congruential sequences. We conduct an exhaustive search for the Fibonacci polynomials of degree less than 32 whose associated Tausworthe sequences can be easily implemented and very quickly generated.

Original languageEnglish
Pages (from-to)763-770
Number of pages8
JournalMathematics of Computation
Volume60
Issue number202
DOIs
Publication statusPublished - Jan 1 1993

Fingerprint

Discrepancy
Polynomials
Pseudorandom Sequence
Polynomial
Lame number
Exhaustive Search
Figure
Analogue
Context

All Science Journal Classification (ASJC) codes

  • Algebra and Number Theory
  • Computational Mathematics
  • Applied Mathematics

Cite this

Calculation of fibonacci polynomials for gfsr sequences with low discrepancies. / Tezuka, Shu; Fushimi, Masanori.

In: Mathematics of Computation, Vol. 60, No. 202, 01.01.1993, p. 763-770.

Research output: Contribution to journalArticle

Tezuka, Shu ; Fushimi, Masanori. / Calculation of fibonacci polynomials for gfsr sequences with low discrepancies. In: Mathematics of Computation. 1993 ; Vol. 60, No. 202. pp. 763-770.
@article{8158e47afc7643b4a7c72c81adc20ef2,
title = "Calculation of fibonacci polynomials for gfsr sequences with low discrepancies",
abstract = "Fibonacci polynomials are defined in the context of the two-dimensional discrepancy of Tausworthe pseudorandom sequences as an analogue to Fibonacci numbers, which give the best figure of merit for the two-dimensional discrepancy of linear congruential sequences. We conduct an exhaustive search for the Fibonacci polynomials of degree less than 32 whose associated Tausworthe sequences can be easily implemented and very quickly generated.",
author = "Shu Tezuka and Masanori Fushimi",
year = "1993",
month = "1",
day = "1",
doi = "10.1090/S0025-5718-1993-1160278-0",
language = "English",
volume = "60",
pages = "763--770",
journal = "Mathematics of Computation",
issn = "0025-5718",
publisher = "American Mathematical Society",
number = "202",

}

TY - JOUR

T1 - Calculation of fibonacci polynomials for gfsr sequences with low discrepancies

AU - Tezuka, Shu

AU - Fushimi, Masanori

PY - 1993/1/1

Y1 - 1993/1/1

N2 - Fibonacci polynomials are defined in the context of the two-dimensional discrepancy of Tausworthe pseudorandom sequences as an analogue to Fibonacci numbers, which give the best figure of merit for the two-dimensional discrepancy of linear congruential sequences. We conduct an exhaustive search for the Fibonacci polynomials of degree less than 32 whose associated Tausworthe sequences can be easily implemented and very quickly generated.

AB - Fibonacci polynomials are defined in the context of the two-dimensional discrepancy of Tausworthe pseudorandom sequences as an analogue to Fibonacci numbers, which give the best figure of merit for the two-dimensional discrepancy of linear congruential sequences. We conduct an exhaustive search for the Fibonacci polynomials of degree less than 32 whose associated Tausworthe sequences can be easily implemented and very quickly generated.

UR - http://www.scopus.com/inward/record.url?scp=84968513708&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84968513708&partnerID=8YFLogxK

U2 - 10.1090/S0025-5718-1993-1160278-0

DO - 10.1090/S0025-5718-1993-1160278-0

M3 - Article

VL - 60

SP - 763

EP - 770

JO - Mathematics of Computation

JF - Mathematics of Computation

SN - 0025-5718

IS - 202

ER -