// // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // // Copyright (c) 2009-2014 Math.NET // // 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. // using System; using IStation.Numerics.Threading; namespace IStation.Numerics.IntegralTransforms { /// /// Fast (FHT) Implementation of the Discrete Hartley Transform (DHT). /// public static partial class Hartley { /// /// Naive generic DHT, useful e.g. to verify faster algorithms. /// /// Time-space sample vector. /// Corresponding frequency-space vector. internal static double[] Naive(double[] samples) { var w0 = Constants.Pi2/samples.Length; var spectrum = new double[samples.Length]; CommonParallel.For(0, samples.Length, (u, v) => { for (int i = u; i < v; i++) { var wk = w0*i; var sum = 0.0; for (var n = 0; n < samples.Length; n++) { var w = n*wk; sum += samples[n]*Constants.Sqrt2*Math.Cos(w - Constants.PiOver4); } spectrum[i] = sum; } }); return spectrum; } } }