Entity

Time filter

Source Type


Abedi D.,Shahid Beheshti University | Jaberipur G.,Shahid Beheshti University | Sangsefidi M.,Sadjad University of Technology
IEEE Transactions on Nanotechnology | Year: 2015

We use a coplanar QCA crossover architecture in the design of QCA full adders that leads to reduction of QCA cell count and area consumption without any latency penalty. This crossover uses non-adjacent clock zones for the two crossing wires. We further investigate the impact of these gains on carry flow QCA adders. These designs have been realized with QCADesigner, evaluated, and tested for correctness. For better performance comparison with previous relevant works, we use a QCA-specific cost function, as well as the conventional evaluation method. We show 23% cell count and 48% area improvements over the best previous QCA full adder design. Similar results for 4-, 8-, 16-, 32-, and 64-bit adders are 29% (22%), 24% (51%), 19% (54%), 13% (69%), and 9% (49%) cell count reduction (less area consumption), respectively. © 2002-2012 IEEE. Source


Abedi M.,Sadjad University of Technology | Pourmohammad A.,Amirkabir University of Technology
Proceedings - 2015 11th International Conference on Innovations in Information Technology, IIT 2015 | Year: 2015

The super-gaussian non-stationary audio noises could not be well represented, feature extracted, and then classified in the stationary and linear transform domains as DFT (Discrete Fourier Transform) or STFT (Short Time Fourier Transform) especially in the very low SNR (Signal-to-Noise Ratio) data capturing times. DWT (Discrete Wavelet Transform) is the most commonly used and conventional transform for representing, feature extracting, and then classifying of such signals using data independent kernels. But the simulations confirm that the sparse representation transforms could well represent them than DWT because of using data dependent kernels (Atoms). In this paper it is investigated using MP-TFD (Matching-Pursuit Time-Frequency Decomposition) technique for the super-gaussian non-stationary audio noises representing, then applying NMF (non-Negative Matrix Decomposition) technique for decomposing of the TFM (Time-Frequency Matrix) into its significant components, and finally extracting MFCCs (Mel-Frequency Cepstral Coefficients) as the features in order to the sources classifying. © 2015 IEEE. Source


Hamidzadeh J.,Sadjad University of Technology | Monsefi R.,Ferdowsi University of Mashhad | Sadoghi Yazdi H.,Ferdowsi University of Mashhad
Pattern Recognition | Year: 2015

In instance-based classifiers, there is a need for storing a large number of samples as training set. In this work, we propose an instance reduction method based on hyperrectangle clustering, called Instance Reduction Algorithm using Hyperrectangle Clustering (IRAHC). IRAHC removes non-border (interior) instances and keeps border and near border ones. This paper presents an instance reduction process based on hyperrectangle clustering. A hyperrectangle is an n-dimensional rectangle with axes aligned sides, which is defined by min and max points and a corresponding distance function. The min-max points are determined by using the hyperrectangle clustering algorithm. Instance-based learning algorithms are often confronted with the problem of deciding which instances must be stored to be used during an actual test. Storing too many instances can result in a large memory requirements and a slow execution speed. In IRAHC, core of instance reduction process is based on set of hyperrectangles. The performance has been evaluated on real world data sets from UCI repository by the 10-fold cross-validation method. The results of the experiments have been compared with state-of-the-art methods, which show superiority of the proposed method in terms of classification accuracy and reduction percentage. © 2014 Elsevier Ltd. All rights reserved. Source


Samadi R.,Islamic Azad University at Ferdows | Hamidzadeh J.,Sadjad University of Technology
2014 International Congress on Technology, Communication and Knowledge, ICTCK 2014 | Year: 2015

The dynamic economic dispatch (DED) problem is an extension of the conventional static load dispatch problem in the context of electrical power generation. In this paper, issues related to the implementation of the several soft computing techniques are highlighted for a successful application to solve dynamic economic dispatch (DED) problem, which is a constrained optimization problem in power systems. First of all, a survey covering the basics of the techniques is presented and then implementation of the techniques in the DED problem is discussed. The soft computing techniques, namely multi-layered perceptron neural network (MLP NN), genetic algorithm (GA), Imperialist Competitive Algorithm(ICA), particle swarm (PSO) and are applied to solve the DED problem. The Evolutionary Algorithms are tested on power system consisting 3 generating units and the results are compared together. Suggestion is presented to improve techniques. © 2014 IEEE. Source


Monemizadeh N.,Sadjad University of Technology | Hodtani G.A.,Ferdowsi University of Mashhad
Transactions on Emerging Telecommunications Technologies | Year: 2016

In this paper, we characterize capacity region of the Gaussian doubly dirty two-way channel (TWC) with partial side information at users, where there are two additive interference signals that, although similar to the channel noise sequences, corrupt the transmitted signals but are non-causally and partially known to the users. First, by employing adaptation (considering the previously received signals in encoding process), we derive an adaptive outer bound on the capacity region of the channel. Then, we utilize lattice strategies and obtain a non-adaptive inner bound that coincides with the adaptive outer bound and hence gives the capacity region. This also shows that for the doubly dirty TWC with partial side information, adaptation is useless and cannot increase the capacity region. Finally, we prove that Costa's dirty paper coding is optimal like lattice strategies and therefore, the Gaussian doubly dirty TWC is an instance of multi-user channels in which lattice strategy and Costa's strategy have the same performance from the capacity region perspective. It is worth noting that our results subsume the previous related works as special cases. Copyright © 2014 John Wiley & Sons, Ltd. Source

Discover hidden collaborations