Abstract: A sound source separation program causes a computer to acquire an acoustic signal, convert the acquired acoustic signal from a time region to a frequency region, and perform sound source separation on the acoustic signal converted to the frequency region by performing updating based on elementary row operation on a demixing matrix to iteratively minimize an objective function including a quadratic form of a separation vector and a determinant of the demixing matrix.

Abstract: An acoustic processing method for M acoustic receivers comprising the steps of: Determining a beamforming weight vector with M weights for the M acoustic receivers based on at least one the steering vector of at least one real acoustic source, on steering vectors of image sources of the at least one real acoustic source and on a first matrix depending on the covariance matrix of the noise and/or on at least one interfering sound source, wherein each of the image sources corresponds to one path of the acoustic signal between one of the at least one real source and one of the M acoustic receivers with at least one reflection; and linearly combining the M acoustic signals received at the M acoustic receivers on the basis of the M weights of the beamforming vector.

Abstract: A computer-implemented method for determining the Walsh-Hadamard transform of N samples of a signal, comprises electing a plurality of hashing C matrices ?1, . . . ?C, computing C hashes of a particular length based at least on a hashing front end and the plurality of matrices ?1, . . . ?C, forming a bipartite graph with a plurality of variable nodes and a plurality of check nodes, the variable nodes being non-zero coefficients to recover, and the check nodes being hashed samples, finding an isolated check node and recovering non-zero coefficients connected to the isolated check node by employing collision detection and support estimation of the signal, peeling from the bipartite graph the recovered non-zero coefficients, and repeating the computing step, forming step, finding step and peeling step until all the nodes in the plurality of check nodes are zero.

Abstract: An acoustic processing method for M acoustic receivers comprising the steps of: Determining a beamforming weight vector with M weights for the M acoustic receivers based on at least one the steering vector of at least one real acoustic source, on steering vectors of image sources of the at least one real acoustic source and on a first matrix depending on the covariance matrix of the noise and/or on at least one interfering sound source, wherein each of the image sources corresponds to one path of the acoustic signal between one of the at least one real source and one of the M acoustic receivers with at least one reflection; and linearly combining the M acoustic signals received at the M acoustic receivers on the basis of the M weights of the beamforming vector

Abstract: A computer-implemented method for determining the Walsh-Hadamard transform of N samples of a signal, comprises electing a plurality of hashing C matrices ?1, . . . ?C, computing C hashes of a particular length based at least on a hashing front end and the plurality of matrices ?1, . . . ?C, forming a bipartite graph with a plurality of variable nodes and a plurality of check nodes, the variable nodes being non-zero coefficients to recover, and the check nodes being hashed samples, finding an isolated check node and recovering non-zero coefficients connected to the isolated check node by employing collision detection and support estimation of the signal, peeling from the bipartite graph the recovered non-zero coefficients, and repeating the computing step, forming step, finding step and peeling step until all the nodes in the plurality of check nodes are zero.

Abstract: A method and system for computing Fourier coefficients for a Fourier representation of a mask transmission function for a lithography mask. The method includes: sampling a polygon of a mask pattern of the lithography mask to obtain an indicator function which defines the polygon, performing a Fourier Transform on the indicator function to obtain preliminary Fourier coefficients, and scaling the Fourier coefficients for the Fourier representation of the mask transmission function, where at least one of the steps is carried out using a computer device.

Abstract: A method and system for computing Fourier coefficients for a Fourier representation of a mask transmission function for a lithography mask. The method includes: sampling a polygon of a mask pattern of the lithography mask to obtain an indicator function which defines the polygon, performing a Fourier Transform on the indicator function to obtain preliminary Fourier coefficients, and scaling the Fourier coefficients for the Fourier representation of the mask transmission function, where at least one of the steps is carried out using a computer device.

Abstract: Printability of a very-large-scale integration design is assessed by: during a training phase, generating a training set of very-large-scale integration design shapes representative of a population of very-large-scale integration design shapes, obtaining a set of mathematical representations of respective shapes in the training set, identifying at least two classes of physical events causally linked to the printability for the very-large-scale integration design shapes, each of the classes being associated to a respective level of printability, labeling each mathematical representation of the set according to one of the identified classes, based on a lithography model, and selecting a probabilistic model function maximizing a probability of a class, given the set of mathematical representations; and during a testing phase, providing a very-large-scale integration design shape to be tested, testing the provided very-large-scale integration design shape, and labeling the provided very-large-scale integration de

Abstract: Printability of a very-large-scale integration design is assessed by: during a training phase, generating a training set of very-large-scale integration design shapes representative of a population of very-large-scale integration design shapes, obtaining a set of mathematical representations of respective shapes in the training set, identifying at least two classes of physical events causally linked to the printability for the very-large-scale integration design shapes, each of the classes being associated to a respective level of printability, labeling each mathematical representation of the set according to one of the identified classes, based on a lithography model, and selecting a probabilistic model function maximizing a probability of a class, given the set of mathematical representations; and during a testing phase, providing a very-large-scale integration design shape to be tested, testing the provided very-large-scale integration design shape, and labeling the provided very-large-scale integration de

Abstract: A method and system for computing Fourier coefficients for a Fourier representation of a mask transmission function for a lithography mask. The method includes: sampling a polygon of a mask pattern of the lithography mask to obtain an indicator function which defines the polygon, performing a Fourier Transform on the indicator function to obtain preliminary Fourier coefficients, and scaling the Fourier coefficients for the Fourier representation of the mask transmission function, where at least one of the steps is carried out using a computer device.