Use of arbitrary length input array to Daubechies 4 FWT

[graetz23]

Use of arbitrary length input array to Daubechies 4 FWT

[unclekev]

Not sure I made myself completely clear in my last post (it was late at night) the 'forward' method being invoked in my code is in the Transform class, not the overridding 'forward' method in the AncientEgyptianDecomposition Class.

Thanks,

Kevin

[cscheiblich]

Hi Kevin,

just for closing the issuse, in case of someone is searching ...

a signal of 1280 is not in scope 2^p | p = {0,1,2, .. }, so the Ancient Egyptian Decomposition will do its job like 1280 => 2^10 + 2^8 and performs two separete FWTs. The array looks like: {1024, 256}.

all the best
Christian

[unclekev]

Christian,

Thanks, I progressed my design using 4 second epochs, i.e. 1024 samples, not 1280.

This was further broken down into 8 frames of 128 samples per epoch with each frame passed through JWave.

Thanks for your support.

Kevin

Sent from my iPad

On 21 Sep 2014, at 09:16, Christian [email protected] wrote:

Hi Kevin,

just for closing the issuse, in case of someone is searching ...

a signal of 1280 is not in scope 2^p | p = {0,1,2, .. }, so the Ancient Egyptian Decomposition will do its job like 1280 => 2^10 + 2^8 and performs two separete FWTs. The array looks like: {1024, 256}.

all the best
Christian

—
Reply to this email directly or view it on GitHub.

[cscheiblich]

Hi Kevin,

and did you get you receive the results you expected?

all the best
Christian.

2014-09-21 22:56 GMT+02:00 unclekev [email protected]:

Christian,

Thanks, I progressed my design using 4 second epochs, i.e. 1024 samples,
not 1280.

This was further broken down into 8 frames of 128 samples per epoch with
each frame passed through JWave.

Thanks for your support.

Kevin

Sent from my iPad

On 21 Sep 2014, at 09:16, Christian [email protected] wrote:

Hi Kevin,

just for closing the issuse, in case of someone is searching ...

a signal of 1280 is not in scope 2^p | p = {0,1,2, .. }, so the Ancient
Egyptian Decomposition will do its job like 1280 => 2^10 + 2^8 and performs
two separete FWTs. The array looks like: {1024, 256}.

all the best
Christian

—
Reply to this email directly or view it on GitHub.

—
Reply to this email directly or view it on GitHub
#6 (comment).

[unclekev]

Not absolutely certain, but I think so. I have now submitted my project thesis so will know for certain in November.

Regards,

Kevin King

On 24 Sep 2014, at 10:46, Christian [email protected] wrote:

Hi Kevin,

and did you get you receive the results you expected?

all the best
Christian.

2014-09-21 22:56 GMT+02:00 unclekev [email protected]:

Christian,

Thanks, I progressed my design using 4 second epochs, i.e. 1024 samples,
not 1280.

This was further broken down into 8 frames of 128 samples per epoch with
each frame passed through JWave.

Thanks for your support.

Kevin

Sent from my iPad

On 21 Sep 2014, at 09:16, Christian [email protected] wrote:

Hi Kevin,

just for closing the issuse, in case of someone is searching ...

a signal of 1280 is not in scope 2^p | p = {0,1,2, .. }, so the Ancient
Egyptian Decomposition will do its job like 1280 => 2^10 + 2^8 and performs
two separete FWTs. The array looks like: {1024, 256}.

all the best
Christian

—
Reply to this email directly or view it on GitHub.

—
Reply to this email directly or view it on GitHub
#6 (comment).

—
Reply to this email directly or view it on GitHub.

[cscheiblich]

Hi Kevin,

looked again into the code and you are right! The exception in Transform.forward and .reverse is misplaced!

Thanks for the hint, I am going to change it soon.

All the best
Christian