Search results for "COD"

Feedback Biasing Based Adjustable Gain Ultrasound Preamplifier for CMUTs in 45nm CMOS

2018

As CMOS technology is scaled down, supply voltages are decreasing and intrinsic gain of the nanoscale CMOS transistors is dropping while the threshold voltages of transistors are remaining relatively constant. In such scaled down nanoscale CMOS technologies, conventional vertical stacking architectures (for example. cascode architectures) for high-gain becomes no more attractive. In this paper we present the analysis and design of a feedback biasing based adjustable gain ultrasound preamplifier which is capable of amplifying signals from 15 MHz to 45 MHz from Capacitive Micromachined Ultrasound Transducers (CMUTs) in 45nm CMOS technology for medical ultrasound imaging applications. From the…

Novel Methodologies to Model Charge Transport in Metal-Air Batteries

2018

Resource allocation for OFDMA systems with multi-cell joint transmission

2012

This paper considers the downlink resource allocation of a coordinated multi-cell cluster in OFDMA systems with universal frequency reuse. Multi-cell joint transmission is considered via zero-forcing precoding. Furthermore, joint optimization of the user selection and power allocation across multiple subchannels and multiple cells is studied. The objective is to maximize the weighted sum rate under per-base-station power constraints. Based on general duality theory, two iterative resource allocation algorithms are proposed and compared with the optimal solution, which requires an exhaustive search of all possible combinations of users over all subchannels. Simulation results show that the t…

Combined K-Best sphere decoder based on the channel matrix condition number

2008

It is known that sphere decoding (SD) methods can provide maximum-likelihood (ML) detection over Gaussian MIMO channels with lower complexity than the exhaustive search. Channel matrix condition number represents an important influence on the performance of usual detectors. Throughout this paper, two particular cases of a SD method called K-Best carry out a combined detection in order to reduce the computational complexity with predictable performance degradation. Algorithm selection is based on channel matrix condition number thresholding. K-Best is a suboptimal SD algorithm for finding the ML solution of a detection problem. It is based on a fixed complexity tree search, set by a paramete…

Partial joint processing with efficient backhauling using particle swarm optimization

2012

In cellular communication systems with frequency reuse factor of one, user terminals (UT) at the cell-edge are prone to intercell interference. Joint processing is one of the coordinated multipoint transmission techniques proposed to mitigate this interference. In the case of centralized joint processing, the channel state information fed back by the users need to be available at the central coordination node for precoding. The precoding weights (with the user data) need to be available at the corresponding base stations to serve the UTs. These increase the backhaul traffic. In this article, partial joint processing (PJP) is considered as a general framework that allows reducing the amount …

Implementing some Evolutionary Computing Methods for Determining the Optimal Parameters in the Turning Process

2015

In this paper, we comparatively present two heuristics search methods – Simulated Annealing and Weighted Sum Genetic Algorithm, in order to find optimal cutting parameters in turning operation. We consider five different constraints aiming to achieve minimum total cost of machining. We developed a customizable software application in Microsoft Visual Studio with C# source code, flexible and extensible that implements the optimization methods. The experiments are based on real data gathered from S.C. “Compa” S.A Sibiu, a company that manufactures automotive components and targets improving of product quality and reducing cost and production time. The obtained results show that, although the …

A hybrid genetic algorithm with local search: I. Discrete variables: optimisation of complementary mobile phases

2001

Abstract A hybrid genetic algorithm was developed for a combinatorial optimisation problem. The assayed hybridation modifies the reproduction pattern of the genetic algorithm through the application of a local search method, which enhances each individual in each generation. The method is applied to the optimisation of the mobile phase composition in liquid chromatography, using two or more mobile phases of complementary behaviour. Each of these phases concerns the optimal separation of certain compounds in the analysed mixture, while the others can remain overlapped. This optimisation approach may be useful in situations where full resolution with a single mobile phase is unfeasible. The o…

Energy-efficient resource allocation for OFDMA two-way relay networks with imperfect CSI

2015

Most of the existed works on the radio resource allocation (RRA) problem commonly assume the channel-state information (CSI) can be perfectly obtained by the transmission source. However, such assumption is not practical in the realistic wireless systems. In this work, we consider the practical implementation issues of resource allocation in orthogonal frequency division multiple access (OFDMA) two-way relay networks: the inaccuracy of channel-state information (CSI) available to the source. Instead, only the estimated channel status is known by the source. In this context, a joint optimization of subcarrier pairing and allocation, relay selection, and transmit power allocation is formulate…

Counting and equidistribution in Heisenberg groups

2014

We strongly develop the relationship between complex hyperbolic geometry and arithmetic counting or equidistribution applications, that arises from the action of arithmetic groups on complex hyperbolic spaces, especially in dimension $2$. We prove a Mertens' formula for the integer points over a quadratic imaginary number fields $K$ in the light cone of Hermitian forms, as well as an equidistribution theorem of the set of rational points over $K$ in Heisenberg groups. We give a counting formula for the cubic points over $K$ in the complex projective plane whose Galois conjugates are orthogonal and isotropic for a given Hermitian form over $K$, and a counting and equidistribution result for …

Codimensions of algebras and growth functions

2008

Abstract Let A be an algebra over a field F of characteristic zero and let c n ( A ) , n = 1 , 2 , … , be its sequence of codimensions. We prove that if c n ( A ) is exponentially bounded, its exponential growth can be any real number >1. This is achieved by constructing, for any real number α > 1 , an F-algebra A α such that lim n → ∞ c n ( A α ) n exists and equals α. The methods are based on the representation theory of the symmetric group and on properties of infinite Sturmian and periodic words.