On Training and Training Voids for Receive Antenna Subset Selection in Time-Varying Channels

Antenna selection (AS) provides most of the benefits of multiple-antenna systems at drastically reduced hardware costs. In receive AS, the receiver connects a dynamically selected subset of N available antennas to the L available RF chains. The "best" subset to be used for data reception is determined by means of channel estimates acquired using training sequences. Due to the nature of AS, the channel estimates at different antennas are obtained from different transmissions of the pilot sequence, and are, thus, outdated by different amounts in a time-varying channel. We show that a linear weighting of the estimates is optimum for the subset selection process, where the weights are related to the temporal correlation of the channel variations. When L is not an integer divisor of N, we highlight a new issue of "training voids", in which the last pilot transmission is not fully exploited by the receiver. We present a "void-filling" method for fully exploiting these voids, which essentially provides more accurate training for some antennas, and derive the optimal subset selection rule for any void-filling method. We also derive new closed-form equations for the performance of receive AS with optimal subset selection.

A Complete Characterization of an Optimal Timer Based Selection Scheme

Timer-based mechanisms are often used in several wireless systems to help a given (sink) node select the best helper node among many available nodes. Specifically, a node transmits a packet when its timer expires, and the timer value is a function of its local suitability metric. In practice, the best node gets selected successfully only if no other node's timer expires within a `vulnerability' window after its timer expiry. In this paper, we provide a complete closed-form characterization of the optimal metric-to-timer mapping that maximizes the probability of success for any probability distribution function of the metric. The optimal scheme is scalable, distributed, and much better than the popular inverse metric timer mapping. We also develop an asymptotic characterization of the optimal scheme that is elegant and insightful, and accurate even for a small number of nodes.

On optimal timer-based distributed selection for rate-adaptive multi-user diversity systems

We develop an optimal, distributed, and low feedback timer-based selection scheme to enable next generation rate-adaptive wireless systems to exploit multi-user diversity. In our scheme, each user sets a timer depending on its signal to noise ratio (SNR) and transmits a small packet to identify itself when its timer expires. When the SNR-to-timer mapping is monotone non-decreasing, timers of users with better SNRs expire earlier. Thus, the base station (BS) simply selects the first user whose timer expiry it can detect, and transmits data to it at as high a rate as reliably possible. However, timers that expire too close to one another cannot be detected by the BS due to collisions. We characterize in detail the structure of the SNR-to-timer mapping that optimally handles these collisions to maximize the average data rate. We prove that the optimal timer values take only a discrete set of values, and that the rate adaptation policy strongly influences the optimal scheme's structure. The optimal average rate is very close to that of ideal selection in which the BS always selects highest rate user, and is much higher than that of the popular, but ad hoc, timer schemes considered in the literature.

Glasslike ordering and spatial inhomogeneity of magnetic structure in Ba3FeRu2O9: Role of Fe/Ru site disorder

Several doped 6H hexagonal ruthenates, having the general formula Ba3MRu2O9, have been studied over a significant period of time to understand the unusual magnetism of ruthenium metal. However, among them, the M = Fe compound appears different since it is observed that unlike others, the 3d Fe ions and 4d Ru ions can easily exchange their crystallographic positions, and as a result many possible magnetic interactions become realizable. The present study involving several experimental methods on this compound establishes that the magnetic structure of Ba3FeRu2O9 is indeed very different from all other 6H ruthenates. Local structural study reveals that the possible Fe/Ru site disorder further extends to create local chemical inhomogeneity, affecting the high-temperature magnetism of this material. There is a gradual decrease of Fe-57 Mossbauer spectral intensity with decreasing temperature (below 100 K), which reveals that there is a large spread in the magnetic ordering temperatures, corresponding to many spatially inhomogeneous regions. However, finally at about 25 K, the whole compound is found to take up a global glasslike magnetic ordering.

Training and Voids in Receive Antenna Subset Selection in Time-Varying Channels

Receive antenna selection (AS) provides many benefits of multiple-antenna systems at drastically reduced hardware costs. In it, the receiver connects a dynamically selected subset of N available antennas to the L available RF chains. Due to the nature of AS, the channel estimates at different antennas, which are required to determine the best subset for data reception, are obtained from different transmissions of the pilot sequence. Consequently, they are outdated by different amounts in a time-varying channel. We show that a linear weighting of the estimates is necessary and optimum for the subset selection process, where the weights are related to the temporal correlation of the channel variations. When L is not an integer divisor of N , we highlight a new issue of ``training voids'', in which the last pilot transmission is not fully exploited by the receiver. We then present new ``void-filling'' methods that exploit these voids and greatly improve the performance of AS. The optimal subset selection rules with void-filling, in which different antennas turn out to have different numbers of estimates, are also explicitly characterized. Closed-form equations for the symbol error probability with and without void-filling are also developed.

Design and structural analysis of hairpin-TFO for transcriptional activation of genes in S-cerevisiae

Triplex forming oligonucleotides (TFOs) have the potential to modulate gene expression. While most of the experiments are directed towards triplex mediated inhibition of gene expression the strategy potentially could be used for gene specific activation. In an attempt to design a strategy for gene specific activation in vivo applicable to a large number of genes we have designed a TFO based activator-target system which may be utilized in Saccharomyces cerevisiae or any other system where Gal4 protein is ectopically expressed. The total genome sequence of Saccharomyces cerevisiae and expression profiles were used to select the target genes with upstream poly (pu/py) sequences. We have utilized the paradigm of Gal4 protein and its binding site. We describe here the selection of target genes and design of hairpin-TFO including the targeting sequences containing polypurine stretch found in the upstream promoter regions of weakly expressed genes. We demonstrate, the formation of hairpin-TFO, its binding to Gal4 protein, its ability to form triplex with the target duplex in vitro, the effect of polyethylenimine on complex formation and discuss the implication on in vivo transcription activation.

Machine-tool selection and operation allocation in FMS: solving a fuzzy goal-programming model using a genetic algorithm

The decision-making process for machine-tool selection and operation allocation in a flexible manufacturing system (FMS) usually involves multiple conflicting objectives. Thus, a fuzzy goal-programming model can be effectively applied to this decision problem. The paper addresses application of a fuzzy goal-programming concept to model the problem of machine-tool selection and operation allocation with explicit considerations given to objectives of minimizing the total cost of machining operation, material handling and set-up. The constraints pertaining to the capacity of machines, tool magazine and tool life are included in the model. A genetic algorithm (GA)-based approach is adopted to optimize this fuzzy goal-programming model. An illustrative example is provided and some results of computational experiments are reported.

Structural model for the Cu-B site of dopamine beta-hydroxylase: Crystal structure of a copper(II) complex showing N3OS coordination with an axial sulfur ligation

A copper(II) complex containing a NSO-donor Schiff base and NN-donor 2,2'-bipyridine has been prepared and structurally characterized. The square pyramidal complex with an axial sulfur ligation is a structural model for the CUB site of dopamine-hydroxylase in its oxidized form. The copper(II) complex is catalytically active in the oxidation of ascorbic acid by dioxygen mediated by a copper(I) species which is proposed to have a four-coordinate structure with a N3S coordination geometry.

A gradient PCR-based screen for use in site-directed mutagenesis

Site-directed mutagenesis is widely used to study protein and nucleic acid structure and function. Despite recent advancements in the efficiency of procedures for site-directed mutagenesis, the fraction of site-directed mutants by most procedures rarely exceeds 50% on a routine basis and is never 100%. Hence it is typically necessary to sequence two or three clones each time a site-directed mutant is constructed. We describe a simple and robust gradient-PCR-based screen for distinguishing site-directed mutants from the starting, unmutated plasmid. The procedure can use either purified plasmid DNA or colony PCR, starting from a single colony. The screen utilizes the primer used for mutagenesis and a common outside primer that can be used for all other mutants constructed with the same template. Over 30 site-specific mutants in a variety of templates were successfully screened and all of the mutations detected were subsequently confirmed by DNA sequencing. A single base pair mismatch could be detected in an oligonucleotide of 36 bases. Detection efficiency was relatively independent of starting template concentration and the nature of the outside primer used. (C) 2003 Elsevier Science (USA). All rights reserved.

Performance analysis of TCM with generalized selection combining on Rayleigh fading channels

We derive the computational cutoff rate, R-o, for coherent trellis-coded modulation (TCM) schemes on independent indentically distributed (i.i.d.) Rayleigh fading channels with (K, L) generalized selection combining (GSC) diversity, which combines the K paths with the largest instantaneous signal-to-noise ratios (SNRs) among the L available diversity paths. The cutoff rate is shown to be a simple function of the moment generating function (MGF) of the SNR at the output of the (K, L) GSC receiver. We also derive the union bound on the bit error probability of TCM schemes with (K, L) GSC in the form of a simple, finite integral. The effectiveness of this bound is verified through simulations.