Content deleted Content added
Literate ape (talk | contribs) No edit summary |
m clean up spacing around commas and other punctuation, replaced: ,B → , B (2), ,J → , J, ,N → , N (2), ,P → , P, ,R → , R (3), ,S → , S, ,T → , T (2) |
||
Line 91:
:<math>N_x\cdot (\log_2(N) + 1)\cdot \frac{N}{N-M+1}.</math>
Hence the ''cost'' of the overlap–save method scales almost as <math>O\left(N_x\log_2 N\right)</math> while the cost of a single, large circular convolution is almost <math>O\left(N_x\log_2 N_x \right)</math>.
==Overlap–discard==
Line 107:
== See also ==
* [[Overlap–add method]]
* [[
==Notes==
Line 151:
|ref=refCarlin
|title=Wideband communication intercept and direction finding device using hyperchannelization
|invent1=Carlin, Joe
|invent2=Collins, Terry
|invent3=Hays, Peter
|invent4=Hemmerdinger, Barry E. Kellogg, Robert L. Kettig, Robert L. Lemmon, Bradley K. Murdock, Thomas E. Tamaru, Robert S. Ware, Stuart M.
|pubdate=1999-12-10
|fdate=1999-12-10
Line 163:
}}, <!--template creates link to worldwide.espacenet.com-->also available at https://patentimages.storage.googleapis.com/4d/39/2a/cec2ae6f33c1e7/US6898235.pdf
{{refend}}
== External links ==
* Dr. Deepa Kundur, [https://www.comm.utoronto.ca/~dkundur/course_info/real-time-DSP/notes/8_Kundur_Overlap_Save_Add.pdf Overlap Add and Overlap Save], University of Toronto
{{DEFAULTSORT:Overlap-save method}}
| |||