Pseudocode for Karplus-Strong algorithm

Thread starter btb4198
Start date Dec 7, 2016
Tags

Algorithm

AI Thread Summary

The discussion centers on seeking pseudocode for the Karplus-Strong algorithm, a method used for synthesizing plucked string sounds. A referenced article provides a high-level description of the algorithm, outlining its principles in an accessible manner. Additionally, MATLAB code examples are available, demonstrating practical applications of the algorithm in generating guitar chords. Participants express interest in translating the algorithm into pseudocode to facilitate understanding and implementation in various programming environments. The focus remains on clarifying the algorithm's mechanics and providing resources for further exploration.

Dec 7, 2016

btb4198

Does anyone have some Pseudocode for Karplus-Strong algorithm?

Technology news on Phys.org

Dec 12, 2016

jedishrfu

Mentor

Insights Author

There's a paragraph on it in this article that describes it in an english/pseudo kind of way:

http://cmc.music.columbia.edu/musicandcomputers/chapter4/04_09.php

and here's some MATLAB code examples that illustrate it:

https://www.mathworks.com/help/sign...hords-using-the-karplus-strong-algorithm.html

Thread 'Learning Assembly and computer architecture for x86'

Dear Peeps I have posted a few questions about programing on this sectio of the PF forum. I want to ask you veterans how you folks learn program in assembly and about computer architecture for the x86 family. In addition to finish learning C, I am also reading the book From bits to Gates to C and Beyond. In the book, it uses the mini LC3 assembly language. I also have books on assembly programming and computer architecture. The few famous ones i have are Computer Organization and...

View full post »

Thread 'Microsoft Technical Interview question'

I had a Microsoft Technical interview this past Friday, the question I was asked was this : How do you find the middle value for a dataset that is too big to fit in RAM? I was not able to figure this out during the interview, but I have been look in this all weekend and I read something online that said it can be done at O(N) using something called the counting sort histogram algorithm ( I did not learn that in my advanced data structures and algorithms class). I have watched some youtube...

View full post »