Multiple Input Multiple Output (MIMO) technique is considered as a cost-effective and promising technique for the next generation wireless system. Orthogonal Space-Time Block Codes (OSTBC) scheme is one of the most important coding schemes for MIMO system. The performance of an MIMO system using OSTBC (MIMO-OSTBC), however, degrades significantly in presence of strong interferences. In this pap...

Dimension reduction is popular for learning predictive models in high-dimensional spaces. It can highlight the relevant part of the feature space and avoid the curse of dimensionality. However, it can also be harmful because any reduction loses information. In this paper, we propose the projection penalty framework to make use of dimension reduction without losing valuable information. Reducing...

Tikhonov regularization for projected solutions of large-scale ill-posed problems is considered. The Golub-Kahan iterative bidiagonalization is used to project the problem onto a subspace and regularization then applied to find a subspace approximation to the full problem. Determination of the regularization parameter for the projected problem by unbiased predictive risk estimation, generalized...

Tikhonov regularization for projected solutions of large-scale ill-posed problems is considered. The Golub-Kahan iterative bidiagonalization is used to project the problem onto a subspace and regularization then applied to find a subspace approximation to the full problem. Determination of the regularization parameter for the projected problem by unbiased predictive risk estimation, generalized...

Several modifications to the Davidson algorithm are systematically explored to establish their performance for an assortment of configuration interaction (CI) computations. The combination of a generalized Davidson method, a periodic two-vector subspace collapse, and a blocked Davidson approach for multiple roots is determined to retain the convergence characteristics of the full subspace metho...

In a celebrated paper, Valiant and Vazirani [29] raised the question of whether the difficulty of NP-complete problems was due to the wide variation of the number of witnesses of their instances. They gave a strong negative answer by showing that distinguishing between instances having zero or one witnesses is as hard as recognizing NP, under randomized reductions. We consider the same question...

How to reduce noise with less speech distortion is a challenging issue for speech enhancement. We propose a novel approach for reducing noise with the cost of less speech distortion. A noise signal can generally be considered to consist of two components, a “white-like” component with a uniform energy distribution and a “color” component with a concentrated energy distribution in some frequency...

Let T be a compact Hausdorff topological space and let M denote an n–dimensional subspace of the space C(T ), the space of real–valued continuous functions on T and let the space be equipped with the uniform norm. Zukhovitskii [7] attributes the Basic Theorem to E.Ya.Remez and gives a proof by duality. He also gives a proof due to Shnirel’man, which uses Helly’s Theorem, now the paper obtains a...

neural networks are applicable in identification systems from input-output data. in this report, we analyze thehammerstein-wiener models and identify them. thehammerstein-wiener systems are the simplest type of block orientednonlinear systems where the linear dynamic block issandwiched in between two static nonlinear blocks, whichappear in many engineering applications; the aim of nonlinearsyst...