<html><head><meta http-equiv="content-type" content="text/html; charset=utf-8"></head><body dir="auto"><div>Start with some benchmarks. Without those, you haven't got a strong definition of what "faster" or "slow" means. Compare the numbers with other implementations. </div><div><br></div><div>Fourier transforms aren't exactly the bedrock of my experience. Without looking it up I can't say what the big O end up being there. The trick is too see how far off from the known optimal a given system ends up being; small variations are likely to be consequent of implementation and platform details. Large variations are usually about wrong-algorithm. </div><div><br></div><div>Anyway most of the time, if something's just a whole lot slower than it seems like it should be, there's usually some high level code that isn't using the best known algorithm. It's usually best to rule that out first. Profiling is usually the best way to find the bottleneck(s.)</div><div><br></div><div>If that fails, and the actual bottleneck turns out to be intrinsic to Smalltalk's semantics or the specifics of the virtual machine in use (FWIW this almost never happens in my experience) the usual approach is to implement a plugin or primitive for the VM. This can be done in either in C or in Slang. In most cases the latter will be preferable, as Slang code can be run in-image and take advantage of the system's inspection and debugging facilities. </div><div><br></div><div>Good hunting, and I hope this helps. </div><div><br></div><div>Casey</div><div><br></div><div><br></div><div><br>On Dec 15, 2013, at 10:55 PM, Kirk Fraser <<a href="mailto:overcomer.man@gmail.com">overcomer.man@gmail.com</a>> wrote:<br><br></div><blockquote type="cite"><div><div dir="ltr">More speed ideas...<div><br></div><div>I read of a Neural Net algorithm that was made faster by conversion from floating point to integer math. Is it possible to convert FFT from floating point to integer? I see no author tag on the code, just a book reference, Does anyone understand FFT enough to help explain how it works in enough detail to redesign it to use integers?</div>
<div><br></div><div>Some for profit Smalltalk versions have shown signs of being fast on graphics such as bouncing ball demos. Is there some tweak that can be ported to Cuis? </div><div><br></div><div>If there are no fixes for Cuis and rewriting FFT is in theory not possible, then is there another language I should be looking at? A faster Smalltalk? Should I try to reverse engineer the older but simpler Digitalk Smalltalk/V to use Cog? </div>
<div><br></div><div>I remember an old Borland C++ demo pasted circles to a much older computer display quite fast. What is the fastest object language that gives maximum peripheral access? Or is there another solution I should be looking at?</div>
<div><br></div><div>Thanks anyone... </div><div><br></div><div><br></div></div>
<br><hr align="left" width="300">
View this message in context: <a href="http://forum.world.st/Audio-and-Video-Object-Analysis-tp4730295p4730351.html">Re: Audio and Video Object Analysis</a><br>
Sent from the <a href="http://forum.world.st/Cuis-Smalltalk-f4632260.html">Cuis Smalltalk mailing list archive</a> at <a href="http://Nabble.com">Nabble.com</a>.<br></div></blockquote><blockquote type="cite"><div><span>_______________________________________________</span><br><span>Cuis mailing list</span><br><span><a href="mailto:Cuis@jvuletich.org">Cuis@jvuletich.org</a></span><br><span><a href="http://jvuletich.org/mailman/listinfo/cuis_jvuletich.org">http://jvuletich.org/mailman/listinfo/cuis_jvuletich.org</a></span><br></div></blockquote></body></html>