Sharif Digital Repository

Long Term Evolution (LTE) supports peak data rates in excess of 300 Mb/s. A good approach to achieve such rates is by parallelizing the required processing in turbo decoders. An interleaver is an important part of a turbo decoder. LTE uses the Quadratic Permutation Polynomial (QPP) interleaver, which makes it suitable for parallel decoding. In this paper, we propose an efficient architecture for the QPP interleaver, called the Add-Compare-Select (ACS) permuting network. A unique feature of the proposed architecture is that it can be used both as the interleaver and deinterleaver leading to a high-speed low-complexity hardware interleaver/deinterleaver for turbo decoding. The proposed design... 

The Harmony Search (HS) algorithm in recent years has been applied in many applications in computer science and engineering. This chapter is intended to review the application of the HS method in the area of web document clustering. Clustering is a problem of great practical importance that has been the focus of substantial research in several domains for decades. It is defined as the problem of partitioning data objects into groups, such that objects in the same group are similar, while objects in different groups are dissimilar. Due to the high-dimension and sparseness properties of documents the problem of clustering becomes more challenging when we apply it on web documents. Two... 

Different efforts have been done to address the problem of information overload on the Internet. Recommender systems aim at directing users through this information space, toward the resources that best meet their needs and interests by extracting knowledge from the previous users' interactions. In this paper, we propose an algorithm to solve the web page recommendation problem. In our algorithm, we use distributed learning automata to learn the behavior of previous users' and recommend pages to the current user based on learned pattern. Our experiments on real data set show that the proposed algorithm performs better than the other algorithms that we compared to and, at the same time, it is... 

The Weibel instability plays an important role in stopping hot electrons and energy deposition mechanism in fast ignition of inertial fusion process. In this paper, the ion Weibel instability in counter propagating electron-ion plasmas is investigate. The obtained results show that the growth rate of Weibel instability will be decreased about 40% with the anisotropy velocity as vxe = 2vze = 20; the ion density ratio, b = n0i1/n0i2, and density gradient, are increasing 50 and 90% respectively. The ion streaming in density gradient of dense plasma leads to increasing the Weibel instability growth rate and its amplification through ion streaming in the large wavenumber. The maximum unstable... 

A new structure for the compression surfaces of a supersonic inlet is proposed which has improved the target performance parameter i.e. total pressure recovery ratio. This idea resulted in development of a new type of supersonic inlet, utilized four ramps and a cone simultaneously as the compression surfaces. A prototype of the proposed inlet has been designed for a free stream Mach number of 3 and its performance has been evaluated via numerical simulation for both design and off-design conditions. The performance of the newly designed inlet has been compared to the existing experimental data of two double-cone inlets. The acquired data are further compared with analytical calculations of... 

Harmony search (HS) is a new meta-heuristic optimization method imitating the music improvisation process where musicians improvise their instruments' pitches searching for a perfect state of harmony. A new variant of HS, called global-best harmony search (GHS), is proposed in this paper where concepts from swarm intelligence are borrowed to enhance the performance of HS. The performance of the GHS is investigated and compared with HS and a recently developed variation of HS. The experiments conducted show that the GHS generally outperformed the other approaches when applied to ten benchmark problems. The effect of noise on the performance of the three HS variants is investigated and a... 

By making aligned and suspended copper nanowires, a high performance, transferable, and flexible transparent electrode is reported. Indium tin oxide is often used in devices such as displays, solar cells, and touchscreens that require transparent and conductive plates. Because of problems such as brittleness, high cost, and environmental effects, this material is facing rivals, the most serious of which are metallic nanowire meshes, especially copper. We developed a simple technique which uses a U-shaped collector in the electrospinning process with three advantages including the enhancement of the figure of merit (which is related to the surface resistance Rs and the transmittance T) by... 

Clustering has become an increasingly important task in modern application domains. Targeting useful and relevant information on the World Wide Web is a topical and highly complicated research area. Clustering techniques have been applied to categorize documents on web and extracting knowledge from the web. In this paper we propose novel clustering algorithms based on Harmony Search (HS) optimization method that deals with web document clustering. By modeling clustering as an optimization problem, first, we propose a pure HS based clustering algorithm that finds near global optimal clusters within a reasonable time. Then we hybridize K-means and harmony clustering to achieve better... 

The advent of various real-time multimedia applications in high-speed networks creates a need for quality of service (QoS) based multicast routing. Two important QoS constraints are the bandwidth constraint and the end-to-end delay constraint. The QoS based multicast routing problem is a known NP-complete problem that depends on (1) bounded end-to-end delay and link bandwidth along the paths from the source to each destination, and (2) minimum cost of the multicast tree. In this paper, we presents novel centralized algorithms to solve the bandwidth-delay-constrained least-cost multicast routing problem based on the harmony search (HS) algorithm. Our first algorithm uses modified Prüfer... 

Colloidal copper nanoparticles were prepared by pulsed Nd:YAG laser ablation in water and acetone. Size and optical properties of the nanoparticles were characterized by transmission electron microscopy and UV-visible spectrophotometry, respectively. The copper particles were rather spherical and their mean diameter in water was 30 nm, whereas in acetone much smaller particles were produced with an average diameter of 3 nm. Optical extinction immediately after the ablation showed surface plasmon resonance peaks at 626 and 575 nm for the colloidal copper in water and acetone, respectively. Time evaluation showed a blue shift of the optical extinction maximum, which is related to the change of... 

Titania was deposited on glass fibers with a partial epoxy layer coating from a solution containing TiO2 nanoparticles at T = 90°C, and the adsorption process was examined by X-ray photoelectron spectroscopy (XPS), scanning electron microscopy (SEM), energy-dispersive spectroscopy (EDS), Fourier transform infrared (FT-IR) spectroscopy, and photocatalytic activity measurements. XPS data demonstrated that about 25% of the surface was covered with TiO2 nanoparticles, with 10% on the epoxy layer and 15% on the glass body. It was found that TiO2 nanoparticles can be readily adsorbed on epoxy groups, whereas they have a low tendency to adsorb on carbon polymer chains. This difference can be... 

Clustering has become an increasingly important and highly complicated research area for targeting useful and relevant information in modern application domains such as the World Wide Web. Recent studies have shown that the most commonly used partitioning-based clustering algorithm, the K-means algorithm, is more suitable for large datasets. However, the K-means algorithm may generate a local optimal clustering. In this paper, we present novel document clustering algorithms based on the Harmony Search (HS) optimization method. By modeling clustering as an optimization problem, we first propose a pure HS based clustering algorithm that finds near-optimal clusters within a reasonable time.... 

A novel low-complexity detection scheme is proposed for the multiple-input multiple-output (MIMO) single-carrier frequency division-multiple access (SC-FDMA) systems, which is suitable for ASIC implementations. The proposed detection scheme makes an initial estimate of the transmitted signal based on a minimum mean square error (MMSE) frequency domain equalizer (FDE) detector and finds symbols with higher error probability among them and browse more candidates for them in the constellation to improve their initial estimate. Based on this approach, architecture is introduced that achieves superior bit error rate (BER) performance compared to the conventional MMSE FDE. The performance of the... 

This paper addresses the issue of finding and accessing desired items when a large amount of data items are concerned, by proposing some concepts based on Tree Search Structure -a hierarchical structure for information retrieval. The proposed concepts are applicable to several environments such as File Managers on PCs, help tree views, site maps, taxonomies, and cell phones. A software tool, FTS (File Tree Search), that is developed to utilize the proposed concepts is also presented  

An optimal soft multiple-input multiple-output (MIMO) detector is proposed with linear complexity for a general spatial multiplexing system with two transmitting symbols and NR 2 receiving antennas. The computational complexity of the proposed scheme is independent of the operating signal-to-noise ratio and grows linearly with the constellation order. It provides the soft maximum-likelihood solution using an efficient log-likelihood ratio calculation method, avoiding the exhaustive search on all the candidate nodes. Moreover, an efficient pipelined hardware implementation of the detection algorithm is proposed, which is fabricated and fully tested in a 130-nm CMOS technology. Operating at... 

An area and power efficient high-throughput VLSI implementation of a 4 × 4, 64-QAM soft multiple-input-multiple-output (MIMO) detector, that is suitable for high-order constellation schemes is presented. The proposed MIMO detector utilizes information contained in the discarded paths to improve the bit-error-rate (BER) performance, and then reduces computational complexity using three innovative improvement ideas. The proposed design is fabricated and fully tested in a 130 nm CMOS technology. Operating with a 270 MHz clock, the design achieves up to 655 Mbps throughput with 195 mW power dissipation at 1.32 V supply. Synthesis results in 65 nm CMOS technology shows that the proposed... 

We produced ZnO nanoparticles by high current electrical arc discharge of zinc electrodes in deionized (DI) water. X-ray diffraction (XRD) analysis shows formation of crystalline ZnO phase with hexagonal structure and 14 nm single crystalline domain size. Dynamic light scattering (DLS) result indicates that at 5 A arc current, the size of the particles is about 100 nm and increases by increasing the arc current. Absorption spectroscopy of the samples obtained at different arc currents shows an absorption edge on 370 nm which has a red shift by increasing the arc current. Band gap of the produced ZnO nanoparticles at 5 A arc current corresponds to 3.8 eV which decreases to 3.3 eV by... 

The advent of various real-time multimedia applications in high-speed networks creates a need for quality of service (QoS) based multicast routing. Two important QoS constraints are the bandwidth constraint and the end-to-end delay constraint. The QoS based multicast routing problem is a known NP-complete problem that depends on (1) bounded end-to-end delay and link bandwidth along the paths from the source to each destination, and (2) minimum cost of the multicast tree. In this paper we describe a new representation, called node parent index (NPI) representation, for representing trees and describe harmony operations accord to this representation. The presented algorithm is based on the... 

Clustering is currently one of the most crucial techniques for dealing with massive amount of heterogeneous information on the web, which is beyond human being's capacity to digest. Recent studies have shown that the most commonly used partitioning-based clustering algorithm, the K-means algorithm, is more suitable for large datasets. However, the K-means algorithm can generate a local optimal solution. In this paper we present novel harmony search clustering algorithms that deal with documents clustering based on harmony search optimization method. By modeling clustering as an optimization problem, first, we propose a pure harmony search based clustering algorithm that finds near global... 

This study presents a hybrid harmony search algorithm (HHSA) to solve engineering optimization problems with continuous design variables. Although the harmony search algorithm (HSA) has proven its ability of finding near global regions within a reasonable time, it is comparatively inefficient in performing local search. In this study sequential quadratic programming (SQP) is employed to speed up local search and improve precision of the HSA solutions. Moreover, an empirical study is performed in order to determine the impact of various parameters of the HSA on convergence behavior. Various benchmark engineering optimization problems are used to illustrate the effectiveness and robustness of...