CiteSeerX — Optimal Golomb Rulers: An Exhaustive Parallel Search Implementation

Optimal Golomb Rulers: An Exhaustive Parallel Search Implementation (1993) [7 citations — 0 self]

Popular Tags

No tags have been applied to this document.

BibTeX | Add To MetaCart

@MISC{Rankin93optimalgolomb,
    author = {William T. Rankin},
    title = {Optimal Golomb Rulers: An Exhaustive Parallel Search Implementation},
    year = {1993}
}

Bookmarks

OpenURL

Abstract:

Golomb Rulers are numerical sequences that find application in a variety of engineering fields. The computation of these series, however, is prohibitively costly in terms of computer resources. Thus the discovery of new rulers over the past two decades has been limited by the available computing resources. This thesis describes a parallel implementation of an Optimal Golomb Ruler search algorithm. This algorithm provides a high utilization of available computer resources, and is portable to a variety of computer platforms. Reliability and fault tolerance issues are addressed by algorithm design. With the new algorithm, two previously unpublished rulers were independently discovered and verified. Chapter 1 Introduction The term "Golomb Ruler" derived its name from the relevant work by Professor Solomon W. Golomb of the University of Southern California [4]. These rulers are numerical sequences or graphs with application in a wide variety of fields including radio communications, x-ra...

Citations

134	Combinatorial Algorithms, Theory and Practice – Reingold, Nievergelt, et al. - 1977
13	Intermodulation interference in radio systems – Babcock - 1953
10	A Class of Binary Recurrent Codes With Limited Error Propagation – Robinson, Bernstein - 1967
10	Some New Optimum Golomb Rulers – Shearer - 1990
9	Bounds and Construction for Difference Triangle Sets – Klove - 1989
8	Minimum-redundancy linear arrays – Moffet - 1968
5	Integer sets with distinct sums and differences and carrier frequency assignments for nonlinear repeaters – Atkinson, Santoro, et al. - 1986
5	Acquisition Sequences in PPM Communications – Gagliardi, Taylor - 1987
5	Optimal Golomb Rulers – Robinson - 1979
4	Minimum Redundancy Linear Arrays – McCracken - 1991
3	Applications of Numbered Unidirected Graphs – Bloom, Golomb - 1977
3	Some Difference Triangles for Constructing Self-Orthogonal Codes – Kleiber - 1969
2	Ribes. On Optimal Sythetic Linear Arrays with Applications to Radioastronomy – Biraud, C - 1974
2	Bounds on the Size of Optimal Diffence Triangle Sets – Klove - 1988
1	Parallel and Sequential Timings of Golomb Ruler Calculation Codes – Angerer - 1992