Skip to main content

Magnetic Field of an Infinite Wire


Magnetostatics: Magnetic Field of an Infinite Wire

Magnetic Field Strength (H) of an Infinite Wire

Deriving the magnetic field produced by a current-carrying conductor using the Biot-Savart Law.

Vector Geometry Diagram

Current (I) ρ (Distance) Point P H Field (a_φ)

The magnetic field H always forms a circle (a_φ) perpendicular to the current flow.

1. The Fundamental Law

To find the magnetic field intensity (H) at a point P near a wire, we start with the Biot-Savart Law for a differential current element:

dH = (I dL × aįµ£) / (4Ļ€r²)

Defining the Parameters:

  • dL: The small segment of the wire, defined as dz a_z.
  • r: The distance from the segment to point P, which forms the hypotenuse of a triangle: √(ρ² + z²).
  • aįµ£: The unit vector pointing from the wire to the observation point.

2. Solving the Vector Cross Product

The direction of the magnetic field is determined by the cross product of the current direction and the distance vector. In cylindrical coordinates:

Cross Product Logic:
(a_z) × (a_ρ) = a_φ (Direction of the field)
(a_z) × (a_z) = 0 (Parallel components produce no field)

This tells us that the magnetic field curls around the wire in the azimuthal direction (a_φ).

3. The Integration Process

To find the total field from an infinite wire, we integrate from -∞ to +∞. The notes use a trigonometric substitution to simplify the math:

Let z = ρ tan(θ)
dz = ρ sec²(Īø) dĪø

By substituting these values, the complex integral converts into a simple cosine integration over the angles -π/2 to π/2:

H = (I / 4πρ) ∫ cos(Īø) dĪø = (I / 4πρ) [sin(Īø)]

4. Final Formulas

For an Infinite Wire:

After evaluating the limits, we arrive at the standard formula for an infinitely long conductor:

H = (I / 2πρ) a_φ

For a Finite Wire Extension

If the wire is not infinite, we use the angles (α₁, α₂) from the observation point to the ends of the wire:

H = [I / 4πρ] (sin α₂ + sin α₁) a_φ

Note: This result is consistent with Ampere's Circuital Law, which states that the line integral of H around a closed path is equal to the current enclosed (∮ H · dL = I).

From Finite Wire to Ampere’s Law

You asked if the finite wire formula can be formulated into ∮ H · dL = I. The answer is yes, but it requires the wire to become "infinite." Here is the logical bridge:

Step 1: The Infinite Limit

In the formula for a finite wire length:

H = [I / 4πρ] (sin α₂ + sin α₁) a_φ

As the wire becomes infinitely long, the angles α₁ and α₂ both approach 90° (Ļ€/2). Since sin(90°) = 1, the term becomes (1 + 1) = 2.

Infinite Result:
H = [I / 4πρ] * 2 = I / 2πρ

Step 2: Connecting to Ampere's Law

Now, let's test if this result satisfies Ampere’s Circuital Law. We take a circular path of radius ρ around the wire. Along this path, the differential length is dL = ρ dφ a_φ.

∮ H · dL = ∫₀²Ļ€ (I / 2πρ a_φ) · (ρ dφ a_φ)

Notice what happens during the dot product calculation:

  • The unit vectors a_φ · a_φ = 1.
  • The distance ρ in the numerator and denominator cancel out.
  • The constants move outside the integral.
∮ H · dL = (I / 2Ļ€) ∫₀²Ļ€ dφ = (I / 2Ļ€) * 2Ļ€ = I
The Conclusion:
The derivation using the Biot-Savart Law for a finite wire is perfectly consistent with Ampere's Law. When the geometry is infinite, the complex trigonometric term simplifies exactly into the reciprocal of the circumference (2πρ), proving that the total enclosed current is indeed I.

Practical Tip: Use Biot-Savart for complex segments or finite wires, and use Ampere's Law for infinite, symmetric systems to save time!



Contact Us

Name

Email *

Message *

Popular Posts

LDPC Encoding and Decoding Techniques

Low Density Parity Check (LDPC) Guide Comprehensive analysis of linear error-correcting block codes, Tanner graphs, and 5G-NR implementations. šŸ“˜ Overview 🧮 Encoding 🧩 Decoding šŸ“š Resources Theory Encoding Tech Tanner Graph 5G Encoding Decoding 'LDPC' is the abbreviation for 'low density parity check'. LDPC code H matrix contains very few amount of 1's and mostly zeroes. LDPC codes are error correcting code. Using LDPC codes, channel capacities that are close to the theoretical Shannon limit can be achieved. Low density parity check (LDPC) codes are linear error-correcting block code suitable for error correction in a large block sizes transmi...

Gaussian minimum shift keying (GMSK)

šŸ“˜ Overview & Theory 🧮 Simulator for GMSK 🧮 MSK and GMSK: Understanding the Relationship 🧮 MATLAB Code for GMSK šŸ“š Simulation Results for GMSK šŸ“š Q & A and Summary šŸ“š Further Reading Dive into the fascinating world of GMSK modulation, where continuous phase modulation and spectral efficiency come together for robust communication systems! Core Process of GMSK Modulation Phase Accumulation (Integration of Filtered Signal) After applying Gaussian filtering to the Non-Return-to-Zero (NRZ) signal, we integrate the smoothed signal to produce a continuous phase signal. For GMSK, the modulation index is $h=0.5$, meaning a bit '1' results in a phase shift of $\pi/2$: Īø(t) = 2Ļ€h ∫ 0 t m filtered (Ļ„) dĻ„ This integration is crucial for avoiding abrupt phase transitions, ensuring smooth and continuous phase changes. Phase Mo...

UGC NET Electronic Science Previous Year Question Papers with Solutions

Download Papers and Solutions Exam Pattern Preparation Tips FAQs More Home / Engineering & Other Exams / UGC NET 2026 PYQ šŸ“Š Exam Highlights: Electronic Science (88) Feature Details Junior Research Fellowship (JRF) ₹37,000 + HRA per month Eligibility M.Sc/M.Tech in Electronics (55%) Validity of Certificate JRF (3 Years) | Lectureship (Lifetime) šŸ“„ Download UGC NET Electronics PDFs Complete collection of previous year question papers, answer keys and explanations for Subject Code 88. Start Downloading šŸ“‚ View All Question Papers June 2025 - Question Paper Download PDF June 2025 - Sol...

Constellation Diagrams of ASK, PSK, and FSK (with MATLAB Code + Simulator)

Constellation Diagrams: ASK, FSK, and PSK Comprehensive guide to signal space representation, including interactive simulators and MATLAB implementations. šŸ“˜ Overview 🧮 Simulator ⚖️ Theory šŸ“ˆ Q-function šŸ“š Resources BASK Modulation Transmits one of two signals: 0 or $\sqrt{E_b}$, representing binary 0 and 1. Simple but sensitive to noise. BFSK Modulation Transmits one of two signals: $\sqrt{E_b}$ on the Y-axis or $\sqrt{E_b}$ on the X-axis. These are orthogonal signals. BPSK Modulation Transmits $+\sqrt{E_b}$ or $-\sqrt{E_b}$ (antipodal signaling). Most efficient binary scheme. ...

Online Simulator for ASK, FSK, and PSK Signal Generation

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 Demodulation More Topics 1. ASK (Ampli...

MATLAB Code for OTFS (Orthogonal Time Frequency Space)

MATLAB Code for OTFS (Orthogonal Time Frequency Space) %% Clear workspace clc; clear; close all ; %% Step 1: OTFS Parameters N_delay = 4; % Number of delay bins (rows) N_doppler = 4; % Number of Doppler bins (columns) N_sym = N_delay * N_doppler; modOrder = 4; % QPSK SNR_dB = 20; % Noise level %% Step 2: Generate random data symbols data = randi([0 modOrder-1], N_sym, 1); txSymbols = pskmod(data, modOrder, pi/4); disp( 'Transmitted Delay-Doppler symbols:' ); disp(reshape(txSymbols, N_delay, N_doppler)); %% Step 3: Map Delay-Doppler → Time-Frequency (ISFFT) % ISFFT: Inverse Symplectic Finite Fourier Transform % 1. Take IDFT along Doppler (columns) % 2. Take DFT along Delay (rows) ddSymbols = reshape(txSymbols, N_delay, N_doppler); % Step 3a: IDFT along columns (Doppler) tfGrid = ifft(ddSymbols, N_doppler, 2); %IFFT (accross columns) along Doppler → spreads in time (Delay → Time) %FFT (accross rows)along Delay → spreads in frequency (Delay → Frequency) % Step 3b: DFT along ...

1G to 5G Technology - Evolution of Wireless Generations

Cellular wireless evolution Generation Frequency band PHY features Data rate Spectral Eff. (bps/Hz) 1G 850 MHz FDMA, FM N/A N/A 2G 900 MHz, 1.8 GHz TDMA/CDMA, GMSK/QPSK, FEC, PC 10 Kbps < 1 3G 1.8–2.5 GHz CDMA, QAM 1–40 Mbps 1–8 4G 2–8 GHz OFDMA, SC-FDMA, QAM, MIMO-OFDM 100–600 Mbps 15 5G 1–6 GHz mm wave (26–28 GHz) < 1 GHz (massive IoT) visible light? massive MIMO, beamforming D2D, Full duplex, NOMA LDPC and Polar codes OFDM & variants (adapted to extremes?) multi-Gbps several tens Waveform design is the major change between the generations Mobile Wireless Generations Specifications  1G  Voice, Analog traffic, FDMA  2G  Voice, SMS, CS data ...