• ETRI Journal
• /
• v.32 no.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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.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.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• 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.

• Journal of Convergence for Information Technology
• /
• v.8 no.5
• /
• pp.101-106
• /
• 2018

Software are being studied to register and manage assets. And Methods for evaluating software systems have been based on subjective evaluation criteria. We propose an evaluation model for evaluating complex assets obtained from the complexity measurement of the preceding asset management system. We used scales to measure and provide logical complexity to measure the complexity of our architectural assets. And we used a method to evaluate whether it expresses attribute value of architecture asset. We have also built an evaluation model criterion for evaluating the usability of the asset data based on the ISO/IEC 25010 quality model characteristics of the SQuaRE Series. When the designers design the asset as a composite asset, the optional evaluation of the negative property that weights are assigned according to the characteristics of each asset is applied to secure the flexibility of the evaluation model.

• The Journal of Korea Robotics Society
• /
• v.2 no.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
• /
• v.15 no.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
• /
• v.16 no.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.

• Journal of Industrial Convergence
• /
• v.20 no.5
• /
• pp.77-82
• /
• 2022

Evaluating methods for software asset have been made based on subjective evaluation criteria. In this study, we try to evaluate the usability of complex assets obtained from the previous measurement of the complexity of the asset management system. The evaluation used a scale provided by measuring logical complexity to measure the complexity of the asset, and evaluated the relationship with the usability of the software asset by measuring the index related to reusability. Therefore, it can be seen that HVs maintain a constant ratio according to the composition of various assets for the two types of assets and maintain the applied consistency. Therefore, it can be determined that an asset optimized in terms of usability can be applied consistently in the architectural design process while securing as much diversity as possible.

• Journal of Intelligence and Information Systems
• /
• v.7 no.1
• /
• pp.149-159
• /
• 2001

There have been lots of researches for providing a personalized service to a customer using one-to-one marketing and collaborative filtering techniques in E-Commerce. However, there are technical difficulties for providing the recommendation of products far users, which often involve high complexity of computation. In this paper, we have presented an integrated method of classification problem solving method and constraint based configuration techniques. This method can reduce a complexity of computation by classifying a solution domain space that has a higher complexity of composition. Thereafter, we have modeled customers constraints and the components of products to configure a complete system by passing it to constraint processing module in Constraint Satisfaction Problems. Constraint-based configuration uses the constraint propagation using the constraints of buyers and the constraints among PC components to configure a proper product for a customer. We have transformed and applied vector space modeling method in the field of information retrieval to consider a customer satisfaction in addition to the CSP. Finally, we have applied our system to test data fur evaluating a customers satisfaction and performance of the proposed system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11B
• /
• pp.965-971
• /
• 2003

This paper suggests a low-complexity frame timing synchronization system for IEEE802.11a wireless LAN systems. The proposed timing synchronization scheme has been implemented by correlating the received OFDM preamble with quantized coefficients composed of ｛0, ${\pm}$2$^{0}$ , ${\pm}$2$^1$‥‥‥ ${\pm}$2$^{i}$ ), where i is an integer number. The 2$^{i}$ -valued coefficients enable the multipliers in the correlation system to be simplified to i-bit shifters. So we can design the correlation system using shifters instead of multipliers. We estimate the performance of the proposed scheme in comparison with conventional systems under the AWGN and Rayleigh fading channels. In this paper we show that the complexity can be reduced by 90% while still maintaining a performance comparable to that of the conventional system.