• 제목/요약/키워드: Orthogonal set

Search Result 265, Processing Time 0.026 seconds

A FINITE ADDITIVE SET OF IDEMPOTENTS IN RINGS

  • Han, Juncheol;Park, Sangwon
    • Korean Journal of Mathematics
    • /
    • v.21 no.4
    • /
    • pp.463-471
    • /
    • 2013
  • Let R be a ring with identity 1, $I(R){\neq}\{0\}$ be the set of all nonunit idempotents in R, and M(R) be the set of all primitive idempotents and 0 of R. We say that I(R) is additive if for all e, $f{\in}I(R)$ ($e{\neq}f$), $e+f{\in}I(R)$. In this paper, the following are shown: (1) I(R) is a finite additive set if and only if $M(R){\backslash}\{0\}$ is a complete set of primitive central idempotents, char(R) = 2 and every nonzero idempotent of R can be expressed as a sum of orthogonal primitive idempotents of R; (2) for a regular ring R such that I(R) is a finite additive set, if the multiplicative group of all units of R is abelian (resp. cyclic), then R is a commutative ring (resp. R is a finite direct product of finite field).

Performance Evaluation of Space Time Frequency OFDM System using Super-Orthogonal Space Time Trellis Code Transmission Matrix (Super-Orthogonal STTC 전송 행렬을 이용한 STF-OFDM 시스템의 성능 평가)

  • Seo, Myoung-Seok;Shin, Chul-Min;Kim, Yoo-Mi;Kwak, Kyung-Sub
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.5 no.3 s.11
    • /
    • pp.29-39
    • /
    • 2006
  • In this paper, we propose an efficient method to detect the signal and evaluate performance of the system in frequency selective fading channel. We combine proposed system with OFDM (Orthogonal Frequency Division Multiplexing) to improve performance of the system. First, we study the SOSTTC-OFDM system using two transmit antenna and one receive antenna, and compare performance of the proposed space-time coded OFDM with that of previous system. We expand this system to the system using four transmit antennas with the proposed decoding method. Simulation results show that the proposed decoding method can detect the signal efficiently, and we identify that the performance of the proposed system is shown with varying doppler frequency in frequency selective fading channel.

  • PDF

An equivalent linearization method for nonlinear systems under nonstationary random excitations using orthogonal functions

  • Younespour, Amir;Cheng, Shaohong;Ghaffarzadeh, Hosein
    • Structural Engineering and Mechanics
    • /
    • v.66 no.1
    • /
    • pp.139-149
    • /
    • 2018
  • Many practical engineering problems are associated with nonlinear systems subjected to nonstationary random excitations. Equivalent linearization methods are commonly used to seek for approximate solutions to this kind of problems. Compared to various approaches developed in the frequency and mixed time-frequency domains, though directly solving the system equation of motion in the time domain would improve computation efficiency, only limited studies are available. Considering the fact that the orthogonal functions have been widely used to effectively improve the accuracy of the approximated responses and reduce the computational cost in various engineering applications, an orthogonal-function-based equivalent linearization method in the time domain has been proposed in the current paper for nonlinear systems subjected to nonstationary random excitations. In the numerical examples, the proposed approach is applied to a SDOF system with a set-up spring and a SDOF Duffing oscillator subjected to stationary and nonstationary excitations. In addition, its applicability to nonlinear MDOF systems is examined by a 3DOF Duffing system subjected to nonstationary excitation. Results show that the proposed method can accurately predict the nonlinear system response and the formulation of the proposed approach allows it to be capable of handling any general type of nonstationary random excitations, such as the seismic load.

Stagewise Weak Orthogonal Matching Pursuit Algorithm Based on Adaptive Weak Threshold and Arithmetic Mean

  • Zhao, Liquan;Ma, Ke
    • Journal of Information Processing Systems
    • /
    • v.16 no.6
    • /
    • pp.1343-1358
    • /
    • 2020
  • In the stagewise arithmetic orthogonal matching pursuit algorithm, the weak threshold used in sparsity estimation is determined via maximum iterations. Different maximum iterations correspond to different thresholds and affect the performance of the algorithm. To solve this problem, we propose an improved variable weak threshold based on the stagewise arithmetic orthogonal matching pursuit algorithm. Our proposed algorithm uses the residual error value to control the weak threshold. When the residual value decreases, the threshold value continuously increases, so that the atoms contained in the atomic set are closer to the real sparsity value, making it possible to improve the reconstruction accuracy. In addition, we improved the generalized Jaccard coefficient in order to replace the inner product method that is used in the stagewise arithmetic orthogonal matching pursuit algorithm. Our proposed algorithm uses the covariance to replace the joint expectation for two variables based on the generalized Jaccard coefficient. The improved generalized Jaccard coefficient can be used to generate a more accurate calculation of the correlation between the measurement matrixes. In addition, the residual is more accurate, which can reduce the possibility of selecting the wrong atoms. We demonstrate using simulations that the proposed algorithm produces a better reconstruction result in the reconstruction of a one-dimensional signal and two-dimensional image signal.

Solid Reconstruction from a Set of the Orthogonal Three Views (삼면도로부터 솔리드의 자동생성에 관한 연구)

  • 박시형;이성수
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1995.10a
    • /
    • pp.683-686
    • /
    • 1995
  • The automatic solid reconstruction is one of the important problems in CAD. Nowadays solid reconstruction has been done many areas, we will proposed this algorithm contribute to that development. this paper presents the algorithm to automatically reconstruct the soild form a set of the orthogonalal three views.

  • PDF

Computing the Dominating-Free Set by Two Point Sets in the Plane

  • Kim, Soo-Hwan
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.1
    • /
    • pp.105-109
    • /
    • 2011
  • In this paper, we study the dominating-free sest which is defined as follows: k points called servers and n points called clients in the plane are given. For a point p in the plane is said to be dominated by a client c if for every server s, the distance between s and p is greater than the distance between s and c. The dominating-free set is the set of points in the plane which aren't dominated by any client. We present an O(nklogk+$n^2k$) time algorithm for computing the dominating-free set under the $L_1$-metric. Specially, we present an O(nlogn) time algorithm for the problem when k=2. The algorithm uses some variables and 1-dimensional arrays as its principle data structures, so it is easy to implement and runs fast.

Algorithm for the Constrained Chebyshev Estimation in Linear Regression

  • Kim, Bu-yong
    • Communications for Statistical Applications and Methods
    • /
    • v.7 no.1
    • /
    • pp.47-54
    • /
    • 2000
  • This article is concerned with the algorithm for the Chebyshev estimation with/without linear equality and/or inequality constraints. The algorithm employs a linear scaling transformation scheme to reduce the computational burden which is induced when the data set is quite large. The convergence of the proposed algorithm is proved. And the updating and orthogonal decomposition techniques are considered to improve the computational efficiency and numerical stability.

  • PDF

Sparse Signal Recovery with Parallel Orthogonal Matching Pursuit for Multiple Measurement Vectors (병렬OMP 기법을 통한 복수 측정 벡터기반 성긴 신호의 복원)

  • Park, Jeonghong;Ban, Tae Won;Jung, Bang Chul
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.10
    • /
    • pp.2252-2258
    • /
    • 2013
  • In this paper, parallel orthogonal matching pursuit (POMP) is proposed to supplement the simultaneous orthogonal matching pursuit (S-OMP) which has been widely used as a greedy algorithm for sparse signal recovery for multiple measurement vector (MMV) problem. The process of POMP is simple but effective: (1) multiple indexes maximally correlated with the observation vector are chosen at the first iteration, (2) the conventional S-OMP process is carried out in parallel for each selected index, (3) the index set which yields the minimum residual is selected for reconstructing the original sparse signal. Empirical simulations show that POMP for MMV outperforms than the conventional S-OMP both in terms of exact recovery ratio (ERR) and mean-squared error (MSE).

On Non-Orthogonal Multiple Access (NOMA) in 5G Systems (5G 시스템에서의 비-직교 다중 액세스(NOMA))

  • Islam, SM Riazul;Kim, Jae Moung;Kwak, Kyung Sup
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.12
    • /
    • pp.2549-2558
    • /
    • 2015
  • The non-orthogonal multiple access (NOMA) is one of the fledging paradigms which next generation radio access technologies are sprouting toward. The NOMA with superposition coding (SC) in the transmitter and successive interference cancellation (SIC) at the receiver comes with many desirable features and benefits over orthogonal multiple access (OMA) such as orthogonal frequency division multiple access (OFDMA) adopted by Long-Term Evolution (LTE). In this paper, we study the recent research trends on NOMA in 5G systems. We discuss the basic concept of NOMA and explain its aspects of importance for future radio access. Then, we provide a survey of the state of the art in NOMA for 5G systems in a categorized manner. Further, we analyze the NOMA performances with numerical examples; and provide some avenues for future research on NOMA on a set of open issues and challenges.