yes, this can be very efficient when the table is pre computed.
using 32 bits int and a 8K sample table, I recently implement a BL saw~ in an arduino due with surprisingly fast and good result.

cheers
c

Le 24/11/2015 16:12, Frank Barknecht a écrit :

Hi,

On Tue, Nov 24, 2015 at 01:01:00PM -0200, Alexandre Torres Porres wrote:

Do any of you know the advantages and disadvantages between "*oversampling
+ filtering*" and the other techniques?

A big difference is CPU load: the bandlimited oscillators in the rj-library
aimed at mobile devices of some years ago use the transition splicing technique
because it's one of the fastest. It only needs a simple table lookup in
addition to the phasor~ etc.  that are running anyway. We even replaced the
tabread4~ with tabread~ to save even more CPU.

Ciao

_______________________________________________
Pd-list@lists.iem.at mailing list
UNSUBSCRIBE and account-management -> http://lists.puredata.info/listinfo/pd-list