annotate src/samer/maths/ClippedDivide.java @ 8:5e3cbbf173aa tip

Reorganise some more
author samer
date Fri, 05 Apr 2019 22:41:58 +0100
parents bf79fb79ee13
children
rev   line source
samer@0 1 /*
samer@0 2 * Copyright (c) 2000, Samer Abdallah, King's College London.
samer@0 3 * All rights reserved.
samer@0 4 *
samer@0 5 * This software is provided AS iS and WITHOUT ANY WARRANTY;
samer@0 6 * without even the implied warranty of MERCHANTABILITY or
samer@0 7 * FITNESS FOR A PARTICULAR PURPOSE.
samer@0 8 */
samer@0 9
samer@0 10 package samer.maths;
samer@0 11 import samer.core.*;
samer@0 12 import samer.tools.*;
samer@0 13
samer@0 14 public class ClippedDivide extends AnonymousTask
samer@0 15 {
samer@0 16 VVector out;
samer@0 17 double [] _top, _bot, _F;
samer@0 18 int l;
samer@0 19
samer@0 20 public ClippedDivide(VVector num, VVector denom) throws Exception
samer@0 21 {
samer@0 22 l = num.size(); // length of input
samer@0 23 out = new VVector("F",l); // output
samer@0 24
samer@0 25 // add task to compute the desired frequency response
samer@0 26 _top = num.array();
samer@0 27 _bot = denom.array();
samer@0 28 _F = out.array();
samer@0 29 }
samer@0 30
samer@0 31 public VVector output() { return out; }
samer@0 32
samer@0 33 public void run() {
samer@0 34 for (int i=0; i<l; i++) {
samer@0 35 _F[i] = (_top[i]<_bot[i]) ? _top[i]/_bot[i] : 1;
samer@0 36 // Weiner filter version would be
samer@0 37 // t1=z[i]*z[i]; t2=x[i]-z[i];
samer@0 38 // _F[i]=t1/(t1 + t2*t2); ??
samer@0 39 }
samer@0 40 out.changed();
samer@0 41 }
samer@0 42 }
samer@0 43