Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Dirac comb
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Dirac-comb identity == The Dirac comb can be constructed in two ways, either by using the ''comb'' [[Operator (mathematics)|operator]] (performing [[sampling (signal processing)|sampling]]) applied to the function that is constantly <math>1</math>, or, alternatively, by using the ''rep'' operator (performing [[periodic summation|periodization]]) applied to the [[Dirac delta]] <math>\delta</math>. Formally, this yields the following:{{sfn|Woodward|1953}}{{sfn|Brandwood|2003}} <math display="block">\operatorname{comb}_T \{1\} = \operatorname{\text{Π¨}}_T = \operatorname{rep}_T \{\delta \}, </math> where <math display="block"> \operatorname{comb}_T \{f(t)\} \triangleq \sum_{k=-\infty}^\infty \, f(kT) \, \delta(t - kT) </math> and <math display="block"> \operatorname{rep}_T \{g(t)\} \triangleq \sum_{k=-\infty}^\infty \, g(t - kT). </math> In [[signal processing]], this property on one hand allows [[sampling (signal processing)|sampling]] a function <math>f(t)</math> by ''multiplication'' with <math>\operatorname{\text{Π¨}}_{\ T}</math>, and on the other hand it also allows the [[periodic summation|periodization]] of <math>f(t)</math> by ''convolution'' with <math>\operatorname{\text{Π¨}}_T</math>.{{sfn|Bracewell|1986}} The Dirac comb identity is a particular case of the [[Convolution_theorem#Convolution theorem for tempered distributions| Convolution Theorem]] for tempered distributions.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)