@jtarrio/signals 0.9.0

package/dist/demod/sample-counter.js

@@ -0,0 +1,57 @@
+// Copyright 2024 Jacobo Tarrio Barreiro. All rights reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+/** A SampleReceiver that counts received samples to send a `sample-click` event periodically. */
+export class SampleCounter extends EventTarget {
+    clicksPerSecond;
+    /**
+     * @param sampleRate The initial sample rate.
+     * @param clicksPerSecond The number of events per second.
+     */
+    constructor(clicksPerSecond) {
+        super();
+        this.clicksPerSecond = clicksPerSecond;
+        this.sampleRate = 1024000;
+        this.samplesPerClick = this.getSamplesPerClick();
+        this.countedSamples = 0;
+    }
+    sampleRate;
+    samplesPerClick;
+    countedSamples;
+    getSamplesPerClick() {
+        return this.clicksPerSecond === undefined
+            ? undefined
+            : Math.floor(this.sampleRate / this.clicksPerSecond);
+    }
+    setSampleRate(sampleRate) {
+        this.sampleRate = sampleRate;
+        this.samplesPerClick = this.getSamplesPerClick();
+    }
+    receiveSamples(I, Q) {
+        this.countedSamples += I.length;
+        if (this.samplesPerClick === undefined ||
+            this.samplesPerClick > this.countedSamples)
+            return;
+        this.countedSamples %= this.samplesPerClick;
+        this.dispatchEvent(new SampleClickEvent());
+    }
+    addEventListener(type, callback, options) {
+        super.addEventListener(type, callback, options);
+    }
+}
+export class SampleClickEvent extends Event {
+    constructor() {
+        super("sample-click");
+    }
+}
+//# sourceMappingURL=sample-counter.js.map

package/dist/demod/sample-counter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sample-counter.js","sourceRoot":"","sources":["../../src/demod/sample-counter.ts"],"names":[],"mappings":"AAAA,8DAA8D;AAC9D,EAAE;AACF,kEAAkE;AAClE,mEAAmE;AACnE,0CAA0C;AAC1C,EAAE;AACF,iDAAiD;AACjD,EAAE;AACF,sEAAsE;AACtE,oEAAoE;AACpE,2EAA2E;AAC3E,sEAAsE;AACtE,iCAAiC;AAIjC,iGAAiG;AACjG,MAAM,OAAO,aAAc,SAAQ,WAAW;IAKxB;IAJpB;;;OAGG;IACH,YAAoB,eAAwB;QAC1C,KAAK,EAAE,CAAC;QADU,oBAAe,GAAf,eAAe,CAAS;QAE1C,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC;QAC1B,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;QACjD,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;IAC1B,CAAC;IAEO,UAAU,CAAS;IACnB,eAAe,CAAU;IACzB,cAAc,CAAS;IAEvB,kBAAkB;QACxB,OAAO,IAAI,CAAC,eAAe,KAAK,SAAS;YACvC,CAAC,CAAC,SAAS;YACX,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,eAAe,CAAC,CAAC;IACzD,CAAC;IAED,aAAa,CAAC,UAAkB;QAC9B,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;IACnD,CAAC;IAED,cAAc,CAAC,CAAe,EAAE,CAAe;QAC7C,IAAI,CAAC,cAAc,IAAI,CAAC,CAAC,MAAM,CAAC;QAChC,IACE,IAAI,CAAC,eAAe,KAAK,SAAS;YAClC,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,cAAc;YAE1C,OAAO;QACT,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,eAAe,CAAC;QAC5C,IAAI,CAAC,aAAa,CAAC,IAAI,gBAAgB,EAAE,CAAC,CAAC;IAC7C,CAAC;IAYD,gBAAgB,CACd,IAAY,EACZ,QAAa,EACb,OAAuD;QAEvD,KAAK,CAAC,gBAAgB,CACpB,IAAI,EACJ,QAAqD,EACrD,OAAO,CACR,CAAC;IACJ,CAAC;CACF;AAED,MAAM,OAAO,gBAAiB,SAAQ,KAAK;IACzC;QACE,KAAK,CAAC,cAAc,CAAC,CAAC;IACxB,CAAC;CACF"}

package/dist/demod/spectrum.d.ts

@@ -0,0 +1,23 @@
+import { SampleReceiver } from "../radio/sample_receiver.js";
+/** A sample receiver that computes the received signal's spectrum. */
+export declare class Spectrum implements SampleReceiver {
+    constructor(fftSize?: number);
+    private I;
+    private Q;
+    private lastFrequency;
+    private fft;
+    private lastOutput;
+    private dirty;
+    set size(newSize: number);
+    get size(): number;
+    setSampleRate(_: number): void;
+    receiveSamples(I: Float32Array, Q: Float32Array, frequency: number): void;
+    frequency(): number | undefined;
+    /**
+     * Populates the given array with the spectrum of the latest received signals.
+     * For best results, the array should have at least `size` entries; if it's smaller,
+     * it will be filled with whatever fits.
+     */
+    getSpectrum(spectrum: Float32Array): void;
+}
+//# sourceMappingURL=spectrum.d.ts.map

package/dist/demod/spectrum.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"spectrum.d.ts","sourceRoot":"","sources":["../../src/demod/spectrum.ts"],"names":[],"mappings":"AAmBA,OAAO,EAAE,cAAc,EAAE,MAAM,6BAA6B,CAAC;AAE7D,sEAAsE;AACtE,qBAAa,QAAS,YAAW,cAAc;gBACjC,OAAO,CAAC,EAAE,MAAM;IAc5B,OAAO,CAAC,CAAC,CAAoB;IAC7B,OAAO,CAAC,CAAC,CAAoB;IAC7B,OAAO,CAAC,aAAa,CAAqB;IAC1C,OAAO,CAAC,GAAG,CAAM;IACjB,OAAO,CAAC,UAAU,CAAe;IACjC,OAAO,CAAC,KAAK,CAAU;IAEvB,IAAI,IAAI,CAAC,OAAO,EAAE,MAAM,EAKvB;IAED,IAAI,IAAI,IAPU,MAAM,CASvB;IAED,aAAa,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI;IAE9B,cAAc,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,GAAG,IAAI;IAOzE,SAAS,IAAI,MAAM,GAAG,SAAS;IAI/B;;;;OAIG;IACH,WAAW,CAAC,QAAQ,EAAE,YAAY;CAWnC"}

package/dist/demod/spectrum.js

@@ -0,0 +1,76 @@
+// Copyright 2024 Jacobo Tarrio Barreiro. All rights reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+// Continuous spectrum analyzer.
+import { Float32RingBuffer } from "../dsp/buffers.js";
+import { makeBlackmanWindow } from "../dsp/coefficients.js";
+import { FFT } from "../dsp/fft.js";
+/** A sample receiver that computes the received signal's spectrum. */
+export class Spectrum {
+    constructor(fftSize) {
+        if (fftSize === undefined) {
+            fftSize = 2048;
+        }
+        else {
+            fftSize = Math.max(32, Math.min(131072, fftSize));
+        }
+        this.I = new Float32RingBuffer(131072);
+        this.Q = new Float32RingBuffer(131072);
+        this.fft = FFT.ofLength(fftSize);
+        this.fft.setWindow(makeBlackmanWindow(this.fft.length));
+        this.lastOutput = new Float32Array(this.fft.length);
+        this.dirty = true;
+    }
+    I;
+    Q;
+    lastFrequency;
+    fft;
+    lastOutput;
+    dirty;
+    set size(newSize) {
+        this.fft = FFT.ofLength(newSize);
+        this.fft.setWindow(makeBlackmanWindow(this.fft.length));
+        this.lastOutput = new Float32Array(this.fft.length);
+        this.dirty = true;
+    }
+    get size() {
+        return this.fft.length;
+    }
+    setSampleRate(_) { }
+    receiveSamples(I, Q, frequency) {
+        this.I.store(I);
+        this.Q.store(Q);
+        this.lastFrequency = frequency;
+        this.dirty = true;
+    }
+    frequency() {
+        return this.lastFrequency;
+    }
+    /**
+     * Populates the given array with the spectrum of the latest received signals.
+     * For best results, the array should have at least `size` entries; if it's smaller,
+     * it will be filled with whatever fits.
+     */
+    getSpectrum(spectrum) {
+        if (this.dirty) {
+            let fft = this.fft.transformCircularBuffers(this.I, this.Q);
+            this.lastOutput.fill(-Infinity);
+            for (let i = 0; i < this.lastOutput.length; ++i) {
+                this.lastOutput[i] = 20 * Math.log10(Math.hypot(fft[0][i], fft[1][i]));
+            }
+            this.dirty = false;
+        }
+        spectrum.set(this.lastOutput.subarray(0, spectrum.length));
+    }
+}
+//# sourceMappingURL=spectrum.js.map

package/dist/demod/spectrum.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"spectrum.js","sourceRoot":"","sources":["../../src/demod/spectrum.ts"],"names":[],"mappings":"AAAA,8DAA8D;AAC9D,EAAE;AACF,kEAAkE;AAClE,mEAAmE;AACnE,0CAA0C;AAC1C,EAAE;AACF,iDAAiD;AACjD,EAAE;AACF,sEAAsE;AACtE,oEAAoE;AACpE,2EAA2E;AAC3E,sEAAsE;AACtE,iCAAiC;AAEjC,gCAAgC;AAEhC,OAAO,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AACtD,OAAO,EAAE,kBAAkB,EAAE,MAAM,wBAAwB,CAAC;AAC5D,OAAO,EAAE,GAAG,EAAE,MAAM,eAAe,CAAC;AAGpC,sEAAsE;AACtE,MAAM,OAAO,QAAQ;IACnB,YAAY,OAAgB;QAC1B,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,OAAO,GAAG,IAAI,CAAC;QACjB,CAAC;aAAM,CAAC;YACN,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;QACpD,CAAC;QACD,IAAI,CAAC,CAAC,GAAG,IAAI,iBAAiB,CAAC,MAAM,CAAC,CAAC;QACvC,IAAI,CAAC,CAAC,GAAG,IAAI,iBAAiB,CAAC,MAAM,CAAC,CAAC;QACvC,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QACjC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;QACxD,IAAI,CAAC,UAAU,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IAEO,CAAC,CAAoB;IACrB,CAAC,CAAoB;IACrB,aAAa,CAAqB;IAClC,GAAG,CAAM;IACT,UAAU,CAAe;IACzB,KAAK,CAAU;IAEvB,IAAI,IAAI,CAAC,OAAe;QACtB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QACjC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;QACxD,IAAI,CAAC,UAAU,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;IACzB,CAAC;IAED,aAAa,CAAC,CAAS,IAAS,CAAC;IAEjC,cAAc,CAAC,CAAe,EAAE,CAAe,EAAE,SAAiB;QAChE,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAChB,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAChB,IAAI,CAAC,aAAa,GAAG,SAAS,CAAC;QAC/B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IAED,SAAS;QACP,OAAO,IAAI,CAAC,aAAa,CAAC;IAC5B,CAAC;IAED;;;;OAIG;IACH,WAAW,CAAC,QAAsB;QAChC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,wBAAwB,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5D,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;gBAChD,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzE,CAAC;YACD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACrB,CAAC;QACD,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;IAC7D,CAAC;CACF"}

package/dist/dsp/buffers.d.ts

@@ -0,0 +1,127 @@
+/**
+ * A fixed-size pool of pre-allocated arrays.
+ *
+ * Each call to get() returns the next array of the pool, if it's already the requested size.
+ * If the next array is larger than the requested size, the function returns a subarray.
+ * If the next array is smaller than the requested size, the function allocates a new array,
+ * replaces the old array with the new array, and returns that one.
+ */
+declare abstract class Pool<T extends TypedArray<T>> {
+    private make;
+    /**
+     * @param make A function that returns an array of the given length.
+     * @param count The number of arrays to keep around. Having more than 1 lets you modify one array while you use another.
+     * @param length An optional initial length for the arrays.
+     */
+    constructor(make: (length: number) => T, count: number, length?: number);
+    private buffers;
+    private current;
+    /** Returns an array of the given size. You may need to clear it manually. */
+    get(length: number): T;
+}
+/**
+ * A fixed-size pool of pre-allocated Uint8Arrays.
+ */
+export declare class U8Pool extends Pool<Uint8Array> {
+    /**
+     * @param count The number of arrays to keep around. Having more than 1 lets you modify one array while you use another.
+     * @param length An optional initial size for the arrays.
+     */
+    constructor(count: number, length?: number);
+}
+/**
+ * A fixed-size pool of pre-allocated Float32Arrays.
+ */
+export declare class Float32Pool extends Pool<Float32Array> {
+    /**
+     * @param count The number of arrays to keep around. Having more than 1 lets you modify one array while you use another.
+     * @param length An optional initial size for the arrays.
+     */
+    constructor(count: number, length?: number);
+}
+/**
+ * A pool of pre-allocated [Float32Array, Float32Array] array pairs.
+ */
+export declare class IqPool {
+    /**
+     * @param count The number of array pairs to keep around. Having more than 1 lets you modify one pair while you use another.
+     * @param length An optional initial size for the arrays.
+     */
+    constructor(count: number, length?: number);
+    private pools;
+    /** Returns a pair of arrays of the given size. You may need to clear them manually. */
+    get(length: number): [Float32Array, Float32Array];
+}
+interface TypedArray<T> {
+    readonly BYTES_PER_ELEMENT: number;
+    readonly buffer: ArrayBufferLike;
+    readonly byteLength: number;
+    readonly byteOffset: number;
+    copyWithin(target: number, start: number, end?: number): this;
+    every(predicate: (value: number, index: number, array: this) => unknown, thisArg?: any): boolean;
+    fill(value: number, start?: number, end?: number): this;
+    filter(predicate: (value: number, index: number, array: this) => any, thisArg?: any): T;
+    find(predicate: (value: number, index: number, obj: this) => boolean, thisArg?: any): number | undefined;
+    findIndex(predicate: (value: number, index: number, obj: this) => boolean, thisArg?: any): number;
+    forEach(callbackfn: (value: number, index: number, array: this) => void, thisArg?: any): void;
+    indexOf(searchElement: number, fromIndex?: number): number;
+    join(separator?: string): string;
+    lastIndexOf(searchElement: number, fromIndex?: number): number;
+    readonly length: number;
+    map(callbackfn: (value: number, index: number, array: this) => number, thisArg?: any): T;
+    reduce(callbackfn: (previousValue: number, currentValue: number, currentIndex: number, array: this) => number): number;
+    reduce(callbackfn: (previousValue: number, currentValue: number, currentIndex: number, array: this) => number, initialValue: number): number;
+    reduce<U>(callbackfn: (previousValue: U, currentValue: number, currentIndex: number, array: this) => U, initialValue: U): U;
+    reduceRight(callbackfn: (previousValue: number, currentValue: number, currentIndex: number, array: this) => number): number;
+    reduceRight(callbackfn: (previousValue: number, currentValue: number, currentIndex: number, array: this) => number, initialValue: number): number;
+    reduceRight<U>(callbackfn: (previousValue: U, currentValue: number, currentIndex: number, array: this) => U, initialValue: U): U;
+    reverse(): this;
+    set(array: ArrayLike<number>, offset?: number): void;
+    slice(start?: number, end?: number): T;
+    some(predicate: (value: number, index: number, array: this) => unknown, thisArg?: any): boolean;
+    sort(compareFn?: (a: number, b: number) => number): this;
+    subarray(begin?: number, end?: number): T;
+    toLocaleString(): string;
+    toString(): string;
+    valueOf(): this;
+    [index: number]: number;
+}
+/**
+ * A variable-size ring buffer, where you can store data and then access up to the latest N values.
+ */
+declare class RingBuffer<T extends TypedArray<T>> {
+    private buffer;
+    constructor(buffer: T);
+    private readPos;
+    private writePos;
+    private filled;
+    /** Returns the ring buffer's capacity. */
+    get capacity(): number;
+    /** Returns the number of values that can be accessed using moveTo. */
+    get available(): number;
+    /** Empties the ring buffer. */
+    clear(): void;
+    /** Copies the provided data into the ring buffer. */
+    store(data: T): void;
+    /**
+     * Fills the provided array with values from the ring buffer,
+     * consuming it in the same order as the values were written.
+     * Returns the number of values copied.
+     */
+    moveTo(data: T): number;
+    /**
+     * Fills the provided array with the latest values stored in the ring buffer,
+     * without consuming it and without taking into account the values consumed
+     * by moveTo.
+     */
+    copyTo(data: T): void;
+    private doCopy;
+}
+/**
+ * A Float32 variable-size ring buffer, where you can store data and then retrieve the latest N values.
+ */
+export declare class Float32RingBuffer extends RingBuffer<Float32Array> {
+    constructor(size: number);
+}
+export {};
+//# sourceMappingURL=buffers.d.ts.map

package/dist/dsp/buffers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"buffers.d.ts","sourceRoot":"","sources":["../../src/dsp/buffers.ts"],"names":[],"mappings":"AAcA;;;;;;;GAOG;AACH,uBAAe,IAAI,CAAC,CAAC,SAAS,UAAU,CAAC,CAAC,CAAC;IAOvC,OAAO,CAAC,IAAI;IANd;;;;OAIG;gBAEO,IAAI,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,CAAC,EACnC,KAAK,EAAE,MAAM,EACb,MAAM,CAAC,EAAE,MAAM;IAMjB,OAAO,CAAC,OAAO,CAAW;IAC1B,OAAO,CAAC,OAAO,CAAS;IAExB,6EAA6E;IAC7E,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,CAAC;CAUvB;AAED;;GAEG;AACH,qBAAa,MAAO,SAAQ,IAAI,CAAC,UAAU,CAAC;IAC1C;;;OAGG;gBACS,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM;CAG3C;AAED;;GAEG;AACH,qBAAa,WAAY,SAAQ,IAAI,CAAC,YAAY,CAAC;IACjD;;;OAGG;gBACS,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM;CAG3C;AAED;;GAEG;AACH,qBAAa,MAAM;IACjB;;;OAGG;gBACS,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM;IAI1C,OAAO,CAAC,KAAK,CAAc;IAE3B,uFAAuF;IACvF,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,CAAC,YAAY,EAAE,YAAY,CAAC;CAGlD;AAED,UAAU,UAAU,CAAC,CAAC;IAClB,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAC;IACnC,QAAQ,CAAC,MAAM,EAAE,eAAe,CAAC;IACjC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC9D,KAAK,CAAC,SAAS,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,KAAK,OAAO,EAAE,OAAO,CAAC,EAAE,GAAG,GAAG,OAAO,CAAC;IACjG,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACxD,MAAM,CAAC,SAAS,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,KAAK,GAAG,EAAE,OAAO,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC;IACxF,IAAI,CAAC,SAAS,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,KAAK,OAAO,EAAE,OAAO,CAAC,EAAE,GAAG,GAAG,MAAM,GAAG,SAAS,CAAC;IACzG,SAAS,CAAC,SAAS,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,KAAK,OAAO,EAAE,OAAO,CAAC,EAAE,GAAG,GAAG,MAAM,CAAC;IAClG,OAAO,CAAC,UAAU,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,KAAK,IAAI,EAAE,OAAO,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC;IAC9F,OAAO,CAAC,aAAa,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IAC3D,IAAI,CAAC,SAAS,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IACjC,WAAW,CAAC,aAAa,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IAC/D,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,GAAG,CAAC,UAAU,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,KAAK,MAAM,EAAE,OAAO,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC;IACzF,MAAM,CAAC,UAAU,EAAE,CAAC,aAAa,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,KAAK,MAAM,GAAG,MAAM,CAAC;IACvH,MAAM,CAAC,UAAU,EAAE,CAAC,aAAa,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,KAAK,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,MAAM,CAAC;IAC7I,MAAM,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,aAAa,EAAE,CAAC,EAAE,YAAY,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,KAAK,CAAC,EAAE,YAAY,EAAE,CAAC,GAAG,CAAC,CAAC;IAC5H,WAAW,CAAC,UAAU,EAAE,CAAC,aAAa,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,KAAK,MAAM,GAAG,MAAM,CAAC;IAC5H,WAAW,CAAC,UAAU,EAAE,CAAC,aAAa,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,KAAK,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,MAAM,CAAC;IAClJ,WAAW,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,aAAa,EAAE,CAAC,EAAE,YAAY,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,KAAK,CAAC,EAAE,YAAY,EAAE,CAAC,GAAG,CAAC,CAAC;IACjI,OAAO,IAAI,IAAI,CAAC;IAChB,GAAG,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACrD,KAAK,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC;IACvC,IAAI,CAAC,SAAS,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,KAAK,OAAO,EAAE,OAAO,CAAC,EAAE,GAAG,GAAG,OAAO,CAAC;IAChG,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,KAAK,MAAM,GAAG,IAAI,CAAC;IACzD,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC;IAC1C,cAAc,IAAI,MAAM,CAAC;IACzB,QAAQ,IAAI,MAAM,CAAC;IACnB,OAAO,IAAI,IAAI,CAAC;IAChB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAAC;CAC3B;AAED;;GAEG;AACH,cAAM,UAAU,CAAC,CAAC,SAAS,UAAU,CAAC,CAAC,CAAC;IAC1B,OAAO,CAAC,MAAM;gBAAN,MAAM,EAAE,CAAC;IAM7B,OAAO,CAAC,OAAO,CAAS;IACxB,OAAO,CAAC,QAAQ,CAAS;IACzB,OAAO,CAAC,MAAM,CAAS;IAEvB,0CAA0C;IAC1C,IAAI,QAAQ,WAEX;IAED,sEAAsE;IACtE,IAAI,SAAS,WAEZ;IAED,+BAA+B;IAC/B,KAAK;IAML,qDAAqD;IACrD,KAAK,CAAC,IAAI,EAAE,CAAC;IAgBb;;;;OAIG;IACH,MAAM,CAAC,IAAI,EAAE,CAAC,GAAG,MAAM;IASvB;;;;OAIG;IACH,MAAM,CAAC,IAAI,EAAE,CAAC;IAOd,OAAO,CAAC,MAAM;CAoBf;AAED;;GAEG;AACH,qBAAa,iBAAkB,SAAQ,UAAU,CAAC,YAAY,CAAC;gBACjD,IAAI,EAAE,MAAM;CAGzB"}

package/dist/dsp/buffers.js

@@ -0,0 +1,171 @@
+// Copyright 2024 Jacobo Tarrio Barreiro. All rights reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+/**
+ * A fixed-size pool of pre-allocated arrays.
+ *
+ * Each call to get() returns the next array of the pool, if it's already the requested size.
+ * If the next array is larger than the requested size, the function returns a subarray.
+ * If the next array is smaller than the requested size, the function allocates a new array,
+ * replaces the old array with the new array, and returns that one.
+ */
+class Pool {
+    make;
+    /**
+     * @param make A function that returns an array of the given length.
+     * @param count The number of arrays to keep around. Having more than 1 lets you modify one array while you use another.
+     * @param length An optional initial length for the arrays.
+     */
+    constructor(make, count, length) {
+        this.make = make;
+        this.buffers = [...Array(count).keys()].map(() => make(length || 0));
+        this.current = 0;
+    }
+    buffers;
+    current;
+    /** Returns an array of the given size. You may need to clear it manually. */
+    get(length) {
+        let out = this.buffers[this.current];
+        if (out.length < length) {
+            out = this.make(length);
+            this.buffers[this.current] = out;
+        }
+        this.current = (this.current + 1) % this.buffers.length;
+        if (out.length == length)
+            return out;
+        return out.subarray(0, length);
+    }
+}
+/**
+ * A fixed-size pool of pre-allocated Uint8Arrays.
+ */
+export class U8Pool extends Pool {
+    /**
+     * @param count The number of arrays to keep around. Having more than 1 lets you modify one array while you use another.
+     * @param length An optional initial size for the arrays.
+     */
+    constructor(count, length) {
+        super((l) => new Uint8Array(l), count, length);
+    }
+}
+/**
+ * A fixed-size pool of pre-allocated Float32Arrays.
+ */
+export class Float32Pool extends Pool {
+    /**
+     * @param count The number of arrays to keep around. Having more than 1 lets you modify one array while you use another.
+     * @param length An optional initial size for the arrays.
+     */
+    constructor(count, length) {
+        super((l) => new Float32Array(l), count, length);
+    }
+}
+/**
+ * A pool of pre-allocated [Float32Array, Float32Array] array pairs.
+ */
+export class IqPool {
+    /**
+     * @param count The number of array pairs to keep around. Having more than 1 lets you modify one pair while you use another.
+     * @param length An optional initial size for the arrays.
+     */
+    constructor(count, length) {
+        this.pools = new Float32Pool(count * 2, length);
+    }
+    pools;
+    /** Returns a pair of arrays of the given size. You may need to clear them manually. */
+    get(length) {
+        return [this.pools.get(length), this.pools.get(length)];
+    }
+}
+/**
+ * A variable-size ring buffer, where you can store data and then access up to the latest N values.
+ */
+class RingBuffer {
+    buffer;
+    constructor(buffer) {
+        this.buffer = buffer;
+        this.readPos = 0;
+        this.writePos = 0;
+        this.filled = 0;
+    }
+    readPos;
+    writePos;
+    filled;
+    /** Returns the ring buffer's capacity. */
+    get capacity() {
+        return this.buffer.length;
+    }
+    /** Returns the number of values that can be accessed using moveTo. */
+    get available() {
+        return this.filled;
+    }
+    /** Empties the ring buffer. */
+    clear() {
+        this.readPos = 0;
+        this.writePos = 0;
+        this.filled = 0;
+    }
+    /** Copies the provided data into the ring buffer. */
+    store(data) {
+        let count = Math.min(data.length, this.buffer.length);
+        let { dstOffset } = this.doCopy(count, data, data.length - count, this.buffer, this.writePos);
+        this.writePos = dstOffset;
+        this.filled = Math.min(this.buffer.length, this.filled + count);
+        if (this.filled == this.buffer.length) {
+            this.readPos = this.writePos;
+        }
+    }
+    /**
+     * Fills the provided array with values from the ring buffer,
+     * consuming it in the same order as the values were written.
+     * Returns the number of values copied.
+     */
+    moveTo(data) {
+        let count = Math.min(data.length, this.buffer.length, this.filled);
+        if (count == 0)
+            return 0;
+        let { srcOffset } = this.doCopy(count, this.buffer, this.readPos, data, 0);
+        this.readPos = srcOffset;
+        this.filled -= count;
+        return count;
+    }
+    /**
+     * Fills the provided array with the latest values stored in the ring buffer,
+     * without consuming it and without taking into account the values consumed
+     * by moveTo.
+     */
+    copyTo(data) {
+        let count = Math.min(data.length, this.buffer.length);
+        let srcOffset = (this.writePos + this.buffer.length - count) % this.buffer.length;
+        this.doCopy(count, this.buffer, srcOffset, data, 0);
+    }
+    doCopy(count, src, srcOffset, dst, dstOffset) {
+        while (count > 0) {
+            const copyCount = Math.min(count, src.length - srcOffset, dst.length - dstOffset);
+            dst.set(src.subarray(srcOffset, srcOffset + copyCount), dstOffset);
+            srcOffset = (srcOffset + copyCount) % src.length;
+            dstOffset = (dstOffset + copyCount) % dst.length;
+            count -= copyCount;
+        }
+        return { srcOffset, dstOffset };
+    }
+}
+/**
+ * A Float32 variable-size ring buffer, where you can store data and then retrieve the latest N values.
+ */
+export class Float32RingBuffer extends RingBuffer {
+    constructor(size) {
+        super(new Float32Array(size));
+    }
+}
+//# sourceMappingURL=buffers.js.map

package/dist/dsp/buffers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"buffers.js","sourceRoot":"","sources":["../../src/dsp/buffers.ts"],"names":[],"mappings":"AAAA,8DAA8D;AAC9D,EAAE;AACF,kEAAkE;AAClE,mEAAmE;AACnE,0CAA0C;AAC1C,EAAE;AACF,iDAAiD;AACjD,EAAE;AACF,sEAAsE;AACtE,oEAAoE;AACpE,2EAA2E;AAC3E,sEAAsE;AACtE,iCAAiC;AAEjC;;;;;;;GAOG;AACH,MAAe,IAAI;IAOP;IANV;;;;OAIG;IACH,YACU,IAA2B,EACnC,KAAa,EACb,MAAe;QAFP,SAAI,GAAJ,IAAI,CAAuB;QAInC,IAAI,CAAC,OAAO,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC;QACrE,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;IACnB,CAAC;IAEO,OAAO,CAAW;IAClB,OAAO,CAAS;IAExB,6EAA6E;IAC7E,GAAG,CAAC,MAAc;QAChB,IAAI,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACrC,IAAI,GAAG,CAAC,MAAM,GAAG,MAAM,EAAE,CAAC;YACxB,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACxB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,GAAG,CAAC;QACnC,CAAC;QACD,IAAI,CAAC,OAAO,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;QACxD,IAAI,GAAG,CAAC,MAAM,IAAI,MAAM;YAAE,OAAO,GAAG,CAAC;QACrC,OAAO,GAAG,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IACjC,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,MAAO,SAAQ,IAAgB;IAC1C;;;OAGG;IACH,YAAY,KAAa,EAAE,MAAe;QACxC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IACjD,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,WAAY,SAAQ,IAAkB;IACjD;;;OAGG;IACH,YAAY,KAAa,EAAE,MAAe;QACxC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IACnD,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,MAAM;IACjB;;;OAGG;IACH,YAAY,KAAa,EAAE,MAAe;QACxC,IAAI,CAAC,KAAK,GAAG,IAAI,WAAW,CAAC,KAAK,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;IAClD,CAAC;IAEO,KAAK,CAAc;IAE3B,uFAAuF;IACvF,GAAG,CAAC,MAAc;QAChB,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;IAC1D,CAAC;CACF;AAqCD;;GAEG;AACH,MAAM,UAAU;IACM;IAApB,YAAoB,MAAS;QAAT,WAAM,GAAN,MAAM,CAAG;QAC3B,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;QACjB,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;QAClB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IAEO,OAAO,CAAS;IAChB,QAAQ,CAAS;IACjB,MAAM,CAAS;IAEvB,0CAA0C;IAC1C,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC5B,CAAC;IAED,sEAAsE;IACtE,IAAI,SAAS;QACX,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,+BAA+B;IAC/B,KAAK;QACH,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;QACjB,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;QAClB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IAED,qDAAqD;IACrD,KAAK,CAAC,IAAO;QACX,IAAI,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACtD,IAAI,EAAE,SAAS,EAAE,GAAG,IAAI,CAAC,MAAM,CAC7B,KAAK,EACL,IAAI,EACJ,IAAI,CAAC,MAAM,GAAG,KAAK,EACnB,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,QAAQ,CACd,CAAC;QACF,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;QAC1B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC;QAChE,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;YACtC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC/B,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,IAAO;QACZ,IAAI,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACnE,IAAI,KAAK,IAAI,CAAC;YAAE,OAAO,CAAC,CAAC;QACzB,IAAI,EAAE,SAAS,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;QAC3E,IAAI,CAAC,OAAO,GAAG,SAAS,CAAC;QACzB,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC;QACrB,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,IAAO;QACZ,IAAI,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACtD,IAAI,SAAS,GACX,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QACpE,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IACtD,CAAC;IAEO,MAAM,CACZ,KAAa,EACb,GAAM,EACN,SAAiB,EACjB,GAAM,EACN,SAAiB;QAEjB,OAAO,KAAK,GAAG,CAAC,EAAE,CAAC;YACjB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CACxB,KAAK,EACL,GAAG,CAAC,MAAM,GAAG,SAAS,EACtB,GAAG,CAAC,MAAM,GAAG,SAAS,CACvB,CAAC;YACF,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,GAAG,SAAS,CAAC,EAAE,SAAS,CAAC,CAAC;YACnE,SAAS,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC;YACjD,SAAS,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC;YACjD,KAAK,IAAI,SAAS,CAAC;QACrB,CAAC;QACD,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC;IAClC,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,iBAAkB,SAAQ,UAAwB;IAC7D,YAAY,IAAY;QACtB,KAAK,CAAC,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC;IAChC,CAAC;CACF"}

package/dist/dsp/coefficients.d.ts

@@ -0,0 +1,23 @@
+/**
+ * Generates coefficients for a FIR low-pass filter with the given
+ * corner frequency and kernel length at the given sample rate.
+ * @param sampleRate The signal's sample rate.
+ * @param cornerFreq The -6dB frequency in Hz.
+ * @param length The filter kernel's length. Should be an odd number.
+ * @param gain An optional output gain for the kernel. 1 by default.
+ * @returns The FIR coefficients for the filter.
+ */
+export declare function makeLowPassKernel(sampleRate: number, cornerFreq: number, length: number, gain?: number): Float32Array;
+/**
+ * Returns coefficients for a Hilbert transform.
+ * @param length The length of the kernel.
+ * @returns The kernel coefficients.
+ */
+export declare function makeHilbertKernel(length: number): Float32Array;
+/**
+ * Returns coefficients for a Blackman window.
+ * @param length The length of the kernel.
+ * @returns The kernel coefficients.
+ */
+export declare function makeBlackmanWindow(length: number): Float32Array;
+//# sourceMappingURL=coefficients.d.ts.map

package/dist/dsp/coefficients.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"coefficients.d.ts","sourceRoot":"","sources":["../../src/dsp/coefficients.ts"],"names":[],"mappings":"AAeA;;;;;;;;GAQG;AACH,wBAAgB,iBAAiB,CAC/B,UAAU,EAAE,MAAM,EAClB,UAAU,EAAE,MAAM,EAClB,MAAM,EAAE,MAAM,EACd,IAAI,CAAC,EAAE,MAAM,GACZ,YAAY,CAuBd;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,MAAM,GAAG,YAAY,CAU9D;AAED;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,MAAM,GAAG,YAAY,CAS/D"}

package/dist/dsp/coefficients.js

@@ -0,0 +1,81 @@
+// Copyright 2024 Jacobo Tarrio Barreiro. All rights reserved.
+// Copyright 2013 Google Inc. All rights reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+/**
+ * Generates coefficients for a FIR low-pass filter with the given
+ * corner frequency and kernel length at the given sample rate.
+ * @param sampleRate The signal's sample rate.
+ * @param cornerFreq The -6dB frequency in Hz.
+ * @param length The filter kernel's length. Should be an odd number.
+ * @param gain An optional output gain for the kernel. 1 by default.
+ * @returns The FIR coefficients for the filter.
+ */
+export function makeLowPassKernel(sampleRate, cornerFreq, length, gain) {
+    if (gain === undefined)
+        gain = 1;
+    length += (length + 1) % 2;
+    const freq = cornerFreq / sampleRate;
+    let coefs = new Float32Array(length);
+    const center = Math.floor(length / 2);
+    let sum = 0;
+    for (let i = 0; i < length; ++i) {
+        let val;
+        if (i == center) {
+            val = 2 * Math.PI * freq;
+        }
+        else {
+            val = Math.sin(2 * Math.PI * freq * (i - center)) / (i - center);
+            val *= 0.54 - 0.46 * Math.cos((2 * Math.PI * i) / (length - 1));
+        }
+        sum += val;
+        coefs[i] = val;
+    }
+    sum /= gain;
+    for (let i = 0; i < length; ++i) {
+        coefs[i] /= sum;
+    }
+    return coefs;
+}
+/**
+ * Returns coefficients for a Hilbert transform.
+ * @param length The length of the kernel.
+ * @returns The kernel coefficients.
+ */
+export function makeHilbertKernel(length) {
+    length += (length + 1) % 2;
+    const center = Math.floor(length / 2);
+    let out = new Float32Array(length);
+    for (let i = 0; i < out.length; ++i) {
+        if (i % 2 == 0) {
+            out[i] = 2 / (Math.PI * (center - i));
+        }
+    }
+    return out;
+}
+/**
+ * Returns coefficients for a Blackman window.
+ * @param length The length of the kernel.
+ * @returns The kernel coefficients.
+ */
+export function makeBlackmanWindow(length) {
+    let window = new Float32Array(length);
+    for (let n = 0; n < length; ++n) {
+        window[n] =
+            0.42 -
+                0.5 * Math.cos((2 * Math.PI * n) / (length - 1)) +
+                0.08 * Math.cos((4 * Math.PI * n) / (length - 1));
+    }
+    return window;
+}
+//# sourceMappingURL=coefficients.js.map

package/dist/dsp/coefficients.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"coefficients.js","sourceRoot":"","sources":["../../src/dsp/coefficients.ts"],"names":[],"mappings":"AAAA,8DAA8D;AAC9D,kDAAkD;AAClD,EAAE;AACF,kEAAkE;AAClE,mEAAmE;AACnE,0CAA0C;AAC1C,EAAE;AACF,iDAAiD;AACjD,EAAE;AACF,sEAAsE;AACtE,oEAAoE;AACpE,2EAA2E;AAC3E,sEAAsE;AACtE,iCAAiC;AAEjC;;;;;;;;GAQG;AACH,MAAM,UAAU,iBAAiB,CAC/B,UAAkB,EAClB,UAAkB,EAClB,MAAc,EACd,IAAa;IAEb,IAAI,IAAI,KAAK,SAAS;QAAE,IAAI,GAAG,CAAC,CAAC;IACjC,MAAM,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,IAAI,GAAG,UAAU,GAAG,UAAU,CAAC;IACrC,IAAI,KAAK,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC;IACrC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACtC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;QAChC,IAAI,GAAG,CAAC;QACR,IAAI,CAAC,IAAI,MAAM,EAAE,CAAC;YAChB,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC;QAC3B,CAAC;aAAM,CAAC;YACN,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;YACjE,GAAG,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QAClE,CAAC;QACD,GAAG,IAAI,GAAG,CAAC;QACX,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;IACjB,CAAC;IACD,GAAG,IAAI,IAAI,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;QAChC,KAAK,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;IAClB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,MAAc;IAC9C,MAAM,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACtC,IAAI,GAAG,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC;IACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;QACpC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACf,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QACxC,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,MAAc;IAC/C,IAAI,MAAM,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC;IACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;QAChC,MAAM,CAAC,CAAC,CAAC;YACP,IAAI;gBACJ,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBAChD,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/dsp/converters.d.ts

@@ -0,0 +1,15 @@
+/**
+ * Converts the given buffer of unsigned 8-bit samples into a pair of
+ * 32-bit floating-point sample streams.
+ */
+export declare class U8ToFloat32 {
+    /** @param length The expected length of each sample block. */
+    constructor(length?: number);
+    private pool;
+    /**
+     * @param input A buffer containing the unsigned 8-bit samples.
+     * @returns An array that contains first the I stream and then the Q stream.
+     */
+    convert(input: ArrayBuffer): [Float32Array, Float32Array];
+}
+//# sourceMappingURL=converters.d.ts.map

package/dist/dsp/converters.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"converters.d.ts","sourceRoot":"","sources":["../../src/dsp/converters.ts"],"names":[],"mappings":"AAiBA;;;GAGG;AACH,qBAAa,WAAW;IACtB,8DAA8D;gBAClD,MAAM,CAAC,EAAE,MAAM;IAI3B,OAAO,CAAC,IAAI,CAAS;IAErB;;;OAGG;IACH,OAAO,CAAC,KAAK,EAAE,WAAW,GAAG,CAAC,YAAY,EAAE,YAAY,CAAC;CAY1D"}