On the scrambled soboĺ sequence

  • Authors:
  • Hongmei Chi;Peter Beerli;Deidre W. Evans;Michael Mascagni

  • Affiliations:
  • Department of Computer and Information Sciences, Florida A&M University, Tallahassee, FL;School of Computational Science and Information Technology, Florida State University, Tallahassee, FL;Department of Computer and Information Sciences, Florida A&M University, Tallahassee, FL;School of Computational Science and Information Technology, Florida State University, Tallahassee, FL

  • Venue:
  • ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Soboĺ sequence is the most popular quasirandom sequence because of its simplicity and efficiency in implementation. We summarize aspects of the scrambling technique applied to Soboĺ sequences and propose a new simpler modified scrambling algorithm, called the multi-digit scrambling scheme. Most proposed scrambling methods randomize a single digit at each iteration. In contrast, our multi-digit scrambling scheme randomizes one point at each iteration, and therefore is more efficient. After the scrambled Soboĺ sequence is produced, we use this sequence to evaluate a particular derivative security, and found that when this sequence is numerically tested, it is shown empirically to be far superior to the original unscrambled sequence.