Layout Decomposition for Quadruple Patterning Lithography and Beyond

For next-generation technology nodes, multiple patterning lithography (MPL) has emerged as a key solution, e.g., triple patterning lithography (TPL) for 14/11nm, and quadruple patterning lithography (QPL) for sub-10nm. In this paper, we propose a generic and robust layout decomposition framework for QPL, which can be further extended to handle any general K-patterning lithography (K$>$4). Our framework is based on the semidefinite programming (SDP) formulation with novel coloring encoding. Meanwhile, we propose fast yet effective coloring assignment and achieve significant speedup. To our best knowledge, this is the first work on the general multiple patterning lithography layout decomposition.Comment: DAC'201

Capacity of The Discrete-Time Non-Coherent Memoryless Gaussian Channels at Low SNR

We address the capacity of a discrete-time memoryless Gaussian channel, where the channel state information (CSI) is neither available at the transmitter nor at the receiver. The optimal capacity-achieving input distribution at low signal-to-noise ratio (SNR) is precisely characterized, and the exact capacity of a non-coherent channel is derived. The derived relations allow to better understanding the capacity of non-coherent channels at low SNR. Then, we compute the non-coherence penalty and give a more precise characterization of the sub-linear term in SNR. Finally, in order to get more insight on how the optimal input varies with SNR, upper and lower bounds on the non-zero mass point location of the capacity-achieving input are given.Comment: 5 pages and 4 figures. To appear in Proceeding of International Symposium on Information Theory (ISIT 2008

End-to-end Distance from the Green's Function for a Hierarchical Self-Avoiding Walk in Four Dimensions

In [BEI] we introduced a Levy process on a hierarchical lattice which is four dimensional, in the sense that the Green's function for the process equals 1/x^2. If the process is modified so as to be weakly self-repelling, it was shown that at the critical killing rate (mass-squared) \beta^c, the Green's function behaves like the free one. - Now we analyze the end-to-end distance of the model and show that its expected value grows as a constant times \sqrt{T} log^{1/8}T (1+O((log log T)/log T)), which is the same law as has been conjectured for self-avoiding walks on the simple cubic lattice Z^4. The proof uses inverse Laplace transforms to obtain the end-to-end distance from the Green's function, and requires detailed properties of the Green's function throughout a sector of the complex \beta plane. These estimates are derived in a companion paper [math-ph/0205028].Comment: 29 pages, v2: reference