Chris@10: (*
Chris@10:  * Copyright (c) 1997-1999 Massachusetts Institute of Technology
Chris@10:  * Copyright (c) 2003, 2007-11 Matteo Frigo
Chris@10:  * Copyright (c) 2003, 2007-11 Massachusetts Institute of Technology
Chris@10:  *
Chris@10:  * This program is free software; you can redistribute it and/or modify
Chris@10:  * it under the terms of the GNU General Public License as published by
Chris@10:  * the Free Software Foundation; either version 2 of the License, or
Chris@10:  * (at your option) any later version.
Chris@10:  *
Chris@10:  * This program is distributed in the hope that it will be useful,
Chris@10:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@10:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
Chris@10:  * GNU General Public License for more details.
Chris@10:  *
Chris@10:  * You should have received a copy of the GNU General Public License
Chris@10:  * along with this program; if not, write to the Free Software
Chris@10:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
Chris@10:  *
Chris@10: *)
Chris@10: 
Chris@10: open Complex
Chris@10: open Util
Chris@10: 
Chris@10: let polyphase m a ph i = a (m * i + ph)
Chris@10: 
Chris@10: let rec divmod n i =
Chris@10:   if (i < 0) then 
Chris@10:     let (a, b) = divmod n (i + n)
Chris@10:     in (a - 1, b)
Chris@10:   else (i / n, i mod n)
Chris@10: 
Chris@10: let unpolyphase m a i = let (x, y) = divmod m i in a y x
Chris@10: 
Chris@10: let lift2 f a b i = f (a i) (b i)
Chris@10: 
Chris@10: (* convolution of signals A and B *)
Chris@10: let rec conv na a nb b =
Chris@10:   let rec naive na a nb b i =
Chris@10:     sigma 0 na (fun j -> (a j) @* (b (i - j)))
Chris@10: 
Chris@10:   and recur na a nb b =
Chris@10:     if (na <= 1 || nb <= 1) then
Chris@10:       naive na a nb b
Chris@10:     else
Chris@10:       let p = polyphase 2 in
Chris@10:       let ee = conv (na - na / 2) (p a 0) (nb - nb / 2) (p b 0)
Chris@10:       and eo = conv (na - na / 2) (p a 0) (nb / 2) (p b 1)
Chris@10:       and oe = conv (na / 2) (p a 1) (nb - nb / 2) (p b 0)
Chris@10:       and oo = conv (na / 2) (p a 1) (nb / 2) (p b 1) in
Chris@10:       unpolyphase 2 (function
Chris@10: 	  0 -> fun i -> (ee i) @+ (oo (i - 1))
Chris@10: 	| 1 -> fun i -> (eo i) @+ (oe i) 
Chris@10: 	| _ -> failwith "recur")
Chris@10: 
Chris@10: 
Chris@10:   (* Karatsuba variant 1: (a+bx)(c+dx) = (ac+bdxx)+((a+b)(c+d)-ac-bd)x *)
Chris@10:   and karatsuba1 na a nb b =
Chris@10:       let p = polyphase 2 in
Chris@10:       let ae = p a 0 and nae = na - na / 2
Chris@10:       and ao = p a 1 and nao = na / 2
Chris@10:       and be = p b 0 and nbe = nb - nb / 2
Chris@10:       and bo = p b 1 and nbo = nb / 2 in
Chris@10:       let ae = infinite nae ae and ao = infinite nao ao
Chris@10:       and be = infinite nbe be and bo = infinite nbo bo in
Chris@10:       let aeo = lift2 (@+) ae ao and naeo = nae
Chris@10:       and beo = lift2 (@+) be bo and nbeo = nbe in
Chris@10:       let ee = conv nae ae nbe be 
Chris@10:       and oo = conv nao ao nbo bo
Chris@10:       and eoeo = conv naeo aeo nbeo beo in
Chris@10: 
Chris@10:       let q = function
Chris@10: 	  0 -> fun i -> (ee i)  @+ (oo (i - 1))
Chris@10: 	| 1 -> fun i -> (eoeo i) @- ((ee i) @+ (oo i))
Chris@10: 	| _ -> failwith "karatsuba1" in
Chris@10:       unpolyphase 2 q
Chris@10: 
Chris@10:   (* Karatsuba variant 2: 
Chris@10:      (a+bx)(c+dx) = ((a+b)c-b(c-dxx))+x((a+b)c-a(c-d)) *)
Chris@10:   and karatsuba2 na a nb b =
Chris@10:       let p = polyphase 2 in
Chris@10:       let ae = p a 0 and nae = na - na / 2
Chris@10:       and ao = p a 1 and nao = na / 2
Chris@10:       and be = p b 0 and nbe = nb - nb / 2
Chris@10:       and bo = p b 1 and nbo = nb / 2 in
Chris@10:       let ae = infinite nae ae and ao = infinite nao ao
Chris@10:       and be = infinite nbe be and bo = infinite nbo bo in
Chris@10: 
Chris@10:       let c1 = conv nae (lift2 (@+) ae ao) nbe be
Chris@10:       and c2 = conv nao ao (nbo + 1) (fun i -> be i @- bo (i - 1))
Chris@10:       and c3 = conv nae ae nbe (lift2 (@-) be bo) in
Chris@10: 
Chris@10:       let q = function
Chris@10: 	  0 -> lift2 (@-) c1 c2
Chris@10: 	| 1 -> lift2 (@-) c1 c3
Chris@10: 	| _ -> failwith "karatsuba2" in
Chris@10:       unpolyphase 2 q
Chris@10: 
Chris@10:   and karatsuba na a nb b =
Chris@10:     let m = na + nb - 1 in
Chris@10:     if (m < !Magic.karatsuba_min) then
Chris@10:       recur na a nb b
Chris@10:     else
Chris@10:       match !Magic.karatsuba_variant with
Chris@10: 	1 -> karatsuba1 na a nb b
Chris@10:       |	2 -> karatsuba2 na a nb b
Chris@10:       |	_ -> failwith "unknown karatsuba variant"
Chris@10: 
Chris@10:   and via_circular na a nb b =
Chris@10:     let m = na + nb - 1 in
Chris@10:     if (m < !Magic.circular_min) then
Chris@10:       karatsuba na a nb b
Chris@10:     else
Chris@10:       let rec find_min n = if n >= m then n else find_min (2 * n) in
Chris@10:       circular (find_min 1) a b
Chris@10: 
Chris@10:   in
Chris@10:   let a = infinite na a and b = infinite nb b in
Chris@10:   let res = array (na + nb - 1) (via_circular na a nb b) in
Chris@10:   infinite (na + nb - 1) res
Chris@10:     
Chris@10: and circular n a b =
Chris@10:   let via_dft n a b =
Chris@10:     let fa = Fft.dft (-1) n a 
Chris@10:     and fb = Fft.dft (-1) n b
Chris@10:     and scale = inverse_int n in
Chris@10:     let fab i = ((fa i) @* (fb i)) @* scale in
Chris@10:     Fft.dft 1 n fab
Chris@10: 
Chris@10:   in via_dft n a b