Study on R super(m) arrow right R super(1) maps: application to a 0.16- mu m via etch process endpoint
We introduce several endpoint algorithms that map real-time, in situ process signals to a via etch process endpoint. Some of the mathematical techniques include: Andrews plots (Fourier series), Chebyshev polynomials, Legendre polynomials, wavelets, singular value decomposition, and neural networks....
Gespeichert in:
Veröffentlicht in: | IEEE transactions on semiconductor manufacturing 2000-11, Vol.13 (4), p.457-468 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | We introduce several endpoint algorithms that map real-time, in situ process signals to a via etch process endpoint. Some of the mathematical techniques include: Andrews plots (Fourier series), Chebyshev polynomials, Legendre polynomials, wavelets, singular value decomposition, and neural networks. We show that many of the techniques work to varying degrees of success for a via etch process on 0.16- mu m technology. Based on our observations from many lots of manufacturing wafers and experiments with all the endpoint methods, we believe the Chebyshev polynomial area-time curves perform the best, but this statement should be taken with a caveat. It is really best to empirically test the various methods for a given etch process to deduce the endpoint algorithm for that application. |
---|---|
ISSN: | 0894-6507 |