Skip to main content

Periodicity of Continuous and Discrete Signals


Understanding Periodicity of Sinusoidal Signals: Continuous-Time vs Discrete-Time Signals

Periodicity is one of the most important concepts in Signals and Systems, and Digital Signal Processing (DSP). Many students know the formula \(T=\frac{2\pi}{\omega}\), but often get confused when similar questions appear in the context of discrete-time signals.

In this article, we will clearly understand the difference between periodicity in continuous-time (analog) signals and discrete-time (digital) signals with examples and exam-oriented shortcuts.

What is a Periodic Signal?

A signal is said to be periodic if it repeats itself after a fixed interval.

Continuous-Time (Analog) Signal

A continuous-time signal \(x(t)\) is periodic if there exists a positive number \(T\) such that:

\[ x(t+T)=x(t) \]

The smallest positive value of \(T\) is called the fundamental period.

Discrete-Time (Digital) Signal

A discrete-time signal \(x[n]\) is periodic if there exists a positive integer \(N\) such that:

\[ x[n+N]=x[n] \]

The smallest positive integer \(N\) is called the fundamental period.

Notice that in digital signals the period must always be an integer.


Periodicity of Continuous-Time Sinusoids

Consider the analog sinusoidal signal:

\[ x(t)=A\cos(\omega t+\phi) \]

where:

  • \(A\) = Amplitude
  • \(\omega\) = Angular frequency (rad/s)
  • \(\phi\) = Phase angle

For periodicity,

\[ \omega T = 2\pi \]

Therefore,

\[ T=\frac{2\pi}{\omega} \]

This is the standard formula most students remember.

Example 1

Given:

\[ x(t)=5\cos(20t) \]

Here,

\[ \omega=20\ \text{rad/s} \]

Therefore,

\[ T=\frac{2\pi}{20} =\frac{\pi}{10} \]

Hence, the fundamental period is:

\[ \boxed{\frac{\pi}{10}\ \text{seconds}} \]

Why This Formula Does Not Directly Work for Digital Signals

Consider the digital signal:

\[ x[n]=A\cos(\omega n+\phi) \]

A common mistake is to write:

\[ N=\frac{2\pi}{\omega} \]

This is not always correct.

The correct periodicity condition is:

\[ \omega N = 2\pi k \]

where \(k=1,2,3,\ldots\)

\[ N=\frac{2\pi k}{\omega} \]

for some integer \(k\). The signal is periodic only if \(N\) becomes an integer.


Periodicity of Discrete-Time Sinusoids

For

\[ x[n]=A\cos(\omega n+\phi) \]

the signal is periodic if

\[ \frac{\omega}{2\pi} \]

is a rational number.

That means:

\[ \frac{\omega}{2\pi} = \frac{p}{q} \]

where \(p\) and \(q\) are integers.

Then the fundamental period is:

\[ N=q \]

after reducing the fraction to its lowest terms.


Example 2

Determine the period of

\[ x[n]=\cos\left(\frac{\pi}{4}n\right) \]

We have:

\[ \frac{\omega}{2\pi} = \frac{\pi/4}{2\pi} = \frac{1}{8} \]

Thus,

\[ N=8 \]

The fundamental period is:

\[ \boxed{8} \]

Example 3

Determine the period of

\[ x[n]=\cos\left(\frac{3\pi}{10}n\right) \]

We have:

\[ \frac{\omega}{2\pi} = \frac{3\pi/10}{2\pi} = \frac{3}{20} \]

Since 3 and 20 are coprime:

\[ N=20 \]

Therefore:

\[ \boxed{\text{Fundamental Period}=20} \]

Continuous-Time vs Discrete-Time Periodicity

Property Continuous-Time Signal Discrete-Time Signal
Signal Form \(A\cos(\omega t+\phi)\) \(A\cos(\omega n+\phi)\)
Period Condition \(\omega T=2\pi\) \(\omega N=2\pi k\)
Period Formula \(T=\frac{2\pi}{\omega}\) \(N=\frac{2\pi k}{\omega}\)
Period Value Real Number Integer
Requirement Always Periodic \(\omega/2\pi\) must be rational

Summary

  1. \(T=\frac{2\pi}{\omega}\) is valid for continuous-time (analog) sinusoids.
  2. For discrete-time sinusoids, the correct condition is \(\omega N = 2\pi k\).
  3. A discrete-time sinusoid is periodic only when \(\frac{\omega}{2\pi}\) is rational.
  4. Reduce \(\frac{\omega}{2\pi}\) to \(\frac{p}{q}\). The fundamental period is \(q\).
  5. For the GATE-style example, both \(\boxed{0.1\pi}\) and \(\boxed{0.3\pi}\) produce a fundamental period of 20.

Autocorrelation and Periodicity

The Autocorrelation function measures the correlation of a signal with a delayed version of itself. It is a powerful tool for finding repeating patterns or periodicity in a noisy signal.

For a random process: $R_{xx}(\tau) = E[x(t)x(t+\tau)]$
For an energy signal: $R_{xx}(\tau) = \int_{-\infty}^{\infty} x(t)x(t+\tau) dt$

When a signal $x(t)$ is transmitted through a wireless medium, it often picks up Additive White Gaussian Noise (AWGN):

$y(t) = x(t) + n(t)$

Crucially, the periodicity of the autocorrelation of $y(t)$ remains the same as $x(t)$. Autocorrelation effectively "filters" the random noise components, which only contribute to the signal at zero lag ($\tau = 0$).

Wiener–Khinchin Theorem

This theorem links the time domain to the frequency domain by stating that the Power Spectral Density (PSD) of a Wide-Sense Stationary (WSS) process is the Fourier Transform of its autocorrelation function.

$S_X(f) = \mathcal{F}\{R_X(\tau)\} = \int_{-\infty}^{\infty} R_X(\tau) e^{-j2\pi f \tau} d\tau$

Note: WSS is assumed because it ensures the autocorrelation depends only on the time difference $\tau$, not the absolute time $t$.

Read More: about Autocorrelation and Periodicity



Contact Us

Name

Email *

Message *

Popular Posts

Q-function in BER vs SNR Calculation (with Simulation)

Q-function in BER vs. SNR Calculation In digital communications and signal processing, the Q-function plays a significant role in predicting system reliability. It allows engineers to quantify the probability that Gaussian noise will exceed a specific threshold, causing a bit error. What is the Q-function? The Q-function is a mathematical function representing the tail probability of the standard normal (Gaussian) distribution. It is the complementary cumulative distribution function (CCDF) of a standard Gaussian distribution. Q(x) = (1 / √(2Ï€)) ∫â‚“∞ e^(-t² / 2) dt Q-Function Interactive Simulator Move the slider to see how the "Tail Probability" (the area in red) changes. This area represents the Probability of Error (BER) . Threshold Distance ( x ) — (Simulates Increasing SNR) x = 1.0 Q(x) = 0.1587 ...

Design of CMOS Flip-Flops (SR, D, JK)

Design of CMOS Flip-Flops (SR, D, JK) A flip-flop or latch is a circuit with two stable states, used to store state information. It is the basic storage element in sequential logic and a fundamental building block in digital electronics systems, including computers and communication devices. Flip-flops and latches act as data storage elements for states, pulse counting, and synchronization of variably-timed input signals to a reference clock. Flip-flops can be transparent/opaque (latches) or clocked (synchronous, edge-triggered). Latches are level-sensitive, while flip-flops are edge-sensitive. In sequential logic, the output depends on current inputs and previous states. Fig.1 shows a sequential circuit combining a combinational block and a memory element. ...

Pulse Width Modulation (PWM)

Pulse-width modulation (PWM), or pulse-duration modulation (PDM), is a method of controlling the average power delivered by an electrical signal.   Fig: An example of PWM in an idealized inductor driven by a blue line voltage source modulated as a series of sawtooth pulses, resulting in a red line current in the inductor.    Generating a PWM Signal The simplest way to generate a PWM signal is the intersection method, which requires only a sawtooth or a triangle waveform (easily generated using a simple oscillator) and a comparator. When the value of the reference signal is more than the modulation waveform, the PWM signal (magenta) is in the high state; otherwise, it is in the low state.      Duty cycle A low duty cycle equates to low power because the power is off for most of the time; the word duty cycle reflects the ratio of "on" time to the regular interval or "period" of time. The duty cycle is measured in percent, with 100% representing full o...

BER vs SNR for M-ary QAM, M-ary PSK, QPSK, BPSK, ...(MATLAB Code + Simulator)

Bit Error Rate (BER) & SNR Guide Analyze communication system performance with our interactive simulators and MATLAB tools. 📘 Theory 🧮 Simulators 💻 MATLAB Code 📚 Resources BER Definition SNR Formula BER Calculator MATLAB Comparison 📂 Explore M-ary QAM, PSK, and QPSK Topics ▼ 🧮 Constellation Simulator: M-ary QAM 🧮 Constellation Simulator: M-ary PSK 🧮 BER calculation for ASK, FSK, and PSK 🧮 Approaches to BER vs SNR What is Bit Error Rate (BER)? The BER indicates how many corrupted bits are received compared to the total number of bits sent. It is the primary figure of merit f...

FFT Butterfly Method Explained (with Example of 4-point DFT)

  FFT Using Butterfly Method Given: x[n] = {0, 1, 2, 3} Step 1: Split into Even & Odd Even indices: x e = {0, 2} Odd indices: x o = {1, 3} Step 2: 2-point DFT For any {a, b}: DFT = {a + b, a - b} Even Part: E = {0+2, 0-2} = {2, -2} Odd Part: O = {1+3, 1-3} = {4, -2} Step 3: Combine Using Butterfly X[k] = E[k] + W k O[k] X[k + N/2] = E[k] - W k O[k] For N = 4: W 0 = 1 W 1 = -j Final Calculations X[0] = 2 + 4 = 6 X[2] = 2 - 4 = -2 X[1] = -2 + (-j)(-2) = -2 + 2j X[3] = -2 - (-j)(-2) = -2 - 2j Final Answer: X[k] = {6, -2 + 2j, -2, -2 - 2j} Try Interactive Online Simulations Interactive FFT Online Simulator (For understanding Fundamentals)  Interactive FFT Online Simulator (Analyze .CSV, .MP3, .MP4, etc. Further Reading Fourier Transform OFDM Return to Fourier Transform Main Page →

Frequency Shift Keying (FSK) Modulation & Demodulation (with Simulation)

Frequency Shift Keying (FSK) Theoretical Foundations: Frequency Shift Keying (FSK) is a discrete frequency modulation scheme wherein the digital information is encoded via instantaneous shifts in the carrier signal's frequency. The fundamental implementation is Binary FSK (BFSK), which maps binary data onto two distinct, discrete spectral states. A binary '1' (the "mark" state) is represented by a carrier frequency \( f_1 \), while a binary '0' (the "space" state) corresponds to frequency \( f_2 \). Each symbol is sustained for a bit interval denoted by \( T_b \). FSK Transmitter Characterization: The mathematical model for the modulated BFSK output \( s(t) \) is defined as: \[ s(t) = \begin{cases} A_c \cos(2\pi f_1 t), & \text{for } m = 1 \\ A_c \cos(2\pi f_2 t), & \text{for } m = 0 \end{cases} \] ...

AM Modulation Online Simulator

Amplitude Modulation Simulator s AM (t) = A c [1 + k a m(t)] cos(ω c t) where, ω = 2πf & k a = Amplitude Sensitivity Modulation index, μ = k a A m Message Frequency (fm): Carrier Frequency (fc): Carrier Amplitude (Ac): Modulation Index (m = Am / Ac):

Online Simulator for ASK, FSK, and PSK

Interactive Digital Signal Processing (DSP) Tutorial and Simulator for ASK, FSK, and BPSK modulation techniques. Try our new Digital Signal Processing Simulator!   •   Interactive ASK, FSK, and BPSK tools updated for 2025. Start Now Digital Modulation Visualizer: ASK, FSK, & BPSK Simulator Learn and visualize binary modulation techniques (ASK, FSK, BPSK) in real-time with adjustable carrier and sampling parameters. Perfect for DSP students and engineers. 📡 ASK Simulator 📶 FSK Simulator 🎚️ BPSK Simulator 📚 More Topics ASK Modulator FSK Modulator BPSK Modulator More Topics 1. ASK (Amplitude Shift Keying) Simulat...