Create the page "Discrete-time signal" on this wiki! See also the search results found.
- :[[ECE438|ECE438: "Digital Signal Processing with Applications"]] *[[Discrete-time_Fourier_transform_info|Discrete-time Fourier transform (DTFT)]]2 KB (209 words) - 13:07, 9 September 2022
- *[[ECE438|ECE438: "Digital Signal Processing with Applications]], the main page for this popular senior level ...tal_signal_processing_practice_problems_list|Practice problems on "Digital Signal Processing"]]6 KB (877 words) - 07:22, 21 March 2013
- ##[[Signal Energy and Power_(ECE301Summer2008asan)|Signal Energy and Power]] ...ntinuous-Time and Discrete-Time_(ECE301Summer2008asan)|Continuous-Time and Discrete-Time]]7 KB (921 words) - 06:08, 21 October 2011
- (a) Derive the condition for which the discrete time complex exponetial signal x[n] is periodic.2 KB (270 words) - 10:59, 21 November 2008
- (a) The FT of <math>X(j\omega)</math> of a continuous-time signal x(t) is periodic (b) The FT of <math>X(e^{j\omega})</math> of a continuous-time signal x[n] is periodic4 KB (777 words) - 11:49, 21 November 2008
- .../math> of the signal x[n] is also periodic with period N. For the periodic signal x[n], find the values of <math>a_0,a_1,...,a_{N-1}.</math> Express your an 1)b)Evaluate the value of <math>(1/N)*\sum_{n=<N>}|x[n]|^2</math> for the signal x[n] given in part (a).4 KB (815 words) - 10:57, 21 November 2008
- The command is ifft. It takes in a vector representing your signal and produces a vector of the fourier series coefficients. Two examples are The signal is represented by the graph below and is periodic for all time:5 KB (834 words) - 17:26, 23 April 2013
- :[[2015_Spring_ECE_438_Ersoy|ECE438: "Digital SIgnal Processing", Prof. Ersoy]] :[[2014_Fall_ECE_438_Boutin|ECE438: "Digital SIgnal Processing"]]13 KB (1,570 words) - 13:53, 7 August 2018
- [[Category:signal processing]] 2) Digital Signal = a signal that can be represented by a sequence of 0's and 1's.3 KB (532 words) - 06:43, 16 September 2013
- *<math>\omega_m</math>: Maximum frequency in a band-limited signal (<math> = max(\{|w|\ :\ w \neq 0\})</math> ...hen the band-limited signal can be uniquely reconstructed from the sampled signal.2 KB (406 words) - 11:08, 12 November 2010
- [[Category:signal processing]] <li>Signal Characteristics</li>3 KB (508 words) - 06:43, 16 September 2013
- [[Category:signal processing]] <p><strong>Discrete-time:</strong> (a.k.a. Kronecher delta fn.)<br/>2 KB (408 words) - 06:43, 16 September 2013
- ! colspan="2" style="background: #bbb; font-size: 110%;" | Discrete-Time Domain *[[CT Time-averaged Power of a Signal over an infinite interval_ECE301Fall2008mboutin]] {{:CT Power of a Signal_8 KB (989 words) - 07:20, 5 February 2009
- ...Fourier transform of x[n], which is the sampled signal of continuous time signal x(t) <br>546 B (93 words) - 20:27, 18 February 2009
- ...at starts at -1e-4 and goes to 1e-4. The ideal sampler creates a discrete signal with 5 points each 5e-5 apart.844 B (152 words) - 18:26, 11 February 2009
- Note: PM refers to the official course book, Digital Signal Processing, 3rd edition, J.G. Proakis and D.G. Manolakis. ...due.edu/~bouman/ece438/lecture/module_1/1.1_signals/1.1.1_signal_types.pdf Signal Types]8 KB (1,226 words) - 11:40, 1 May 2009
- =Rhea Section for [[ECE438|ECE 438: Digital Signal Processing with Applications]] Professor [[User:mboutin|Boutin]], Fall 20097 KB (1,067 words) - 12:05, 25 June 2010
- * [[HW1.5 Nicholas Browdues - Signal Power and Energy_ECE301Fall2008mboutin]] * [[HW1.5 Ben Laskowski - Signal Power and Energy_ECE301Fall2008mboutin]]24 KB (3,272 words) - 06:58, 1 September 2010
- A discrete time signal is periodic if there exists T > 0 such that x(t + T) = x(t) A continuous time signal is periodic if there exists some integer N > 0 such that x[n + N] = x[n]1 KB (205 words) - 07:20, 14 April 2010
- A continuous time signal is periodic if there exists a value <math> T </math> such that <math> x(t + A discrete time signal is periodic if there exists a value <math> N </math> such that <math> X[n +1 KB (169 words) - 07:22, 14 April 2010
- ==Periodic Signal== In discrete time, a signal x[n] is considered a '''periodic signal''' if there exists a natural number N such that for all integers n, x[n+N]2 KB (279 words) - 07:18, 14 April 2010
- <math>x[n]=</math><math>j^{n}</math> is a discrete time (DT) periodic signal. It's period is 4*k, where k is an integer. However, it's fundamental perio <math>x[n]=\cos{n}</math> is an example of a non-periodoc signal because there is not integer value for n such that <math>x[n+N]=x[n]</math>883 B (143 words) - 07:24, 14 April 2010
- A continuous time signal x(t) is periodic if there exists T such that x(t + T) = x(t) for all t. <br A discrete time signal x[n] is periodic if there exists some integer N such that x[n + N] = x[n] f1 KB (192 words) - 07:28, 14 April 2010
- A Continuous Time signal is said to be periodic if there exists <math>\ T > 0</math> such that <math A Discrete Time signal is said to be periodic if there exists <math>\ N > 0</math> (where N is an1 KB (221 words) - 12:21, 5 September 2008
- == Periodic Signal Definition == *For a Continuous-time signal1 KB (209 words) - 09:49, 5 September 2008
- This is a discrete signal too.677 B (97 words) - 20:44, 4 September 2008
- ...e'' function, this is not the case. The definition for a periodic discrete signal is that there exists an ''integer'' <math>N > 0</math> such that <math>x[n1 KB (189 words) - 21:21, 4 September 2008
- A periodic signal is one that for a given real number "a": ===Periodic Signal===1 KB (195 words) - 07:20, 14 April 2010
- == Discrete time periodic signal Example == [[Image:dts_ECE301Fall2008mboutin.png|200px|thumb|left|Periodic Discrete Time Signal]]575 B (98 words) - 10:58, 5 September 2008
- ==Periodic Signal== A continuous time (CT) signal is periodic if it there exists some T such that x(t+T)=x(t) for all t.811 B (148 words) - 13:12, 5 September 2008
- ...s say you put signal x into the system and the output is Ax. Then you put signal y into the system and the output is By. Then a linear system with signals2 KB (352 words) - 11:17, 12 September 2008
- ...follows a square effect because of the <math>k^2+1</math> that each output signal is affected by.546 B (99 words) - 07:26, 11 September 2008
- '''Changing a Periodic Continuous Time Signal to a Non-Periodic Discrete Time Signal''' ...nsider the continuous time signal <math>x(t)=sin(t)</math>. Plotting this signal yields a smooth waveform that repeats itself with period <math>T=2\pi</math3 KB (536 words) - 11:07, 10 September 2008
- == Continuous to discrete time signal== I used the signal <math>y = cos(n)\,</math> as the signal of my graph1 KB (196 words) - 20:31, 10 September 2008
- === Periodic Continuous Time Signal === ...y people used in Homework 1 for their example of a periodic function. The signal repeats itself at intervals of <math> 2\pi </math>.1 KB (196 words) - 11:07, 10 September 2008
- == CT periodic signal == An example of a periodic signal in continuous time is:1 KB (227 words) - 17:24, 10 September 2008
- I chose to use the CT (continuous time)periodic signal: y(t) = cos(t). The signal can be expressed as both periodic and non-periodic in DT (discrete time).809 B (142 words) - 17:35, 10 September 2008
- A system is called time invariant if for any input signal x(t)(x[n]) and for any t0 belongs to R, the response to the shifted inputX( ...= 10 x(t-t0)where as a system is called time variant when we find an input signal for which the condition of time invariance is violated.2 KB (379 words) - 18:38, 10 September 2008
- ...ting two DT signals (one periodic and one non-periodic) from a periodic CT signal== Let <math>x(t) = sin (2\pi t),</math> which is a periodic CT signal2 KB (380 words) - 10:24, 11 September 2008
- ...ework 1 were boring (including mine) so I thought I'd broaden the periodic signal pool. I chose the CT signal: <math>x(t) = |2*cos(.5*t)|</math> . A graph of this signal in continuous time is shown below.1 KB (207 words) - 17:25, 11 September 2008
- Here I use the CT signal x=sin(2*pi*t) with a period of 1 sec: Producing a periodic discrete time signal from the signal above with sampling rate SR=0.01:727 B (118 words) - 16:11, 12 September 2008
- ...as Browdues has used in the previous Homework 1 assignment as my reference signal.1 KB (172 words) - 13:17, 12 September 2008
- ...ne of the signals in the left column, then the output is the corresponding signal in the right column:2 KB (368 words) - 10:26, 12 September 2008
- <b>Changing a Periodic Continuous Time Signal to a Non-Periodic Discrete Time Signal</b> The signal I chose for this part can be found [[HW1.4 Wei Jian Chan - Periodic and Non1 KB (186 words) - 16:07, 11 September 2008
- I choose y(t)=cos(t) as my continous signal. ...ple the signal y(t)=cos(t) at 100 Hz and so we get the following discrete signal which is periodic1 KB (207 words) - 21:44, 11 September 2008
- ...ere is a bug in this code. The timestep in this case makes the part of the signal that is plotted is considered to small to get a full sample.853 B (162 words) - 12:08, 12 September 2008
- 1.This is a sine function of period 2. Function is sin(pi*t). Continuous Signal. 2. '''Periodic DT Signal'''This is the discrete signal of the same function in 1 with sampling time of 0.075. I got the diagram on642 B (86 words) - 10:23, 12 September 2008
- Periodic signal ...of the frequency of the signal will result in a non-periodic Discrete Time signal.775 B (125 words) - 17:10, 12 September 2008
- ...ting two DT signals (one periodic and one non-periodic) from a periodic CT signal== I choose <math>x(t) = sin (2\pi t),</math> which is a periodic CT signal649 B (104 words) - 16:13, 12 September 2008
- A system is called "'''time invariant'''" if for any input signal x(t) in continuous time or x[n] in discrete time and for any time <math>t_0 A system is called "'''time variant'''" if for any input signal x(t) in continuous time or x[n] in discrete time and for any time <math>t_01 KB (193 words) - 18:59, 18 September 2008
- == Computing the Fourier series coefficients for a Discrete Time signal x[n] ==900 B (178 words) - 12:47, 25 September 2008
- The response to the input signal <math>z^n</math> is <math>H(z)z^n</math>, giving680 B (127 words) - 03:59, 15 October 2008
- In our textbook(Signal and System,second edition,oppenheim), If we look up p328 and p329, they ha2 KB (345 words) - 10:01, 23 October 2008
- ...e signal to discrete-time signal, process the discrete-time signal using a discrete-time system and convert it back to continuous time. ...and X(j<math>\omega\,</math>) be the continuous Fourier transform of that signal. Then,1 KB (214 words) - 08:00, 10 November 2008
- ...the uniformly spaced discrete samples are a complete representation of the signal if this bandwidth is less than half the sampling rate. ...signal and <math>X(W)\,</math> be the continuous Fourier transform of that signal2 KB (303 words) - 10:24, 10 November 2008
- Let <math>x(t)</math> be a signal with <math>X(\omega) = 0</math> when <math>|\omega| > \omega_m</math>. <math>\omega_m</math> Maximum frequencye for a band limited signal2 KB (349 words) - 12:09, 10 November 2008
- ...the uniformly spaced discrete samples are a complete representation of the signal if this bandwidth is less than half the sampling rate. ...signal and <math>X(w)\,</math> be the continuous Fourier transform of that signal (which exists if <math>x(t)\,</math> is square-integrable)2 KB (303 words) - 12:15, 10 November 2008
- ...AB. By use of sampling a continuous signal can be converted to a discrete signal, manipulated via a computer program and then converted back into a continuo1 KB (274 words) - 06:49, 16 September 2013
- ...u have used a good sampling rate, you should be able to reconstruct the CT signal without much fuss.829 B (155 words) - 16:53, 10 November 2008
- ...rm is used on continuous signal while z transform is used for the discrete signal. The z- transform of a general discrete signal x[n] is defined as2 KB (316 words) - 15:23, 3 December 2008
- For a D.T. signal <math>x[n]\,</math>, the z-Transform is defined as Any z-Transform will have a realm of convergence. For example, if your signal is:519 B (87 words) - 19:58, 3 December 2008
- #'''Signal Reconstruction Using Interpolation:''' the fitting of a continuous signal to a set of sample values ##Analog vs. Digital: The Show-down (A to D conversion -> Discrete-Time Processing System -> D to A conversion21 KB (3,312 words) - 11:58, 5 December 2008
- The z-Transform is the more general case of the discrete-time Fourier transform. For the DT Fourier transform <math>z = e^{j\omega }</mat ! Property !! Signal6 KB (938 words) - 06:59, 8 December 2008
- :(c) an ability to determine the response of linear systems to any input signal convolution in the time domain. [1,2,4;a,e,k] :(e) an ability to determine the response of linear systems to any input signal by transformation to the frequency domain, multiplication, and inverse tran7 KB (1,017 words) - 10:05, 11 December 2008
- #'''Signal Reconstruction Using Interpolation:''' the fitting of a continuous signal to a set of sample values ##Analog vs. Digital: The Show-down (A to D conversion -> Discrete-Time Processing System -> D to A conversion2 KB (254 words) - 07:05, 8 December 2008
- ##[[Signal Energy and Power_Old Kiwi]] ##[[ Discrete-time Fourir Transform_Old Kiwi]]4 KB (531 words) - 11:32, 25 July 2008
- (a) Derive the condition for which the discrete time complex exponetial signal x[n] is periodic.2 KB (259 words) - 17:17, 30 June 2008
- (a) The FT of <math>X(j\omega)</math> of a continuous-time signal x(t) is periodic (b) The FT of <math>X(e^{j\omega})</math> of a continuous-time signal x[n] is periodic4 KB (739 words) - 20:48, 30 July 2008
- .../math> of the signal x[n] is also periodic with period N. For the periodic signal x[n], find the values of <math>a_0,a_1,...,a_{N-1}.</math> Express your an 1)b)Evaluate the value of <math>(1/N)*\sum_{n=<N>}|x[n]|^2</math> for the signal x[n] given in part (a).4 KB (803 words) - 11:10, 22 July 2008
- Note: PM refers to the official course book, Digital Signal Processing, 3rd edition, J.G. Proakis and D.G. Manolakis. * Basic Signals and Signal Properties9 KB (1,237 words) - 09:29, 5 October 2009
- [[GPS Signal Processing]] --[[User:Kheldman|Kheldman]] [[HW3_Signal_Reconstruction_Interpolation|Signal Reconstruction for band-limited functions]] -- [[User:pclay|pclay]]4 KB (543 words) - 07:02, 25 August 2010
- ...can be used when only one period of the signal is analyzed. The DFT of a signal will be discrete and have a finite duration. <math>X[k] = Y(k \frac{ 2 \pi}{N})</math> where Y(w) is the DTFT of signal4 KB (695 words) - 06:46, 23 September 2011
- System 1: A discrete signal for the amount of toilet paper and how much is used in a period of time(one What is the signal and the system? : The signal would be a weight sensor on the toilet paper measuring how much is taken aw993 B (192 words) - 11:01, 23 June 2009
- [[Image:Discrete-Time Signal Processing - 2ed - Oppenheim.pdf]]63 B (9 words) - 11:55, 18 June 2009
- forms convolution of two discrete-time input signals. Note that the assume that a finite-length input signal is such that it is zero outside of3 KB (451 words) - 00:38, 2 July 2009
- ...ath>p(t) = \sum_{n=-\infty}^\infty \delta(t-nT)</math>. This creates a new signal, <math>x_p(t)</math>, which consists of a series of equally spaced impulses ...al. The reason it is not, however, is because the index of a discrete time signal needs to be an integer. To changes this, all that needs to be done is a tra851 B (157 words) - 17:37, 4 August 2009
- n = Lx + Lh -1; % Length of the output signal stem(y) % make it like a discrete signal287 B (57 words) - 11:03, 1 July 2009
- [[Category:discrete-time Fourier transform]] *The Discrete-time Fourier transform (DTFT) is <math>{\mathcal X}(\omega) = {\mathcal F} \left1 KB (216 words) - 14:49, 1 May 2015
- ...the DT Fourier transform look like if the discretization represents the CT signal well?". Should we organize another recitation on that topic?--[[User:Mbou2 KB (375 words) - 04:11, 3 September 2009
- [[Category:signal processing]] The z-transform converts a discrete-time signal into a complex frequency domain representation.2 KB (252 words) - 06:55, 16 September 2013
- [[Category:signal processing]] ...frequency spectrum of a signal the faster we sample it. Naturally, if the signal changes much faster than the sampling rate, these changes will not be captu8 KB (1,452 words) - 06:49, 16 September 2013
- '''Q:''' What is a digital signal? '''A:''' A signal that can be represented by a sequence of 0's and 1's.1 KB (170 words) - 10:07, 23 September 2009
- ...tions caused by analog circuitry. One area that this can be applied is in signal reconstruction, where a low pass analog filter is used on the output of a d ...ed to relax requirements on analog low pass filter design while decreasing signal distortion.5 KB (840 words) - 19:08, 22 September 2009
- ...s time signal (consisting of infinite number of points) to a discrete time signal (finite points). This process enables the conversion of analog signals to ...period T). This can be achieved by multiplying the given continuous time signal by a train of dirac delta functions separated by the time period T. This c3 KB (527 words) - 11:50, 22 September 2009
- xc(t)=continuous time signal x[n]=discrete time signal1 KB (219 words) - 11:36, 23 September 2009
- ...culated to express these coefficients as a function of frequency. For the discrete-time case, the analysis equation is expressed as follows: ...signal, x[n]. To demonstrate why this is the case, consider the following discrete-time function:8 KB (1,268 words) - 07:16, 23 September 2009
- [[Category:digital signal processing]] Definition: let x[n] be a DT signal with Period N.3 KB (640 words) - 13:17, 2 December 2011
- ...s attenuating high frequency portions of the image unless they have a high signal energy (aka, they're significant in the reconstruction and representation o5 KB (850 words) - 09:00, 23 September 2009
- Let X[n] be a DT signal with period N2 KB (491 words) - 23:03, 22 September 2009
- ** Application to Actual 1-D signal ...tween samples and the Low Pass Filter removes the extraneous copies of the signal beyond W/D shown in the output below.5 KB (847 words) - 11:54, 21 September 2012
- xc(t)=continuous time signal x[n]=discrete time signal1 KB (215 words) - 11:28, 23 September 2009
- *[[SignalMetricsFormula|Signal Metrics Definitions and Formulas]] (used in [[ECE301]], [[ECE438]]) **[[Table DT Fourier Transforms|Discrete-time Fourier Transform Pairs and Properties]] (used in [[ECE301]], [[ECE438]])3 KB (294 words) - 15:44, 12 March 2015
- keywords: energy, power, signal '''Signal Metrics Definitions and Formulas'''2 KB (307 words) - 14:54, 25 February 2015
- ...ignals_ECE301S11|Compute the norm of a continuous-time complex exponential signal (practice problem)]] from [[ECE301]] ..._signals_ECE301S11|Compute the norm of a discrete-time complex exponential signal (practice problem)]] from [[ECE301]]2 KB (293 words) - 05:21, 3 November 2011
- ...ler's formula to compute the norm of a continuous-time complex exponential signal (practice problem)]] from [[ECE301]] ...Euler's formula to compute the norm of a discrete-time complex exponential signal (practice problem)]] from [[ECE301]]2 KB (249 words) - 18:27, 23 February 2015
- ...ectrical Engineers, the first person that comes to mind when someone says "SIGNAL PROCESSING" is Fourier. *Jean Baptiste Joseph Fourier (1768 - 1830) laid a rock-solid foundation for signal analysis, when he claimed that all (continuously differentiable) signals ca10 KB (1,646 words) - 11:26, 18 March 2013
- ...your concepts of Fourier and Z transforms should be absolutely clear for signal processing (DSP ECE 438).--[[User:Hlalwani|Hersh Lalwani]] 14:55, 11 Decemb ...ce, furiere and z-transform and signals and systems of continuous-time and discrete-time. However, it contains a lot of mathematics skill and some tricky part mathe14 KB (2,366 words) - 17:32, 21 April 2013
- ...you understand the lecture's material. The textbook for ECE 438 - "Digital Signal Processing" by Proakis - is very mediocre but has some examples. It wasn't *Labs are awesome as you get to deal with practical aspect of signal and image processing.You will learn all sort of things to create a digital17 KB (3,004 words) - 08:11, 15 December 2011
- | Let x[n] be a periodic DT signal, with period N.4 KB (633 words) - 15:28, 23 April 2013
- As everybody in the class seems to know quite well, the continuous-time signal <math> x(t) = cos(t) </math> is a periodic function with period <math> 2\pi ...pling <math> x(t) </math> every <math>T</math>, we obtain a discrete-time signal <math>f[n]</math>. However, <math>f[n]</math> is not necessarily periodic:4 KB (736 words) - 17:25, 23 April 2013
- ...ng, quantization, and discrete-time processing of continuous-time signals. Discrete-time nonlinear systems: median-type filters, threshold decomposition. System des <br/>iii. an ability to determine the response of linear systems to any input signal by convolution in the time domain.3 KB (394 words) - 07:08, 4 May 2010
- <br/><br/>9. Signal detection, signal estimation, cross-correlation functions<br/><br/>2 KB (231 words) - 07:20, 4 May 2010
- [[Category:digital signal processing]] ...hat can be used to describe almost anything in the world be it an electric signal or the stock market. Did you know that our brain picks up different frequen13 KB (2,348 words) - 13:25, 2 December 2011
- ...ow Function]] (used when discussing leakage effect of signal truncation in discrete-time). ...to a 3% bonus by contributing a Rhea page on a subject related to digital signal processing. To pick a subject, simply write your name next to it. Please no9 KB (1,221 words) - 11:00, 22 December 2014
- Note: PM refers to the official course book, Digital Signal Processing, 3rd edition, J.G. Proakis and D.G. Manolakis. Prentice Hall, 19 *Basic Signals and Signal Properties9 KB (1,331 words) - 07:15, 29 December 2010
- ...computation|A collective page to practice computing Fourier series of a CT signal]] ...putation_DT|A collective page to practice computing Fourier series of a DT signal]]2 KB (211 words) - 05:39, 26 September 2011
- ...requencies. It is highly suggested that students review the periodicity of discrete-time complex exponentials (including the concept of harmonics). ...hted its relationship with the DTFT. We also computed the z-transform of a signal for which the Fourier transform does not exist. The first student who creat2 KB (233 words) - 07:52, 7 September 2010
- [[Category:Fourier series discrete-time]] ...pages contains exercises to practice computing the Fourier series of a DT signal =2 KB (355 words) - 09:44, 29 December 2010
- ...Compute the DT Fourier series coefficients of the following discrete-time signal:= ...mmended_exercise_Fourier_series_computation_DT|More exercises on computing discrete-time Fourier series]]982 B (156 words) - 16:41, 30 November 2010
- ...condition, the sampling frequency must be larger than the twice of maximum signal frequency, in order to avoid the aliasing when sampling. The frequency domain relationship betweeen a signal <math>x[n]</math> and its upsampled version <math>z[n]</math> can be shown3 KB (467 words) - 19:52, 20 September 2010
- [[Category:digital signal processing]] <math>\text{ Sample a continuous signal x(t)=sin(}\omega t)\text{ with period of T, }</math>2 KB (373 words) - 10:41, 11 November 2011
- [[Category:discrete-time Fourier transform]] =Discrete-time Fourier transform of a window function=1 KB (243 words) - 09:25, 29 December 2010
- ...s because in the frequency domain you are trying to insert D copies of the signal every <span class="texhtml">2π</span>.5 KB (778 words) - 09:11, 1 October 2010
- [[Category:digital signal processing]] ...,...,N-1</math> denote the N point Discrete Fourier Transform (DFT) of the signal x[n],n=0,...,N-1.2 KB (439 words) - 10:41, 11 November 2011
- [[Category:digital signal processing]] ...1</math>, which satisfies the following relationship for any discrete-time signal <math>x[n]</math>,3 KB (462 words) - 10:42, 11 November 2011
- ...satisfy <math>x[n]=h_2[n]\ast h_1[n]\ast x[n]</math> for any discrete-time signal <math>x[n]</math>,1 KB (200 words) - 11:20, 13 October 2010
- ...d N. Then the Discrete Fourier Transform X[k] of x[n] is the discrete-time signal defined by521 B (90 words) - 15:35, 8 October 2010
- ...d N. Then the Discrete Fourier Transform X[k] of x[n] is the discrete-time signal defined by *[[My_use_for_the_DFT!|Digital Signal Processing Project by A. Kumar using DFT]]1 KB (219 words) - 13:25, 2 December 2011
- ...eriodic signal then corresponds to a sampling of the DTFT of the truncated signal. We discussed the artifacts created by signal truncation (leakage) and the problems created by sampling the DTFT (the "pi985 B (141 words) - 15:57, 8 October 2010
- ...g a matrix equation to represent the transformation from a finite duration signal to the DFT.1 KB (158 words) - 15:59, 8 October 2010
- ...t, one should write "the DFT of the periodic repetition with period N of a signal with finite duration N"). If you found my diagrams hard to read on the boar1,003 B (148 words) - 16:16, 8 October 2010
- ...tal_signal_processing_practice_problems_list|Practice Question on "Digital Signal Processing"]]''' (On Computing the DFT of a discrete-time periodic signal.)5 KB (766 words) - 14:22, 21 April 2013
- ...tal_signal_processing_practice_problems_list|Practice Question on "Digital Signal Processing"]]''' ...><span style="color:purple"> Compute the z-transform of the discrete-time signal3 KB (569 words) - 12:48, 26 November 2013
- [x,X]=signal(w1,w2,k,N); Denote N is the points number of the input signal's DFT. Then N=6.10 KB (1,690 words) - 17:44, 23 October 2011
- ...transforms one complex-valued function of a real variable into another. In signal processing, the domain of the original function is typically in the time do4 KB (746 words) - 08:47, 11 November 2013
- [[Category:signal processing]] ...tal_signal_processing_practice_problems_list|Practice Question on "Digital Signal Processing"]]'''7 KB (1,273 words) - 12:42, 26 November 2013
- =About the Fourier Tranform of a Rectangular Window in discrete-time= *[[ECE438|Digital Signal Processing with Applications]]382 B (52 words) - 12:59, 22 October 2010
- [[Category:digital signal processing]] Q2. The condition for the discrete-time signal <math>x[n]</math> to be real is3 KB (479 words) - 10:42, 11 November 2011
- ...the first signal, and <math>X_2[k]</math> be the N-point DFT of the second signal. If we assume that Consider the discrete-time signal2 KB (366 words) - 12:16, 27 October 2010
- Definition: let x[n] be a DT signal with Period N. Then, ...efficients of continuous periodic function x[n]? <br> The DFT of a sampled signal x[n] of length N is directly proportional to the Fourier series coefficient19 KB (3,208 words) - 11:23, 30 October 2011
- [[Category:digital signal processing]] Q2. Consider the discrete-time signal3 KB (561 words) - 10:43, 11 November 2011
- ...h> yields circular-shifting to the left by 2 in the periodic discrete-time signal)6 KB (1,128 words) - 16:16, 2 December 2010
- [[Category:digital signal processing]] Q2. Consider the discrete-time signal3 KB (398 words) - 10:43, 11 November 2011
- Suppose <math>X(\omega)\,\!</math> is the DTFT of a discrete-time signal <math>x[n]\,\!</math>.635 B (105 words) - 11:24, 17 November 2010
- ...> yields circular-shifting to the right by 1 in the periodic discrete-time signal)2 KB (392 words) - 12:08, 17 November 2010
- [[Category:digital signal processing]]3 KB (515 words) - 10:43, 11 November 2011
- ...[Complex Exponential and Sinusoidal Amplitude Modulation|videos explaining signal modulation]]! ...problems to practice CT convlution, and two problems for practicing basic signal's properties. -pm18 KB (2,485 words) - 10:36, 11 November 2011
- Topic: Signal Energy and Power ...</math> and the power <math>P_\infty</math> of the following discrete-time signal2 KB (317 words) - 16:18, 26 November 2013
- <br> Since the signal has '''finite energy''', then we expect that it has '''zero average power'' <br> Since the signal has '''infinite energy''', then we expect that it has '''average power that9 KB (1,579 words) - 16:57, 15 February 2011
- *[[SignalMetricsFormula|Signal Metrics Definitions and Formulas]] *[[Table DT Fourier Transforms|Discrete-time Fourier Transform Pairs and Properties]]890 B (101 words) - 17:30, 21 April 2013
- ...ving|Practice Question]] on Computing the Fourier Series coefficients of a discrete-time (sampled) cosine wave = Obtain the Fourier series coefficients of the DT signal3 KB (548 words) - 10:24, 11 November 2011
- ..._solving|Practice Question]] on Computing the Fourier Series discrete-time signal = Obtain the Fourier series the DT signal2 KB (264 words) - 10:25, 11 November 2011
- *Signal [[Signal_power_CT|Power]] and [[Signal_energy_CT|Energy]] in CT **[[Signal power energy exercise CT ECE301S18 exponential|Compute the power and energy12 KB (1,768 words) - 10:25, 22 January 2018
- ...of shifted copies (shifted by <math>2 \pi k</math>, with k integer)of our signal. ...ng practice problems on computing the Fourier transform of a discrete-time signal:2 KB (346 words) - 14:13, 28 February 2011
- ...|Practice Question]] on Computing the Fourier Transform of a Discrete-time Signal = Compute the Fourier transform of the signal1 KB (198 words) - 10:27, 11 November 2011
- ...|Practice Question]] on Computing the Fourier Transform of a Discrete-time Signal = Compute the Fourier transform of the signal1 KB (161 words) - 10:27, 11 November 2011
- ...|Practice Question]] on Computing the Fourier Transform of a Discrete-time Signal = Compute the Fourier transform of the signal1 KB (203 words) - 10:28, 11 November 2011
- Compute the Fourier transform of the discrete-time signal <math>x[n]=5^{-|n+2|}</math>. (Use the definition of the Fourier transform, ...ral formula) to compute the inverse Discrete-time Fourier transform of the signal4 KB (695 words) - 18:23, 7 March 2011
- ...</span> for the computation of the Fourier transform of the discrete-time signal. If an integral was used in place of a summation, give zero points. Check e6 KB (1,090 words) - 07:36, 22 March 2011
- ...(t). The physiological system being modeled, h(t), will convert this signal into output, y(t). For example, the blood clotting mechanism can be i ...rresponding to adenine, guanine, cytosine, and thymine.) Furthermore, this signal must be broken into distinct genes and decoded. These genes can be ma17 KB (2,368 words) - 10:53, 6 May 2012
- The signal <math class="inline"> x(t)= e^{j \pi t }\frac{\sin (\pi t)}{t} </math> is s ...omega \right| > \omega_m </math>. Can one recover the signal x(t) from the signal <math class="inline"> y(t)=x(t) p(t-3) </math>, where3 KB (451 words) - 06:40, 1 April 2011
- [[Category:signal processing]] = [[ECE438|ECE 438]]: Digital Signal Processing with Applications =10 KB (1,359 words) - 03:50, 31 August 2013
- [[Category:signal processing]] Note: PM refers to the official course book, Digital Signal Processing, 3rd edition, J.G. Proakis and D.G. Manolakis. Prentice Hall, 199 KB (1,341 words) - 03:52, 31 August 2013
- ...tal_signal_processing_practice_problems_list|Practice Question on "Digital Signal Processing"]]'''6 KB (928 words) - 09:25, 11 November 2013
- ...tal_signal_processing_practice_problems_list|Practice Question on "Digital Signal Processing"]]'''4 KB (621 words) - 09:24, 11 November 2013
- [[Category:discrete-time Fourier transform]] ...tal_signal_processing_practice_problems_list|Practice Question on "Digital Signal Processing"]]'''6 KB (1,000 words) - 12:33, 26 November 2013
- ...tal_signal_processing_practice_problems_list|Practice Question on "Digital Signal Processing"]]''' Topic: Discrete-time Fourier transform computation6 KB (1,090 words) - 12:35, 26 November 2013
- ...es, a low-pass filter could be applied to this upsampling so to obtain the signal [[Category:signal processing]]1 KB (213 words) - 06:24, 11 September 2013
- ...tal_signal_processing_practice_problems_list|Practice Question on "Digital Signal Processing"]]''' Compute the discrete Fourier transform of the discrete-time signal4 KB (735 words) - 14:19, 21 April 2013
- ...tal_signal_processing_practice_problems_list|Practice Question on "Digital Signal Processing"]]''' (This problem clarifies how zero-padding a signal changes its DFT.)3 KB (513 words) - 14:20, 21 April 2013
- ...computation|A collective page to practice computing Fourier series of a CT signal]] ...putation_DT|A collective page to practice computing Fourier series of a DT signal]]2 KB (212 words) - 05:44, 26 September 2011
- Today we obtain the relationship between the CTFT of a finite duration signal and the [[Discrete_Fourier_Transform|Discrete Fourier Transform]] of its pe [[Category:signal processing]]1 KB (181 words) - 06:24, 11 September 2013
- ...particular, we pointed out the "ripples" created by the truncation of the signal. [[Category:signal processing]]1 KB (199 words) - 06:25, 11 September 2013
- ...never the periodic repetition has a period that is at least as long as the signal duration. [[Category:signal processing]]1 KB (192 words) - 06:18, 29 September 2014
- [[Category:signal processing]]614 B (78 words) - 06:25, 11 September 2013
- '''Signal''' ...is a function, so when we say a continuous time signal or a discrete time signal we really mean continuous time functions and discrete time functions.3 KB (516 words) - 17:03, 2 December 2018
- [[Category:signal processing]]574 B (73 words) - 06:26, 11 September 2013
- [[Category:signal processing]]902 B (122 words) - 06:26, 11 September 2013
- = <br/>[[ECE438|ECE 438]]: Digital Signal Processing with Applications = ...to a 3% bonus by contributing a Rhea page on a subject related to digital signal processing. To pick a subject, simply write your name next to it. Your page9 KB (1,273 words) - 20:52, 15 October 2011
- [[Category:digital signal processing]] ...tal_signal_processing_practice_problems_list|Practice Question on "Digital Signal Processing"]]'''4 KB (759 words) - 14:18, 21 April 2013
- [[Category:signal processing]]1 KB (158 words) - 06:30, 11 September 2013
- ...tal_signal_processing_practice_problems_list|Practice Question on "Digital Signal Processing"]]''' Compute the discrete-space Fourier transform of the following signal:2 KB (355 words) - 12:58, 26 November 2013
- ...tal_signal_processing_practice_problems_list|Practice Question on "Digital Signal Processing"]]''' Compute the discrete-space Fourier transform of the following signal:3 KB (473 words) - 12:59, 26 November 2013
- ...tal_signal_processing_practice_problems_list|Practice Question on "Digital Signal Processing"]]''' Compute the discrete-space Fourier transform of the following signal:4 KB (703 words) - 12:59, 26 November 2013
- [[Category:Digital Signal Processing]] ...://www.projectrhea.org/learning/practice.php Practice Problems] on Digital Signal Processing6 KB (801 words) - 22:04, 19 April 2015
- [[Category:digital signal processing]] [[Category:signal processing]]2 KB (301 words) - 06:32, 11 September 2013
- [[Category:digital signal processing]] [[Category:signal processing]]2 KB (213 words) - 06:32, 11 September 2013
- [[Category:digital signal processing]] [[Category:signal processing]]1 KB (163 words) - 06:32, 11 September 2013
- Now whats happens when we want to perform the DFT on 3 minute audio signal recorded at a 44.1 kHz sampling rate? Our handy-dandy DFT suddenly becomes ...imilar to Eq. 2, we will repeat the DFT for the entire length of the input signal. However, since we split x[n] into even and odd components, we will only re10 KB (1,717 words) - 12:02, 6 June 2014
- [[Category:digital signal processing]] [[Category:signal processing]]1 KB (157 words) - 06:33, 11 September 2013
- = [[ECE]] 538: Digital Signal Processing I = *[[SignalMetricsFormula|Signal Metrics Definitions and Formulas]]1 KB (152 words) - 12:17, 24 February 2015
- *[[Output_of_LTI_DT_system_by_convolution_ECE301S11|Output of a discrete-time LTI system by convolution]] ...tal_signal_processing_practice_problems_list|Practice problems on "Digital Signal Processing"]]4 KB (658 words) - 08:25, 7 May 2012
- Communication, Networking, Signal and Image Processing (CS) ...ath class="inline">\mathbf{X}_{n},\; n=1,2,\cdots</math> , be a zero mean, discrete-time, white noise process with <math class="inline">E\left(\mathbf{X}_{n}^{2}\ri5 KB (729 words) - 00:51, 10 March 2015
- Communication, Networking, Signal and Image Processing (CS)4 KB (616 words) - 10:19, 13 September 2013
- Communication, Networking, Signal and Image Processing (CS)4 KB (572 words) - 10:24, 10 March 2015
- Communication, Networking, Signal and Image Processing (CS)3 KB (496 words) - 10:37, 13 September 2013
- Communication, Networking, Signal and Image Processing (CS)4 KB (665 words) - 10:25, 13 September 2013
- Communication, Networking, Signal and Image Processing (CS) "Communication, Networks, Signal, and Image Processing" (CS)- Question 5, August 20118 KB (1,206 words) - 10:31, 13 September 2013
- =[[ECE438|ECE 438]] Digital Signal Processing with Applications= ...Volume can be ordered from: [http://www.lulu.com/product/paperback/digital-signal-processing-in-a-nutshell-%28volume-i%29/18805904 lulu.com].24 KB (3,522 words) - 07:28, 24 August 2012
- *[[SignalMetricsFormula|Signal Metrics Definitions and Formulas]] *[[Table DT Fourier Transforms|Discrete-time Fourier Transform Pairs and Properties]]2 KB (236 words) - 11:24, 21 September 2012
- *Signal periodicity: 1.9abcde *Find fundamental period of CT signal: 1.10817 B (113 words) - 10:57, 13 June 2016
- **[[SignalMetricsFormula|Signal Metrics Definitions and Formulas]] **[[Table_DT_Fourier_Transforms|Discrete-time Fourier Transform Pairs and Properties]]6 KB (799 words) - 10:10, 15 May 2013
- ...) = e^{-2}</math> at n=2, and so on. But because we have a constant input signal that effectively serves as a delta function at each time step, another impu ''<center>time-shifted discrete-time impulse responses due to a step function. the convolution is simply the su6 KB (991 words) - 15:18, 1 May 2016
- ...ignal, each noise level has probability of {1/10,2/10,4/10,2/10,1/10}. The signal goes through a filter, Z=2X^2+1. O: Original Signal from the counter(send out either 3V or 0V)<br>2 KB (299 words) - 18:13, 27 February 2013
- ** Eigen-Signal Analysis and Examples2 KB (246 words) - 07:21, 26 February 2014
- **Signal Photon Emission Tomography (SPECT)8 KB (1,168 words) - 07:24, 26 February 2014
- ::↳ Eigen-Signal Analysis and Examples2 KB (278 words) - 07:26, 26 February 2014
- ::↳ Eigen-Signal Analysis and Examples ...T is for continuous time signals. Let <math>x(n)</math> be a discrete time signal. Then, its DTFT, <math>X(e^{j\omega})</math> is given by <br/>10 KB (1,726 words) - 07:26, 26 February 2014
- [[Category:signal processing]] [[Category:digital signal processing]]8 KB (1,096 words) - 06:44, 14 December 2013
- [[Category:digital signal processing]] [[Category:signal processing]]9 KB (1,353 words) - 09:04, 11 November 2013
- **[[SignalMetricsFormula|Signal Metrics Definitions and Formulas]] **[[Table_DT_Fourier_Transforms|Discrete-time Fourier Transform Pairs and Properties]]4 KB (480 words) - 18:57, 10 December 2013
- ...tal_signal_processing_practice_problems_list|Practice Question on "Digital Signal Processing"]]''' Topic: Discrete-time Fourier transform computation4 KB (673 words) - 12:36, 26 November 2013
- ...tal_signal_processing_practice_problems_list|Practice Question on "Digital Signal Processing"]]''' Topic: Discrete-time Fourier transform computation5 KB (740 words) - 12:36, 26 November 2013
- ...tal_signal_processing_practice_problems_list|Practice Question on "Digital Signal Processing"]]''' Therefore the inverse Z Transform of the signal will be given by:5 KB (792 words) - 12:55, 26 November 2013
- *[[Audio_Signal_Filtering|Audio Signal Filtering]]3 KB (389 words) - 18:10, 23 February 2015
- [[Category:signal processing]] ...represesentattion of a sampling <math>x_d[n]=x(nT)</math> and the original signal x(t). We noted that, in the Fourier domain, the signals differ in three way2 KB (323 words) - 05:57, 27 September 2013
- .... Assume that the highest frequencies of interest in the electrocardiogram signal are at 2500 Hz. Choose an appropriate sampling frequency for your A/D conve3 KB (480 words) - 09:13, 27 September 2013
- [[Category:signal processing]]2 KB (294 words) - 05:58, 14 October 2013
- [[Category:signal processing]]2 KB (300 words) - 05:47, 16 October 2013
- [[Category:signal processing]]2 KB (216 words) - 05:35, 21 October 2013
- [[Category:signal processing]] ...s this imply regarding the difference equation representing the system (in discrete-time)?2 KB (353 words) - 21:19, 31 October 2013
- Now whats happens when we want to perform the DFT on 3 minute audio signal recorded at a 44.1 kHz sampling rate? Our handy-dandy DFT suddenly becomes ...imilar to Eq. 2, we will repeat the DFT for the entire length of the input signal. However, since we split x[n] into even and odd components, we will only re9 KB (1,539 words) - 08:25, 28 October 2013
- [[Category:signal processing]] ''' [[ECE438| ECE438: Digital Signal Processing with Applications]]'''1,002 B (119 words) - 05:58, 28 October 2013
- [[Category:signal processing]] ''' [[ECE438| ECE438: Digital Signal Processing with Applications]]'''4 KB (471 words) - 19:34, 9 February 2015
- [[Category:signal processing]] ...We then used this interpretation to obtain a formula for reconstructing a signal from its spectrogram. The formula boils down to a simple matrix multiplicat2 KB (260 words) - 06:57, 4 November 2013
- [[Category:signal processing]]3 KB (367 words) - 07:27, 15 November 2013
- [[Category:signal processing]]2 KB (315 words) - 06:46, 15 November 2013
- Communication, Networking, Signal and Image Processing (CS)3 KB (449 words) - 21:36, 5 August 2018
- <font size="4">Communication, Networking, Signal and Image Processing (CS)</font>6 KB (995 words) - 09:21, 15 August 2014
- ** Be able to calculate the Fourier series coefficients of a period CT signal (DT Fourier series will NOT be on the exam). (3.28a(subparts abc), 3.22, 3. ...the frequency response of a system, find the FS coefficients of the output signal. (3.13, 3.14, Quiz 3)6 KB (765 words) - 13:35, 4 August 2016
- = [[ECE438|ECE 438]]: Digital Signal Processing with Applications = ...examples, including some signal whose FT nvolves Dirac delta(s). For that signal whose FT involves Dirac delta(s), compute the FT two different ways: 1) by13 KB (1,944 words) - 16:51, 13 March 2015
- =Lab Wiki: [[2014_Fall_ECE_438_Boutin|ECE 438: Digital Signal Processing With Applications]], Fall 2014=2 KB (380 words) - 08:18, 2 December 2014
- [[Category:digital signal processing]] [[Category:signal processing]]9 KB (1,320 words) - 04:46, 11 September 2014
- [[Category:signal processing]] ...led'. But this process is a little different from sampling. The continuous signal will become discrete after sampling while it will still be continuous after5 KB (768 words) - 18:51, 16 March 2015
- [[Category:signal processing]]2 KB (315 words) - 05:54, 24 September 2014
- [[Category:signal processing]] Discrete-time Fourier Transform (DTFT)3 KB (515 words) - 20:02, 16 March 2015
- [[Category:signal processing]] Discrete-time Fourier transform (DTFT) of a sampled cosine4 KB (598 words) - 20:05, 16 March 2015
- [[Category:signal processing]] Discrete-time Fourier Transform (DTFT)3 KB (535 words) - 19:30, 29 September 2014
- <font size="4">[[Discrete-time Fourier transform (DTFT) Slecture by Jacob Holtman|Discrete Time Fourier Tr This slecture clearly states the definition and periodic property of Discrete-time Fourier transform. In the exponential example, it's great to make a guess a4 KB (728 words) - 05:33, 15 October 2014
- [[Category:signal processing]] The discrete time fourier transform (DTFT) of a finite energy aperiodic signal x[n] can be given by the equation listed below. IT is a representation in t5 KB (862 words) - 20:02, 16 March 2015
- [[Category:signal processing]] <font size="4">DTFT of a Cosine Signal Sampled Above and Below the Nyquist Frequency </font>5 KB (735 words) - 20:04, 16 March 2015
- <font size="2">The DTFT of a sampled signal is periodic with <span class="texhtml">2π</span>.</font> ...sed signal has a decreased magnitude compared to the original. The aliased signal also is at a different frequency.6 KB (904 words) - 20:04, 16 March 2015
- [[Category:signal processing]] Discrete-time Fourier transform (DTFT) of a sampled cosine5 KB (801 words) - 20:04, 16 March 2015
- [[Category:signal processing]] ...cy domain view of the relationship between a signal and a sampling of that signal4 KB (732 words) - 19:07, 16 March 2015
- #Derivation of DTFT of downsampled signal<br> ...ure provides definition of downsampling, derives DTFT of downsampled signal and demonstrates it in a frequency domain. Also, it explains process of dec7 KB (1,035 words) - 19:07, 16 March 2015
- ...to eliminate the possibility of aliasing and distorting the reconstructed signal. Begin with x(t) as a continuous time signal with <math>x_1[n]= x(T_1*n)</math> being its discrete time sampling.4 KB (566 words) - 09:59, 14 March 2015
- [[Category:signal processing]] First we'll take the Discrete Time Fourier Transform of the original signal and the downsampled version of it.<br>4 KB (641 words) - 09:58, 14 March 2015
- ...cy domain view of the relationship between a signal and a sampling of that signal </font> ...f original signal x(t), sampled signal x<sub>s</sub>(t) and discrete signal x<sub>d</sub>[n]. Graphs in frequency domain help to understand this4 KB (621 words) - 05:40, 15 October 2014
- ...cy domain view of the relationship between a signal and a sampling of that signal]] </font> ...hs clearly show the relationship between signal in time domain and sampled signal in frequency domain and the interpretation of Nyquist condition. Good job.4 KB (649 words) - 05:41, 15 October 2014
- <font size = 3>The purpose of Upsampling is to manipulate a signal in order to artificially increase the sampling rate. This is done by... #Discretize the signal3 KB (565 words) - 10:01, 14 March 2015
- <font size="4">Communication, Networking, Signal and Image Processing (CS)</font> Consider the 2D discrete space signal <span class="texhtml">''x''(''m'',''n'') with the DSFT of <span c5 KB (760 words) - 18:06, 12 November 2014
- [[Category:signal processing]] *[[2D_rect|2D rect signal]]3 KB (373 words) - 07:08, 24 November 2014
- =Lab Wiki: [[2015_Fall_ECE_438_Boutin|ECE 438: Digital Signal Processing With Applications]], Fall 2015=2 KB (303 words) - 13:45, 5 October 2015
- [[Category:digital signal processing]] [[Category:signal processing]]10 KB (1,356 words) - 13:19, 19 October 2015
- =Lab Wiki: [[2015_Spring_ECE_438_Ersoy|ECE 438: Digital Signal Processing With Applications]], Spring 2015= ...: [https://engineering.purdue.edu/VISE/ee438L/lab7/pdf/lab7a.pdf Lab 7a - Discrete-Time Random Processes]2 KB (384 words) - 11:44, 21 April 2015
- Communication, Networking, Signal and Image Processing (CS) ...ath class="inline">\mathbf{X}_{n},\; n=1,2,\cdots</math> , be a zero mean, discrete-time, white noise process with <math class="inline">E\left(\mathbf{X}_{n}^{2}\ri3 KB (538 words) - 00:54, 10 March 2015
- Communication, Networking, Signal and Image Processing (CS)3 KB (454 words) - 10:25, 10 March 2015
- '''The [http://mireilleboutin.com Boutin] Lectures on Digital Signal Processing - Part 1''' ==Topic 4: Discrete-time Fourier transform (DTFT)==3 KB (409 words) - 15:48, 24 March 2015
- [[Category:signal processing]] ''' [[ECE438| ECE438: Digital Signal Processing with Applications]]'''3 KB (389 words) - 19:26, 16 March 2015
- Chap 5. Discrete-Time Fourier Transform : [[Media:DTFT_Properties.pdf|Discrete-Time Fourier Transform Properties]] / [[Media:DTFT_Pairs.pdf|Pairs]] <br />6 KB (748 words) - 21:35, 10 August 2015
- [[Category:signal processing]] ...ing of that signal. To answer that question, we first computed the CTFT of signal and the DTFT of its sampling.3 KB (487 words) - 11:09, 2 September 2015
- ...is to understand the relationship between a signal and a sampling of that signal, viewed in the frequency domain. For simplicity we are focusing on pure fre '''1)''' Pick a signal of the form x(t)=sin(something) representing a note of the middle scale of2 KB (395 words) - 12:13, 7 September 2015
- ...be accomplished in an equivalent fashion by processing a sampling of that signal. ...t off frequency of 800Hz and a gain of 7. Let's call this desired filtered signal y(t).3 KB (499 words) - 16:04, 22 September 2015
- ...t off frequency of 800Hz and a gain of 7. Let's call this desired filtered signal y(t). ...such a way that a band-limited interpolation of the processed (output) DT signal would be the same as y(t)? Answer yes/no. If you answered yes, explain how.3 KB (475 words) - 15:23, 20 October 2015
- ...ies. This makes the the CQT apt for musical applications, <br />where the signal will be composed of primarily logarithmically spaced frequencies instead of4 KB (655 words) - 23:26, 22 November 2015
- <center><font size= 4>Digital Signal Processing With Application</font size> ...value) of two different transmitted frequencies component in the received signal.4 KB (546 words) - 19:34, 29 November 2015
- <center><font size= 4>Digital Signal Processing With Application</font size> ...value) of two different transmitted frequencies component in the received signal.3 KB (417 words) - 04:38, 29 November 2015
- ...''aliasing'' that occurs when converting a continuous signal to a discrete signal via sampling. ...rmation applied to an aperiodic, discrete signal in order to represent the signal in terms of it's various spectral (frequency) components. It is defined as:12 KB (2,004 words) - 20:37, 2 December 2015
- ** Moving from sampling a CT signal to a discrete time sequence.2 KB (358 words) - 21:09, 1 August 2016
- [[Category:digital signal processing]] [[Category:signal processing]]10 KB (1,357 words) - 17:02, 14 September 2016
- =Lab Wiki: [[2016_Fall_ECE_438_Boutin|ECE 438: Digital Signal Processing With Applications]], Fall 2016=2 KB (301 words) - 14:05, 26 September 2016
- ...to to understand the relationship between a signal and a sampling of that signal, viewed in the frequency domain. This time, we are looking at signals beyon Consider the signal <math>x(t)=4 \text{sinc } ( \frac{t-3}{5} ).</math>3 KB (460 words) - 09:11, 7 September 2016
- ...The z-transform is a very useful and important technique, used in areas of signal processing, system design and analysis and control theory. The formula used to convert a discrete time signal x[n] to X[z] is as follows:10 KB (1,800 words) - 10:41, 27 November 2016
- ...s this imply regarding the difference equation representing the system (in discrete-time)? ...e DTFT of the digital recording looks like the CTFT of the original analog signal, with the amplitude rescaled (multiplied) by a factor <math>\frac{1}{T}=5,07 KB (1,236 words) - 17:19, 29 November 2016
- [[Category:digital signal processing]] [[Category:signal processing]]10 KB (1,357 words) - 09:45, 8 January 2017
- =Lab Wiki: [[2017_Spring_ECE_438_Boutin|ECE 438: Digital Signal Processing With Applications]], Spring 2017=2 KB (325 words) - 18:20, 30 March 2017
- :b) understand the two different signal reconstruction methods we saw in class. ...ignal. Assuming that the highest frequency in the electroelectrocardiogram signal are at 2200 Hz, what criteria would you use to select the sampling frequen4 KB (658 words) - 14:50, 1 February 2017
- 3. A continuous time signal is such that <math> \chi(f) </math> is 0 when |f| > 3 KHz. You would like a ...mple exists with a sampling rate of 9000 samples/sec. Can you process this signal to make a band limited interpolation? If no, explain why. If yes, explain h7 KB (1,194 words) - 19:21, 24 April 2017
- ...region of convergence and translating a discrete signal into a continuous signal relate directly to the Laurent Series. ...like the Taylor Series, it builds a continuous function out of a discrete signal. This is the main way that the Laurent Series is related to DSP: its abilit6 KB (931 words) - 23:40, 23 April 2017
- Communication, Networking, Signal and Image Processing (CS) Consider the 2D discrete space signal <span class="texhtml">''x''(''m'',''n'') with the DSFT of <span c5 KB (755 words) - 20:27, 2 May 2017
- <font size="4"> Communication Networks Signal and Image processing (CS) </font> Consider the 2D discrete space signal <span class="texhtml">''x''(''m'',''n'') with the DSFT of <span c6 KB (1,023 words) - 21:03, 2 May 2017
- =Lab Wiki: [[2017_Fall_ECE_438_Boutin|ECE 438: Digital Signal Processing With Applications]], Fall 2017=3 KB (418 words) - 21:57, 7 January 2018
- ...d op-amps), and I got curious about how they works in processing the music signal from a electric guitar. So I looked up wikipedia on how distortion works as ...gnal goes through one or more pedals to create different distortion to the signal. In this case, I am using a BOSS DS-1 distortion pedal.5 KB (752 words) - 16:44, 2 December 2017
- Topic: Signal Energy and Power ...</math> and the power <math>P_\infty</math> of the following discrete-time signal2 KB (263 words) - 11:13, 22 January 2018
- == '''<big> Discrete-Time Fourier Transform Properties with Proofs''' </big>''' == ...1}{2\pi}\chi(\omega)*\gamma (\omega)^{}_{}</math> || Recall for a periodic signal of period T <math> x(t)y(t) = \int_{T}^{ }x(\tau)y(t-\tau)d\tau </math><br7 KB (1,166 words) - 13:20, 26 March 2018
- Biomedical signal processing aims at extracting significant information from physiological si ...sease, and earlier detection of both heart attacks and strokes. Biomedical signal processing is most useful in the critical care setting due to patient data12 KB (1,702 words) - 20:48, 9 April 2018
- ● Part 1 divides the audio signal into smaller pieces, these are called frames. An MDCT filter is then perfor ...t would cause a problem during the reconstruction of the sample. The final signal is given by:5 KB (752 words) - 17:40, 2 December 2018
- ...quires Nlog(N). DFT is not the same as DTFT. Both start with discrete-time signal, but DFT produces a discrete frequency domain representation while the DTFT ...analysis. A common use of FFT’s is to find the frequency component of a signal buried in a noisy time domain. Given the MATLAB code bellow, a graph will b3 KB (555 words) - 22:02, 2 December 2018
- Communicates & Signal Process (CS) Question 2: Signal Processing8 KB (1,474 words) - 16:37, 24 February 2019
- \text{1) } x(t) = sin(6 \pi t), \text{ the frequency of this signal is } \omega_{o} = 6\pi. ...= 2 + cos(6 \pi t) - \frac{1}{2} sin(3 \pi t),\text{ the frequency of this signal is } \omega_{o} = 3\pi.5 KB (951 words) - 21:55, 30 April 2019
- =Lab wiki for ECE 438:Digital Signal Processing With Applications, Fall 2019=4 KB (572 words) - 11:16, 3 December 2019
- [[Category:digital signal processing]] [[Category:signal processing]]10 KB (1,356 words) - 18:52, 20 August 2019
- ...ignal directly, this is not possible in reality since storing a real-world signal would require an infinite amount of memory. Consequently, all signals are s With this information, we can express the sampling of a CT signal <math>x(t)</math> in terms of its sampling period T:16 KB (2,611 words) - 14:11, 12 November 2019
- The convolution forms the backbone of signal processing, but what are some direct applications of it? In this page, we w7 KB (1,006 words) - 22:10, 22 December 2019
- ...eights of the peaks are called amplitudes. In signal processing, there are discrete-time signals and continuous-time signals. When time is viewed as a discrete vari ...ractical cases, one can use Nyquist's Theorem to ensure that all essential signal information is collected, while not wasting effort measuring with too much2 KB (375 words) - 21:03, 6 December 2020
- ...period must be at most half the length of the period of oscillation of the signal. But why is this the case?<br /> ...requires use of a concept known as the Fourier Transform, which converts a signal or other sinusoid from the time domain (that is, the graph is a graph of am4 KB (707 words) - 23:06, 6 December 2020
