Takashi Takekawa, Ph.D.

Research Scientist

Lab. for Neural Circuit Theory
Neural Circuit Function Research Core
RIKEN Brain Science Institute (BSI)

Software

EToS (Efficient Technology of Spike-sorting)

implimentation of accurate spike sorting algorithms

tutils C++ library

version	file	changes	release
1.2	tutils-1.2.tar.gz	implement of dSFMT (dSFMT-src-2.1 base)	2009-12-25
1.1	tutils-1.1.tar.gz	implement of dSFMT (dSFMT-src-1.2 base)	2007-09-06
1.0	tutils-1.0.tar.gz	implement of dSFMT (dSFMT-src-1.1 base)	2007-07-06

double precision SIMD-oriented Fast Mersenne Twister (dSFMT) is implemented. dSFMT directly generates double precision floating point pseudorandom numbers. C version of dSFMT code was released by Makoto Matsumoto and Mutsuo Saito on March 12th in 2007.

See tutils-1.x/test directory to find how to use this library.

Sample program using dSFMT of tutils C++ library

test.cc

#include <iostream>
#include <tutils/dsfmt.h>

int
main()
{
  tutils::dsfmt19937 rand(1234);
  for (int i(0); i < 1000; ++i) {
    std::cout << rand.gen() << '\n';
  }
  return 0;
}

compile

$ g++ -O2 -IXX/tuilts-1.x/include XX/tutils-1.x/src/dsfmt.cc -o dsfmt.o
$ g++ -O2 -IXX/tutils-1.x/include test.cc dsfmt.o -o test

compile option -msse2 may make the program faster.