Electromagnetic navigation antenna assembly and electromagnetic navigation system including the same

Abstract
An antenna assembly for radiating at least one electromagnetic field for electromagnetic navigation and an electromagnetic navigation system including such an antenna assembly are provided. The antenna assembly includes a substrate and a planar antenna including a trace that is deposited on the substrate and arranged in a plurality of loops. Respective distances between adjacent pairs of the loops increase in a direction from an innermost loop to an outermost loop.
Description
BACKGROUND

Technical Field


The present disclosure relates to antenna assemblies for electromagnetic navigation and methods for designing such antenna assemblies. More particularly, the present disclosure relates to antenna assemblies for radiating electromagnetic fields for electromagnetic navigation, electromagnetic navigation systems including such antenna assemblies, and computer-implemented methods of designing such antenna assemblies.


Discussion of Related Art


Electromagnetic (EM) navigation (EMN) has helped expand medical imaging, diagnosis, prognosis, and treatment capabilities by enabling a location and/or an orientation of a medical device to be accurately determined while the device is within the body of a patient. One example of a medical procedure in which EMN is employed is ELECTROMAGNETIC NAVIGATION BRONCHOSCOPY® (ENB™), which includes a planning phase and a navigation phase. During the planning phase, a computed tomography (CT) scan of the chest of the patient is used to generate a virtual three-dimensional bronchial map of the patient and a planned pathway for the navigation phase. During the navigation phase, an antenna assembly radiates an electromagnetic field throughout the chest of the patient, a practitioner inserts into the airway of the patient an electromagnetic sensor that senses the radiated electromagnetic field, and a computing device determines a location and/or an orientation (e.g., relative to the planned pathway) of the electromagnetic sensor based on characteristics of the sensed electromagnetic field.


To enable accurate determination of sensor location and/or orientation, a detailed mapping of electromagnetic field measurements at respective sensor locations is generated. Generating such a mapping, however, requires taking precise electromagnetic field measurements at many (for example, hundreds of thousands or more) locations within the expected electromagnetic volume, which is a laborious and time-consuming process that, in some cases, requires expensive machines.


The burden of generating electromagnetic field mappings increases in circumstances where multiple antenna assemblies are employed. For example, in order to enable an electromagnetic sensor to reach deeper portions of the body of the patient, and/or remain within the body during subsequent medical procedures without interfering with additional medical devices, it may be desirable to employ a small electromagnetic sensor, such as a single-coil electromagnetic sensor. However, to employ a small electromagnetic sensor for EMN while maintaining the ability to determine multiple (for example, six) degrees of freedom of the sensor, multiple antenna assemblies may be required to increase the number of radiated electromagnetic fields to be sensed. In such a case, the above-noted exhaustive mapping procedure may need to be conducted for each antenna assembly design. Moreover, given potential variations from manufacturing, the mapping procedure may even need to be completed for each instance of a specific antenna assembly design (i.e., each individual antenna assembly manufactured).


Given the foregoing, a need exists for improved electromagnetic navigation antenna assemblies and methods for designing such antenna assemblies.


SUMMARY

According to an aspect of the present disclosure, an antenna assembly for radiating at least one electromagnetic field for electromagnetic navigation is provided. The antenna assembly includes a substrate and a planar antenna including a trace that is deposited on the substrate and arranged in multiple loops. Respective distances between adjacent pairs of the loops increase in a direction from an innermost loop to an outermost loop.


In another aspect of the present disclosure, each of the loops includes multiple straight linear portions and multiple vertices. For example, in some aspects, each of the loops includes four straight linear portions and four vertices.


In a further aspect of the present disclosure, each of the vertices is disposed along one of four diagonal lines that bisect four respective vertices of a seed rectangle corresponding to the planar antenna.


In yet another aspect of the present disclosure, the antenna assembly further includes a connector having at least two terminals, and the trace has two ends that are coupled to the two terminals, respectively.


In another aspect of the present disclosure, the antenna assembly includes multiple planar antennas, and each of the multiple planar antennas includes a respective trace deposited on the substrate and arranged in a respective set of loops. For each of the planar antennas, respective distances between adjacent pairs of the loops of the respective planar antenna increase in a direction from an innermost loop to an outermost loop.


In another aspect of the present disclosure, the substrate includes multiple layers and the planar antenna and each of the multiple planar antennas is deposited on a respective one of the layers.


In another aspect of the present disclosure, each of the planar antennas includes a same number of loops.


In another aspect of the present disclosure, each of the loops includes multiple straight linear portions and multiple vertices.


In another aspect of the present disclosure, the planar antennas have respective centroids, with respect to a plane of the substrate, that are disposed in respective positions that are distinct from one another.


According to another aspect of the present disclosure, an electromagnetic navigation system is provided. The system includes an antenna assembly, an alternating current (AC) current driver that drives the antenna assembly, a catheter, an electromagnetic sensor, a processor, and a memory. The antenna assembly includes a substrate and a planar antenna and is configured to radiate an electromagnetic field. The planar antenna includes a trace deposited on the substrate and arranged in multiple loops. Respective distances between adjacent pairs of the loops increase in a direction from an innermost one of the loops to an outermost one of the loops. The electromagnetic sensor is affixed to the catheter and is configured to receive a signal based on the radiated electromagnetic field. The memory includes instructions that, when executed by the processor, cause the processor to calculate a location and/or an orientation of the electromagnetic sensor based on the received signal.


In another aspect of the present disclosure, each of the loops includes multiple straight linear portions and multiple vertices. For example, in some aspects each of the loops includes four straight linear portions and four vertices.


In a further aspect of the present disclosure, each of the vertices is disposed along one of four diagonal lines that bisect four respective vertices of a seed rectangle corresponding to the planar antenna.


In yet another aspect of the present disclosure, the antenna assembly further includes a connector having at least two terminals, and the trace has two ends that are coupled to the two terminals, respectively.


In another aspect of the present disclosure, the antenna assembly includes multiple planar antennas, each of the planar antennas including a respective trace deposited on the substrate and arranged in a respective set of loops. For each of the planar antennas, respective distances between adjacent pairs of the loops increase in a direction from an innermost one of the loops to an outermost one of the loops of the respective planar antenna.


In another aspect of the present disclosure, the substrate includes multiple layers and each of the planar antennas is deposited on a respective layer of the multiple layers.


In another aspect of the present disclosure, each of the planar antennas includes a same number of loops.


In another aspect of the present disclosure, each of the loops of each of the planar antennas includes multiple straight linear portions and multiple vertices.


In another aspect of the present disclosure, the multiple planar antennas have multiple centroids, respectively, with respect to a plane of the substrate that are disposed in respective positions that are distinct from one another.


According to another aspect of the present disclosure, an antenna assembly for radiating multiple electromagnetic fields for electromagnetic navigation is provided. The antenna assembly includes a substrate and multiple groups of planar antennas. The substrate includes a multiple layers, and each of the planar antennas includes a respective trace that is deposited on a respective layer of the multiple layers and is arranged in a respective number of loops. Each of the groups of planar antennas includes a first planar antenna, a second planar antenna, and a third planar antenna. For each of the groups of planar antennas: (1) an innermost loop of the first planar antenna has a first linear portion and a second linear portion approximately perpendicular to the first linear portion, (2) an innermost loop of the second planar antenna has a first linear portion and a second linear portion approximately perpendicular to the first linear portion and longer than the first linear portion, (3) an innermost loop of the third planar antenna has a first linear portion and a second linear portion approximately perpendicular to the first linear portion and longer than the first linear portion, (4) the first linear portion of the innermost loop of the second planar antenna is approximately parallel to the first linear portion of the innermost loop of the first planar antenna, and (5) the first linear portion of the innermost loop of the third planar antenna is approximately parallel to the second linear portion of the innermost loop of the first planar antenna.


In another aspect of the present disclosure, for each of the planar antennas, respective distances between adjacent loops of the multiple loops increase in a direction from an innermost loop of the multiple loops to an outermost loop of the multiple loops.


In a further aspect of the present disclosure, the respective innermost loops of the first planar antennas of each group are positioned, on the respective layers of the multiple layers, at respective angles that are distinct from one another.


In yet another aspect of the present disclosure, each of the multiple loops includes multiple straight linear portions and multiple vertices.


In another aspect of the present disclosure, for each planar antenna of the multiple planar antennas, each of the multiple vertices is disposed along one of four diagonal lines that bisect four respective vertices of a seed rectangle corresponding to the respective planar antenna of the multiple planar antennas.


In a further aspect of the present disclosure, respective outermost vertices of the multiple vertices of the multiple planar antennas are distanced from an edge of the substrate by not more than a predetermined threshold.


In yet another aspect of the present disclosure, the planar antennas have respective centroids, with respect to a plane of the substrate, that are distinct from one another.


In another aspect of the present disclosure, each of the planar antennas includes a same number of loops.


In a further aspect of the present disclosure, the number of groups of planar antennas is at least three.


In still another aspect of the present disclosure, the antenna assembly further includes a connector having multiple terminals, and each of the respective traces of the multiple planar antennas is coupled to a respective terminal of the multiple terminals.


According to another aspect of the present disclosure, an electromagnetic navigation system is provided that includes an antenna assembly, a catheter, an electromagnetic sensor, a processor, and a memory. The antenna assembly is configured to radiate electromagnetic fields and includes a substrate and multiple groups of planar antennas. The substrate includes multiple layers, and each of the planar antennas includes a respective trace that is deposited on a respective layer of the multiple layers and is arranged in a respective number of loops. Each of the groups of planar antennas includes a first planar antenna, a second planar antenna, and a third planar antenna. For each of the multiple groups of planar antennas: (1) an innermost loop of the first planar antenna has a first linear portion and a second linear portion approximately perpendicular to the first linear portion, (2) an innermost loop of the second planar antenna has a first linear portion and a second linear portion approximately perpendicular to the first linear portion and longer than the first linear portion, (3) an innermost loop of the third planar antenna has a first linear portion and a second linear portion approximately perpendicular to the first linear portion and longer than the first linear portion, (4) the first linear portion of the innermost loop of the second planar antenna is approximately parallel to the first linear portion of the innermost loop of the first planar antenna, and (5) the first linear portion of the innermost loop of the third planar antenna is approximately parallel to the second linear portion of the innermost loop of the first planar antenna. The electromagnetic sensor is affixed to the catheter and is configured to receive one or more signals based on the radiated electromagnetic fields. The memory includes instructions that, when executed by the processor, cause the processor to calculate a location and/or an orientation of the electromagnetic sensor based on the received signal(s).


In another aspect of the present disclosure, for each of the planar antennas, respective distances between adjacent loops of the multiple loops increase in a direction from an innermost loop of the multiple loops to an outermost loop of the multiple loops.


In a further aspect of the present disclosure, the respective innermost loops of the first planar antennas of each group are positioned, on the respective layers of the multiple layers, at respective angles that are distinct from one another.


In yet another aspect of the present disclosure, each of the multiple loops includes multiple straight linear portions and multiple vertices.


In another aspect of the present disclosure, for each planar antenna of the multiple planar antennas, each of the multiple vertices is disposed along one of four diagonal lines that bisect four respective vertices of a seed rectangle corresponding to the respective planar antenna of the multiple planar antennas.


In a further aspect of the present disclosure, respective outermost vertices of the multiple vertices of the multiple planar antennas are distanced from an edge of the substrate by not more than a predetermined threshold.


In yet another aspect of the present disclosure, the multiple planar antennas have multiple respective centroids, with respect to a plane of the substrate, that are distinct from one another.


In another aspect of the present disclosure, each of the planar antennas includes a same number of loops.


In a further aspect of the present disclosure, the number of groups of planar antennas is at least three.


In yet another aspect of the present disclosure, the electromagnetic navigation system further includes a connector that has multiple terminals, and each of the respective traces of the multiple planar antennas is coupled to a respective terminal of the multiple terminals.


According to another aspect of the present disclosure, a computer-implemented method of designing an antenna assembly for radiating an electromagnetic field for electromagnetic navigation is provided. The method includes computing, relative to a coordinate system of a substrate that has a boundary, multiple diagonal lines based on a seed rectangle that has multiple vertices, respectively. The multiple diagonal lines bisect the multiple vertices of the seed rectangle, respectively, and extend from the multiple vertices of the seed rectangle, respectively, to the boundary. The method also includes, for each of the multiple diagonal lines: (1) determining multiple distances between multiple adjacent pairs of planar antenna vertices, respectively, to be positioned along the respective diagonal line, wherein the multiple distances increase in a direction from the respective vertex of the seed rectangle to the boundary, and (2) positioning the planar antenna vertices along the respective diagonal line based on the determined multiple distances. A planar antenna layout is generated by interconnecting the planar antenna vertices by way of respective straight linear portions to form multiple loops that sequentially traverse each of the multiple diagonal lines.


In another aspect of the present disclosure, the multiple distances are determined based at least in part on a predetermined number of loops of the planar antenna.


In a further aspect of the present disclosure, the multiple distances are determined based at least in part on a predetermined minimum spacing between adjacent vertices and/or a predetermined minimum spacing between adjacent traces.


In yet another aspect of the present disclosure, the substrate has multiple layers and the method further includes generating multiple planar antenna layouts corresponding to the multiple layers, respectively.


In another aspect of the present disclosure, the computer-implemented method further includes adding to the planar antenna layout multiple straight linear portions routed from at least two of the planar antenna vertices to a connector location with respect to the coordinate system of the substrate.


In a further aspect of the present disclosure, the computer-implemented method further includes computing, for each of the multiple diagonal lines, a layout distance between the respective vertex of the seed rectangle and the boundary along the respective diagonal line, and the determining of the multiple distances between the multiple pairs of adjacent planar antenna vertices, respectively, is based at least in part on the computed layout distance.


In yet another aspect of the present disclosure, each of the multiple loops includes multiple of the straight linear portions and multiple of the planar antenna vertices.


In another aspect of the present disclosure, an outermost planar antenna vertex of the multiple planar antenna vertices is distanced from the boundary of the substrate by not more than a predetermined threshold.


In a further aspect of the present disclosure, the computer-implemented method further includes exporting data corresponding to the generated planar antenna layout to a circuit board routing tool and/or a circuit board manufacturing tool.


In yet another aspect of the present disclosure, the computer-implemented method further includes exporting data corresponding to the generated planar antenna layout to an electromagnetic simulation tool and simulating, based on the exported data, an electromagnetic field based on superposition of multiple electromagnetic field components from the multiple straight linear portions of the planar antenna layout, respectively.


According to another aspect of the present disclosure, a non-transitory computer-readable medium is provided, which stores instructions that, when executed by a processor, cause the processor to perform a method of designing an antenna assembly for radiating an electromagnetic field for electromagnetic navigation. The method includes computing, relative to a coordinate system of a substrate having a boundary, multiple diagonal lines based on a seed rectangle that has multiple vertices, respectively. The multiple diagonal lines bisect the multiple vertices of the seed rectangle, respectively, and extend from the multiple vertices of the seed rectangle, respectively, to the boundary. The method further includes, for each of the multiple diagonal lines, (1) determining multiple respective distances between multiple adjacent pairs of planar antenna vertices to be positioned along the respective diagonal line, and (2) positioning the planar antenna vertices along the respective diagonal line based on the determined multiple distances. The multiple distances increase in a direction from the respective vertex of the seed rectangle to the boundary. A planar antenna layout is generated by interconnecting the planar antenna vertices by way of respective straight linear portions to form multiple loops that sequentially traverse each of the multiple diagonal lines.


In another aspect of the present disclosure, the multiple distances are determined based at least in part on a predetermined number of loops of the planar antenna.


In a further aspect of the present disclosure, the multiple distances are determined based at least in part on a predetermined minimum spacing between adjacent vertices and/or a predetermined minimum spacing between adjacent traces.


In yet another aspect of the present disclosure, the substrate has multiple layers and the method further includes generating multiple planar antenna layouts that correspond to the multiple layers, respectively.


In another aspect of the present disclosure, the method further includes adding to the planar antenna layout multiple straight linear portions routed from at least two of the planar antenna vertices to a connector location with respect to the coordinate system of the substrate.


In a further aspect of the present disclosure, the method further comprises, for each of the plurality of diagonal lines, computing a layout distance between the respective vertex of the seed rectangle and the boundary along the respective diagonal line, and the determining of the multiple distances between the multiple pairs of adjacent planar antenna vertices, respectively, is based at least in part on the computed layout distance.


In yet another aspect of the present disclosure, each of the multiple loops includes multiple of the straight linear portions and multiple of the planar antenna vertices.


In another aspect of the present disclosure, an outermost planar antenna vertex of the multiple planar antenna vertices is distanced from the boundary of the substrate by not more than a predetermined threshold.


In a further aspect of the present disclosure, the method further includes exporting data corresponding to the generated planar antenna layout to a circuit board routing tool and/or a circuit board manufacturing tool.


In yet another aspect of the present disclosure, the method further includes exporting data corresponding to the generated planar antenna layout to an electromagnetic simulation tool and simulating, based on the exported data, an electromagnetic field based on superposition of multiple electromagnetic field components from the multiple straight linear portions of the planar antenna layout, respectively.


Any of the above aspects and embodiments of the present disclosure may be combined without departing from the scope of the present disclosure.





BRIEF DESCRIPTION OF THE DRAWINGS

Objects and features of the presently disclosed systems and methods will become apparent to those of ordinary skill in the art when descriptions of various embodiments are read with reference to the accompanying drawings, of which:



FIG. 1 is a perspective view of an example electromagnetic navigation (EMN) system in accordance with an embodiment of the present disclosure;



FIG. 2 shows an example design of an antenna assembly of the EMN system in accordance with an embodiment of the present disclosure;



FIG. 3 is a flowchart illustrating an example procedure for designing an antenna assembly in accordance with an embodiment of the present disclosure;



FIGS. 4-11 are example graphical representations of certain aspects of the procedure of FIG. 3, in accordance with an embodiment of the present disclosure;



FIG. 12 is an illustration of multiple example antennas that may be designed according to the procedure of FIG. 3, in accordance with an embodiment of the present disclosure;



FIG. 13 shows an example design of a loop antenna layout trace placement, in accordance with an embodiment of the present disclosure; and



FIG. 14 is a block diagram of an example computing device for use in various embodiments of the present disclosure.





DETAILED DESCRIPTION

The present disclosure is directed to antenna assemblies for radiating electromagnetic fields for electromagnetic navigation, electromagnetic navigation systems that include such antenna assemblies, and computer-implemented methods of designing such antenna assemblies. In one example, by virtue of geometrical and other aspects of an antenna assembly herein, the need to generate and employ a detailed electromagnetic field mapping can be avoided by instead enabling an electromagnetic field mapping, theoretically computed based on characteristics of the antenna assembly, to be employed either alone or in conjunction with a more easily generated low-density electromagnetic field mapping obtained from measurements. In other words, the antenna assembly herein can serve as the basis upon which to generate an accurate high-density theoretical electromagnetic field mapping for EMN, without having to use expensive measuring equipment and without having to perform time-consuming and laborious measurements.


In another example, an antenna assembly herein includes on a single substrate multiple planar antennas having characteristics, such as geometries and/or relative locations that are diverse from one another, that enable multiple (for example, six) degrees of freedom of a small electromagnetic sensor, such as a single-coil sensor, to be determined.


In yet another example, an antenna assembly herein includes a trace that is deposited on a layer of a substrate and that forms multiple loops with the spacing between loops and the spacing from a boundary or edge of the substrate that result in efficient use of the available area of the substrate.


In a further example, an automated, or semi-automated, highly reproducible computer-implemented method for designing an antenna assembly is provided herein. An antenna assembly design generated in this manner can be exported into a printed circuit board (PCB) layout software tool to minimize the need for a large amount of manual layout. The antenna assembly design can also be exported into an electromagnetic field simulator software tool to enable the generation of a theoretical electromagnetic field mapping for the antenna assembly.


Detailed embodiments of antenna assemblies, systems incorporating such antenna assemblies, and methods of designing the same are described herein. These detailed embodiments, however, are merely examples of the disclosure, which may be embodied in various forms. Therefore, specific structural and functional details disclosed herein are not to be interpreted as limiting, but merely as a basis for the claims and as a representative basis for enabling one skilled in the art to variously employ the present disclosure in virtually any appropriately detailed structure. While the example embodiments described below are directed to the bronchoscopy of a patient's airways, those skilled in the art will recognize that the same or similar assemblies, systems, and methods may also be used in other lumen networks, such as, for example, the vascular, lymphatic, and/or gastrointestinal networks.



FIG. 1 illustrates an example electromagnetic navigation (EMN) system 100 provided in accordance with the present disclosure. In general, the EMN system 100 is configured to identify a location and/or an orientation of a medical device being navigated toward a target location within the patient's body by using, among other things, an antenna assembly that generates one or more electromagnetic fields that are sensed by a sensor affixed to the medical device. In some cases, the EMN system 100 is further configured to augment computed tomography (CT) images, magnetic resonance imaging (MRI) images, and/or fluoroscopic images employed during navigation of the medical device through the patient's body toward a target of interest, such as a deceased portion in a luminal network of the patient's lung.


The EMN system 100 includes a catheter guide assembly 110, a bronchoscope 115, a computing device 120, a monitoring device 130, a patient platform 140 (which may be referred to as an EM board), a tracking device 160, and reference sensors 170. The bronchoscope 115 is operatively coupled to the computing device 120 (by way of the tracking device 160) and the monitoring device 130 via respective wired connections (as shown in FIG. 1) or wireless connections (not shown in FIG. 1).


During a navigation phase of an EMN bronchoscopy procedure, the bronchoscope 115 is inserted into the oral cavity of a patient 150 and captures images of the luminal network of the lung. The catheter guide assembly 110 is inserted into the bronchoscope 115 to access the periphery of the luminal network of the lung of the patient 150. The catheter guide assembly 110 may include a catheter or extended working channel (EWC) 111 with an EM sensor 112 affixed to a portion (for example, a distal portion) of the EWC 111. A locatable guide catheter (LG) may be inserted into the EWC 111 with another EM sensor (not shown in FIG. 1) affixed to a portion (for example, a distal portion) of the LG. The EM sensor 112 affixed to the EWC 111 or the EM sensor affixed to the LG is configured to receive a signal based on an electromagnetic field radiated by the antenna assembly 145, and based upon the received signal, is used to determine a location and/or an orientation of the EWC 111 or the LG during navigation through the luminal network of the lung. Due to the size restriction of the EM sensor 112 relative to the EWC 111 or the LG, in some cases the EM sensor 112 may include only a single coil for receiving one or more EM signals generated by way of an antenna assembly 145 as described in further detail below. However, the number of coils in the EM sensor 112 is not limited to one but may be two, three, or more.


The computing device 120, such as a laptop, desktop, tablet, or other suitable computing device, includes a display 122, one or more processors 124, one or more memories 126, an AC current driver 127 for providing AC current signals to the antenna assembly 145, a network interface controller 128, and one or more input devices 129. The particular configuration of the computing device 120 illustrated in FIG. 1 is provided as an example, but other configurations of the components shown in FIG. 1 as being included in the computing device 120 are also contemplated. In particular, in some embodiments, one or more of the components (122, 124, 126, 127, 128, and/or 129) shown in FIG. 1 as being included in the computing device 120 may instead be separate from the computing device 120 and may be coupled to the computing device 120 and/or to any other component(s) of the system 100 by way of one or more respective wired or wireless path(s) to facilitate the transmission of power and/or data signals throughout the system 100. For example, although not shown in FIG. 1, the AC current driver 127 may, in some example aspects, be separate from the computing device 120 and may be coupled to the antenna assembly 145 and/or coupled to one or more components of the computing device 120, such as the processor 124 and the memory 126, by way of one or more corresponding paths.


In some aspects, the EMN system 100 may also include multiple computing devices 120, wherein the multiple computing devices 120 are employed for planning, treatment, visualization, or helping clinicians in a manner suitable for medical operations. The display 122 may be touch-sensitive and/or voice-activated, enabling the display 122 to serve as both an input device and an output device. The display 122 may display two-dimensional (2D) images or three-dimensional (3D) images, such as a 3D model of a lung, to enable a practitioner to locate and identify a portion of the lung that displays symptoms of lung diseases.


The one or more memories 126 store one or more programs and/or computer-executable instructions that, when executed by the one or more processors 124, cause the one or more processors 124 to perform various functions and/or procedures. For example, the processors 124 may calculate a location and/or an orientation of the EM sensor 112 based on the electromagnetic signal that is radiated by the antenna assembly 145 and received by the EM sensor 112. The processors 124 may also perform image-processing functions to cause the 3D model of the lung to be displayed on the display 122. The processors 124 may also generate one or more electromagnetic signals to be radiated by way of the antenna assembly 145. In some embodiments, the computing device 120 may further include a separate graphic accelerator (not shown in FIG. 1) that performs only the image-processing functions so that the one or more processors 124 may be available for other programs. The one or more memories 126 also store data, such as mapping data for EMN, image data, patients' medical record data, prescription data, and/or data regarding a history of the patient's diseases, and/or other types of data.


The mapping data may link multiple grid points, in a coordinate system of an EM volume in which a medical device (e.g., the EWC 111, the LG, treatment probe, or another surgical device) navigates, to the EM signal characteristics (for example, signal strength) that correspond to the grid points, respectively. In this manner, when the EM sensor 112 senses an EM signal having certain characteristics at a particular grid point, the one or more processors 124 may compare the sensed EM signal characteristics to the EM signal characteristics in the mapping data and determine the location and/or orientation of the EM sensor 112 within the EM volume based on a result of the comparison.


As shown in FIG. 1, the platform 140 is configured to provide a flat surface upon which the patient 150 lies during the EMN navigation procedure. The antenna assembly 145, which may also be referred to as an EM field generating device, is arranged upon the platform 140 or is included as a component of the platform 140. The antenna assembly 145 includes one or more antennas, such as planar loop antennas (not shown in FIG. 1). Example aspects of the antenna assembly 145 are described in further detail below.


With the patient 150 lying upon the platform 140, the one or more processors 124 (or another signal generator not shown in FIG. 1) generate and provide to the antenna(s) of the antenna assembly 145 by way of the AC current driver 127 one or more AC current signals that the antenna(s) convert into one or more respective EM signal(s) and radiate in a manner sufficient to surround a portion of the patient 150. In some aspects, the antenna assembly 145 includes a connector that has at least two terminals, and the trace of the antenna (not shown in FIG. 1) has two ends that are coupled to the two connector terminals, respectively, to form a signal communication path from the one or more processors 145 to the antenna.


Having described an example EMN system 100, reference will now be made to FIG. 2, which is a graphical illustration of an example antenna assembly layout 200 of the antenna assembly 145 of the EMN system 100, according to an embodiment of the present disclosure. The antenna assembly layout 200 includes a substrate 210, such as a printed circuit board (PCB), which is formed of an electrically insulating material and may include one or more layers. The antenna assembly layout 200 also includes multiple planar antennas 220, which are formed of an electrically conductive material, such as a PCB trace, deposited on the substrate 210 and arranged in multiple loops or as a coil. In one example, each of the planar antennas 220 is deposited on a respective one of the layers of the substrate 210. In the example antenna assembly layout 200 of FIG. 2, multiple layers of the substrate 210 are shown simultaneously.


Each of the multiple antennas may be configured to radiate a separate EM field, for example, using frequency division multiplexing and/or time division multiplexing controlled by the processors 124 or by another generator. For example, the antennas, in some aspects, may be configured to radiate multiple EM fields sufficient in number and/or sufficient in diversity of characteristics (such as frequency, time, modulation scheme, and/or the like) to enable a single-coil electromagnetic sensor mounted on the EWC 111, or on any other medical device, to be used to determine the location and/or the orientation of the sensor, the EWC 111, and/or the medical device. The antenna assembly 145 may, for instance, include six to nine or more loop antennas. In some embodiments, for each of the loop antennas, the distances between its adjacent loops increase as the loops become larger. For example, for each of the planar antennas, respective distances between adjacent pairs of loops may increase in a direction from an innermost one of the loops to an outermost one of the loops of the respective planar antenna. In various embodiments, two or more of the loop antennas of the antenna assembly 145 may have a same number of loops, or may have respectively different numbers of loops.


Having described an example antenna assembly layout 200 of an antenna assembly 145 of the EMN system 100, reference will now be made to FIG. 3, which is a flowchart illustrating an example procedure 300 for designing an antenna assembly such as the antenna assembly 145, in accordance with an embodiment of the present disclosure. In various embodiments, the procedure 300 may be fully computer-implemented or partially computer-implemented. Reference will also be made to FIGS. 4 through 13, which are graphical illustrations of certain steps of the procedure 300, in accordance with an embodiment of the present disclosure. The example method 300 of FIG. 3 may be implemented to design an antenna assembly that includes one antenna or an antenna assembly that includes multiple antennas. For illustrative purposes, the present description of the method 300 will be made in the context of designing an antenna assembly that includes multiple antennas. However, although certain aspects of the method 300 will be described only with respect to the design of a single one of the multiple antennas, those aspects of the method 300 apply similarly to the other ones of the multiple antennas.


Before describing the details of the procedure 300, an overview of the procedure 300 will be provided. In general, according to the procedure 300, the design of the antenna assembly is based on a set of design parameters and/or constraints including a number of antennas M of the antenna assembly to be designed, as well as, for each antenna of the antenna assembly, a seed shape for the antenna, a location of a centroid of the seed shape on the substrate upon which the antenna will be manufactured, a number of loops (N) of the antenna, a minimum trace center-to-center spacing (TCCM) for the antenna, and dimensions of an edge or a boundary of the substrate. Locations of antenna vertices of the antenna are determined based on the seed shape. The antenna design then proceeds by interconnecting the antenna vertices by way of straight linear portions, beginning with the innermost antenna vertices and progressing to the outermost antenna vertices, so that the entire antenna forms a coil including a single trace arranged in multiple loops. In an aspect, each loop of the antenna assembly grows from the seed shape toward the boundaries of the substrate and effectively covers most of the available surface area of the substrate layer outside of the seed shape. The two ends of the trace are routed to a connector location to enable the antenna to be coupled to a signal generator.


For antenna assemblies having multiple planar antennas on respective layers of the multiple layer substrate, this general procedure is repeated for each of the antennas. Additionally, data corresponding to the designed antenna layouts can be exported to an electromagnetic field simulation tool for simulating the electromagnetic field (for example, the theoretical electromagnetic field mapping for EMN described above) that the respective antennas would generate based on their particular characteristics. The data corresponding to the designed antenna layouts can also be exported to a PCB manufacturing tool to enable the antenna assembly to be manufactured in an automated manner, in accordance with the designed antenna layouts.


Before describing the details of the procedure 300, reference will be made to FIG. 4 to describe example seed shapes and their characteristics. In particular, FIG. 4 shows examples of nine seed rectangles 401 through 409 of an antenna assembly to be designed according to the procedure 300. Each of the seed rectangles 401 through 409 includes four vertices within the edge 400 of the substrate. The number of seed rectangles, and hence the number of antennas M, shown in the example of FIG. 4 is nine, however, this is for illustrative purposes only and should not be construed as limiting. In other embodiments, the number of seed shapes, and hence the number of antennas M, may be, for example, six, nine, or more. As an example, the square 400 may represent the edge of the substrate, and a boundary (not shown in FIG. 4) that represents the area of the substrate that is available for placement of the antennas may be formed from a square within the x-z plane that is contained within the edge 400 of the substrate and smaller than the edge 400 of the substrate by some predetermined threshold or buffer amount.


In another example, an antenna assembly herein includes on a single substrate (for example, on respective layers of a multiple-layer substrate) multiple planar antennas having characteristics, such as geometries and/or relative locations that are diverse from one another, that enable multiple (for example, six) degrees of freedom of a small electromagnetic sensor, such as a single-coil sensor, to be determined. For instance, as shown in FIG. 4, the nine seed rectangles 401-409 may be grouped in three, with seed rectangles 401-403 being in a first group; seed rectangles 404-406 being in a second group; and seed rectangles 407-409 being in a third group. As shown in FIG. 4, the three seed rectangles in each group have specific geographical relationships with respect to one another. For instance, one seed rectangle is a square (or substantially square-like), and the other two seed rectangles are non-square rectangles and are located near two sides of the square. For example, the seed rectangle 401 is a square, the seed rectangle 402 is located in line with the length of the seed rectangle 401, and the seed rectangle 403 is located in line with the width of the seed rectangle 401. Further, the length of the seed rectangle 402 is longer than the width of the square 401, and is similar to the length of the seed rectangle 401, while the width of the seed rectangle 402 is smaller than the width of the square 401; and the width of the seed rectangle 403 is longer than the length of the square 401 and is similar to the width of the square 401, while the length of the seed rectangle 402 is smaller than the length of the square 401. The seed rectangles 404-406 of the second group and the seed rectangles 407-409 of the third groups also have the similar geometric features as the seed rectangles 401-403 of the first group.


Put differently, for each of multiple groups of planar antennas that may be generated based on the seed rectangles 401-409: an innermost loop of the first planar antenna (for example, corresponding to the seed rectangle 401) has a first linear portion (for example, first linear portion 410) and a second linear portion (for example, second linear portion 411) approximately perpendicular to the first linear portion (for example, first linear portion 410); an innermost loop of the second planar antenna (for example, corresponding to the seed rectangle 402) has a first linear portion (for example, first linear portion 412) and a second linear portion (for example, second linear portion 413) approximately perpendicular to, and longer than, the first linear portion (for example, first linear portion 412); an innermost loop of the third planar antenna (for example, corresponding to the seed rectangle 403) has a first linear portion (for example, first linear portion 414) and a second linear portion (for example, second linear portion 415) approximately perpendicular to, and longer than, the first linear portion (for example first linear portion 414); the first linear portion (for example, first linear portion 412) of the seed rectangle of the innermost loop of the second planar antenna is approximately parallel to the first linear portion (for example, first linear portion 410) of the innermost loop of the first planar antenna; and the first linear portion (for example, first linear portion 414) of the innermost loop of the third planar antenna is approximately parallel to the second linear portion (for example, second linear portion 411) of the innermost loop of the first planar antenna. Although additional reference numbers for the first and second linear portions of the seed rectangles 404-409 (and hence the correspondence planar antennas) are omitted from FIG. 4 for clarity, the seed rectangles 404-406 of the second group and the seed rectangles 407-409 of the third groups each have similar geometric relationships with respect to one another, as those described above in the context of the seed rectangles 401-403 of the first group.


In an aspect, these three groups may be geometrically dispersed from each group within the substrate 210. Dispersion may be accomplished by geometric relationship and/or angular relationship. For example, the respective innermost loops of the planar antennas of each group can be positioned, on the respective layers of the multiple-layer substrate, at respective angles that are distinct from one another. Additionally, the planar antennas, and/or the seed rectangles upon which the planar antennas are based, may have respective centroids (for example represented by circular dots in FIG. 4), relative to a plane of the substrate, that are mutually distinct from one another. Further, the outer boundaries of the first group include all seed rectangles 404-409 of the second and third groups. Also, the seed rectangles 404-409 of the second and third groups are geometrically dispersed within the outer boundaries of the first group.


Further, each group has an angular relationship with respect to the two axes (i.e., the x axis and the z axis). For example, the seed rectangle 401 of the first group is congruent with the two axes, while the seed rectangles 404 and 407 of the second and third groups are angled with respect to the two axes with different angles, respectively. In other words, the smallest angle between the seed rectangle 401 or the square of the first group and the x axis is zero; the smallest angle between the seed rectangle 404 and the x axis is greater than zero but less than the smallest angle between the seed rectangle 407 of the third group and the x axis. However, the relationship among three groups is not limited to the geometric and angular relationships but can be expanded in any readily conceivable way for a person having ordinary skill in the art within the scope of this disclosure.


Four vertices of each of the seed rectangles 401-409 may be provided in a coordinate form (x, z) in the x-z plane. In an aspect, a centroid of each of the seed rectangles 401-409 may also be provided in coordinate form or can be calculated from the four vertices. Dispersion may also be achieved by dispersing the centroids within the substrate 210. In an aspect, centroids of all seed rectangles 401-409 are disposed on the substrate in positions that are distinct from each other.


Referring now to FIG. 3, prior to block 301, a set of design parameters and/or constraints for the first antenna of the antenna assembly to be designed (for example, a seed shape for the antenna, a location of a centroid of the seed shape on a substrate upon which the antenna will be manufactured, a number of loops (N) of the antenna, a minimum trace center-to-center spacing (TCCM) for the antenna, and dimensions of an edge or a boundary of the substrate) are set (not shown in FIG. 3). For illustrative purposes, the seed shapes utilized in the procedure 300 for each antenna are seed rectangles; however, this should not be construed as limiting. Other seed shapes (for example, a seed triangle, a seed pentagon, a seed hexagon, any convex polygon, convex curved shape (e.g., an ellipse, an egg, a circle, etc.), or any other suitable seed shape) are contemplated and can be employed in the procedure 300. In some embodiments, any combination of different seed shapes can be used for the antennas of the antenna assembly, respectively. Each seed shape has multiple vertices. More specifically, each seed rectangle has four vertices.


At block 301, an antenna index iantenna is initialized. For example, iantenna is set equal to 1 to correspond to the first antenna of the multiple (M, where M>1) antennas of the antenna assembly to be designed. As described below, the purpose of the antenna index iantenna is to enable the procedure 300 to be repeated, in the case of antenna assemblies including multiple antennas, for each antenna of the M antennas of the antenna assembly. For instance, in some examples, the substrate has multiple layers (for example, as in a multi-layer PCB) and the method 300 is employed to generate multiple planar antenna layouts corresponding to the antennas to be deposited on corresponding ones of the multiple layers of the substrate.


At block 302, multiple diagonal lines are computed, relative to a coordinate system of the substrate, based on the seed rectangle. In general, the number of diagonal lines computed at block 302 equals the number of vertices of the seed shape. In particular, in the case of the seed rectangle, which has four vertices, four diagonal lines are computed that bisect the four vertices of the seed rectangle, respectively, and extend from the four vertices of the seed rectangle, respectively, to the boundary of the substrate. The boundary of the substrate may be a physical boundary of the substrate, such as an edge of a PCB, or may be a theoretically imposed boundary, such as a boundary offset from the edge of the PCB by a predetermined buffer distance.


In one example, as part of the computing of the multiple diagonal lines performed at block 302, origins for the diagonal lines of each of vertex of the seed rectangle are first calculated, and then vertices of the innermost loop of the antenna (also referred to as seed vertices) are determined based on the seed rectangle. For example, FIG. 5 shows origins 511 and 512 that are calculated for the seed rectangle 405 of FIG. 4. The origins 511 and 512 are bounded by the four vertices 501 through 504 of the seed rectangle 405. In an aspect, one origin may correspond to a single vertex of the seed rectangle, or one origin may correspond to two adjacent vertices. In another aspect, the origins 511 and 512 may be located on the diagonals of the seed rectangle or on the diagonals which bisect the corresponding angle to form two 45 degree angles. In this case, diagonals define the locations of vertices of the loop antenna. As an example, the origin 511 is located on a diagonal, which bisects the 90 degree angle at the vertex 501 to form two 45 degree angles. Also as shown in FIG. 5, the origin 511 is located on the intersection of the diagonals which bisect the angles at vertices 501 and 502. In the same way, the origin 512 is located at the intersection of the diagonals which bisect the angles at vertices 503 and 504. In one example, the origins for the diagonal lines of each vertex of the seed rectangle can be calculated by performing principal component analysis (PCA) over the coordinates of the four vertices 501-504, utilizing singular value decomposition. The following notations are used herein:

    • Pjk represents the k-th vertex of the j-th loop, where j is 1 to N and k is 1 to 4;
    • Pjkx and Pjkz represent x-coordinate and z-coordinate of the vertex Pjk, respectively;
    • {Pj1, Pj2, Pj3, Pj4} or simply {Pjk} is a 4 by 2 matrix having four vertices Pj1, Pj2, Pj3, Pj4 of the j-th loop as its rows;
    • U represents a 4 by 4 matrix having orthonormal eigenvectors of {Pjk}{Pjk}T as its column;
    • V represents a 2 by 2 matrix having orthonormal eigenvectors of {Pjk}T{Pjk} as its column; and
    • S represents a 4 by 2 matrix, whose nonzero elements are located only at its diagonal and are square root of eigenvalues of {Pjk}{Pjk}T or {Pjk}T{Pjk}; and
    • {tilde over (S)} represents a 4 by 2 matrix, whose nonzero elements are located only at its diagonal and are equal to the smallest nonzero element of S.


Given the four vertices Rk, (Rkx, Rkz), of the i-th seed rectangle, a centroid C, (Cx, Cz), of the i-th seed rectangle is calculated as follows:










(


C
x

,

C
z


)

=


(






k
=
1

4



R
kx


4

,





k
=
1

4



R
kz


4


)

.





(
1
)








By performing singular value decomposition on the centroid-subtracted four vertices Rj, S, V, and D matrices are obtained as follows:

USVT={Rk−C}  (2),

where {Rk−C} is a 4 by 2 matrix, each row of {Rk−C} is the centroid-subtracted vertex (Rkx−Cx, Rkz−Cz), and k is 1 to 4.


S is a 4 by 2 matrix having nonzero elements only in the diagonal, i.e., S11 and S22. Based on the singular value decomposition, S11 is greater than or equal to S22. By replacing the value of S11 with the value of S22, we can get a new 4 by 2 diagonal matrix {tilde over (S)}, where {tilde over (S)}11 and {tilde over (S)}22, are equal to S22. Then, the origins Ok for each vertex can be obtained by the following:

{Ok}={Rk}−U{tilde over (S)}VT  (3).

Because the diagonal entries of {tilde over (S)} are the minimum values of the diagonal entries of S, {Ok} includes only two different rows, corresponding to the origins 511 and 512, within the i-th seed rectangle, as shown in FIG. 5.


After obtaining the origins 511 and 512, a first set of four seed vertices P1k within the i-th seed rectangle are determined. These first four seed vertices P1k are the seed vertices for the innermost loop of the respective antenna and can be used to determine the other vertices of that antenna.


Given the minimum trace center-to-center (TCCM) spacing, which represents a predetermined minimum distance between traces or loops of a particular antenna or of all the antennas of a particular antenna assembly, the first seed vertex P11 is determined by moving R1 into its corresponding diagonal, which bisects the 90 degree angle at R1, toward the inside of the i-th seed rectangle. This can be done by first defining two vectors from R1 as follows:

{right arrow over (VR14)}={right arrow over (R4)}−{right arrow over (R1)}  (4),
{right arrow over (VR12)}={right arrow over (R2)}−{right arrow over (R1)}  (5),

where {right arrow over (Rk)} is a vector pointing toward Rk from the respective origin Ok, {right arrow over (VR14)} is a vector pointing toward R4 from R1, and {right arrow over (VR12)} is a vector pointing toward R2 from R1. By adding the unit vector of








V

R
14




,



V

R
14








V

R
14







,





to the unit vector of








V

R
12




,



V

R
12








V

R
12







,





a vector having a direction in line with the respective diagonal line, which bisects the 90 degree angle at R1 to form two 45 degree angles, is obtained, where the symbol “∥∥” represents a magnitude of the vector inside of the symbol “∥∥”. Then, the first seed vertex P11 is obtained by the following equation:












P
11



=



R
1



+

TCCM
×

(




V

R
14








V

R
14







+



V

R
12








V

R
12








)




,




(
6
)








where {right arrow over (P11)} is a vector originating from the respective origin O1 and thus represents a coordinate of P11. FIG. 6 illustrates the other three seed vertices P12, P13, and P14 of the antenna, which match R2, R3, and R4. The smallest distance between P1k and the four sides of the i-th seed rectangle equals TCCM. FIG. 7 shows vectors Diag1, Diag2, Diag3, and Diag4, which may form respective portions of the diagonal lines that bisect the seed vertices P11, P12, P13, and P14 and extend from the respective seed vertices P11, P12, P13, and P14 to the boundary of the substrate.


Referring back to FIG. 3, at block 303 a diagonal line index idiagonal is initialized. For example, idiagonal is set equal to 1 to correspond to the first diagonal line of the four diagonal lines of the seed rectangle. As described below, the purpose of the diagonal line index idiagonal is to enable aspects of the procedure to be repeated for each of the diagonal lines of the seed rectangle.


At block 304, for the respective diagonal line, a vertex-layout-distance (also referred to herein as a layout distance) Vlayout_k between the respective vertex of the seed rectangle and the boundary of the substrate, along the respective diagonal line is computed. The layout distance may represent, or may be related to, the maximum usable distance between the respective vertex of the seed rectangle and the boundary of the substrate.


In some example embodiments, as part of the computing of the layout distance at block 304, respective intersecting points Tk between the origins Ok and the boundary of the substrate, when the respective diagonals {right arrow over (Diagk)} are projected from the origins Ok, are calculated and identified, as shown, for example, in FIG. 9. The intersecting points Tk can be found using multiple conventional approaches. When the intersecting points Tk are found, the following relationship is satisfied:














O
k



T
k









O
k



T
k







=



Diag
k







Diag
k







,




(
14
)








where {right arrow over (OkTk)} is a vector from the origin Ok to the intersecting point Tk. In other words, vector {right arrow over (OkTk)} has the same direction as the diagonal vector {right arrow over (Diagk)}.


With the four vertices P11, P12, P13, and P14 of the first loop and the intersecting points T1, T2, T3, and T4 identified, the vertex-layout-distance, Vlayout_k, can be calculated from the following equation:










V
layout_k

=






P

1





k




T
k






-


VVM
2

.






(
15
)








The subtracting term,







VVM
2

,





ensures that the last vertex PNk of the N-th loop is distant from the intersecting point Tk. In other words, only a Vlayout_k-long linear portion starting from P1k is used to distribute (N−1) vertices between P1k and Tk.


After the intersecting points Tk are identified, every vertex for the loop antenna can be determined. As one of the initial conditions is that the number of loops of the loop antenna is N and the four vertices P11, P12, P13, and P14 of the first loop are determined in step 330, four vertices of each of the second, third, . . . , and N-th loops are recursively determined. In particular, at block 305, for the respective diagonal line, respective distances between adjacent pairs of planar antenna vertices to be positioned along the respective diagonal line are determined based at least in part on the layout distance computed at block 304. For example, the respective distances between adjacent pairs of planar antenna vertices to be positioned along the respective diagonal line may be determined so as to fit the predetermined number of loops N of the antenna while maximizing the use of the available linear distance from the vertex of the seed rectangle to the boundary of the substrate. In this manner, the available area of the substrate may be efficiently utilized. Additionally, in some example aspects, an outermost planar antenna vertex of the planar antenna vertices of the respective planar antenna is distanced from the boundary of the substrate by not more than a predetermined threshold, for efficient utilization of the available substrate area.


In some examples, the respective distances are determined at block 305 based at least in part on the predetermined number N of loops of the planar antenna, a predetermined minimum spacing between adjacent vertices, a predetermined minimum spacing between adjacent traces, and/or any combination of one or more of those factors or other factors. In particular, in one example, vertices are grouped in four groups with each group forming a rectangular shape, and vertices in the same group are described as corresponding vertices. For example, the first group includes P11, P21, . . . , and PN1, the second group includes P12, P22, . . . , and PN2, the third group includes P13, P23, . . . , and PN3, and the fourth group includes P14, P24, . . . , and PN4. Thus, P3k and PNk are in the same k-th group and are corresponding vertices, while P33 and P42 are not in the same group and cannot be corresponding vertices. For each group, the distance between Pjk and P(j+1)k is set to be greater than the distance between P(j−1)k and Pjk, where j is 2 to N−1 and k is 1 to 4. In other words, the distance between two adjacent corresponding vertices is increasing toward the boundary of the substrate. Put differently, in one example, as illustrated in FIG. 10, the distances between the adjacent pairs of antenna vertices become progressively larger in a direction from an innermost one of the vertices to an outermost one of the vertices. The progressively increasing distance in a direction from the respective vertex of the seed rectangle to the boundary may be implemented by various methods, such as arithmetic progression, geometric progression, exponential progression, and/or the like.


For example, arithmetic progression may be employed to distribute remaining vertices in each group. Letting djk be the distance between Pjk and P(j+1)k in the k-th group and be expressed in recursive form as:

∥{right arrow over (PjkP(j+1)k)}∥=djk  (16),
djk=slopek×(j−1)+d1k  (17), and
d1k=VVM  (18),

where ∥{right arrow over (PjkP(j+1)k)}∥ represents a distance between vertices Pjk and P(j+1)k, slopek is a constant for the k-th group, which is the common difference between two distances djk and d(j+1)k, and j is 1 to (N−2). Thus, each vertex in the k-th group is positioned on the linear portion connecting Tk and P1k and the total length between PNk and P1k is less than or equal to the vertex-layout-distance, Vlayout_k. In order to make an additional keepout area of half the minimum trace center to center (TCCM) spacing between the Tk and PNk, the following equation may be satisfied:














j
=
1


N
-
1







P
jk



P


(

j
+
1

)


k






=


V
layout_k

-

TCCM
2



,




(
19
)





or














j
=
1


N
-
1




d
jk


=





j
=
1


N
-
1




(



slope
k

×

(

j
-
1

)


+

d

1





k



)


=


V
layout_k

-


TCCM
2

.







(
20
)








When equation (20) is solved for the constant, slopek, the following equation can be obtained:










slope
k

=



2
·

(


V
layout_k

-


(

N
-
1

)



d

1





k



-

TCCM
2


)




(

N
-
1

)



(

N
-
2

)



.





(
21
)








When the equation (20) is combined with equations (16) and (17), the following equation is obtained:














P
jk



P


(

j
+
1

)


k







=




2
·

(


V
layout_k

-


(

N
-
1

)



d

1





k



-

TCCM
2


)




(

N
-
1

)



(

N
-
2

)





(

j
-
1

)


+


d

1





k


.






(
22
)








In this way, the distance between two adjacent corresponding vertices Pjk and P(j+1) k increases as j increases. This progressive pattern between corresponding vertices is shown in FIG. 10 more clearly in the first and the fourth groups than in the second and the third groups.


At block 306, the planar antenna vertices are positioned along the respective diagonal line based on the respective distances between adjacent pairs of planar antenna vertices determined at block 305.


At block 307, the diagonal line index idiagonal is compared to the number of diagonal lines, namely four, of the seed rectangle to determine whether the procedures of block 305 and block 306 are to be repeated for additional diagonal lines of the respective antenna. If it is determined at block 307 that idiagonal is less than the number of diagonal lines, then at block 308 idiagonal is incremented by one to correspond to the next diagonal line (for example, the second diagonal line) of the four diagonal lines of the seed rectangle. Then the procedures of block 305 and block 306 are repeated for that next diagonal line in the manner described above.


If, on the other hand, it is determined at block 307 that idiagonal is equal to the number of diagonal lines, indicating that the procedures of block 305 and block 306 have been executed for each of the four diagonal lines of the seed rectangle, then at block 309, a minimum vertex to vertex distance (VVM) is calculated to make sure that, when vertices are connected by linear portions or segments of a line, the smallest distance between two adjacent corresponding linear portions is greater than TCCM, where the phrase “two adjacent corresponding linear portions” being used to refer to linear portions that are positioned in different loops but are located closer to one another than any other linear portions. This is done by defining diagonal vectors {right arrow over (Diagk)}, setting up temporary vertices P′21 and P′22, measuring a distance between a linear portion connecting the temporary vertices P′21 and P′22 and a linear portion connecting P11 and P12, and adjusting a value of VVM until the smallest distance is greater than TCCM. Details of this step are further described below.


The diagonal vectors {right arrow over (Diagk)} are defined as follows:

{right arrow over (Diagk)}={right arrow over (P1k)}−{right arrow over (Ok)}  (7),

where k is 1 to 4. When these diagonal vectors {right arrow over (Diagk)} are arranged at the origin (0, 0), they form a cross indicating that they form four 90 degree angles as shown in the middle of FIG. 7.


A temporary distance Dp2to5 is initialized as the value of TCCM. Vectors {right arrow over (VP32)}, {right arrow over (P′22 temp)}, and {right arrow over (VP22 temp)} are defined by the following:












V

P
32




=



P
12



-


P
13





,




(
8
)









P

22

temp





=



P
12



+


D

p





2

to





5


×



V

p
32








V

P
32










,




(
9
)





and












V


P
22


temp




=




P



22





temp




-



P
12



.






(
10
)








Temporary vertex P′22 is defined in a vector form as follows:













P


22



=



P
12



+




Diag
2







Diag
2






×






V


P
22


temp






2




V


P
22


temp




·



Diag
2







Diag
2











,




(
11
)








where the symbol “.” is a dot product between two vectors. In short, temporary vertex P′22 is distant from P12 by √{square root over (2)}×TCCM in a direction of the diagonal {right arrow over (Diag2)} toward outside of the i-th seed rectangle. Next, VVM is temporarily initialized with the following equation:

VVM=∥{right arrow over (P′22)}−{right arrow over (P12)}∥  (12).

Temporary vertex P′21 is defined in a vector form as follows:












P


21



=



P
11



+

VVM
×




Diag
1







Diag
1






.







(
13
)








As with P′22, temporary vertex P′21 is distant from P11 by √{square root over (2)}×TCCM in a direction of the diagonal {right arrow over (Diag1)} toward outside of the i-th seed rectangle.


As shown in FIG. 8, distances between the linear portion connecting temporary vertices P′21 and P′22 and the linear portion between P11 and P12 are calculated. Since the linear portion connecting temporary vertices P′21 and P′22 and the linear portion between P11 and P12 may not be parallel, there are multiple distances between the two linear portions. At block 309, a determination is made as to whether the smallest distance D among the multiple distances between the two linear portions is less than or equal to TCCM. If it is determined at block 309 that the smallest distance D among the multiple distances is less than or equal to TCCM, then at block 311 the temporary distance Dp2to5 is increased by a predetermined amount and the above procedures of blocks 302 through 309 are repeated, including by using the equations (9)-(13) until the smallest distance D is greater than TCCM. The final result of VVM is set as the value for the vertex-to-vertex minimum.


If, on the other hand, it is determined at block 309 that the smallest distance D among the multiple distances is greater than TCCM, then at block 312 a planar antenna layout is generated by interconnecting the planar antenna vertices by way of respective straight linear portions to form multiple loops (e.g., N loops) that sequentially traverse each of the plurality of diagonal lines of the respective planar antenna. Each of the loops includes multiple straight linear portions and multiple planar antenna vertices, namely four straight linear portions and four planar antenna vertices, in a case where the seed shape is a seed rectangle. For example, the first loop of each loop antenna, such as the loop antenna shown in FIG. 11, includes four vertices (i.e., P11, P12, P13, and P14) and four linear portions (i.e., L11 connecting between P11 and P12, L12 connecting P12 and P13, L13 connecting P13 and P14, and L14 connecting P14 and P21); . . . the (N−1)-th loop includes four vertices (i.e., P(N−1)1, P(N−1)2, P(N−1)3, and P(N−1)4) and four linear portions (i.e., L(N−1) 1 connecting between P(N−1)1 and P(N−1)2, L(N−1)2 connecting P(N−1)2 and P(N−1)3, L(N−1)3 connecting P(N−1)3 and P(N−1)4, and L(N−1)4 connecting P(N−1)4 and PN1) (for clarity, not labeled in FIG. 11); and the N-th loop includes four vertices (i.e., PN1, PN2, PN3, and PN4) and three linear portions (i.e., LN1 connecting PN1 and PN2, LN2 connecting PN2 and PN3, and LN3 connecting PN3 and PN4). FIG. 11 shows a design for a loop antenna that includes a plurality of loops, which is designed according to the procedure 300.


At block 313, multiple additional straight linear portions are routed from at least two of the planar antenna vertices (in particular, from the two terminal antenna vertices located at the two ends, respectively, of the linear planar antenna layout) to one or more connector locations with respect to the coordinate system of the substrate. The multiple additional straight linear portions are added to the planar antenna layout. In embodiments where the procedure 300 is employed to design an antenna assembly that includes multiple planar antennas to be arranged on respective layers of a multiple-layer substrate, the planar antenna layouts may be routed to a single connector location, or to separate connector locations corresponding to each antenna, respectively, or to any combination of connectors.


At block 314, the antenna index iantenna is compared to the number of antennas M of the antenna assembly to determine whether the procedures of block 302 through block 313 are to be repeated for additional antennas of the antenna assembly. If it is determined at block 314 that iantenna is less than the number of antennas M, then at block 315 iantenna is incremented by one to correspond to the next antenna (for example, the second antenna) of the M antennas of the antenna assembly. Then the procedures of block 302 through block 313 are repeated for that next antenna in the manner described above. FIG. 12 shows designs for six loop antennas, which can be designed in accordance with the procedure 300.


If, on the other hand, it is determined at block 314 that iantenna is equal to the number of antennas M, indicating that the procedures of block 302 through block 313 have been executed for each of the M antennas of the antenna assembly, then at block 316, which may be optional in some embodiments, data corresponding to the generated planar antenna layout is exported to a circuit board routing tool, a circuit board manufacturing tool, and/or an electromagnetic simulation tool.


In one example, by exporting the data corresponding to the generated planar antenna layout to the electromagnetic simulation tool at block 316, one or more electromagnetic fields that may be generated by the antennas of the antenna assembly may be simulated based on the exported data and on the superposition of multiple electromagnetic field components from each of the multiple straight linear portions of the planar antenna layout, respectively. For instance, each loop based on the seed shape can be expressed with a definite mathematical equation, such as a Cartesian equation or a parametric equation, such that the strength of an EM field generated by each loop can be calculated by the Biot-Savart-Laplace law at any point in space based on the mathematical equation. In other words, by virtue of geometrical and other aspects of the antenna assembly (such as the use of straight linear portions as the interconnections in the antennas of the antenna assembly), the need to generate and employ a detailed electromagnetic field mapping can be avoided by instead enabling an electromagnetic field mapping to be theoretically computed based on the characteristics of the antenna assembly. The computed electromagnetic field mapping can then be employed either alone or in conjunction with a more easily generated low-density electromagnetic field mapping obtained from measurements. In other words, the antenna assembly designed according to the procedure 300 can serve as the basis upon which to generate an accurate high-density theoretical electromagnetic field mapping for EMN, without having to use expensive measuring equipment and without having to perform time-consuming and laborious measurements.


As is apparent from the description herein, according to the procedure 300, an antenna assembly can be efficiently and designed in a repeatable manner based on a few design parameters and/or constraints, such as a seed shape, a number of loops, a TCCM, and/or the like. Each of the antennas of the designed antenna assembly can be printed, deposited, or fabricated on a respective substrate layer and can be used as the EM field generator 145 of the EMN system 100 of FIG. 1. Further, by virtue of employing straight linear portions to constitute the loop antennas, electromagnetic fields generated by each linear portion can be theoretically and accurately calculated using the Biot-Savart-Laplace law at any point in the EM volume.



FIG. 13 shows a graphical illustration of a loop antenna layout designed by the method 300 of FIG. 3. After connecting all the vertices, additional layout may be automatically generated based on a few design rules in place related to trace length and routing directionality. These rules may be specific to a PCB software program or design requirements. In an aspect, the antenna design made by the method 300 may be converted to a 2 dimensional DXF (Drawing eXchange Format) CAD file, which is then imported into Altium PCB layout software. PCB layout software is not limited to Altium PCB layout software but can be any software, which a person having ordinary skill in the art would readily appreciate and use.


Based on the design rules or design requirements of the software, vertices P11 and PN4 are electrically coupled to a connector 1301, which includes at least two conductors 1301a, 1301b of the loop antenna, respectively, and a full blueprint of the loop antenna is complete.


Upon completion of the design of the antenna assembly, an antenna is fabricated, based on the antenna assembly design, by depositing electrically conducting materials (e.g., silver or copper) on a substrate, as shown in FIG. 13. The antenna printed on the substrate includes structural and/or geometrical relationships between loops, which are described in detail below.


In an example aspect, vertices of the loop antenna can be grouped in four groups. The first group of vertices includes P11, P21, . . . , and PN1, the second group of vertices includes P12, P22, . . . , and PN2, the third group of vertices includes P13, P23, . . . , and PN3, and the fourth group of vertices includes P14, P24, . . . , and PN4. Because Vlayout_k is different for each group, one group of vertices may be more densely distributed than the other groups of vertices. As shown in FIG. 13, vertices in the fourth group are more loosely distributed than vertices in the other groups, and the vertices in the second or third group are more densely distributed than vertices in the first and fourth groups.


In another aspect, the shortest distance between two corresponding linear portions (e.g., Ljk and L(j+1)k) increases as j increases. In other words, the distances between two adjacent corresponding linear portions are increasing in a direction from the innermost linear portion to the corresponding outermost linear portion. Based on this structural and/or geometrical relationship among loops and vertices, the loop antenna can cover the substrate as much as possible while maintaining such a relationship.


In an embodiment, after connecting the vertices with linear portions, another safety measure may be employed to confirm that all the requirements are satisfied in the antenna design. For example, shortest distances between two adjacent corresponding linear portions may be calculated again. In a case when there are any two adjacent corresponding linear portions, between which the shortest distance is not greater than TCCM, the procedure 300 can be repeated with a different minimum vertex to vertex distance VVM.


In an aspect, the design procedure 300 can enable maintaining substantially the same inductance of each loop antenna because the inductance is defined based at least in part on the antenna geometry. The resistance of the loop antenna may vary with copper thickness on each layer. Thus, in order to ensure that the antenna assembly maintains the intended copper thickness, two additional layers (one on the top and the other on the bottom) are added. With these extra layers, the plating processing for the vias would not add copper to the antenna layers on the internal layers. Thus, the copper thickness may depend only on the core material used and copper weight selected, initially. In another aspect, the PCB design may contain more than a single via for each current carrying path to minimize series resistance and increase the robustness of each current path. By having more vias, the resistance can be predicted and automatically calculated with high accuracy based on the antenna geometry and controlled copper thickness.


Turning now to FIG. 14, there is shown a block diagram of a computing device 1400, which can be used as the EMN system 100, the control workstation 102, the tracking device 160, and/or a computer performing the procedure 300 of FIG. 3. The computing device 1400 may include one or more of each of the following components: a memory 1402, a processor 1404, a display 1406, network interface controller 1408, an input device 1410, and/or an output module 1412.


The memory 1402 includes any non-transitory computer-readable storage media for storing data and/or software that is executable by the processor 1404 and which controls the operation of the computing device 1400. In an embodiment, the memory 1402 may include one or more solid-state storage devices such as flash memory chips. Alternatively, or in addition to the one or more solid-state storage devices, the memory 1402 may include one or more mass storage devices connected to the processor 1404 through a mass storage controller (not shown in FIG. 14) and a communications bus (not shown in FIG. 14). Although the description of computer-readable media contained herein refers to a solid-state storage, it should be appreciated by those skilled in the art that computer-readable storage media can be any available media that can be accessed by the processor 1404. That is, examples of computer readable storage media include non-transitory, volatile and non-volatile, removable and non-removable media implemented in any method or technology for storage of information such as computer-readable instructions, data structures, program modules or other data. For example, computer-readable storage media may include RAM, ROM, EPROM, EEPROM, flash memory or other solid state memory technology, CD-ROM, DVD, Blu-Ray or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by the computing device 1400.


The memory 1402 may store application 1416 and/or data 1414. The application 1416 may, when executed by the processor 1404, cause the display 1406 to present user interface 1418 on the display 1406.


The processor 1404 may be a general purpose processor, a specialized graphic processing unit (GPU) configured to perform specific graphics processing tasks while freeing up the general purpose processor to perform other tasks, a programmable logic device such as a field programmable gate array (FPGA) or complex programmable logic device (CPLD), and/or any number or combination of such processors or devices configured to work independently or cooperatively.


The display 1406 may be touch-sensitive and/or voice-activated, enabling the display 1406 to serve as both an input and output device. Alternatively, a keyboard (not shown), mouse (not shown), or other data input devices may be employed.


The network interface 1408 may be configured to connect to a network, such as a local area network (LAN) including a wired network and/or a wireless network, a wide area network (WAN), a wireless mobile network, a Bluetooth network, and/or the Internet. For example, the computing device 1400 may receive design requirements and predetermined variables and perform the procedure 300 of FIG. 3 to design an antenna assembly. The computing device 1400 may receive updates to its software, for example, application 1416, via the network interface controller 1408. The computing device 1400 may also display notifications on the display 1406 that a software update is available.


In another aspect, the computing device 1400 may receive computed tomographic (CT) image data of a patient from a server, for example, a hospital server, Internet server, or other similar servers, for use during surgical planning. Patient CT image data may also be provided to the computing device 1400 via a removable memory (not shown in FIG. 14).


Input device 1410 may be any device by means of which a user may interact with the computing device 1400, such as, for example, a mouse, keyboard, foot pedal, touch screen, and/or voice interface.


Output module 1412 may include any connectivity port or bus, such as, for example, parallel ports, serial ports, universal serial busses (USB), or any other similar connectivity port known to those skilled in the art.


The application 1416 may be one or more software programs stored in the memory 1402 and executed by the processor 1404 of the computing device 1400. During a design phase for loop antennas, one or more software programs in the application 1416 may be loaded from the memory 1402 and executed by the processor 1404 to automatically design loop antennas, given certain parameters and/or constraints, such as seed shape information, the number of loops in each loop antenna, and/or the like. In some embodiments, during a planning phase, one or more programs in the application 1416 guides a clinician through a series of steps to identify a target, size the target, size a treatment zone, and/or determine an access route to the target for later use during the navigation or procedure phase. In some other embodiments, one or more software programs in the application 1416 may be loaded on computing devices in an operating room or other facility where surgical procedures are performed, and is used as a plan or map to guide a clinician performing a surgical procedure, but without any feedback from the medical device used in the procedure to indicate where the medical device is located in relation to the plan.


The application 1416 may be installed directly on the computing device 1400, or may be installed on another computer, for example a central server, and opened on the computing device 1400 via the network interface 1408. Application 1416 may run natively on the computing device 1400, as a web-based application, or any other format known to those skilled in the art. In some embodiments, the application 1416 will be a single software program having all of the features and functionality described in the present disclosure. In other embodiments, the application 1416 may be two or more distinct software programs providing various parts of these features and functionality. For example, the application 1416 may include one software program for automatically designing loop antennas, another one for converting the design into a CAD file, and a third program for PCB layout software program. In such instances, the various software programs forming part of the application 1416 may be enabled to communicate with each other and/or import and export various data including settings and parameters relating to the design of the loop antennas. For example, a design of a loop antenna generated by one software program may be stored and exported to be used by a second software program to convert into a CAD file, and the converted file may be also stored and exported to be used by a PCB layout software program to complete a blueprint of the loop antenna.


The application 1416 may communicate with a user interface 1418 which generates a user interface for presenting visual interactive features to a user, for example, on the display 1406 and for receiving input, for example, via a user input device. For example, user interface 1418 may generate a graphical user interface (GUI) and output the GUI to the display 1406 for viewing by a user.


In a case that the computing device 1400 may be used as the EMN system 100, the control workstation 102, or the tracking device 160, the computing device 1400 may be linked to the monitoring device 130, thus enabling the computing device 1400 to control the output on the monitoring device 130 along with the output on the display 1406. The computing device 1400 may control the monitoring device 130 to display output which is the same as or similar to the output displayed on the display 1406. For example, the output on the display 1406 may be mirrored on the monitoring device 130. Alternatively, the computing device 1400 may control the monitoring device 130 to display different output from that displayed on the display 1406. For example, the monitoring device 130 may be controlled to display guidance images and information during the surgical procedure, while the display 1406 is controlled to display other output, such as configuration or status information of an electrosurgical generator (not shown in FIG. 1).


The application 1416 may include one software program for use during the planning phase, and a second software program for use during the navigation or procedural phase. In such instances, the various software programs forming part of application 1416 may be enabled to communicate with each other and/or import and export various settings and parameters relating to the navigation and treatment and/or the patient to share information. For example, a treatment plan and any of its components generated by one software program during the planning phase may be stored and exported to be used by a second software program during the procedure phase.


Although embodiments have been described in detail with reference to the accompanying drawings for the purpose of illustration and description, it is to be understood that the inventive processes and apparatus are not to be construed as limited. It will be apparent to those of ordinary skill in the art that various modifications to the foregoing embodiments may be made without departing from the scope of the disclosure.

Claims
  • 1. An antenna assembly for radiating at least one electromagnetic field for electromagnetic navigation, the antenna assembly comprising: a substrate; anda planar antenna including a trace deposited on the substrate and arranged in a plurality of loops,wherein respective distances between any two adjacent loops of the plurality of loops progressively increase in a direction from an innermost loop of the plurality of loops to an outermost loop of the plurality of loops.
  • 2. The antenna assembly according to claim 1, wherein each of the plurality of loops includes a plurality of straight linear portions and a plurality of vertices.
  • 3. The antenna assembly according to claim 2, wherein each of the plurality of loops includes four straight linear portions and four vertices.
  • 4. The antenna assembly according to claim 3, wherein each of the plurality of vertices is disposed along one of four diagonal lines that bisect four respective vertices of a seed rectangle corresponding to the planar antenna.
  • 5. The antenna assembly according to claim 1, further comprising: a connector having at least two terminals,wherein the trace has two ends that are coupled to the two terminals, respectively.
  • 6. The antenna assembly according to claim 1, further comprising: a plurality of planar antennas,wherein each of the plurality of planar antennas includes a respective trace deposited on the substrate and arranged in a respective plurality of loops, andwherein, for each of the plurality of planar antennas, respective distances between adjacent loops of the respective plurality of loops increase in a direction from an innermost loop of the respective plurality of loops to an outermost loop of the respective plurality of loops of the respective planar antenna.
  • 7. The antenna assembly according to claim 6, wherein the substrate includes a plurality of layers and the planar antenna and each of the plurality of planar antennas is deposited on a respective layer of the plurality of layers.
  • 8. The antenna assembly according to claim 6, wherein the planar antenna and each of the plurality of planar antennas each include a same number of loops.
  • 9. The antenna assembly according to claim 6, wherein each of the loops of each of the plurality of planar antennas includes a plurality of straight linear portions and a plurality of vertices.
  • 10. The antenna assembly according to claim 6, wherein the planar antenna and the plurality of planar antennas have a plurality of centroids, respectively, with respect to a plane of the substrate that are disposed in respective positions that are distinct from one another.
US Referenced Citations (935)
Number Name Date Kind
1576781 Phillips Mar 1926 A
1735726 Bornhardt Nov 1929 A
2407845 Nemeyer Sep 1946 A
2650588 Drew Sep 1953 A
2697433 Sehnder Dec 1954 A
3016899 Stenvall Jan 1962 A
3017887 Heyer Jan 1962 A
3061936 Dobbeleer Nov 1962 A
3073310 Mocarski Jan 1963 A
3109588 Polhemus et al. Nov 1963 A
3121228 Kalmus Feb 1964 A
3294083 Alderson Dec 1966 A
3367326 Frazier Feb 1968 A
3439256 Kahne et al. Apr 1969 A
3519436 Bauer et al. Jul 1970 A
3577160 White May 1971 A
3600625 Tsuneta et al. Aug 1971 A
3605725 Bentov Sep 1971 A
3614950 Rabey Oct 1971 A
3644825 Davis, Jr. et al. Feb 1972 A
3674014 Tillander Jul 1972 A
3702935 Carey et al. Nov 1972 A
3704707 Halloran Dec 1972 A
3821469 Whetstone et al. Jun 1974 A
3822697 Komiya Jul 1974 A
3868565 Kuipers Feb 1975 A
3941127 Froning Mar 1976 A
3983474 Kuipers Sep 1976 A
4017858 Kuipers Apr 1977 A
4037592 Kronner Jul 1977 A
4052620 Brunnett Oct 1977 A
4054881 Raab Oct 1977 A
4117337 Staats Sep 1978 A
4135184 Pruzick Jan 1979 A
4173228 Van Steenwyk et al. Nov 1979 A
4182312 Mushabac Jan 1980 A
4202349 Jones May 1980 A
4228799 Anichkov et al. Oct 1980 A
4249167 Purinton et al. Feb 1981 A
4256112 Kopf et al. Mar 1981 A
4262306 Renner Apr 1981 A
4287809 Egli et al. Sep 1981 A
4298874 Kuipers Nov 1981 A
4308530 Kip et al. Dec 1981 A
4314251 Raab Feb 1982 A
4317078 Weed et al. Feb 1982 A
4319136 Jinkins Mar 1982 A
4328548 Crow et al. May 1982 A
4328813 Ray May 1982 A
4339953 Iwasaki Jul 1982 A
4341220 Perry Jul 1982 A
4341385 Doyle et al. Jul 1982 A
4346384 Raab Aug 1982 A
4358856 Stivender et al. Nov 1982 A
4368536 Pfeiler Jan 1983 A
4394831 Egli et al. Jul 1983 A
4396885 Constant Aug 1983 A
4396945 DiMatteo et al. Aug 1983 A
4403321 Kruger Sep 1983 A
4418422 Richter et al. Nov 1983 A
4419012 Stephenson et al. Dec 1983 A
4422041 Lienau Dec 1983 A
4425511 Brosh Jan 1984 A
4431005 McCormick Feb 1984 A
4447224 DeCant, Jr. et al. May 1984 A
4447462 Tafuri et al. May 1984 A
4485815 Amplatz et al. Dec 1984 A
4506676 Duska Mar 1985 A
4543959 Sepponen Oct 1985 A
4548208 Niemi Oct 1985 A
4571834 Fraser et al. Feb 1986 A
4572198 Codrington Feb 1986 A
4583538 Onik et al. Apr 1986 A
4584577 Temple Apr 1986 A
4586491 Carpenter May 1986 A
4587975 Salo et al. May 1986 A
4608977 Brown Sep 1986 A
4613866 Blood Sep 1986 A
4617925 Laitinen Oct 1986 A
4618978 Cosman Oct 1986 A
4621628 Brudermann Nov 1986 A
4625718 Olerud et al. Dec 1986 A
4638798 Shelden et al. Jan 1987 A
4642786 Hansen Feb 1987 A
4645343 Stockdale et al. Feb 1987 A
4649504 Krouglicof et al. Mar 1987 A
4651732 Frederick Mar 1987 A
4653509 Oloff et al. Mar 1987 A
4659971 Suzuki et al. Apr 1987 A
4660970 Ferrano Apr 1987 A
4673352 Hansen Jun 1987 A
4686695 Macovski Aug 1987 A
4688037 Krieg Aug 1987 A
4696544 Costella Sep 1987 A
4697595 Breyer et al. Oct 1987 A
4701049 Beckman et al. Oct 1987 A
4704602 Asbrink Nov 1987 A
4705395 Hageniers Nov 1987 A
4705401 Addleman et al. Nov 1987 A
4706665 Gouda Nov 1987 A
4709156 Murphy et al. Nov 1987 A
4710708 Rorden et al. Dec 1987 A
4719419 Dawley Jan 1988 A
4722056 Roberts et al. Jan 1988 A
4722336 Kim et al. Feb 1988 A
4723544 Moore et al. Feb 1988 A
4726355 Okada Feb 1988 A
4727565 Ericson Feb 1988 A
RE32619 Damadian Mar 1988 E
4733969 Case et al. Mar 1988 A
4737032 Addleman et al. Apr 1988 A
4737794 Jones Apr 1988 A
4737921 Goldwasser et al. Apr 1988 A
4742356 Kuipers May 1988 A
4742815 Ninan et al. May 1988 A
4743770 Lee May 1988 A
4743771 Sacks et al. May 1988 A
4745290 Frankel et al. May 1988 A
4750487 Zanetti Jun 1988 A
4753528 Hines et al. Jun 1988 A
4761072 Pryor Aug 1988 A
4764016 Johansson Aug 1988 A
4771787 Wurster et al. Sep 1988 A
4779212 Levy Oct 1988 A
4782239 Hirose et al. Nov 1988 A
4784117 Miyazaki Nov 1988 A
4788481 Niwa Nov 1988 A
4791934 Brunnett Dec 1988 A
4793355 Crum et al. Dec 1988 A
4794262 Sato et al. Dec 1988 A
4797907 Anderton Jan 1989 A
4803976 Frigg et al. Feb 1989 A
4804261 Kirschen Feb 1989 A
4805615 Carol Feb 1989 A
4809694 Ferrara Mar 1989 A
4821200 Oberg Apr 1989 A
4821206 Arora Apr 1989 A
4821731 Martinelli et al. Apr 1989 A
4822163 Schmidt Apr 1989 A
4825091 Breyer et al. Apr 1989 A
4829250 Rotier May 1989 A
4829373 Leberl et al. May 1989 A
4836778 Baumrind et al. Jun 1989 A
4838265 Cosman et al. Jun 1989 A
4841967 Chang et al. Jun 1989 A
4845771 Wislocki et al. Jul 1989 A
4849692 Blood Jul 1989 A
4860331 Williams et al. Aug 1989 A
4862893 Martinelli Sep 1989 A
4869247 Howard, III et al. Sep 1989 A
4875165 Fencil et al. Oct 1989 A
4875478 Chen Oct 1989 A
4884566 Mountz et al. Dec 1989 A
4889526 Rauscher et al. Dec 1989 A
4896673 Rose et al. Jan 1990 A
4905698 Strohl, Jr. et al. Mar 1990 A
4923459 Nambu May 1990 A
4931056 Ghajar et al. Jun 1990 A
4945305 Blood Jul 1990 A
4945912 Langberg Aug 1990 A
4945914 Allen Aug 1990 A
4951653 Fry et al. Aug 1990 A
4955891 Carol Sep 1990 A
4961422 Marchosky et al. Oct 1990 A
4977655 Martinelli Dec 1990 A
4989608 Ratner Feb 1991 A
4991579 Allen Feb 1991 A
5002058 Martinelli Mar 1991 A
5005592 Cartmell Apr 1991 A
5013047 Schwab May 1991 A
5013317 Cole et al. May 1991 A
5016639 Allen May 1991 A
5017139 Mushabac May 1991 A
5023102 Given, Jr. Jun 1991 A
5027818 Bova et al. Jul 1991 A
5030196 Inoue Jul 1991 A
5030222 Calandruccio et al. Jul 1991 A
5031203 Trecha Jul 1991 A
RE33662 Blair et al. Aug 1991 E
5042486 Pfeiler et al. Aug 1991 A
5047036 Koutrouvelis Sep 1991 A
5050608 Watanabe et al. Sep 1991 A
5054492 Scribner et al. Oct 1991 A
5057095 Fabian Oct 1991 A
5059789 Salcudean Oct 1991 A
5070462 Chau Dec 1991 A
5078140 Kwoh Jan 1992 A
5079699 Tuy et al. Jan 1992 A
5082286 Ryan et al. Jan 1992 A
5086401 Glassman et al. Feb 1992 A
5088928 Chan Feb 1992 A
5094241 Allen Mar 1992 A
5097839 Allen Mar 1992 A
5098426 Sklar et al. Mar 1992 A
5099845 Besz et al. Mar 1992 A
5099846 Hardy Mar 1992 A
5104393 Isner et al. Apr 1992 A
5105829 Fabian et al. Apr 1992 A
5107839 Houdek et al. Apr 1992 A
5107843 Aarnio et al. Apr 1992 A
5107862 Fabian et al. Apr 1992 A
5109194 Cantaloube Apr 1992 A
5119817 Allen Jun 1992 A
5127408 Parsons et al. Jul 1992 A
5129654 Bogner Jul 1992 A
5142930 Allen et al. Sep 1992 A
5143076 Hardy et al. Sep 1992 A
5152277 Honda et al. Oct 1992 A
5152288 Hoenig et al. Oct 1992 A
5160337 Cosman Nov 1992 A
5161536 Vilkomerson et al. Nov 1992 A
5178130 Kaiya Jan 1993 A
5178164 Allen Jan 1993 A
5178621 Cook et al. Jan 1993 A
5186174 Schlondorff et al. Feb 1993 A
5187475 Wagener et al. Feb 1993 A
5188126 Fabian et al. Feb 1993 A
5188368 Ryan Feb 1993 A
5190059 Fabian et al. Mar 1993 A
5190285 Levy et al. Mar 1993 A
5193106 DeSena Mar 1993 A
5196928 Karasawa et al. Mar 1993 A
5197476 Nowacki et al. Mar 1993 A
5197965 Cherry et al. Mar 1993 A
5198768 Keren Mar 1993 A
5198877 Schulz Mar 1993 A
5203337 Feldman Apr 1993 A
5207688 Carol May 1993 A
5211164 Allen May 1993 A
5211165 Dumoulin et al. May 1993 A
5211176 Ishiguro et al. May 1993 A
5212720 Landi et al. May 1993 A
5214615 Bauer May 1993 A
5219351 Teubner et al. Jun 1993 A
5222499 Allen et al. Jun 1993 A
5224049 Mushabac Jun 1993 A
5228442 Imran Jul 1993 A
5230338 Allen et al. Jul 1993 A
5230623 Guthrie et al. Jul 1993 A
5233990 Barnea Aug 1993 A
5237996 Waldman et al. Aug 1993 A
5249581 Horbal et al. Oct 1993 A
5251127 Raab Oct 1993 A
5251635 Dumoulin et al. Oct 1993 A
5253647 Takahashi et al. Oct 1993 A
5255680 Darrow et al. Oct 1993 A
5257636 White Nov 1993 A
5257998 Ota et al. Nov 1993 A
5261404 Mick et al. Nov 1993 A
5262722 Hedengren et al. Nov 1993 A
5265610 Darrow et al. Nov 1993 A
5265611 Hoenig et al. Nov 1993 A
5269759 Hernandez et al. Dec 1993 A
5271400 Dumoulin et al. Dec 1993 A
5273025 Sakiyama et al. Dec 1993 A
5274551 Corby, Jr. Dec 1993 A
5279309 Taylor et al. Jan 1994 A
5285787 Machida Feb 1994 A
5291199 Overman et al. Mar 1994 A
5291889 Kenet et al. Mar 1994 A
5295483 Nowacki et al. Mar 1994 A
5297549 Beatty et al. Mar 1994 A
5299253 Wessels Mar 1994 A
5299254 Dancer et al. Mar 1994 A
5299288 Glassman et al. Mar 1994 A
5300080 Clayman et al. Apr 1994 A
5301061 Nakada et al. Apr 1994 A
5305091 Gelbart et al. Apr 1994 A
5305203 Raab Apr 1994 A
5306271 Zinreich et al. Apr 1994 A
5307072 Jones, Jr. Apr 1994 A
5307816 Hashimoto et al. May 1994 A
5309913 Kormos et al. May 1994 A
5315630 Sturm et al. May 1994 A
5316024 Hirschi et al. May 1994 A
5318025 Dumoulin et al. Jun 1994 A
5320111 Livingston Jun 1994 A
5325728 Zimmerman et al. Jul 1994 A
5325873 Hirschi et al. Jul 1994 A
5327889 Imran Jul 1994 A
5329944 Fabian et al. Jul 1994 A
5330485 Clayman et al. Jul 1994 A
5333168 Fernandes et al. Jul 1994 A
5341807 Nardella Aug 1994 A
5347289 Elhardt Sep 1994 A
5353795 Souza et al. Oct 1994 A
5353800 Pohndorf et al. Oct 1994 A
5353807 DeMarco Oct 1994 A
5357253 Van Etten et al. Oct 1994 A
5359417 Muller et al. Oct 1994 A
5368030 Zinreich et al. Nov 1994 A
5371778 Yanof et al. Dec 1994 A
5375596 Twiss et al. Dec 1994 A
5376795 Hasegawa et al. Dec 1994 A
5377678 Dumoulin et al. Jan 1995 A
5383454 Bucholz Jan 1995 A
5383852 Stevens-Wright Jan 1995 A
5385146 Goldreyer Jan 1995 A
5385148 Lesh et al. Jan 1995 A
5386828 Owens et al. Feb 1995 A
5389073 Imran Feb 1995 A
5389101 Heilbrun et al. Feb 1995 A
5391199 Ben-Haim Feb 1995 A
5394457 Leibinger et al. Feb 1995 A
5394875 Lewis et al. Mar 1995 A
5397321 Houser et al. Mar 1995 A
5397329 Allen Mar 1995 A
5398684 Hardy Mar 1995 A
5398691 Martin et al. Mar 1995 A
5399146 Nowacki et al. Mar 1995 A
5400384 Fernandes et al. Mar 1995 A
5400771 Pirak et al. Mar 1995 A
5402801 Taylor Apr 1995 A
5405346 Grundy et al. Apr 1995 A
5408409 Glassman et al. Apr 1995 A
5409000 Imran Apr 1995 A
5412414 Ast et al. May 1995 A
5413573 Koivukangas May 1995 A
5417210 Funda et al. May 1995 A
5419325 Dumoulin et al. May 1995 A
5423334 Jordan Jun 1995 A
5425367 Shapiro et al. Jun 1995 A
5425382 Golden et al. Jun 1995 A
5426683 O'Farrell, Jr. et al. Jun 1995 A
5426687 Goodall et al. Jun 1995 A
5427097 Depp Jun 1995 A
5429132 Guy et al. Jul 1995 A
5433198 Desai Jul 1995 A
5435573 Oakford Jul 1995 A
RE35025 Anderton Aug 1995 E
5437277 Dumoulin et al. Aug 1995 A
5443066 Dumoulin et al. Aug 1995 A
5443489 Ben-Haim Aug 1995 A
5444756 Pai et al. Aug 1995 A
5445144 Wodicka et al. Aug 1995 A
5445150 Dumoulin et al. Aug 1995 A
5445166 Taylor Aug 1995 A
5446548 Gerig et al. Aug 1995 A
5447154 Cinquin et al. Sep 1995 A
5447156 Dumoulin et al. Sep 1995 A
5448610 Yamamoto et al. Sep 1995 A
5453686 Anderson Sep 1995 A
5456254 Pietroski et al. Oct 1995 A
5456664 Heinzelman et al. Oct 1995 A
5456689 Kresch et al. Oct 1995 A
5456718 Szymaitis Oct 1995 A
5457641 Zimmer et al. Oct 1995 A
5458718 Venkitachalam Oct 1995 A
5464446 Dreessen et al. Nov 1995 A
5469847 Zinreich et al. Nov 1995 A
5472441 Edwards et al. Dec 1995 A
5476100 Galel Dec 1995 A
5476495 Kordis et al. Dec 1995 A
5478341 Cook et al. Dec 1995 A
5478343 Ritter Dec 1995 A
5480422 Ben-Haim Jan 1996 A
5480439 Bisek et al. Jan 1996 A
5483961 Kelly et al. Jan 1996 A
5485849 Panescu et al. Jan 1996 A
5487391 Panescu Jan 1996 A
5487729 Avellanet et al. Jan 1996 A
5487757 Truckai et al. Jan 1996 A
5489256 Adair Feb 1996 A
5490196 Rudich et al. Feb 1996 A
5492131 Galel Feb 1996 A
5492713 Sommermeyer Feb 1996 A
5493517 Frazier Feb 1996 A
5494034 Schlondorff et al. Feb 1996 A
5503416 Aoki et al. Apr 1996 A
5513637 Twiss et al. May 1996 A
5514146 Lam et al. May 1996 A
5515160 Schulz et al. May 1996 A
5515853 Smith et al. May 1996 A
5517990 Kalfas et al. May 1996 A
5520059 Garshelis May 1996 A
5522814 Bemaz Jun 1996 A
5522815 Durgin, Jr. et al. Jun 1996 A
5531227 Schneider Jul 1996 A
5531520 Grimson et al. Jul 1996 A
5531686 Lundquist et al. Jul 1996 A
5542938 Avellanet et al. Aug 1996 A
5543951 Moehrmann Aug 1996 A
5545200 West et al. Aug 1996 A
5546940 Panescu et al. Aug 1996 A
5546949 Frazin et al. Aug 1996 A
5546951 Ben-Haim Aug 1996 A
5551429 Fitzpatrick et al. Sep 1996 A
5555883 Avitall Sep 1996 A
5558091 Acker et al. Sep 1996 A
5566681 Manwaring et al. Oct 1996 A
5568384 Robb et al. Oct 1996 A
5568809 Ben-haim Oct 1996 A
5571083 Lemelson Nov 1996 A
5572999 Funda et al. Nov 1996 A
5573533 Strul Nov 1996 A
5575794 Walus et al. Nov 1996 A
5575798 Koutrouvelis Nov 1996 A
5577991 Akui et al. Nov 1996 A
5583909 Hanover Dec 1996 A
5588033 Yeung Dec 1996 A
5588430 Bova et al. Dec 1996 A
5590215 Allen Dec 1996 A
5592939 Martinelli Jan 1997 A
5595193 Walus et al. Jan 1997 A
5596228 Anderton et al. Jan 1997 A
5599305 Hermann et al. Feb 1997 A
5600330 Blood Feb 1997 A
5603318 Heilbrun et al. Feb 1997 A
5606975 Liang et al. Mar 1997 A
5611025 Lorensen et al. Mar 1997 A
5617462 Spratt Apr 1997 A
5617857 Chader et al. Apr 1997 A
5619261 Anderton Apr 1997 A
5620734 Wesdorp et al. Apr 1997 A
5622169 Golden et al. Apr 1997 A
5622170 Schulz Apr 1997 A
5627873 Hanover et al. May 1997 A
5628315 Vilsmeier et al. May 1997 A
5630431 Taylor May 1997 A
5636634 Kordis et al. Jun 1997 A
5636644 Hart et al. Jun 1997 A
5638819 Manwaring et al. Jun 1997 A
5640170 Anderson Jun 1997 A
5642395 Anderton et al. Jun 1997 A
5643175 Adair Jul 1997 A
5643268 Vilsmeier et al. Jul 1997 A
5645065 Shapiro et al. Jul 1997 A
5646524 Gilboa Jul 1997 A
5646525 Gilboa Jul 1997 A
5647361 Damadian Jul 1997 A
5651047 Moorman et al. Jul 1997 A
5660865 Pedersen et al. Aug 1997 A
5662108 Budd et al. Sep 1997 A
5662111 Cosman Sep 1997 A
5664001 Tachibana et al. Sep 1997 A
5674296 Bryan et al. Oct 1997 A
5676673 Ferre et al. Oct 1997 A
5681260 Ueda et al. Oct 1997 A
5682165 Lewis et al. Oct 1997 A
5682886 Delp et al. Nov 1997 A
5682890 Kormos et al. Nov 1997 A
5690108 Chakeres Nov 1997 A
5694945 Ben-Haim Dec 1997 A
5695500 Taylor et al. Dec 1997 A
5695501 Carol et al. Dec 1997 A
5696500 Diem Dec 1997 A
5697377 Wittkampf Dec 1997 A
5701898 Adam et al. Dec 1997 A
5702406 Vilsmeier et al. Dec 1997 A
5711299 Manwaring et al. Jan 1998 A
5713369 Tao et al. Feb 1998 A
5713853 Clark et al. Feb 1998 A
5713946 Ben-Haim Feb 1998 A
5715822 Watkins et al. Feb 1998 A
5715836 Kliegis et al. Feb 1998 A
5718241 Ben-Haim et al. Feb 1998 A
5727552 Ryan Mar 1998 A
5727553 Saad Mar 1998 A
5729129 Acker Mar 1998 A
5730129 Darrow et al. Mar 1998 A
5730130 Fitzpatrick et al. Mar 1998 A
5732703 Kalfas et al. Mar 1998 A
5735278 Hoult et al. Apr 1998 A
5738096 Ben-Haim Apr 1998 A
5740802 Nafis et al. Apr 1998 A
5740808 Panescu et al. Apr 1998 A
5741214 Ouchi et al. Apr 1998 A
5741320 Thornton et al. Apr 1998 A
5742394 Hansen Apr 1998 A
5744802 Muehllehner et al. Apr 1998 A
5744953 Hansen Apr 1998 A
5748767 Raab May 1998 A
5749362 Funda et al. May 1998 A
5749835 Glantz May 1998 A
5752513 Acker et al. May 1998 A
5752518 McGee et al. May 1998 A
5755725 Druais May 1998 A
RE35816 Schulz Jun 1998 E
5758667 Slettenmark Jun 1998 A
5760335 Gilboa Jun 1998 A
5762064 Polvani Jun 1998 A
5767669 Hansen et al. Jun 1998 A
5767699 Bosnyak et al. Jun 1998 A
5767960 Orman Jun 1998 A
5769789 Wang et al. Jun 1998 A
5769843 Abela et al. Jun 1998 A
5769861 Vilsmeier Jun 1998 A
5772594 Barrick Jun 1998 A
5775322 Silverstein et al. Jul 1998 A
5776050 Chen et al. Jul 1998 A
5776064 Kalfas et al. Jul 1998 A
5782765 Jonkman Jul 1998 A
5782828 Chen et al. Jul 1998 A
5787886 Kelly et al. Aug 1998 A
5792055 McKinnon Aug 1998 A
5795294 Luber et al. Aug 1998 A
5797849 Vesely et al. Aug 1998 A
5799055 Peshkin et al. Aug 1998 A
5799099 Wang et al. Aug 1998 A
5800352 Ferre et al. Sep 1998 A
5800535 Howard, III Sep 1998 A
5802719 O'Farrell, Jr. et al. Sep 1998 A
5803084 Olson Sep 1998 A
5803089 Ferre et al. Sep 1998 A
5807252 Hassfeld et al. Sep 1998 A
5810008 Dekel et al. Sep 1998 A
5810728 Kuhn Sep 1998 A
5810735 Halperin et al. Sep 1998 A
5820553 Hughes Oct 1998 A
5820591 Thompson et al. Oct 1998 A
5823192 Kalend et al. Oct 1998 A
5823958 Truppe Oct 1998 A
5828725 Levinson Oct 1998 A
5828770 Leis et al. Oct 1998 A
5829444 Ferre et al. Nov 1998 A
5831260 Hansen Nov 1998 A
5833608 Acker Nov 1998 A
5834759 Glossop Nov 1998 A
5836954 Heilbrun et al. Nov 1998 A
5837001 Mackey Nov 1998 A
5840024 Taniguchi et al. Nov 1998 A
5840025 Ben-Haim Nov 1998 A
5842984 Avitall Dec 1998 A
5843051 Adams et al. Dec 1998 A
5843076 Webster, Jr. et al. Dec 1998 A
5846183 Chilcoat Dec 1998 A
5848967 Cosman Dec 1998 A
5851183 Bucholz Dec 1998 A
5853327 Gilboa Dec 1998 A
5857997 Cimino et al. Jan 1999 A
5865726 Katsurada et al. Feb 1999 A
5865846 Bryan et al. Feb 1999 A
5868673 Vesely Feb 1999 A
5868674 Glowinski et al. Feb 1999 A
5868675 Henrion et al. Feb 1999 A
5871445 Bucholz Feb 1999 A
5871455 Ueno Feb 1999 A
5871487 Warner et al. Feb 1999 A
5871523 Fleischman et al. Feb 1999 A
5873822 Ferre et al. Feb 1999 A
5882304 Ehnholm et al. Mar 1999 A
5884410 Prinz Mar 1999 A
5889834 Vilsmeier et al. Mar 1999 A
5891034 Bucholz Apr 1999 A
5891134 Goble et al. Apr 1999 A
5891157 Day et al. Apr 1999 A
5893885 Webster, Jr. Apr 1999 A
5899860 Pfeiffer et al. May 1999 A
5902239 Buurman May 1999 A
5902324 Thompson et al. May 1999 A
5904691 Barnett et al. May 1999 A
5907395 Schulz et al. May 1999 A
5909476 Cheng et al. Jun 1999 A
5913820 Bladen et al. Jun 1999 A
5916210 Winston Jun 1999 A
5919147 Jain Jul 1999 A
5919188 Shearon et al. Jul 1999 A
5920395 Schulz Jul 1999 A
5921992 Costales et al. Jul 1999 A
5923727 Navab Jul 1999 A
5928248 Acker Jul 1999 A
5930329 Navab Jul 1999 A
5935160 Auricchio et al. Aug 1999 A
5938585 Donofrio Aug 1999 A
5938602 Lloyd Aug 1999 A
5938603 Ponzi Aug 1999 A
5938694 Jaraczewski et al. Aug 1999 A
5941251 Panescu et al. Aug 1999 A
5944023 Johnson et al. Aug 1999 A
5947925 Ashiya et al. Sep 1999 A
5947980 Jensen et al. Sep 1999 A
5947981 Cosman Sep 1999 A
5950629 Taylor et al. Sep 1999 A
5951461 Nyo et al. Sep 1999 A
5951475 Gueziec et al. Sep 1999 A
5951571 Audette Sep 1999 A
5954647 Bova et al. Sep 1999 A
5954649 Chia et al. Sep 1999 A
5954796 McCarty et al. Sep 1999 A
5957844 Dekel et al. Sep 1999 A
5966090 McEwan Oct 1999 A
5967980 Ferre et al. Oct 1999 A
5967982 Barnett Oct 1999 A
5968047 Reed Oct 1999 A
5971997 Guthrie et al. Oct 1999 A
5976127 Lax Nov 1999 A
5976156 Taylor et al. Nov 1999 A
5980504 Sharkey et al. Nov 1999 A
5980535 Barnett et al. Nov 1999 A
5983126 Wittkampf Nov 1999 A
5987349 Schulz Nov 1999 A
5987960 Messner et al. Nov 1999 A
5999837 Messner et al. Dec 1999 A
5999840 Grimson et al. Dec 1999 A
6001130 Bryan et al. Dec 1999 A
6004269 Crowley et al. Dec 1999 A
6006126 Cosman Dec 1999 A
6006127 Van Der Brug et al. Dec 1999 A
6013087 Adams et al. Jan 2000 A
6014580 Blume et al. Jan 2000 A
6016439 Acker Jan 2000 A
6019724 Gronningsaeter et al. Feb 2000 A
6019725 Vesely et al. Feb 2000 A
6019728 Iwata et al. Feb 2000 A
6022578 Miller Feb 2000 A
6024695 Taylor et al. Feb 2000 A
6024739 Ponzi et al. Feb 2000 A
6032675 Rubinsky Mar 2000 A
6035229 Silverstein et al. Mar 2000 A
6050724 Schmitz et al. Apr 2000 A
6059718 Taniguchi et al. May 2000 A
6061588 Thornton et al. May 2000 A
6063022 Ben-Haim May 2000 A
6064390 Sagar et al. May 2000 A
6071288 Carol et al. Jun 2000 A
6073043 Schneider Jun 2000 A
6076008 Bucholz Jun 2000 A
6077257 Edwards et al. Jun 2000 A
6096036 Bowe et al. Aug 2000 A
6096050 Audette Aug 2000 A
6104294 Andersson et al. Aug 2000 A
6104944 Martinelli Aug 2000 A
6106517 Zupkas Aug 2000 A
6112111 Glantz Aug 2000 A
6115626 Whayne et al. Sep 2000 A
6117476 Eger et al. Sep 2000 A
6118845 Simon et al. Sep 2000 A
6122538 Sliwa, Jr. et al. Sep 2000 A
6122541 Cosman et al. Sep 2000 A
6123979 Hepburn et al. Sep 2000 A
6131396 Duerr et al. Oct 2000 A
6139183 Graumann Oct 2000 A
6147480 Osadchy et al. Nov 2000 A
6149592 Yanof et al. Nov 2000 A
6156067 Bryan et al. Dec 2000 A
6161032 Acker Dec 2000 A
6165181 Heilbrun et al. Dec 2000 A
6167296 Shahidi Dec 2000 A
6171303 Ben-Haim et al. Jan 2001 B1
6172499 Ashe Jan 2001 B1
6175756 Ferre et al. Jan 2001 B1
6178345 Vilsmeier et al. Jan 2001 B1
6179809 Khairkhahan et al. Jan 2001 B1
6183444 Glines et al. Feb 2001 B1
6188355 Gilboa Feb 2001 B1
6192280 Sommer et al. Feb 2001 B1
6194639 Botella et al. Feb 2001 B1
6201387 Govari Mar 2001 B1
6203493 Ben-Haim Mar 2001 B1
6203497 Dekel et al. Mar 2001 B1
6208884 Kumar et al. Mar 2001 B1
6210362 Ponzi Apr 2001 B1
6211666 Acker Apr 2001 B1
6213995 Steen et al. Apr 2001 B1
6213998 Shen et al. Apr 2001 B1
6216027 Willis et al. Apr 2001 B1
6216029 Paltieli Apr 2001 B1
6223067 Vilsmeier et al. Apr 2001 B1
6226543 Gilboa et al. May 2001 B1
6233476 Strommer et al. May 2001 B1
6236875 Bucholz et al. May 2001 B1
6245020 Moore et al. Jun 2001 B1
6246231 Ashe Jun 2001 B1
6246784 Summers et al. Jun 2001 B1
6246898 Vesely et al. Jun 2001 B1
6246899 Chia et al. Jun 2001 B1
6248074 Ohno et al. Jun 2001 B1
6253770 Acker et al. Jul 2001 B1
6259942 Westermann et al. Jul 2001 B1
6264654 Swartz et al. Jul 2001 B1
6272371 Shlomo Aug 2001 B1
6273896 Franck et al. Aug 2001 B1
6285902 Kienzle, III et al. Sep 2001 B1
6298262 Franck et al. Oct 2001 B1
6304769 Arenson et al. Oct 2001 B1
6306097 Park et al. Oct 2001 B1
6314310 Ben-Haim et al. Nov 2001 B1
6319250 Falwell et al. Nov 2001 B1
6331116 Kaufman et al. Dec 2001 B1
6331156 Haefele et al. Dec 2001 B1
6332089 Acker et al. Dec 2001 B1
6335617 Osadchy et al. Jan 2002 B1
6341231 Ferre et al. Jan 2002 B1
6345112 Summers et al. Feb 2002 B1
6346940 Fukunaga Feb 2002 B1
6351513 Bani-Hashemi et al. Feb 2002 B1
6351659 Vilsmeier Feb 2002 B1
6366799 Acker et al. Apr 2002 B1
6373240 Govari Apr 2002 B1
6380732 Gilboa Apr 2002 B1
6381485 Hunter et al. Apr 2002 B1
6383144 Mooney et al. May 2002 B1
6405072 Cosman Jun 2002 B1
6423009 Downey et al. Jul 2002 B1
6424856 Vilsmeier et al. Jul 2002 B1
6427314 Acker Aug 2002 B1
6428547 Vilsmeier et al. Aug 2002 B1
6434415 Foley et al. Aug 2002 B1
6437567 Schenck et al. Aug 2002 B1
6443894 Sumanaweera et al. Sep 2002 B1
6445943 Ferre et al. Sep 2002 B1
6447504 Ben-Haim et al. Sep 2002 B1
6453190 Acker et al. Sep 2002 B1
6468265 Evans et al. Oct 2002 B1
6470207 Simon et al. Oct 2002 B1
6473635 Rasche Oct 2002 B1
6474341 Hunter et al. Nov 2002 B1
6478802 Kienzle, III et al. Nov 2002 B2
6484049 Seeley et al. Nov 2002 B1
6484118 Govari Nov 2002 B1
6490475 Seeley et al. Dec 2002 B1
6493573 Martinelli et al. Dec 2002 B1
6498477 Govari et al. Dec 2002 B1
6498944 Ben-Haim et al. Dec 2002 B1
6499488 Hunter et al. Dec 2002 B1
6516046 Frohlich et al. Feb 2003 B1
6517534 McGovern et al. Feb 2003 B1
6527443 Vilsmeier et al. Mar 2003 B1
6551325 Neubauer et al. Apr 2003 B2
6558333 Gilboa et al. May 2003 B2
6574492 Ben-Haim et al. Jun 2003 B1
6574498 Gilboa Jun 2003 B1
6580938 Acker Jun 2003 B1
6584174 Schubert et al. Jun 2003 B2
6585763 Keilman et al. Jul 2003 B1
6591129 Ben-Haim et al. Jul 2003 B1
6593884 Gilboa et al. Jul 2003 B1
6609022 Vilsmeier et al. Aug 2003 B2
6611700 Vilsmeier et al. Aug 2003 B1
6615155 Gilboa Sep 2003 B2
6618612 Acker et al. Sep 2003 B1
6628980 Atalar et al. Sep 2003 B2
6640128 Vilsmeier et al. Oct 2003 B2
6650927 Keidar Nov 2003 B1
6666864 Bencini et al. Dec 2003 B2
6676659 Hutchins et al. Jan 2004 B2
6690816 Aylward et al. Feb 2004 B2
6690963 Ben-Haim et al. Feb 2004 B2
6694162 Hartlep Feb 2004 B2
6701179 Martinelli et al. Mar 2004 B1
6702780 Gilboa et al. Mar 2004 B1
6706041 Costantino Mar 2004 B1
6711429 Gilboa et al. Mar 2004 B1
6735465 Panescu May 2004 B2
6751492 Ben-Haim Jun 2004 B2
6770070 Balbierz Aug 2004 B1
6788967 Ben-Haim et al. Sep 2004 B2
6796963 Carpenter et al. Sep 2004 B2
6810281 Brock et al. Oct 2004 B2
6833814 Gilboa et al. Dec 2004 B2
6887236 Gilboa May 2005 B2
6947788 Gilboa et al. Sep 2005 B2
6976013 Mah Dec 2005 B1
6995729 Govari et al. Feb 2006 B2
6996430 Gilboa et al. Feb 2006 B1
7015859 Anderson Mar 2006 B2
7033325 Sullivan Apr 2006 B1
7158754 Anderson Jan 2007 B2
7176936 Sauer et al. Feb 2007 B2
7197354 Sobe Mar 2007 B2
7233820 Gilboa Jun 2007 B2
7236567 Sandkamp et al. Jun 2007 B2
7286868 Govari Oct 2007 B2
7301332 Govari et al. Nov 2007 B2
7321228 Govari Jan 2008 B2
7324915 Altmann et al. Jan 2008 B2
7343195 Strommer et al. Mar 2008 B2
7353125 Nieminen et al. Apr 2008 B2
7357795 Kaji et al. Apr 2008 B2
7366562 Dukesherer et al. Apr 2008 B2
7370656 Gleich et al. May 2008 B2
7373271 Schneider May 2008 B1
7386339 Strommer et al. Jun 2008 B2
7397364 Govari Jul 2008 B2
7399296 Poole et al. Jul 2008 B2
7420468 Fabian et al. Sep 2008 B2
7497029 Plassky et al. Mar 2009 B2
7505809 Strommer et al. Mar 2009 B2
7517318 Altmann et al. Apr 2009 B2
7536218 Govari et al. May 2009 B2
7555330 Gilboa et al. Jun 2009 B2
RE40852 Martinelli et al. Jul 2009 E
7570987 Raabe et al. Aug 2009 B2
7577474 Vilsmeier Aug 2009 B2
7579837 Fath et al. Aug 2009 B2
7587235 Wist et al. Sep 2009 B2
7599535 Kiraly et al. Oct 2009 B2
7599810 Yamazaki Oct 2009 B2
7630753 Simon et al. Dec 2009 B2
7634122 Bertram et al. Dec 2009 B2
7636595 Marquart et al. Dec 2009 B2
7641609 Ohnishi et al. Jan 2010 B2
7648458 Niwa et al. Jan 2010 B2
7652468 Kruger et al. Jan 2010 B2
7652578 Braun et al. Jan 2010 B2
7657300 Hunter et al. Feb 2010 B2
7659912 Akimoto et al. Feb 2010 B2
7660623 Hunter et al. Feb 2010 B2
7680528 Pfister et al. Mar 2010 B2
7684849 Wright et al. Mar 2010 B2
7686767 Maschke Mar 2010 B2
7688064 Shalgi et al. Mar 2010 B2
7696899 Immerz et al. Apr 2010 B2
7697972 Verard et al. Apr 2010 B2
7697973 Strommer et al. Apr 2010 B2
7697974 Jenkins et al. Apr 2010 B2
7720517 Drysen May 2010 B2
7722565 Wood et al. May 2010 B2
7725154 Beck et al. May 2010 B2
7725164 Suurmond et al. May 2010 B2
7727269 Abraham-Fuchs et al. Jun 2010 B2
7729742 Govari Jun 2010 B2
7744605 Vilsmeier et al. Jun 2010 B2
7747307 Wright et al. Jun 2010 B2
7751865 Jascob et al. Jul 2010 B2
7782046 Anderson Aug 2010 B2
7782189 Spoonhower et al. Aug 2010 B2
7784468 Fabian et al. Aug 2010 B2
7831076 Altmann et al. Nov 2010 B2
7905827 Uchiyama et al. Mar 2011 B2
7912662 Zuhars et al. Mar 2011 B2
7969143 Gilboa Jun 2011 B2
8692707 Lee et al. Apr 2014 B2
9575140 Zur Feb 2017 B2
20010007918 Vilsmeier et al. Jul 2001 A1
20010031919 Strommer et al. Oct 2001 A1
20010034530 Malackowski et al. Oct 2001 A1
20010036245 Kienzle et al. Nov 2001 A1
20010038705 Rubbert et al. Nov 2001 A1
20020022837 Mazzocchi et al. Feb 2002 A1
20020045916 Gray et al. Apr 2002 A1
20020045919 Johansson-Ruden et al. Apr 2002 A1
20020065461 Cosman May 2002 A1
20020082498 Wendt et al. Jun 2002 A1
20020095081 Vilsmeier Jul 2002 A1
20020128565 Rudy Sep 2002 A1
20020137014 Anderson et al. Sep 2002 A1
20020143324 Edwards Oct 2002 A1
20020165448 Ben-Haim et al. Nov 2002 A1
20020173689 Kaplan Nov 2002 A1
20020193686 Gilboa Dec 2002 A1
20030018251 Solomon Jan 2003 A1
20030074011 Gilboa et al. Apr 2003 A1
20030086599 Armato et al. May 2003 A1
20030099390 Zeng et al. May 2003 A1
20030142753 Gunday Jul 2003 A1
20030144658 Schwartz et al. Jul 2003 A1
20030160721 Gilboa et al. Aug 2003 A1
20030216639 Gilboa et al. Nov 2003 A1
20040006268 Gilboa et al. Jan 2004 A1
20040015049 Zaar Jan 2004 A1
20040019350 O'Brien et al. Jan 2004 A1
20040024309 Ferre et al. Feb 2004 A1
20040086161 Sivaramakrishna et al. May 2004 A1
20040097804 Sobe May 2004 A1
20040122310 Lim Jun 2004 A1
20040138548 Strommer et al. Jul 2004 A1
20040143317 Stinson et al. Jul 2004 A1
20040169509 Czipott et al. Sep 2004 A1
20040215181 Christopherson et al. Oct 2004 A1
20040249267 Gilboa Dec 2004 A1
20040254454 Kockro Dec 2004 A1
20050018885 Chen et al. Jan 2005 A1
20050027193 Mitschke et al. Feb 2005 A1
20050033149 Strommer et al. Feb 2005 A1
20050059890 Deal et al. Mar 2005 A1
20050085715 Dukesherer et al. Apr 2005 A1
20050085720 Jascob et al. Apr 2005 A1
20050090818 Pike et al. Apr 2005 A1
20050107687 Anderson May 2005 A1
20050107688 Strommer May 2005 A1
20050119527 Banik et al. Jun 2005 A1
20050182295 Soper et al. Aug 2005 A1
20050197566 Strommer et al. Sep 2005 A1
20050222793 Lloyd et al. Oct 2005 A1
20050272971 Ohnishi et al. Dec 2005 A1
20060015126 Sher Jan 2006 A1
20060025677 Verard et al. Feb 2006 A1
20060036151 Ferre et al. Feb 2006 A1
20060058647 Strommer et al. Mar 2006 A1
20060064006 Strommer et al. Mar 2006 A1
20060079759 Vaillant et al. Apr 2006 A1
20060084867 Tremblay et al. Apr 2006 A1
20060116575 Willis Jun 2006 A1
20060149134 Soper et al. Jul 2006 A1
20060181271 Lescourret Aug 2006 A1
20060208725 Tapson Sep 2006 A1
20060241396 Fabian et al. Oct 2006 A1
20060241399 Fabian Oct 2006 A1
20060262029 Anderson Nov 2006 A1
20070163597 Mikkaichi et al. Jul 2007 A1
20070167714 Kiraly et al. Jul 2007 A1
20070167738 Timinger et al. Jul 2007 A1
20070167743 Honda et al. Jul 2007 A1
20070167804 Park et al. Jul 2007 A1
20070167806 Wood et al. Jul 2007 A1
20070225553 Shahidi Sep 2007 A1
20070232898 Huynh et al. Oct 2007 A1
20070265639 Danek et al. Nov 2007 A1
20070287901 Strommer et al. Dec 2007 A1
20080008368 Matsumoto Jan 2008 A1
20080018468 Volpi et al. Jan 2008 A1
20080033452 Vetter et al. Feb 2008 A1
20080086051 Voegele Apr 2008 A1
20080097154 Makower et al. Apr 2008 A1
20080097187 Gielen et al. Apr 2008 A1
20080118135 Averbuch et al. May 2008 A1
20080132909 Jascob et al. Jun 2008 A1
20080132911 Sobe Jun 2008 A1
20080139886 Tatsuyama Jun 2008 A1
20080139915 Dolan et al. Jun 2008 A1
20080144909 Wiemker et al. Jun 2008 A1
20080147000 Seibel et al. Jun 2008 A1
20080154172 Mauch Jun 2008 A1
20080157755 Kruger et al. Jul 2008 A1
20080161682 Kendrick et al. Jul 2008 A1
20080162074 Schneider Jul 2008 A1
20080183071 Strommer et al. Jul 2008 A1
20080188749 Rasche et al. Aug 2008 A1
20080247622 Aylward et al. Oct 2008 A1
20080284554 Schroeder et al. Nov 2008 A1
20090027258 Stayton Jan 2009 A1
20090082665 Anderson Mar 2009 A1
20090182224 Shmarak et al. Jul 2009 A1
20090189820 Saito et al. Jul 2009 A1
20090318797 Hadani Dec 2009 A1
20100301841 Anderson Dec 2010 A1
20110085720 Barak et al. Apr 2011 A1
20120007787 Schantz et al. Jan 2012 A1
20130140369 Dokai Jun 2013 A1
20140148692 Hartmann et al. May 2014 A1
20140375524 Nago Dec 2014 A1
20150035697 Cho Feb 2015 A1
20150130291 Lim May 2015 A1
20160028159 Moon Jan 2016 A1
Foreign Referenced Citations (112)
Number Date Country
964149 Mar 1975 CA
3508730 Sep 1986 DE
3520782 Dec 1986 DE
3717871 Dec 1988 DE
3838011 Jul 1989 DE
4213426 Oct 1992 DE
4225112 Dec 1993 DE
4233978 Apr 1994 DE
19715202 Oct 1998 DE
19751761 Oct 1998 DE
19832296 Feb 1999 DE
19747427 May 1999 DE
10085137 Nov 2002 DE
0062941 Oct 1982 EP
0119660 Sep 1984 EP
0155857 Sep 1985 EP
0319844 Jun 1989 EP
0326768 Aug 1989 EP
0350996 Jan 1990 EP
0427358 May 1991 EP
0456103 Nov 1991 EP
0581704 Feb 1994 EP
0600610 Jun 1994 EP
0655138 May 1995 EP
0796633 Sep 1997 EP
0 829 229 Mar 1998 EP
0894473 Feb 1999 EP
0908146 Apr 1999 EP
0 922 966 Jun 1999 EP
0930046 Jul 1999 EP
1078644 Feb 2001 EP
2096523 Sep 2009 EP
2618211 Jan 1989 FR
2094590 Sep 1982 GB
2164856 Apr 1986 GB
2197078 May 1988 GB
03-267054 Nov 1991 JP
06194639 Jul 1994 JP
3025752 Mar 2000 JP
8809151 Dec 1988 WO
8905123 Jun 1989 WO
9005494 May 1990 WO
9103982 Apr 1991 WO
9104711 Apr 1991 WO
9107726 May 1991 WO
9203090 Mar 1992 WO
9206645 Apr 1992 WO
9404938 Mar 1994 WO
9423647 Oct 1994 WO
9424933 Nov 1994 WO
9507055 Mar 1995 WO
9509562 Apr 1995 WO
9605768 Feb 1996 WO
9611624 Apr 1996 WO
9632059 Oct 1996 WO
9641119 Dec 1996 WO
9700011 Jan 1997 WO
9700054 Jan 1997 WO
9700058 Jan 1997 WO
9700059 Jan 1997 WO
9700308 Jan 1997 WO
9702650 Jan 1997 WO
9725101 Jul 1997 WO
9729682 Aug 1997 WO
9729684 Aug 1997 WO
9729685 Aug 1997 WO
9729701 Aug 1997 WO
9729709 Aug 1997 WO
9736143 Oct 1997 WO
9736192 Oct 1997 WO
9742517 Nov 1997 WO
9744089 Nov 1997 WO
9749453 Dec 1997 WO
9800034 Jan 1998 WO
9808554 Mar 1998 WO
9811840 Mar 1998 WO
9829032 Jul 1998 WO
9835720 Aug 1998 WO
9838908 Sep 1998 WO
9848722 Nov 1998 WO
9915097 Apr 1999 WO
9916350 Apr 1999 WO
9921498 May 1999 WO
9923956 May 1999 WO
9926549 Jun 1999 WO
9926826 Jun 1999 WO
9927839 Jun 1999 WO
9929253 Jun 1999 WO
9930777 Jun 1999 WO
9932033 Jul 1999 WO
9933406 Jul 1999 WO
9937208 Jul 1999 WO
9938449 Aug 1999 WO
9952094 Oct 1999 WO
9955415 Nov 1999 WO
9960939 Dec 1999 WO
0006701 Feb 2000 WO
0016684 Mar 2000 WO
0010456 Mar 2000 WO
0035531 Jun 2000 WO
0106917 Feb 2001 WO
0112057 Feb 2001 WO
0130437 May 2001 WO
0167035 Sep 2001 WO
0187136 Nov 2001 WO
0191842 Dec 2001 WO
0264011 Aug 2002 WO
0270047 Sep 2002 WO
0386498 Oct 2003 WO
2004023986 Mar 2004 WO
2006116597 Nov 2006 WO
2015164171 Oct 2015 WO
Non-Patent Literature Citations (1)
Entry
International Search Report and Written Opinion dated Feb. 19, 2018 and issued in corresponding International Application No. PCT/US2017/058406.
Related Publications (1)
Number Date Country
20180123248 A1 May 2018 US