Abstract:
PROBLEM TO BE SOLVED: To provide a method for calculating intermediate-range and long-range image contributions from mask polygons. SOLUTION: An algorithm is introduced having application to optical proximity correction in optical lithography. A finite integral for each sector of a polygon replaces an infinite integral. A finite integral is achieved by integrating over two triangles instead of integrating on full sectors. An analytical approach is presented for a power law kernel to reduce the numerical integration of a sector to an analytical expression evaluation. The mask polygon is divided into a plurality of regions to calculate effects of interaction such as intermediate-range and long-range effects, by truncating the mask instead of truncating the kernel function. COPYRIGHT: (C)2005,JPO&NCIPI
Abstract:
PROBLEM TO BE SOLVED: To provide a useful method of migrating an analog or mixed signal electronic circuit from a source technology to a target technology. SOLUTION: Devices operating in current mode and their respective voltage tuning nodes are first identified in the source technology electronic circuit. Since a device operating in current mode is less sensitive to the voltage applied to its voltage tuning node, the voltage at the voltage tuning node can be changed to achieve better current mode device performance without interfering with the biasing conditions of other devices in the circuit. This enables a circuit designer to fully exploit the two available degrees of freedom (typically width and length) when migrating the electronic device operating in current mode from a source technology to a target technology. COPYRIGHT: (C)2010,JPO&INPIT
Abstract:
PROBLEM TO BE SOLVED: To provide a method and a program storage device in which model base optical proximity collection is performed, by providing a region of interest (ROI) having interaction distance and tracing at least one polygon in the ROI. SOLUTION: A cut line or a plurality of cut lines of sample points showing a set of apexes are formed within the ROI so as to be traversed at least one side edge of polygon. By determining an angular position, and a first part and a second part of the cut line in opposing side surfaces which intersect between the cut line and the side edge of the polygon, and then, based on the angular position and the first part and the second part of the cut line extending the original ROI over the interaction distance, new ROI is formed. By this form, various new ROI is formed in various different directions. Finally, optical proximity can be corrected. COPYRIGHT: (C)2005,JPO&NCIPI
Abstract:
PROBLEM TO BE SOLVED: To provide a method for performing model-based photolithography correction by partitioning a cell array layout having a plurality of polygons into a plurality of cells covering the layout, and to provide a program storage device. SOLUTION: The layout is representative of a desired design data hierarchy. A density map is generated corresponding to interactions between the polygons and the plurality of cells, and then the densities within each cell are convolved. An interaction map is formed by using the convolved densities, followed by truncating the interaction map to form a map of truncated cells. Substantially identical groupings of the truncated cells are segregated respectively into differing ones of a plurality of buckets. Each bucket contains a single set of identical groupings of truncated cells. A hierarchal arrangement is generated using the buckets, and the desired design data hierarchy is performed by using the hierarchal arrangement to ultimately correct for photolithography. COPYRIGHT: (C)2005,JPO&NCIPI
Abstract:
PROBLEM TO BE SOLVED: To provide a method for carrying out model-based optical proximity correction by disposing a mask matrix having a region of interest (ROI) and locating a plurality of points of interest within the mask matrix, and to provide a program storage device for executing the above method. SOLUTION: A first polygon 200 having a plurality of vertices representative of the located points of interest is computed, followed by determining a spatial relationship between the vertices and the ROI 100. The vertices of the first polygon are pinned to boundaries of and within the ROI to form a second polygon 300 on the ROI. This processing is repeated for all vertices of the first polygon to collapse the second polygon on the ROI. The collapsed second polygon is used to correct for optical proximity. COPYRIGHT: (C)2005,JPO&NCIPI
Abstract:
PROBLEM TO BE SOLVED: To provide a method for computing a phase map within an optical proximity correction simulation kernel. SOLUTION: A first method utilizes simulated wavefront information from randomly generated data. A second method uses measured data from optical tools. A phase map is created by analytically embedding a randomly generated two-dimensional array comprising complex numbers of wavefront information, and performing an inverse Fourier transform on the resultant array. A filtering function requires the amplitude of each element of the array to be multiplied by a Gaussian function. A power law is then applied to the array. The elements of the array are shuffled, and converted from a phasor form to a real/imaginary form. A two-dimensional fast Fourier transform is applied. The array is then unshuffled and converted back to the phasor form. COPYRIGHT: (C)2005,JPO&NCIPI
Abstract:
An adaptive noise cancellation device comprises: convolution logic 10 for convolving the signal from a reference input x with a discretised L-tap filter to form a filtered reference signal; and logic 20 for subtracting the filtered reference signal from a signal input to form an output signal; logic for generating the filter taps as a linear combination of N basis functions each having a corresponding coefficient Ck; and logic for repeatedly determining the coefficients Ck which minimise the power in the output signal z, characterised in that N is less than the number of filter taps L and the basis functions have a portion of finite width, outside of which portion the functions are substantially zero, both in the frequency and time domains, in an embodiment they are gaussians. A full-duplex speakerphone is disclosed including such a noise cancellation device.
Abstract:
A system and methods for processing a stream of video image data so as to create a video representation that multiplexes data corresponding to resolution or bitstream scales. This representation is such that the identity of the basic MacroBlock (MB) structure of the MPEG-1 ISO standard is preserved across all resolution and bitstream scales, e.g., by scaling across four levels of resolution. An MB is associated with a series of attributes which contribute to the amount of overhead data incorporated in an MPEG-1 compressed data stream, so that by preserving the MB identity across multiple resolutions and bitstream scales, these scales can share this overhead, thus requiring it to be included only once in the data stream. Preserving the MB identity also simplifies significantly the derivation of motion estimation vector data for all resolution scales other than the highest resolution. Essentially the motion vector data corresponding to any resolution scale can be derived from the highest resolution motion vector data by appropriately scaling it down.
Abstract:
A system and methods for processing a stream of video image data so as to create a video representation that multiplexes data corresponding to resolution or bitstream scales. This representation is such that the identity of the basic MacroBlock (MB) structure of the MPEG-1 ISO standard is preserved across all resolution and bitstream scales, e.g., by scaling across four levels of resolution. An MB is associated with a series of attributes which contribute to the amount of overhead data incorporated in an MPEG-1 compressed data stream, so that by preserving the MB identity across multiple resolutions and bitstream scales, these scales can share this overhead, thus requiring it to be included only once in the data stream. Preserving the MB identity also simplifies significantly the derivation of motion estimation vector data for all resolution scales other than the highest resolution. Essentially the motion vector data corresponding to any resolution scale can be derived from the highest resolution motion vector data by appropriately scaling it down.
Abstract:
A system and methods for processing a stream of video image data so as to create a video representation that multiplexes data corresponding to resolution or bitstream scales. This representation is such that the identity of the basic MacroBlock (MB) structure of the MPEG-1 ISO standard is preserved across all resolution and bitstream scales, e.g., by scaling across four levels of resolution. An MB is associated with a series of attributes which contribute to the amount of overhead data incorporated in an MPEG-1 compressed data stream, so that by preserving the MB identity across multiple resolutions and bitstream scales, these scales can share this overhead, thus requiring it to be included only once in the data stream. Preserving the MB identity also simplifies significantly the derivation of motion estimation vector data for all resolution scales other than the highest resolution. Essentially the motion vector data corresponding to any resolution scale can be derived from the highest resolution motion vector data by appropriately scaling it down.