Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Slumpgeneratorer: Implementation och test av pseudoslumptalsgeneratorer
KTH, School of Computer Science and Communication (CSC).
KTH, School of Computer Science and Communication (CSC).
2014 (Swedish)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [sv]

Denna rapport undersöker pseudoslumptalsgeneratorer och hur statiska tester kan avgöra under vilka omständigheter man ska välja dessa. Det genomförs genom att implementera två vanliga pseudoslumptalsgeneratorer och sex vanliga statistiska tester. På detta sätt skapas en grund för att avgöra vilken pseudoslumptalsgenerator som är bäst i en given situation. All implementation av dessa tester och pseudoslumptalsgeneratorer gjordes i MATLAB. Resultaten visade på ett fåtal skillnader mellan olika pseudoslumptalsgeneratorer. De slutsatser som drogs utav resultaten säger att då det föreligger behov för korta sekvenser behöver man endast använda algoritmen linjär kongruens för slumptalsgenerering. Först när man behöver längre eller kontinuerliga sekvenser är algoritmen Mersenne Twister fördelaktig.

Abstract [en]

This thesis looks into pseudo random number generators and how statistical tests can determine under what circumstances one should choose one of these. This is done by implementing two widely used pseudo random number generators and six common statistical tests. This provides a basis on how to decide which pseudo random number generator is more suitable in a given situation. All implementation of generators and tests are done using MATLAB. The results showed a few differences between the pseudo random number generators. The conclusions that could me made from the results was that when there is need only for shorter sequences the linear congruency algorithm is more preferable. Only when longer or continuous sequences are required the algorithm Mersenne Twister should be used.

Place, publisher, year, edition, pages
2014.
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-157403OAI: oai:DiVA.org:kth-157403DiVA: diva2:769852
Examiners
Available from: 2014-12-09 Created: 2014-12-09 Last updated: 2014-12-09Bibliographically approved

Open Access in DiVA

fulltext(1018 kB)116 downloads
File information
File name FULLTEXT01.pdfFile size 1018 kBChecksum SHA-512
5da9eaa9cbafbfaa37131ba39c8a3bde0e51ab69ce697a70d9d621edcec37a087d77f85556a68fc6c657e4ae88dc90eb6420a9f81a16d58878b3deb270f0328e
Type fulltextMimetype application/pdf

By organisation
School of Computer Science and Communication (CSC)
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 116 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 88 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf