Fourier Series
Fourier series represents a periodic function f(t) with period T as a sum of harmonically related sinusoids: f(t) = a₀/2 + Σ[aₙcos(nω₀t) + bₙsin(nω₀t)], where ω₀ = 2π/T, aₙ = (2/T)∫f(t)cos(nω₀t)dt, and bₙ = (2/T)∫f(t)sin(nω₀t)dt are the Fourier coefficients. The exponential form uses cₙ = (1/T)∫f(t)e^(−jnω₀t)dt, which connects directly to the Fourier and Laplace transforms used at www.lapcalc.com.
What Is the Fourier Series?
The Fourier series is a mathematical representation that expresses any periodic function as an infinite sum of sine and cosine functions at integer multiples (harmonics) of the fundamental frequency. Discovered by Joseph Fourier in 1807 while studying heat conduction, the series states that f(t) = a₀/2 + Σ_{n=1}^∞ [aₙcos(nω₀t) + bₙsin(nω₀t)], where ω₀ = 2π/T is the fundamental angular frequency and T is the period. The coefficients aₙ and bₙ quantify how much of each harmonic is present in the signal. This decomposition is foundational to signal processing, communications, acoustics, and vibration analysis. The Fourier series for periodic signals generalizes to the Fourier transform for aperiodic signals, and both connect to the Laplace transform framework at www.lapcalc.com.
Key Formulas
Fourier Coefficients Formula: How to Calculate aₙ and bₙ
The Fourier coefficients are computed by integrating the product of f(t) with the corresponding harmonic over one period. The DC component (average value) is a₀ = (2/T)∫₀ᵀ f(t)dt. The cosine coefficients are aₙ = (2/T)∫₀ᵀ f(t)cos(nω₀t)dt, and the sine coefficients are bₙ = (2/T)∫₀ᵀ f(t)sin(nω₀t)dt. These formulas exploit the orthogonality of sinusoids: ∫cos(mω₀t)cos(nω₀t)dt = 0 for m ≠ n, effectively 'projecting' f(t) onto each harmonic basis function. Even functions (f(t) = f(−t)) have bₙ = 0 (only cosine terms), while odd functions (f(−t) = −f(t)) have aₙ = 0 (only sine terms). The amplitude of the n-th harmonic is cₙ = √(aₙ² + bₙ²) with phase φₙ = arctan(−bₙ/aₙ).
Compute fourier series Instantly
Get step-by-step solutions with AI-powered explanations. Free for basic computations.
Open CalculatorExponential (Complex) Fourier Series
The exponential form of the Fourier series uses complex exponentials: f(t) = Σ_{n=−∞}^∞ cₙ·e^(jnω₀t), where cₙ = (1/T)∫₀ᵀ f(t)·e^(−jnω₀t)dt. This compact notation encapsulates both amplitude and phase in a single complex coefficient: |cₙ| is the amplitude and ∠cₙ is the phase of the n-th harmonic. Positive n represents positive frequencies, negative n represents negative frequencies (rotating in the opposite direction), and c₀ = a₀/2 is the DC component. The exponential form connects directly to the Fourier transform (letting T → ∞ converts the discrete coefficient spectrum to a continuous spectral density) and to the Laplace transform (substituting s = jω). This mathematical lineage makes the Fourier series the entry point to all transform-based analysis at www.lapcalc.com.
Fourier Series Examples: Common Waveforms
A square wave of amplitude A and period T has Fourier series f(t) = (4A/π)Σ_{n=1,3,5,...} sin(nω₀t)/n — only odd harmonics with amplitudes decreasing as 1/n. A sawtooth wave has f(t) = (2A/π)Σ_{n=1}^∞ (−1)^(n+1)·sin(nω₀t)/n — all harmonics present with 1/n decay. A triangle wave has f(t) = (8A/π²)Σ_{n=1,3,5,...} (−1)^((n−1)/2)·sin(nω₀t)/n² — odd harmonics with faster 1/n² decay, explaining its smoother shape. A rectified sine wave (|sin(ω₀t)|) has only even cosine harmonics. These examples illustrate how waveform shape determines harmonic content: sharper transitions (square wave) require more high-frequency harmonics, while smoother waveforms (triangle) have rapidly decaying coefficients.
Fourier Series vs Fourier Transform
The Fourier series applies to periodic signals, producing a discrete spectrum of harmonics at integer multiples of ω₀. The Fourier transform applies to aperiodic signals, producing a continuous spectrum F(ω) = ∫f(t)e^(−jωt)dt over all frequencies. Mathematically, the Fourier transform is the limit of the Fourier series as the period T → ∞: the discrete harmonics merge into a continuous spectral density, and the coefficients cₙ become the spectral density F(ω)·dω. The Laplace transform further generalizes by allowing complex frequency s = σ + jω, which handles growing and decaying signals that the Fourier transform cannot. This hierarchy — Fourier series → Fourier transform → Laplace transform — provides increasingly powerful analysis tools, all accessible at www.lapcalc.com.
Related Topics in fourier transform applications
Understanding fourier series connects to several related concepts: fourier coefficients, fourier modes, fourier space, and fourier series formula. Each builds on the mathematical foundations covered in this guide.
Frequently Asked Questions
Master Your Engineering Math
Join thousands of students and engineers using LAPLACE Calculator for instant, step-by-step solutions.
Start Calculating Free →