Ultrasound-modulated optical tomography: recovery of amplitude of vibration in the insonified region from boundary measurement of light correlation

We address a certain inverse problem in ultrasound-modulated optical tomography: the recovery of the amplitude of vibration of scatterers [p(r)] in the ultrasound focal volume in a diffusive object from boundary measurement of the modulation depth (M) of the amplitude autocorrelation of light [phi(r, tau)] traversing through it. Since M is dependent on the stiffness of the material, this is the precursor to elasticity imaging. The propagation of phi(r, tau) is described by a diffusion equation from which we have derived a nonlinear perturbation equation connecting p(r) and refractive index modulation [Delta n(r)] in the region of interest to M measured on the boundary. The nonlinear perturbation equation and its approximate linear counterpart are solved for the recovery of p(r). The numerical results reveal regions of different stiffness, proving that the present method recovers p(r) with reasonable quantitative accuracy and spatial resolution. (C) 2011 Optical Society of America

Kinetics of Sulphation of Nickel and Cobalt Ferrites with Na$O, Melt Containing F'e3+ Ions

It has been experimentally established that nickel and cobalt can be extracted from their ferrites with sodium sulphate melt containing femc ions. The kinetics of extraction from synthetic ferrites using a melt of sodium and ferric sulphates of eutectic composition has been studied as a function of the particle size of the ferrite and temperature in the range 900 to 1073 K. The divalent ions in the ferrite exchange with the ferric ion in the melt, leaving a residue of hematite.The rate of reaction conforms to the Crank-Ginstling-Brounshtein diffusion model. The reaction rate is governed by the counter-diffusion of ~ e an~d ~+i ' +(or co2+) ions in the hematite lattice. Analytical expressions for the rate constants have been derived from the experimental data as a function of particle size and temperature. The activation energy for the extraction of nickel from nickel ferrite is 154(+10) kJ mol-' and the corresponding value for cobalt is 142(+10)kJ mol;'. In sulphation roasting of minerals containing nickel, the yield of nickel is generally limited to 75% due to the formation of insoluble ferrites. The use of melts based on sodium sulphate provides a possible route for enhancing the recovery of nickel to approximately 98%.

High-Rate Vector Quantization for Noisy Channels With Applications to Wideband Speech Spectrum Compression

This paper considers the high-rate performance of source coding for noisy discrete symmetric channels with random index assignment (IA). Accurate analytical models are developed to characterize the expected distortion performance of vector quantization (VQ) for a large class of distortion measures. It is shown that when the point density is continuous, the distortion can be approximated as the sum of the source quantization distortion and the channel-error induced distortion. Expressions are also derived for the continuous point density that minimizes the expected distortion. Next, for the case of mean squared error distortion, a more accurate analytical model for the distortion is derived by allowing the point density to have a singular component. The extent of the singularity is also characterized. These results provide analytical models for the expected distortion performance of both conventional VQ as well as for channel-optimized VQ. As a practical example, compression of the linear predictive coding parameters in the wideband speech spectrum is considered, with the log spectral distortion as performance metric. The theory is able to correctly predict the channel error rate that is permissible for operation at a particular level of distortion.

A Low ML-Decoding Complexity, Full-Diversity, Full-Rate MIMO Precoder

Precoding for multiple-input multiple-output (MIMO) antenna systems is considered with perfect channel knowledge available at both the transmitter and the receiver. For two transmit antennas and QAM constellations, a real-valued precoder which is approximately optimal (with respect to the minimum Euclidean distance between points in the received signal space) among real-valued precoders based on the singular value decomposition (SVD) of the channel is proposed. The proposed precoder is obtainable easily for arbitrary QAM constellations, unlike the known complex-valued optimal precoder by Collin et al. for two transmit antennas which is in existence for 4-QAM alone and is extremely hard to obtain for larger QAM constellations. The proposed precoding scheme is extended to higher number of transmit antennas on the lines of the E - d(min) precoder for 4-QAM by Vrigneau et al. which is an extension of the complex-valued optimal precoder for 4-QAM. The proposed precoder's ML-decoding complexity as a function of the constellation size M is only O(root M)while that of the E - d(min) precoder is O(M root M)(M = 4). Compared to the recently proposed X- and Y-precoders, the error performance of the proposed precoder is significantly better while being only marginally worse than that of the E - d(min) precoder for 4-QAM. It is argued that the proposed precoder provides full-diversity for QAM constellations and this is supported by simulation plots of the word error probability for 2 x 2, 4 x 4 and 8 x 8 systems.

Bayesian framework and message passing for joint support and signal recovery of approximately sparse signals

In this paper, we develop a low-complexity message passing algorithm for joint support and signal recovery of approximately sparse signals. The problem of recovery of strictly sparse signals from noisy measurements can be viewed as a problem of recovery of approximately sparse signals from noiseless measurements, making the approach applicable to strictly sparse signal recovery from noisy measurements. The support recovery embedded in the approach makes it suitable for recovery of signals with same sparsity profiles, as in the problem of multiple measurement vectors (MMV). Simulation results show that the proposed algorithm, termed as JSSR-MP (joint support and signal recovery via message passing) algorithm, achieves performance comparable to that of sparse Bayesian learning (M-SBL) algorithm in the literature, at one order less complexity compared to the M-SBL algorithm.

Power and Discrete Rate Adaptation for Energy Harvesting Wireless Nodes

Energy Harvesting (EH) nodes, which harvest energy from the environment in order to communicate over a wireless link, promise perpetual operation of a wireless network with battery-powered nodes. In this paper, we address the throughput optimization problem for a rate-adaptive EH node that chooses its rate from a set of discrete rates and adjusts its power depending on its channel gain and battery state. First, we show that the optimal throughput of an EH node is upper bounded by the throughput achievable by a node that is subject only to an average power constraint. We then propose a simple transmission scheme for an EH node that achieves an average throughput close to the upper bound. The scheme's parameters can be made to account for energy overheads such as battery non-idealities and the energy required for sensing and processing. The effect of these overheads on the average throughput is also analytically characterized.

Maximum rate of 3- and 4-real-symbol ML decodable unitary weight STBCs

It has been shown recently that the maximum rate of a 2-real-symbol (single-complex-symbol) maximum likelihood (ML) decodable, square space-time block codes (STBCs) with unitary weight matrices is 2a/2a complex symbols per channel use (cspcu) for 2a number of transmit antennas [1]. These STBCs are obtained from Unitary Weight Designs (UWDs). In this paper, we show that the maximum rates for 3- and 4-real-symbol (2-complex-symbol) ML decodable square STBCs from UWDs, for 2a transmit antennas, are 3(a-1)/2a and 4(a-1)/2a cspcu, respectively. STBCs achieving this maximum rate are constructed. A set of sufficient conditions on the signal set, required for these codes to achieve full-diversity are derived along with expressions for their coding gain.

Maximum Rate of Unitary-Weight, Single-Symbol Decodable STBCs

It is well known that the space-time block codes (STBCs) from complex orthogonal designs (CODs) are single-symbol decodable/symbol-by-symbol decodable (SSD). The weight matrices of the square CODs are all unitary and obtainable from the unitary matrix representations of Clifford Algebras when the number of transmit antennas n is a power of 2. The rate of the square CODs for n = 2(a) has been shown to be a+1/2(a) complex symbols per channel use. However, SSD codes having unitary-weight matrices need not be CODs, an example being the minimum-decoding-complexity STBCs from quasi-orthogonal designs. In this paper, an achievable upper bound on the rate of any unitary-weight SSD code is derived to be a/2(a)-1 complex symbols per channel use for 2(a) antennas, and this upper bound is larger than that of the CODs. By way of code construction, the interrelationship between the weight matrices of unitary-weight SSD codes is studied. Also, the coding gain of all unitary-weight SSD codes is proved to be the same for QAM constellations and conditions that are necessary for unitary-weight SSD codes to achieve full transmit diversity and optimum coding gain are presented.

Polycrystal versus single-crystal strain rate sensitivity of cadmium

Taking polycrystalline cadmium as an example and by utilizing the predicted temperature or strain rate-dependence of the (Hall-Petch) stress-grain size parameters, a reasonably quantitative explanation is given for the grain size dependence of apparent activation volume measurements. The explanation involves the theoretical relation of these measurements to single-crystal measurements.

Distributed Function Computation over Fields and Rings via Linear Compression of Sources

The setting considered in this paper is one of distributed function computation. More specifically, there is a collection of N sources possessing correlated information and a destination that would like to acquire a specific linear combination of the N sources. We address both the case when the common alphabet of the sources is a finite field and the case when it is a finite, commutative principal ideal ring with identity. The goal is to minimize the total amount of information needed to be transmitted by the N sources while enabling reliable recovery at the destination of the linear combination sought. One means of achieving this goal is for each of the sources to compress all the information it possesses and transmit this to the receiver. The Slepian-Wolf theorem of information theory governs the minimum rate at which each source must transmit while enabling all data to be reliably recovered at the receiver. However, recovering all the data at the destination is often wasteful of resources since the destination is only interested in computing a specific linear combination. An alternative explored here is one in which each source is compressed using a common linear mapping and then transmitted to the destination which then proceeds to use linearity to directly recover the needed linear combination. The article is part review and presents in part, new results. The portion of the paper that deals with finite fields is previously known material, while that dealing with rings is mostly new.Attempting to find the best linear map that will enable function computation forces us to consider the linear compression of source. While in the finite field case, it is known that a source can be linearly compressed down to its entropy, it turns out that the same does not hold in the case of rings. An explanation for this curious interplay between algebra and information theory is also provided in this paper.

High Rate Capability Lithium Iron Phosphate Wired by Carbon Nanotubes and Galvanostatic Transformed to Graphitic Carbon

Lithium iron phosphate (LiFePO4) electronically wired by multi-walled carbon nanotubes (MWCNTs) and in-situ transformed graphitic carbon for lithium-ion batteries are discussed here. Presence of MWCNTs up to a maximum of 0.5% in porous LiFePO4 (abbreviated as LFP-CNT) resulted in remarkable reversible cyclability and rate capability compared to LFP coated with highly disordered carbon (abbreviated as LFP-C). In the current range (30-1500) mAg(-1), specific capacity of LFP-CNT (approximate to 150-50 mAhg(-1)) is observed to be always higher compared to LFP-C (approximate to 120-0 mAhg(-1)). At higher currents of 250-1500 mAg(-1) LFP-C performed poorly compared to LFP-CNT. LFP-C showed considerable decay in capacity with increase in cycle number at intermediate high currents (approximate to 250 mAg(-1)) whereas at very high currents (approximate to 750 mAg(-1)) it is nearly zero. The LFP-CNT showed no such detrimental behavior in battery performance. The exemplary performance of the LFP-CNT is attributed to combination of both enhanced LFP structural stability, as revealed by Raman spectra and formation of an efficient percolative network of carbon nanotubes which during the course of galvanostatic cycling gets gradually transformed to graphitic carbon. (C) 2012 The Electrochemical Society. [DOI: 10.1149/2.015204jes] All rights reserved.

New Insights into Optimal Discrete Rate Adaptation for Average Power Constrained Single and Multi-Node Systems

The throughput-optimal discrete-rate adaptation policy, when nodes are subject to constraints on the average power and bit error rate, is governed by a power control parameter, for which a closed-form characterization has remained an open problem. The parameter is essential in determining the rate adaptation thresholds and the transmit rate and power at any time, and ensuring adherence to the power constraint. We derive novel insightful bounds and approximations that characterize the power control parameter and the throughput in closed-form. The results are comprehensive as they apply to the general class of Nakagami-m (m >= 1) fading channels, which includes Rayleigh fading, uncoded and coded modulation, and single and multi-node systems with selection. The results are appealing as they are provably tight in the asymptotic large average power regime, and are designed and verified to be accurate even for smaller average powers.