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
Bandlimiting
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!
{{Short description|Limiting a signal to contain only low-frequency components}} {{use mdy dates|date=September 2021}} {{Use American English|date = March 2019}} {{multiple issues| {{More citations needed|date=January 2011}} {{No footnotes|date=January 2011}} }} '''Bandlimiting''' is the process of reducing a [[Signal (electronics)|signal]]’s [[spectral density|energy]] outside a specific [[frequency]] range, keeping only the desired part of the signal’s spectrum. This technique is crucial in [[signal processing]] and [[Telecommunications|communications]] to ensure signals stay clear and effective. For example, it helps prevent interference between [[radio frequency]] signals, like those used in radio or TV broadcasts, and reduces [[aliasing]] distortion (a type of error) when converting signals to digital form for [[digital signal processing]]. [[File:bandlimited.svg|thumb|Spectrum of a '''bandlimited [[baseband]] signal''' as a function of frequency|right|300px]] ==Bandlimited signals== A '''bandlimited signal''' is a [[Signal (electronics)|signal]] that, in strict terms, has no energy outside a specific [[frequency]] range. In practical use, a signal is called bandlimited if the energy beyond this range is so small that it can be ignored for a particular purpose, like audio recording or radio transmission. These signals can be either random (unpredictable, also called [[Stochastic process|stochastic]]) or non-random (predictable, known as [[deterministic]]). In mathematical terms, a bandlimited signal relates to its [[Fourier series]] representation. Normally, a signal needs an infinite number of terms in a continuous Fourier series to describe it fully, but if only a finite number of terms are enough, the signal is considered bandlimited. This means its [[Fourier transform]] or [[spectral density]]—which show the signal’s frequency content—has "bounded support," meaning it drops to zero outside a limited frequency range. ==Sampling bandlimited signals== A [[Bandlimiting#Bandlimited signals|bandlimited signal]] can be perfectly recreated from its samples if the [[sampling rate]]—how often the signal is measured—is more than twice the signal’s [[Bandwidth (signal processing)|bandwidth]] (the range of frequencies it contains). This minimum rate is called the [[Nyquist rate]], a key idea in the [[Nyquist–Shannon sampling theorem]], which ensures no information is lost during sampling. In reality, most signals aren’t perfectly bandlimited, and signals we care about—like audio or radio waves—often have unwanted energy outside the desired frequency range. To handle this, [[digital signal processing]] tools that sample or change sample rates use bandlimiting filters to reduce [[aliasing]] (a distortion where high frequencies disguise themselves as lower ones). These filters must be designed carefully, as they alter the signal’s [[frequency domain]] magnitude and phase (its strength and timing across frequencies) and its [[time domain]] properties (how it changes over time). === Example === An example of a simple deterministic bandlimited signal is a [[Sine wave|sinusoid]] of the form <math>x(t) = \sin(2 \pi ft + \theta). </math> If this signal is sampled at a rate <math>f_s =\tfrac{1}{T} > 2f </math> so that we have the samples <math>x(nT), </math> for all integers <math>n</math>, we can recover <math>x(t) </math> completely from these samples. Similarly, sums of sinusoids with different frequencies and phases are also bandlimited to the highest of their frequencies. The signal whose Fourier transform is shown in the figure is also bandlimited. Suppose <math>x(t) </math> is a signal whose Fourier transform is <math>X(f), </math> the magnitude of which is shown in the figure. The highest frequency component in <math>x(t) </math> is <math>B. </math> As a result, the Nyquist rate is :<math> R_N = 2B \, </math> or twice the highest frequency component in the signal, as shown in the figure. According to the sampling theorem, it is possible to reconstruct <math>x(t)\ </math> completely and exactly using the samples :<math>x(nT) = x \left( { n \over f_s } \right) </math> for all integers <math>n \, </math> and <math>T \ \stackrel{\mathrm{def}}{=}\ { 1 \over f_s } </math> as long as :<math>f_s > R_N \, </math> The reconstruction of a signal from its samples can be accomplished using the [[Whittaker–Shannon interpolation formula]]. ==Bandlimited versus timelimited== {{main|Fourier transform#Uncertainty principle}} A bandlimited signal cannot be also timelimited. More precisely, a function and its Fourier transform cannot both have finite [[support (mathematics)|support]] unless it is identically zero. This fact can be proved using [[complex analysis]] and properties of the Fourier transform. === Proof === Assume that a signal f(t) which has finite support in both domains and is not identically zero exists. Let's sample it faster than the [[Nyquist frequency]], and compute respective [[Fourier transform]] <math> FT(f) = F_1(w) </math> and [[discrete-time Fourier transform]] <math> DTFT(f) = F_2(w)</math>. According to properties of DTFT, <math> F_2(w) = \sum_{n=-\infty}^{+\infty} F_1(w+n f_x) </math>, where <math>f_x</math> is the frequency used for [[discretization]]. If f is bandlimited, <math> F_1 </math> is zero outside of a certain interval, so with large enough <math> f_x </math>, <math> F_2 </math> will be zero in some intervals too, since individual [[Support (mathematics)|supports]] of <math> F_1 </math> in sum of <math> F_2 </math> won't overlap. According to DTFT definition, <math> F_2 </math> is a sum of [[trigonometric functions]], and since f(t) is time-limited, this sum will be finite, so <math> F_2 </math> will be actually a [[trigonometric polynomial]]. All trigonometric polynomials are [[Entire function|holomorphic on a whole complex plane]], and there is a simple theorem in complex analysis that says that [[Zero (complex analysis)|all zeros of non-constant holomorphic function are isolated]]. But this contradicts our earlier finding that <math> F_2 </math> has intervals full of zeros, because points in such intervals are not isolated. Thus the only time- and bandwidth-limited signal is a constant zero. One important consequence of this result is that it is impossible to generate a truly bandlimited signal in any real-world situation, because a bandlimited signal would require infinite time to transmit. All real-world signals are, by necessity, ''timelimited'', which means that they ''cannot'' be bandlimited. Nevertheless, the concept of a bandlimited signal is a useful idealization for theoretical and analytical purposes. Furthermore, it is possible to approximate a bandlimited signal to any arbitrary level of accuracy desired. A similar relationship between duration in time and [[Bandwidth (signal processing)|bandwidth]] in frequency also forms the mathematical basis for the [[uncertainty principle]] in [[quantum mechanics]]. In that setting, the "width" of the time domain and frequency domain functions are evaluated with a [[variance]]-like measure. Quantitatively, the uncertainty principle imposes the following condition on any real waveform: :<math> W_B T_D \ge 1 </math> where :<math>W_B</math> is a (suitably chosen) measure of bandwidth (in hertz), and :<math>T_D</math> is a (suitably chosen) measure of time duration (in seconds). In [[time–frequency analysis]], these limits are known as the ''[[Gabor limit]],'' and are interpreted as a limit on the ''simultaneous'' time–frequency resolution one may achieve. ==See also== *[[Band-pass filter]] *[[Band-stop filter]] ==References== {{reflist}} *{{cite book | author = William McC. Siebert | title = Circuits, Signals, and Systems | year = 1986 | location = Cambridge, MA | publisher = MIT Press }} [[Category:Digital signal processing]]
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)
Pages transcluded onto the current version of this page
(
help
)
:
Template:Cite book
(
edit
)
Template:Main
(
edit
)
Template:Multiple issues
(
edit
)
Template:Reflist
(
edit
)
Template:Short description
(
edit
)
Template:Use American English
(
edit
)
Template:Use mdy dates
(
edit
)