Video wird geladen...
Video konnte nicht geladen werden
A sawtooth, a square and a triangle wave, each summed from its first ten nonzero Fourier terms, f(t) = ∑ bₙ sin(nt). Each term is a circle of radius |bₙ| turning n times per period. The sawtooth has bₙ = 2(−1)ⁿ⁺¹/(nπ), the square 4/(nπ) for odd n, the triangle... show more
13,055 Aufrufe • vor 4 Tagen •via X (Twitter)
0 Kommentare
Keine Kommentare verfügbar
Kommentare vom Original-Post werden hier angezeigt
Ähnliche Videos
![A double integral is the limit of a sum of prisms: cut [0, π]² into n × n squares of area ΔA = (π/n)² and raise each to the height of z = sin³x sin³y at its centre. The volume is (∫₀^π sin³x dx)² = (4/3)² = 16/9 ≈ 1.7777778. The prisms give 1.7602152 at n = 4, 1.7768141 at n = 8 and 1.7777776 at n = 64, always from below. Since sin³x = (3 sin x − sin 3x)/4, the h² errors of the two waves cancel, and the gap shrinks like 7π⁴/(180n⁴).](https://image.24vids.com/tw-2106381302031393274/amplify_video_thumb/2106381195407937536/img/-FsmOkG9RkHlxZ_Q.jpg)
![A rose curve is r = sin(kθ). Here k = b/a, with a = 1, 3, 7 down the rows and b = 2, 4, 8 across. With k = p/q in lowest terms and pq even, the rose has 2p petals and closes after θ = 2qπ. Each a is odd and each b a power of 2, so p = b and q = a: each column has 2b petals, 4, 8 and 16, and a only sets how far they wind: 2π, 6π, 14π. Swept over θ ∈ [0, 2aπ] in equal times, kθ = 2πb·t/T, so a column's three pens reach their petal tips together.](https://image.24vids.com/tw-2103170699208937579/amplify_video_thumb/2103170593545924608/img/BBR7KO2dNBMvv2LG.jpg)
0:18
Sensitive content
🙏 Auspicious Idol Maruti's Son, 🏵️ M Grok A N G A L M U R T I M A R U T I N A N D A N Root Destroyer of All Inauspiciousness. S A K A L A M A N G A L M O O L N I K A N D A N Victory to Pavan's Son Hanuman! 🚩🙏 P A V A N S U T H A N U M A N K I J A I 🚩🙏 Auspicious Idol Maruti's Son, Root Destroyer of All Inauspiciousness. Bowing our heads at the feet of Bajrangbali, the remover of every crisis, the granter of freedom from every fear, salutations to Pawanputra Hanuman. On this day, may all devotees receive strength, courage, and protection through his grace. Victory to Bajrangbali! 💪🚩🙏
Deepak kumar🇮🇳
26,921 Aufrufe • vor 1 Monat
![A turnstile antenna is two crossed dipoles driven 90° apart, one dipole p turning at ω about its mast. Its far field E ∝ r̂ × (r̂ × p̈(t − r/c)) has phase ωt − kr − φ at every latitude, so each wavefront is the spiral r = (ωt − φ − 2πn)/k. Along the mast E ∝ (1/r)[cos(kr − ωt) ŷ + sin(kr − ωt) x̂] keeps its length and turns once per period, and B = (1/c) r̂ × E turns with it. In the plane of the cross the same wave is linearly polarized.](https://image.24vids.com/tw-2106418848027299848/amplify_video_thumb/2106418431650418688/img/AxlwU3tXg4lXbw-v.jpg)
![[Discrete Fourier Transform] by Hand ✍️ In signal processing, the Discrete Fourier Transform (DFT) is no doubt the most important method. But the math involved is extremely complex, literally, involving a summation over a complex number term e^(-iwt). I developed this exercise to demonstrate that underneath such complexity, DFT is just a series of matrix multiplications you can calculate by hand. ✍️ Once you see that, it should not surprise you that a deep neural network, which is also a series of matrix multiplications, with activation functions in-between, can learn to perform DFT to process and analyze signals so effectively. How does DFT work? [1] Given ↳ Signals A, B, and C in the 🟧 frequency domain: ◦ A = cos(w) + 2cos(2w) ◦ B = cos(w) + cos(3w) + cos(4w) ◦ C = -cos(2w) + cos(3w) ◦ Each signal is a weighed sum of four cosine waves at frequencies 1w, 2w, 3w, and 4w. ◦ We will apply Inverse DFT to convert the signals to time domain representations, and then demonstrate DFT can convert back to their original frequency domain representations. ↳ Signal X in the 🟩 time domain. X is sampled at 10 time points 1t, 2t, …, 10t: ◦ X = [-2.5, -1.8, 3, -0.7, -1.0, -0.7, 3, -1.8, -2.5, 5] ◦ Suppose X is also a weighted sum of the same four cosine waves, but we don’t already know their weights. We will apply DFT to discover them. [2] 🟧 Frequency Matrix (F) ↳ Write the coefficients of A, B, C as a matrix F. Each signal is a row. Each frequency is a column. ↳ A → [1, 2, 0, 0] ↳ B → [1, 0, 1, 1] ↳ C → [0, 1-, 1, 0] [3] Cosine → Discrete ↳ Sample from the continuous cosine waves at discrete time points 1t, 2t, 3t, to 10t. [4] Cosine Matrix (W) ↳ Write the samples as a matrix, Each frequency is a row. Each time point is a column. [5] Inverse DFT: 🟧 Frequency → 🟩 Time ↳ Multiply the frequency matrix F and the cosine matrix W. ↳ The meaning of this multiplication is to linearly combine the four cosine waves (rows in W) into time-domain signals (rows in T) using the weights specified in F. ↳ The result is matrix T, which are signals A, B, C converted to the time domain. Each signal is a row. Each time point is a column. [6] Transpose ↳ Transpose T, converting each signal’s time domain representation from a row to a column. [7] DFT: 🟩 Time → 🟧 Frequency ↳ Multiply the cosine matrix W with the transpose of matrix T. ↳ The purpose of this multiplication is to take a dot-product between each time-domain signal (columns in the transpose of T) and each cosine wave (rows in W), which has the effect of projecting the signal onto a cosine wave to determine how much they are correlated. Zero means not correlated at all. ↳ The result is an intermediate version of the “recovered” frequency matrix where each column corresponds to a signal and each row corresponds to a frequency. ↳ Compared to the original frequency matrix F, this intermediate matrix has non-zero weights in the correct places, but scaled up by a factor of 5 (n/2, n=10). For example, signal A, originally [1,2,0,0], is recovered at [5,10,0,0]. [8] Scale ↳ Multiply each value by 2/n = 1/5 to scale down the intermediate matrix to match the magnitude of the original frequency matrix F. [9] Transpose ↳ Transpose the recovered frequency matrix back to the same orientation of the original frequency matrix F. ↳ Like magic 🪄, the result is identical to the original F, which means DFT successfully recovered the frequency components of signals A, B, C. [10] Apply DFT to X: 🟩 Time → 🟧 Frequency ↳ Now that we have some confidence in DFT’s ability to recover frequency components, we apply DFT to X’s time-domain representation by multiplying W with X. ↳ The result is the an intermediate matrix. [11] Scale ↳ Similarly, we scale down by a factor of 5 to obtain the recovered frequency components of X (a column). [12] Transpose ↳ Similarly, we transpose the recovered column to row to match the orientation of the frequency matrix. ↳ Using the coefficients [0,0,3,2], we can write the equation of X as 3cos(3w) + 2cos(4w). Notes: I hope this by hand exercise helps you understand the essence of DFT. But there is more technical details, such as: • Sine: The complete DFT math also includes sine waves that follow a similar calculation process. • Phase: Here, we assume all the cosine waves are aligned at the origin, namely, phase is 0. If a phase p is added, for example, cos(w+p), we will need to calculate the sine component and use their ratio to figure out what p is. • Magnitude: If phase is not zero, the magnitude will need to be calculated by combining both cosine and sine terms.](https://image.24vids.com/tw-1805694219031662799/ext_tw_video_thumb/1805693963464327168/pu/img/kOcpELm1j7wfqJlR.jpg)
