A window or block is simply a buffer. You still only know the samples that have already passed. For most of the samples in the block, you know what sample comes next, only because it also has already passed. You don't know the sample that comes next past the boundary of the block.
Now, for example, you could program a filtering algorithm on a (sufficiently fast) FPGA with zero (not quite zero, but less than one sample) latency. That's where the causal/non-causal distinction is most clear. On Sun, Sep 21, 2008 at 10:42 AM, Steffen Juul <[EMAIL PROTECTED]> wrote: > > On 21/09/2008, at 16.02, Charles Henry wrote: > >> For real-time filtering, you can't already know the sample that comes >> next. > > Isn't that what windows (=(?) blocks in Pd-lingo) is for? > _______________________________________________ Pd-list@iem.at mailing list UNSUBSCRIBE and account-management -> http://lists.puredata.info/listinfo/pd-list
