Interplay Between Optimal Selection Scheme, Selection Criterion, and Discrete Rate Adaptation in Opportunistic Wireless Systems

An opportunistic, rate-adaptive system exploits multi-user diversity by selecting the best node, which has the highest channel power gain, and adapting the data rate to selected node's channel gain. Since channel knowledge is local to a node, we propose using a distributed, low-feedback timer backoff scheme to select the best node. It uses a mapping that maps the channel gain, or, in general, a real-valued metric, to a timer value. The mapping is such that timers of nodes with higher metrics expire earlier. Our goal is to maximize the system throughput when rate adaptation is discrete, as is the case in practice. To improve throughput, we use a pragmatic selection policy, in which even a node other than the best node can be selected. We derive several novel, insightful results about the optimal mapping and develop an algorithm to compute it. These results bring out the inter-relationship between the discrete rate adaptation rule, optimal mapping, and selection policy. We also extensively benchmark the performance of the optimal mapping with several timer and opportunistic multiple access schemes considered in the literature, and demonstrate that the developed scheme is effective in many regimes of interest.

On the sphere decoding complexity of high-rate multigroup decodable STBCs in asymmetric MIMO systems

A space-time block code (STBC) is said to be multigroup decodable if the information symbols encoded by it can be partitioned into two or more groups such that each group of symbols can be maximum-likelihood (ML) decoded independently of the other symbol groups. In this paper, we show that the upper triangular matrix encountered during the sphere decoding of a linear dispersion STBC can be rank-deficient even when the rate of the code is less than the minimum of the number of transmit and receive antennas. We then show that all known families of high-rate (rate greater than 1) multigroup decodable codes have rank-deficient matrix even when the rate is less than the number of transmit and receive antennas, and this rank-deficiency problem arises only in asymmetric MIMO systems when the number of receive antennas is strictly less than the number of transmit antennas. Unlike the codes with full-rank matrix, the complexity of the sphere decoding-based ML decoder for STBCs with rank-deficient matrix is polynomial in the constellation size, and hence is high. We derive the ML sphere decoding complexity of most of the known high-rate multigroup decodable codes, and show that for each code, the complexity is a decreasing function of the number of receive antennas.

Photoluminescence decay rate engineering of CdSe quantum dots in ensemble arrays embedded with gold nano-antennae

We discuss experimental results on the ability to significantly tune the photoluminescence decay rates of CdSe quantum dots embedded in an ordered template, using lightly doped small gold nanoparticles (nano-antennae), of relatively low optical efficiency. We observe both enhancement and quenching of photoluminescence intensity of the quantum dots varying monotonically with increasing volume fraction of added gold nanoparticles, with respect to undoped quantum dot arrays. However, the corresponding variation in lifetime of photoluminescence spectra decay shows a hitherto unobserved, non-monotonic variation with gold nanoparticle doping. We also demonstrate that Purcell effect is quite effective for the larger (5 nm) gold nano-antenna leading to more than four times enhanced radiative rate at spectral resonance, for largest doping and about 1.75 times enhancement for off-resonance. Significantly for spectral off-resonance samples, we could simultaneously engineer reduction of non-radiative decay rate along with increase of radiative decay rate. Non-radiative decay dominates the system for the smaller (2 nm) gold nano-antenna setting the limit on how small these plasmonic nano-antennae could be to be effective in engineering significant enhancement in radiative decay rate and, hence, the overall quantum efficiency of quantum dot based hybrid photonic assemblies.

Low loss waveguide on chalcogenide glass using ultrafast laser at low repetition rate

In this work, we synthesized bulk amorphous GeGaS glass by conventional melt quenching technique. Amorphous nature of the glass is confirmed using X-ray diffraction. We fabricated the channel waveguides on this glass using the ultrafast laser inscription technique. The waveguides are written on this glass 100 mu m below the surface of the glass with a separation of 50 ae m by focusing the laser beam into the material using 0.67 NA lens. The laser parameters are set to 350 fs pulse duration at 100 KHz repetition rate. A range of writing energies with translation speeds 1 mm/s, 2 mm/s, 3 mm/s and 4 mm/s were investigated. After fabrication the waveguides facets were ground and polished to the optical quality to remove any tapering of the waveguide close to the edges. We characterized the loss measurement by butt coupling method and the mode field image of the waveguides has been captured to compare with the mode field image of fibers. Also we compared the asymmetry in the shape of the waveguide and its photo structural change using Raman spectra.

An equivalent undercooling model to account for flow effect on binary alloy dendrite growth rate

A theoretical analysis is carried out to observe the influence of important flow parameters such as Nusselt number and Sherwood number on the tip speed of an equiaxed dendrite growing in a convecting alloy melt. The effect of thermal and solutal transfer at the interface due to convection is equated to an undercooling of the melt, and an expression is derived for this equivalent undercooling in terms of the flow Nusselt number and Sherwood number. Results for the equivalent undercooling are compared with corresponding numerical values obtained by performing simulations based on the enthalpy method. This method represents a relatively simple procedure to analyze the effects of melt convection on the growth rate of dendrites. (C) 2013 Elsevier Ltd. All rights reserved.

Effect of side confining walls on the growth rate of compressible mixing layers

Model free simulations are performed to study the effect of the presence of side wall in compressible mixing of two parallel dissimilar gaseous streams with significant temperature difference. The turbulence statistics shows the three dimensional nature of the flow with and without the presence of side walls. The presence of side wall neither makes the flow field two dimensional, nor suppresses three dimensional disturbances. However, the comparison of shear layer growth rate and wall pressures reveal a better match with the two dimensional simulation results. This better match is explained on the basis of formation of oblique structures due to the presence of side walls which also suppress the distribution of momentum in third direction making the pressures to be higher as compared with the case without side walls. (C) 2013 Elsevier Ltd. All rights reserved.

Joint Evaluation of Reduced Feedback Scheme, Scheduling, and Rate Adaptation in OFDMA Systems with Feedback Delays

Orthogonal frequency division multiple access (OFDMA) systems exploit multiuser diversity and frequency-selectivity to achieve high spectral efficiencies. However, they require considerable feedback for scheduling and rate adaptation, and are sensitive to feedback delays. We develop a comprehensive analysis of the OFDMA system throughput as a function of the feedback scheme, frequency-domain scheduler, and discrete rate adaptation rule in the presence of feedback delays. We analyze the popular best-n and threshold-based feedback schemes. We show that for both the greedy and round-robin schedulers, the throughput degradation, given a feedback delay, depends primarily on the fraction of feedback reduced by the feedback scheme and not the feedback scheme itself. Even small feedback delays at low vehicular speeds are shown to significantly degrade the throughput. We also show that optimizing the link adaptation thresholds as a function of the feedback delay can effectively counteract the detrimental effect of delays.

Employing synergistic interactions between few-layer WS2 and reduced graphene oxide to improve lithium storage, cyclability and rate capability of Li-ion batteries

The aim of the contribution is to introduce a high performance anode alternative to graphite for lithium-ion batteries (LiBs). A simple process was employed to synthesize uniform graphene-like few-layer tungsten sulfide (WS2) supported on reduced graphene oxide (RGO) through a hydrothermal synthesis route. The WS2-RGO (80:20 and 70:30) composites exhibited good enhanced electrochemical performance and excellent rate capability performance when used as anode materials for lithium-ion batteries. The specific capacity of the WS2-RGO composite delivered a capacity of 400-450 mAh g(-1) after 50 cycles when cycled at a current density of 100 mA g(-1). At 4000 mA g(-1), the composites showed a stable capacity of approximately 180-240 mAh g(-1), respectively. The noteworthy electrochemical performance of the composite is not additive, rather it is synergistic in the sense that the electrochemical performance is much superior compared to both WS2 and RGO. As the observed lithiation/delithiation for WS2-RGO is at a voltage 1.0 V (approximate to 0.1 V for graphite, Li* /Li), the lithium-ion battery with WS2-RGO is expected to possess high interface stability, safety and management of electrical energy is expected to be more efficient and economic. (C) 2013 Elsevier Ltd. All rights reserved.

Achievable secrecy sum-rate in a fading MAC-WT with power control and without CSI of eavesdropper

We consider a two user fading Multiple Access Channel with a wire-tapper (MAC-WT) where the transmitter has the channel state information (CSI) to the intended receiver but not to the eavesdropper (eve). We provide an achievable secrecy sum-rate with optimal power control. We next provide a secrecy sum-rate with optimal power control and cooperative jamming (CJ). We then study an achievable secrecy sum rate by employing an ON/OFF power control scheme which is more easily computable. We also employ CJ over this power control scheme. Results show that CJ boosts the secrecy sum-rate significantly even if we do not know the CSI of the eve's channel. At high SNR, the secrecy sum-rate (with CJ) without CSI of the eve exceeds the secrecy sum-rate (without CJ) with full CSI of the eve.

Nanoindentation behavior of nanotwinned Cu: Influence of indenter angle on hardness, strain rate sensitivity and activation volume

The influence of strain on the mechanical properties and deformation kinetic parameters of nanotwinned (at) copper is investigated by a series of nanoindentation experiments, which were performed by employing sharp indenters with five varying centerline-to-face angles (psi). Comparison experiments were also conducted on (1 1 0) single crystalline Cu. Experimental results indicate that, unlike coarsegrained materials, nt-Cu is prone to plastic flow softening with large material pile-up around the indentation impression at high levels of strains. Localized detwinning becomes more significant with decreasing psi, concomitant with reduced strain-rate sensitivity (m) and enhanced activation volume (V*). The m of nt-Cu is found to depend sensitively on psi with a variation of more than a factor of 3, whereas V* exhibits a much less sensitive trend. This paper discusses the validation of the experimental techniques and the implications of various deformation kinetic parameters on the underlying deformation mechanisms of nt-Ca. 2013 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Full-rate full-diversity finite feedback space-time schemes with minimum feedback and transmission duration

A Finite Feedback Scheme (FFS) for a quasi-static MIMO block fading channel with finite N-ary delay-free noise-free feedback consists of N Space-Time Block Codes (STBCs) at the transmitter, one corresponding to each possible value of feedback, and a function at the receiver that generates N-ary feedback. A number of FFSs are available in the literature that provably attain full-diversity. However, there is no known full-diversity criterion that universally applies to all FFSs. In this paper a universal necessary condition for any FFS to achieve full-diversity is given, and based on this criterion the notion of Feedback-Transmission duration optimal (FT-optimal) FFSs is introduced, which are schemes that use minimum amount of feedback N for the given transmission duration T, and minimum T for the given N to achieve full-diversity. When there is no feedback (N = 1) an FT-optimal scheme consists of a single STBC, and the proposed condition reduces to the well known necessary and sufficient condition for an STBC to achieve full-diversity. Also, a sufficient criterion for full-diversity is given for FFSs in which the component STBC yielding the largest minimum Euclidean distance is chosen, using which full-rate (N-t complex symbols per channel use) full-diversity FT-optimal schemes are constructed for all N-t > 1. These are the first full-rate full-diversity FFSs reported in the literature for T < N-t. Simulation results show that the new schemes have the best error performance among all known FFSs.

Functional analysis of ultra high information rates conveyed by rat vibrissal primary afferents

Sensory receptors determine the type and the quantity of information available for perception. Here, we quantified and characterized the information transferred by primary afferents in the rat whisker system using neural system identification. Quantification of ``how much'' information is conveyed by primary afferents, using the direct method (DM), a classical information theoretic tool, revealed that primary afferents transfer huge amounts of information (up to 529 bits/s). Information theoretic analysis of instantaneous spike-triggered kinematic stimulus features was used to gain functional insight on ``what'' is coded by primary afferents. Amongst the kinematic variables tested-position, velocity, and acceleration-primary afferent spikes encoded velocity best. The other two variables contributed to information transfer, but only if combined with velocity. We further revealed three additional characteristics that play a role in information transfer by primary afferents. Firstly, primary afferent spikes show preference for well separated multiple stimuli (i.e., well separated sets of combinations of the three instantaneous kinematic variables). Secondly, neurons are sensitive to short strips of the stimulus trajectory (up to 10 ms pre-spike time), and thirdly, they show spike patterns (precise doublet and triplet spiking). In order to deal with these complexities, we used a flexible probabilistic neuron model fitting mixtures of Gaussians to the spike triggered stimulus distributions, which quantitatively captured the contribution of the mentioned features and allowed us to achieve a full functional analysis of the total information rate indicated by the DM. We found that instantaneous position, velocity, and acceleration explained about 50% of the total information rate. Adding a 10 ms pre-spike interval of stimulus trajectory achieved 80-90%. The final 10-20% were found to be due to non-linear coding by spike bursts.

Diversity order vs rate in an AWGN channel

We study the diversity order vs rate of an additive white Gaussian noise (AWGN) channel in the whole capacity region. We show that for discrete input as well as for continuous input, Gallager's upper bounds on error probability have exponential diversity in low and high rate region but only subexponential in the mid-rate region. For the best available lower bounds and for the practical codes one observes exponential diversity throughout the capacity region. However we also show that performance of practical codes is close to Gallager's upper bounds and the mid-rate subexponential diversity has a bearing on the performance of the practical codes. Finally we show that the upper bounds with Gaussian input provide good approximation throughout the capacity region even for finite constellation.

Achievable rate region of gaussian broadcast channel with finite input alphabet and quantized output

In this paper, we study the achievable rate region of two-user Gaussian broadcast channel (GBC) when the messages to be transmitted to both the users take values from finite signal sets and the received signal is quantized at both the users. We refer to this channel as quantized broadcast channel (QBC). We first observe that the capacity region defined for a GBC does not carry over as such to QBC. Also, we show that the optimal decoding scheme for GBC (i.e., high SNR user doing successive decoding and low SNR user decoding its message alone) is not optimal for QBC. We then propose an achievable rate region for QBC based on two different schemes. We present achievable rate region results for the case of uniform quantization at the receivers. We find that rotation of one of the user's input alphabet with respect to the other user's alphabet marginally enlarges the achievable rate region of QBC when almost equal powers are allotted to both the users.

Delay optimal scheduling of a discrete-time batch service queue for point-to-point channel code rate selection

We consider the problem of characterizing the minimum average delay, or equivalently the minimum average queue length, of message symbols randomly arriving to the transmitter queue of a point-to-point link which dynamically selects a (n, k) block code from a given collection. The system is modeled by a discrete time queue with an IID batch arrival process and batch service. We obtain a lower bound on the minimum average queue length, which is the optimal value for a linear program, using only the mean (λ) and variance (σ2) of the batch arrivals. For a finite collection of (n, k) codes the minimum achievable average queue length is shown to be Θ(1/ε) as ε ↓ 0 where ε is the difference between the maximum code rate and λ. We obtain a sufficient condition for code rate selection policies to achieve this optimal growth rate. A simple family of policies that use only one block code each as well as two other heuristic policies are shown to be weakly optimal in the sense of achieving the 1/ε growth rate. An appropriate selection from the family of policies that use only one block code each is also shown to achieve the optimal coefficient σ2/2 of the 1/ε growth rate. We compare the performance of the heuristic policies with the minimum achievable average queue length and the lower bound numerically. For a countable collection of (n, k) codes, the optimal average queue length is shown to be Ω(1/ε). We illustrate the selectivity among policies of the growth rate optimality criterion for both finite and countable collections of (n, k) block codes.