IDEAS home Printed from https://ideas.repec.org/a/taf/gcmbxx/v23y2020i6p248-260.html
   My bibliography  Save this article

Multisite pacing and myocardial scars: a computational study

Author

Listed:
  • Mohammad Albatat
  • Jacob Bergsland
  • Hermenegild Arevalo
  • Hans Henrik Odland
  • Samuel Wall
  • Joakim Sundnes
  • Ilangko Balasingham

Abstract

Cardiac resynchronization therapy (CRT) is a frequently effective treatment modality for dyssynchronous heart failure, however, 30% of patients do not respond, usually due to suboptimal activation of the left ventricle (LV). Multisite pacing (MSP) may increase the response rate, but its effect in the presence of myocardial scars is not fully understood. We use a computational model to study the outcome of MSP in an LV with scars in two different locations and of two different sizes. The LV was stimulated from anterior, posterior and lateral locations individually and in pairs, while a septal stimulation site represented right ventricular (RV) pacing. Intraventricular pressures were measured, and outcomes evaluated in terms of maximum LV pressure gradient (dP/dtmax)- change compared to isolated RV pacing. The best result obtained using various LV pacing locations included a combination of sites remote from scars and the septum. The highest dP/dtmax increase was achieved, regardless of scar size, using MSP with one pacing site located on the LV free wall opposite to the scar and one site opposite to the septum. These in silico modelling results suggest that making placement of pacing electrodes dependent on location of scarring, may alter acute haemodynamics and that such modelling may contribute to future CRT optimization.

Suggested Citation

  • Mohammad Albatat & Jacob Bergsland & Hermenegild Arevalo & Hans Henrik Odland & Samuel Wall & Joakim Sundnes & Ilangko Balasingham, 2020. "Multisite pacing and myocardial scars: a computational study," Computer Methods in Biomechanics and Biomedical Engineering, Taylor & Francis Journals, vol. 23(6), pages 248-260, April.
    • Handle: RePEc:taf:gcmbxx:v:23:y:2020:i:6:p:248-260
    DOI: 10.1080/10255842.2020.1711885
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/10255842.2020.1711885
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/10255842.2020.1711885?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:gcmbxx:v:23:y:2020:i:6:p:248-260. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/gcmb .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.