Fast-Group-Decodable STBCs via Codes over GF(4)

In this paper we construct low decoding complexity STBCs by using the Pauli matrices as linear dispersion matrices. In this case the Hurwitz-Radon orthogonality condition is shown to be easily checked by transferring the problem to $\mathbb{F}_4$ domain. The problem of constructing low decoding complexity STBCs is shown to be equivalent to finding certain codes over $\mathbb{F}_4$. It is shown that almost all known low complexity STBCs can be obtained by this approach. New codes are given that have the least known decoding complexity in particular ranges of rate.

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.

Density-matrix renormalization-group study of low-lying excitations of polyacene within a Pariser-Parr-Pople model

We have carried out symmetrized density-matrix renormalization-group calculations to study the nature of excited states of long polyacene oligomers within a Pariser-Parr-Pople Hamiltonian. We have used the C-2 symmetry, the electron-hole symmetry, and the spin parity of the system in our calculations. We find that there is a crossover in the lowest dipole forbidden two-photon state and the lowest dipole allowed excited state with size of the oligomer. In the long system limit, the two-photon state lies below the lowest dipole allowed excited state. The triplet state lies well below the two-photon state and energetically does not correspond to its description as being made up of two triplets. These results are in agreement with the general trends in linear conjugated polymers. However, unlike in linear polyenes wherein the two-photon state is a localized excitation, we find that in polyacenes, the two-photon excitation is spread out over the system. We have doped the systems with a hole and an electron and have calculated the charge excitation gap. Using the charge gap and the optical gap, we estimate the binding energy of the 1(1)B(-) exciton to be 2.09 eV. We have also studied doubly doped polyacenes and find that the bipolaron in these systems, to be composed of two separated polarons, as indicated by the calculated charge-density profile and charge-charge correlation function. We have studied bond orders in various states in order to get an idea of the excited state geometry of the system. We find that the ground state, the triplet state, the dipole allowed state, and the polaron excitations correspond to lengthening of the rung bonds in the interior of the oligomer while the two-photon excitation corresponds to the rung bond lengths having two maxima in the system.

Effect of the sulfonic acid group on copolymers of aniline and toluidine with m-aminobenzene sulfonic acid

This article describes the results of the preparation and characterization of self-doped conducting copolymers of aniline and toluidine with m-aminobenzene sulfonic acid. The copolymers have an intrinsic acid group that is capable of doping polyaniline. Spectroscopic, morphological, and electrical conductivity studies have provided insight into the structural and electronic properties of the copolymers. The differences in the properties of polyaniline and polytoluidine due to the sulfonic acid ring substituent on the phenyl ring are discussed. The scanning electron micrographs of the copolymers reveal regions of sharp-edged, needle-shaped structures, whereas the X-ray diffraction patterns show that the copolymers are relatively more crystalline in nature. (C) 2002 Wiley Periodicals, Inc.

Propargyloxycarbonyl (Poc) amino acid chlorides as efficient coupling reagents for the synthesis of 100% diastereopure peptides and resin bound tetrathiomolybdate as an effective deblocking agent for the Poc group

Synthesis of short peptides using propargyloxycarbonyl amino acid chlorides as effective coupling reagents and polymer supported tetrathiomolybdate as an efficient deblocking agent are reported.

density matrix renormalization group study of polyacene

We study the nature of excited states of long polyacene oligomers within a Pariser-Parr-Pople (PPP) Hamiltonian using the Symmetrized Density Matrix Renormalization Group (SDMRG) technique. We find a crossover between the two-photon state and the lowest dipole allowed excited state as the system size is increased from tetracene to pentacene. The spin-gap is the smallest gap. We also study the equilibrium geome tries in the ground and excited states from bond orders and bond-bond correlation functions. We find that the Peierls instability in the ground state of polyacene is conditional both from energetics and structure factors computed froth correlation functions.

On the Compressibility of non-Abelian-Group Sources in a Distributed Source Coding Setting

We consider the problem of compression of a non-Abelian source.This is motivated by the problem of distributed function computation,where it is known that if one is only interested in computing a function of several sources, then one can often improve upon the compression rate required by the Slepian-Wolf bound. Let G be a non-Abelian group having center Z(G). We show here that it is impossible to compress a source with symbols drawn from G when Z(G) is trivial if one employs a homomorphic encoder and a typical-set decoder.We provide achievable upper bounds on the minimum rate required to compress a non-Abelian group with non-trivial center. Also, in a two source setting, we provide achievable upper bounds for compression of any non-Abelian group, using a non-homomorphic encoder.

Visualizing lone pairs in compounds containing heavier congeners of the carbon and nitrogen group elements

In this mini-review, I discuss some recent work on the stereochemistry and bonding of lone pairs of electrons in divalent compounds of the heavier carbon group elements (SnII, PbII) and in trivalent compounds of the heavier nitrogen group elements (BiIII). Recently developed methods that permit the real-space visualization of bonding patterns on the basis of density functional calculations of electronic structure, reveal details of the nature of s electron lone pairs in compounds of the heavier main group elements – their stereochemistry and their inertness (or lack thereof). An examination of tetragonal P4/nmm SnO, a-PbO and BiOF, and cubic Fm3m PbS provides a segue into perovskite phases of technological significance, including ferroelectric PbTiO3 and antiferroelectric/piezoelectric PbZrO3, in both of which the lone pairs on Pb atoms play a pivotal rôle.

An Adaptive Feature Based Low Power Motion Estimation Algorithm

Motion Estimation is one of the most power hungry operations in video coding. While optimal search (eg. full search)methods give best quality, non optimal methods are often used in order to reduce cost and power. Various algorithms have been used in practice that trade off quality vs. complexity. Global elimination is an algorithm based on pixel averaging to reduce complexity of motion search while keeping performance close to that of full search. We propose an adaptive version of the global elimination algorithm that extracts individual macro-block features using Hadamard transform to optimize the search. Performance achieved is close to the full search method and global elimination. Operational complexity and hence power is reduced by 30% to 45% compared to global elimination method.

A Neuro-Adaptive Approach for Robust Control of High Performance Aircrafts with Parameter Inaccuracies

For high performance aircrafts, the flight control system needs to be quite effective in both assuring accurate tracking of pilot commands, while simultaneously assuring overall stability of the aircraft. In addition, the control system must also be sufficiently robust to cater to possible parameter variations. The primary aim of this paper is to enhance the robustness of the controller for a HPA using neuro-adaptive control design. Here the architecture employs a network of Gaussian Radial basis functions to adaptively compensate for the ignored system dynamics. A stable weight mechanism is determined using Lyapunov theory. The network construction and performance of the resulting controller are illustrated through simulations with a low-fidelity six –DOF model of F16 that is available in open literature.

Continuous-time Single Network Adaptive Critic for Regulator Design of Nonlinear Control Affine Systems

An optimal control law for a general nonlinear system can be obtained by solving Hamilton-Jacobi-Bellman equation. However, it is difficult to obtain an analytical solution of this equation even for a moderately complex system. In this paper, we propose a continuoustime single network adaptive critic scheme for nonlinear control affine systems where the optimal cost-to-go function is approximated using a parametric positive semi-definite function. Unlike earlier approaches, a continuous-time weight update law is derived from the HJB equation. The stability of the system is analysed during the evolution of weights using Lyapunov theory. The effectiveness of the scheme is demonstrated through simulation examples.

Higgs Working Group Summary Report

Report of the Higgs working group for the Workshop "Physics at TeV Colliders", Les Houches, France 8-18 June 1999. It contains 6 separate sections: 1. Measuring Higgs boson couplings at the LHC. 2. Higgs boson production at hadron colliders at NLO. 3. Signatures of Heavy Charged Higgs Bosons at the LHC. 4. Light stop effects and Higgs boson searches at the LHC. 5. Double Higgs production at TeV Colliders in the MSSM. 6. Programs and Tools for Higgs Bosons.

Rhodium Carbenoid Mediated C-H Activation of a Tertiary Methyl Group: An Enantiospecific Approach to the Angular Triquinanes Norsilphiperfolane and Norcameroonanes

An enantiospecific synthesis of the angular triquinane system present in the sesquiterpenes cameroonanes and silphiperfolanes has been accomplished, starting from 5-isopropenyl-2-methylcyclopent-1-ene-1-methanol [readily available in three steps from (R)-limonene] employing an intramolecular rhodium carbenoid insertion into the C-H bond of a tertiary methyl group for the construction of the triquinane system.

On four-group ML decodable distributed space time codes for cooperative communication

A construction of a new family of distributed space time codes (DSTCs) having full diversity and low Maximum Likelihood (ML) decoding complexity is provided for the two phase based cooperative diversity protocols of Jing-Hassibi and the recently proposed Generalized Non-orthogonal Amplify and Forward (GNAF) protocol of Rajan et al. The salient feature of the proposed DSTCs is that they satisfy the extra constraints imposed by the protocols and are also four-group ML decodable which leads to significant reduction in ML decoding complexity compared to all existing DSTC constructions. Moreover these codes have uniform distribution of power among the relays as well as in time. Also, simulations results indicate that these codes perform better in comparison with the only known DSTC with the same rate and decoding complexity, namely the Coordinate Interleaved Orthogonal Design (CIOD). Furthermore, they perform very close to DSTCs from field extensions which have same rate but higher decoding complexity.