• Title/Summary/Keyword: Subspace

Search Result 742, Processing Time 0.033 seconds

Using Subspace Pursuit Algorithm to Improve Performance of the Distributed Compressive Wide-Band Spectrum Sensing

  • Le, Thanh Tan;Kong, Hyung-Yun
    • Journal of electromagnetic engineering and science
    • /
    • v.11 no.4
    • /
    • pp.250-256
    • /
    • 2011
  • This paper applies a compressed algorithm to improve the spectrum sensing performance of cognitive radio technology. At the fusion center, the recovery error in the analog to information converter (AIC) when reconstructing the transmit signal from the received time-discrete signal causes degradation of the detection performance. Therefore, we propose a subspace pursuit (SP) algorithm to reduce the recovery error and thereby enhance the detection performance. In this study, we employ a wide-band, low SNR, distributed compressed sensing regime to analyze and evaluate the proposed approach. Simulations are provided to demonstrate the performance of the proposed algorithm.

COMPACTNESS OF A SUBSPACE OF THE ZARISKI TOPOLOGY ON SPEC(D)

  • Chang, Gyu-Whan
    • Honam Mathematical Journal
    • /
    • v.33 no.3
    • /
    • pp.419-424
    • /
    • 2011
  • Let D be an integral domain, Spec(D) the set of prime ideals of D, and X a subspace of the Zariski topology on Spec(D). We show that X is compact if and only if given any ideal I of D with $I{\nsubseteq}P$ for all $P{\in}X$, there exists a finitely generated idea $J{\subseteq}I$ such that $J{\nsubseteq}P$ for all $P{\in}X$. We also prove that if D = ${\cap}_{P{\in}X}D_P$ and if * is the star-operation on D induced by X, then X is compact if and only if * $_f$-Max(D) ${\subseteq}$X. As a corollary, we have that t-Max(D) is compact and that ${\mathcal{P}}$(D) = {P${\in}$ Spec(D)$|$P is minimal over (a : b) for some a, b${\in}$D} is compact if and only if t-Max(D) ${\subseteq}\;{\mathcal{P}}$(D).

The combined deterministic stochastic subspace based system identification in buildings

  • Bakir, Pelin Gundes
    • Structural Engineering and Mechanics
    • /
    • v.38 no.3
    • /
    • pp.315-332
    • /
    • 2011
  • The Combined Deterministic Stochastic Subspace based System Identification Technique (CDSSSIT) is a powerful input-output system identification technique which is known to be always convergent and numerically stable. The technique determines a Kalman state sequence from the projection of the output-input data. The state space matrices are determied subsequently from this Kalman state sequence using least squares. The objective of this paper is to examine the efficiency of the CDSSSIT in identifying the modal parameters (frequencies and mode shapes) of a stiff structure. The results show that the CDSSSIT predicts the modal parameters of stiff buildings quite accurately but is very sensitive to the location of sensors.

Application of subspace identification on the recorded seismic response data of Pacoima Dam

  • Yu, I-No;Huang, Shieh-Kung;Loh, Kenneth J.;Loh, Chin-Hsiung
    • Structural Monitoring and Maintenance
    • /
    • v.6 no.4
    • /
    • pp.347-364
    • /
    • 2019
  • Two seismic response data from the CSMIP strong motion instrumentation of Pacoima dam are selected: San Fernando earthquake (Jan 13, 2001; ML=4.3) and Newhall earthquake (Sept. 1, 2011; ML=4.2), for the identification of the dam system. To consider the spatially nonuniform input ground motion along the dam abutment, the subspace identification technique with multiple-input and multiple-output is used to extract the dynamic behavior of the dam-reservoir interaction system. It is observed that the dam-reservoir interaction is significant from the identification of San Fernando earthquake data. The influence of added mass (from the reservoir) during strong ground motion will create a tuned-mass damper phenomenon on the dam body. The fundamental frequency of the dam will be tuned to two different frequencies but with the same mode shapes. As for the small earthquake event, the dam-reservoir interaction is insignificant.

A Realization of Reduced-Order Detection Filters

  • Kim, Yong-Min;Park, Jae-Hong
    • International Journal of Control, Automation, and Systems
    • /
    • v.6 no.1
    • /
    • pp.142-148
    • /
    • 2008
  • In this paper, we deal with the problem of reducing the order of the detection filter for the linear time-invariant system. Even if the detection filter is generally designed in the form of full order linear observer, we show that it is possible to reduce its order when the response of fault signals is limited to a subspace of the estimation state space. We propose a method to extract the subspace using the observer canonical form considering the dynamics related to the remaining subspace acts as a disturbance. We designed a reduced order detection filter to reject the disturbance as well as to guarantee fault detection and isolation. A simulation result for a 5th order system is presented as an illustrative example of the proposed design method.

Performance Analysis of Blind Channel Estimation for Precoded Multiuser Systems

  • Xu, Zhengyuan
    • Journal of Communications and Networks
    • /
    • v.4 no.3
    • /
    • pp.189-198
    • /
    • 2002
  • Precoder has been shown to be able to provide source diversity and design flexibility. In this paper we employ precoding techniques for block transmission based on a multirate filterbank structure. To accommodate multiuser communication with variable data rates, different precoders with corresponding coefficients and up/down sampling rates are used. However, due to unknown multipath distortion, different interferences may exist in the received data, such as multiuser interference, intersymbol interference and interblock interference. To estimate channel parameters for a desired user, we employ all structured signature waveforms associated with different symbols of that user and apply subspace techniques. Therefore better performance of channel estimator can be achieved than the conventional subspace method based only on the signature of the current symbol. The delay for that user can also be jointly estimated. Channel identifiability conditions and asymptotic channel estimation error are investigated in detail. Numerical examples are provided to justify the proposed method. gest either multicode (MC) or multiple processing gain (MPG) mechanism [2], while requiring data rates to be integral multiples of some basic low-rate. In order to support variable rate transmission however, a comprehensive scheme needs to be investigated.

Investigation of Convergence of Starting Iteration Vectors for Calculating Natural Modes (고유모드 계산을 위한 초기 반복벡터의 수렴성 연구)

  • Kim, Byoung-Wan;Kyoung, Jo-Hyun;Hong, Sa-Young;Cho, Seok-Kyu;Lee, In-Won
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2004.11a
    • /
    • pp.717-720
    • /
    • 2004
  • Two modified versions of subspace iteration method using accelerated starting vectors are proposed to efficiently calculate free vibration modes of structures. Proposed methods employ accelerated Lanczos vectors as starting iteration vectors in the subspace iteration method. To investigate the efficiency of proposed methods, two numerical examples are presented.

  • PDF

PARALLEL PERFORMANCE OF MULTISPLITTING METHODS WITH PREWEIGHTING

  • Han, Yu-Du;Yun, Jae-Heon
    • Journal of the Korean Mathematical Society
    • /
    • v.49 no.4
    • /
    • pp.805-827
    • /
    • 2012
  • In this paper, we first study convergence of a special type of multisplitting methods with preweighting, and then we provide some comparison results of those multisplitting methods. Next, we propose both parallel implementation of an SOR-like multisplitting method with preweighting and an application of the SOR-like multisplitting method with preweighting to a parallel preconditioner of Krylov subspace method. Lastly, we provide parallel performance results of both the SOR-like multisplitting method with preweighting and Krylov subspace method with the parallel preconditioner to evaluate parallel efficiency of the proposed methods.

STRAUM-MATXST: A code system for multi-group neutron-gamma coupled transport calculation with unstructured tetrahedral meshes

  • MyeongHyeon Woo;Ser Gi Hong
    • Nuclear Engineering and Technology
    • /
    • v.54 no.11
    • /
    • pp.4280-4295
    • /
    • 2022
  • In this paper, a new multi-group neutron-gamma transport calculation code system STRAUM-MATXST for complicated geometrical problems is introduced and its development status including numerical tests is presented. In this code system, the MATXST (MATXS-based Cross Section Processor for SN Transport) code generates multi-group neutron and gamma cross sections by processing MATXS format libraries generated using NJOY and the STRAUM (SN Transport for Radiation Analysis with Unstructured Meshes) code performs multi-group neutron-gamma coupled transport calculation using tetrahedral meshes. In particular, this work presents the recent implementation and its test results of the Krylov subspace methods (i.e., Bi-CGSTAB and GMRES(m)) with preconditioners using DSA (Diffusion Synthetic Acceleration) and TSA (Transport Synthetic Acceleration). In addition, the Krylov subspace methods for accelerating the energy-group coupling iteration through thermal up-scatterings are implemented with new multi-group block DSA and TSA preconditioners in STRAUM.

CONTINUITY OF LINEAR OPERATOR INTERTWINING WITH DECOMPOSABLE OPERATORS AND PURE HYPONORMAL OPERATORS

  • Park, Sung-Wook;Han, Hyuk;Park, Se Won
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.16 no.1
    • /
    • pp.37-48
    • /
    • 2003
  • In this paper, we show that for a pure hyponormal operator the analytic spectral subspace and the algebraic spectral subspace are coincide. Using this result, we have the following result: Let T be a decomposable operator on a Banach space X and let S be a pure hyponormal operator on a Hilbert space H. Then every linear operator ${\theta}:X{\rightarrow}H$ with $S{\theta}={\theta}T$ is automatically continuous.

  • PDF