Algoritmos e Arquiteturas VLSI para Detectores MIMO com Decisão Suave

The use of Multiple Input Multiple Output (MIMO) systems has permitted the recent evolution of wireless communication standards. The Spatial Multiplexing MIMO technique, in particular, provides a linear gain at the transmission capacity with the minimum between the numbers of transmit and receive antennas. To obtain a near capacity performance in SM-MIMO systems a soft decision Maximum A Posteriori Probability MIMO detector is necessary. However, such detector is too complex for practical solutions. Hence, the goal of a MIMO detector algorithm aimed for implementation is to get a good approximation of the ideal detector while keeping an acceptable complexity. Moreover, the algorithm needs to be mapped to a VLSI architecture with small area and high data rate. Since Spatial Multiplexing is a recent technique, it is argued that there is still much room for development of related algorithms and architectures. Therefore, this thesis focused on the study of sub optimum algorithms and VLSI architectures for broadband MIMO detector with soft decision. As a result, novel algorithms have been developed starting from proposals of optimizations for already established algorithms. Based on these results, new MIMO detector architectures with configurable modulation and competitive area, performance and data rate parameters are here proposed. The developed algorithms have been extensively simulated and the architectures were synthesized so that the results can serve as a reference for other works in the area

Uma colônia de formigas para o caminho mais curto multiobjetivo

Multi-objective combinatorial optimization problems have peculiar characteristics that require optimization methods to adapt for this context. Since many of these problems are NP-Hard, the use of metaheuristics has grown over the last years. Particularly, many different approaches using Ant Colony Optimization (ACO) have been proposed. In this work, an ACO is proposed for the Multi-objective Shortest Path Problem, and is compared to two other optimizers found in the literature. A set of 18 instances from two distinct types of graphs are used, as well as a specific multiobjective performance assessment methodology. Initial experiments showed that the proposed algorithm is able to generate better approximation sets than the other optimizers for all instances. In the second part of this work, an experimental analysis is conducted, using several different multiobjective ACO proposals recently published and the same instances used in the first part. Results show each type of instance benefits a particular type of instance benefits a particular algorithmic approach. A new metaphor for the development of multiobjective ACOs is, then, proposed. Usually, ants share the same characteristics and only few works address multi-species approaches. This works proposes an approach where multi-species ants compete for food resources. Each specie has its own search strategy and different species do not access pheromone information of each other. As in nature, the successful ant populations are allowed to grow, whereas unsuccessful ones shrink. The approach introduced here shows to be able to inherit the behavior of strategies that are successful for different types of problems. Results of computational experiments are reported and show that the proposed approach is able to produce significantly better approximation sets than other methods

Feature selection through gravitational search algorithm

In this paper we deal with the problem of feature selection by introducing a new approach based on Gravitational Search Algorithm (GSA). The proposed algorithm combines the optimization behavior of GSA together with the speed of Optimum-Path Forest (OPF) classifier in order to provide a fast and accurate framework for feature selection. Experiments on datasets obtained from a wide range of applications, such as vowel recognition, image classification and fraud detection in power distribution systems are conducted in order to asses the robustness of the proposed technique against Principal Component Analysis (PCA), Linear Discriminant Analysis (LDA) and a Particle Swarm Optimization (PSO)-based algorithm for feature selection.

An algorithm for arranging response surface designs in small blocks

We consider the problem of blocking response surface designs when the block sizes are prespecified to control variation efficiently and the treatment set is chosen independently of the block structure. We show how the loss of information due to blocking is related to scores defined by Mead and present an interchange algorithm based on scores to improve a given blocked design. Examples illustrating the performance of the algorithm are given and some comparisons with other designs are made. (C) 2000 Elsevier B.V. B.V. All rights reserved.

A common Tabu search algorithm for the global optimization of engineering problems

A novel common Tabu algorithm for global optimizations of engineering problems is presented. The robustness and efficiency of the presented method are evaluated by using standard mathematical functions and hy solving a practical engineering problem. The numerical results show that the proposed method is (i) superior to the conventional Tabu search algorithm in robustness, and (ii) superior to the simulated annealing algorithm in efficiency. (C) 2001 Elsevier B.V. B.V. All rights reserved.

The Q-D algorithm for transforming series expansions into a corresponding continued fraction: an extension to cope with zero coefficients

An algorithm for deriving a continued fraction that corresponds to two series expansions simultaneously, when there are zero coefficients in one or both series, is given. It is based on using the Q-D algorithm to derive the corresponding fraction for two related series, and then transforming it into the required continued fraction. Two examples are given. (C) 2003 Elsevier B.V. All rights reserved.

Efficient robust optimization based on polynomial chaos and tabu search algorithm

The study of robust design methodologies and techniques has become a new topical area in design optimizations in nearly all engineering and applied science disciplines in the last 10 years due to inevitable and unavoidable imprecision or uncertainty which is existed in real word design problems. To develop a fast optimizer for robust designs, a methodology based on polynomial chaos and tabu search algorithm is proposed. In the methodology, the polynomial chaos is employed as a stochastic response surface model of the objective function to efficiently evaluate the robust performance parameter while a mechanism to assign expected fitness only to promising solutions is introduced in tabu search algorithm to minimize the requirement for determining robust metrics of intermediate solutions. The proposed methodology is applied to the robust design of a practical inverse problem with satisfactory results.

Using genetic algorithm to design protein sequence

In this work, genetic algorithms concepts along with a rotamer library for proteins side chains are used to optimize the tertiary structure of the hydrophobic core of Cytochrome b(562) starting from the known PDB structure of its backbone which is kept fixed while the side chains of the hydrophobic core are allowed to adopt the conformations present in the rotamer library. The atoms of the side chains forming the core interact via van der Waals energy. Besides the prediction of the native core structure, it is also suggested a set of different amino acid sequences for this core. Comparison between these new cores and the native are made in terms of their volumes, van der Waals energies values and the numbers of contacts made by the side chains forming the cores. This paper proves that genetic algorithms area efficient to design new sequence for the protein core. (C) 2007 Elsevier B.V. All rights reserved.

Relaxation algorithm to hyperbolic states in Gross-Pitaevskii equation

A new version of the relaxation algorithm is proposed in order to obtain the stationary ground-state solutions of nonlinear Schrodinger-type equations, including the hyperbolic solutions. In a first example, the method is applied to the three-dimensional Gross-Pitaevskii equation, describing a condensed atomic system with attractive two-body interaction in a non-symmetrical trap, to obtain results for the unstable branch. Next, the approach is also shown to be very reliable and easy to be implemented in a non-symmetrical case that we have bifurcation, with nonlinear cubic and quintic terms. (c) 2006 Elsevier B.V. All rights reserved.

s-wave approximation for asymmetry in nonmesonic decay of finite hypernuclei

We establish the bridge between the commonly used Nabetani-Ogaito-Sato-Kishimoto (NOSK) formula for the asymmetry parameter a(Lambda) in the Lambda p -> np emission of polarized hypernuclei, and the shell-model (SM) formalism for finite hypernuclei. We demonstrate that the s-wave approximation leads to a SM formula for a(Lambda) that is as simple as the NOSK one and that reproduces the exact results for (5)(Lambda)He and (12)(Lambda)C better than initially expected. The simplicity achieved here is indeed remarkable. The new formalism makes the theoretical evaluation of a(Lambda) more transparent and explains clearly why the one-meson exchange model is unable to account for the experimental data of (5)(Lambda)He.

Low-energy direct muon transfer from H to Ne10+, S16+ and Ar18+ using the two-state close-coupling approximation to the Faddeev-Hahn-type equation

We perform a three-body calculation of direct muon-transfer rates from thermalized muonic hydrogen isotopes to bare nuclei Ne10+, S16+ and Ar18+ employing integro-differential Faddeev-Hahn-type equations in configuration space with a two-state close-coupling approximation scheme. All Coulomb potentials including the strong final-state Coulomb repulsion are treated exactly. A long-range polarization potential is included in the elastic channel to take into account the high polarizability of the muonic hydrogen. The transfer rates so-calculated are in good agreement with recent experiments. We find that the muon is captured predominantly in the n = 6, 9 and 10 states of muonic Ne10+, S16+ and Ar18+, respectively.

Finite-volume form factors in semi-classical approximation

A semi-classical approach is used to obtain Lorentz covariant expressions for the form factors between the kink states of a quantum field theory with degenerate vacua. Implemented on a cylinder geometry it provides an estimate of the spectral representation of correlation functions in a finite volume. Illustrative examples of the applicability of the method are provided by the sine-Gordon and the broken phi(4) theories in 1 + 1 dimensions. (C) 2003 Elsevier B.V. All rights reserved.

Algorithm for probing the unitarity of topologically massive models

An uncomplicated and easy handling prescription that converts the task of checking the unitarity of massive, topologically massive, models into a straightforward algebraic exercise, is developed. The algorithm is used to test the unitarity of both topologically massive higher-derivative electromagnetism (TMHDE) and topologically massive higher-derivative gravity (TMHDG). The novel and amazing features of these effective field models are also discussed.

A dynamical gluon mass solution in Mandelstam's approximation

We discuss the pure gauge Schwinger-Dyson equation for the gluon propagator in the Landau gauge within an approximation proposed by Mandelstam many years ago. We show that a dynamical gluon mass arises as a solution. This solution is obtained numerically in the full range of momenta that we have considered without the introduction of any ansatz or asymptotic expression in the infrared region. The vertex function that we use follows a prescription formulated by Cornwall to determine the existence of a dynamical gluon mass in the light cone gauge. The renormalization procedure differs from the one proposed by Mandelstam and allows for the possibility of a dynamical gluon mass. Some of the properties of this solution, such as its dependence on A(QCD) and its perturbative scaling behavior are also discussed.

Ps-He scattering using the three-state positronium close-coupling approximation

A three-state target elastic positronium close-coupling approximation (CCA) is employed to investigate Ps-He scattering in the energy range 0-200 eV with and without electron exchange. Low-lying phase shifts below the first excitation threshold and the total integrated cross sections using both the models are reported. Estimation of integrated excitation cross sections for Ps(1s --> 2s) and Ps(1s --> 2p) using CCA are presented for the first time. The present total cross sections are in good agreement with the measured data in the incident Ps energy range 20-30 eV.