-
... ~nlayers = 10; ~basefreqs = ~nlayers.collect{|x| (x * 7 + 60).midicps}; ~fftbufs = ~nlayers.collect{ Buffer.alloc(s, 2048) }; ( x = { var layers, position, trig, ampenv, freqenv, layerpos, smoothfactor, ampfactor; position = ...
-
... { // cosine and sine branches using brickwall for lowpass at nyquist/2 cosBr = IFFT.ar( PV_BrickWall( FFT.new( LocalBuf.new(size), inputDbl * cos ), -0.5 ) ); sinBr = IFFT.ar( PV_BrickWall( FFT.new( LocalBuf.new(size), inputDbl * sin ), -0. ...
-
... Raw; var tracks, maxMag, nFrames, nPartials; var exportType, result, mkTrackFn, fftSz; postf("[z354] analyze: % | maxPartials=% frames=% %.0f-%.0f Hz\n", PathName(path).fileName, numTracks, numPoints, minFreq, maxFreq); // --- Load and anal ...
-
... stereo input, an array: [L, R] size Number of samples for Hilbert window (i.e. FFT size) or running sum. See RunningSum and HilbertW for more info. NOTE: For instantaneous analysis, size must be a power of two! method \instant for instanta ...
-
... Env.perc(releaseTime:0.5),Dust.ar(0.5))*0.7; Out.ar(0,sig !2); // chain = FFT({LocalBuf(512, 1)}, sig); onsets = Onsets.kr(chain,0.1,\power); SendTrig.kr(onsets); SendPeakRMS.kr(sig, 20, 3, "/replyAddress"); }).add; Synth(\pul ...
-
... , #[\wavesets, \buffer]) } hash { ^this.instVarHash(#[\wavesets, \buffer]) } // fft // note that if you send too many requests, the corresponding action may not be called // this is because of the getn implementation, which has no id getFFT ...
-
... uf, phase, 0, 1); // var detect = PV_JensenAndersen.ar( var detect = Onsets.kr( FFT(LocalBuf(2048), sig), threshold: thresh ); detect = Trig1.ar(detect, spacing); SendReply.ar(detect, '/bufAnalyzeOnsets', [buf, phase, Amplitude.kr(sig)]); / ...
-
... , which hopefully avoids one problem with difference measures based directly on FFT bin differences, namely that its linear frequency scale can end up prioritising the higher frequencies. The comparison is still quite crude, however. Weight ...
-
... stereo input, an array: [L, R] size Number of samples for Hilbert window (i.e. FFT size) or running sum. See RunningSum and HilbertW for more info. NOTE: For instantaneous analysis, size must be a power of two! method \instant for instanta ...
-
... m) Rust version by [Sam Pluta](sampluta.com) Implements a phase randomized Real FFT time stretch algorithm, the NessStretch, which splits the original sound file into 9 discrete frequency bands, and uses a decreasing frame size to correspon ...