Loading…

Speedy in-situ magnetic field compensation algorithm for multiple-channel single-beam SERF atomic magnetometers

The currently employed algorithms for the magnetic field compensation of single-beam spin-exchange relaxation-free atomic magnetometers are excessively slow and unstable, which limits the use and commercialization of magnetometer arrays for biological magnetic measurement. This study proposes an imp...

Full description

Saved in:
Bibliographic Details
Published in:Metrologia 2023-06, Vol.60 (3), p.35006
Main Authors: Long, Tengyue, Song, Xinda, Han, Bangcheng, Suo, Yuchen, Jia, Le
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The currently employed algorithms for the magnetic field compensation of single-beam spin-exchange relaxation-free atomic magnetometers are excessively slow and unstable, which limits the use and commercialization of magnetometer arrays for biological magnetic measurement. This study proposes an improved trisection algorithm (ITSA) to compensate for the magnetic field around the vapor cell in an attempt to resolve these limitations. Through the constant monitoring of the intensity of light emitted from a laser, the proposed algorithm reduces the time required to compensate for magnetic fields to 0.85 s in a single magnetometer, which is nine times faster than the traditional algorithm, and to 26 s in 36-channel magnetoencephalography equipment, which is 15.5 times faster than the traditional algorithm. In addition, an approximately 16% increase in measuring sensitivities is achieved based on the ITSA compared with the traditional algorithm. These improvements can promote the usage efficiency and commercialization of biological magnetic measurement instruments. Furthermore, the ITSA is verified using an experimental setup and the mathematical analysis and comparable experimental results demonstrate the effectiveness of the proposed algorithm.
ISSN:0026-1394
1681-7575
DOI:10.1088/1681-7575/accd74