Linear Convolution was performed using Overlap Add method for which the length of the ip signal x(n) was 12 and h(n) was 3. The program was done by breaking the ip signal in 2 parts of length 6 each and the length of the decomposed signal was 8. So two outputs were generated and the final output was stored in y(n) of length 14. Overlap Save Method involved the same procedure and in the earlier case x1(n) and x2(n) but in OSM x1(n) s2(n) and x3(n) were generated. It was noted that OAM and OSM can be used to filter long ip sequences using FFT.
We realised that it had an important limitation wherein it required all input values to be available for giving an output. For a real world signal which can be arbitrarily long, waiting for the entire signal to arrive and get stored would cause massive delays and also increase the cost of storage equipment.
https://drive.google.com/open?id=0B8F3pY6H1pIWaGlGbVgwX2YzMUE
https://drive.google.com/open?id=0B8F3pY6H1pIWWVE5Y0xJOUhoZzg
http://preranasarode1995.blogspot.com/2016/04/oam-and-osm.html
We realised that it had an important limitation wherein it required all input values to be available for giving an output. For a real world signal which can be arbitrarily long, waiting for the entire signal to arrive and get stored would cause massive delays and also increase the cost of storage equipment.
https://drive.google.com/open?id=0B8F3pY6H1pIWaGlGbVgwX2YzMUE
https://drive.google.com/open?id=0B8F3pY6H1pIWWVE5Y0xJOUhoZzg
http://preranasarode1995.blogspot.com/2016/04/oam-and-osm.html
In OSM we cut short the before saving the signal and that leads to making it a tad faster than OAM.
ReplyDeleteOSM method is Better as compared to OAM..By using FFT for convolution complexity is further reduced.
ReplyDeleteOSM and OAM have the same computational speed.
ReplyDeleteOAM and OSM are efficient ways to calculate convolution between very long signal x[n] and finite impulse response h[n].
ReplyDelete