ACDF_v3/0040777000000000000000000000000013637130270007123 5ustar00ACDF_v3/ACDf.cpp0100777000000000000000000003773513637130321010400 0ustar00/* ACDf LADSPA plugin, version 3.0 Copyright 2019 Charlie Laub, GPLv3 ACDf is a LADSPA plugin for implementing filters for loudspeaker crossovers as described in the Active Crossover Designer tools, a set of Excel tools for designing crossovers based on driver measurements. See the documentation that accompanies this code or the Active Crossover Designer web site for information on how to call this plugin correctly. 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 3 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, see . CREDITS: Much of the code here was adapted from previous work by: Matthias Nagorni (VCF filters) Richard Taylor (rt-plugins) Steve Harris (swh-plugins) */ #include #include #define _USE_MATH_DEFINES #include #include #include #include using namespace std; #define D_(s) (s) #define DENORMALKILLER 1.e-15; //1.e-15 corresponds to -300dB //DENORMALKILLER is added to the filter output to avoid denormal values that //may slow the calculation on some hardware when very small values are //produced. The added signal is a square wave at the Nyquist frequency. //order of parameters: #define ACDf_TYPE 0 #define ACDf_POLARITY 1 #define ACDf_GAIN 2 #define ACDf_FP 3 #define ACDf_QP 4 #define ACDf_FZ 5 #define ACDf_QZ 6 #define ACDf_INPUT 7 #define ACDf_OUTPUT 8 static LADSPA_Descriptor *ACDfDescriptor = NULL; typedef struct { double dn; double x1, x2, y1, y2; double b0, b1, b2, a1, a2; } biquad; typedef struct { LADSPA_Data *type; LADSPA_Data *polarity; LADSPA_Data *gain; LADSPA_Data *Fp; LADSPA_Data *Qp; LADSPA_Data *Fz; LADSPA_Data *Qz; LADSPA_Data rate; biquad * filter; LADSPA_Data *input; LADSPA_Data *output; } ACDf; const LADSPA_Descriptor *ladspa_descriptor(unsigned long index) { switch (index) { case 0: return ACDfDescriptor; default: return NULL; } } LADSPA_Handle instantiateACDf(const LADSPA_Descriptor *descriptor, unsigned long sample_rate) { ACDf *pluginData = (ACDf *)malloc(sizeof(ACDf)); pluginData->rate = (LADSPA_Data)sample_rate; biquad *f = NULL; f = (biquad *)malloc(sizeof(biquad)); pluginData->filter = f; return (LADSPA_Handle)pluginData; } void connectPortACDf(LADSPA_Handle instance, unsigned long port, LADSPA_Data *data) { ACDf *pluginData = (ACDf *)instance; switch (port) { case ACDf_TYPE: pluginData->type = data; break; case ACDf_POLARITY: pluginData->polarity = data; break; case ACDf_GAIN: pluginData->gain = data; break; case ACDf_FP: pluginData->Fp = data; break; case ACDf_QP: pluginData->Qp = data; break; case ACDf_FZ: pluginData->Fz = data; break; case ACDf_QZ: pluginData->Qz = data; break; case ACDf_INPUT: pluginData->input = data; break; case ACDf_OUTPUT: pluginData->output = data; break; } } void activateACDf(LADSPA_Handle instance) { ACDf *pluginData = (ACDf *)instance; biquad *f = pluginData->filter; const LADSPA_Data ftype = *(pluginData->type); const LADSPA_Data fpolarity = *(pluginData->polarity); const LADSPA_Data dBgain = *(pluginData->gain); double Fp = *(pluginData->Fp); double Qp = *(pluginData->Qp); double Fz = *(pluginData->Fz); double Qz = *(pluginData->Qz); const LADSPA_Data SR = pluginData->rate; //initialize some values... f->x1 = 0.0; f->x2 = 0.0; f->y1 = DENORMALKILLER; f->y2 = DENORMALKILLER; f->dn = DENORMALKILLER; /* ====== BEGIN CODE TO CALCULATE FILTER TRANSFER FUNCTION COEFFICIENTS ========== */ double Aa0, Aa1, Aa2, Ab0, Ab1, Ab2; //analog TF coefficients double Da0, Da1, Da2, Db0, Db1, Db2; //IIR digital TF coefficients double voltage_gain; //voltage gain double p_voltage_gain; //voltage gain including polarity double Wp, Wz, Wp2, Wz2; //for analog radian frequency bool reversed_polarity = false; const double K = 2.0*SR; const double K2 = K*K; int type; //type is used internally to select filter type = roundf((float)ftype); //round to nearest integer voltage_gain = pow(10.0,(0.05*dBgain)); //calculate voltage gain p_voltage_gain = voltage_gain; //if reverse polarity is indicated, multiply p_voltage_gain by -1 if (( fpolarity < -0.99 ) && (fpolarity > -1.01 )) { p_voltage_gain *= -1.0; reversed_polarity = true; } //error checking : // if parameters are invalid, return silence. if ( (Fp > 0.5*SR) || (Fp < 0) ) type = -1; if ( (Fz > 0.5*SR) || (Fz < 0) ) type = -1; //calculate analog domain radian frequencies Wp = 2.0*M_PI*Fp; Wz = 2.0*M_PI*Fz; //apply pre-warping Wp = K*tan( Wp/K ); Wz = K*tan( Wz/K ); //calculate square of pre-warped radian frequencies Wp2 = Wp*Wp; Wz2 = Wz*Wz; //initialize these analog coefficient values to zero Aa1 = Aa2 = Ab0 = Ab1 = Ab2 = 0.0; //and initialize the value of analog coefficient a0 to 1.0 Aa0 = 1.0; switch (type) { case 0: //gain with polarity Ab0 = p_voltage_gain; break; case 1: //1st order lowpass filter with gain and polarity Ab0 = Wp * p_voltage_gain; Aa1 = 1.0; Aa0 = Wp; break; case 2: //1st order highpass filter with gain and polarity Ab1 = p_voltage_gain; Aa1 = 1.0; Aa0 = Wp; break; case 3: //first order all-pass filter with polarity Ab1 = 1.0; Ab0 = -1.0 * Wp; if (reversed_polarity) { Ab1 *= -1.0; Ab0 *= -1.0; } Aa1 = 1.0; Aa0 = Wp; break; case 4: //1st order low shelf specified by gain, polarity, and Fp (used as center of shelf) Wz = Wp * pow(10.0,(dBgain/40.0)); Wp = Wp2 / Wz; Ab1 = 1.0; Ab0 = Wz; if (reversed_polarity) { Ab1 *= -1.0; Ab0 *= -1.0; } Aa1 = 1.0; Aa0 = Wp; break; case 5: //1st order high shelf specified by gain, polarity, and Fp (used as center of shelf) Wz = Wp * pow(10.0,(-dBgain/40.0)); Wp = Wp2 / Wz; Ab1 = 1.0 * voltage_gain; Ab0 = Wz * voltage_gain; if (reversed_polarity) { Ab1 *= -1.0; Ab0 *= -1.0; } Aa1 = 1.0; Aa0 = Wp; break; case 21: //2nd order lowpass filter specified by gain, polarity, Fp, Qp Ab0 = p_voltage_gain * Wp2; Aa2 = 1.0; Aa1 = Wp/Qp; Aa0 = Wp2; break; case 22: //2nd order highpass filter specified by gain, polarity, Fp, Qp Ab2 = p_voltage_gain; Aa2 = 1.0; Aa1 = Wp/Qp; Aa0 = Wp2; break; case 23: //2nd order all-pass filter specified by gain, polarity, Fp, Qp Ab2 = 1.0; Ab1 = -1.0 * Wp/Qp; Ab0 = Wp2; if (reversed_polarity) { Ab2 *= -1.0; Ab1 *= -1.0; Ab0 *= -1.0; } Aa2 = 1.0; Aa1 = Wp/Qp; Aa0 = Wp2; break; case 24: //2nd order low shelf specified by Fp (used as center of shelf), gain, Q, and polarity Qz = Qp; Wz = Wp * pow(10.0,(dBgain/80.0)); Wp = Wp2 / Wz; Wz2 = Wz*Wz; Wp2 = Wp*Wp; Ab2 = 1.0; Ab1 = Wz/Qz; Ab0 = Wz2; if (reversed_polarity) { Ab2 *= -1.0; Ab1 *= -1.0; Ab0 *= -1.0; } Aa2 = 1.0; Aa1 = Wp/Qp; Aa0 = Wp2; break; case 25: //2nd order high shelf specified by Fp (used as center of shelf), gain, Q, and polarity Qz = Qp; Wz = Wp * pow(10.0,(-dBgain/80.0)); Wp = Wp2 / Wz; Wz2 = Wz*Wz; Wp2 = Wp*Wp; Ab2 = voltage_gain; Ab1 = voltage_gain * Wz/Qz; Ab0 = voltage_gain * Wz2; if (reversed_polarity) { Ab2 *= -1.0; Ab1 *= -1.0; Ab0 *= -1.0; } Aa2 = 1.0; Aa1 = Wp/Qp; Aa0 = Wp2; break; case 26: //parametric EQ specified by gain, Fp, Qp Ab2 = 1.0; Ab1 = Wp/Qp; if (voltage_gain > 1.0) Ab1 *= voltage_gain; Ab0 = Wp2; Aa2 = 1.0; Aa1 = Wp/Qp; if (voltage_gain < 1.0) Aa1 /= voltage_gain; Aa0 = Wp2; break; case 27: //2nd order notch specified by gain, polarity, Fp, Qp, Fz Ab2 = p_voltage_gain; Ab0 = p_voltage_gain * Wz2; Aa2 = 1.0; Aa1 = Wp/Qp; Aa0 = Wp2; break; case 28: //general biquadratic filter specified by gain, polarity, Fp,Qp,Fz,Qz Ab2 = p_voltage_gain; Ab1 = p_voltage_gain * Wz/Qz; Ab0 = p_voltage_gain * Wz2; Aa2 = 1.0; Aa1 = Wp/Qp; Aa0 = Wp2; break; default: //if user supplies a non-supported filter type silence is returned type = -1; } //end switch-case, done computing analog transfer function coefficients //special case for type=0 and error condition (type = -1) if (type < 1) { Db0 = p_voltage_gain; if(type == -1) Db0 = 0.0; Db1 = Db2 = Da1 = Da2 = 0.0; } else { //convert the analog TF coefficients to z^-1 domain TF coefficients Db0 = Ab2*K2 + Ab1*K + Ab0; Db1 = 2.0*Ab0 - 2.0*Ab2*K2; Db2 = Ab2*K2 - Ab1*K + Ab0; Da0 = Aa2*K2 + Aa1*K + Aa0; Da1 = 2.0*Aa0 - 2.0*Aa2*K2; Da2 = Aa2*K2 - Aa1*K + Aa0; //convert to normalized form by dividing thru by Da0: Db0 /= Da0; Db1 /= Da0; Db2 /= Da0; Da1 /= Da0; Da2 /= Da0; } //copy into respective plugin filter variables f->b0 = Db0; f->b1 = Db1; f->b2 = Db2; f->a1 = Da1; f->a2 = Da2; //save the transfer function parameters into the plugin filter object pluginData->filter = f; /* ======= END CODE TO CALCULATE FILTER TRANSFER FUNCTION COEFFICIENTS =========== */ } //end activateACDf void runACDf(LADSPA_Handle instance, unsigned long sample_count) { ACDf *pluginData = (ACDf *)instance; const LADSPA_Data *input = pluginData->input; LADSPA_Data *output = pluginData->output; biquad *f = pluginData->filter; double x,y; unsigned long pos; for (pos = 0; pos < sample_count; pos++) { x = (double)input[pos]; y = f->b0 * x + f->b1 * f->x1 + f->b2 * f->x2 - f->a1 * f->y1 - f->a2 * f->y2 + f->dn; f->dn = -f->dn; f->x2 = f->x1; f->x1 = x; f->y2 = f->y1; f->y1 = y; output[pos] = (LADSPA_Data)y; } } //end runACDf. void cleanupACDf(LADSPA_Handle instance) { ACDf *pluginData = (ACDf *)instance; free(pluginData->filter); free(instance); } static class Initialiser { public: Initialiser() { char **port_names; LADSPA_PortDescriptor *port_descriptors; LADSPA_PortRangeHint *port_range_hints; ACDfDescriptor = (LADSPA_Descriptor *)malloc(sizeof(LADSPA_Descriptor)); if (ACDfDescriptor) { std::string text; //plugin descriptor info ACDfDescriptor->UniqueID = 5221; ACDfDescriptor->Label = "ACDf"; ACDfDescriptor->Properties = LADSPA_PROPERTY_HARD_RT_CAPABLE; text = "ACDf v3.0: Active Crossover Designer LADSPA filters"; ACDfDescriptor->Name = strdup(text.c_str()); ACDfDescriptor->Maker = "Charlie Laub, 2019"; ACDfDescriptor->Copyright = "GPLv3"; ACDfDescriptor->PortCount = 9; //create storage for port_descriptors, port_range_hints, and port_names port_descriptors = (LADSPA_PortDescriptor *)calloc(9,sizeof(LADSPA_PortDescriptor)); ACDfDescriptor->PortDescriptors = (const LADSPA_PortDescriptor *)port_descriptors; port_range_hints = (LADSPA_PortRangeHint *)calloc(9,sizeof(LADSPA_PortRangeHint)); ACDfDescriptor->PortRangeHints = (const LADSPA_PortRangeHint *)port_range_hints; port_names = (char **)calloc(9, sizeof(char*)); ACDfDescriptor->PortNames = (const char **)port_names; //done creating storage. now set the descriptor, range_hints, and name for each port: //port = ACDf_TYPE port_descriptors[ACDf_TYPE] = LADSPA_PORT_INPUT | LADSPA_PORT_CONTROL; text = "type"; port_names[ACDf_TYPE] = strdup(text.c_str()); port_range_hints[ACDf_TYPE].HintDescriptor = LADSPA_HINT_BOUNDED_BELOW | LADSPA_HINT_BOUNDED_ABOVE | LADSPA_HINT_DEFAULT_0; port_range_hints[ACDf_TYPE].LowerBound = 0; port_range_hints[ACDf_TYPE].UpperBound = 28; //port = ACDf_POLARITY port_descriptors[ACDf_POLARITY] = LADSPA_PORT_INPUT | LADSPA_PORT_CONTROL; text = "polarity"; port_names[ACDf_POLARITY] = strdup(text.c_str()); port_range_hints[ACDf_POLARITY].HintDescriptor = LADSPA_HINT_BOUNDED_BELOW | LADSPA_HINT_BOUNDED_ABOVE | LADSPA_HINT_DEFAULT_1; port_range_hints[ACDf_POLARITY].LowerBound = -1; port_range_hints[ACDf_POLARITY].UpperBound = 1; //port = ACDf_GAIN port_descriptors[ACDf_GAIN] = LADSPA_PORT_INPUT | LADSPA_PORT_CONTROL; text = "db"; port_names[ACDf_GAIN] = strdup(text.c_str()); port_range_hints[ACDf_GAIN].HintDescriptor = LADSPA_HINT_BOUNDED_BELOW | LADSPA_HINT_BOUNDED_ABOVE | LADSPA_HINT_DEFAULT_0; port_range_hints[ACDf_GAIN].LowerBound = -99; port_range_hints[ACDf_GAIN].UpperBound = 99; //port = ACDf_FP port_descriptors[ACDf_FP] = LADSPA_PORT_INPUT | LADSPA_PORT_CONTROL; text = "fp"; port_names[ACDf_FP] = strdup(text.c_str()); port_range_hints[ACDf_FP].HintDescriptor = LADSPA_HINT_BOUNDED_BELOW | LADSPA_HINT_BOUNDED_ABOVE | LADSPA_HINT_DEFAULT_440; port_range_hints[ACDf_FP].LowerBound = 1; port_range_hints[ACDf_FP].UpperBound = 100000; //port = ACDf_QP port_descriptors[ACDf_QP] = LADSPA_PORT_INPUT | LADSPA_PORT_CONTROL; text = "qp"; port_names[ACDf_QP] = strdup(text.c_str()); port_range_hints[ACDf_QP].HintDescriptor = LADSPA_HINT_BOUNDED_BELOW | LADSPA_HINT_BOUNDED_ABOVE | LADSPA_HINT_DEFAULT_1; port_range_hints[ACDf_QP].LowerBound = 0.01; port_range_hints[ACDf_QP].UpperBound = 100; //port = ACDf_FZ port_descriptors[ACDf_FZ] = LADSPA_PORT_INPUT | LADSPA_PORT_CONTROL; text = "fz"; port_names[ACDf_FZ] = strdup(text.c_str()); port_range_hints[ACDf_FZ].HintDescriptor = LADSPA_HINT_BOUNDED_BELOW | LADSPA_HINT_BOUNDED_ABOVE | LADSPA_HINT_DEFAULT_440; port_range_hints[ACDf_FZ].LowerBound = 1; port_range_hints[ACDf_FZ].UpperBound = 100000; //port = ACDf_QZ port_descriptors[ACDf_QZ] = LADSPA_PORT_INPUT | LADSPA_PORT_CONTROL; text = "qz"; port_names[ACDf_QZ] = strdup(text.c_str()); port_range_hints[ACDf_QZ].HintDescriptor = LADSPA_HINT_BOUNDED_BELOW | LADSPA_HINT_BOUNDED_ABOVE | LADSPA_HINT_DEFAULT_1; port_range_hints[ACDf_QZ].LowerBound = 0.01; port_range_hints[ACDf_QZ].UpperBound = 100; //port = ACDf_INPUT port_descriptors[ACDf_INPUT] = LADSPA_PORT_INPUT | LADSPA_PORT_AUDIO; text = "Input"; port_names[ACDf_INPUT] = strdup(text.c_str()); //port_range_hints[ACDf_INPUT].HintDescriptor = LADSPA_HINT_BOUNDED_BELOW | LADSPA_HINT_BOUNDED_ABOVE; //port_range_hints[ACDf_INPUT].LowerBound = -1.0; //port_range_hints[ACDf_INPUT].UpperBound = +1.0; //port = ACDf_OUTPUT port_descriptors[ACDf_OUTPUT] = LADSPA_PORT_OUTPUT | LADSPA_PORT_AUDIO; text = "Output"; port_names[ACDf_OUTPUT] = strdup(text.c_str()); //port_range_hints[ACDf_OUTPUT].HintDescriptor = LADSPA_HINT_BOUNDED_BELOW | LADSPA_HINT_BOUNDED_ABOVE; //port_range_hints[ACDf_OUTPUT].LowerBound = -1.0; //port_range_hints[ACDf_OUTPUT].UpperBound = +1.0; ACDfDescriptor->activate = activateACDf; ACDfDescriptor->cleanup = cleanupACDf; ACDfDescriptor->connect_port = connectPortACDf; ACDfDescriptor->deactivate = NULL; ACDfDescriptor->instantiate = instantiateACDf; ACDfDescriptor->run = runACDf; ACDfDescriptor->run_adding = NULL; ACDfDescriptor->set_run_adding_gain = NULL; } } ~Initialiser() { if (ACDfDescriptor) { free((LADSPA_PortDescriptor *)ACDfDescriptor->PortDescriptors); free((char **)ACDfDescriptor->PortNames); free((LADSPA_PortRangeHint *)ACDfDescriptor->PortRangeHints); free(ACDfDescriptor); } } } g_theInitialiser; ACDF_v3/ACDf_usage_notes.txt0100777000000000000000000002072113637130162013017 0ustar00Usage Notes for LADSPA plugin ACDf version 3.0 October 2019 Charlie Laub Info: The ACDf LADSPA plugin can implement a wide variety of first and second order filters. ACD refers to the Active Crossover Designer, a set of Excel based tools for designing active crossovers for loudspeakers using acoustic measurements of the system. ACD can be found on the web at: http://audio.claub.net/software/ACD/ACD.html LADSPA is a platform for implementing audio processing algorithms as "plugins" that are called by a host program. Some examples of host programs include ecasound (Linux), ALSA (Linux), and Gstreamer (Linux and Windows). Before use, plugins must be compiled for the operating system under which the host is running. This process is is simplified using a makefile. ================================================================================ Using the LADSPA ACDf plugin: ACDf is invoked using a LADSPA host. The exact syntax is host dependent. Up to seven parameters are used to describe the filter. The parameters control the behavior of each filter: PARAMETER WHAT IT DOES type indicates which filter type to implement (see below) dB passband gain for the filter in dB, or PEQ band gain polarity -1 reverses polarity. polarity is unchanged for any other number fp sets the frequency of the filter pole in Hz qp sets the Q factor of the filter pole fz sets the frequency of the filter zero in Hz qz sets the Q factor of the filter zero NOTE: Most filter types can be described using only a few of the 7 parameters. The following table lists which parameters should be specified for each filter type: ACDf filter types and their required parameters: TYPE DESCRIPTION REQUIRED PARAMETERS 0 gain block db, polarity 1 1st order LP db, polarity, fp 2 1st order HP db, polarity, fp 3 1st order AP polarity, fp 4 1st low shelf fp, db 5 1st high shelf fp, db 21 2nd order LP db, polarity, fp, qp, 22 2nd order HP db, polarity, fp, qp 23 2nd order AP polarity, fp, qp 24 2nd order low shelf db, polarity, fp, qp 25 2nd order high shelf db, polarity, fp, qp 26 parametric EQ db, fp, qp 27 2nd order notch db, polarity, fp, qp, fz 28 biquadratic filter db, polarity, fp, qp, fz, qz SHELF FILTERS: For filter types 4,5 and 24,25 the value supplied for "fp" is used to set the center frequency of the shelf transition. For the '2nd order low shelf' and '2nd order high shelf' the value suppied as qp determines the Q value where the filter curve enters and leaves the transition. To reproduce a 2nd order shelf filter with asymmetric shapes use the general biquadratic filter (type 28) and specify qp and qz separately. For additional information on filters please refer to the Active Crossover Designer technical manual. Each parameter has a default value if none is provided by the user. The following table lists the default values: PARAMETER DEFAULT VALUE type 0 (gain block) dB 0 (no gain or cut) polarity 1 (normal polarity) fp 440 Hz qp 1.0 fz 440 Hz qz 1.0 ================================================================================ Some hints for constructing loudspeaker crossovers: Loudspeaker crossovers are often known by names such as Butterworth, Linkwitz- Riley, etc. These are simply combinations of first and second order filters with specific Qp values for the second order stage(s). The following provides a guide for constructing some of the more common crossover types: 1st order Q Q Q Q LR2 0.5 BUT2 0.707 BUT3 X 1.0 LR4 0.707 0.707 BUT4 0.54 1.31 BUT5 X 0.62 1.62 LR6 0.5 1.0 1.0 BUT6 0.52 0.707 1.93 BUT7 X 0.55 0.8 2.24 LR8 0.54 0.54 1.31 1.31 BUT8 0.51 0.6 0.9 2.56 In the table above, the column '1st order' indicates whether a first order stage is used to construct the named higher order filter. The columns labeled 'Q' indicate the pole Q (Qp) value for each second order filter used. The Fp of each ACDf filter is set equal to the "corner frequency" of the overall filter for the Linkwitz-Riley and Butterworth filter types. ================================================================================ Examples using ecasound: Under the LADSPA host ecasound, a LADSPA plugin is specified by using -el: followed by the plugin name and its parameters as a comma separated list. Example: -el:ACDf,0,1,2,3,4,5,6,7 It's good practice to explicitly provide all ACDf parameters under ecasound. In examples A through D, below, the -el: has been omitted. A. A second order Butterworth high-pass filter having a corner frequency of 500 Hz, no gain, and normal polarity: ACDf, 2, 1, 0, 500, 0.7071, 0, 0 B. A fourth order Linkwitz-Riley high-pass filter at 2.2kHz with -6dB of gain and normal polarity. From the table we can see that the LR4 type does not use a first order filter but uses two second order filters, each having a Qp of 0.707. The LR4 HP filter is constructed using two ACDf filters of type 22: ACDf, 22, 0, -6, 2200, 0.7071, 0, 0 ACDf, 22, 0, 0, 2200, 0.7071, 0, 0 The signal should be routed through both filters by the calling program, in series. To provide an overall gain of -6dB the first filter has been assigned a gain of -6dB and the second a gain of 0dB. Other combinations of gain that sum to -6dB are equally valid. C. A third order Butterworth low-pass filter having a corner frequency of 750Hz, reversed polarity, and no gain. From the table, we see that a BUT3 filter uses a first order filter plus a second order filter with Qp=1. The BUT3 filter is constructed from these two ACDf filters: ACDf, 1, -1, 0, 750, 0, 0, 0 ACDf, 21, 1, 0, 750, 1, 0, 0 To create the overall reversed polarity the first ACDf filter has reversed polarity and the second has normal polarity. D. A 7th order Butterworth low-pass filter at 90Hz with normal polarity and no gain. ACDf, 1, 0, 0, 90, 0, 0, 0 <-- first order LP stage @ 90Hz ACDf, 21, 0, 0, 90, 0.55, 0, 0 <-- second order LP stage @ 90Hz, Qp=0.55 ACDf, 21, 0, 0, 90, 0.80, 0, 0 <-- second order LP stage @ 90Hz, Qp=0.80 ACDf, 21, 0, 0, 90, 2.24, 0, 0 <-- second order LP stage @ 90Hz, Qp=2.24 The signal should be routed through all four filters by the calling program, in series. ================================================================================ Examples using Gstreamer: Under Gstreamer, LADSPA plugins are invoked in a different way. Gstreamer converts each plugin name to a Gstreamer element name by compounding it with "ladspa" and parts of the plugin name. For example, in my current system ACDf is listed as ladspa-acdf-v3-so-acdf-v3. If Gstreamer is installed on your system you can list all the available LADSPA plugins using the command: gst-inspect-1.0 ladspa To implement the plugin as a pipeline element under gst-launch, you provide the element name and then a list of space-delimited parameter names and values, separated by the equals sign, for which you would like to set the value to be different than the default value. See the table above for the default values for each parameter. When multiple filters are required, you separate each filter with the "!" character. The "\" character allows continuation on the next line. The following filter examples A through D are identical to the section above: A. ladspa-acdf-v3-so-acdf-v3 type=2 fp=500 qp=0.7071 B. ladspa-acdf-v3-so-acdf-v3 type=22 db=-6 fp=2200 qp=0.7071 ! \ ladspa-acdf-v3-so-acdf-v3 type=22 fp=2200 qp=0.7071 C. ladspa-acdf-v3-so-acdf-v3 type=1 polarity=-1 fp=750 ! \ ladspa-acdf-v3-so-acdf-v3 type=21 fp=750 qp=1 D. ladspa-acdf-v3-so-acdf-v3 type=1 fp=90 ! \ ladspa-acdf-v3-so-acdf-v3 type=21 fp=90 qp=0.55 ! \ ladspa-acdf-v3-so-acdf-v3 type=21 fp=90 qp=0.80 ! \ ladspa-acdf-v3-so-acdf-v3 type=21 fp=90 qp=2.24 Bug reports and Other Feedback ~~~~~~~~~~~ Please send suggestions for improvements, bug reports, or comments to: ACD@claub.net ACDF_v3/LICENSE0100777000000000000000000010451412144107560010133 0ustar00 GNU GENERAL PUBLIC LICENSE Version 3, 29 June 2007 Copyright (C) 2007 Free Software Foundation, Inc. Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The GNU General Public License is a free, copyleft license for software and other kinds of works. The licenses for most software and other practical works are designed to take away your freedom to share and change the works. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change all versions of a program--to make sure it remains free software for all its users. We, the Free Software Foundation, use the GNU General Public License for most of our software; it applies also to any other work released this way by its authors. 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 them 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 prevent others from denying you these rights or asking you to surrender the rights. Therefore, you have certain responsibilities if you distribute copies of the software, or if you modify it: responsibilities to respect the freedom of others. For example, if you distribute copies of such a program, whether gratis or for a fee, you must pass on to the recipients the same freedoms that you received. 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. Developers that use the GNU GPL protect your rights with two steps: (1) assert copyright on the software, and (2) offer you this License giving you legal permission to copy, distribute and/or modify it. For the developers' and authors' protection, the GPL clearly explains that there is no warranty for this free software. For both users' and authors' sake, the GPL requires that modified versions be marked as changed, so that their problems will not be attributed erroneously to authors of previous versions. Some devices are designed to deny users access to install or run modified versions of the software inside them, although the manufacturer can do so. This is fundamentally incompatible with the aim of protecting users' freedom to change the software. The systematic pattern of such abuse occurs in the area of products for individuals to use, which is precisely where it is most unacceptable. Therefore, we have designed this version of the GPL to prohibit the practice for those products. If such problems arise substantially in other domains, we stand ready to extend this provision to those domains in future versions of the GPL, as needed to protect the freedom of users. Finally, every program is threatened constantly by software patents. States should not allow patents to restrict development and use of software on general-purpose computers, but in those that do, we wish to avoid the special danger that patents applied to a free program could make it effectively proprietary. To prevent this, the GPL assures that patents cannot be used to render the program non-free. The precise terms and conditions for copying, distribution and modification follow. TERMS AND CONDITIONS 0. Definitions. "This License" refers to version 3 of the GNU General Public License. "Copyright" also means copyright-like laws that apply to other kinds of works, such as semiconductor masks. "The Program" refers to any copyrightable work licensed under this License. Each licensee is addressed as "you". "Licensees" and "recipients" may be individuals or organizations. To "modify" a work means to copy from or adapt all or part of the work in a fashion requiring copyright permission, other than the making of an exact copy. The resulting work is called a "modified version" of the earlier work or a work "based on" the earlier work. A "covered work" means either the unmodified Program or a work based on the Program. To "propagate" a work means to do anything with it that, without permission, would make you directly or secondarily liable for infringement under applicable copyright law, except executing it on a computer or modifying a private copy. Propagation includes copying, distribution (with or without modification), making available to the public, and in some countries other activities as well. To "convey" a work means any kind of propagation that enables other parties to make or receive copies. Mere interaction with a user through a computer network, with no transfer of a copy, is not conveying. An interactive user interface displays "Appropriate Legal Notices" to the extent that it includes a convenient and prominently visible feature that (1) displays an appropriate copyright notice, and (2) tells the user that there is no warranty for the work (except to the extent that warranties are provided), that licensees may convey the work under this License, and how to view a copy of this License. If the interface presents a list of user commands or options, such as a menu, a prominent item in the list meets this criterion. 1. Source Code. The "source code" for a work means the preferred form of the work for making modifications to it. "Object code" means any non-source form of a work. A "Standard Interface" means an interface that either is an official standard defined by a recognized standards body, or, in the case of interfaces specified for a particular programming language, one that is widely used among developers working in that language. The "System Libraries" of an executable work include anything, other than the work as a whole, that (a) is included in the normal form of packaging a Major Component, but which is not part of that Major Component, and (b) serves only to enable use of the work with that Major Component, or to implement a Standard Interface for which an implementation is available to the public in source code form. A "Major Component", in this context, means a major essential component (kernel, window system, and so on) of the specific operating system (if any) on which the executable work runs, or a compiler used to produce the work, or an object code interpreter used to run it. The "Corresponding Source" for a work in object code form means all the source code needed to generate, install, and (for an executable work) run the object code and to modify the work, including scripts to control those activities. However, it does not include the work's System Libraries, or general-purpose tools or generally available free programs which are used unmodified in performing those activities but which are not part of the work. For example, Corresponding Source includes interface definition files associated with source files for the work, and the source code for shared libraries and dynamically linked subprograms that the work is specifically designed to require, such as by intimate data communication or control flow between those subprograms and other parts of the work. The Corresponding Source need not include anything that users can regenerate automatically from other parts of the Corresponding Source. The Corresponding Source for a work in source code form is that same work. 2. Basic Permissions. All rights granted under this License are granted for the term of copyright on the Program, and are irrevocable provided the stated conditions are met. This License explicitly affirms your unlimited permission to run the unmodified Program. The output from running a covered work is covered by this License only if the output, given its content, constitutes a covered work. This License acknowledges your rights of fair use or other equivalent, as provided by copyright law. You may make, run and propagate covered works that you do not convey, without conditions so long as your license otherwise remains in force. You may convey covered works to others for the sole purpose of having them make modifications exclusively for you, or provide you with facilities for running those works, provided that you comply with the terms of this License in conveying all material for which you do not control copyright. Those thus making or running the covered works for you must do so exclusively on your behalf, under your direction and control, on terms that prohibit them from making any copies of your copyrighted material outside their relationship with you. Conveying under any other circumstances is permitted solely under the conditions stated below. Sublicensing is not allowed; section 10 makes it unnecessary. 3. Protecting Users' Legal Rights From Anti-Circumvention Law. No covered work shall be deemed part of an effective technological measure under any applicable law fulfilling obligations under article 11 of the WIPO copyright treaty adopted on 20 December 1996, or similar laws prohibiting or restricting circumvention of such measures. When you convey a covered work, you waive any legal power to forbid circumvention of technological measures to the extent such circumvention is effected by exercising rights under this License with respect to the covered work, and you disclaim any intention to limit operation or modification of the work as a means of enforcing, against the work's users, your or third parties' legal rights to forbid circumvention of technological measures. 4. Conveying Verbatim Copies. You may convey 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; keep intact all notices stating that this License and any non-permissive terms added in accord with section 7 apply to the code; keep intact all notices of the absence of any warranty; and give all recipients a copy of this License along with the Program. You may charge any price or no price for each copy that you convey, and you may offer support or warranty protection for a fee. 5. Conveying Modified Source Versions. You may convey a work based on the Program, or the modifications to produce it from the Program, in the form of source code under the terms of section 4, provided that you also meet all of these conditions: a) The work must carry prominent notices stating that you modified it, and giving a relevant date. b) The work must carry prominent notices stating that it is released under this License and any conditions added under section 7. This requirement modifies the requirement in section 4 to "keep intact all notices". c) You must license the entire work, as a whole, under this License to anyone who comes into possession of a copy. This License will therefore apply, along with any applicable section 7 additional terms, to the whole of the work, and all its parts, regardless of how they are packaged. This License gives no permission to license the work in any other way, but it does not invalidate such permission if you have separately received it. d) If the work has interactive user interfaces, each must display Appropriate Legal Notices; however, if the Program has interactive interfaces that do not display Appropriate Legal Notices, your work need not make them do so. A compilation of a covered work with other separate and independent works, which are not by their nature extensions of the covered work, and which are not combined with it such as to form a larger program, in or on a volume of a storage or distribution medium, is called an "aggregate" if the compilation and its resulting copyright are not used to limit the access or legal rights of the compilation's users beyond what the individual works permit. Inclusion of a covered work in an aggregate does not cause this License to apply to the other parts of the aggregate. 6. Conveying Non-Source Forms. You may convey a covered work in object code form under the terms of sections 4 and 5, provided that you also convey the machine-readable Corresponding Source under the terms of this License, in one of these ways: a) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by the Corresponding Source fixed on a durable physical medium customarily used for software interchange. b) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by a written offer, valid for at least three years and valid for as long as you offer spare parts or customer support for that product model, to give anyone who possesses the object code either (1) a copy of the Corresponding Source for all the software in the product that is covered by this License, on a durable physical medium customarily used for software interchange, for a price no more than your reasonable cost of physically performing this conveying of source, or (2) access to copy the Corresponding Source from a network server at no charge. c) Convey individual copies of the object code with a copy of the written offer to provide the Corresponding Source. This alternative is allowed only occasionally and noncommercially, and only if you received the object code with such an offer, in accord with subsection 6b. d) Convey the object code by offering access from a designated place (gratis or for a charge), and offer equivalent access to the Corresponding Source in the same way through the same place at no further charge. You need not require recipients to copy the Corresponding Source along with the object code. If the place to copy the object code is a network server, the Corresponding Source may be on a different server (operated by you or a third party) that supports equivalent copying facilities, provided you maintain clear directions next to the object code saying where to find the Corresponding Source. Regardless of what server hosts the Corresponding Source, you remain obligated to ensure that it is available for as long as needed to satisfy these requirements. e) Convey the object code using peer-to-peer transmission, provided you inform other peers where the object code and Corresponding Source of the work are being offered to the general public at no charge under subsection 6d. A separable portion of the object code, whose source code is excluded from the Corresponding Source as a System Library, need not be included in conveying the object code work. A "User Product" is either (1) a "consumer product", which means any tangible personal property which is normally used for personal, family, or household purposes, or (2) anything designed or sold for incorporation into a dwelling. In determining whether a product is a consumer product, doubtful cases shall be resolved in favor of coverage. For a particular product received by a particular user, "normally used" refers to a typical or common use of that class of product, regardless of the status of the particular user or of the way in which the particular user actually uses, or expects or is expected to use, the product. A product is a consumer product regardless of whether the product has substantial commercial, industrial or non-consumer uses, unless such uses represent the only significant mode of use of the product. "Installation Information" for a User Product means any methods, procedures, authorization keys, or other information required to install and execute modified versions of a covered work in that User Product from a modified version of its Corresponding Source. The information must suffice to ensure that the continued functioning of the modified object code is in no case prevented or interfered with solely because modification has been made. If you convey an object code work under this section in, or with, or specifically for use in, a User Product, and the conveying occurs as part of a transaction in which the right of possession and use of the User Product is transferred to the recipient in perpetuity or for a fixed term (regardless of how the transaction is characterized), the Corresponding Source conveyed under this section must be accompanied by the Installation Information. But this requirement does not apply if neither you nor any third party retains the ability to install modified object code on the User Product (for example, the work has been installed in ROM). The requirement to provide Installation Information does not include a requirement to continue to provide support service, warranty, or updates for a work that has been modified or installed by the recipient, or for the User Product in which it has been modified or installed. Access to a network may be denied when the modification itself materially and adversely affects the operation of the network or violates the rules and protocols for communication across the network. Corresponding Source conveyed, and Installation Information provided, in accord with this section must be in a format that is publicly documented (and with an implementation available to the public in source code form), and must require no special password or key for unpacking, reading or copying. 7. Additional Terms. "Additional permissions" are terms that supplement the terms of this License by making exceptions from one or more of its conditions. Additional permissions that are applicable to the entire Program shall be treated as though they were included in this License, to the extent that they are valid under applicable law. If additional permissions apply only to part of the Program, that part may be used separately under those permissions, but the entire Program remains governed by this License without regard to the additional permissions. When you convey a copy of a covered work, you may at your option remove any additional permissions from that copy, or from any part of it. (Additional permissions may be written to require their own removal in certain cases when you modify the work.) You may place additional permissions on material, added by you to a covered work, for which you have or can give appropriate copyright permission. Notwithstanding any other provision of this License, for material you add to a covered work, you may (if authorized by the copyright holders of that material) supplement the terms of this License with terms: a) Disclaiming warranty or limiting liability differently from the terms of sections 15 and 16 of this License; or b) Requiring preservation of specified reasonable legal notices or author attributions in that material or in the Appropriate Legal Notices displayed by works containing it; or c) Prohibiting misrepresentation of the origin of that material, or requiring that modified versions of such material be marked in reasonable ways as different from the original version; or d) Limiting the use for publicity purposes of names of licensors or authors of the material; or e) Declining to grant rights under trademark law for use of some trade names, trademarks, or service marks; or f) Requiring indemnification of licensors and authors of that material by anyone who conveys the material (or modified versions of it) with contractual assumptions of liability to the recipient, for any liability that these contractual assumptions directly impose on those licensors and authors. All other non-permissive additional terms are considered "further restrictions" within the meaning of section 10. If the Program as you received it, or any part of it, contains a notice stating that it is governed by this License along with a term that is a further restriction, you may remove that term. If a license document contains a further restriction but permits relicensing or conveying under this License, you may add to a covered work material governed by the terms of that license document, provided that the further restriction does not survive such relicensing or conveying. If you add terms to a covered work in accord with this section, you must place, in the relevant source files, a statement of the additional terms that apply to those files, or a notice indicating where to find the applicable terms. Additional terms, permissive or non-permissive, may be stated in the form of a separately written license, or stated as exceptions; the above requirements apply either way. 8. Termination. You may not propagate or modify a covered work except as expressly provided under this License. Any attempt otherwise to propagate or modify it is void, and will automatically terminate your rights under this License (including any patent licenses granted under the third paragraph of section 11). However, if you cease all violation of this License, then your license from a particular copyright holder is reinstated (a) provisionally, unless and until the copyright holder explicitly and finally terminates your license, and (b) permanently, if the copyright holder fails to notify you of the violation by some reasonable means prior to 60 days after the cessation. Moreover, your license from a particular copyright holder is reinstated permanently if the copyright holder notifies you of the violation by some reasonable means, this is the first time you have received notice of violation of this License (for any work) from that copyright holder, and you cure the violation prior to 30 days after your receipt of the notice. Termination of your rights under this section does not terminate the licenses of parties who have received copies or rights from you under this License. If your rights have been terminated and not permanently reinstated, you do not qualify to receive new licenses for the same material under section 10. 9. Acceptance Not Required for Having Copies. You are not required to accept this License in order to receive or run a copy of the Program. Ancillary propagation of a covered work occurring solely as a consequence of using peer-to-peer transmission to receive a copy likewise does not require acceptance. However, nothing other than this License grants you permission to propagate or modify any covered work. These actions infringe copyright if you do not accept this License. Therefore, by modifying or propagating a covered work, you indicate your acceptance of this License to do so. 10. Automatic Licensing of Downstream Recipients. Each time you convey a covered work, the recipient automatically receives a license from the original licensors, to run, modify and propagate that work, subject to this License. You are not responsible for enforcing compliance by third parties with this License. An "entity transaction" is a transaction transferring control of an organization, or substantially all assets of one, or subdividing an organization, or merging organizations. If propagation of a covered work results from an entity transaction, each party to that transaction who receives a copy of the work also receives whatever licenses to the work the party's predecessor in interest had or could give under the previous paragraph, plus a right to possession of the Corresponding Source of the work from the predecessor in interest, if the predecessor has it or can get it with reasonable efforts. You may not impose any further restrictions on the exercise of the rights granted or affirmed under this License. For example, you may not impose a license fee, royalty, or other charge for exercise of rights granted under this License, and you may not initiate litigation (including a cross-claim or counterclaim in a lawsuit) alleging that any patent claim is infringed by making, using, selling, offering for sale, or importing the Program or any portion of it. 11. Patents. A "contributor" is a copyright holder who authorizes use under this License of the Program or a work on which the Program is based. The work thus licensed is called the contributor's "contributor version". A contributor's "essential patent claims" are all patent claims owned or controlled by the contributor, whether already acquired or hereafter acquired, that would be infringed by some manner, permitted by this License, of making, using, or selling its contributor version, but do not include claims that would be infringed only as a consequence of further modification of the contributor version. For purposes of this definition, "control" includes the right to grant patent sublicenses in a manner consistent with the requirements of this License. Each contributor grants you a non-exclusive, worldwide, royalty-free patent license under the contributor's essential patent claims, to make, use, sell, offer for sale, import and otherwise run, modify and propagate the contents of its contributor version. In the following three paragraphs, a "patent license" is any express agreement or commitment, however denominated, not to enforce a patent (such as an express permission to practice a patent or covenant not to sue for patent infringement). To "grant" such a patent license to a party means to make such an agreement or commitment not to enforce a patent against the party. If you convey a covered work, knowingly relying on a patent license, and the Corresponding Source of the work is not available for anyone to copy, free of charge and under the terms of this License, through a publicly available network server or other readily accessible means, then you must either (1) cause the Corresponding Source to be so available, or (2) arrange to deprive yourself of the benefit of the patent license for this particular work, or (3) arrange, in a manner consistent with the requirements of this License, to extend the patent license to downstream recipients. "Knowingly relying" means you have actual knowledge that, but for the patent license, your conveying the covered work in a country, or your recipient's use of the covered work in a country, would infringe one or more identifiable patents in that country that you have reason to believe are valid. If, pursuant to or in connection with a single transaction or arrangement, you convey, or propagate by procuring conveyance of, a covered work, and grant a patent license to some of the parties receiving the covered work authorizing them to use, propagate, modify or convey a specific copy of the covered work, then the patent license you grant is automatically extended to all recipients of the covered work and works based on it. A patent license is "discriminatory" if it does not include within the scope of its coverage, prohibits the exercise of, or is conditioned on the non-exercise of one or more of the rights that are specifically granted under this License. You may not convey a covered work if you are a party to an arrangement with a third party that is in the business of distributing software, under which you make payment to the third party based on the extent of your activity of conveying the work, and under which the third party grants, to any of the parties who would receive the covered work from you, a discriminatory patent license (a) in connection with copies of the covered work conveyed by you (or copies made from those copies), or (b) primarily for and in connection with specific products or compilations that contain the covered work, unless you entered into that arrangement, or that patent license was granted, prior to 28 March 2007. Nothing in this License shall be construed as excluding or limiting any implied license or other defenses to infringement that may otherwise be available to you under applicable patent law. 12. No Surrender of Others' Freedom. If 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 convey a covered work so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not convey it at all. For example, if you agree to terms that obligate you to collect a royalty for further conveying from those to whom you convey the Program, the only way you could satisfy both those terms and this License would be to refrain entirely from conveying the Program. 13. Use with the GNU Affero General Public License. Notwithstanding any other provision of this License, you have permission to link or combine any covered work with a work licensed under version 3 of the GNU Affero General Public License into a single combined work, and to convey the resulting work. The terms of this License will continue to apply to the part which is the covered work, but the special requirements of the GNU Affero General Public License, section 13, concerning interaction through a network will apply to the combination as such. 14. Revised Versions of this License. The Free Software Foundation may publish revised and/or new versions of the GNU 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 that a certain numbered version of the GNU General Public License "or any later version" applies to it, you have the option of following the terms and conditions either of that numbered version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of the GNU General Public License, you may choose any version ever published by the Free Software Foundation. If the Program specifies that a proxy can decide which future versions of the GNU General Public License can be used, that proxy's public statement of acceptance of a version permanently authorizes you to choose that version for the Program. Later license versions may give you additional or different permissions. However, no additional obligations are imposed on any author or copyright holder as a result of your choosing to follow a later version. 15. Disclaimer of Warranty. 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. 16. Limitation of Liability. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 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. 17. Interpretation of Sections 15 and 16. If the disclaimer of warranty and limitation of liability provided above cannot be given local legal effect according to their terms, reviewing courts shall apply local law that most closely approximates an absolute waiver of all civil liability in connection with the Program, unless a warranty or assumption of liability accompanies a copy of the Program in return for a fee. 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 state the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) 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 3 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, see . Also add information on how to contact you by electronic and paper mail. If the program does terminal interaction, make it output a short notice like this when it starts in an interactive mode: Copyright (C) This program 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, your program's commands might be different; for a GUI interface, you would use an "about box". You should also get your employer (if you work as a programmer) or school, if any, to sign a "copyright disclaimer" for the program, if necessary. For more information on this, and how to apply and follow the GNU GPL, see . The GNU 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 Lesser General Public License instead of this License. But first, please read . ACDF_v3/Makefile0100777000000000000000000000074312721646556010603 0ustar00INSTALL_PLUGINS_DIR = /usr/local/lib/ladspa/ CC = g++ LD = g++ CFLAGS = -I. -Ofast -Wall -c -fPIC -DPIC LDFLAGS = -shared PLUGINS = ACDf.so all: $(PLUGINS) %.o: %.cpp $(CC) $(CFLAGS) -o $@ $< %.so: %.o $(LD) $(LDFLAGS) -o $@ $< install: targets test -d $(INSTALL_PLUGINS_DIR) || mkdir $(INSTALL_PLUGINS_DIR) cp *.so $(INSTALL_PLUGINS_DIR) targets: $(PLUGINS) always: clean: -rm -f `find . -name "*.so"` -rm -f `find . -name "*.o"` -rm -f `find . -name "*~"` ACDF_v3/README0100777000000000000000000000274312727150102010004 0ustar00README file for ACD-plugins v2.0 Installing LADSPA ~~~~~~~~~ LADSPA should be installed first. Check that the environment variable LADSPA_PATH is set and contains the path to the plugins, so they can be found by a host. To set the environment variable try something like this: export LADSPA_PATH=/usr/local/lib/ladspa:/usr/lib/ladspa The export command should be placed in a file such as ~/.profile, ~/.bashrc or a similar location that will be read on startup or login (note: the tilde (~) character indicates the user's home directory). Compiling and Installing the plugins ~~~~~~~~~ To install these plugins, type: make then sudo make install By default this installs plugins in /usr/local/lib/ladspa. If you want them to go somewhere else, edit the Makefile. Optimizating the code for faster execution on your hardware ~~~~~~~~~ The Makefile does not include any flags that direct the compiler to generate code that makes use of special CPU processing that can speed up the execution of the code by several times or more, e.g. by using SSE. For instance the GCC march=CPU_type compiler option will try to optimize the code for the CPU indicated. Please consult the GCC man pages for more information. A web search about optimizing for your hardware is also a good resource. Bug reports and Other Feedback ~~~~~~~~~~~ Please send suggestions for improvements, bug reports, or comments to: ACD@claub.net Thanks to all that came before me! Enjoy, Charlie Laub