• 디지털산업정보학회논문지
• /
• 제4권2호
• /
• pp.49-55
• /
• 2008

Combining OFDMA with MIMO is the key technology for the 4G mobile communication. OFDMA can relieve inherent difficulties of high-speed transmission. MIMO technology can be largely categorized into two techniques: one is STC for diversity gain and the other is SM for high frequency efficiency. In this paper, we depict various MIMO techniques of two transmit antenna and compare the computational complexity of decoding process for the techniques. Then, we analysis the performance of the techniques in the WiBro downlink environment based on OFDMA. We perfer ML algorithm which is the optimum performance and ZF algorithm of least computational complexity for SM detection.

• ETRI Journal
• /
• 제32권3호
• /
• pp.479-481
• /
• 2010

An optimal multiuser detection algorithm with a computational complexity of O(K log K) is proposed for the class of linear multiple-access systems which have constant cross-correlation values. Here the optimal multiuser detection is implemented by searching for a monotone sequence with maximum likelihood, under the ranking of sufficient statistics. The proposed algorithm is intuitive and concise. It is carried out in just two steps, and at each step only one kind of operation is performed. Also, the proposed algorithm can be extended to more complex systems having more than a single cross-correlation value.

• 한국통신학회논문지
• /
• 제21권10호
• /
• pp.2579-2585
• /
• 1996

In this paper, a complex fuzzy adaptive decision feedback equalizer(CFADFE) based on the LMS algorithm is proposed. The propoed equalizer is based on the complex fuzzy adaptive equalizer. The CFADFE isconstructed from a set of changeable complex fuzzy IF-THEN rules, where the 'IF' part of the rule is characterized by the state from a set of changealble complex fuzzy IF-THEN rules, where the 'IF' part of the rule is characterized by the state of the desision feedback. the role of decision feedback is to reduce the computational complexity. Computer simulation of the decision feedback. The role of decision feedback is to reduce the computational complexity. Computer simulation shosw that the CFADFE notonly reduces the computational complexity but also improves the performance compared with the conventional complex fuzzy adaptive equalizers. We also show that the adaptation speed is greatly improved by incorporating some linguistic information about the channel into the equalzer. It is applied to M-ary QAM digital communication system with linear and nonlinear complex channel characteristics.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2009년도 추계학술대회
• /
• pp.506-509
• /
• 2009

This paper studies about reducing the complexity of ML detection in MIMO/V-blast system, based on MMSE and ZF linear detectors. Beforehand, the receiver detects the signal using the linear detector such as ZF or MMSE. Moreover, the next step is to assess whether the signal is reliable or not by verifying the reliability condition, if the latter is reliable then it is the output if not it has to be detected by the advanced detector until the reliability condition is verified.

• 융합정보논문지
• /
• 제8권5호
• /
• pp.101-106
• /
• 2018

자산을 등록 관리하기 위한 다양한 소프트웨어가 연구되고 있으며 이와 같은 소프트웨어 시스템을 평가하기 위한 방법은 주관적인 평가기준을 대상으로 이루어져왔다. 본 연구에서는 선행된 자산관리 시스템의 복잡도 측정으로부터 얻어진 복합자산을 평가하기 위한 평가모델을 제안하고자 한다. 아키텍처 자산의 복잡성을 측정하기 위해 논리적 복잡도를 측정하여 제공하는 척도를 이용하였으며, 아키텍처 자산의 속성 값을 표현하고 있는지를 평가하기 위한 방법을 사용 하였다. 소프트웨어 평가 표준인 SQuaRE Series의 ISO/IEC 25010 품질 모델 특성을 기반으로 자산데이터의 사용성을 평가하기 위한 부특성의 평가모델 기준을 구축하였다. 자산은 복합자산으로 구성되어 설계되었을 때 각 자산의 특성에 따라 가중치를 부여한 부특성의 선택적 평가를 적용하여 평가모델의 유연성을 확보하도록 하였다.

• 로봇학회논문지
• /
• 제2권3호
• /
• pp.234-241
• /
• 2007

Effective tools which can alleviate the complexity and computational load problem in collision-free motion planning for multi-agent system have steadily been demanded in robotics field. To reduce the complexity, the extended collision map (ECM) which adopts decoupled approach and prioritization is already proposed. In ECM, the collision regions which represent the potential collision of robots are calculated using the computational power; the complexity problem is not resolved completely. In this paper, we propose a mathematical analysis of the extended collision map; as a result, we formulate the collision region as an equation with 5-8 variables. For mathematical analysis, we introduce realistic assumptions as follows; the path of each robot can be approximated to a straight line or an arc and every robot moves with uniform velocity or constant acceleration near the intersection between paths. Our result reduces the computational complexity in comparison with the previous result without losing optimality, because we use simple but exact equations of the collision regions. This result can be widely applicable to coordinated multi-agent motion planning.

• Journal of Communications and Networks
• /
• 제15권4호
• /
• pp.370-382
• /
• 2013

Distributed massive MIMO systems, which have high bandwidth efficiency and can accommodate a tremendous amount of traffic using algorithms such as zero-forcing beam forming (ZFBF), may be deployed in large public venues with the antennas mounted under-floor. In this case the channel gain matrix H can be modeled as a multi-banded matrix, in which off-diagonal entries decay both exponentially due to heavy human penetration loss and polynomially due to free space propagation loss. To enable practical implementation of such systems, we present a multi-banded matrix inversion algorithm that substantially reduces the complexity of ZFBF by keeping the most significant entries in H and the precoding matrix W. We introduce a parameter p to control the sparsity of H and W and thus achieve the tradeoff between the computational complexity and the system throughput. The proposed algorithm includes dense and sparse precoding versions, providing quadratic and linear complexity, respectively, relative to the number of antennas. We present analysis and numerical evaluations to show that the signal-to-interference ratio (SIR) increases linearly with p in dense precoding. In sparse precoding, we demonstrate the necessity of using directional antennas by both analysis and simulations. When the directional antenna gain increases, the resulting SIR increment in sparse precoding increases linearly with p, while the SIR of dense precoding is much less sensitive to changes in p.

• Journal of Information Processing Systems
• /
• 제16권4호
• /
• pp.832-844
• /
• 2020

The degree of dispersion of a random variable can be described by the variance, which reflects the distance of the random variable from its mean. However, the time complexity of the traditional variance calculation algorithm is O(n), which results from full calculation of all samples. When the number of samples increases or on the occasion of high speed signal processing, algorithms with O(n) time complexity will cost huge amount of time and that may results in performance degradation of the whole system. A novel multi-step recursive algorithm for variance calculation of the time-varying data series with O(1) time complexity (constant time) is proposed in this paper. Numerical simulation and experiments of the algorithm is presented and the results demonstrate that the proposed multi-step recursive algorithm can effectively decrease computing time and hence significantly improve the variance calculation efficiency for time-varying data, which demonstrates the potential value for time-consumption data analysis or high speed signal processing.

• 산업융합연구
• /
• 제20권5호
• /
• pp.77-82
• /
• 2022

소프트웨어 자산을 평가하기 위해 정형화되지 않은 평가 방법으로 자산의 평가가 이루어져왔다. 본 연구에서는 기존의 소프트웨어 자산에 대한 복잡도의 측정으로부터 확보된 최적화된 자산의 사용성을 평가하고자 한다. 자산의 내부정보에 대한 논리적 복잡도를 측정하여 아키텍처의 복잡성에 대한 척도를 이용하였으며, 재사용성에 관여된 지표를 측정하여 소프트웨어 자산의 사용성과 어떠한 관계를 갖는지 평가하였다. 따라서 HVs는 두 가지 유형의 자산에 대하여 다양한 자산의 구성 방식에 따라 일정한 비율을 유지하며 적용되는 특성을 갖고 있는 것을 알 수 있다. 그러므로 자산의 사용성면에서 최적화된 자산은 가능한 다양성을 확보한 상태에서 아키텍처 설계과정에 정형성을 갖고 적용할 수 있을 것이다.

• 지능정보연구
• /
• 제7권1호
• /
• pp.149-159
• /
• 2001

최근 전자상거래에는 일대일 마케팅이나 협력적 정보여과기법등을 이용한 다양한 추천서비스가 도입되고 있다. 이러한 추천 서비스의 형태는 다양한 제약 조건을 갖고 계산 복잡도가 높은 제품의 경우에는 고객을 만족시킬 만큼 적절한 추천서비스가 이루어지기 어려울 것으로 본다. 본 논문에서는 Clancey의 Classification Problem Solving 방법과 제약조건 기반 Configuration기술을 통합하여, 이러한 문제를 해결할 수 있는 방법을 제시하였다. 이 방법은 Clancey의 이론에 따라 구성 복잡도가 높은 제품의 해집합 도메인을 분할하여 문제의 복잡도를 줄일 수 있도록 하였으며, 여기에서 선택된 도메인을 제약조건 기반 Configuration기술에 적용시킴으로써, 구매자와 제품 컴포넌트 사이에 존재하는 제약조건을 처리할 수 있도록 하였다. 제약조건기반 Configuration기술은 구매자에게 적합한 제품을 구성하기 위해서 제막 조건 판촉 문제(Constraint Satisfaction Problem; CSP)해결 기법을 이용한다. 또한 Clancey이론은 구매자의 만족도를 고려하기 위해서 정보검색 분야의 벡터공간 모델링 방법을 변형하여 적용하였다. 마지막으로 본 모델의 평가를 위해 전체 시스템의 수행시간 및 구매자 만족도를 비교 분석하였다