• 沒有找到結果。

Focal atrial tachycardia: new insight from noncontact mapping and catheter ablation.

N/A
N/A
Protected

Academic year: 2021

Share "Focal atrial tachycardia: new insight from noncontact mapping and catheter ablation."

Copied!
1
0
0

加載中.... (立即查看全文)

全文

(1)

Focal atrial tachycardia: new insight from noncontact

mapping and catheter ablation.

謝敏雄

Higa S;Tai CT;Lin YJ;Liu TY;Lee PC;Huang JL;Hsieh

MH;Yuniadi Y;Huang BH;Lee SH

摘要

Abstract

Background-This study investigated the electrophysiologic characteristics, atrial activation pattern, and effects of radiofrequency (RF) catheter ablation guided by noncontact mapping system in patients with focal atrial tachycardia (AT). Methods and Results-In 13 patients with 14 focal ATs, noncontact mapping system was used to map and guide ablation of AT. AT origins were in the crista terminalis (n=8), right atrial (RA) free wall (n=3), Koch triangle (n=1), anterior portion of RA-inferior vena cava junction (n= 1), and superior portion of tricuspid annulus (n=1); breakout sites were in the crista terminalis (n=5), RA free wall (n=5), middle cavotricuspid isthmus (n=2), and RA-superior vena cava junction (n=2). ATs arose from the focal origins (11 ATs inside or at the border of low-voltage zone), with preferential conduction, breakout, and spread to the whole atrium. After applications of RF energy on the earliest activation site or the proximal portion of preferential conduction from AT origin, 13 ATs were eliminated without

complication. During the follow-up period (8±5 months), 11 (91.7%) of the 12 patients with successful ablation were free of focal ATs. Conclusions-Focal AT originates from a small area and spreads out to the whole atrium through a preferential conduction. Application of RF energy guided by noncontact mapping system was effective and safe in eliminating focal AT..

參考文獻

相關文件

Proof: For every positive integer n, there are finitely many neighbor- hood of radius 1/n whose union covers K (since K is compact). Collect all of them, say {V α }, and it forms

[r]

An n×n square is called an m–binary latin square if each row and column of it filled with exactly m “1”s and (n–m) “0”s. We are going to study the following question: Find

More precisely, it is the problem of partitioning a positive integer m into n positive integers such that any of the numbers is less than the sum of the remaining n − 1

For periodic sequence (with period n) that has exactly one of each 1 ∼ n in any group, we can find the least upper bound of the number of converged-routes... Elementary number

The existence and the uniqueness of the same ratio points for given n and k.. The properties about geometric measurement for given n

• Consider an algorithm that runs C for time kT (n) and rejects the input if C does not stop within the time bound.. • By Markov’s inequality, this new algorithm runs in time kT (n)

• Consider an algorithm that runs C for time kT (n) and rejects the input if C does not stop within the time bound.. • By Markov’s inequality, this new algorithm runs in time kT (n)