The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper deals with DOSY analysis method for a molecular structure analysis. DOSY analysis method is formulated as a matrix decomposition problem of the observed matrix, and several algorithms have been proposed to solve this. Direct exponential curve resolution algorithm (DECRA) is well used for DOSY analysis because DECRA is the only method to achieve a high analysis performance without using...
Computational complexity of various maximal pattern mining problems, including maximal frequent items, maximal frequent subgraphs in labelled graphs, and maximal subsequences with no repetitions, is studied, and the complexities are found to be equivalent under novel constrained reductions. The results extend those of Kimelfeld and Kolaitis [ACM TODS, 2014].
Interference alignment (IA) is a revolutionary wireless transmission strategy which can reduce the impact of interference and facilitate interference cancellation techniques. The idea of IA is to coordinate multiple transmitters so that their mutual interference can be aligned into the interference space. According to projection theory of subspace, in this paper, we propose a precoding matrix design...
Least-squares temporal difference learning (LSTD) has been used mainly for improving the data efficiency of the critic in actor-critic (AC). However, convergence analysis of the resulted algorithms is difficult when policy is changing. In this paper, a new AC method is proposed based on LSTD under discount criterion. The method comprises two components as the contribution: (1) LSTD works in an on-policy...
The minimum mean square error (MMSE) algorithm can achieve the near-optimal detection performance in Massive MIMO system. However, it involves complicated matrix inversion. In this paper, a Chebyshev symmetrical successive over-relaxation iteration algorithm (CSSOR) based on the characteristic of channel hardening in massive MIMO system is proposed to avoid matrix inversion, whose the computational...
Unlike most researches focus on computation reduction, the fast algorithm proposed in this paper aims at maintaining the coding efficiency as high as possible. In the proposed algorithm we employ support vector machine (SVM) that uses three parameters as features: variances, low-frequency AC components of DCT and spatially neighboring CU levels for fast CU size decision. In addition, based upon RMD...
In this research study, the authors developed the algorithms for computing the minimum distances between non-convex polygons. The purpose of the study is to develop the algorithm that transforms non-convex polygons into multi-convex polygons and the algorithm that computes the minimum distances between polygons on the basis of Gromov-Hausdorff and Gromov-Fréchet metrics. The proposed algorithms have...
SIMD vectors help improve the performance of certain applications. The code gets vectorized into SIMD form either by hand, or automatically with auto-vectorizing compilers. The Superword-Level Parallelism (SLP) vectorization algorithm is a widely used algorithm for vectorizing straight-line code and is part of most industrial compilers. The algorithm attempts to pack scalar instructions into vectors...
This paper proposes a diffusion filtered-x affine projection sign algorithm(DFxAPSA) for active noise control to improve robustness against impulsive noises and colored inputs. The proposed algorithm is obtained by minimizing the Li norm of a posterior error vector with constraint on adaptation update. The constraint prevents from dramatic change which is due to occurence of impulsive noises. Additionally,...
Full search Motion Estimation (M.E.) process is computationally intensive and power consuming, which might be unsuitable for battery powered real time applications. In this work, different M.E. algorithms are being presented. Algorithms 1 to 3 are beneficial for low power and high throughput VLSI implementation while keeping the quality at optimum level. Three VLSI architectures are presented corresponding...
Created in the 90s of the past century methods of constructing algorithms (metaheuristic), inspired by the no free lunch theorem of Wolpert and Macready, using specific properties of problems, do not meet present expectations of practitioners. Commonly used artificial intelligence algorithms in recent years have also proved to be ineffective in solving a large group of extremely difficult instances...
With the introduction of several new coding tools and technology for depth maps in 3D-HEVC, the coding efficiency is improved at the expense of computational complexity. Meanwhile, the inter-view correlation is not considered and used well for depth maps, while it is developed maturely in texture video coding. Therefore, in this paper, we propose an early determination scheme for the best prediction...
Narrowband blanket jamming is common in satellite navigation systems. To suppress narrowband jamming, this paper proposes an adaptive LMS filtering algorithm in the frequency domain by updating partial weight coefficients. Firstly this paper introduces the model and the implementation means of the algorithm, then performs contrastive analysis on the computational complexity and the convergence speed...
Sphere decoding (SD) is an efficient algorithm for Multiple-input Multiple-output (MIMO) digital communications. It has been showed to achieve near Maximum Likelihood (ML) performance with low complexity. However, the complexity of conventional SD algorithm is high under the specific environment. The performance and the computation complexity of SD algorithm is highly dependent on the initial choice...
Adaptive Dynamic Programming (ADP) with critic-actor architecture is a useful way to achieve online learning control. The algorithm Gaussian-Kernel Adaptive Dynamic Programming (GK-ADP) that has been developed before has a kind of two-phase iteration, which not only approximates value function, but also optimizes hyper-parameters simultaneously. However, just like most iteration algorithms are applied...
The computational complexity of various data processing applications is vastly reduced when signals are represented in the frequency domain. In launch vehicle systems, FFT is required for telemetry data processing applications. Since the systems work in real time, a fast and efficient computation of the FFT is called for. FFT multiplication deals with Floating point numbers. Vedic mathematics is an...
Image matting techniques are a key step of image processing or video editing, which is widely used nowadays. So, it has a highly demanding on processing speed. Since it usually takes a long time to process images using existing image matting algorithms, especially in high-resolution images or videos, this paper proposes a state-of-art image matting speed-up method to solve the slow-processing problem...
In this paper, we consider the uplink transmission of a system with one multi-antenna base station (BS) and multiple single antenna user equipments (UEs), which forms a virtual multiple-input multiple-output (MIMO) system. To investigate the capacity maximization problem under per-antenna power constraints, the alternating direction method of multipliers (ADMM) is exploited to obtain the optimal solution...
Regular zero-forcing (RZF) precoding algorithm is well- known as its low complexity and high performance in massive MIMO systems. However, when the number of transmitting antennas increases, the matrix inversion in RZF leads to high algorithmic complexity. In this paper, we propose an improved Newton iteration to estimate the matrix inversion in RZF precoding. Compared with the traditional Newton...
Blind subspace-based channel estimation (SS-CE) methods have been widely discussed in orthogonal frequency division multiplexing (OFDM) systems since the spectral efficiency can be improved by reducing the number of pilot or training symbols. However, the signal matrix, constructed from transmitted signals, applied in SS-CE must be full rank to make SS-CE method successfully estimate the channel impulse...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.