gavindiaz/QuanTAlib
1
0
Fork 0
mirror of https://github.com/mihakralj/QuanTAlib.git synced 2026-08-25 22:08:05 +00:00
Code Issues Packages Projects Releases Wiki Activity

v0.8.6: update indicator docs, ndepend tooling, ALMA refactor, gitignore cleanup

Browse Source
This commit is contained in:
Miha Kralj
2026-03-13 13:46:52 -07:00
parent e3e9555fc1
commit c75135ab14
402 changed files with 2222 additions and 1779 deletions
Download Patch File Download Diff File Expand all files Collapse all files
lib/trends_FIR/conv/Conv.md
+2 -4
View File
@@ -13,9 +13,7 @@
| **PineScript** | [conv.pine](conv.pine) |
- CONV (Convolution Moving Average) is the ultimate tool for the signal processing purist.
- Parameterized by double[] kernel.
- Output range: Tracks input.
- Requires `period` bars of warmup before first valid output (IsHot = true).
- **Similar:** [SMA](../sma/Sma.md), [ALMA](../alma/alma.md) | **Trading note:** Convolution operator; applies custom kernel to price. Foundation of all FIR moving averages.
- Validated against TA-Lib, Skender, and Tulip reference implementations where available.
CONV (Convolution Moving Average) is the ultimate tool for the signal processing purist. It doesn't presume to know what kind of smoothing you need; it simply asks for a kernel (a set of weights) and applies it to the data. Want a Gaussian filter? A Sinc filter? A custom edge-detection filter? CONV runs them all.
@@ -112,4 +110,4 @@ Validation is performed by reproducing standard moving averages (SMA, WMA, TRIMA
1. **Kernel Direction**: Our implementation applies the kernel such that the last element of the kernel multiplies the most recent data point. If you import kernels from other DSP libraries, you might need to reverse them.
2. **Normalization**: Kernel weights are *not* automatically normalized. If the sum of the weights is not 1.0, the output scale will be different from the input scale. This is a feature, not a bug (allows for differential filters).
3. **Performance**: A kernel size of 1000 will be 100x slower than a kernel size of 10. Use FFT-based convolution for massive kernels (not implemented here; this is for trading, not searching for extraterrestrial life).
3. **Performance**: A kernel size of 1000 will be 100x slower than a kernel size of 10. Use FFT-based convolution for massive kernels (not implemented here; this is for trading, not searching for extraterrestrial life).