Recursive identification methods using time-domain data have been developed in [l, 21 utilizing a gradient-based identification technique for estimating the Markov parameters of a system. This identification technique utilizes the ARMARKOV representation of a time-invariant finite-dimensional system which relates the current output of a system to past outputs as well as current and past inputs....

Channel estimation in the (2×1) Alamouti space-time block coded systems can be performed blindly from the eigendecomposition (or diagonalization) of matrices composed of the receive antenna output 4th-order cumulants. In order to estimate the channel, we will propose to choose the cumulant matrix with maximum eigenvalue spread of cumulant-matrix. This matrix is determined in closed form. Simula...

A block matrix formulation is presented for the Sinc-Galerkin technique applied to the wind-driven current problem from oceanography. The block matrix form is used to determine an approximate solution for the coupled system of differential equations describing the wind-driven current problem. The approximate solution determined by this new Sinc-Galerkin scheme is compared to the approximate sol...

In this paper we consider numerical solution of 3D linear elasticity equations described by a coupled system of second order elliptic partial differential equations. This system is discretized by trilinear parallelepipedal finite elements. Preconditioned Conjugate Gradient iterative method is used for solving large-scale linear algebraic systems arising after the Finite Element Method (FEM) dis...

In this paper we consider numerical solution of 3D linear elasticity equations described by a coupled system of second order elliptic partial differential equations. This system is discretized by trilinear parallelepipedal finite elements. Preconditioned Conjugate Gradient iterative method is used for solving large-scale linear algebraic systems arising after the Finite Element Method (FEM) dis...

We consider saddle-point problems that typically arise from the mixed finite element discretization of second order elliptic problems. By proper equivalent algebraic operations the considered saddle-point problem is transformed to another saddle-point problem. The resulting problem can then be efficiently preconditioned by a block-diagonal matrix or by a factored block-matrix (the blocks corres...

Abstract. Research on preconditioning Toeplitz matrices with circulant matrices has been active recently. The preconditioning technique can be easily generalized to block Toeplitz matrices. That is, for a block Toeplitz matrix T consisting of N N blocks with M M elements per block, a block circulant matrix R is used with the same block structure as its preconditioner. In this research, the spec...

A matrix embedding code was developed as a commonly used steganographic technique in which a parity-check matrix is used to perform embedding. However, a drawback of high decoding complexity for linear block codes by using the maximum-likelihood algorithm is unrealistic. This paper proposes a simple and effective trellis embedding scheme for binary messages. Compared with a matrix embedding alg...