Pd-cvs March 2006

pd-cvs@lists.iem.at

16 participants
280 discussions

externals/iem/iem_ambi/help help-ambi_decode.pd, NONE, 1.1 help-ambi_decode2.pd, NONE, 1.1 help-ambi_decode3.pd, NONE, 1.1 help-ambi_encode.pd, NONE, 1.1 help-ambi_rot.pd, NONE, 1.1 test-ambi_rot.pd, NONE, 1.1
by musil 09 Mar '06

09 Mar '06

Update of /cvsroot/pure-data/externals/iem/iem_ambi/help In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv19911/iem/iem_ambi/help Added Files: help-ambi_decode.pd help-ambi_decode2.pd help-ambi_decode3.pd help-ambi_encode.pd help-ambi_rot.pd test-ambi_rot.pd Log Message: initial version JAN_06 with all sources --- NEW FILE: help-ambi_decode3.pd --- #N canvas 4 4 856 655 10; #X obj 60 572 print; #X text 513 156 1.arg: <float> ambisonic order; #X obj 60 549 round_zero 1e-006; #X text 348 312 ambisonic-order = n_ao; #X text 536 387 ambisonic-order-group; #X text 324 428 -90 <= delta <= +90; #X text 324 440 -180 <= phi <= +180; #X text 265 387 input: <ambi_weight> one mul-factor for each; #X text 21 12 ambi_decode; #X text 105 12 calculates a decoder-matrix; #X obj 38 33 bng 35 250 50 0 empty empty empty 0 -6 0 8 -24198 -42246 -1; #X text 265 336 input: <ls> index + phi [degree] .. 2-dimensional; #X text 265 346 input: <ls> index + delta + phi [degree] .. 3-dimensional ; #X text 265 360 input: <phls> index + phi [degree .. 2-dimensional ; #X text 265 371 input: <phls> index + delta + phi [degree] .. 3-dimensional ; #X text 289 518 <float> n_col = (2*n_ao+1) = number of ambisonic-channels ; #X text 277 527 + <float> n_row = (n_ls) = number of loudspeakers; #X text 517 313 number of loudspeakers = n_ls; #X text 280 587 + <float> n_row = (n_ls) = number of loudspeakers; #X text 265 568 output in case of 3d: <matrix> ((n_ao+1)*(n_ao+1)*n_ls+2) ; #X text 263 507 output in case of 2d: <matrix> ((2*n_ao+1)*n_ls+2) ; #X text 610 568 <float> :; #X text 567 506 <float> :; #X text 507 578 number of ambisonic-channels; #X text 292 578 <float> n_col = (n_ao+1)*(n_ao+1) =; #X text 478 597 <float> elements of a matrix; #X text 280 597 + (n_ao + 1) * (n_ao + 1) * n_ls; #X text 277 537 + (2*n_ao + 1) * n_ls <float> elements of a matrix ; #X text 258 460 input: <pinv> calculates the pseudo-inverse of the encoded; #X text 314 471 loudspeaker-positions (+ the phantom-speakers); #X text 328 482 and output a matrix-message; #X text 339 417 1 <= index <= n_ao; #X text 603 268 a regular matrix to inverse it); #X text 426 399 to suppress the side-lobe-phenomena; #X text 526 258 (it is sometimes necessary to add phantom-ls. for achieving ; #X msg 272 130 ambi_weight 1 1 1 0.3904; #X msg 123 129 ambi_weight 1 1 1 1; #X msg 138 106 mirror_weight 0.7; #X obj 94 237 pp pht_ls; #X obj 38 77 t b b b b b b b; #X text 528 174 (1 .. 5 in case of 3 dimensional); #X text 528 165 (1 .. 12 in case of 2 dimensional); #X text 514 196 3.arg: <float> number of independent loudspeakers; #X text 513 184 2.arg: <float> dimension (2 or 3); #X text 513 247 5.arg: <float> number of canceled phantom_loudspeakers ; #X text 514 208 4.arg: <float> number of merged and mirrored loudspeakers ; #X text 560 221 (the merged loudspeakers are at the border of the arc ; #X text 573 233 or the hemisphere \, the mirrored loudspeakers are ; #X obj 742 385 pp ind_ls; #X msg 742 362 1 90 0 \, 2 45 45 \, 3 45 135 \, 4 45 225 \, 5 45 315 ; #X obj 728 450 pp mrg_ls; #X msg 728 415 1 0 0 \, 2 0 45 \, 3 0 90 \, 4 0 135 \, 5 0 180 \, 6 0 225 \, 7 0 270 \, 8 0 315; #X obj 714 507 pp mir_ls; #X msg 714 472 1 -45 0 \, 2 -45 45 \, 3 -45 90 \, 4 -45 135 \, 5 -45 180 \, 6 -45 225 \, 7 -45 270 \, 8 -45 315; #X obj 700 553 pp pht_ls; #X msg 700 530 1 -90 0; #X msg 108 155 1 90 0 \, 2 45 45 \, 3 45 135 \, 4 45 225 \, 5 45 315 \, 6 0 0 \, 7 0 45 \, 8 0 90 \, 9 0 135 \, 10 0 180 \, 11 0 225 \, 12 0 270 \, 13 0 315; #X obj 108 190 pp real_ls; #X msg 80 263 begin_pseudo_inverse; #X obj 60 527 ambi_decode3 3 3 13 6; #X msg 30 501 end_pseudo_inverse; #X msg 94 215 1 -45 0 \, 2 -45 90 \, 3 -45 180 \, 4 -45 270 \, 6 -90 0; #X msg 47 476 ipht_ireal_muladd \$1 \$2 \$3; #N canvas 337 146 559 509 /SUBPATCH/ 0; #X msg 142 186 1 6 \$1; #X obj 102 58 inlet; #X obj 101 441 outlet; #X obj 162 59 inlet; #X obj 71 135 f; #X obj 103 135 f; #X obj 157 106 * 0.25; #X obj 214 106 * 0.5; #X msg 163 211 2 8 \$1; #X msg 40 187 1 13 \$1 \, 1 7 \$1; #X msg 61 212 2 7 \$1 \, 2 9 \$1; #X msg 179 241 3 10 \$1; #X msg 77 242 3 9 \$1 \, 3 11 \$1; #X msg 199 271 4 12 \$1; #X msg 87 271 4 11 \$1 \, 4 13 \$1; #X obj 162 81 route mirror_weight; #X connect 0 0 2 0; #X connect 1 0 4 0; #X connect 1 0 5 0; #X connect 3 0 15 0; #X connect 4 0 9 0; #X connect 4 0 10 0; #X connect 4 0 12 0; #X connect 4 0 14 0; #X connect 5 0 0 0; #X connect 5 0 8 0; #X connect 5 0 11 0; #X connect 5 0 13 0; #X connect 6 0 4 1; #X connect 7 0 5 1; #X connect 8 0 2 0; #X connect 9 0 2 0; #X connect 10 0 2 0; #X connect 11 0 2 0; #X connect 12 0 2 0; #X connect 13 0 2 0; #X connect 14 0 2 0; #X connect 15 0 7 0; #X connect 15 0 6 0; #X restore 47 436 pd; #X connect 2 0 0 0; #X connect 10 0 39 0; #X connect 35 0 59 0; #X connect 36 0 59 0; #X connect 37 0 63 1; #X connect 38 0 59 0; #X connect 39 0 60 0; #X connect 39 1 63 0; #X connect 39 2 58 0; #X connect 39 3 61 0; #X connect 39 4 56 0; #X connect 39 5 36 0; #X connect 39 6 37 0; #X connect 49 0 48 0; #X connect 51 0 50 0; #X connect 53 0 52 0; #X connect 55 0 54 0; #X connect 56 0 57 0; #X connect 57 0 59 0; #X connect 58 0 59 0; #X connect 59 0 2 0; #X connect 60 0 59 0; #X connect 61 0 38 0; #X connect 62 0 59 0; #X connect 63 0 62 0; --- NEW FILE: help-ambi_rot.pd --- #N canvas 44 25 730 500 10; #X text 230 40 phi ... azimut \, positiv direction from nose to left ear; #X text 228 18 delta ... elevation \, positiv direction from nose to top of the head; #X floatatom 52 76 6 -180 180 0 - - -; #X obj 29 76 bng 15 250 50 0 empty empty empty 0 -6 0 8 -262144 -1 -1; #X floatatom 128 76 6 -180 180 0 - - -; #X text 129 59 rho_y; #X text 54 59 rho_z; #X floatatom 195 76 6 -180 180 0 - - -; #X text 197 59 rho_x; #X obj 127 149 pack 0 0 0; #X obj 195 120 t b f; #X obj 128 120 t b f; #X obj 52 93 deg2rad; #X obj 128 94 deg2rad; #X obj 195 95 deg2rad; #X text 241 6 AMBISONIC Encoder 4.Order 3-Dimensional; #X text 254 73 umkehrung der matrizen multiplikation: funktioniert nicht; #X obj 63 393 print r1; #X obj 174 390 print r2; #X obj 292 389 print r3; #X obj 407 387 print r4; #X obj 63 342 mtx_mul; #X obj 389 275 pack 0 0 0; #X obj 389 214 unpack 0 0 0; #X obj 389 237 * -1; #X obj 126 172 t l l; #X obj 174 341 mtx_mul; #X obj 292 339 mtx_mul; #X obj 407 338 mtx_mul; #X obj 422 238 * -1; #X obj 455 237 * -1; #X obj 389 300 ambi_rot 4; #X obj 63 244 ambi_rot 4; #X text 10 8 ambi_rot; #X obj 407 362 round_zero 0.0001; #X obj 292 365 round_zero 0.0001; #X obj 174 364 round_zero 0.0001; #X obj 63 365 round_zero 0.0001; #X connect 2 0 12 0; #X connect 3 0 2 0; #X connect 4 0 13 0; #X connect 7 0 14 0; #X connect 9 0 25 0; #X connect 10 0 9 0; #X connect 10 1 9 2; #X connect 11 0 9 0; #X connect 11 1 9 1; #X connect 12 0 9 0; #X connect 13 0 11 0; #X connect 14 0 10 0; #X connect 21 0 37 0; #X connect 22 0 31 0; #X connect 23 0 24 0; #X connect 23 1 29 0; #X connect 23 2 30 0; #X connect 24 0 22 0; #X connect 25 0 32 0; #X connect 25 1 23 0; #X connect 26 0 36 0; #X connect 27 0 35 0; #X connect 28 0 34 0; #X connect 29 0 22 1; #X connect 30 0 22 2; #X connect 31 0 21 1; #X connect 31 1 26 1; #X connect 31 2 27 1; #X connect 31 3 28 1; #X connect 32 0 21 0; #X connect 32 1 26 0; #X connect 32 2 27 0; #X connect 32 3 28 0; #X connect 34 0 20 0; #X connect 35 0 19 0; #X connect 36 0 18 0; #X connect 37 0 17 0; --- NEW FILE: test-ambi_rot.pd --- #N canvas 44 25 726 496 10; #X text 230 40 phi ... azimut \, positiv direction from nose to left ear; #X text 228 18 delta ... elevation \, positiv direction from nose to top of the head; #X floatatom 52 76 6 -180 180 0 - - -; #X obj 29 76 bng 15 250 50 0 empty empty empty 0 -6 0 8 -262144 -1 -1; #X floatatom 128 76 6 -180 180 0 - - -; #X text 129 59 rho_y; #X text 54 59 rho_z; #X floatatom 195 76 6 -180 180 0 - - -; #X text 197 59 rho_x; #X obj 127 149 pack 0 0 0; #X obj 195 120 t b f; #X obj 128 120 t b f; #X obj 52 93 deg2rad; #X obj 128 94 deg2rad; #X obj 195 95 deg2rad; #X text 241 6 AMBISONIC Encoder 4.Order 3-Dimensional; #X text 254 73 umkehrung der matrizen multiplikation: funktioniert nicht; #X obj 63 393 print r1; #X obj 174 390 print r2; #X obj 292 389 print r3; #X obj 407 387 print r4; #X text 10 8 test-ambi_rot.pd; #X obj 63 342 mtx_mul; #X obj 389 275 pack 0 0 0; #X obj 389 214 unpack 0 0 0; #X obj 389 237 * -1; #X obj 126 172 t l l; #X obj 174 341 mtx_mul; #X obj 292 339 mtx_mul; #X obj 407 338 mtx_mul; #X obj 422 238 * -1; #X obj 455 237 * -1; #X obj 389 300 ambi_rot 4; #X obj 63 244 ambi_rot 4; #X obj 63 365 round_zero 1e-007; #X obj 174 364 round_zero 1e-007; #X obj 292 365 round_zero 1e-007; #X obj 407 362 round_zero 1e-007; #X connect 2 0 12 0; #X connect 3 0 2 0; #X connect 4 0 13 0; #X connect 7 0 14 0; #X connect 9 0 26 0; #X connect 10 0 9 0; #X connect 10 1 9 2; #X connect 11 0 9 0; #X connect 11 1 9 1; #X connect 12 0 9 0; #X connect 13 0 11 0; #X connect 14 0 10 0; #X connect 22 0 34 0; #X connect 23 0 32 0; #X connect 24 0 25 0; #X connect 24 1 30 0; #X connect 24 2 31 0; #X connect 25 0 23 0; #X connect 26 0 33 0; #X connect 26 1 24 0; #X connect 27 0 35 0; #X connect 28 0 36 0; #X connect 29 0 37 0; #X connect 30 0 23 1; #X connect 31 0 23 2; #X connect 32 0 22 1; #X connect 32 1 27 1; #X connect 32 2 28 1; #X connect 32 3 29 1; #X connect 33 0 22 0; #X connect 33 1 27 0; #X connect 33 2 28 0; #X connect 33 3 29 0; #X connect 34 0 17 0; #X connect 35 0 18 0; #X connect 36 0 19 0; #X connect 37 0 20 0; --- NEW FILE: help-ambi_decode.pd --- #N canvas 117 18 719 674 10; #X obj 47 249 print; #X text 291 171 1.arg: <float> ambisonic order; #X text 306 180 (1 .. 12 for 2 dimensional use); #X obj 47 226 round_zero 1e-006; #X text 117 310 ambisonic-order = n_ao; #X msg 150 170 ambi_weight 1 1 1; #X msg 133 149 ambi_weight 1 1 0.3904; #X text 305 385 ambisonic-order-group; #X text 98 416 -90 <= delta <= +90; #X text 98 428 -180 <= phi <= +180; #X text 34 385 input: <ambi_weight> one mul-factor for each; #X text 21 12 ambi_decode; #X text 105 12 calculates a decoder-matrix; #X obj 47 204 ambi_decode 2 2 5 0; #X text 291 199 2.arg: <float> dimension; #X text 440 199 (2 or 3); #X text 291 211 3.arg: <float> number of real loudspeakers; #X text 305 222 (best results \, if n_ls = n_ambi_channels); #X text 316 232 (could be more or less); #X text 292 243 4.arg: <float> number of phantom_loudspeakers; #X text 334 254 (optional \, default 0); #X msg 46 116 pinv; #X obj 59 90 t b b; #X obj 59 46 bng 35 250 50 0 empty empty empty 0 -6 0 8 -24198 -42246 -1; #X text 34 334 input: <ls> index + phi [degree] .. 2-dimensional; #X text 34 344 input: <ls> index + delta + phi [degree] .. 3-dimensional ; #X text 34 358 input: <phls> index + phi [degree .. 2-dimensional; #X text 34 369 input: <phls> index + delta + phi [degree] .. 3-dimensional ; #X text 63 525 <float> n_col = (2*n_ao+1) = number of ambisonic-channels ; #X text 51 534 + <float> n_row = (n_ls) = number of loudspeakers; #X text 286 311 number of loudspeakers = n_ls; #X text 51 594 + <float> n_row = (n_ls) = number of loudspeakers; #X text 36 575 output in case of 3d: <matrix> ((n_ao+1)*(n_ao+1)*n_ls+2) ; #X text 37 514 output in case of 2d: <matrix> ((2*n_ao+1)*n_ls+2); #X text 384 575 <float> :; #X text 341 513 <float> :; #X text 281 585 number of ambisonic-channels; #X text 63 585 <float> n_col = (n_ao+1)*(n_ao+1) =; #X text 252 604 <float> elements of a matrix; #X text 51 604 + (n_ao + 1) * (n_ao + 1) * n_ls; #X text 51 544 + (2*n_ao + 1) * n_ls <float> elements of a matrix; #X text 34 458 input: <pinv> calculates the pseudo-inverse of the encoded ; #X text 90 469 loudspeaker-positions (+ the phantom-speakers); #X text 104 480 and output a matrix-message; #X text 306 189 (1 .. 5 for 3 dimensional use); #X msg 95 116 ls 1 0 \, ls 2 72 \, ls 3 144 \, ls 4 216 \, ls 5 288 ; #X text 113 405 1 <= index <= n_ao; #X text 340 275 a regular matrix to inverse it); #X text 437 384 to suppress the side-lobe-phenomena; #X text 308 265 (it is sometimes necessary to add phantom-ls. for achieving ; #N canvas 0 0 812 677 phantom_example 0; #X obj 57 631 print; #X obj 57 608 round_zero 1e-006; #X msg 57 94 pinv; #X obj 70 24 bng 35 250 50 0 empty empty empty 0 -6 0 8 -24198 -42246 -1; #X msg 198 72 ls 1 5 \, ls 2 2.5 \, ls 3 0 \, ls 4 -2.5 \, ls 5 -5 ; #X msg 92 176 phls 5 -17.5 \, phls 6 -20 \, phls 7 -22.5 \, phls 8 -25; #X msg 92 200 phls 9 -27.5 \, phls 10 -30 \, phls 11 -32.5 \, phls 12 -35; #X msg 92 223 phls 13 -37.5 \, phls 14 -40 \, phls 15 -42.5 \, phls 16 -45; #X msg 92 247 phls 17 -47.5 \, phls 18 -50 \, phls 19 -52.5 \, phls 20 -55; #X msg 92 270 phls 21 -57.5 \, phls 22 -60 \, phls 23 -62.5 \, phls 24 -65; #X msg 92 294 phls 25 -67.5 \, phls 26 -70 \, phls 27 -72.5 \, phls 28 -75; #X msg 92 317 phls 29 -77.5 \, phls 30 -80 \, phls 31 -82.5 \, phls 32 -85; #X msg 92 340 phls 33 -87.5 \, phls 34 -90 \, phls 35 -92.5 \, phls 36 -95; #X msg 92 364 phls 37 -97.5 \, phls 38 -100 \, phls 39 -102.5 \, phls 40 -105; #X msg 92 387 phls 41 -107.5 \, phls 42 -110 \, phls 43 -112.5 \, phls 44 -115; #X msg 92 411 phls 45 -117.5 \, phls 46 -120 \, phls 47 -122.5 \, phls 48 -125; #X msg 92 434 phls 49 -127.5 \, phls 50 -130 \, phls 51 -132.5 \, phls 52 -135; #X msg 92 456 phls 53 -137.5 \, phls 54 -140 \, phls 55 -142.5 \, phls 56 -145; #X msg 92 480 phls 57 -147.5 \, phls 58 -150 \, phls 59 -152.5 \, phls 60 -155; #X msg 92 503 phls 61 -157.5 \, phls 62 -160 \, phls 63 -162.5 \, phls 64 -165; #X msg 92 527 phls 65 -167.5 \, phls 66 -170 \, phls 67 -172.5 \, phls 68 -175; #X msg 92 550 phls 69 -177.5 \, phls 70 -180 \, phls 71 177.5 \, phls 72 175; #X msg 497 228 phls 73 172.5 \, phls 74 170 \, phls 75 167.5 \, phls 76 165; #X msg 497 249 phls 77 162.5 \, phls 78 160 \, phls 79 157.5 \, phls 80 155; #X msg 497 270 phls 81 152.5 \, phls 82 150 \, phls 83 147.5 \, phls 84 145; #X msg 497 290 phls 85 142.5 \, phls 86 140 \, phls 87 137.5 \, phls 88 135; #X msg 497 312 phls 89 132.5 \, phls 90 130 \, phls 91 127.5 \, phls 92 125; #X msg 497 333 phls 93 122.5 \, phls 94 120 \, phls 95 117.5 \, phls 96 115; #X msg 497 354 phls 97 112.5 \, phls 98 110 \, phls 99 107.5 \, phls 100 105; #X msg 497 375 phls 101 102.5 \, phls 102 100 \, phls 103 97.5 \, phls 104 95; #X msg 497 396 phls 105 92.5 \, phls 106 90 \, phls 107 87.5 \, phls 108 85; #X msg 497 418 phls 109 82.5 \, phls 110 80 \, phls 111 77.5 \, phls 112 75; #X msg 497 439 phls 113 72.5 \, phls 114 70 \, phls 115 67.5 \, phls 116 65; #X msg 497 460 phls 117 62.5 \, phls 118 60 \, phls 119 57.5 \, phls 120 55; #X msg 497 481 phls 121 52.5 \, phls 122 50 \, phls 123 47.5 \, phls 124 45; #X msg 497 502 phls 125 42.5 \, phls 126 40 \, phls 127 37.5 \, phls 128 35; #X msg 497 524 phls 129 32.5 \, phls 130 30 \, phls 131 27.5 \, phls 132 25; #X msg 497 545 phls 133 22.5 \, phls 134 20 \, phls 135 17.5 \, phls 136 15; #X msg 497 566 phls 137 12.5 \, phls 138 10 \, phls 139 7.5; #X obj 70 68 t b b b b; #X obj 92 127 t b; #X obj 497 206 t b; #X obj 57 586 ambi_decode 2 2 5 139; #X msg 92 152 phls 1 -7.5 \, phls 2 -10 \, phls 3 -12.5 \, phls 4 -15 ; #X connect 1 0 0 0; #X connect 2 0 42 0; #X connect 3 0 39 0; #X connect 4 0 42 0; #X connect 5 0 42 0; #X connect 6 0 42 0; #X connect 7 0 42 0; #X connect 8 0 42 0; #X connect 9 0 42 0; #X connect 10 0 42 0; #X connect 11 0 42 0; #X connect 12 0 42 0; #X connect 13 0 42 0; #X connect 14 0 42 0; #X connect 15 0 42 0; #X connect 16 0 42 0; #X connect 17 0 42 0; #X connect 18 0 42 0; #X connect 19 0 42 0; #X connect 20 0 42 0; #X connect 21 0 42 0; #X connect 22 0 42 0; #X connect 23 0 42 0; #X connect 24 0 42 0; #X connect 25 0 42 0; #X connect 26 0 42 0; #X connect 27 0 42 0; #X connect 28 0 42 0; #X connect 29 0 42 0; #X connect 30 0 42 0; #X connect 31 0 42 0; #X connect 32 0 42 0; #X connect 33 0 42 0; #X connect 34 0 42 0; #X connect 35 0 42 0; #X connect 36 0 42 0; #X connect 37 0 42 0; #X connect 38 0 42 0; #X connect 39 0 2 0; #X connect 39 1 41 0; #X connect 39 2 40 0; #X connect 39 3 4 0; #X connect 40 0 43 0; #X connect 40 0 5 0; #X connect 40 0 6 0; #X connect 40 0 7 0; #X connect 40 0 8 0; #X connect 40 0 9 0; #X connect 40 0 10 0; #X connect 40 0 11 0; #X connect 40 0 12 0; #X connect 40 0 13 0; #X connect 40 0 14 0; #X connect 40 0 15 0; #X connect 40 0 16 0; #X connect 40 0 17 0; #X connect 40 0 18 0; #X connect 40 0 19 0; #X connect 40 0 20 0; #X connect 40 0 21 0; #X connect 41 0 22 0; #X connect 41 0 23 0; #X connect 41 0 24 0; #X connect 41 0 25 0; #X connect 41 0 26 0; #X connect 41 0 27 0; #X connect 41 0 28 0; #X connect 41 0 29 0; #X connect 41 0 30 0; #X connect 41 0 31 0; #X connect 41 0 32 0; #X connect 41 0 33 0; #X connect 41 0 34 0; #X connect 41 0 35 0; #X connect 41 0 36 0; #X connect 41 0 37 0; #X connect 41 0 38 0; #X connect 42 0 1 0; #X connect 43 0 42 0; #X restore 421 117 pd phantom_example regular; #N canvas 0 0 814 679 real_example 0; #X obj 58 293 print; #X obj 58 270 round_zero 1e-006; #X msg 57 94 pinv; #X obj 70 24 bng 35 250 50 0 empty empty empty 0 -6 0 8 -24198 -42246 -1; #X msg 103 115 ls 1 5 \, ls 2 2.5 \, ls 3 0 \, ls 4 -2.5 \, ls 5 -5 ; #X obj 70 68 t b b; #X obj 58 248 ambi_decode 2 2 5 0; #X connect 1 0 0 0; #X connect 2 0 6 0; #X connect 3 0 5 0; #X connect 4 0 6 0; #X connect 5 0 2 0; #X connect 5 1 4 0; #X connect 6 0 1 0; #X restore 421 90 pd real_example singular; #X connect 3 0 0 0; #X connect 5 0 13 0; #X connect 6 0 13 0; #X connect 13 0 3 0; #X connect 21 0 13 0; #X connect 22 0 21 0; #X connect 22 1 45 0; #X connect 23 0 22 0; #X connect 45 0 13 0; --- NEW FILE: help-ambi_encode.pd --- #N canvas 61 48 860 672 10; #X obj 374 243 ambi_encode 2; #X obj 374 288 print; #X text 478 247 1.arg: <float> ambisonic order; #X text 489 259 (1 .. 12 for 2 dimensional use); #X msg 461 178 col 2 \$1; #X msg 425 97 row 1 \$1; #X msg 288 211 col 3 \$1 \$2; #X obj 288 188 pack 0 0; #X obj 306 166 t b f; #X obj 374 265 round_zero 1e-006; #X obj 184 193 pack 0 0; #X obj 202 171 t b f; #X floatatom 100 161 5 -180 180 0 - - -; #X floatatom 51 162 5 -90 90 0 - - -; #X obj 82 222 pack 0 0; #X obj 100 200 t b f; #X text 48 143 delta; #X text 102 142 phi; #X text 21 12 ambi_encode; #X text 34 291 ambisonic-order = n_ao; #X text 346 320 -> output: <list> of (2*n_ao+1) <float>; #X text 346 331 -> output: <list> of (n_ao+1)*(n_ao+1) <float>; #X text 387 356 -> output: <row> + index + (2*n_ao+1) <float>; #X text 387 368 -> output: <row> + index + (n_ao+1)*(n_ao+1) <float> ; #X text 383 394 -> output: <col> + index + (2*n_ao+1) <float>; #X text 383 406 -> output: <col> + index + (n_ao+1)*(n_ao+1) <float> ; #X text 432 424 for crossfading of 2 ambisonic-systems; #X msg 605 183 ambi_weight 1 1 1; #X msg 588 162 ambi_weight 1 1 0.3904; #X text 299 424 ambisonic-order-group; #X text 89 452 -90 <= delta <= +90; #X text 89 464 -180 <= phi <= +180; #X text 415 439 or for bluring a signal-source-direction; #X text 31 506 order of ambisonic-channels in 2d-case: W X1 Y1 X2 Y2 X3 Y3; #X text 391 506 X4 Y4 X5 Y5 ....; #X text 167 520 W := 1 \, X-term ... cos(i*phi) \, Y-term ... sin(i*phi) ; #X text 30 560 order of ambisonic-channels in 3d-case: W Z1X1 Z1Y1 Z1; #X text 358 560 Z2X2 Z2Y2 Z2X1 Z2Y1 Z2 Z3X3 Z3Y3 Z3X2 Z3Y2 Z3X1 Z3Y1 Z3 ...; #X text 166 574 W := 1 \, X-term ... cos(i*phi) \, Y-term ... sin(i*phi) \,; #X text 489 574 Z-term ... cos(j*delta)*sin(k*delta); #X text 33 318 input: <float> phi [degree] .. 2-dimensional; #X text 33 331 input: <list> delta + phi [degree] .. 3-dimensional ; #X text 33 356 input: <row> index + phi [degree] .. 2-dimensional; #X text 34 368 input: <row> index + delta + phi [degree] .. 3-dimensional ; #X text 31 395 input: <col> index + phi [degree .. 2-dimensional; #X text 31 407 input: <col> index + delta + phi [degree] .. 3-dimensional ; #X text 31 424 input: <ambi_weight> one mul-factor for each; #X text 267 492 |0| 1 | 2 | 3 | 4 | 5 |; #X text 687 549 |; #X text 263 547 |0| 1 | 2 | 3; #X floatatom 226 142 5 -180 180 0 - - -; #X floatatom 177 143 5 -90 90 0 - - -; #X text 174 124 delta; #X text 228 123 phi; #X floatatom 327 139 5 -180 180 0 - - -; #X floatatom 278 140 5 -90 90 0 - - -; #X text 275 121 delta; #X text 329 120 phi; #X floatatom 370 65 5 -180 180 0 - - -; #X text 372 46 phi; #X floatatom 425 79 5 -180 180 0 - - -; #X text 427 60 phi; #X floatatom 461 160 5 -180 180 0 - - -; #X text 463 141 phi; #X text 491 272 (1 .. 5 for 3 dimensional use); #X msg 184 218 row 4 \$1 \$2; #X text 112 12 calculates a row or column of a ambisonic-encoder-matrix ; #X text 82 849 "float"-message: <float> azimuth-angle phi [degree] -> two-dimensional ambisonic-system -> output a <list> of (2*n_ao + 1) <float> elements; #X text 478 850 "list"-message: 1.item <float> elevation-angle delta [degree] \, 2.item <float> azimuth-angle phi [degree] -> three-dimensional ambisonic-system -> output a <list> of (n_ao + 1)^2 <float> elements ; #X text 87 914 "row"-message: <float> row-index of ambisonic-encoder-matrix \, <float> azimuth-angle phi [degree] -> two-dimensional ambisonic-system -> output a "row"-message + <float> row-index + (2*n_ao + 1) <float> elements; #X text 480 919 "row"-message: 1.item <float> elevation-angle delta [degree] \, 2.item <float> azimuth-angle phi [degree] -> three-dimensional ambisonic-system -> output a <list> of (n_ao + 1)^2 <float> elements ; #X text 105 441 1 <= index <= nr_sources; #N canvas 0 0 860 478 3D-5.Order-example 0; #X obj 78 97 pack 0 0; #X floatatom 78 55 5 -90 90 0 - - -; #X floatatom 121 56 5 -180 180 0 - - -; #X text 63 24 delta; #X text 44 38 -90 .. +90; #X text 147 26 phi; #X text 120 40 -180 .. +180; #X obj 96 76 t b f; #X obj 97 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 9439 1; #X obj 107 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 6442 1; #X obj 117 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 3208 1; #X obj 127 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X obj 137 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X obj 147 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X obj 157 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X obj 167 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X obj 177 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X obj 187 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X obj 197 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X obj 207 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X obj 217 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X obj 227 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X obj 237 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X obj 247 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X obj 257 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X obj 267 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X obj 277 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X obj 287 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X obj 297 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X obj 307 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X obj 317 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X obj 327 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X obj 87 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 10000 1; #X obj 422 89 ambi_encode 4; #X floatatom 422 68 5 -180 180 0 - - -; #X text 434 31 phi; #X text 407 45 -180 .. +180; #X obj 142 202 print 3d; #X obj 422 132 print 2d; #X obj 78 201 route row; #X obj 142 180 round_zero 1e-006; #X floatatom 42 244 5 0 0 0 - - -; #X obj 78 124 pp row 7; #X text 13 254 row-index; #X obj 422 111 round_zero 1e-006; #X text 448 260 +1; #X text 448 360 -1; #X text 451 311 0; #X obj 78 151 ambi_encode 5; #X obj 78 222 unpack 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0; #X obj 337 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X obj 347 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X obj 357 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X obj 367 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X obj 377 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X obj 387 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X obj 397 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X obj 407 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X obj 417 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X obj 427 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X obj 437 268 vsl 8 101 -1 1 0 0 empty empty empty 0 -8 0 8 -225280 -1109 -1 5000 1; #X msg 260 57 ambi_weight 1 1 1 1 1 1; #X msg 260 95 ambi_weight 1 1 1 1 0 0; #X msg 260 114 ambi_weight 1 1 1 0 0 0; #X msg 260 134 ambi_weight 1 1 0 0 0 0; #X msg 260 154 ambi_weight 1 0 0 0 0 0; #X msg 260 76 ambi_weight 1 1 1 1 1 0; #X connect 0 0 42 0; #X connect 1 0 0 0; #X connect 2 0 7 0; #X connect 7 0 0 0; #X connect 7 1 0 1; #X connect 33 0 44 0; #X connect 34 0 33 0; #X connect 39 0 49 0; #X connect 40 0 37 0; #X connect 42 0 48 0; #X connect 44 0 38 0; #X connect 48 0 39 0; #X connect 48 0 40 0; #X connect 49 0 41 0; #X connect 49 1 32 0; #X connect 49 2 8 0; #X connect 49 3 9 0; #X connect 49 4 10 0; #X connect 49 5 11 0; #X connect 49 6 12 0; #X connect 49 7 13 0; #X connect 49 8 14 0; #X connect 49 9 15 0; #X connect 49 10 16 0; #X connect 49 11 17 0; #X connect 49 12 18 0; #X connect 49 13 19 0; #X connect 49 14 20 0; #X connect 49 15 21 0; #X connect 49 16 22 0; #X connect 49 17 23 0; #X connect 49 18 24 0; #X connect 49 19 25 0; #X connect 49 20 26 0; #X connect 49 21 27 0; #X connect 49 22 28 0; #X connect 49 23 29 0; #X connect 49 24 30 0; #X connect 49 25 31 0; #X connect 49 26 50 0; #X connect 49 27 51 0; #X connect 49 28 52 0; #X connect 49 29 53 0; #X connect 49 30 54 0; #X connect 49 31 55 0; #X connect 49 32 56 0; #X connect 49 33 57 0; #X connect 49 34 58 0; #X connect 49 35 59 0; #X connect 49 36 60 0; #X connect 61 0 48 0; #X connect 62 0 48 0; #X connect 63 0 48 0; #X connect 64 0 48 0; #X connect 65 0 48 0; #X connect 66 0 48 0; #X restore 538 61 pd 3D-5.Order-example; #X connect 0 0 9 0; #X connect 4 0 0 0; #X connect 5 0 0 0; #X connect 6 0 0 0; #X connect 7 0 6 0; #X connect 8 0 7 0; #X connect 8 1 7 1; #X connect 9 0 1 0; #X connect 10 0 65 0; #X connect 11 0 10 0; #X connect 11 1 10 1; #X connect 12 0 15 0; #X connect 13 0 14 0; #X connect 14 0 0 0; #X connect 15 0 14 0; #X connect 15 1 14 1; #X connect 27 0 0 0; #X connect 28 0 0 0; #X connect 50 0 11 0; #X connect 51 0 10 0; #X connect 54 0 8 0; #X connect 55 0 7 0; #X connect 58 0 0 0; #X connect 60 0 5 0; #X connect 62 0 4 0; #X connect 65 0 0 0; --- NEW FILE: help-ambi_decode2.pd --- #N canvas 82 3 844 643 10; #X obj 38 441 print; #X text 454 156 1.arg: <float> ambisonic order; #X obj 38 418 round_zero 1e-006; #X text 297 312 ambisonic-order = n_ao; #X text 485 387 ambisonic-order-group; #X text 273 428 -90 <= delta <= +90; #X text 273 440 -180 <= phi <= +180; #X text 214 387 input: <ambi_weight> one mul-factor for each; #X text 21 12 ambi_decode; #X text 105 12 calculates a decoder-matrix; #X obj 38 33 bng 35 250 50 0 empty empty empty 0 -6 0 8 -24198 -42246 -1; #X text 214 336 input: <ls> index + phi [degree] .. 2-dimensional; #X text 214 346 input: <ls> index + delta + phi [degree] .. 3-dimensional ; #X text 214 360 input: <phls> index + phi [degree .. 2-dimensional ; #X text 214 371 input: <phls> index + delta + phi [degree] .. 3-dimensional ; #X text 238 518 <float> n_col = (2*n_ao+1) = number of ambisonic-channels ; #X text 226 527 + <float> n_row = (n_ls) = number of loudspeakers; #X text 466 313 number of loudspeakers = n_ls; #X text 229 587 + <float> n_row = (n_ls) = number of loudspeakers; #X text 214 568 output in case of 3d: <matrix> ((n_ao+1)*(n_ao+1)*n_ls+2) ; #X text 212 507 output in case of 2d: <matrix> ((2*n_ao+1)*n_ls+2) ; #X text 559 568 <float> :; #X text 516 506 <float> :; #X text 456 578 number of ambisonic-channels; #X text 241 578 <float> n_col = (n_ao+1)*(n_ao+1) =; #X text 427 597 <float> elements of a matrix; #X text 229 597 + (n_ao + 1) * (n_ao + 1) * n_ls; #X text 226 537 + (2*n_ao + 1) * n_ls <float> elements of a matrix ; #X text 207 460 input: <pinv> calculates the pseudo-inverse of the encoded; #X text 263 471 loudspeaker-positions (+ the phantom-speakers); #X text 277 482 and output a matrix-message; #X text 288 417 1 <= index <= n_ao; #X text 544 268 a regular matrix to inverse it); #X text 375 399 to suppress the side-lobe-phenomena; #X text 467 258 (it is sometimes necessary to add phantom-ls. for achieving ; #X msg 38 372 pseudo_inverse; #X msg 234 128 ambi_weight 1 1 1 0.3904; #X msg 108 129 ambi_weight 1 1 1 1; #X msg 123 104 mirror_weight 0.7; #X obj 94 178 pp ind_ls; #X msg 94 155 1 90 0 \, 2 45 45 \, 3 45 135 \, 4 45 225 \, 5 45 315 ; #X obj 38 396 ambi_decode2 3 3 5 8 1; #X obj 80 243 pp mrg_ls; #X msg 80 208 1 0 0 \, 2 0 45 \, 3 0 90 \, 4 0 135 \, 5 0 180 \, 6 0 225 \, 7 0 270 \, 8 0 315; #X obj 66 300 pp mir_ls; #X msg 66 265 1 -45 0 \, 2 -45 45 \, 3 -45 90 \, 4 -45 135 \, 5 -45 180 \, 6 -45 225 \, 7 -45 270 \, 8 -45 315; #X obj 52 346 pp pht_ls; #X msg 52 323 1 -90 0; #X obj 38 77 t b b b b b b b; #X text 469 174 (1 .. 5 in case of 3 dimensional); #X text 469 165 (1 .. 12 in case of 2 dimensional); #X text 455 196 3.arg: <float> number of independent loudspeakers; #X text 454 184 2.arg: <float> dimension (2 or 3); #X text 454 247 5.arg: <float> number of canceled phantom_loudspeakers ; #X text 455 208 4.arg: <float> number of merged and mirrored loudspeakers ; #X text 501 221 (the merged loudspeakers are at the border of the arc ; #X text 514 233 or the hemisphere \, the mirrored loudspeakers are ; #X connect 2 0 0 0; #X connect 10 0 48 0; #X connect 35 0 41 0; #X connect 36 0 41 0; #X connect 37 0 41 0; #X connect 38 0 41 0; #X connect 39 0 41 0; #X connect 40 0 39 0; #X connect 41 0 2 0; #X connect 42 0 41 0; #X connect 43 0 42 0; #X connect 44 0 41 0; #X connect 45 0 44 0; #X connect 46 0 41 0; #X connect 47 0 46 0; #X connect 48 0 35 0; #X connect 48 1 47 0; #X connect 48 2 45 0; #X connect 48 3 43 0; #X connect 48 4 40 0; #X connect 48 5 37 0; #X connect 48 6 38 0;

1 0

externals/iem/iem_ambi GnuGPL.txt, NONE, 1.1 LICENSE.txt, NONE, 1.1 READ_ME.txt, NONE, 1.1
by musil 09 Mar '06

09 Mar '06

Update of /cvsroot/pure-data/externals/iem/iem_ambi In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv19074/iem/iem_ambi Added Files: GnuGPL.txt LICENSE.txt READ_ME.txt Log Message: initial version JAN_06 with all sources --- NEW FILE: LICENSE.txt --- iem_ambi - ambisonic encoder, rotation and decoder rendering Copyright (C) 2000-2006 Thomas MUSIL [musil_at_iem.at] IEM - Institute of Electronic Music and Acoustics, Graz Inffeldgasse 10/3, 8010 Graz, Austria http://iem.at This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details ( GnuGPL.txt ). (e.g. http://www.gnu.org/copyleft/gpl.html) You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA Graz, 15 June 2005 Thomas Musil --- NEW FILE: GnuGPL.txt --- GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc. 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This General Public License applies to most of the Free Software Foundation's software and to any other program whose authors commit to using it. (Some other Free Software Foundation software is covered by the GNU Library General Public License instead.) You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs; and that you know you can do these things. To protect your rights, we need to make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. For example, if you distribute copies of such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. Finally, any free program is threatened constantly by software patents. We wish to avoid the danger that redistributors of a free program will individually obtain patent licenses, in effect making the program proprietary. To prevent this, we have made it clear that any patent must be licensed for everyone's free use or not licensed at all. The precise terms and conditions for copying, distribution and modification follow. GNU GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The "Program", below, refers to any such program or work, and a "work based on the Program" means either the Program or any derivative work under copyright law: that is to say, a work containing the Program or a portion of it, either verbatim or with modifications and/or translated into another language. (Hereinafter, translation is included without limitation in the term "modification".) Each licensee is addressed as "you". Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running the Program is not restricted, and the output from the Program is covered only if its contents constitute a work based on the Program (independent of having been made by running the Program). Whether that is true depends on what the Program does. 1. You may copy and distribute verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and give any other recipients of the Program a copy of this License along with the Program. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Program or any portion of it, thus forming a work based on the Program, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) You must cause the modified files to carry prominent notices stating that you changed the files and the date of any change. b) You must cause any work that you distribute or publish, that in whole or in part contains or is derived from the Program or any part thereof, to be licensed as a whole at no charge to all third parties under the terms of this License. c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the most ordinary way, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty) and that users may redistribute the program under these conditions, and telling the user how to view a copy of this License. (Exception: if the Program itself is interactive but does not normally print such an announcement, your work based on the Program is not required to print an announcement.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Program, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Program, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Program. In addition, mere aggregation of another work not based on the Program with the Program (or with a work based on the Program) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may copy and distribute the Program (or a work based on it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you also do one of the following: a) Accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, b) Accompany it with a written offer, valid for at least three years, to give any third party, for a charge no more than your cost of physically performing source distribution, a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, c) Accompany it with the information you received as to the offer to distribute corresponding source code. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form with such an offer, in accord with Subsection b above.) The source code for a work means the preferred form of the work for making modifications to it. For an executable work, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the executable. However, as a special exception, the source code distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. If distribution of executable or object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place counts as distribution of the source code, even though third parties are not compelled to copy the source along with the object code. 4. You may not copy, modify, sublicense, or distribute the Program except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense or distribute the Program is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 5. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Program or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Program (or any work based on the Program), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Program or works based on it. 6. Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties to this License. 7. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Program at all. For example, if a patent license would not permit royalty-free redistribution of the Program by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Program. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system, which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 8. If the distribution and/or use of the Program is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Program under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 9. The Free Software Foundation may publish revised and/or new versions of the General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of this License, you may choose any version ever published by the Free Software Foundation. 10. If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. <one line to give the program's name and a brief idea of what it does.> Copyright (C) <year> <name of author> This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Also add information on how to contact you by electronic and paper mail. If the program is interactive, make it output a short notice like this when it starts in an interactive mode: Gnomovision version 69, Copyright (C) year name of author Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, the commands you use may be called something other than `show w' and `show c'; they could even be mouse-clicks or menu items--whatever suits your program. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the program, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (which makes passes at compilers) written by James Hacker. <signature of Ty Coon>, 1 April 1989 Ty Coon, President of Vice This General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Library General Public License instead of this License. --- NEW FILE: READ_ME.txt --- This library extends the performance of miller puckette's pure data (pd). iem_ambi contains 3 objects: "ambi_encode", "ambi_rot" and "ambi_decode3" they calculate ambisonic encoder matrices, rotation matrices and decoder matrices from 1st to 4th order in 2D or 3D.

1 0

externals/iem/iem_ambi/src - New directory
by musil 09 Mar '06

09 Mar '06

Update of /cvsroot/pure-data/externals/iem/iem_ambi/src In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv18536/src Log Message: Directory /cvsroot/pure-data/externals/iem/iem_ambi/src added to the repository

1 0

externals/iem/iem_ambi/help - New directory
by musil 09 Mar '06

09 Mar '06

Update of /cvsroot/pure-data/externals/iem/iem_ambi/help In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv18536/help Log Message: Directory /cvsroot/pure-data/externals/iem/iem_ambi/help added to the repository

1 0

externals/iem/iem_ambi - New directory
by musil 09 Mar '06

09 Mar '06

Update of /cvsroot/pure-data/externals/iem/iem_ambi In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv17996/iem_ambi Log Message: Directory /cvsroot/pure-data/externals/iem/iem_ambi added to the repository

1 0

externals/iem/iem_bin_ambi/help L0e045a.wav, NONE, 1.1 L0e135a.wav, NONE, 1.1 L0e225a.wav, NONE, 1.1 L0e315a.wav, NONE, 1.1 ambi_reduced_decode_fft2-help.pd, NONE, 1.1
by musil 09 Mar '06

09 Mar '06

Update of /cvsroot/pure-data/externals/iem/iem_bin_ambi/help In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv13030/iem/iem_bin_ambi/help Added Files: L0e045a.wav L0e135a.wav L0e225a.wav L0e315a.wav ambi_reduced_decode_fft2-help.pd Log Message: update to version JAN_06 with all sources --- NEW FILE: L0e315a.wav --- (This appears to be a binary file; contents omitted.) --- NEW FILE: L0e225a.wav --- (This appears to be a binary file; contents omitted.) --- NEW FILE: ambi_reduced_decode_fft2-help.pd --- #N canvas 90 10 884 683 10; #X text 795 99 1.arg: <float> ambisonic order; #X text 880 255 ambisonic-order = n_ao; #X text 1068 330 ambisonic-order-group; #X text 856 371 -90 <= delta <= +90; #X text 856 383 -180 <= phi <= +180; #X text 797 330 input: <ambi_weight> one mul-factor for each; #X text 797 279 input: <ls> index + phi [degree] .. 2-dimensional; #X text 797 289 input: <ls> index + delta + phi [degree] .. 3-dimensional ; #X text 797 303 input: <phls> index + phi [degree .. 2-dimensional ; #X text 797 314 input: <phls> index + delta + phi [degree] .. 3-dimensional ; #X text 821 461 <float> n_col = (2*n_ao+1) = number of ambisonic-channels ; #X text 809 470 + <float> n_row = (n_ls) = number of loudspeakers; #X text 1049 256 number of loudspeakers = n_ls; #X text 812 530 + <float> n_row = (n_ls) = number of loudspeakers; #X text 797 511 output in case of 3d: <matrix> ((n_ao+1)*(n_ao+1)*n_ls+2) ; #X text 795 450 output in case of 2d: <matrix> ((2*n_ao+1)*n_ls+2) ; #X text 1142 511 <float> :; #X text 1099 449 <float> :; #X text 1039 521 number of ambisonic-channels; #X text 824 521 <float> n_col = (n_ao+1)*(n_ao+1) =; #X text 1010 540 <float> elements of a matrix; #X text 812 540 + (n_ao + 1) * (n_ao + 1) * n_ls; #X text 809 480 + (2*n_ao + 1) * n_ls <float> elements of a matrix ; #X text 790 403 input: <pinv> calculates the pseudo-inverse of the encoded; #X text 846 414 loudspeaker-positions (+ the phantom-speakers); #X text 860 425 and output a matrix-message; #X text 871 360 1 <= index <= n_ao; #X text 885 211 a regular matrix to inverse it); #X text 958 342 to suppress the side-lobe-phenomena; #X text 808 201 (it is sometimes necessary to add phantom-ls. for achieving ; #X text 810 117 (1 .. 5 in case of 3 dimensional); #X text 810 108 (1 .. 12 in case of 2 dimensional); #X text 796 139 3.arg: <float> number of independent loudspeakers; #X text 795 127 2.arg: <float> dimension (2 or 3); #X text 795 190 5.arg: <float> number of canceled phantom_loudspeakers ; #X text 796 151 4.arg: <float> number of merged and mirrored loudspeakers ; #X text 842 164 (the merged loudspeakers are at the border of the arc ; #X text 855 176 or the hemisphere \, the mirrored loudspeakers are ; #X obj 18 350 soundfiler; #X obj 27 188 unpack s s; #X msg 18 329 read -skip \$1 \$2 \$3; #X obj 358 278 pp element; #X obj 45 284 mergefilename /; #X text 357 316 multiplexer control indices; #X text 353 327 for spec2_matrix_bundle_stat~; #X text 423 76 1.arg: <float> unique-number used as table-name-prefix ; #X text 423 86 2.arg: <symbol> left HRIR-table-name; #X text 423 96 3.arg: <symbol> real HRTF-table-name; #X text 423 106 4.arg: <symbol> imag HRTF-table-name; #X text 423 116 5.arg: <symbol> HRIR-fadeout-window-table-name; #X obj 18 308 pack f s s; #X text 423 126 6.arg: <float> ambisonic order; #X text 423 136 7.arg: <float> ambisonic dimension; #X text 423 146 8.arg: <float> number of real loudspeakers; #X text 423 156 9.arg: <float> number of phantom loudspeakers; #X text 417 166 10.arg: <float> FFT-size = 2 x effective HRIR-length ; #X obj 94 108 bin_ambi_reduced_decode_fft2 \$0 HRIR HRTF_re HRTF_im fadeout 1 2 4 0 256; #X obj 14 473 table \$0_fadeout 256; #X obj 45 236 symbol .; #X obj 27 211 t b b s; #X obj 45 258 pack s s; #X obj 18 245 f 0; #X obj 94 60 bng 15 250 50 0 empty empty empty 0 -6 0 8 -262144 -1 -1; #X obj 357 299 print; #X obj 13 387 table \$0_1_HRIR 256; #X obj 249 382 table \$0_1_HRTF_re 256; #X obj 389 382 table \$0_1_HRTF_im 256; #X obj 13 447 table \$0_4_HRIR 256; #X obj 13 427 table \$0_3_HRIR 256; #X obj 13 407 table \$0_2_HRIR 256; #X obj 249 402 table \$0_2_HRTF_re 256; #X obj 249 422 table \$0_3_HRTF_re 256; #X obj 389 422 table \$0_3_HRTF_im 256; #X obj 389 402 table \$0_2_HRTF_im 256; #N canvas 26 6 959 718 input_messages 0; #X obj 42 641 outlet; #X text 33 659 to bin_ambi_reduced_decode; #X msg 715 529 calc_reduced \$1; #X msg 372 418 calc_pinv; #X msg 444 454 check_HRIR_arrays \$1; #X msg 581 491 check_HRTF_arrays \$1; #X msg 818 545 calc_sym; #X obj 134 154 pp pht_ls; #X obj 64 110 pp real_ls; #X obj 23 60 pp load_HRIR; #X obj 444 434 for++ 1 4 10; #X obj 444 414 del 10; #X obj 581 451 del 10; #X obj 581 471 for++ 1 3 10; #X obj 715 488 del 10; #X obj 715 508 for++ 1 3 10; #X obj 818 525 del 10; #X msg 23 37 1 L0e045a.wav \, 2 L0e135a.wav \, 3 L0e225a.wav \, 4 L0e315a.wav ; #X obj 197 202 pp ipht_ireal_muladd; #X obj 294 336 pp ambi_weight; #X obj 240 271 pp sing_range; #X msg 134 134 1 -90 0; #X msg 240 251 1e-010; #X text 403 31 <list> : <float> loudspeaker-index + <symbol> left-ear-HRIR-wav \, index beginning with one; #X text 272 81 <list> : <float> loudspeaker-index + <float> elevation in degree + <float> azimuth in degree \, index beginning with one \, elevation geodetical \, azimuth counterclockwise positiv; #X text 699 37 list of HRIRs; #X text 645 93 list of the real loudspeaker-coordinates; #X text 570 147 list of the phantom loudspeaker-coordinates; #X text 200 130 <list> : <float> loudspeaker-index + <float> elevation in degree + <float> azimuth in degree \, index beginning with one \, elevation geodetical \, azimuth counterclockwise positiv; #X msg 197 181 1 4 0.707; #X text 330 170 <list> : <float> phantom-loudspeaker-index + <float> real-loudspeaker-index + <float> mirror-weight \, both index beginning greater zero \, mul-factor should be the cosine of the elevation-angle-difference ; #X text 326 239 <float> singularity-range: when calculating the inverse of the loudspeaker-matrix \, we use gauss-algorithm. if we divide a matrix-element by a number less then this range \, we say \, this matrix is not regulary.; #X obj 372 397 del 10; #X obj 323 292 del 10; #X obj 116 63 del 10; #X obj 24 7 bng 15 250 50 0 empty empty empty 0 -6 0 8 -262144 -1 -1 ; #X msg 305 314 1 1; #X obj 65 4 inlet; #X msg 64 90 1 45 \, 2 135 \, 3 225 \, 4 315; #X text 156 74 this is 2-d case; #X connect 2 0 0 0; #X connect 3 0 0 0; #X connect 4 0 0 0; #X connect 5 0 0 0; #X connect 6 0 0 0; #X connect 7 0 0 0; #X connect 8 0 0 0; #X connect 9 0 0 0; #X connect 10 0 4 0; #X connect 10 1 12 0; #X connect 11 0 10 0; #X connect 12 0 13 0; #X connect 13 0 5 0; #X connect 13 1 14 0; #X connect 14 0 15 0; #X connect 15 0 2 0; #X connect 15 1 16 0; #X connect 16 0 6 0; #X connect 17 0 9 0; #X connect 18 0 0 0; #X connect 19 0 0 0; #X connect 20 0 0 0; #X connect 21 0 7 0; #X connect 22 0 20 0; #X connect 29 0 18 0; #X connect 32 0 3 0; #X connect 32 0 11 0; #X connect 33 0 32 0; #X connect 33 0 36 0; #X connect 34 0 38 0; #X connect 34 0 33 0; #X connect 35 0 17 0; #X connect 35 0 34 0; #X connect 36 0 19 0; #X connect 37 0 35 0; #X connect 38 0 8 0; #X restore 94 83 pd input_messages; #X text 21 12 ambi_reduced_decode_fft2; #X text 215 9 calculates a reduced set of HRTF-spectras; #N canvas 0 0 461 380 init 0; #X obj 124 23 loadbang; #X obj 124 45 bng 15 250 50 0 empty empty empty 0 -6 0 8 -262144 -1 -1; #X obj 124 73 for++ 0 127; #X obj 124 144 t b; #X msg 124 164 1; #X obj 124 123 moses 95; #X obj 167 144 - 95; #X obj 167 166 / 32; #X obj 167 220 * 3.14159; #X obj 167 264 t f f; #X obj 172 286 *; #X obj 172 317 tabwrite \$0_fadeout; #X obj 270 162 + 128; #X msg 270 185 0 \$1; #X obj 153 97 t f f f; #X obj 167 241 cos; #X obj 167 199 / 2; #X connect 0 0 1 0; #X connect 1 0 2 0; #X connect 2 0 14 0; #X connect 3 0 4 0; #X connect 4 0 11 0; #X connect 5 0 3 0; #X connect 5 1 6 0; #X connect 6 0 7 0; #X connect 7 0 16 0; #X connect 8 0 15 0; #X connect 9 0 10 0; #X connect 9 1 10 1; #X connect 10 0 11 0; #X connect 12 0 13 0; #X connect 13 0 11 0; #X connect 14 0 5 0; #X connect 14 1 11 1; #X connect 14 2 12 0; #X connect 15 0 9 0; #X connect 16 0 8 0; #X restore 92 496 pd init; #X connect 39 0 59 0; #X connect 39 1 50 2; #X connect 40 0 38 0; #X connect 41 0 63 0; #X connect 42 0 50 1; #X connect 50 0 40 0; #X connect 56 0 39 0; #X connect 56 1 41 0; #X connect 58 0 60 0; #X connect 59 0 61 0; #X connect 59 1 58 0; #X connect 59 2 60 1; #X connect 60 0 42 0; #X connect 61 0 50 0; #X connect 62 0 74 0; #X connect 74 0 56 0; --- NEW FILE: L0e135a.wav --- (This appears to be a binary file; contents omitted.) --- NEW FILE: L0e045a.wav --- (This appears to be a binary file; contents omitted.)

1 0

externals/iem/iem_bin_ambi READ_ME.txt,NONE,1.1
by musil 09 Mar '06

09 Mar '06

Update of /cvsroot/pure-data/externals/iem/iem_bin_ambi In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv11685/iem/iem_bin_ambi Added Files: READ_ME.txt Log Message: update to version JAN_06 with all sources --- NEW FILE: READ_ME.txt --- This library extends the performance of miller puckette's pure data (pd). iem_bin_ambi contains 2 objects: "bin_ambi_reduced_decode_fft2" and "bin_ambi_reduced_decode_fir2" which calculate the product of an ambisonic decoder-matrix and the binaural HRIR's. (in frequency and in time domain)

1 0

externals/iem/iem_bin_ambi LICENSE.txt,1.2,1.3
by musil 09 Mar '06

09 Mar '06

Update of /cvsroot/pure-data/externals/iem/iem_bin_ambi In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv10618/iem/iem_bin_ambi Modified Files: LICENSE.txt Log Message: update to version JAN_06 with all sources Index: LICENSE.txt =================================================================== RCS file: /cvsroot/pure-data/externals/iem/iem_bin_ambi/LICENSE.txt,v retrieving revision 1.2 retrieving revision 1.3 diff -C2 -d -r1.2 -r1.3 *** LICENSE.txt 1 Mar 2006 13:52:11 -0000 1.2 --- LICENSE.txt 9 Mar 2006 15:57:05 -0000 1.3 *************** *** 1,21 **** ! iem_bin_ambi - binaural ambisonic rendering ! Copyright (C) 2000-2006 Thomas Musil (musil AT iem DOT at) ! This program is free software; you can redistribute it and/or ! modify it under the terms of the GNU General Public License ! as published by the Free Software Foundation; either version 2 ! of the License, or (at your option) any later version. ! ! This program is distributed in the hope that it will be useful, ! but WITHOUT ANY WARRANTY; without even the implied warranty of ! MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the ! GNU General Public License for more details. - You should have received a copy of the GNU General Public License - along with this program; if not, write to the Free Software - Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. - In the official flext distribution, the GNU General Public License is - in the file GnuGPL.txt --- 1,27 ---- ! iem_bin_ambi - binaural ambisonic decoder rendering ! Copyright (C) 2000-2006 Thomas MUSIL [musil_at_iem.at] ! IEM - Institute of Electronic Music and Acoustics, Graz ! Inffeldgasse 10/3, 8010 Graz, Austria ! http://iem.at + This program is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; either version 2 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details ( GnuGPL.txt ). + (e.g. http://www.gnu.org/copyleft/gpl.html) + + You should have received a copy of the GNU General Public License + along with this program; if not, write to the Free Software + Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA + + Graz, 15 June 2005 + Thomas Musil \ No newline at end of file

1 0

externals/iem/iem_bin_ambi/src bin_ambi_reduced_decode2.c, NONE, 1.1 bin_ambi_reduced_decode_fft.c, NONE, 1.1 bin_ambi_reduced_decode_fft2.c, NONE, 1.1 bin_ambi_reduced_decode_fir.c, NONE, 1.1 bin_ambi_reduced_decode_fir2.c, NONE, 1.1 bin_ambi_calc_HRTF.c, 1.1, 1.2 bin_ambi_reduced_decode.c, 1.1, 1.2 iem_bin_ambi.c, 1.2, 1.3 iem_bin_ambi.h, 1.1, 1.2 iemlib.h, 1.1, 1.2 makefile_win, 1.1, 1.2
by musil 09 Mar '06

09 Mar '06

Update of /cvsroot/pure-data/externals/iem/iem_bin_ambi/src In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv9954/iem/iem_bin_ambi/src Modified Files: bin_ambi_calc_HRTF.c bin_ambi_reduced_decode.c iem_bin_ambi.c iem_bin_ambi.h iemlib.h makefile_win Added Files: bin_ambi_reduced_decode2.c bin_ambi_reduced_decode_fft.c bin_ambi_reduced_decode_fft2.c bin_ambi_reduced_decode_fir.c bin_ambi_reduced_decode_fir2.c Log Message: update to version JAN_06 with all sources --- NEW FILE: bin_ambi_reduced_decode_fft2.c --- /* For information on usage and redistribution, and for a DISCLAIMER OF ALL * WARRANTIES, see the file, "LICENSE.txt," in this distribution. iem_bin_ambi written by Thomas Musil, Copyright (c) IEM KUG Graz Austria 2000 - 2005 */ #ifdef NT #pragma warning( disable : 4244 ) #pragma warning( disable : 4305 ) #endif #include "m_pd.h" #include "iemlib.h" #include "iem_bin_ambi.h" #include <math.h> #include <stdio.h> #include <string.h> [...1349 lines suppressed...] class_addmethod(bin_ambi_reduced_decode_fft2_class, (t_method)bin_ambi_reduced_decode_fft2_sing_range, gensym("sing_range"), A_DEFFLOAT, 0); class_sethelpsymbol(bin_ambi_reduced_decode_fft2_class, gensym("iemhelp2/help-bin_ambi_reduced_decode_fft2")); } /* Reihenfolge: n_ls x bin_ambi_reduced_decode_fft2_ls bin_ambi_reduced_decode_fft2_calc_pinv n_ls x bin_ambi_reduced_decode_fft2_load_HRIR n_ls x bin_ambi_reduced_decode_fft2_check_HRIR_arrays n_ambi x bin_ambi_reduced_decode_fft2_check_HRTF_arrays n_ambi x bin_ambi_reduced_decode_fft2_calc_reduced bin_ambi_reduced_decode_fft2_calc_sym */ --- NEW FILE: bin_ambi_reduced_decode_fir2.c --- /* For information on usage and redistribution, and for a DISCLAIMER OF ALL * WARRANTIES, see the file, "LICENSE.txt," in this distribution. iem_bin_ambi written by Thomas Musil, Copyright (c) IEM KUG Graz Austria 2000 - 2005 */ #ifdef NT #pragma warning( disable : 4244 ) #pragma warning( disable : 4305 ) #endif #include "m_pd.h" #include "iemlib.h" #include "iem_bin_ambi.h" #include <math.h> #include <stdio.h> #include <string.h> [...1221 lines suppressed...] class_addmethod(bin_ambi_reduced_decode_fir2_class, (t_method)bin_ambi_reduced_decode_fir2_sing_range, gensym("sing_range"), A_DEFFLOAT, 0); class_sethelpsymbol(bin_ambi_reduced_decode_fir2_class, gensym("iemhelp2/help-bin_ambi_reduced_decode_fir2")); } /* Reihenfolge: n_ls x bin_ambi_reduced_decode_fir2_ls bin_ambi_reduced_decode_fir2_calc_pinv n_ls x bin_ambi_reduced_decode_fir2_load_HRIR n_ls x bin_ambi_reduced_decode_fir2_check_HRIR_arrays n_ambi x bin_ambi_reduced_decode_fir2_check_HRTF_arrays n_ambi x bin_ambi_reduced_decode_fir2_calc_reduced bin_ambi_reduced_decode_fir2_calc_sym */ Index: iem_bin_ambi.c =================================================================== RCS file: /cvsroot/pure-data/externals/iem/iem_bin_ambi/src/iem_bin_ambi.c,v retrieving revision 1.2 retrieving revision 1.3 diff -C2 -d -r1.2 -r1.3 *** iem_bin_ambi.c 1 Mar 2006 12:07:33 -0000 1.2 --- iem_bin_ambi.c 9 Mar 2006 15:56:05 -0000 1.3 *************** *** 2,6 **** * WARRANTIES, see the file, "LICENSE.txt," in this distribution. ! iem_bin_ambi written by Thomas Musil, Copyright (c) IEM KUG Graz Austria 2000 - 2003 */ #ifdef NT --- 2,6 ---- * WARRANTIES, see the file, "LICENSE.txt," in this distribution. ! iem_bin_ambi written by Thomas Musil, Copyright (c) IEM KUG Graz Austria 2000 - 2005 */ #ifdef NT *************** *** 22,32 **** } /* ------------------------ setup routine ------------------------- */ - void iem_bin_ambi_sources_setup(void); void iem_bin_ambi_setup(void) { ! iem_bin_ambi_sources_setup(); ! post("iem_bin_ambi (R-1.15) library loaded!"); } --- 22,46 ---- } + void bin_ambi_calc_HRTF_setup(void); + void bin_ambi_reduced_decode_setup(void); + void bin_ambi_reduced_decode2_setup(void); + void bin_ambi_reduced_decode_fft_setup(void); + void bin_ambi_reduced_decode_fir_setup(void); + void bin_ambi_reduced_decode_fft2_setup(void); + void bin_ambi_reduced_decode_fir2_setup(void); + /* ------------------------ setup routine ------------------------- */ void iem_bin_ambi_setup(void) { ! bin_ambi_calc_HRTF_setup(); ! bin_ambi_reduced_decode_setup(); ! bin_ambi_reduced_decode2_setup(); ! bin_ambi_reduced_decode_fft_setup(); ! bin_ambi_reduced_decode_fir_setup(); ! bin_ambi_reduced_decode_fft2_setup(); ! bin_ambi_reduced_decode_fir2_setup(); ! post("iem_bin_ambi (R-1.16) library loaded! (c) Thomas Musil 05.2005"); ! post(" musil%ciem.at iem KUG Graz Austria", '@'); } Index: makefile_win =================================================================== RCS file: /cvsroot/pure-data/externals/iem/iem_bin_ambi/src/makefile_win,v retrieving revision 1.1 retrieving revision 1.2 diff -C2 -d -r1.1 -r1.2 *** makefile_win 1 Mar 2006 12:13:45 -0000 1.1 --- makefile_win 9 Mar 2006 15:56:05 -0000 1.2 *************** *** 1,39 **** ! ! all: iem_bin_ambi.dll ! ! VIS_CPP_PATH = "C:\Programme\Microsoft Visual Studio\Vc98" ! ! PD_INST_PATH = "C:\Programme\pd" ! ! PD_WIN_INCLUDE_PATH = /I. /I$(PD_INST_PATH)\src /I$(VIS_CPP_PATH)\include ! ! PD_WIN_C_FLAGS = /nologo /W3 /WX /DMSW /DNT /DPD /DWIN32 /DWINDOWS /Ox -DPA_LITTLE_ENDIAN ! ! PD_WIN_L_FLAGS = /nologo ! ! PD_WIN_LIB = /NODEFAULTLIB:libc /NODEFAULTLIB:oldnames /NODEFAULTLIB:kernel /NODEFAULTLIB:uuid \ ! $(VIS_CPP_PATH)\lib\libc.lib \ ! $(VIS_CPP_PATH)\lib\oldnames.lib \ ! $(VIS_CPP_PATH)\lib\kernel32.lib \ ! $(VIS_CPP_PATH)\lib\wsock32.lib \ ! $(VIS_CPP_PATH)\lib\winmm.lib \ ! $(PD_INST_PATH)\bin\pthreadVC.lib \ ! $(PD_INST_PATH)\bin\pd.lib ! ! ! SRC = bin_ambi_calc_HRTF.c \ ! bin_ambi_reduced_decode.c \ ! iem_bin_ambi.c ! ! ! OBJ = $(SRC:.c=.obj) ! ! .c.obj: ! cl $(PD_WIN_C_FLAGS) $(PD_WIN_INCLUDE_PATH) /c $*.c ! ! iem_bin_ambi.dll: $(OBJ) ! link $(PD_WIN_L_FLAGS) /dll /export:iem_bin_ambi_setup \ ! /out:iem_bin_ambi.dll $(OBJ) $(PD_WIN_LIB) ! ! clean: ! del *.obj --- 1,43 ---- ! ! all: iem_bin_ambi.dll ! ! VIS_CPP_PATH = "C:\Programme\Microsoft Visual Studio\Vc98" ! ! PD_INST_PATH = "C:\Programme\pd" ! ! PD_WIN_INCLUDE_PATH = /I. /I$(PD_INST_PATH)\src /I$(VIS_CPP_PATH)\include ! ! PD_WIN_C_FLAGS = /nologo /W3 /WX /DMSW /DNT /DPD /DWIN32 /DWINDOWS /Ox -DPA_LITTLE_ENDIAN ! ! PD_WIN_L_FLAGS = /nologo ! ! PD_WIN_LIB = /NODEFAULTLIB:libc /NODEFAULTLIB:oldnames /NODEFAULTLIB:kernel /NODEFAULTLIB:uuid \ ! $(VIS_CPP_PATH)\lib\libc.lib \ ! $(VIS_CPP_PATH)\lib\oldnames.lib \ ! $(VIS_CPP_PATH)\lib\kernel32.lib \ ! $(VIS_CPP_PATH)\lib\wsock32.lib \ ! $(VIS_CPP_PATH)\lib\winmm.lib \ ! $(PD_INST_PATH)\bin\pd.lib ! ! ! SRC = bin_ambi_calc_HRTF.c \ ! bin_ambi_reduced_decode.c \ ! bin_ambi_reduced_decode2.c \ ! bin_ambi_reduced_decode_fft.c \ ! bin_ambi_reduced_decode_fir.c \ ! bin_ambi_reduced_decode_fft2.c \ ! bin_ambi_reduced_decode_fir2.c \ ! iem_bin_ambi.c ! ! ! OBJ = $(SRC:.c=.obj) ! ! .c.obj: ! cl $(PD_WIN_C_FLAGS) $(PD_WIN_INCLUDE_PATH) /c $*.c ! ! iem_bin_ambi.dll: $(OBJ) ! link $(PD_WIN_L_FLAGS) /dll /export:iem_bin_ambi_setup \ ! /out:iem_bin_ambi.dll $(OBJ) $(PD_WIN_LIB) ! ! clean: ! del *.obj Index: iem_bin_ambi.h =================================================================== RCS file: /cvsroot/pure-data/externals/iem/iem_bin_ambi/src/iem_bin_ambi.h,v retrieving revision 1.1 retrieving revision 1.2 diff -C2 -d -r1.1 -r1.2 *** iem_bin_ambi.h 1 Mar 2006 11:46:46 -0000 1.1 --- iem_bin_ambi.h 9 Mar 2006 15:56:05 -0000 1.2 *************** *** 2,10 **** * WARRANTIES, see the file, "LICENSE.txt," in this distribution. ! iem_bin_ambi written by Thomas Musil, Copyright (c) IEM KUG Graz Austria 2000 - 2003 */ #ifndef __IEMBINAMBI_H__ #define __IEMBINAMBI_H__ typedef struct { --- 2,16 ---- * WARRANTIES, see the file, "LICENSE.txt," in this distribution. ! iem_bin_ambi written by Thomas Musil, Copyright (c) IEM KUG Graz Austria 2000 - 2005 */ #ifndef __IEMBINAMBI_H__ #define __IEMBINAMBI_H__ + #define BIN_AMBI_LS_REAL 0 + #define BIN_AMBI_LS_IND 0 + #define BIN_AMBI_LS_MRG 1 + #define BIN_AMBI_LS_MIR 2 + #define BIN_AMBI_LS_PHT 3 + typedef struct { --- NEW FILE: bin_ambi_reduced_decode2.c --- /* For information on usage and redistribution, and for a DISCLAIMER OF ALL * WARRANTIES, see the file, "LICENSE.txt," in this distribution. iem_bin_ambi written by Thomas Musil, Copyright (c) IEM KUG Graz Austria 2000 - 2005 */ #ifdef NT #pragma warning( disable : 4244 ) #pragma warning( disable : 4305 ) #endif #include "m_pd.h" #include "iemlib.h" #include "iem_bin_ambi.h" #include <math.h> #include <stdio.h> #include <string.h> [...1321 lines suppressed...] class_addmethod(bin_ambi_reduced_decode2_class, (t_method)bin_ambi_reduced_decode2_sing_range, gensym("sing_range"), A_DEFFLOAT, 0); class_sethelpsymbol(bin_ambi_reduced_decode2_class, gensym("iemhelp2/help-bin_ambi_reduced_decode2")); } /* Reihenfolge: n_ls x bin_ambi_reduced_decode2_ls bin_ambi_reduced_decode2_calc_pinv n_ls x bin_ambi_reduced_decode2_load_HRIR n_ls x bin_ambi_reduced_decode2_check_HRIR_arrays n_ambi x bin_ambi_reduced_decode2_check_HRTF_arrays n_ambi x bin_ambi_reduced_decode2_calc_reduced bin_ambi_reduced_decode2_decoding */ Index: bin_ambi_reduced_decode.c =================================================================== RCS file: /cvsroot/pure-data/externals/iem/iem_bin_ambi/src/bin_ambi_reduced_decode.c,v retrieving revision 1.1 retrieving revision 1.2 diff -C2 -d -r1.1 -r1.2 *** bin_ambi_reduced_decode.c 1 Mar 2006 11:46:46 -0000 1.1 --- bin_ambi_reduced_decode.c 9 Mar 2006 15:56:05 -0000 1.2 *************** *** 2,6 **** * WARRANTIES, see the file, "LICENSE.txt," in this distribution. ! iem_bin_ambi written by Thomas Musil, Copyright (c) IEM KUG Graz Austria 2000 - 2003 */ #ifdef NT --- 2,6 ---- * WARRANTIES, see the file, "LICENSE.txt," in this distribution. ! iem_bin_ambi written by Thomas Musil, Copyright (c) IEM KUG Graz Austria 2000 - 2005 */ #ifdef NT *************** *** 89,93 **** f = g * (float)i; (*sincos).real = cos(f); ! (*sincos).imag = sin(f);/*change*/ sincos++; } --- 89,93 ---- f = g * (float)i; (*sincos).real = cos(f); ! (*sincos).imag = -sin(f);/*FFT*/ sincos++; } *************** *** 742,746 **** if(npoints < fftsize) { ! post("warning: %s-array-size: %d", hrir->s_name, npoints); } vec = x->x_beg_hrir; --- 742,746 ---- if(npoints < fftsize) { ! post("bin_ambi_reduced_decode-WARNING: %s-array-size: %d < FFT-size: %d", hrir->s_name, npoints, fftsize); } vec = x->x_beg_hrir; *************** *** 859,872 **** } } ! ! vec_hrtf_re[0] = val[0].real; ! vec_hrtf_im[0] = 0.0f; ! for( i = 1; i < fs2; i++ ) { ! vec_hrtf_re[i] = 2.0f*val[i].real; ! vec_hrtf_im[i] = 2.0f*val[i].imag; } ! vec_hrtf_re[fs2] = 0.0f; vec_hrtf_im[fs2] = 0.0f; } --- 859,874 ---- } } ! for(i = 0; i<fs2; i++) { ! vec_hrtf_re[i] = val[i].real; ! vec_hrtf_im[i] = val[i].imag; } ! vec_hrtf_re[fs2] = val[fs2].real; vec_hrtf_im[fs2] = 0.0f; + for(i = fs2+1; i < fftsize; i++) + { + vec_hrtf_re[i] = 0.0f; + vec_hrtf_im[i] = 0.0f; + } } *************** *** 1032,1036 **** } else ! post("bin_ambi_reduced_decode-ERROR: ambi_weight needs %d float weights", x->x_n_order); } --- 1034,1038 ---- } else ! post("bin_ambi_reduced_decode-ERROR: ambi_weight needs %d float weights", x->x_n_order+1); } *************** *** 1082,1091 **** t_bin_ambi_reduced_decode *x = (t_bin_ambi_reduced_decode *)pd_new(bin_ambi_reduced_decode_class); char buf[400]; ! int i, j, fftok; ! int n_order, n_dim, n_ambi, fftsize, prefix; ! t_symbol *s_hrir; ! t_symbol *s_hrtf_re; ! t_symbol *s_hrtf_im; ! t_symbol *s_fade_out_hrir; if((argc >= 8) && --- 1084,1093 ---- t_bin_ambi_reduced_decode *x = (t_bin_ambi_reduced_decode *)pd_new(bin_ambi_reduced_decode_class); char buf[400]; ! int i, j, fftok, ok=0; ! int n_order=0, n_dim=0, n_ambi=0, fftsize=0, prefix=0; ! t_symbol *s_hrir=gensym("L_HRIR"); ! t_symbol *s_hrtf_re=gensym("HRTF_re"); ! t_symbol *s_hrtf_im=gensym("HRTF_im"); ! t_symbol *s_fade_out_hrir=gensym("HRIR_win"); if((argc >= 8) && *************** *** 1110,1113 **** --- 1112,1143 ---- fftsize = (int)atom_getintarg(7, argc, argv); + ok = 1; + } + else if((argc >= 8) && + IS_A_FLOAT(argv,0) && + IS_A_FLOAT(argv,1) && + IS_A_FLOAT(argv,2) && + IS_A_FLOAT(argv,3) && + IS_A_FLOAT(argv,4) && + IS_A_FLOAT(argv,5) && + IS_A_FLOAT(argv,6) && + IS_A_FLOAT(argv,7)) + { + prefix = (int)atom_getintarg(0, argc, argv); + + s_hrir = gensym("L_HRIR"); + s_hrtf_re = gensym("HRTF_re"); + s_hrtf_im = gensym("HRTF_im"); + s_fade_out_hrir = gensym("HRIR_win"); + + n_order = (int)atom_getintarg(5, argc, argv); + n_dim = (int)atom_getintarg(6, argc, argv); + fftsize = (int)atom_getintarg(7, argc, argv); + + ok = 1; + } + + if(ok) + { if(n_order < 1) n_order = 1; *************** *** 1142,1146 **** { fftsize = 512; ! post("bin_ambi_reduced_decode-ERROR: fftsize not equal to 2 ^ n !!!"); } --- 1172,1177 ---- { fftsize = 512; ! post("bin_ambi_reduced_decode-WARNING: fftsize not equal to 2 ^ n !!!"); ! post(" fftsize set to %d", fftsize); } *************** *** 1212,1217 **** { post("bin_ambi_reduced_decode-ERROR: need 1 float + 4 symbols + 3 floats arguments:"); ! post(" prefix + hrir_name + hrtf_re_name + hrtf_im_name + hrir_fade_out_name +"); ! post(" ambi_order + ambi_dimension + fftsize"); return(0); } --- 1243,1248 ---- { post("bin_ambi_reduced_decode-ERROR: need 1 float + 4 symbols + 3 floats arguments:"); ! post(" prefix(unique-number) + hrir_name + hrtf_re_name + hrtf_im_name + hrir_fade_out_name +"); ! post(" + ambi_order + ambi_dimension + fftsize"); return(0); } Index: iemlib.h =================================================================== RCS file: /cvsroot/pure-data/externals/iem/iem_bin_ambi/src/iemlib.h,v retrieving revision 1.1 retrieving revision 1.2 diff -C2 -d -r1.1 -r1.2 *** iemlib.h 1 Mar 2006 11:46:46 -0000 1.1 --- iemlib.h 9 Mar 2006 15:56:05 -0000 1.2 *************** *** 2,6 **** * WARRANTIES, see the file, "LICENSE.txt," in this distribution. ! iem_bin_ambi written by Thomas Musil, Copyright (c) IEM KUG Graz Austria 2000 - 2003 */ #ifndef __IEMLIB_H__ --- 2,6 ---- * WARRANTIES, see the file, "LICENSE.txt," in this distribution. ! iemlib.h written by Thomas Musil, Copyright (c) IEM KUG Graz Austria 2000 - 2005 */ #ifndef __IEMLIB_H__ *************** *** 34,52 **** #define UNITBIT32 1572864. /* 3*2^19; bit 32 has place value 1 */ ! /* machine-dependent definitions. These ifdefs really ! should have been by CPU type and not by operating system! */ #ifdef IRIX ! /* big-endian. Most significant byte is at low address in memory */ #define HIOFFSET 0 /* word offset to find MSB */ #define LOWOFFSET 1 /* word offset to find LSB */ #define int32 long /* a data type that has 32 bits */ #else ! #ifdef NT ! /* little-endian; most significant byte is at highest address */ #define HIOFFSET 1 #define LOWOFFSET 0 #define int32 long #else ! #ifdef __linux__ #include <endian.h> --- 34,64 ---- #define UNITBIT32 1572864. /* 3*2^19; bit 32 has place value 1 */ ! /* machine-dependent definitions. These ifdefs really ! should have been by CPU type and not by operating system! */ #ifdef IRIX ! /* big-endian. Most significant byte is at low address in memory */ #define HIOFFSET 0 /* word offset to find MSB */ #define LOWOFFSET 1 /* word offset to find LSB */ #define int32 long /* a data type that has 32 bits */ #else ! #ifdef MSW ! /* little-endian; most significant byte is at highest address */ #define HIOFFSET 1 #define LOWOFFSET 0 #define int32 long #else ! #ifdef __FreeBSD__ ! #include <machine/endian.h> ! #if BYTE_ORDER == LITTLE_ENDIAN ! #define HIOFFSET 1 ! #define LOWOFFSET 0 ! #else ! #define HIOFFSET 0 /* word offset to find MSB */ ! #define LOWOFFSET 1 /* word offset to find LSB */ ! #endif /* BYTE_ORDER */ ! #include <sys/types.h> ! #define int32 int32_t ! #endif ! #ifdef __linux__ #include <endian.h> *************** *** 55,59 **** #error No byte order defined #endif ! #if __BYTE_ORDER == __LITTLE_ENDIAN #define HIOFFSET 1 --- 67,71 ---- #error No byte order defined #endif ! #if __BYTE_ORDER == __LITTLE_ENDIAN #define HIOFFSET 1 *************** *** 67,79 **** #define int32 int32_t #endif /* __linux__ */ ! #endif /* NT */ #endif /* SGI */ union tabfudge { ! double tf_d; ! int32 tf_i[2]; }; #endif --- 79,102 ---- #define int32 int32_t + #else + #ifdef __APPLE__ + #define HIOFFSET 0 /* word offset to find MSB */ + #define LOWOFFSET 1 /* word offset to find LSB */ + #define int32 int /* a data type that has 32 bits */ + + #endif /* __APPLE__ */ #endif /* __linux__ */ ! #endif /* MSW */ #endif /* SGI */ union tabfudge { ! double tf_d; ! int32 tf_i[2]; }; + #define IEM_DENORMAL(f) ((((*(unsigned int*)&(f))&0x60000000)==0) || \ + (((*(unsigned int*)&(f))&0x60000000)==0x60000000)) + /* more stringent test: anything not between 1e-19 and 1e19 in absolute val */ + #endif --- NEW FILE: bin_ambi_reduced_decode_fir.c --- /* For information on usage and redistribution, and for a DISCLAIMER OF ALL * WARRANTIES, see the file, "LICENSE.txt," in this distribution. iem_bin_ambi written by Thomas Musil, Copyright (c) IEM KUG Graz Austria 2000 - 2005 */ #ifdef NT #pragma warning( disable : 4244 ) #pragma warning( disable : 4305 ) #endif #include "m_pd.h" #include "iemlib.h" #include "iem_bin_ambi.h" #include <math.h> #include <stdio.h> #include <string.h> [...1346 lines suppressed...] class_addmethod(bin_ambi_reduced_decode_fir_class, (t_method)bin_ambi_reduced_decode_fir_sing_range, gensym("sing_range"), A_DEFFLOAT, 0); class_sethelpsymbol(bin_ambi_reduced_decode_fir_class, gensym("iemhelp2/help-bin_ambi_reduced_decode_fir")); } /* Reihenfolge: n_ls x bin_ambi_reduced_decode_fir_ls bin_ambi_reduced_decode_fir_calc_pinv n_ls x bin_ambi_reduced_decode_fir_load_HRIR n_ls x bin_ambi_reduced_decode_fir_check_HRIR_arrays n_ambi x bin_ambi_reduced_decode_fir_check_HRTF_arrays n_ambi x bin_ambi_reduced_decode_fir_calc_reduced bin_ambi_reduced_decode_fir_calc_sym */ --- NEW FILE: bin_ambi_reduced_decode_fft.c --- /* For information on usage and redistribution, and for a DISCLAIMER OF ALL * WARRANTIES, see the file, "LICENSE.txt," in this distribution. iem_bin_ambi written by Thomas Musil, Copyright (c) IEM KUG Graz Austria 2000 - 2005 */ #ifdef NT #pragma warning( disable : 4244 ) #pragma warning( disable : 4305 ) #endif #include "m_pd.h" #include "iemlib.h" #include "iem_bin_ambi.h" #include <math.h> #include <stdio.h> #include <string.h> [...1473 lines suppressed...] class_addmethod(bin_ambi_reduced_decode_fft_class, (t_method)bin_ambi_reduced_decode_fft_sing_range, gensym("sing_range"), A_DEFFLOAT, 0); class_sethelpsymbol(bin_ambi_reduced_decode_fft_class, gensym("iemhelp2/help-bin_ambi_reduced_decode_fft")); } /* Reihenfolge: n_ls x bin_ambi_reduced_decode_fft_ls bin_ambi_reduced_decode_fft_calc_pinv n_ls x bin_ambi_reduced_decode_fft_load_HRIR n_ls x bin_ambi_reduced_decode_fft_check_HRIR_arrays n_ambi x bin_ambi_reduced_decode_fft_check_HRTF_arrays n_ambi x bin_ambi_reduced_decode_fft_calc_reduced bin_ambi_reduced_decode_fft_calc_sym */ Index: bin_ambi_calc_HRTF.c =================================================================== RCS file: /cvsroot/pure-data/externals/iem/iem_bin_ambi/src/bin_ambi_calc_HRTF.c,v retrieving revision 1.1 retrieving revision 1.2 diff -C2 -d -r1.1 -r1.2 *** bin_ambi_calc_HRTF.c 1 Mar 2006 11:46:46 -0000 1.1 --- bin_ambi_calc_HRTF.c 9 Mar 2006 15:56:05 -0000 1.2 *************** *** 2,6 **** * WARRANTIES, see the file, "LICENSE.txt," in this distribution. ! iem_bin_ambi written by Thomas Musil, Copyright (c) IEM KUG Graz Austria 2000 - 2003 */ #ifdef NT --- 2,6 ---- * WARRANTIES, see the file, "LICENSE.txt," in this distribution. ! iem_bin_ambi written by Thomas Musil, Copyright (c) IEM KUG Graz Austria 2000 - 2005 */ #ifdef NT *************** *** 70,74 **** f = g * (float)i; (*sincos).real = cos(f); ! (*sincos).imag = sin(f);/*change*/ sincos++; } --- 70,74 ---- f = g * (float)i; (*sincos).real = cos(f); ! (*sincos).imag = -sin(f);/*FFT*/ sincos++; }

1 0

externals/iem/iemmatrix/tests runtests.bat,NONE,1.1
by musil 09 Mar '06

09 Mar '06

Update of /cvsroot/pure-data/externals/iem/iemmatrix/tests In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv368/iem/iemmatrix/tests Added Files: runtests.bat Log Message: run test-suite on w32 --- NEW FILE: runtests.bat --- rem RUN TEST SUITE set PATH=%PATH%;C:\Programme\pd\bin\ pd -lib ..\iemmatrix -path ..\abs -nogui runtests_nogui.pd > runtests.log 2>&1

1 0

← Newer
1
...
19
20
21
22
23
24
25
...
28
Older →

Jump to page:

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

Pd-cvs March 2006