Power Minimization for CDMA under Colored Noise

Rate-constrained power minimization (PMIN) over a code division multiple-access (CDMA) channel with correlated noise is studied. PMIN is. shown to be an instance of a separable convex optimization problem subject to linear ascending constraints. PMIN is further reduced to a dual problem of sum-rate maximization (RMAX). The results highlight the underlying unity between PMIN, RMAX, and a problem closely related to PMIN but with linear receiver constraints. Subsequently, conceptually simple sequence design algorithms are proposed to explicitly identify an assignment of sequences and powers that solve PMIN. The algorithms yield an upper bound of 2N - 1 on the number of distinct sequences where N is the processing gain. The sequences generated using the proposed algorithms are in general real-valued. If a rate-splitting and multi-dimensional CDMA approach is allowed, the upper bound reduces to N distinct sequences, in which case the sequences can form an orthogonal set and be binary +/- 1-valued.

Prior image-constrained l(1)-norm-based reconstruction method for effective usage of structural information in diffuse optical tomography

A novel approach that can more effectively use the structural information provided by the traditional imaging modalities in multimodal diffuse optical tomographic imaging is introduced. This approach is based on a prior image-constrained-l(1) minimization scheme and has been motivated by the recent progress in the sparse image reconstruction techniques. It is shown that the proposed framework is more effective in terms of localizing the tumor region and recovering the optical property values both in numerical and gelatin phantom cases compared to the traditional methods that use structural information. (C) 2012 Optical Society of America

Fast Eigen solution for homogeneous quadratic minimization with at most three constraints

We propose an eigenvalue based technique to solve the Homogeneous Quadratic Constrained Quadratic Programming problem (HQCQP) with at most three constraints which arise in many signal processing problems. Semi-Definite Relaxation (SDR) is the only known approach and is computationally intensive. We study the performance of the proposed fast eigen approach through simulations in the context of MIMO relays and show that the solution converges to the solution obtained using the SDR approach with significant reduction in complexity.

Minimization Problems Based on Relative alpha-Entropy II: Reverse Projection

In part I of this two-part work, certain minimization problems based on a parametric family of relative entropies (denoted I-alpha) were studied. Such minimizers were called forward I-alpha-projections. Here, a complementary class of minimization problems leading to the so-called reverse I-alpha-projections are studied. Reverse I-alpha-projections, particularly on log-convex or power-law families, are of interest in robust estimation problems (alpha > 1) and in constrained compression settings (alpha < 1). Orthogonality of the power-law family with an associated linear family is first established and is then exploited to turn a reverse I-alpha-projection into a forward I-alpha-projection. The transformed problem is a simpler quasi-convex minimization subject to linear constraints.

Constrained Linear Spectral Unmixing Technique for Regional Land Cover Mapping Using MODIS Data

Over the last few decades, there has been a significant land cover (LC) change across the globe due to the increasing demand of the burgeoning population and urban sprawl. In order to take account of the change, there is a need for accurate and up-to-date LC maps. Mapping and monitoring of LC in India is being carried out at national level using multi-temporal IRS AWiFS data. Multispectral data such as IKONOS, Landsat-TM/ETM+, IRS-ICID LISS-III/IV, AWiFS and SPOT-5, etc. have adequate spatial resolution (similar to 1m to 56m) for LC mapping to generate 1:50,000 maps. However, for developing countries and those with large geographical extent, seasonal LC mapping is prohibitive with data from commercial sensors of limited spatial coverage. Superspectral data from the MODIS sensor are freely available, have better temporal (8 day composites) and spectral information. MODIS pixels typically contain a mixture of various LC types (due to coarse spatial resolution of 250, 500 and 1000 in), especially in more fragmented landscapes. In this context, linear spectral unmixing would be useful for mapping patchy land covers, such as those that characterise much of the Indian subcontinent. This work evaluates the existing unmixing technique for LC mapping using MODIS data, using end-members that are extracted through Pixel Purity Index (PPI), Scatter plot and N-dimensional visualisation. The abundance maps were generated for agriculture, built up, forest, plantations, waste land/others and water bodies. The assessment of the results using ground truth and a LISS-III classified map shows 86% overall accuracy, suggesting the potential for broad-scale applicability of the technique with superspectral data for natural resource planning and inventory applications. Index Terms-Remote sensing, digital

Minimization of Torque Ripple in PWM AC Drives

A pulsewidth modulation (PWM) technique is proposed for minimizing the rms torque ripple in inverter-fed induction motor drives subject to a given average switching frequency of the inverter. The proposed PWM technique is a combination of optimal continuous modulation and discontinuous modulation. The proposed technique is evaluated both theoretically as well as experimentally and is compared with well-known PWM techniques. It is shown that the proposed method reduces the rms torque ripple by about 30% at the rated speed of the motor drive, compared to conventional space vector PWM.

Reservoir Operation for Hydropower Optimization: A Chance-Constrained Approach

This paper presents a chance-constrained linear programming formulation for reservoir operation of a multipurpose reservoir. The release policy is defined by a chance constraint that the probability of irrigation release in any period equalling or exceeding the irrigation demand is at least equal to a specified value P (called reliability level). The model determines the maximum annual hydropower produced while meeting the irrigation demand at a specified reliability level. The model considers variation in reservoir water level elevation and also the operating range within which the turbine operates. A linear approximation for nonlinear power production function is assumed and the solution obtained within a specified tolerance limit. The inflow into the reservoir is considered random. The chance constraint is converted into its deterministic equivalent using a linear decision rule and inflow probability distribution. The model application is demonstrated through a case study.

A probabilistic constrained nonlinear optimization framework to optimize RED parameters

The random early detection (RED) technique has seen a lot of research over the years. However, the functional relationship between RED performance and its parameters viz,, queue weight (omega(q)), marking probability (max(p)), minimum threshold (min(th)) and maximum threshold (max(th)) is not analytically availa ble. In this paper, we formulate a probabilistic constrained optimization problem by assuming a nonlinear relationship between the RED average queue length and its parameters. This problem involves all the RED parameters as the variables of the optimization problem. We use the barrier and the penalty function approaches for its Solution. However (as above), the exact functional relationship between the barrier and penalty objective functions and the optimization variable is not known, but noisy samples of these are available for different parameter values. Thus, for obtaining the gradient and Hessian of the objective, we use certain recently developed simultaneous perturbation stochastic approximation (SPSA) based estimates of these. We propose two four-timescale stochastic approximation algorithms based oil certain modified second-order SPSA updates for finding the optimum RED parameters. We present the results of detailed simulation experiments conducted over different network topologies and network/traffic conditions/settings, comparing the performance of Our algorithms with variants of RED and a few other well known adaptive queue management (AQM) techniques discussed in the literature.

Left-Handed DNA in Synthetic and Topologically Constrained Form V-DNA

We have investigated structural transitions in Poly(dG-dC) and Poly(dG-Me5dC) in order to understand the exact role of cations in stabilizing left-handed helical structures in specific sequences andthe biological role, if any, of these structures. From a novel temperature dependent transition it has been shown that a minor fluctuation in Na+ concentration at ambient temperature can bring about Β to Ζ transition. Forthe first time, wehave observed a novel double transition in poly(dG-Me5dC) as the Na+ concentration is gradually increased. This suggests that a minor fluctuation in Na+ concentration in conjunction with methylation may transform small stretches of CG sequences from one conformational state to another. These stretches could probably serve as sites for regulation. Supercoiled formV DNA reconstituted from pBR322 and pßG plasmids have been studied as model systems, in order to understand the nature and role of left-handed helical conformation in natural sequences. A large portion of DNA in form V, obtained by reannealing the two complementary singlestranded circles is forced to adopt left-handed double helical structure due to topological constraints (Lk = 0). Binding studies with Z-DNA specific antibody and spectroscopic studies confirm the presence of left-handed Z-structure in the pßG and pßR322 form V DNA. Cobalt hexamine chloride, which induces Z-form in Poly(dG-dC) stabilizes the Z-conformation in form V DNA even in the non-alternating purine-pyrimidine sequences. A reverse effect is observed with ethidium bromide. Interestingly, both topoisomerase I and II (from wheat germ) act effectively on form V DNA to give rise to a species having an electrophoretic mobility on agarose gel similar to that of open circular (form II) DNA. Whether this molecule is formed as a result of the left-handed helical segments of form V DNA undergoing a transition to the right-handed B-form during the topoisomerase action remains to be solved.

Flow of metal in constrained plane-strain extrusion forging- Part II

With many innovations in process technology, forging is establishing itself as a precision manufacturing process: as forging is used to produce complex shapes in difficult materials, it requires dies of complex configuration of high strength and of wear-resistant materials. Extensive research and development work is being undertaken, internationally, to analyse the stresses in forging dies and the flow of material in forged components. Identification of the location, size and shape of dead-metal zones is required for component design. Further, knowledge of the strain distribution in the flowing metal indicates the degree to which the component is being work hardened. Such information is helpful in the selection of process parameters such as dimensional allowances and interface lubrication, as well as in the determination of post-forging operations such as heat treatment and machining. In the presently reported work the effect of aperture width and initial specimen height on the strain distribution in the plane-strain extrusion forging of machined lead billets is observed: the distortion of grids inscribed on the face of the specimen gives the strain distribution. The stress-equilibrium approach is used to optimise a model of flow in extrusion forging, which model is found to be effective in estimating the size of the dead-metal zone. The work carried out so far indicates that the methodology of using the stress-equilibrium approach to develop models of flow in closed-die forging can be a useful tool in component, process and die design.

Stereochemical studies on cyclic peptides. XIII. Energy minimization studies on cyclic hexapeptides having hydrogen bonds

The basic cyclic hexapeptide conformations which accommodate hydrogen bonded β and γ turns in the backbone have been worked out using stereochemical criteria and energy minimization procedures. It was found that cyclic hexapeptides can be made up of all possible combinations of 4 ± 1 hydrogen bonded types I, I', II and II' β turns, giving rise to symmetric conformations having twofold and inversion symmetries as well as nonsymmetric structures. Conformations having exclusive features of 3 ± 1 hydrogen bonded γ turns were found to be possible in threefold and S6 symmetric cyclic hexapeptides. The results show that the cyclic hexapeptides formed by the linking of two β turn tripeptide fragments differ mainly in (a) the hydrogen bonding scheme present in the β turn tripeptides and (b) the conformation at the α-carbon atoms where the two tripeptide fragments link. The different hydrogen bonding schemes found in the component β turns are: 1) a β turn with only a 4 ± 1 hydrogen bond, 2) a type I or I' β turn with 4 ± 1 and 3 ± 1 hydrogen bonds occurring in a bifurcated form and 3) a type II or II' β turn having both the 4 ± 1 and the 3 ± 1 hydrogen bonds with the same acceptor oxygen atom. The conformation at the linking α-carbon atoms was found to lie either in the extended region or in the 3 ± 1 hydrogen bonded γ turn or inverse γ turn regions. Further, the threefold and the S6 symmetric conformations have three γ turns interleaved by three extended regions or three inverse γ turns, respectively. The feasibility of accommodating alanyl residues of both isomeric forms in the CHP minima has been explored. Finally, the available experimental data are reviewed in the light of the present results.

The Alpha-Method Direct Transcription In Path Constrained Dynamic Optimization

Numerically discretized dynamic optimization problems having active inequality and equality path constraints that along with the dynamics induce locally high index differential algebraic equations often cause the optimizer to fail in convergence or to produce degraded control solutions. In many applications, regularization of the numerically discretized problem in direct transcription schemes by perturbing the high index path constraints helps the optimizer to converge to usefulm control solutions. For complex engineering problems with many constraints it is often difficult to find effective nondegenerat perturbations that produce useful solutions in some neighborhood of the correct solution. In this paper we describe a numerical discretization that regularizes the numerically consistent discretized dynamics and does not perturb the path constraints. For all values of the regularization parameter the discretization remains numerically consistent with the dynamics and the path constraints specified in the, original problem. The regularization is quanti. able in terms of time step size in the mesh and the regularization parameter. For full regularized systems the scheme converges linearly in time step size.The method is illustrated with examples.

Strain hardening during constrained deformation of metal foams - Effect of shear displacement

The crush bands that form during plastic deformation of closed-cell metal foams are often inclined at 11-20 degrees to the loading axis, allowing for shear displacement of one part of the foam with respect to the other. Such displacement is prevented by the presence of a lateral constraint. This was analysed in this study, which shows that resistance against shear by the constraint leads to the strain-hardening effect in the foam that has been reported in a recent experimental study. (C) 2009 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

On Bit Steering in the Minimization of the Control Memory of Microprogrammed Processors

The microcommands constituting the microprogram of the control memory of a microprogrammed processor can be partitioned into a number of disjoint sets. Some of these sets are then encoded to minimize the word width of the ROM storing the microprogram. A further reduction in the width of the ROM words can be achieved by a technique known as bit steering where one or more bits are shared by two or more sets of microcommands. These sets are called the steerable sets. This correspondence presents a simple method for the detection and encoding of steerable sets. It has been shown that the concurrency matrix of two steerable sets exhibits definite patterns of clusters which can be easily recognized. A relation "connection" has been defined which helps in the detection of three-set steerability. Once steerable sets are identified, their encoding becomes a straightforward procedure following the location of the identifying clusters on the concurrency matrix or matrices.

Constrained linear minimax filter for systems with large plant uncertainties

This paper presents a method of designing a minimax filter in the presence of large plant uncertainties and constraints on the mean squared values of the estimates. The minimax filtering problem is reformulated in the framework of a deterministic optimal control problem and the method of solution employed, invokes the matrix Minimum Principle. The constrained linear filter and its relation to singular control problems has been illustrated. For the class of problems considered here it is shown that the filter can he constrained separately after carrying out the mini maximization. Numorieal examples are presented to illustrate the results.