Packages

object FFT

The FFT object provides a method to transform a signal in the time domain (e.g., a times series) in its representation in the frequency domain. The inverse transform is also provided.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. FFT
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  6. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  8. def fft(x: VectoC): VectoC

    Transform a signal in the time domain into its representation in the frequency domain using the Cooley–Tukey Fast Fourier Transform algorithm.

    Transform a signal in the time domain into its representation in the frequency domain using the Cooley–Tukey Fast Fourier Transform algorithm. The values are updated in place. FIX - algorithm should allow signals of any size

    x

    the signal in the time domain as a vector of Complex numbers

    See also

    www.cs.au.dk/~gerth/advising/thesis/joergen-fogh.pdf, Figure 5.7.

  9. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  10. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  11. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  12. def ifft(y: VectoC): VectoC

    Transform a signal in the frequency domain into its representation in the time domain using an Inverse Fast Fourier Transform algorithm.

    Transform a signal in the frequency domain into its representation in the time domain using an Inverse Fast Fourier Transform algorithm. The values are updated in place. FIX - algorithm should allow signals of any size

    See also

    www.dsprelated.com/showarticle/800.php

  13. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  14. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  15. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  16. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  17. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  18. def toString(): String
    Definition Classes
    AnyRef → Any
  19. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  20. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  21. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped