Precoding is an effective technique enhancing the performance of MIMO-OFDM systems. In practical systems, the precoding matrix is computed at the receiver, and then fed back to the transmitter. To reduce the amount of...
详细信息
Precoding is an effective technique enhancing the performance of MIMO-OFDM systems. In practical systems, the precoding matrix is computed at the receiver, and then fed back to the transmitter. To reduce the amount of the feedback data, only the index representing a quantized precoding matrix is fed back. The quantized matrix is selected from a set of predetermined matrices called a codebook. Since the number of matrices in the codebook may be large, the search for the optimum precoder requires a high computational complexity. In this paper, we propose a low-complexity precoder searching algorithm to solve the problem. The basic idea is to construct a tree-like search strategy such that the complexity can be reduced from O(L)is O(log 2 (L)) where L is the number of the codewords. Compared to the exhaustive search, the proposed searching method can reduce the searching complexity significantly while the performance loss is small.
Improving the quality of the software systems design is the most important issue during the evolution of object- oriented software systems. Refactoring ([4]) is a process that helps to maintain the internal software q...
详细信息
Improving the quality of the software systems design is the most important issue during the evolution of object- oriented software systems. Refactoring ([4]) is a process that helps to maintain the internal software quality, during the whole software lifecycle. A clustering approach for improving software systems design is introduced in [2]. For the same purpose, some clustering algorithms (kRED in [2], PAMRED in [8], HAC in [3]) that identify the appropriate refactorings for object-oriented software systems were developed. Based on these approaches, in this paper we aim at presenting a programming interface for determining refactorings of object-oriented software systems using clustering, RDI (Refactorings Determination Interface). Using this interface, we can simply develop applications for determining refactorings of object-oriented software systems using clustering. An experiment using the designed interface is also presented.
Nowadays, using data mining techniques to discover hidden patterns in various data sets is very common. Among all data mining techniques, clustering algorithms are particularly important and K-means algorithm is one o...
详细信息
ISBN:
(纸本)9781538618882
Nowadays, using data mining techniques to discover hidden patterns in various data sets is very common. Among all data mining techniques, clustering algorithms are particularly important and K-means algorithm is one of the most popular clustering methods. Simplicity, flexibility and performance in large data sets are the most important advantages of the K-means algorithm. On the other hand, some factors such as determining the number of clusters by user, outlier data and sensitivity to initial centers of the clusters and thus possibility of reaching a local minimum can reduce the efficiency of the K-means algorithm. In the present study, the idea of the K-means clustering algorithm and its advantages and disadvantages is introduced and then a new method is proposed for data clustering which overcomes the limitations of the K-means algorithm. Therefore, accuracy and efficiency of the clustering method can strongly be increased. In the proposed algorithm, to avoid identifying the number of clusters by users, similarity and threshold measures are used for clustering. Also in this algorithm the outlier data are identified and hence their negative impact on the clustering can be avoided. The experimental results show that the proposed method can overcome K-means disadvantages and improve its efficiency.
We present improved versions of the standard semi-definite relaxation for quadratic programming, that underlies many important results in robustness analysis and combinatorial optimization. It is shown that the propos...
详细信息
ISBN:
(纸本)0780366387
We present improved versions of the standard semi-definite relaxation for quadratic programming, that underlies many important results in robustness analysis and combinatorial optimization. It is shown that the proposed polynomial time convex conditions are at least as strong as the standard ones, and usually better, but at a higher computational cost. Several applications of the new relaxations are provided, including less conservative upper bounds for the structured singular value CL and enhanced solutions for the MAX CUT graph partitioning problem.
A fuzzy adaptive learning control network (FALCON) is proposed for the realization of a fuzzy logic control system. An online structure/parameter learning algorithm, called FALCON-ART, can online partition the input/o...
详细信息
ISBN:
(纸本)0780325591
A fuzzy adaptive learning control network (FALCON) is proposed for the realization of a fuzzy logic control system. An online structure/parameter learning algorithm, called FALCON-ART, can online partition the input/output spaces, tune membership functions and find proper fuzzy logic rules dynamically without any a priori knowledge or even any initial information on these. The FALCON-ART requires exact supervised training data for learning. In some real-time applications, exact training data may be expensive or even impossible to obtain. To solve this problem, a reinforcement FALCON (RFALCON) is further proposed. By combining a proposed online supervised structure/parameter learning technique, the temporal difference method, and the stochastic exploratory algorithm, a online supervised structure/parameter learning algorithm, called RFALCON-ART, is proposed for constructing the RFALCON dynamically.
An optimized partitioning algorithm for HW/SW codesign is described and applied to the implementation of a digital RAKE receiver for DS-CDMA on an heterogeneous (hardware/software) platform. The development of this pa...
详细信息
An optimized partitioning algorithm for HW/SW codesign is described and applied to the implementation of a digital RAKE receiver for DS-CDMA on an heterogeneous (hardware/software) platform. The development of this partitioning algorithm aims to gather quality features that have already proved effective when applied separately, but had not been used together yet. The partitioning algorithm is applied to a flexible RAKE architecture able to adapt its number of demodulation fingers to each propagation environment. This RAKE detector uses a serial and iterative computation of the required processing in order to jointly optimize performance and computational power
In order to allocate registers efficiently for predicated code, a new algorithm based on predicate analysis system is presented, which uses binary decision diagrams for constructing refined interference graph. The alg...
详细信息
In order to allocate registers efficiently for predicated code, a new algorithm based on predicate analysis system is presented, which uses binary decision diagrams for constructing refined interference graph. The algorithm is implemented in the compiler of XXX-DSP/700 chip developed by our college. Experiment results show that the number of used registers is reduced 24.51% evenly, and the average speedup of code execution time reaches 1.31.
The paper presents a maximum likelihood decoding (MLD) and a sub-optimum decoding algorithm for Reed-Solomon codes. The proposed algorithms are based on the algebraic structure of RS codes represented in GF(2). Theore...
详细信息
The paper presents a maximum likelihood decoding (MLD) and a sub-optimum decoding algorithm for Reed-Solomon codes. The proposed algorithms are based on the algebraic structure of RS codes represented in GF(2). Theoretical bounds on the performance are derived and shown to be accurate. The proposed sub-optimum algorithm is seen to have better error performance compared to other sub-optimum decoding algorithms while the new MLD algorithm has significantly lower decoding complexity when compared to other MLD algorithms.
In many on-line state estimation applications, identification of unknown system and measurement parameters is desired. In this paper a recursive algorithm for state estimation and parameter identification is presented...
详细信息
In many on-line state estimation applications, identification of unknown system and measurement parameters is desired. In this paper a recursive algorithm for state estimation and parameter identification is presented which is particularly appealing due to its computational simplicity and its structure as an extension of ordinary Kalman filtering. It is assumed that the unknown states and parameters are linearizable about known reference values at each stage. The algorithm is derived as a recursive solution to a maximum likelihood estimation problem. The theory is illustrated by application to an adaptive filtering problem which arises in aircraft tracking systems.
In order to overcome the Excessive time complexity of bad quality when the disposing the picture whose foreground is similar to background of grabcut method, a grabcut method based on superpixel is proposed in this pa...
详细信息
In order to overcome the Excessive time complexity of bad quality when the disposing the picture whose foreground is similar to background of grabcut method, a grabcut method based on superpixel is proposed in this paper. This method, firstly, extracting the superpixel block of the picture. And then, split the picture which is extracted. The experimental results show that this method is effective to improve the speed of segmentation. What's more, this method can solve the problem of bad quality when the disposing the image whose foreground is similar to background in a certain extent. This paper has certain advantage in disposing those image whose size are too big and foreground is similar to background.
暂无评论