Resample

A band-limited resampling UGen.

It uses an internal table for the anti-aliasing filter. Table resolution is currently fixed at 4096 filter samples per zero crossing and linear interpolation in the FIR table, but the total filter length can be specified through the zeroCrossings parameter. Note: If filter parameters are changed, the table must be recalculated which is very expensive. However, factor modulation is efficient.

Note: Unlike most other UGens, all parameters but in are read at "output rate". That is particular important for factor modulation. For each frame output, one frame from factor is consumed.

in: the signal to resample
factor: the resampling factor, where values greater than one mean the signal is stretched (sampling-rate increases or pitch lowers) and values less than one mean the signal is condensed (sampling-rate decreases or pitch rises)
minFactor: the minimum expected resampling factor, which controls the amount of buffering needed for the input signal. This is used at initialization time only. The default value of zero makes the UGen settles on the first factor value encountered. It is possible to use a value actually higher than the lowest provided factor, in order to limit the buffer usage. In that case, the FIR anti-aliasing filter will be truncated.
rollOff: the FIR anti-aliasing roll-off width
kaiserBeta: the FIR windowing function's parameter
zeroCrossings: the number of zero-crossings in the truncated and windowed sinc FIR.

Linear Supertypes

Serializable, Serializable, SingleOut, SomeOut[StreamOut], GE.Lazy, GE, UGenSource[UGenInLike, StreamOut], Expander[UGenInLike], Lazy, Product, Equals, AnyRef, Any

Instance Constructors

new Resample(in: GE, factor: GE, minFactor: GE = 0, rollOff: GE = 0.86, kaiserBeta: GE = 7.5, zeroCrossings: GE = 15)

in
the signal to resample
factor
the resampling factor, where values greater than one mean the signal is stretched (sampling-rate increases or pitch lowers) and values less than one mean the signal is condensed (sampling-rate decreases or pitch rises)
minFactor
the minimum expected resampling factor, which controls the amount of buffering needed for the input signal. This is used at initialization time only. The default value of zero makes the UGen settles on the first factor value encountered. It is possible to use a value actually higher than the lowest provided factor, in order to limit the buffer usage. In that case, the FIR anti-aliasing filter will be truncated.
rollOff
the FIR anti-aliasing roll-off width
kaiserBeta
the FIR windowing function's parameter
zeroCrossings
the number of zero-crossings in the truncated and windowed sinc FIR.

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
val factor: GE

the resampling factor, where values greater than one mean the signal is stretched (sampling-rate increases or pitch lowers) and values less than one mean the signal is condensed (sampling-rate decreases or pitch rises)
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
val in: GE

the signal to resample
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
val kaiserBeta: GE

the FIR windowing function's parameter
def makeUGen(args: IndexedSeq[UGenIn])(implicit b: Builder): UGenInLike

Attributes
protected
Definition Classes
Resample → UGenSource
def makeUGens(implicit b: Builder): UGenInLike

Abstract method which must be implemented by creating the actual UGens during expansion.
Abstract method which must be implemented by creating the actual UGens during expansion. This method is at most called once during graph expansion
returns
the expanded object (depending on the type parameter U)

Attributes
protected
Definition Classes
Resample → Expander
val minFactor: GE

the minimum expected resampling factor, which controls the amount of buffering needed for the input signal.
the minimum expected resampling factor, which controls the amount of buffering needed for the input signal. This is used at initialization time only. The default value of zero makes the UGen settles on the first factor value encountered. It is possible to use a value actually higher than the lowest provided factor, in order to limit the buffer usage. In that case, the FIR anti-aliasing filter will be truncated.
final def name: String

Definition Classes
UGenSource
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final def rewrap(args: IndexedSeq[UGenInLike], exp: Int)(implicit b: Builder): UGenInLike

Attributes
protected
Definition Classes
SomeOut → UGenSource
val rollOff: GE

the FIR anti-aliasing roll-off width
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
final def unwrap(args: IndexedSeq[UGenInLike])(implicit b: Builder): UGenInLike

Attributes
protected
Definition Classes
UGenSource
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
val zeroCrossings: GE

the number of zero-crossings in the truncated and windowed sinc FIR.

Related Doc: package graph

final case class Resample(in: GE, factor: GE, minFactor: GE = 0, rollOff: GE = 0.86, kaiserBeta: GE = 7.5, zeroCrossings: GE = 15) extends SingleOut with Product with Serializable

Instance Constructors

new Resample(in: GE, factor: GE, minFactor: GE = 0, rollOff: GE = 0.86, kaiserBeta: GE = 7.5, zeroCrossings: GE = 15)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

val factor: GE

def finalize(): Unit

final def getClass(): Class[_]

val in: GE

final def isInstanceOf[T0]: Boolean

val kaiserBeta: GE

def makeUGen(args: IndexedSeq[UGenIn])(implicit b: Builder): UGenInLike

def makeUGens(implicit b: Builder): UGenInLike

val minFactor: GE

final def name: String

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def rewrap(args: IndexedSeq[UGenInLike], exp: Int)(implicit b: Builder): UGenInLike

val rollOff: GE

final def synchronized[T0](arg0: ⇒ T0): T0

final def unwrap(args: IndexedSeq[UGenInLike])(implicit b: Builder): UGenInLike

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

val zeroCrossings: GE

Inherited from Serializable

Inherited from Serializable

Inherited from SingleOut

Inherited from SomeOut[StreamOut]

Inherited from GE.Lazy

Inherited from GE

Inherited from UGenSource[UGenInLike, StreamOut]

Inherited from Expander[UGenInLike]

Inherited from Lazy

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped