Overlap–save method: Difference between revisions

Revision as of 14:20, 9 January 2020

Revision as of 17:28, 12 January 2020

Line 5:

where h[m]=0 for m outside the region [1, ''M''].

[[Image:Overlap-save algorithm.png|thumb|500px|A sequence of 4 plots depicts one cycle of the overlap–save convolution algorithm. The 1st plot is a long sequence of data to be processed with a lowpass FIR filter. The 2nd plot is one segment of the data to be processed in piecewise fashion. The 3rd plot is the filtered segment, with the usable portion colored red. The 4th plot shows the filtered segment appended to the output stream.{{efn-ua
|Rabiner and Gold, Fig 2.35, fourth trace
}} The FIR filter is a boxcar lowpass with M=16 samples, the length of the segments is L=100 samples and the overlap is 15 samples.]]

The concept is to compute short segments of ''y''[''n''] of an arbitrary length ''L'', and concatenate the segments together. Consider a segment that begins at ''n'' = ''kL'' + ''M'', for any integer ''k'', and define''':'''

Line 85 ⟶ 87:

{{reflist}}

{{refbegin}}

#<li value="4">{{citeCite patentbook

| author1=Rabiner, Lawrence R.

| author2=Gold, Bernard

| title=Theory and application of digital signal processing

| year=1975

| publisher=Prentice-Hall

| ___location=Englewood Cliffs, N.J.

| isbn=0-13-914101-4

| chapter=2.25

| pages=[https://archive.org/details/theoryapplicatio00rabi/page/63 63–67]

| url-access=registration

| url=https://archive.org/details/theoryapplicatio00rabi/page/67

}}

#{{cite patent

| ref=refCarlin

| inventor-last =Carlin