Xref: utzoo comp.dsp:1258 sci.math:15046 comp.music:2552 Path: utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!uunet!samsung!sdd.hp.com!zaphod.mps.ohio-state.edu!julius.cs.uiuc.edu!ux1.cso.uiuc.edu!uicbert.eecs.uic.edu!eddins From: eddins@uicbert.eecs.uic.edu (Steve Eddins) Newsgroups: comp.dsp,sci.math,comp.music Subject: Re: Want algorithm to generate 1/f time series Message-ID: <1991Feb12.140606.17505@uicbert.eecs.uic.edu> Date: 12 Feb 91 14:06:06 GMT References: <52654@sequent.UUCP> Organization: EECS Dept., University of Illinois at Chicago Lines: 28 tomh.bbs@shark.cs.fau.edu (Tom Holroyd) writes: >Use a random walk. [1] x = 0. [2] r = random integer. >[3] if r is odd, add 1 to x, else subtract 1 from x. ^^^^^^^^^^^ >[4] output x. [5] goto [2]. Testing if r is odd is equivalent to testing the least significant bit of r, which in many random number generators is not very "random." For example, I don't know what the algorithm used in ksh is, but it's random number generator alternates between even and odd integers! Not a very interesting random walk. You could test the most significant bit instead. >Tom Holroyd >FAU Center for Complex Systems >tomh@bambi.ccs.fau.edu Steve Eddins ------------ eddins@uicbert.eecs.uic.edu (312) 996-5771 FAX: (312) 413-0024 University of Illinois at Chicago, EECS Dept., M/C 154, 1120 SEO Bldg, Box 4348, Chicago, IL 60680 -- Steve Eddins ------------ eddins@uicbert.eecs.uic.edu (312) 996-5771 FAX: (312) 413-0024 University of Illinois at Chicago, EECS Dept., M/C 154, 1120 SEO Bldg,