Asymptotically-Optimal, Fast-Decodable, Full-Diversity STBCs

For a family/sequence of Space-Time Block Codes (STBCs) C1, C2,⋯, with increasing number of transmit antennas Ni, with rates Ri complex symbols per channel use (cspcu), i = 1,2,⋯, the asymptotic normalized rate is defined as limi→∞ Ri/Ni. A family of STBCs is said to be asymptotically-good if the asymptotic normalized rate is non-zero, i.e., when the rate scales as a non-zero fraction of the number of transmit antennas, and the family of STBCs is said to be asymptotically-optimal if the asymptotic normalized rate is 1, which is the maximum possible value. In this paper, we construct a new class of full-diversity STBCs that have the least maximum-likelihood (ML) decoding complexity among all known codes for any number of transmit antennas N>;1 and rates R>;1 cspcu. For a large set of (R,N) pairs, the new codes have lower ML decoding complexity than the codes already available in the literature. Among the new codes, the class of full-rate codes (R=N) are asymptotically-optimal and fast-decodable, and for N>;5 have lower ML decoding complexity than all other families of asymptotically-optimal, fast-decodable, full-diversity STBCs available in the literature. The construction of the new STBCs is facilitated by the following further contributions of this paper: (i) Construction of a new class of asymptotically-good, full-diversity multigroup ML decodable codes, that not only includes STBCs for a larger set of antennas, but also either matches in rate or contains as a proper subset all other high-rate or asymptotically-good, delay-optimal, multigroup ML decodable codes available in the literature. (ii) Construction of a new class of fast-group-decodable codes (codes that combine the low ML decoding complexity properties of multigroup ML decodable codes and fast-decodable codes) for all even number of transmit antennas and rates 1 <; R ≤ 5/4.- - (iii) Given a design with full-rank linear dispersion matrices, we show that a full-diversity STBC can be constructed from this design by encoding the real symbols independently using only regular PAM constellations.

Fast Direct Torque Control of an Open-End Induction Motor Drive Using 12-Sided Polygonal Voltage Space Vectors

A torque control scheme, based on a direct torque control (DTC) algorithm using a 12-sided polygonal voltage space vector, is proposed for a variable speed control of an open-end induction motor drive. The conventional DTC scheme uses a stator flux vector for the sector identification and then the switching vector to control stator flux and torque. However, the proposed DTC scheme selects switching vectors based on the sector information of the estimated fundamental stator voltage vector and its relative position with respect to the stator flux vector. The fundamental stator voltage estimation is based on the steady-state model of IM and the synchronous frequency of operation is derived from the computed stator flux using a low-pass filter technique. The proposed DTC scheme utilizes the exact positions of the fundamental stator voltage vector and stator flux vector to select the optimal switching vector for fast control of torque with small variation of stator flux within the hysteresis band. The present DTC scheme allows full load torque control with fast transient response to very low speeds of operation, with reduced switching frequency variation. Extensive experimental results are presented to show the fast torque control for speed of operation from zero to rated.

NMR methods for fast data acquisition

NMR spectroscopy has witnessed tremendous advancements in recent years with the development of new methodologies for structure determination and availability of high-field strength spectrometers equipped with cryogenic probes. Supported by these advancements, a new dimension in NMR research has emerged which aims to increase the speed with data is collected and analyzed. Several novel methodologies have been proposed in this direction. This review focuses on the principles on which these different approaches are based with an emphasis on G-matrix Fourier transform NMR spectroscopy.

Fast Robust Pattern Classification Algorithms for Real Time Neuro-Motor Prosthetic Applications

In this paper, we give a brief review of pattern classification algorithms based on discriminant analysis. We then apply these algorithms to classify movement direction based on multivariate local field potentials recorded from a microelectrode array in the primary motor cortex of a monkey performing a reaching task. We obtain prediction accuracies between 55% and 90% using different methods which are significantly above the chance level of 12.5%.

A simple and fast scheme for code compression for VLIW processors

Summary form only given. A scheme for code compression that has a fast decompression algorithm, which can be implemented using simple hardware, is proposed. The effectiveness of the scheme on the TMS320C62x architecture that includes the overheads of a line address table (LAT) is evaluated and obtained compression rates ranging from 70% to 80%. Two schemes for decompression are proposed. The basic idea underlying the scheme is a simple clustering algorithm that partially maps a block of instructions into a set of clusters. The clustering algorithm is a greedy algorithm based on the frequency of occurrence of various instructions.

Fast algorithms for frequent episode discovery in event sequences

In this paper we consider the process of discovering frequent episodes in event sequences. The most computationally intensive part of this process is that of counting the frequencies of a set of candidate episodes. We present two new frequency counting algorithms for speeding up this part. These, referred to as non-overlapping and non-inteleaved frequency counts, are based on directly counting suitable subsets of the occurrences of an episode. Hence they are different from the frequency counts of Mannila et al [1], where they count the number of windows in which the episode occurs. Our new frequency counts offer a speed-up factor of 7 or more on real and synthetic datasets. We also show how the new frequency counts can be used when the events in episodes have time-durations as well.

An Opportunistic, Fast, and Distributed Subchannel and User-Pairing Algorithm for OFDMA

Channel-aware assignment of subchannels to users in the downlink of an OFDMA system requires extensive feedback of channel state information (CSI) to the base station. Since bandwidth is scarce, schemes that limit feedback are necessary. We develop a novel, low feedback, distributed splitting-based algorithm called SplitSelect to opportunistically assign each subchannel to its most suitable user. SplitSelect explicitly handles multiple access control aspects associated with CSI feedback, and scales well with the number of users. In it, according to a scheduling criterion, each user locally maintains a scheduling metric for each subchannel. The goal is to select, for each subchannel, the user with the highest scheduling metric. At any time, each user contends for the subchannel for which it has the largest scheduling metric among the unallocated subchannels. A tractable asymptotic analysis of a system with many users is central to SplitSelect's simple design. Extensive simulation results demonstrate the speed with which subchannels and users are paired. The net data throughput, when the time overhead of selection is accounted for, is shown to be substantially better than several schemes proposed in the literature. We also show how fairness and user prioritization can be ensured by suitably defining the scheduling metric.

Jatropha cultivation in southern India: assessing farmers' experiences

Together with 106 farmers who started growing Jatropha (Jatropha curcas L.) in 20042006, this research sought to increase the knowledge around the real-life experience of Jatropha farming in the southern India states of Tamil Nadu and Andhra Pradesh. Launched as an alternative for diesel in India, Jatropha has been promoted as a non-edible plant that could grow on poor soils, yield oil-rich seeds for production of bio-diesel, and not compete directly with food production. Through interviews with the farmers, information was gathered regarding their socio-economic situation, the implementation and performance of their Jatropha plantations, and their reasons for continuing or discontinuing Jatropha cultivation. Results reveal that 82% of the farmers had substituted former cropland for their Jatropha cultivation. By 2010, 85% (n = 90) of the farmers who cultivated Jatropha in 2004 had stopped. Cultivating the crop did not give the economic returns the farmers anticipated, mainly due to a lack of information about the crop and its maintenance during cultivation and due to water scarcity. A majority of the farmers irrigated and applied fertilizer, and even pesticides. Many problems experienced by the farmers were due to limited knowledge about cultivating Jatropha caused by poor planning and implementation of the national Jatropha program. Extension services, subsidies, and other support were not provided as promised. The farmers who continued cultivation had means of income other than Jatropha and held hopes of a future Jatropha market. The lack of market structures, such as purchase agreements and buyers, as well as a low retail price for the seeds, were frequently stated as barriers to Jatropha cultivation. For Jatropha biodiesel to perform well, efforts are needed to improve yield levels and stability through genetic improvements and drought tolerance, as well as agriculture extension services to support adoption of the crop. Government programs will -probably be more effective if implementing biodiesel production is conjoined with stimulating the demand for Jatropha biodiesel. To avoid food-biofuel competition, additional measures may be needed such as land-use restrictions for Jatropha producers and taxes on biofuels or biofuel feedstocks to improve the competitiveness of the food sector compared to the bioenergy sector. (c) 2012 Society of Chemical Industry and John Wiley & Sons, Ltd

Human action recognition using a fast learning fully complex-valued classifier

In this paper, we use optical flow based complex-valued features extracted from video sequences to recognize human actions. The optical flow features between two image planes can be appropriately represented in the Complex plane. Therefore, we argue that motion information that is used to model the human actions should be represented as complex-valued features and propose a fast learning fully complex-valued neural classifier to solve the action recognition task. The classifier, termed as, ``fast learning fully complex-valued neural (FLFCN) classifier'' is a single hidden layer fully complex-valued neural network. The neurons in the hidden layer employ the fully complex-valued activation function of the type of a hyperbolic secant function. The parameters of the hidden layer are chosen randomly and the output weights are estimated as the minimum norm least square solution to a set of linear equations. The results indicate the superior performance of FLFCN classifier in recognizing the actions compared to real-valued support vector machines and other existing results in the literature. Complex valued representation of 2D motion and orthogonal decision boundaries boost the classification performance of FLFCN classifier. (c) 2012 Elsevier B.V. All rights reserved.

Coexistence of fast photodarkening and slow photobleaching in Ge19As21Se60 thin films

We experimentally demonstrate the coexistence of two opposite photo-effects, viz. fast photodarkening (PD) and slow photobleaching (PB) in Ge19As21Se60 thin films, when illuminated with a laser of wavelength 671 nm. PD appears to begin instantaneously upon light illumination and saturates in tens of seconds. By comparison, PB is a slower process that starts only after PD has saturated. Both PD and PB follow stretched exponetial dependence on time. Modeling of overall change as a linear sum of two contributions suggests that the changes in As and Ge parts of glass network respond to light effectively indepndent of each other. (C) 2012 Optical Society of America

AIWIN - A fast and jigless inspection technique for machined parts

Precision inspection of manufactured components having multiple complex surfaces and variable tolerance definition is an involved, complex and time-consuming function. In routine practice, a jig is used to present the part in a known reference frame to carry out the inspection process. Jigs involve both time and cost in their development, manufacture and use. This paper describes 'as is where is inspection' (AIWIN), a new automated inspection technique that accelerates the inspection process by carrying out a fast registration procedure and establishing a quick correspondence between the part to inspect and its CAD geometry. The main challenge in doing away with a jig is that the inspection reference frame could be far removed from the CAD frame. Traditional techniques based on iterative closest point (ICP) or Newton methods require either a large number of iterations for convergence or fail in such a situation. A two-step coarse registration process is proposed to provide a good initial guess for a modified ICP algorithm developed earlier (Ravishankar et al., Int J Adv Manuf Technol 46(1-4):227-236, 2010). The first step uses a calibrated sphere for local hard registration and fixing the translation error. This transformation locates the centre for the sphere in the CAD frame. In the second step, the inverse transformation (involving pure rotation about multiple axes) required to align the inspection points measured on the manufactured part with the CAD point dataset of the model is determined and enforced. This completes the coarse registration enabling fast convergence of the modified ICP algorithm. The new technique has been implemented on complex freeform machined components and the inspection results clearly show that the process is precise and reliable with rapid convergence. © 2011 Springer-Verlag London Limited.

Identification of Early Biomarkers during Acetaminophen-Induced Hepatotoxicity by Fourier Transform Infrared Microspectroscopy

Acetaminophen is a widely prescribed drug used to relieve pain and fever; however, it is a leading cause of drug-induced liver injury and a burden on public healthcare. In this study, hepatotoxicity in mice post oral dosing of acetaminophen was investigated using liver and sera samples with Fourier Transform Infrared microspectroscopy. The infrared spectra of acetaminophen treated livers in BALB/ mice show decrease in glycogen, increase in amounts of cholesteryl esters and DNA respectively. Rescue experiments using L-methionine demonstrate that depletion in glycogen and increase in DNA are abrogated with pre-treatment, but not post-treatment, with L-methionine. This indicates that changes in glycogen and DNA are more sensitive to the rapid depletion of glutathione. Importantly, analysis of sera identified lowering of glycogen and increase in DNA and chlolesteryl esters earlier than increase in alanine aminotransferase, which is routinely used to diagnose liver damage. In addition, these changes are also observed in C57BL/6 and Nos2(-/-) mice. There is no difference in the kinetics of expression of these three molecules in both strains of mice, the extent of damage is similar and corroborated with ALT and histological analysis. Quantification of cytokines in sera showed increase upon APAP treatment. Although the levels of Tnf alpha and Ifn gamma in sera are not significantly affected, Nos2(-/-) mice display lower Il6 but higher Il10 levels during this acute model of hepatotoxicity. Overall, this study reinforces the growing potential of Fourier Transform Infrared microspectroscopy as a fast, highly sensitive and label-free technique for non-invasive diagnosis of liver damage. The combination of Fourier Transform Infrared microspectroscopy and cytokine analysis is a powerful tool to identify multiple biomarkers, understand differential host responses and evaluate therapeutic regimens during liver damage and, possibly, other diseases.

High field carrier transport in graphene: Insights from fast current transient

In this work, we observe gate tunable negative differential conductance (NDC) and current saturation in single layer and bilayer graphene transistor at high source-drain field, which arise due to the interplay among (1) self-heating, (2) hot carrier injection, and (3) drain induced minority carrier injection. The magnitude of the NDC is found to be reduced for a bilayer, in agreement with its weaker carrier-optical phonon coupling and less efficient hot carrier injection. The contributions of different mechanisms to the observed results are decoupled through fast transient measurements with nanosecond resolution. The findings provide insights into high field transport in graphene. (C) 2012 American Institute of Physics. http://dx.doi.org/10.1063/1.4754103]