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.
Electromagnetic (EM) vector sensor arrays can track both the polarisation and direction of arrival (DOA) parameters of the impinging signals. For crossed-dipole linear arrays, due to inherent limitation of the structure, it can only track one DOA parameter and two polarisation parameters. This problem could be solved by extending the geometry to a two-dimensional (2-D) rectangular array so that both...
Node flip ambiguity is a key problem that needs to be addressed for the range-based node localization in wireless sensor networks. A Robust Node Localization Method (RNLM) is proposed in this paper. It is a two phase methods. In the first phase, the orthogonal projection detection method is adopted to detect the unknown nodes needed to be positioned. For the unknown nodes that will not occur flip...
Node flip ambiguity is a key problem that needs to be addressed for range-based node localization in wireless sensor networks. In this paper we have implemented robustness analysis for three-dimensional node localization in wireless sensor networks. A robustness criterion to detect flip ambiguity for range-based three-dimensional nodes localization is proposed. We have proposed that flip ambiguity...
This paper proposes a new relative map method for the efficiency of the monocular EKF-SLAM. The landmarks in the traditional EKF-SLAM are fully covariant with each other and cause a quadric computational complexity according to their number in the map. Our approach maintains the map with the relative locations of the landmarks and the corresponding believes, and only a small number of the landmarks...
To detect a node flip ambiguity in range-based wireless network node localization, Wang et al. have proved that the flip ambiguity detection is equal to whether there is a straight line intersecting with all range error circles of reference node, which is called the existence of intersecting line (EIL) problem. To solve the EIL problem under equal radii, a convex hull algorithm proposed by Wang et...
In cognitive radio networks, the available spectrum holes are usually discontinuous. Hence, it is hard to exploit these spectrum holes because the bandwidth of an individual one may not be able to satisfy the wide bandwidth requirement imposed by secondary users (SUs). Spectrum aggregation (SA) enables SUs to integrate several spectrum holes into one channel with wide bandwidth which may support high...
Inversion of channel matrix is required for commonly used detection schemes in multiple-input multiple-output (MIMO) systems. In time-varying fading channels, frequent matrix inversion is computationally intensive for mobile terminals operating at high data rates. Several existing papers have addressed this problem for MIMO orthogonal frequency division multiplexing systems by employing interpolation...
Object detection is an important function for intelligent multimedia processing, but its computational complexity prevented its pervasive uses in consumer electronics. Cost-effective & energy-efficient computations are now available with various innovative multicore architectures proposed for embedded systems. However, extensive software optimizations are needed to unravel the inherent parallelisms...
In this paper, an adaptive MMSE channel estimation method is proposed for UWB-OFDM system. As we known, the MMSE algorithm is dependent on the auto-correlation of the known signals and the cross-correlation between the known signals and the signals to be estimated. These parameters are difficult to obtain in practice, because it needs a long-term statistic at the cost of huge complexity and time delay...
In order to overcome the dimension problem of the traditional fuzzy clustering, we use kernel-based fuzzy c-means clustering (KFCM) to construct first-order TSK fuzzy models. The proposed algorithm is composed of two phases. In the first phase, the antecedent fuzzy sets are obtained by KFCM. We present the expression of the cluster prototypes of KFCM with different kernel functions in original input...
Since Adleman shows that DNA strands can be used to solve an instance of the NP-complete Hamiltonian path problem (HPP). DNA computing has been used to solve all kinds of difficult problems including neural networks. This paper put forward a DNA computing model of perceptron to implement linear categorizer function. The advantage of the DNA computing model is the great parallelism of algorithm which...
The computational complexity of a texture classification algorithm is limited by the dimensionality of the feature space. A feature selection algorithm that can reduce the dimensionality of problem is often desirable, which has been studied by many authors because of its impact on the complexity of classifiers, Furthermore, feature selection in high dimension space is a NP hard problem. This paper...
This paper describes a complexity-effective design of auditory compensation, which is the most important building block in digital hearing aids. A multi-rate architecture and the filter bank design thereof are proposed to significantly reduce the data rates of the band-limited channels and thus the computational complexity. Several optimizations are discussed to further simplify the implementation...
Existing digital hearing aids, to our knowledge, all exclude ANSI S1.11-compliant filter banks because of the high computational complexity. Most ANSI S1.11 designs are IIR- based and only applicable in applications where linear phase is not important. This paper presents an FIR-based ANSI S1.11 filter bank for digital hearing aids, which adopts a multi-rate architecture to reduce the data rates on...
A fast algorithm named FAST_LCS is presented for the longest common substring (LCS) problem. The algorithm firstly seeks the successors of the initial identical character tuples according to successor tables to obtain all the identical tuples and their levels. Then the result of LCS can be obtained by tracing back from the identical character tuple with the largest level. For n biosequences X 1, X...
Searching for the longest common subsequence (LCS) of biosequences is one of the most important problems in bioinformatics. A fast algorithm for LCS problem FAST_LCS is presented. The algorithm first seeks the successors of the initial identical character pairs according to a successor table to obtain all the identical pairs and their levels. By tracing back from the identical character pair at the...
This paper presents a programmable FIR core with a compact adder-based computing engine and an automatic code generator. The FIR core saves 50% area of conventional MAC-based cores in the 0.13mum implementation. Besides, the complexity-aware code generator synthesizes optimized FIR programs for a user-defined sampling period. It explores an optimal scaling factor with common subexpression elimination...
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.