Re: [Octave-patch-tracker] [patch #9570] [octave forge] (signal) new function cconv: modulo-N circular convolution

[Sudeepam Pandey]

Alright. So I just wanted to suggest that instead of using the circulant matrix method, you could try using the FFT and IFFT algorithm. I suppose that it would have a lower computation time.

On 12 Mar 2018 10:20 p.m., "LEo" <leolca@gmail.com> wrote:

exactly

the FOR loop performs the matrix method

the first IF just add zeros for different length vectors
the second IF fold the vectors into themselves in case the N (modulo)
is smaller than the vector lengths, or add zeros if necessary




On Mon, Mar 12, 2018 at 1:28 PM, P Sudeepam <INVALID.NOREPLY@gnu.org> wrote:
> Follow-up Comment #2, patch #9570 (project octave):
>
> Which algorithm have you used to calculate the Circular Convolution in this
> implementation? From the code it seems like matrix method has been used but
> I'd like to make sure.
>
>     _______________________________________________________
>
> Reply to this item at:
>
>   <http://savannah.gnu.org/patch/?9570>
>
> _______________________________________________
>   Message sent via/by Savannah
>   http://savannah.gnu.org/
>