Abstract
Local specific absorption rate (SAR) compression algorithms are essential for enabling online SAR monitoring in parallel transmission. A better compression resulting in a lower number of virtual observation points improves speed of SAR calculation for online supervision and pulse design. An iterative expansion of an existing algorithm presented by Lee et al is proposed in this work. The original algorithm is used within a loop, making use of the virtual observation points from the previous iteration as the starting subvolume, while decreasing the overestimation with each iteration. This algorithm is evaluated on the SAR matrices of three different simulated arrays. The number of virtual observation points is approximately halved with the new algorithm, while at the same time the compression time is reduced with speed-up factors of up to 2.5. The new algorithm improves the original algorithm in terms of compression rate and speed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
