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.
In this study, an indoor localization system is developed for the mobile robots. The localization system consists of a passive RFID tag and a reader. The passive RFID tag is placed on the robot and reader antennas are spatially dispersed into the room. For the localization, Selective Adaptive Weighted Centroid Localization (SAWCL) algorithm is used. Performance of the localization system is evaluated...
In this study, we proposed a parallel implementation of the combinatorial type artificial bee colony algorithm which has an efficient neighbor production mechanism. Running time and performance tests of the proposed parallel model were carried on the traveling salesmen problem. Results show that parallel artificial bee colony algorithm decreases the running time due to exploiting the computational...
The studies intended to obtain azimuth angle of any kind of electromagnetic wave, using a specific passive antenna group, has been maintained for long years [1]. In this work, towards to the solution of this problem, determination of the location of transmitters especially broadcasting in HF band has been aimed and the transmitters' azimuth angles have been figured out using MUSIC (MUltiple SIgnal...
In this study, a novel complex valued adaptive filter algorithm is proposed satisfying stability in the sense of Lyapunov. The prediction capability of the proposed algorithm is presented by using complex valued autoregressive process and wind signal in the literature. The proposed complex valued adaptive filter algorithm is compared with standard complex normalized least mean square algorithm and...
The recent advances in sparse representations of images have achieved outstanding results in terms of denoising and restoration; but removal of real and structured noise in digital video sequences remains a challenging problem. Based on this idea, the problem addressed in this paper proposes to improve the decision median filtering algorithm for denoising of video sequences corrupted with impulse...
Many modern computer vision systems combine high dimensional features and linear classifiers to achieve better classification accuracy. However, the excessively long features are often highly redundant; thus dramatically increases the system storage and computational load. This paper presents a novel feature selection algorithm, namely cardinal sparse partial least square algorithm, to address this...
We implement a high speed and low power FIR digital filter design using the fixed width booth multiplier. To reduce the truncation error in fixed width multiplier Adaptive Conditional Probability Estimator is used(ACPE). To achieve higher speed, the modified Booth encoding has been used and also to speed up the addition the carry look ahead adder is used as a carry propagate adder. The multiplier...
The high computational complexity and great memory requirement prevent the SIFT algorithm from being processed realtimely. The block-parallel SIFT algorithm with boundary extension adopted by existing researches suffers from redundant storages or extra communications to process the boundaries of partitions. The block-parallel SIFT algorithm without boundary extension (pSIFT-noBE) can spontaneously...
Extraction of unknown independent source signals from a noisy mixture is a fundamental problem in most signal processing applications. The existing independent component analysis (ICA) algorithms have tackled this problem for complex and real valued mixtures for both super and sub Gaussian sources. However in reality super and sub Gaussian sources exist collectively in a mix. It was observed when...
We introduce in this paper the fully distributed, Rao-Blackwellized Random Exchange Diffusion Particle Filter (RB ReDif-PF) to track a moving emitter using multiple received-signal-strength (RSS) sensors with unknown noise variances. In a simulated scenario with a partially connected network, the proposed RB ReDif-PF outperformed a suboptimal tracker that assimilates local neighboring measurements...
In this paper, we consider the issue of distributed computation of tensor decompositions. A central unit observing a global data tensor assigns different data sub-tensors to several computing nodes grouped into clusters. The goal is to distribute the computation of a tensor decomposition across the different computing nodes of the network, which is particularly useful when dealing with large-scale...
There is a recent interest in developing algorithms for the reconstruction of jointly sparse signals, which arises in a large number of applications. In this work, we study the problem of wide-band spectrum sensing for cognitive radio networks using compressed sensing to exploit the underlying joint sparsity structure in a distributed setting. In particular, we use the recently proposed Approximate...
In the diffusion strategies for distributed estimation over adaptive networks, each node calculates a weighted average of the intermediate parameter estimates of its neighboring nodes. Thus, all the nodes should continuously share their intermediate estimates with their neighbors. In this paper, we consider exchanging a predetermined number of elements of each intermediate estimate vector at each...
Gossip and tree-based aggregation algorithms are two popular solutions for distributed averaging in wireless networks. The former uses only local message exchanges and requires no routing structures whereas the latter requires building a spanning tree. In this paper we provide a detailed comparison of their performance in terms of communication overhead, accuracy, latency and energy consumption using...
We study received signal strength-based cooperative localization in wireless sensor networks. We assume that the measurement noise fits a contaminated Gaussian model so as to take into account some outlier conditions. In addition, some environment-dependent parameters are assumed to be unknown. We propose an expectation-maximization based algorithm for robust centralized network localization without...
In traditional cognitive radio ad hoc networks (CRAHNs), each unlicensed node senses and attains its own idle frequency channel. Considering that the available channels at different nodes may be different, a dedicated common control channel (CCC) facilitates the exchange of the spectrum availability information of each node, and then forthcoming communication nodes tune to the same frequency channel...
Fingerprinting is one of the most used techniques for searching and identification audio with a wide spectrum of applications. Different algorithms defines different fingerprint extraction and the match techniques, with different efficiency, computational load, robustness, response time and location search. Nowadays music audio retrieval faces two main challenges in order to be efficient: robustness...
Random medium access control (MAC) is extensively used in wireless communication systems as a means to allocate the shared radio resource in a distributed manner. However, some of the ultimate performance limits, including the maximum throughput, are not well understood due to the non-convex nature of the utility optimization problem. In this paper, we introduce the monotonic optimization method to...
This paper addresses an energy-efficiency (EE) maximized resource allocation (RA) problem for a downlink orthogonal frequency division multiple-access (OFDMA) network, when the system's total power (including transmission power and fixed circuit power) is constrained below a peak value. The EE is evaluated by the number of message bits delivered corresponding to per Joule energy consumed by the whole...
Multiplier design is always a challenging task; how many ever novel designs are proposed, the user needs demands much more optimized ones. Vedic mathematics is world renowned for its algorithms that yield quicker results, be it for mental calculations or hardware design. Power dissipation is drastically reduced by the use of Reversible logic. The reversible Urdhva Tiryakbhayam Vedic multiplier is...
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.