Fabrication and evaluation of 1 Ah silver/metal hydride cells

Silver/metal hydride (Ag/MH) cells of about 1 Ah capacity have been fabricated and their discharge characteristics at different rates of discharge, faradaic efficiency, cycle life and a.c. impedance have been evaluated. These cells comprise metal-hydride electrodes prepared by employing similar to 60 mu m powder of an AB(2)-Laves phase alloy of nominal composition Zr0.5Ti0.5V0.6Cr0.2Ni1.2 with PTFE binder on a nickel-mesh substrate as the negative plates and commercial-grade silver electrodes as the positive plates. The cells are positive limited and exhibit two distinct voltage plateaus characteristic of two-step reduction of AgO to Ag during their low rates of discharge between C/20 and C/10. This feature is, however, absent when the cells are discharged at C/5 rate. On charging the cells to 100% of their capacity, the faradaic efficiency is found to be 100%. The impedance of the Ag/MH cell is essentially due to the impedance of the silver electrodes, since MH electrodes offer negligible impedance. The cells may be subjected to a large number of charge-discharge cycles with little deterioration.

The Parallel Complexity Of Propagation In Boolean Circuits

We consider the problem of deciding whether the output of a boolean circuit is determined by a partial assignment to its inputs. This problem is easily shown to be hard, i.e., co-Image Image -complete. However, many of the consequences of a partial input assignment may be determined in linear time, by iterating the following step: if we know the values of some inputs to a gate, we can deduce the values of some outputs of that gate. This process of iteratively deducing some of the consequences of a partial assignment is called propagation. This paper explores the parallel complexity of propagation, i.e., the complexity of determining whether the output of a given boolean circuit is determined by propagating a given partial input assignment. We give a complete classification of the problem into those cases that are Image -complete and those that are unlikely to be Image complete.

Reduced complexity two stage vector quantization

We address the issue of complexity for vector quantization (VQ) of wide-band speech LSF (line spectrum frequency) parameters. The recently proposed switched split VQ (SSVQ) method provides better rate-distortion (R/D) performance than the traditional split VQ (SVQ) method, even at the requirement of lower computational complexity. but at the expense of much higher memory. We develop the two stage SVQ (TsSVQ) method, by which we gain both the memory and computational advantages and still retain good R/D performance. The proposed TsSVQ method uses a full dimensional quantizer in its first stage for exploiting all the higher dimensional coding advantages and then, uses an SVQ method for quantizing the residual vector in the second stage so as to reduce the complexity. We also develop a transform domain residual coding method in this two stage architecture such that it further reduces the computational complexity. To design an effective residual codebook in the second stage, variance normalization of Voronoi regions is carried out which leads to the design of two new methods, referred to as normalized two stage SVQ (NTsSVQ) and normalized two stage transform domain SVQ (NTsTrSVQ). These two new methods have complimentary strengths and hence, they are combined in a switched VQ mode which leads to the further improvement in R/D performance, but retaining the low complexity requirement. We evaluate the performances of new methods for wide-band speech LSF parameter quantization and show their advantages over established SVQ and SSVQ methods.

A measure of logical complexity of programs

The research in software science has so far been concentrated on three measures of program complexity: (a) software effort; (b) cyclomatic complexity; and (c) program knots. In this paper we propose a measure of the logical complexity of programs in terms of the variable dependency of sequence of computations, inductive effort in writing loops and complexity of data structures. The proposed complexity mensure is described with the aid of a graph which exhibits diagrammatically the dependence of a computation at a node upon the computation of other (earlier) nodes. Complexity measures of several example programs have been computed and the related issues have been discussed. The paper also describes the role played by data structures in deciding the program complexity.

Complexity Reduction In A Telephone Switching-System

This paper review the some of the recent developments in Complexity theory as applied to telephone-switching. Some of these techniques are suitable for practical implementation in India.

Holographic methods for the fabrication of various types of mirrors

A comprehensive set of new configurations for the holographic simulation of a wide variety of mirrors is described. These holographically simulated mirrors (HSMs) have been experimentally realized and their imaging performance has been studied.

Electron-Energy Loss Spectroscopy (Eels) Of Organic-Molecules In Vapor-Phase - Design And Fabrication Of An Indigenous Eel Spectrometer

An indigenous electron energy loss spectrometer has been designed and fabricated for the study of free molecules. The spectrometer enables the recording of low-resolution electronic spectra of molecules inthe vapour phase with ready access to the vacuum ultraviolet region. Electron energy loss spectra of aliphatic alcohols and carbonyl compounds as wellas of benzene derivatives have been recorded with the indigenous spectrometer and the electronic transitions in these molecules discussed.

Complexity analysis of EEG in patients with schizophrenia using fractal dimension

We computed Higuchi's fractal dimension (FD) of resting, eyes closed EEG recorded from 30 scalp locations in 18 male neuroleptic-naive, recent-onset schizophrenia (NRS) subjects and 15 male healthy control (HC) subjects, who were group-matched for age. Schizophrenia patients showed a diffuse reduction of FD except in the bilateral temporal and occipital regions, with the reduction being most prominent bifrontally. The positive symptom (PS) schizophrenia subjects showed FD values similar to or even higher than HC in the bilateral temporo-occipital regions, along with a co-existent bifrontal FD reduction as noted in the overall sample of NRS. In contrast, this increase in FD values in the bilateral temporo-occipital region was absent in the negative symptom (NS) subgroup. The regional differences in complexity suggested by these findings may reflect the aberrant brain dynamics underlying the pathophysiology of schizophrenia and its symptom dimensions. Higuchi's method of measuring FD directly in the time domain provides an alternative for the more computationally intensive nonlinear methods of estimating EEG complexity.

Normalized Two Stage SVQ for Minimum Complexity Wide-band LSF Quantization

We develop a two stage split vector quantization method with optimum bit allocation, for achieving minimum computational complexity. This also results in much lower memory requirement than the recently proposed switched split vector quantization method. To improve the rate-distortion performance further, a region specific normalization is introduced, which results in 1 bit/vector improvement over the typical two stage split vector quantizer, for wide-band LSF quantization.

Low Complexity LID using Pruned Pattern Tables of LZW

We present two discriminative language modelling techniques for Lempel-Ziv-Welch (LZW) based LID system. The previous approach to LID using LZW algorithm was to directly use the LZW pattern tables forlanguage modelling. But, since the patterns in a language pattern table are shared by other language pattern tables, confusability prevailed in the LID task. For overcoming this, we present two pruning techniques (i) Language Specific (LS-LZW)-in which patterns common to more than one pattern table are removed. (ii) Length-Frequency product based (LF-LZW)-in which patterns having their length-frequency product below a threshold are removed. These approaches reduce the classification score (Compression Ratio [LZW-CR] or the weighted discriminant score [LZW-WDS]) for non native languages and increases the LID performance considerably. Also the memory and computational requirements of these techniques are much less compared to basic LZW techniques.

Fabrication and Phase Transformation in Crystalline Nanoparticles of PbZrO3 Derived By Sol-Gel

In this research fabrication of crystalline PbZrO3 (PZ) nanoparticles and their phase transformation behavior is investigated. A novel sol-gel method was used for the synthesis of air-stable and precipitate-free diol-based sol of PZ, which was dried at 150 degrees C and then calcined at 300-700 degrees C for 1 h. The morphology, crystallinity and phase formation of as synthesized nanoparticles were studied by the selected-area electron diffraction (SAED), X-ray diffraction (XRD), thermal gravimetric analysis/differential scanning calorimetry (TGA-DSC), and high resolution transmission electron microscope (HRTEM). The XRD, SAED, and TGA-DSC analyses confirmed the tetragonal lead rich zirconia phase (t-Z phase) and monoclinic zirconia phase (m-Z phase) as the intermediate phases during the calcinations process followed by crystallization of single orthorhombic PZ phase at about 700 degrees C. The average PZ particle size was observed about 20 nm as confirmed by TEM study. Energy-dispersive X-ray spectroscopy (EDX) analysis demonstrated that stoichiometric PbZrO3 was formed.

Fabrication and mechanisms of densification of ZrB2-based ultra high temperature ceramics by reactive hot pressing

Dense ZrB2-SiC (25-30 vol%) composites have been produced by reactive hot pressing using stoichiometric Zr, B4C, C and Si powder mixtures with and without Ni addition at 40 MPa, 1600 degrees C for 60 min. Nickel, a common additive to promote densification, is shown not to be essential; the presence of an ultra-fine microstructure containing a transient plastic ZrC phase is suggested to play a key role at low temperatures, while a transient liquid phase may be responsible at temperatures above 1350 degrees C. Hot Pressing of non-stoichiometric mixture of Zr, B4C and Si at 40 MPa, 1600 degrees C for 30 min resulted in ZrB2-ZrCx-SiC (15 vol%) composites of similar to 98% RD.

Low ML-Decoding Complexity, Large Coding Gain, Full-Rate, Full-Diversity STBCs for 2 x 2 and 4 x 2 MIMO Systems

This paper deals with low maximum-likelihood (ML)-decoding complexity, full-rate and full-diversity space-time block codes (STBCs), which also offer large coding gain, for the 2 transmit antenna, 2 receive antenna (2 x 2) and the 4 transmit antenna, 2 receive antenna (4 x 2) MIMO systems. Presently, the best known STBC for the 2 2 system is the Golden code and that for the 4 x 2 system is the DjABBA code. Following the approach by Biglieri, Hong, and Viterbo, a new STBC is presented in this paper for the 2 x 2 system. This code matches the Golden code in performance and ML-decoding complexity for square QAM constellations while it has lower ML-decoding complexity with the same performance for non-rectangular QAM constellations. This code is also shown to be information-lossless and diversity-multiplexing gain (DMG) tradeoff optimal. This design procedure is then extended to the 4 x 2 system and a code, which outperforms the DjABBA code for QAM constellations with lower ML-decoding complexity, is presented. So far, the Golden code has been reported to have an ML-decoding complexity of the order of for square QAM of size. In this paper, a scheme that reduces its ML-decoding complexity to M-2 root M is presented.

High-Rate Space-Time Coded Large-MIMO Systems: Low-Complexity Detection and Channel Estimation

In this paper, we present a low-complexity algorithm for detection in high-rate, non-orthogonal space-time block coded (STBC) large-multiple-input multiple-output (MIMO) systems that achieve high spectral efficiencies of the order of tens of bps/Hz. We also present a training-based iterative detection/channel estimation scheme for such large STBC MIMO systems. Our simulation results show that excellent bit error rate and nearness-to-capacity performance are achieved by the proposed multistage likelihood ascent search (M-LAS) detector in conjunction with the proposed iterative detection/channel estimation scheme at low complexities. The fact that we could show such good results for large STBCs like 16 X 16 and 32 X 32 STBCs from Cyclic Division Algebras (CDA) operating at spectral efficiencies in excess of 20 bps/Hz (even after accounting for the overheads meant for pilot based training for channel estimation and turbo coding) establishes the effectiveness of the proposed detector and channel estimator. We decode perfect codes of large dimensions using the proposed detector. With the feasibility of such a low-complexity detection/channel estimation scheme, large-MIMO systems with tens of antennas operating at several tens of bps/Hz spectral efficiencies can become practical, enabling interesting high data rate wireless applications.

A Low-Complexity Near-ML Performance Achieving Algorithm for Large MIMO Detection

In this paper, we present a low-complexity, near maximum-likelihood (ML) performance achieving detector for large MIMO systems having tens of transmit and receive antennas. Such large MIMO systems are of interest because of the high spectral efficiencies possible in such systems. The proposed detection algorithm, termed as multistage likelihood-ascent search (M-LAS) algorithm, is rooted in Hopfield neural networks, and is shown to possess excellent performance as well as complexity attributes. In terms of performance, in a 64 x 64 V-BLAST system with 4-QAM, the proposed algorithm achieves an uncoded BER of 10(-3) at an SNR of just about 1 dB away from AWGN-only SISO performance given by Q(root SNR). In terms of coded BER, with a rate-3/4 turbo code at a spectral efficiency of 96 bps/Hz the algorithm performs close to within about 4.5 dB from theoretical capacity, which is remarkable in terms of both high spectral efficiency as well as nearness to theoretical capacity. Our simulation results show that the above performance is achieved with a complexity of just O(NtNt) per symbol, where N-t and N-tau denote the number of transmit and receive antennas.