MINJUN PARK / AN OPEN NOTEBOOK

A place to play with code, math, and the things I build. Start with a live experiment, follow a visual explanation, or dig through the full record.

✳   SIGNALS & SPECTRA · VISUAL LAB

Change a tone. See its spectrum.

One frequency slider moves the sampled wave and its computed spectrum.

Interactive experiment

Signal → spectrum

Signal and sampling controls

Bin width Δf0.500 Hz

Nyquist limit32.00 Hz

Record length T2.00 s

All tones are at or below the Nyquist limit.

Largest spectrum bins (frequency · amplitude): 3.00 Hz (1.00) · 9.00 Hz (0.55) · 17.00 Hz (0.30)

Phase advances automatically. The spectrum is recomputed from each displayed finite sample record.

Input tones:f₁ 3.00 Hzf₂ 9.00 Hzf₃ 17.00 Hz

Sampled waveform · first 0.5 s

Default sampled waveformComputed samples for tones at 3, 9, and 17 hertz, with a 64 hertz sample rate. The plot shows the first half-second.0 s0.50 s+2−2

Single-sided amplitude spectrum

Default single-sided amplitude spectrumRadix-2 FFT of 128 samples at 64 hertz. Peaks appear at 3, 9, and 17 hertz.0 Hz16 Hz32 Hzmax
Xk=∑n=0N−1xne−2πikn/N,Δf=FsN=1T,fNyquist=Fs2X_k=\sum_{n=0}^{N-1}x_n e^{-2\pi i kn/N},\qquad \Delta f=\frac{F_s}{N}=\frac{1}{T},\qquad f_{\mathrm{Nyquist}}=\frac{F_s}{2}
The dots are the actual samples. The spectrum is computed from those samples with a radix-2 FFT and single-sided amplitude normalization. Try f₁ = 3.25 Hz to see leakage, lower Fₛ below 34 Hz to see aliasing, or change N to alter the bin width.
01 / THE PLAYGROUND

Curiosity looks better in motion.

One hands-on experiment, plus visual stories from the archive. Nothing to install; just follow what catches your eye.

02 / FROM THE WORKBENCH · THREE WAYS IN

Explore. Understand. Build.

LOCAL AI · MEASURED RESULTS

Field reports & benchmarks

Original measurements, failed attempts, and operational constraints. These articles are currently available in English.

EVERGREEN FROM THE ARCHIVE

Selected foundations

Complete archive →

A short selection of mathematical and algorithmic explanations, shown with their original publication dates.

Fast Fourier Transform (FFT)

A radix-2 FFT guide: DFT normalization, butterfly decomposition, polynomial convolution, and the limits of floating-point integer results.

2022-05-14

Bolzano–Weierstrass Theorem

A proof that every bounded sequence in finite-dimensional Euclidean space has a convergent subsequence, with the compactness distinction.

2022-04-24

Floyd-Warshall Algorithm

Derive Floyd–Warshall’s all-pairs recurrence, implement it safely in C++, and interpret unreachable pairs and negative cycles.

2022-04-12

Max-flow min-cut theorem

A proof of the max-flow min-cut theorem using residual reachability, with a concrete flow-and-cut certificate.

2022-04-12
03 / THE OPEN SHELF

A long trail of questions.

The latest published writing in this language, from new work to older notes. Every original article remains available in the complete archive.

301published articles in this language
MORE OF THE PUBLICATION

Research, essays, and reference

More ways to find a specific subject, from specialist sections to the complete record.