waddafunk / smithsonians_discrete_hilbert_fourier_hartley_transforms Goto Github PK

Is your feature request related to a problem? Please describe.
Right now the transforms accept only signals with a length equals to a power of two.

Describe the solution you'd like
Generalize the transforms to signals of every length. This can be easily done by zero-padding the signal to the closest, power of two lengh > signal length before executing the transforms.

Describe alternatives you've considered
User can perform zero padding himself and transforms can be left as they are.

Additional context
Nohing to declare here.

Is your feature request related to a problem? Please describe.
-90 degree Hilbert transform
Describe the solution you'd like
Multiply orthogonal part with respect to the input of the output by -1

Describe alternatives you've considered
Low level work on the transform implementation, which could avoid looping over the output again.

Is your feature request related to a problem? Please describe.
Right now a complex signal is needed as input.

Describe the solution you'd like
A function that takes real input and recombines it to properly feed it to the algorithms.

Describe alternatives you've considered
Nothing.

Additional context
Nohing.

Is your feature request related to a problem? Please describe.
Provide additional implementations of Fourier and Hartley with no bit reversed input and output.

Describe the solution you'd like
Function to bit-revert signal.

Describe alternatives you've considered
Nothing

Additional context
Nothing