fast-fourier 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: f1cd0ef2fc02524d93db3adf73b5d830335061e3
+  data.tar.gz: 97777a79b8b610a837918ab6d1c8334b26388afa
+SHA512:
+  metadata.gz: 4c0795ebe74323e195be417095d24e71b51727e4e65409cc763f81dc7d5f4225548b5f7296f6e40ad93296137581c29303038230aa6a65ce40b70d12b29fa81a
+  data.tar.gz: 7dacac11f2b754854a1e1ac61900d942468a116e42e9a1b7e1867034aea47a2e33bb88ea9ab8256f964e5920e30fa1c981e97fc03c4dde25da1f426cfe898247

data/.gitignore

@@ -0,0 +1,36 @@
+.idea/workspace.xml
+Gemfile.lock
+*.gem
+*.rbc
+/.config
+/coverage/
+/InstalledFiles
+/pkg/
+/spec/reports/
+/test/tmp/
+/test/version_tmp/
+/tmp/
+
+## Specific to RubyMotion:
+.dat*
+.repl_history
+build/
+
+## Documentation cache and generated files:
+/.yardoc/
+/_yardoc/
+/doc/
+/rdoc/
+
+## Environment normalisation:
+/.bundle/
+/lib/bundler/man/
+
+# for a library or gem, you might want to ignore these files since the code is
+# intended to run in multiple environments; otherwise, check them in:
+# Gemfile.lock
+# .ruby-version
+# .ruby-gemset
+
+# unless supporting rvm < 1.11.0 or doing something fancy, ignore this:
+.rvmrc

data/.idea/.name

@@ -0,0 +1 @@
+FastFourier

data/.idea/.rakeTasks

@@ -0,0 +1,7 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<Settings><!--This file was automatically generated by Ruby plugin.
+You are allowed to: 
+1. Remove rake task
+2. Add existing rake tasks
+To add existing rake tasks automatically delete this file and reload the project.
+--><RakeGroup description="" fullCmd="" taksId="rake"><RakeTask description="Build FastFourier-0.0.1.gem into the pkg directory" fullCmd="build" taksId="build" /><RakeTask description="Build and install FastFourier-0.0.1.gem into system gems" fullCmd="install" taksId="install" /><RakeTask description="Create tag v0.0.1 and build and push FastFourier-0.0.1.gem to Rubygems" fullCmd="release" taksId="release" /></RakeGroup></Settings>

data/.idea/compiler.xml

@@ -0,0 +1,23 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="CompilerConfiguration">
+    <option name="DEFAULT_COMPILER" value="Javac" />
+    <resourceExtensions />
+    <wildcardResourcePatterns>
+      <entry name="!?*.java" />
+      <entry name="!?*.form" />
+      <entry name="!?*.class" />
+      <entry name="!?*.groovy" />
+      <entry name="!?*.scala" />
+      <entry name="!?*.flex" />
+      <entry name="!?*.kt" />
+      <entry name="!?*.clj" />
+    </wildcardResourcePatterns>
+    <annotationProcessing>
+      <profile default="true" name="Default" enabled="false">
+        <processorPath useClasspath="true" />
+      </profile>
+    </annotationProcessing>
+  </component>
+</project>
+

data/.idea/copyright/profiles_settings.xml

@@ -0,0 +1,3 @@
+<component name="CopyrightManager">
+  <settings default="" />
+</component>

data/.idea/encodings.xml

@@ -0,0 +1,5 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="Encoding" useUTFGuessing="true" native2AsciiForPropertiesFiles="false" />
+</project>
+

data/.idea/misc.xml

@@ -0,0 +1,7 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="ProjectRootManager" version="2" languageLevel="JDK_1_6" assert-keyword="true" jdk-15="true" project-jdk-name="rbenv: 2.1.2" project-jdk-type="RUBY_SDK">
+    <output url="file://$PROJECT_DIR$/out" />
+  </component>
+</project>
+

data/.idea/modules.xml

@@ -0,0 +1,9 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="ProjectModuleManager">
+    <modules>
+      <module fileurl="file://$PROJECT_DIR$/FastFourier.iml" filepath="$PROJECT_DIR$/FastFourier.iml" />
+    </modules>
+  </component>
+</project>
+

data/.idea/scopes/scope_settings.xml

@@ -0,0 +1,5 @@
+<component name="DependencyValidationManager">
+  <state>
+    <option name="SKIP_IMPORT_STATEMENTS" value="false" />
+  </state>
+</component>

data/.idea/vcs.xml

@@ -0,0 +1,7 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="VcsDirectoryMappings">
+    <mapping directory="" vcs="Git" />
+  </component>
+</project>
+

data/FastFourier.iml

@@ -0,0 +1,23 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="RUBY_MODULE" version="4">
+  <component name="CompassSettings">
+    <option name="compassSupportEnabled" value="true" />
+  </component>
+  <component name="NewModuleRootManager" inherit-compiler-output="true">
+    <exclude-output />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/lib/fast-fourier" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/spec" isTestSource="true" />
+    </content>
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+    <orderEntry type="library" scope="PROVIDED" name="bundler (v1.6.2, rbenv: 2.1.2) [gem]" level="application" />
+    <orderEntry type="library" scope="PROVIDED" name="diff-lcs (v1.2.5, rbenv: 2.1.2) [gem]" level="application" />
+    <orderEntry type="library" scope="PROVIDED" name="rake (v10.3.2, rbenv: 2.1.2) [gem]" level="application" />
+    <orderEntry type="library" scope="PROVIDED" name="rspec (v2.14.1, rbenv: 2.1.2) [gem]" level="application" />
+    <orderEntry type="library" scope="PROVIDED" name="rspec-core (v2.14.8, rbenv: 2.1.2) [gem]" level="application" />
+    <orderEntry type="library" scope="PROVIDED" name="rspec-expectations (v2.14.5, rbenv: 2.1.2) [gem]" level="application" />
+    <orderEntry type="library" scope="PROVIDED" name="rspec-mocks (v2.14.6, rbenv: 2.1.2) [gem]" level="application" />
+  </component>
+</module>
+

data/Gemfile

@@ -0,0 +1,6 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in fast-fourier.gemspec
+gemspec
+
+gem 'rspec', '~> 2.14.0'

data/LICENSE

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2014 Justin W. Smith
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

data/LICENSE.txt

@@ -0,0 +1,22 @@
+Copyright (c) 2014 Justin W Smith
+
+MIT License
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/README.md

@@ -0,0 +1,29 @@
+# FastFourier
+
+An implementation of the Discrete Fourier Transform.
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+    gem 'FastFourier'
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install FastFourier
+
+## Usage
+
+TODO: Write usage instructions here
+
+## Contributing
+
+1. Fork it
+2. Create your feature branch (`git checkout -b my-new-feature`)
+3. Commit your changes (`git commit -am 'Add some feature'`)
+4. Push to the branch (`git push origin my-new-feature`)
+5. Create new Pull Request

data/Rakefile

@@ -0,0 +1,4 @@
+require "bundler/gem_tasks"
+require "rspec/core/rake_task"
+
+RSpec::Core::RakeTask.new(:spec)

data/fast-fourier.gemspec

@@ -0,0 +1,24 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'fast-fourier/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "fast-fourier"
+  spec.version       = FastFourier::VERSION
+  spec.authors       = ["Justin W Smith"]
+  spec.email         = ["justin.w.smith@gmail.com"]
+  spec.description   = %q{An implementation of the Cooley-Tukey algorithm for the Discrete Fourier Transform}
+  spec.summary       = %q{An implementation of the Cooley-Tukey algorithm for the Discrete Fourier Transform}
+  spec.homepage      = "https://github.com/justinwsmith/FastFourier"
+  spec.license       = "MIT"
+
+  spec.files         = `git ls-files`.split($/)
+  spec.executables   = spec.files.grep(%r{^bin/}) { |f| File.basename(f) }
+  spec.test_files    = spec.files.grep(%r{^(test|spec|features)/})
+  spec.require_paths = ["lib"]
+
+  spec.add_development_dependency "bundler", "~> 1.3"
+  spec.add_development_dependency "rake"
+  spec.add_development_dependency "rspec"
+end

data/lib/fast-fourier/fast-fourier.rb

@@ -0,0 +1,124 @@
+=begin
+The MIT License (MIT)
+
+Copyright (c) 2014 Justin W, Smith
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
+=end
+
+module FastFourier
+
+  @@fast_fourier_roots = {
+    Rational(0,1) => Complex(1, 0),
+    Rational(1,4) => Complex(0, 1),
+    Rational(1,2) => Complex(-1, 0),
+    Rational(3,4) => Complex(0, -1),
+    Rational(1,1) => Complex(1, 0)
+  }
+
+  def FastFourier.discrete_fourier(vals, inverse = false)
+    n = vals.length
+    if(n % 2 == 0)
+      dft =  :cooley_tukey_dft
+    else
+      dft = :discrete_fourier_slow
+    end
+
+    if inverse
+      case inverse
+        when :conjugate
+          send( dft, vals.map { |x| x.conj } ).map {|x| x.conj / vals.length}
+        when :swap
+          send( dft,  vals.map { |x| Complex(x.imag, x.real) } ).map {|x| Complex(x.imag, x.real) / vals.length}
+        else
+          send( dft, [vals[0]] + vals[1..-1].reverse).map{|x| x / vals.length}
+      end
+    else
+      send( dft, vals)
+    end
+  end
+
+  class <<self
+    alias_method(:dft, :discrete_fourier)
+  end
+
+  # This is a self-inverse variation of the discrete fourier transform
+  def FastFourier.discrete_involutary(vals)
+  	n = vals.length
+    if(n % 2 == 0)
+      dft =  :cooley_tukey_dft
+    else
+      dft = :discrete_fourier_slow
+    end
+
+    result = send( dft, vals.map { |x| x.conj } ).map {|x| x / Math.sqrt(vals.length) }
+
+    result[0...n]    
+  end
+
+private
+
+  def FastFourier.root_of_unity(den, num = 1)
+    key = Rational(num, den) % 1
+    if ans = @@fast_fourier_roots[key]
+      ans
+    else
+      angle = 2*Math::PI * key
+      @@fast_fourier_roots[key] = Complex(Math.cos(angle), Math.sin(angle))
+    end
+  end
+
+  def FastFourier.cooley_tukey_dft(vals)
+    if vals.size == 1
+      vals
+    else
+      n = vals.length
+      if(n % 2 == 0) # if n is not a power of 2
+        dft =  :cooley_tukey_dft
+      else
+        dft = :discrete_fourier_slow
+      end
+      vals_even = send( dft, (0...n).step(2).map{|i| vals[i]})
+      vals_odd = send( dft, (1...n).step(2).map{|i| vals[i]})
+
+      ret_vals = Array.new(n)
+
+      (0...(n/2)).each do |i|
+        ei = vals_even[i]
+        oi = vals_odd[i]
+        npri = root_of_unity(n, i).conj
+        oink = npri * oi
+        ret_vals[i] = (ei + oink)
+        ret_vals[i+n/2] = (ei - oink)
+      end
+      ret_vals
+    end
+  end
+
+  def FastFourier.discrete_fourier_slow(vals, inverse=false)
+    npr = root_of_unity(vals.length)
+    (0...(vals.length)).map do |i|
+      ary = (0...(vals.length)).map do |j|
+        vals[j] * npr ** (-1*i*j)
+      end
+      ary.inject(:+)
+    end
+  end
+
+end

data/lib/fast-fourier/version.rb

@@ -0,0 +1,3 @@
+module FastFourier
+  VERSION = "0.0.1"
+end

data/spec/fast-fourier_spec.rb

@@ -0,0 +1,106 @@
+require_relative '../lib/FastFourier/fast-fourier.rb'
+
+EPSILON = (2.0)**(-12.0)
+module FFTHelper
+  def FFTHelper.equal x, y
+    if [x, y].any? {|a| a.is_a? Complex}
+      (x - y).magnitude < EPSILON
+    else
+      (x - y) < EPSILON
+    end
+  end
+end
+
+include FastFourier
+
+describe FastFourier do
+  describe "root_of_unity" do
+    2.times do
+      den = 1 + rand(100)
+      num = rand(den)
+
+      ans = FastFourier.root_of_unity(den, num)
+      specify "#{num}th root raised to #{num}th power should be idempotent" do
+        #puts "#{ans**den}"
+        expect((ans**den - 1).magnitude).to be < EPSILON
+      end
+    end
+  end
+
+  inputs = (0..6).map {|x| (0...(2**x)).map{rand(1000)} } + (5..23).step(8).map {|x| (0...x).map{rand(1000)}}
+
+  describe "dft" do
+    (0...inputs.length).each do |i|
+
+      angle = (2 * Math::PI) / inputs[i].length
+      npr = Complex(Math.cos(angle), Math.sin(angle))
+      result = FastFourier.dft(inputs[i])
+      expected_result = (0...(inputs[i].length)).map do |j|
+        (0...(inputs[i].length)).map {|k| inputs[i][k] * npr ** (-1*j*k)}.inject(:+)
+      end
+
+      describe "for input of length #{inputs[i].length}" do 
+
+        specify "the result should also be of length #{inputs[i].length}" do
+          expect(result.length).to be == inputs[i].length
+        end
+
+        (0...(result.length)).each do |j|
+          specify "index #{j} should match the DFT definition" do
+            expect(result[j]).to be_within(EPSILON).of(expected_result[j])
+          end
+        end
+
+        describe "the result should be invertable." do
+          inv = FastFourier.dft(result, true)
+          #puts "#{inversion} <=> #{inputs[i]}"
+
+          (0...(result.length)).each do |j|
+            specify "result index #{j} did not match input" do
+              expect(inv[j]).to be_within(EPSILON).of(inputs[i][j])
+            end
+          end
+
+          inv_c = FastFourier.dft(result, :conjugate)
+          #puts "#{inv_c} <=> #{inputs[i]}"
+
+          (0...(result.length)).each do |j|
+            specify "conjugate result index #{j} did not match input" do
+              expect(inv_c[j]).to be_within(EPSILON).of(inputs[i][j])
+            end
+          end
+
+          inv_s = FastFourier.dft(result, :swap)
+          #puts "#{inv_s} <=> #{inputs[i]}"
+
+          (0...(result.length)).each do |j|
+            specify "swap result index #{j} did not match input" do
+              expect(inv_s[j]).to be_within(EPSILON).of(inputs[i][j])
+            end
+          end
+        end
+      end
+    end
+  end
+
+  describe "discrete_involutary" do
+
+    (0...inputs.length).each do |i|
+      result = FastFourier.discrete_involutary(inputs[i])
+      describe "for input of length #{inputs[i].length}" do 
+        specify "the result should also be of length #{inputs[i].length}" do
+          expect(result.length).to be == inputs[i].length
+        end
+        describe "the result should be invertable." do
+          inv = FastFourier.discrete_involutary(result)
+          (0...(result.length)).each do |j|
+            specify "conjugate result index #{j} did not match input" do
+              expect(inv[j]).to be_within(EPSILON).of(inputs[i][j])
+            end
+          end
+        end
+      end
+    end
+  end
+
+end

metadata

@@ -0,0 +1,109 @@
+--- !ruby/object:Gem::Specification
+name: fast-fourier
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- Justin W Smith
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2014-06-01 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.3'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.3'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+description: An implementation of the Cooley-Tukey algorithm for the Discrete Fourier
+  Transform
+email:
+- justin.w.smith@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".idea/.name"
+- ".idea/.rakeTasks"
+- ".idea/compiler.xml"
+- ".idea/copyright/profiles_settings.xml"
+- ".idea/encodings.xml"
+- ".idea/misc.xml"
+- ".idea/modules.xml"
+- ".idea/scopes/scope_settings.xml"
+- ".idea/vcs.xml"
+- FastFourier.iml
+- Gemfile
+- LICENSE
+- LICENSE.txt
+- README.md
+- Rakefile
+- fast-fourier.gemspec
+- lib/fast-fourier/fast-fourier.rb
+- lib/fast-fourier/version.rb
+- spec/fast-fourier_spec.rb
+homepage: https://github.com/justinwsmith/FastFourier
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.2.2
+signing_key: 
+specification_version: 4
+summary: An implementation of the Cooley-Tukey algorithm for the Discrete Fourier
+  Transform
+test_files:
+- spec/fast-fourier_spec.rb