Multidimensional Costas Arrays and Their Enumeration Using GPUs and FPGAs

The enumeration of two-dimensional Costas arrays is a problem with factorial time complexity and has been solved for sizes up to 29 using computer clusters. Costas arrays of higher dimensionality have recently been proposed and their properties are beginning to be understood. This paper presents, to...

Full description

Saved in:
Bibliographic Details
Published in:International Journal of Reconfigurable Computing Vol. 2012; no. 2012; pp. 120 - 128
Main Authors: Rafael A. Arce-Nazario, José Ortiz-Ubarri
Format: Journal Article
Language:English
Published: Cairo, Egypt Hindawi Limiteds 01.01.2012
Hindawi Puplishing Corporation
Hindawi Publishing Corporation
Wiley
Subjects:
Arrays
Clusters
Concurrency
Cost engineering
Enumeration
Factorials
Field programmable gate arrays
Programmable array logic
Searching
ISSN:1687-7195, 1687-7209
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The enumeration of two-dimensional Costas arrays is a problem with factorial time complexity and has been solved for sizes up to 29 using computer clusters. Costas arrays of higher dimensionality have recently been proposed and their properties are beginning to be understood. This paper presents, to the best of our knowledge, the first proposed implementations for enumerating these multidimensional arrays in GPUs and FPGAs, as well as the first discussion of techniques to prune the search space and reduce enumeration run time. Both GPU and FPGA implementations rely on Costas array symmetries to reduce the search space and perform concurrent explorations over the remaining candidate solutions. The fine grained parallelism utilized to evaluate and progress the exploration, coupled with the additional concurrency provided by the multiple instanced cores, allowed the FPGA (XC5VLX330-2) implementation to achieve speedups of up to 30× over the GPU (GeForce GTX 580).
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1687-7195
1687-7209
DOI:10.1155/2012/196761