• Journal of Ocean Engineering and Technology
• /
• v.28 no.1
• /
• pp.55-63
• /
• 2014

In this paper, we propose an threshold-based Schur algorithm for estimating the media characteristics of sub-bottom multi-layers by using the signal generated by a parametric array transducer. We use the KZK model to generate a parametric array signal, and use the proposed threshold-based Schur algorithm for estimating the reflection coefficients of multiple sea bottom layers. Using computer simulation, we verify that the difference frequency component generated by the KZK model prevails over the signals of primary frequencies at long range. For the simulation, we use the transmit signal generated by the KZK and the reflected signal obtained from a lattice filter model for the seawater and sub-bottom of multi-level non-homogeneous layers. Through the simulation, we verify that the proposed threshold-based Schur algorithm can give much more accurate and efficient estimates of the reflection coefficients than methods using received signal, matched filter output signal, and normal Schur algorithm output.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.9
• /
• pp.156-163
• /
• 2013

In this paper, we propose an algorithm for estimating media characteristics of sea water and subbottom multi-layers. The proposed algorithm for estimating reflection coefficients, uses a transmitted signal and reflected signal obtained from multiple layers of various shape and structure, and the algorithm is called Schur algorithm. The algorithm is efficient in estimating the reflection coefficients since it finds solution by converting the given inverse scattering problem into matrix factorization. To verify the proposed algorithm, we generate a transmit signal and reflected signal obtained from lattice filter model for sea water and subbottom of multi-level non-homogeneous layers, and then find that the proposed algorithm can estimate reflection coefficients efficiently.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.2
• /
• pp.10-14
• /
• 2014

Krylov-Schur iteration method has been applied to the 2-Dim. waveguides of the varied geometrical structure. The eigen-equations for them have been constructed from FEM based on the tangential edge vectors of triangular elements. The eigen-values and their modes have been determined from the diagonal components of the Schur matrices and its transforming matrices. The eigen-pairs as the results have been revealed visually in the schematic representations.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.11
• /
• pp.28-35
• /
• 2013

The Krylov-Schur algorithm has been applied to reveal the eigen-properties of the wave guide having the square cross section. The eigen-matrix equation has been constructed from FEM with the basis function of the tangential edge-vectors of the triangular element. This equation has been treated firstly with Arnoldi decomposition to obtain a upper Hessenberg matrix. The QR algorithm has been carried out to transform it into Schur form. The several eigen values satisfying the convergent condition have appeared in the diagonal components. The eigen-modes for them have been calculated from the inverse iteration method. The wanted eigen-pairs have been reordered in the leading principle sub-matrix of the Schur matrix. This sub-matrix has been deflated from the eigen-matrix equation for the subsequent search of other eigen-pairs. These processes have been conducted several times repeatedly. As a result, a few primary eigen-pairs of TE and TM modes have been obtained with sufficient reliability.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.7
• /
• pp.142-148
• /
• 2014

Krylov-Schur iteration method has been applied to the 3-Dim. resonant cavity of a cylindrical form. The vector Helmholtz equation has been analysed for the resonant field strength in homogeneous media by FEM. An eigen-equation has been constructed from element equations basing on tangential edges of the tetrahedra element. This equation made up of two square matrices associated with the curl-curl form of the Helmholtz operator. By performing Krylov-Schur iteration loops on them, Eigen-values and their modes have been determined from the diagonal components of the Schur matrices and its transforming matrices. Eigen-pairs as a result have been revealed visually in the schematic representations. The spectra have been compared with each other to identify the effect of boundary conditions.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.3
• /
• pp.437-447
• /
• 2003

We propose the methods to design the finite impulse response (FIR) and the infinite impulse response (IIR) lattice filters using Schur algorithm through the spectral factorization of the covariance matrix by circulant matrix factorization (CMF). Circulant matrix factorization is also very powerful tool used fur spectral factorization of the covariance polynomial in matrix domain to obtain the minimum phase polynomial without the polynomial root finding problem. Schur algorithm is the method for a fast Cholesky factorization of Toeplitz matrix, which easily determines the lattice filter parameters. Examples for the case of the FIR Inter and for the case of the IIR filter are included, and performance of our method check by comparing of our method and another methods (polynomial root finding and cepstral deconvolution).

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.525-525
• /
• 2000

In this paper, we present recursive algorithms for state space model identification using subspace extraction via Schur complement. It is shown that an estimate of the extended observability matrix can be obtained by subspace extraction via Schur complement. A relationship between the least squares residual and the Schur complement matrix obtained from input-output data is shown, and the recursive algorithms for the subspace-based state-space model identification (4SID) methods are developed. We also proposed the above algorithm for an instrumental variable (IV) based 4SID method. Finally, a numerical example of the application of the algorithms is illustrated.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.1
• /
• pp.35-44
• /
• 2004

We Propose the methods to design the finite impulse response (FIR) and the infinite impulse response (IIR) lattice filters using Schur algorithm through the spectral factorization of the covariance matrix by circulant matrix factorization (CMF). Circulant matrix factorization is also very powerful tool used for spectral factorization of the covariance polynomial in matrix domain to obtain the minimum phase polynomial without the polynomial root finding problem. Schur algorithm is the method for a fast Cholesky factorization of Toeplitz matrix, which easily determines the lattice filter parameters. Examples for the case of the FIR filter and for the case of the In filter are included, and performance of our method check by comparing of our method and another methods (polynomial root finding and cepstral deconvolution).

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.3
• /
• pp.617-625
• /
• 2011

In [6], it was shown that hyponormality for Toeplitz operators with polynomial symbols can be reduced to classical Schur's algorithm in function theory. In [6], Zhu has also given the explicit values of the Schur's functions ${\Phi}_0$, ${\Phi}_1$ and ${\Phi}_2$. Here we explicitly evaluate the Schur's function ${\Phi}_3$. Using this value we find necessary and sufficient conditions under which the Toeplitz operator $T_{\varphi}$ is hyponormal, where ${\varphi}$ is a trigonometric polynomial given by ${\varphi}(z)$ = ${\sum}^N_{n=-N}a_nz_n(N{\geq}4)$ and satisfies the condition $\bar{a}_N\(\array{a_{-1}\\a_{-2}\\a_{-4}\\{\vdots}\\a_{-N}}\)=a_{-N}\;\(\array{\bar{a}_1\\\bar{a}_2\\\bar{a}_4\\{\vdots}\\\bar{a}_N}\)$. Finally we illustrate the easy applicability of the derived results with a few examples.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.11
• /
• pp.3761-3779
• /
• 2022

The performance of existing recognition algorithms for binary phase shift keying (BPSK) and quadrature phase shift keying (QPSK) signals degrade under conditions of low signal-to-noise ratios (SNR). Hence, a novel recognition algorithm based on features in the graph domain is proposed in this study. First, the power spectrum of the squared candidate signal is truncated by a rectangular window. Thereafter, the graph representation of the truncated spectrum is obtained via normalization, quantization, and edge construction. Based on the analysis of the connectivity difference of the graphs under different hypotheses, the sum of degree (SD) of the graphs is utilized as a discriminate feature to classify BPSK and QPSK signals. Moreover, we prove that the SD is a Schur-concave function with respect to the probability vector of the vertices (PVV). Extensive simulations confirm the effectiveness of the proposed algorithm, and its superiority to the listed model-driven-based (MDB) algorithms in terms of recognition performance under low SNRs and computational complexity. As it is confirmed that the proposed method reduces the computational complexity of existing graph-based algorithms, it can be applied in modulation recognition of radar or communication signals in real-time processing, and does not require any prior knowledge about the training sets, channel coefficients, or noise power.