Presentation is loading. Please wait.

Presentation is loading. Please wait.

Efficient solution algorithm of non-equilibrium Green’s functions in atomistic tight binding representation Yu He, Lang Zeng, Tillmann Kubis, Michael Povolotskyi,

Similar presentations


Presentation on theme: "Efficient solution algorithm of non-equilibrium Green’s functions in atomistic tight binding representation Yu He, Lang Zeng, Tillmann Kubis, Michael Povolotskyi,"— Presentation transcript:

1 Efficient solution algorithm of non-equilibrium Green’s functions in atomistic tight binding representation Yu He, Lang Zeng, Tillmann Kubis, Michael Povolotskyi, Gerhard Klimeck Network of Computational Nanotechnology Purdue University, West Lafayette, Indiana May, 2012

2 Why atomistic tight binding? Nature Nanotechnology 7, 242 (2012) Ryu et al., Wednesday, 9.40am Single atom transistor Countable device atoms suggest atomistic descriptions Modern device concepts, e.g. Band to band tunneling Topological insulators (gap less materials) Band/Valley mixing etc. require multi band representations Countable device atoms suggest atomistic descriptions Modern device concepts, e.g. Band to band tunneling Topological insulators (gap less materials) Band/Valley mixing etc. require multi band representations Topological insulators Nature Physics 6, 584 (2010) Sengupta et al., Thursday, 12.40pm Band-to-band tunneling IEEE Elec. Dev. Lett. 30, 602 (2009) Jiang et al., Wednesday, Poster P82

3 Why non-equilibrium Green’s functions? http://newsroom.intel.com/docs/DOC-2035 This requires a consistent description of coherent quantum effects (tunneling, confinement, interferences,…) and incoherent scattering (phonons, impurities, rough interfaces,…) Device dimensions State of the art semiconductor devices  utilize or suffer from quantum effects (tunneling, confinement, interference,…)  are run in real world conditions (finite temperatures, varying device quality…) State of the art semiconductor devices  utilize or suffer from quantum effects (tunneling, confinement, interference,…)  are run in real world conditions (finite temperatures, varying device quality…)

4 Numerical load of atomic NEGF NEGF requires for the solution of four coupled differential equations G R = (E – H 0 – Σ R ) -1 Σ R = G R D R + G R D < + G < D R G < = G R Σ < G A Σ < = G < D < G‘s and Σ‘s are matrices in discretized propagation space (RAM ~N 2, Time ~N 3 ) Atomic device resolutions can yield very large N (e.g. N = 10 7 ) NEGF requires for the solution of four coupled differential equations G R = (E – H 0 – Σ R ) -1 Σ R = G R D R + G R D < + G < D R G < = G R Σ < G A Σ < = G < D < G‘s and Σ‘s are matrices in discretized propagation space (RAM ~N 2, Time ~N 3 ) Atomic device resolutions can yield very large N (e.g. N = 10 7 )

5 Motivation – transport in reality Full TB NEGF: Atomistic tight binding represents electrons by N*N o states (N atoms, N o orbitals) Full TB NEGF: Atomistic tight binding represents electrons by N*N o states (N atoms, N o orbitals) sp3d5s* TB band structure of 3nm (111) GaAs quantum well This work: 1.Find the n relevant states and form a n-dimensional basis 2.Transform the NEGF equations into the n-dimensional basis and solve therein (low rank approximation) This work: 1.Find the n relevant states and form a n-dimensional basis 2.Transform the NEGF equations into the n-dimensional basis and solve therein (low rank approximation) G(z,z’,k || = 2/nm,E=0) Physics: Electrons with given (k ||,E) do not couple with all N*N 0 states A few states should suffice to describe the physics at (k ||,E) Physics: Electrons with given (k ||,E) do not couple with all N*N 0 states A few states should suffice to describe the physics at (k ||,E)

6 Incomplete basis transformation: LRA In NEGF: “Low rank approximation” Given  NEGF equation in an N-dimensional basis, i.e. matrix M NxN  n < N orthonormal functions { Ψ i } in the N-dimensional basis Approximate NEGF equation P is given by: P = T † M T, with T = ( Ψ 1, Ψ 2, … Ψ n ) T is a matrix of N x n P is a matrix of n x n In NEGF: “Low rank approximation” Given  NEGF equation in an N-dimensional basis, i.e. matrix M NxN  n < N orthonormal functions { Ψ i } in the N-dimensional basis Approximate NEGF equation P is given by: P = T † M T, with T = ( Ψ 1, Ψ 2, … Ψ n ) T is a matrix of N x n P is a matrix of n x n Wikipedia.org: “In mathematics, low-rank approximation is a minimization problem, in which the cost function measures the fit between a given matrix (the data) and an approximating matrix (the optimization variable), subject to a constraint that the approximating matrix has reduced rank.” Key: How to find “good” Ψ i ?

7 Method – Find propagating states One method: For electrons at energy E and momentum k … 1.Solve the eigenproblem of nonhermitian Hamiltonian of the open system ( H(k) + Ʃ R (k,E) ) Φ i = ε i Φ i 2.Choose the n states { Φ i } with Re(ε i ) closest to the considered particle energy E 3.Orthonormalize the n states { Φ i } → { Ψ i } 4. LRA: P = T † M T, with T = ( Ψ 1, Ψ 2, … Ψ n ) 5.Solve the approximate NEGF equations P in the reduced basis { Ψ } 6.Transform the results back into the original basis representation G NxN = T Nxn g nxn (T Nxn ) † One method: For electrons at energy E and momentum k … 1.Solve the eigenproblem of nonhermitian Hamiltonian of the open system ( H(k) + Ʃ R (k,E) ) Φ i = ε i Φ i 2.Choose the n states { Φ i } with Re(ε i ) closest to the considered particle energy E 3.Orthonormalize the n states { Φ i } → { Ψ i } 4. LRA: P = T † M T, with T = ( Ψ 1, Ψ 2, … Ψ n ) 5.Solve the approximate NEGF equations P in the reduced basis { Ψ } 6.Transform the results back into the original basis representation G NxN = T Nxn g nxn (T Nxn ) †

8 5nm Result: Benchmark: Density in Si nanowire Original matrix rank was reduced down to 10% No loss in accuracy of the electron density Preliminary implementation shows already a speed up of 8 times (effectively limited by the solution of the basis functions) Original matrix rank was reduced down to 10% No loss in accuracy of the electron density Preliminary implementation shows already a speed up of 8 times (effectively limited by the solution of the basis functions) 5x5nm squared Si nanowire in sp3d5s* empirical tight binding model

9 5nm Benchmark: Transmission in Si nanowire 5x5nm squared Si nanowire in sp3d5s* empirical tight binding model Original matrix rank can be reduced down to 10% Too strong matrix rank reduction results in increasing deviations LRA works for electrons and holes Original matrix rank can be reduced down to 10% Too strong matrix rank reduction results in increasing deviations LRA works for electrons and holes electronsholes

10 L-shape GaSb-InAs tunneling FET  Broken gap bandstructure – mixture electrons/holes  Periodic direction – momentum dependent basis functions  2D transport (nonlinear geometry) L-shape GaSb-InAs tunneling FET  Broken gap bandstructure – mixture electrons/holes  Periodic direction – momentum dependent basis functions  2D transport (nonlinear geometry) Low rank approximation is Applicable to arbitrary geometries and periodicities Applicable to band to band tunneling Low rank approximation is Applicable to arbitrary geometries and periodicities Applicable to band to band tunneling Benchmark: Periodicity & band-to-band tunneling TFET concept (taken from MIND)

11 NEGF with LRA: 12nm diameter Si nanowire in sp3d5s* TB  With 10% of original matrix rank  Calculation done on ~100 CPUs NEGF with LRA: 12nm diameter Si nanowire in sp3d5s* TB  With 10% of original matrix rank  Calculation done on ~100 CPUs With LRA, NEGF is easily applicable to larger device dimensions than ever See also Lang et al., Poster Thursday (LRA + inelastic scattering in eff. mass) With LRA, NEGF is easily applicable to larger device dimensions than ever See also Lang et al., Poster Thursday (LRA + inelastic scattering in eff. mass) LRA in NEGF: Feasibility of large devices Atomistic NEGF without LRA on Supercomputers: Typical maximum Si wire diameter ~ 8 nm (1000s CPUs) Atomistic NEGF without LRA on Supercomputers: Typical maximum Si wire diameter ~ 8 nm (1000s CPUs)

12 Approximate basis functions eig(H+Σ(-1.2eV)) eig(H+Σ(-0.6eV)) eig(H+Σ(1.9eV)) eig(H+Σ(2.5eV)) Transmission in resonant tunneling diode GaAs AlAs Challenge for further speed improvement: Solving a set of basis functions for every energy takes too much time Solution: Reuse basis functions of at (E,k) for different (E’,k’) Challenge for further speed improvement: Solving a set of basis functions for every energy takes too much time Solution: Reuse basis functions of at (E,k) for different (E’,k’) 9% matrix rank exact 9% matrix rank exact Approximate solutions of basis functions are feasible

13 Conclusion & Outlook Ongoing work LRA for NEGF with phonons LRA for NEGF with inelastic scattering in tight binding LRA for multiscaling transport problems Ongoing work LRA for NEGF with phonons LRA for NEGF with inelastic scattering in tight binding LRA for multiscaling transport problems Conclusion Developed systematic efficiency improvement of NEGF in atomistic tight binding for LRA in effective mass + inelastic scattering see Lang et al., Wed., Poster P11 Freely tunable approximation of NEGF Applicable to electrons, holes and mixed particles, arbitrary device geometries,… Enables efficient NEGF solutions in large devices Implemented in free software tool NEMO5 Conclusion Developed systematic efficiency improvement of NEGF in atomistic tight binding for LRA in effective mass + inelastic scattering see Lang et al., Wed., Poster P11 Freely tunable approximation of NEGF Applicable to electrons, holes and mixed particles, arbitrary device geometries,… Enables efficient NEGF solutions in large devices Implemented in free software tool NEMO5 Thank you!

14 S < = D < G < S R = D < G R + D R G R + D R G < NEGF: Secret of success E Electronic states: retarded Green’s function G R Occupancy of states: “lesser than” Green’s function G < Observables: available in many methods, however…


Download ppt "Efficient solution algorithm of non-equilibrium Green’s functions in atomistic tight binding representation Yu He, Lang Zeng, Tillmann Kubis, Michael Povolotskyi,"

Similar presentations


Ads by Google