Pawel Augustynowicz and Krzysztof Kanciak

The search of square m-sequences with maximum period via GPU and CPU

This paper deals with the efficient parallel search of square m-sequences on both modern CPUs and GPUs. The key idea is based on applying particular vector processor instructions with a view to maximizing the advantage of Single Instruction Multiple Data (SIMD) and Single Instruction Multiple Threads (SIMT) execution patterns. The developed implementation was adjusted to testing for the maximum-period of m-sequences of some particular forms. Furthermore, the early abort sieving strategy based on the application of SAT-solvers were presented. With this solution, it is possible to search m-sequences up to degree 32 exhaustively.

Reference

DOI: 10.36244/ICJ.2019.4.3

Download 

Technical Co-Sponsors